Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "\"\"\"\r\n author: Newplayers12\r\n created: Friday 06-08-2021 08:24:19\r\n\"\"\"\r\nimport queue\r\nimport math\r\n\r\ndef findSet(x):\r\n if (parent[x] != x):\r\n parent[x] = findSet(parent[x])\r\n return parent[x]\r\n\r\ndef unionSet(a, b):\r\n pa = findSet(a)\r\n pb = findSet(b)\r\n parent[pa] = pb\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\nn, m = inp()\r\nif (n != m):\r\n print('NO')\r\n exit()\r\n\r\nparent = [i for i in range(n)]\r\n\r\nfor i in range(m):\r\n u, v = inp()\r\n u -= 1\r\n v -= 1\r\n unionSet(u, v)\r\ndem = 0\r\nfor i in range(n):\r\n if (i == parent[i]):\r\n dem += 1\r\nprint('FHTAGN!' if dem == 1 else 'NO')", "parent = dict()\r\nranks = dict()\r\n\r\n\r\ndef make_set(N):\r\n global parent, ranks\r\n parent = [i for i in range(N + 5)]\r\n ranks = [0 for i in range(N + 5)]\r\n\r\n\r\ndef find_set(u):\r\n if parent[u] != u:\r\n parent[u] = find_set(parent[u])\r\n return parent[u]\r\n\r\n\r\ndef union_set(u, v):\r\n up = find_set(u)\r\n vp = find_set(v)\r\n\r\n if up == vp:\r\n return\r\n if ranks[up] > ranks[vp]:\r\n parent[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parent[up] = vp\r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\n\r\nm, n = map(int, input().split())\r\nif m != n:\r\n print('NO')\r\n exit()\r\n\r\nmake_set(m)\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n union_set(a, b)\r\n\r\ntop_parent = find_set(1)\r\nfor i in range(2, m):\r\n if find_set(i) != top_parent:\r\n print('NO')\r\n exit()\r\n\r\nprint('FHTAGN!')\r\n", "n,m=map(int,input().split())\nt=[]\nl=[]\nl.append(1)\ndef hambandi(q):\n for k in t[q]:\n if(not(k in l)):\n l.append(k)\n hambandi(k)\n \nif(n!=m):\n print('NO')\nelse:\n for i in range(n+1):\n t.append([])\n for kl in range(m):\n a,b=map(int,input().split())\n t[a].append(b)\n t[b].append(a)\n hambandi(1)\n if(len(l)==n):\n print('FHTAGN!')\n else:\n print('NO')\n\n\n\n\n\n\n\n\n \n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(a, b):\r\n global c, x\r\n x[a] = 2\r\n for i in d[a]:\r\n if i != b and x[i] == 2:\r\n c += 1\r\n elif x[i] == 0:\r\n f(i, a)\r\n x[a] = 1\r\n\r\n\r\nn, m = map(int, input().split())\r\nd = [[] for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(lambda x:int(x)-1, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\n\r\nx = [0]*n\r\nc = 0\r\nf(0, -1)\r\nif c == 1 and sum(x) == n:\r\n print(\"FHTAGN!\")\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\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef get_size(s):\r\n return size[get_root(s)]\r\n\r\nn, m = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\nroot = [i for i in range(n + 1)]\r\nrank = [1 for _ in range(n + 1)]\r\nsize = [1 for _ in range(n + 1)]\r\nc = 0\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if same(x, y):\r\n c += 1\r\n unite(x, y)\r\nans = \"FHTAGN!\" if not c ^ 1 and not n ^ m else \"NO\"\r\nprint(ans)", "#https://codeforces.com/problemset/problem/104/C\r\n#F\r\n\r\n'''\r\nn, m = list(map(int, input().split()))\r\n\r\n\r\nmatriz = [[0]*n for i in range(max(n, m))]\r\nvalues = [list(map(int, input().split())) for i in range(m)]\r\n\r\nfor i in values:\r\n matriz[i[0] - 1][i[1] - 1] = 1\r\n\r\nfor i in matriz:\r\n print(i)\r\n\r\nlista = []\r\nfor l in range(m):\r\n i = matriz[l][:]\r\n for k in range(n):\r\n if i[k] and i[k - 1] and k - 1 >= 0:\r\n if matriz[l - 1][k] == 1 or matriz[l - 1][k - 1] == 1:\r\n exit(print(\"FHTAGN!\"))\r\n\r\nprint(\"NO\")\r\n'''\r\nn, m = map(int, input().split())\r\nadjacency_list = [[] for _ in range(n + 1)]\r\nvisited = set()\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n adjacency_list[x].append(y)\r\n adjacency_list[y].append(x)\r\n\r\ndef dfs(node):\r\n visited.add(node)\r\n for neighbor in adjacency_list[node]:\r\n if neighbor not in visited:\r\n dfs(neighbor)\r\n\r\ndfs(1)\r\n\r\nif n < 3 or n != m or len(visited) != n:\r\n print(\"NO\")\r\nelse:\r\n print(\"FHTAGN!\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\n\r\ndef makeSet(n):\r\n global parent, ranks\r\n parent = [i for i in range (n + 1)]\r\n ranks = [0 for i in range(n + 1)]\r\n\r\ndef findSet(u):\r\n if u != parent[u]:\r\n parent[u] = findSet(parent[u])\r\n return parent[u]\r\n \r\n # 4\r\n # |\r\n # 3 \r\n # / \\ \r\n # 1 - 2 - 5 - 6\r\n \r\n # N == M\r\n # 1 group\r\n \r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if up == vp:\r\n return\r\n if ranks[up] > ranks[vp]: \r\n parent[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parent[up] = vp\r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\nn, m = map(int, input().split())\r\nif n != m:\r\n print('NO')\r\nelse:\r\n makeSet(n)\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n unionSet(u, v)\r\n no_group = 0\r\n for i in range(1, n + 1):\r\n if parent[i] == i:\r\n no_group += 1\r\n print(\"FHTAGN!\" if no_group == 1 else \"NO\")\r\n", "class Graph:\r\n def __init__(self, n):\r\n self.n = n\r\n self.adj = [[] for i in range(n)]\r\n def add(self, v, u):\r\n self.adj[v].append(u)\r\n self.adj[u].append(v)\r\n\r\nn, m = map(int, input().split())\r\ng = Graph(n)\r\nfor i in range(m):\r\n v, u = map(int, input().split())\r\n g.add(v - 1, u - 1)\r\n\r\nflag1 = True\r\nflag2 = True\r\n\r\nif n != m:\r\n flag1 = False\r\n\r\nused = [False for i in range(n)]\r\n\r\ndef dfs(v):\r\n used[v] = True\r\n for u in g.adj[v]:\r\n if used[u]:\r\n continue\r\n dfs(u)\r\ndfs(0)\r\nfor v in range(n):\r\n if not used[v]:\r\n flag2 = False\r\n\r\nif flag1 and flag2:\r\n print(\"FHTAGN!\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ndef dfs(u):\r\n\tvis[u]=1\r\n\tfor v in adj[u]:\r\n\t\tif vis[v]==0:\r\n\t\t\tdfs(v)\r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\nvis=[0]*n\r\n\r\n\r\nadj=[[] for w in range(n)]\r\n\r\nfor i in range (m):\r\n\tu,v = map(int,input().split())\r\n\tu-=1\r\n\tv-=1\r\n\tadj[u].append(v)\r\n\tadj[v].append(u)\r\n\r\ncnt=0\r\nfor i in range(0,n-1):\r\n\tif vis[i]==0:\r\n\t\tdfs(i)\r\n\t\tcnt+=1\r\n\r\nif cnt==1 and n==m:\r\n\tprint('FHTAGN!')\r\nelse:\r\n\tprint('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def read_input():\r\n global n, m, edge\r\n n, m = map(int, input().split())\r\n edge = []\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n edge.append((u-1, v-1))\r\n\r\n\r\ndef init():\r\n global lab\r\n lab = [-1] * n\r\n\r\ndef find_set(u):\r\n global lab\r\n if lab[u] < 0:\r\n return u\r\n lab[u] = find_set(lab[u])\r\n return lab[u]\r\n\r\n\r\ndef union(r,s):\r\n global lab\r\n lab[r] = s\r\n\r\ndef solve():\r\n global edge, cc\r\n init()\r\n cc = n\r\n for e in edge:\r\n r = find_set(e[0])\r\n s = find_set(e[1])\r\n if r != s:\r\n union(r, s)\r\n cc -= 1\r\n if cc == 1 and m==n:\r\n print(\"FHTAGN!\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == '__main__':\r\n read_input()\r\n solve()\r\n", "n, m = [int(n) for n in input().split()]\r\n\r\ngraph = {}\r\nfor i in range(1, n + 1):\r\n graph[i] = []\r\n\r\nfor i in range(m):\r\n a, b = [int(n) for n in input().split()]\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nvisited_nodes = set()\r\ncycles = 0\r\n\r\n\r\ndef visit_node(v):\r\n global cycles\r\n if v in visited_nodes:\r\n cycles += 1\r\n return\r\n visited_nodes.add(v)\r\n for new_v in graph[v]:\r\n graph[new_v].remove(v)\r\n visit_node(new_v)\r\n\r\n\r\nvisit_node(1)\r\n\r\nif len(visited_nodes) == n and cycles == 1:\r\n print(\"FHTAGN!\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin,stdout,setrecursionlimit\r\nsetrecursionlimit(10**4)\r\nfrom collections import defaultdict\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\ndef dfs(src,par):\r\n global remu,remv\r\n vis[src]=1\r\n for neigh in g[src]:\r\n if vis[neigh] or neigh==par:continue\r\n if (src==remu and neigh==remv) or (neigh==remu and src==remv):continue\r\n dfs(neigh,src)\r\nfor _ in range(1):#nmbr()):\r\n n,eg=lst();f1=0\r\n if eg!=n:\r\n print('NO')\r\n continue\r\n g=defaultdict(set)\r\n l=[]\r\n for i in range(eg):\r\n u,v=lst()\r\n g[u].add(v)\r\n g[v].add(u)\r\n l+=[[u,v]]\r\n for ru,rv in l:\r\n f=1\r\n vis = [0] * (1 + n)\r\n remu,remv=ru,rv\r\n dfs(1,-1)\r\n for v in vis[1:]:\r\n if v==0:\r\n f=0\r\n break\r\n if f:\r\n f1=1\r\n break\r\n print('FHTAGN!' if f1 else 'NO')", "import collections\r\ndef dfs(graph, start):\r\n stack = collections.deque()\r\n stack.appendleft(start)\r\n while stack:\r\n vertex = stack.pop()\r\n visited[vertex]=True\r\n for neighbor in graph[vertex]:\r\n if visited[neighbor]==False:\r\n stack.appendleft(neighbor)\r\na,b=map(int,input().split())\r\nif b!=a:\r\n print ('NO')\r\nelse:\r\n visited=[False]*a\r\n lis=[[] for i in range (a)]\r\n for i in range (b):\r\n x,y=map(int, input().split())\r\n lis[x-1].append(y-1)\r\n lis[y-1].append(x-1)\r\n dfs(lis, 0)\r\n if False in visited:\r\n print ('NO')\r\n else:\r\n print ('FHTAGN!')\r\n", "def find(node):\r\n while p[node] != node:\r\n p[node] = p[p[node]]\r\n node = p[node]\r\n return node\r\ndef union(n1,n2):\r\n a1 = find(n1)\r\n a2 = find(n2)\r\n\r\n if a1 != a2: p[a1] = a2\r\n\r\n\r\nn,m = map(int,input().split())\r\np = [i for i in range(n+1)]\r\ncnt = 0\r\nfor _ in range(m):\r\n a,b = map(int,input().split())\r\n if find(a) == find(b): cnt += 1\r\n union(a,b)\r\n\r\ncnt2 = 0\r\nfor i in range(1,n+1):\r\n if p[i] == i:\r\n cnt2 += 1\r\nif cnt == 1 and cnt2 == 1:\r\n print('FHTAGN!')\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def bfs(start):\r\n used[start] = 0\r\n q, it = [start], 0\r\n cycle = 0\r\n\r\n while it != len(q):\r\n k = q[it]\r\n for u in g[k]:\r\n if used[u] == -1:\r\n q.append(u)\r\n used[u] = k\r\n else:\r\n if u != used[k]:\r\n cycle += 1\r\n it += 1\r\n\r\n return cycle\r\n\r\n n, m = map(int, input().split())\r\n g = [[] for i in range(n)]\r\n\r\n for i in range(m):\r\n v, u = map(int, input().split())\r\n g[v - 1].append(u - 1)\r\n g[u - 1].append(v - 1)\r\n\r\n used = [-1 for i in range(n)]\r\n c = bfs(0) // 2\r\n\r\n if c == 1 and -1 not in used:\r\n print(\"FHTAGN!\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "def solve():\r\n\tn,m = map(int,input().split())\r\n\tcolor = [0 for _ in range(n+1)]\r\n\tedges = [[] for _ in range(n+1)]\r\n\tvisited = [False for _ in range(n+1)]\r\n\r\n\tfor _ in range(m):\r\n\t\tu,v = map(int,input().split())\r\n\t\tedges[u].append(v)\r\n\t\tedges[v].append(u)\r\n\r\n\r\n\tstack = list()\r\n\tstack.append(1)\r\n\r\n\twhile stack:\r\n\t\tcur = stack.pop()\r\n\t\tvisited[cur] = True \r\n\r\n\t\tfor child in edges[cur]:\r\n\t\t\tif not visited[child]:\r\n\t\t\t\tstack.append(child)\r\n\t\t\t\tvisited[child] = True \r\n\r\n\tfor i in range(1,n+1):\r\n\t\tif not visited[i] or n!=m:\r\n\t\t\tprint('NO')\r\n\t\t\treturn \r\n\r\n\r\n\tprint('FHTAGN!')\r\n\r\nsolve()", "#https://codeforces.com/problemset/problem/104/C\r\n#F\r\n#aceito\r\nn, m = map(int, input().split())\r\nadjacency_list = [[] for _ in range(n + 1)]\r\nvisited = set()\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n adjacency_list[x].append(y)\r\n adjacency_list[y].append(x)\r\n\r\ndef dfs(node):\r\n visited.add(node)\r\n for neighbor in adjacency_list[node]:\r\n if neighbor not in visited:\r\n dfs(neighbor)\r\n\r\ndfs(1)\r\nprint([\"FHTAGN!\", \"NO\"][n < 3 or n != m or len(visited) != n])\r\n\r\n'''\r\nif n < 3 or n != m or len(visited) != n:\r\n print(\"NO\")\r\nelse:\r\n print(\"FHTAGN!\")\r\n'''\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python3\r\n\r\nn, m = map(int, input().rstrip().split())\r\nadj = [[] for i in range(n+1)]\r\nvis = [False for i in range(n+1)]\r\n\r\nfor i in range(m):\r\n u, v = map(int, input().rstrip().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\n\r\ndef dfs(cur):\r\n cnt = 1\r\n vis[cur] = True\r\n for nxt in adj[cur]:\r\n if not vis[nxt]:\r\n cnt += dfs(nxt)\r\n\r\n return cnt\r\n\r\n\r\nif n != m or dfs(1) != n:\r\n print(\"NO\")\r\nelse:\r\n print(\"FHTAGN!\")\r\n", "\ndef func(n):\n global a, b, c, lst\n a[n] = 1\n for j in lst[n]:\n if a[j] == 1 and b[n] != j:\n c += 1\n if(not a[j]):\n b[j] = n\n func(j)\n a[n] = 2\n\nn , m = [int(x) for x in input().split()]\nlst = [[] for i in range(n +1)]\n\nfor i in range(m):\n x , y = map(int, input().split())\n lst[x].append(y)\n lst[y].append(x)\n\n\na = [0]*(n+1)\nb = [0]*(n+1)\nc = 0\n \nfunc(1)\nif c -1 or 0 in a[1: ]:\n print(\"NO\")\nelse:\n print(\"FHTAGN!\")\n", "#!/usr/bin/python3\n# B - Cthulhu\nimport sys\n\ndef dfs(curvertex):\n\tvisited[curvertex] = 1\n\tfor v in adjlist[curvertex]:\n\t\tif visited[v] == 0:\n\t\t\tdfs(v)\n\n\t\nn, m = [int(x) for x in input().split()]\nif n != m:\n\tprint(\"NO\")\n\tsys.exit()\nadjlist = [[] for x in range(n)]\nvisited = [0]*n\nfor i in range(m):\n\tx, y = [int(x) for x in input().split()]\n\tx -= 1\n\ty -= 1\n\tadjlist[x].append(y)\n\tadjlist[y].append(x)\n\ndfs(0)\nif 0 not in visited:\n\tprint(\"FHTAGN!\")\nelse:\n\tprint (\"NO\")\n", "from collections import defaultdict\n\ndef dfs(root: int, edges: dict[int, list[int]], visited: set[int]=None):\n if visited is None:\n visited = set()\n\n if root in visited:\n return\n\n visited.add(root) \n\n for node in edges[root]:\n dfs(node, edges, visited)\n\n return visited\n\ndef solve():\n n, m = map(int, input().split())\n\n if n != m:\n print(\"NO\")\n return\n\n edges = defaultdict(list) \n\n for _ in range(m):\n u, v = map(int, input().split())\n edges[u].append(v)\n edges[v].append(u)\n\n visited = dfs(1, edges)\n\n if visited == set(range(1, n + 1)):\n print(\"FHTAGN!\")\n else:\n print(\"NO\")\n\nsolve()", "\r\n#?\t\t /\\_/\\\r\n#?\t\t(= ._.)\r\n#?\t\t/ >WA \\>AC\r\n#// WELCOME TO MY CODING SPACE\r\n#! Filename: nhap.py\r\n#? Author: TranDucTri2003\r\n#* CreatedAt: 2022-05-02 12:15:18\r\n\r\n\r\n\r\nfrom collections import defaultdict\r\nfrom heapq import heappop, heappush\r\n\r\nclass Graph:\r\n INF=10**9\r\n #Searching Algorithms: DFS, BFS\r\n def __init__(self):\r\n self.graph = defaultdict(list)\r\n\r\n def addEdge(self,u,v):\r\n self.graph[u].append(v)\r\n self.graph[v].append(u)\r\n \r\n\r\n def numCycle(self,vertex):\r\n path=[]\r\n stack=[vertex]\r\n visited=defaultdict(lambda:0)\r\n ancestor=defaultdict(lambda:0)\r\n num=0\r\n while len(stack):\r\n u=stack.pop()\r\n if visited[u]==0:\r\n path.append(u)\r\n visited[u]=1\r\n for neighbour in self.graph[u]:\r\n ancestor[neighbour]=u\r\n if visited[neighbour]==1: \r\n if ancestor[u]!=neighbour:\r\n num+=1\r\n else:\r\n stack.append(neighbour)\r\n return num\r\n\r\n \r\n\r\n def DFSUtilConnect(self, temp, v, visited):\r\n visited[v] = 1\r\n # Store the vertex to list\r\n temp.append(v)\r\n for neighbour in self.graph[v]:\r\n if visited[neighbour]==0:\r\n # Update the list\r\n temp = self.DFSUtilConnect(temp, neighbour, visited)\r\n return temp\r\n \r\n \r\n def connectedComponentsDFS(self,numVertex):\r\n path=[]\r\n visited=defaultdict(lambda:0)\r\n for vertex in range(1,numVertex+1):\r\n if visited[vertex] == 0:\r\n temp = []\r\n path.append(self.DFSUtilConnect(temp, vertex, visited))\r\n return path\r\n\r\nn,m=list(map(int,input().split()))\r\ng=Graph()\r\nfor i in range(m):\r\n u,v=list(map(int,input().split()))\r\n g.addEdge(u,v)\r\n\r\ncom=g.connectedComponentsDFS(n)\r\nif len(com)==1 and g.numCycle(1)==1:\r\n print(\"FHTAGN!\")\r\nelse:\r\n print(\"NO\")\r\n\r\n#Nếu đi đến một đỉnh mà đỉnh đó đã được thăm nhưng tổ tiên của nó không phải là đỉnh đó nghĩa là có chu trình", "from collections import defaultdict\r\n# your code goes here\r\nv=defaultdict(list)\r\n\r\nn,m=map(int,input().split())\r\nl=[0]*n\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n v[a-1].append(b-1)\r\n v[b-1].append(a-1)\r\n \r\n\r\n\t\r\n\t\r\n\t\r\n \r\n \r\nvis=[0]*n\r\n\r\ndef dfs(node):\r\n vis[node]=1\r\n \r\n \r\n for j in v[node]:\r\n if vis[j]==0:\r\n dfs(j)\r\n \r\n\r\n\r\nc=0\r\nfor i in range(n):\r\n if vis[i]==0:\r\n dfs(i) \r\n c+=1\r\nif c==1 and n==m:\r\n print('FHTAGN!')\r\nelse:\r\n print('NO')\r\n\r\n\t\t", "from collections import defaultdict\r\nfrom typing import List, Tuple\r\n\r\n\r\ndef solve(n: int, m: int, adj: List[Tuple[int, int]]) -> str:\r\n visited = [0] * n\r\n graph = defaultdict(list) # type: Dict[int, List[int]]\r\n for u, v in adj:\r\n graph[u - 1].append(v - 1)\r\n graph[v - 1].append(u - 1)\r\n stack = [0]\r\n while stack:\r\n curr_node = stack.pop()\r\n visited[curr_node] = 1\r\n for adj_node in graph[curr_node]:\r\n if not visited[adj_node]:\r\n stack.append(adj_node)\r\n if sum(visited) != n:\r\n return 'NO'\r\n elif n == m:\r\n return 'FHTAGN!'\r\n else:\r\n return 'NO'\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\nadj = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nprint(solve(n, m, adj))\r\n", "def main():\n def dfs(u):\n avail[u] = False\n for v in l[u]:\n if avail[v]:\n dfs(v)\n\n n, m = map(int, input().split())\n if m != n:\n return print(\"NO\")\n l = [[] for _ in range(m + 1)]\n for _ in range(m):\n a, b = map(int, input().split())\n l[a].append(b)\n l[b].append(a)\n avail = [True] * (n + 1)\n dfs(1)\n print((\"NO\", \"FHTAGN!\")[sum(avail) == 1])\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict,deque\r\nn,m=map(int,input().split())\r\ng=defaultdict(list)\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\nvisited=set()\r\ndef dfs(src):\r\n st=[src]\r\n visited.add(src)\r\n while len(st)>0:\r\n node=st.pop()\r\n for nbr in g[node]:\r\n if nbr not in visited:\r\n visited.add(nbr)\r\n st.append(nbr)\r\n return len(visited)==n\r\n \r\nver=dfs(1)\r\nif ver and n>=3 and n==m:print(\"FHTAGN!\")\r\nelse:print(\"NO\")", "def findSet(u):\r\n while u != parent[u]:\r\n u = parent[u]\r\n return u\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n parent[up] = vp\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n if n != m:\r\n print('NO')\r\n else:\r\n parent = [i for i in range(n + 1)]\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n unionSet(u, v)\r\n cnt = 0\r\n for i in range(1, n + 1):\r\n if parent[i] == i:\r\n cnt += 1\r\n if cnt == 1:\r\n print('FHTAGN!')\r\n else:\r\n print('NO')\r\n", "A, B=map(int,input().split())\r\nA_=[[] for i in range(A)]\r\nfor i in range(B):\r\n a, b=map(int,input().split())\r\n A_[b-1].append(a-1)\r\n A_[a-1].append(b-1)\r\ncolor=[0 for i in range(A)]\r\ndef dfs(a):\r\n global color\r\n color[a]=1\r\n for i in A_[a]:\r\n if color[i]==0:\r\n dfs(i)\r\ndfs(0)\r\nif sum(color)==A:\r\n if A==B:\r\n print('FHTAGN!')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = [i for i in range(n)]\r\n self.rank = [0 for i in range(n)]\r\n\r\n def union(self, u, v):\r\n up = self.find(u)\r\n vp = self.find(v)\r\n\r\n if up == vp:\r\n return\r\n \r\n if self.rank[up] == self.rank[vp]:\r\n self.parent[up] = vp\r\n self.rank[vp] += 1\r\n elif self.rank[up] < self.rank[vp]:\r\n self.parent[up] = vp\r\n else:\r\n self.parent[vp] = up\r\n \r\n def find(self, u):\r\n if u != self.parent[u]:\r\n self.parent[u] = self.find(self.parent[u])\r\n \r\n return self.parent[u]\r\n\r\ndef main():\r\n \r\n n, m = map(int, input().split())\r\n\r\n if m != n:\r\n print('NO')\r\n return\r\n\r\n uf = UnionFind(n)\r\n\r\n for i in range(m):\r\n u, v = map(lambda x: int(x) - 1, input().split())\r\n uf.union(u, v)\r\n \r\n counter = 0\r\n for i in range(n):\r\n if i == uf.find(i):\r\n counter += 1\r\n \r\n print('FHTAGN!' if counter == 1 else 'NO')\r\n\r\nmain()", "import sys\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef findSet(u):\r\n if u != parent[u]:\r\n parent[u] = findSet(parent[u])\r\n return parent[u]\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if up == vp: return\r\n parent[up] = vp\r\n\r\nn, m = map(int, input().split())\r\nif n != m:\r\n print('NO')\r\nelse:\r\n parent = [i for i in range(n)]\t\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n unionSet(u - 1, v - 1)\r\n \r\n if sum(1 for i in range(n) if i == parent[i]) > 1:\r\n print('NO')\r\n else:\r\n print(\"FHTAGN!\")", "n, m = [int(i) for i in input().split()]\r\nadj = [[] for i in range(n+1)]\r\nseen = [False for i in range(n+1)]\r\npai = [0 for i in range(n+1)]\r\nciclos = 0\r\n\r\ndef dfs (u):\r\n seen[u] = True\r\n global ciclos\r\n for v in adj[u]:\r\n if not seen[v]:\r\n pai[v] = u\r\n dfs(v)\r\n elif v != pai[u]:\r\n ciclos += 1\r\n\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n\r\ndfs(1)\r\nconexo = True\r\n\r\nfor i in range(1, n+1, 1):\r\n if not seen[i]:\r\n conexo = False\r\n\r\nif not conexo:\r\n print('NO')\r\nelif ciclos/2 == 1:\r\n print('FHTAGN!')\r\nelse:\r\n print('NO')\r\nexit(0)\r\n", "MAX = 105\r\n\r\ndef findSet(u):\r\n while u != parent[u]:\r\n u = parent[u]\r\n return u\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n parent[up] = vp\r\n\r\nif __name__ == \"__main__\":\r\n parent = [0]*MAX\r\n n, m = map(int, input().split())\r\n if n != m:\r\n print(\"NO\")\r\n exit()\r\n for i in range(1, n+1):\r\n parent[i] = i\r\n \r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n unionSet(u, v)\r\n\r\n nGroup = 0\r\n for i in range(1, n+1):\r\n if i == parent[i]:\r\n nGroup += 1\r\n if nGroup > 1: break\r\n \r\n if nGroup == 1:\r\n print(\"FHTAGN!\")\r\n else: print(\"NO\")\r\n", "n,m=map(int,input().split())\r\na=[[] for _ in range(n+1)]\r\nvis=[]\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n a[x].append(y)\r\n a[y].append(x)\r\n\r\ndef dfs(x):\r\n vis.append(x)\r\n for z in a[x]:\r\n if not(z in vis):\r\n dfs(z)\r\ndfs(1)\r\nif n<3 or n!=m or len(vis)!=n:\r\n print(\"NO\")\r\nelse:\r\n print(\"FHTAGN!\")\r\n", "n,m=map(int,input().split())\r\ng=[[]for _ in range(n)]\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n g[a-1].append(b-1)\r\n g[b-1].append(a-1)\r\n\r\nv=[-1]*n\r\nc=[-1,-1]\r\nr=0\r\ndef dfs(x,p):\r\n v[x]=p\r\n global r,c\r\n r+=1\r\n for j in g[x]:\r\n if v[j]==-1:\r\n dfs(j,x)\r\n elif v[x]!=j:\r\n if c[0]==-1:c=(x,j)\r\n elif c!=(j,x):print('NO');exit()\r\ndfs(0,0)\r\nif r!=n or c[0]==-1:print('NO');exit()\r\np=c[0]\r\nt=1\r\nwhile p!=c[1]:t+=1;p=v[p]\r\nif t>=3:print('FHTAGN!')\r\nelse:print('NO')\r\n\r\n", "def dfs (num,av):\r\n global res; b.add(num)\r\n for v in g[num]:\r\n if v!=av:\r\n if v in b: res += 1; g[v].remove(num)\r\n else:b.add(v); dfs(v,num)\r\nn,m = map (int,input().split())\r\ng,b,res = [[] for _ in range(n)], set(),0\r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n g[u-1].append(v-1); g[v-1].append(u-1)\r\ndfs(0,0)\r\nif len(b) == n and res == 1: print(\"FHTAGN!\")\r\nelse: print(\"NO\")", "class Node:\r\n def __init__(self, parent, rank):\r\n self.parent = parent\r\n self.rank = rank\r\n\r\ndef findRoot(s, u):\r\n if s[u].parent != u:\r\n s[u].parent = findRoot(s, s[u].parent)\r\n return s[u].parent\r\n\r\ndef union(s, u, v):\r\n ru = findRoot(s, u)\r\n rv = findRoot(s, v)\r\n if ru != rv:\r\n if s[ru].rank < s[rv].rank:\r\n s[ru].parent = rv\r\n elif s[ru].rank > s[rv].rank:\r\n s[rv].parent = ru\r\n else:\r\n s[rv].parent = ru\r\n s[ru].rank += 1\r\n return True\r\n return False\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n if n != m:\r\n print(\"NO\")\r\n exit(0)\r\n s = []\r\n for i in range(n + 1):\r\n s.append(Node(i, 0))\r\n cnt = 0\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n if union(s, u, v) == False:\r\n cnt += 1\r\n if cnt == 1:\r\n print(\"FHTAGN!\")\r\n else:\r\n print(\"NO\")", "def f():\r\n n, m = map(int, input().split())\r\n t = [[] for i in range(n + 1)]\r\n p = [0] * (n + 1)\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n t[a].append(b)\r\n t[b].append(a)\r\n p = [a for a in range(1, n + 1) if len(t[a]) == 1]\r\n if any(len(i) == 0 for i in t[1: ]): return 'NO'\r\n\r\n while p:\r\n r = []\r\n for a in p:\r\n b = t[a].pop()\r\n t[b].remove(a)\r\n if len(t[b]) == 1: r.append(b)\r\n elif len(t[b]) == 0: return 'NO'\r\n p = r\r\n \r\n p = [a for a in range(1, n + 1) if len(t[a]) == 2]\r\n if len(p) < 3: return 'NO'\r\n if any(len(i) > 2 for i in t[1: ]): return 'NO'\r\n \r\n s, a = 0, p[0]\r\n while True:\r\n b = t[a].pop()\r\n t[b].remove(a)\r\n a = b\r\n s += 1\r\n if a == p[0]: break\r\n if s != len(p): return 'NO'\r\n return 'FHTAGN!'\r\nprint(f())", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n\r\n\r\nn , m = list(map(int,input().split()))\r\ngraph = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n u , v = list(map(int,input().split()))\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\n\r\nvisited = [False for i in range(n+1)]\r\ndef DFS(s):\r\n stack = []\r\n stack.append(s)\r\n ans = []\r\n while (len(stack)):\r\n s = stack[-1]\r\n stack.pop()\r\n if (not visited[s]):\r\n ans.append(s)\r\n visited[s] = True\r\n for node in graph[s]:\r\n if (not visited[node]):\r\n stack.append(node)\r\n return ans\r\n\r\nif len(DFS(1)) == n and n == m:\r\n print('FHTAGN!')\r\nelse:\r\n print(\"NO\")\r\n", "# 103B\r\n\r\n__author__ = 'artyom'\r\n\r\nread = lambda: map(int, input().split())\r\nn, m = read()\r\ngraph = [set() for _ in range(n + 1)]\r\nfor __ in range(m):\r\n u, v = read()\r\n graph[u].add(v)\r\n graph[v].add(u)\r\n\r\n\r\ndef find_cycle(start):\r\n parents, stack = [0] * (n + 1), [(start, -1)]\r\n while stack:\r\n vertex, parent = stack.pop()\r\n parents[vertex] = parent\r\n for neighbour in graph[vertex]:\r\n if neighbour != parent:\r\n if parents[neighbour]:\r\n cycle = set()\r\n cycle.add(neighbour)\r\n while vertex != neighbour:\r\n cycle.add(vertex)\r\n vertex = parents[vertex]\r\n return cycle\r\n stack.append((neighbour, vertex))\r\n return set()\r\n\r\n\r\ncyc = find_cycle(1)\r\nif not cyc:\r\n print('NO')\r\n exit()\r\n\r\n\r\ndef dfs():\r\n visited = set(cyc)\r\n for start in cyc:\r\n stack = [(v, start) for v in graph[start] if v not in cyc]\r\n while stack:\r\n vertex, parent = stack.pop()\r\n visited.add(vertex)\r\n for neighbour in graph[vertex]:\r\n if neighbour != parent:\r\n if neighbour in visited:\r\n return set()\r\n stack.append((neighbour, vertex))\r\n return visited\r\n\r\n\r\nprint('FHTAGN!' if len(dfs()) == n else 'NO')", "MAX = 101\r\nparent = []\r\n\r\ndef makeSet():\r\n global parent\r\n parent = [i for i in range(MAX + 1)]\r\n\r\ndef findSet(u):\r\n while u != parent[u]:\r\n u = parent[u]\r\n return u\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n parent[up] = vp\r\n\r\nmakeSet()\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n unionSet(a, b)\r\n\r\np = [0] * MAX\r\n\r\nfor i in range(1, n + 1):\r\n p[findSet(i)] += 1\r\n\r\nisCthulhu = True\r\nfor i in range(1, n + 1):\r\n if p[findSet(i)] < n:\r\n isCthulhu = False\r\n\r\nif n == m and isCthulhu:\r\n print(\"FHTAGN!\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\n\nif n < 3 or n != m: # minimo 3 vertices para un circulo\n print(\"NO\") \n\nelse:\n\n V = []\n S = [] \n for i in range(n+1): #Armado de lista para conexiones de vertices\n V.append([])\n \n for j in range(m): \n x, y = map(int, input().split())\n V[x].append(y) #conexion de x con y\n V[y].append(x) #conexion de y con x\n\n\n def DFS(a):\n S.append(a)\n for v in V[a]:\n if not v in S:\n DFS(v)\n \n DFS(1) #hay que comenzar en algun punto\n\n if len(S) == n:\n print(\"FHTAGN!\")\n\n else:\n print(\"NO\")\n \t \t\t\t \t\t \t\t\t \t\t \t\t\t \t\t", "def dfs(v):\r\n global g, marked\r\n marked[v] = True\r\n for nv in g[v]:\r\n if not marked[nv]:\r\n dfs(nv)\r\nn, m = map(int, input().split())\r\nif (n != m):\r\n print(\"NO\")\r\nelse:\r\n g = [[] for _ in range(n)]\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n g[a-1].append(b-1)\r\n g[b-1].append(a-1)\r\n marked = [False for _ in range(n)]\r\n dfs(0)\r\n if False in marked:\r\n print(\"NO\")\r\n else:\r\n print(\"FHTAGN!\")\r\n", "MAX = 101\n\nclass Graph:\n def __init__(self) -> None:\n self.graph = dict()\n\n def add_vertex(self, v):\n if v not in self.graph:\n self.graph[v] = []\n\n def add_edge(self, u, v):\n self.add_vertex(u)\n self.add_vertex(v)\n self.graph[u].append(v)\n self.graph[v].append(u)\n\n def vertices(self):\n return list(self.graph.keys())\n\n def get_neighbors(self, v):\n if v in self.graph:\n return self.graph[v]\n \n return []\n\ndef dfs(graph, vertex, visited):\n visited[vertex] = True\n\n for neighbor in graph.get_neighbors(vertex):\n if not visited[neighbor]:\n dfs(graph, neighbor, visited)\n\ndef isFhtagn(n, m, graph):\n vertices = graph.vertices()\n visited = [False] * (MAX + 1)\n\n if len(vertices) > 0:\n dfs(graph, vertices[0], visited)\n \n count_visited = 0\n for was_visited in visited:\n if was_visited:\n count_visited += 1\n \n if count_visited == n and n == m:\n return \"FHTAGN!\"\n \n return \"NO\"\n\n\ngraph = Graph()\nn, m = map(int, input().split())\n\nfor i in range(m):\n u, v = map(int, input().split())\n graph.add_edge(u, v)\n\nprint(isFhtagn(n, m, graph))\n \n\n\t \t\t \t \t\t \t \t \t \t", "def findset(n):\r\n global parent\r\n\r\n if parent[n] != n:\r\n parent[n] = findset(parent[n])\r\n return parent[n]\r\n\r\ndef union(u, v):\r\n global parent\r\n a = findset(u)\r\n b = findset(v)\r\n if a == b:\r\n return 1\r\n parent[a] = b\r\n return 0\r\n\r\ncount = 0\r\nn, m = map(int,input().split())\r\nx = []\r\ny = []\r\nparent = list(range(n+1))\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n x.append(a)\r\n y.append(b)\r\nfor i in range(m):\r\n count += union(x[i],y[i])\r\nfor i in range(1,n+1):\r\n findset(i)\r\nparent.pop(0)\r\nif len(set(parent)) == 1:\r\n if count == 1:\r\n print(\"FHTAGN!\")\r\n quit()\r\nprint(\"NO\")", "def dfs(v, vis, adj):\n global cycles\n vis[v] = True\n for u in adj[v]:\n if not vis[u]:\n dfs(u, vis, adj)\n\n\nn, m = (int(x) for x in input().split())\nadj = [[] for _ in range(n + 1)]\nvis = [False] * (n + 1)\nfor _ in range(m):\n x, y = (int(x) for x in input().split())\n adj[x].append(y)\n adj[y].append(x)\ndfs(1, vis, adj)\nprint('FHTAGN!' if m == n and all(vis[1:]) else 'NO')\n", "def BFS(vertices,aristas,s):\n U=[s] #nodos visitados\n F=[] #aristas de solución\n Aux=[]\n for e in aristas: #agregamos aristas incidentes de s\n if e[0]==s:\n Aux=Aux+[e]\n elif e[1]==s:\n Aux=Aux+[e]\n #print(\"Aux es \",Aux)\n while Aux!=[]:\n u=Aux.pop(0) #extraigo primera arista de Aux\n #print(\"u es \",u)\n w=-1 #inicializo w\n if u[0] not in U: #si u tiene extremo no visitado lo llamo w\n w=u[0]\n if u[1] not in U: #si u tiene extremo no visitado lo llamo w\n w=u[1]\n if w!=-1: #u tiene extremo no visitado\n U=U+[w]\n F=F+[u]\n for e in aristas: #agregamos aristas incidentes en w\n if e[0]==w:\n Aux=Aux+[e]\n elif e[1]==w:\n Aux=Aux+[e]\n return (U,F)\n\nnm_=input()\nnm=[int(k) for k in nm_.split(\" \")]\nn=nm[0]\nm=nm[1]\nvertices=[]\naristas=[]\nfor i in range(m):\n e_=input()\n e=[int(k) for k in e_.split(\" \")]\n aristas=aristas+[e]\n \nfor e in aristas:\n for i in e:\n if i not in vertices:\n vertices=vertices+[i]\nif m!=n:\n print(\"NO\")\nelse:\n i=0\n while i<=n:\n if i==n:\n print(\"FHTAGN!\")\n i=i+1\n elif len(set(BFS(vertices,aristas,vertices[i])[0])&set(vertices))!=n:\n print(\"NO\")\n i=n+1\n else:\n i=i+1\n \t \t\t \t\t \t \t\t \t \t \t \t \t \t\t", "def dfs(node):\n\n cnt = 1\n visited[node] = True\n\n for adj in graph[node]:\n if not visited[adj]:\n cnt += dfs(adj)\n\n return cnt\n\n\nn, m = map(int, input().split())\ngraph = [[] for _ in range(n+1)]\nvisited = [False]*(n+1)\n\nif m != n:\n print(\"NO\")\nelse:\n\n for _ in range(m):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\n print(\"NO\" if dfs(1) != n else \"FHTAGN!\")\n", "inf = float('inf')\r\nimport sys\r\nimport pprint\r\nimport logging\r\nfrom logging import getLogger\r\nimport array\r\n\r\n# sys.setrecursionlimit(10 ** 9)\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef maps(): return [int(i) for i in input().split()]\r\n\r\n\r\nlogging.basicConfig(\r\n format=\"%(message)s\",\r\n level=logging.WARNING,\r\n)\r\nlogger = getLogger(__name__)\r\nlogger.setLevel(logging.INFO)\r\n\r\n\r\ndef debug(msg, *args):\r\n logger.info(f'{msg}={pprint.pformat(args)}')\r\n\r\n\r\nclass DisjointSetUnion:\r\n def __init__(self, n):\r\n self.n = n\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.numsets = n\r\n\r\n def find(self, x):\r\n xcopy = x\r\n while self.parent[x] != x:\r\n x = self.parent[x]\r\n while xcopy != x:\r\n xcopy, self.parent[xcopy] = self.parent[xcopy], x\r\n return x\r\n\r\n def union(self, x, y):\r\n a, b = self.find(x), self.find(y)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.size[a] += self.size[b] # sz.a > sz.b\r\n self.parent[b] = a\r\n self.numsets -= 1\r\n\r\n def get_size(self, x):\r\n return self.size[self.find(x)]\r\n\r\n def __len__(self, x): # number of components\r\n return self.numsets\r\n\r\n\r\nfrom collections import defaultdict\r\nn, m = maps()\r\ngr = [[] for _ in range(n)]\r\nfor __ in range(m):\r\n u, v = maps()\r\n u -= 1\r\n v -= 1\r\n gr[u].append(v)\r\n gr[v].append(u)\r\nvis = [False] * n\r\n\r\n\r\ndef dfs(u):\r\n vis[u] = True\r\n for v in gr[u]:\r\n if not vis[v]:\r\n dfs(v)\r\n\r\n\r\ndfs(0)\r\nif (False in vis) or (n != m): # check if it is a connected graph || the graph is just one big cycle will no multi-edges and parallel loops\r\n print('NO')\r\nelse:\r\n print('FHTAGN!')\r\n", "from collections import deque\r\nn, m = map(int, input().split())\r\nM = m\r\ng = {i: [] for i in range(1, n + 1)}\r\nwhile m:\r\n n1, n2 = map(int, input().split())\r\n g[n1].append(n2)\r\n g[n2].append(n1)\r\n m = m - 1\r\nv = [False for _ in range(n + 1)]\r\ncities = 0\r\nfor start in range(1, n + 1):\r\n if v[start] == False:\r\n v[start] = True\r\n queue = deque([start])\r\n while queue:\r\n curr = queue.popleft()\r\n for i in g[curr]:\r\n if v[i] == False:\r\n v[i] = True\r\n queue.append(i)\r\n cities = cities + 1\r\nif M == n and cities == 1:\r\n print(\"FHTAGN!\")\r\nelse:\r\n print('NO')", "\r\n#?\t\t /\\_/\\\r\n#?\t\t(= ._.)\r\n#?\t\t/ >WA \\>AC\r\n#// WELCOME TO MY CODING SPACE\r\n#! Filename: nhap.py\r\n#? Author: TranDucTri2003\r\n#* CreatedAt: 2022-05-02 12:15:18\r\n\r\nfrom queue import PriorityQueue\r\nfrom collections import deque,OrderedDict,defaultdict,Counter\r\nfrom heapq import heappop, heappush, heapify\r\nimport sys\r\nimport time\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nimport math\r\nfrom random import randint\r\nfrom itertools import compress\r\n\r\n\r\nMOD=10**9+7\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n \r\n \r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef inputf(): \r\n return sys.stdin.readline().rstrip(\"\\r\\n\") # for fast input\r\n \r\n\r\n \r\ndef get_ints(): \r\n return list(map(int, inputf().split()))\r\n \r\n \r\ndef get_string(): \r\n return list(map(str, inputf().split()))\r\n\r\n\r\n\r\n\r\n\r\nglobal maximum\r\n \r\n \r\ndef _lis(arr, n):\r\n \r\n global maximum\r\n \r\n if n == 1:\r\n return 1\r\n \r\n maxEndingHere = 1\r\n \r\n \"\"\"Recursively get all LIS ending with arr[0], arr[1]..arr[n-2]\r\n IF arr[n-1] is maller than arr[n-1], and max ending with\r\n arr[n-1] needs to be updated, then update it\"\"\"\r\n for i in range(1, n):\r\n res = _lis(arr, i)\r\n if arr[i-1] < arr[n-1] and res+1 > maxEndingHere:\r\n maxEndingHere = res + 1\r\n\r\n maximum = max(maximum, maxEndingHere)\r\n \r\n return maxEndingHere\r\n \r\n \r\ndef LIS(arr):\r\n \r\n global maximum\r\n \r\n n = len(arr)\r\n\r\n maximum = 1\r\n \r\n\r\n _lis(arr, n)\r\n \r\n return maximum\r\n \r\n\r\ndef binary_search(data, elem):\r\n \r\n low = 0\r\n high = len(data) - 1\r\n while low <= high:\r\n \r\n middle = (low + high)//2\r\n if data[middle] == elem:\r\n return middle\r\n \r\n elif data[middle] > elem:\r\n\r\n high = middle - 1\r\n else:\r\n low = middle + 1\r\n\r\n return middle \r\n\r\ndef upper_bound(my_list, key):\r\n large = len(my_list) -1\r\n small = 0\r\n\r\n while (small <= large):\r\n mid = (small + large) // 2\r\n if my_list[mid] < key: #Đổi thành if my_list[mid] > key: trong th mảng từ lớn đến bé \r\n small = mid + 1\r\n elif my_list[mid] > key: #Đổi thành elif my_list[mid] < key: trong th mảng từ lớn đến bé\r\n large = mid - 1\r\n else:\r\n return mid\r\n if my_list[mid]>key:\r\n return mid\r\n else:\r\n return mid+1 #Đổi thành mid-1 trong th mảng từ lớn đến bé\r\n \r\n\r\n\r\n\r\ndef lower_bound(my_list, key):\r\n large = len(my_list) -1\r\n small = 0\r\n\r\n while (small <= large):\r\n mid = (small + large) // 2\r\n if my_list[mid] < key:\r\n small = mid + 1\r\n elif my_list[mid] > key:\r\n large = mid - 1\r\n else:\r\n return mid\r\n if my_list[mid]<key:\r\n return mid\r\n else:\r\n return mid-1\r\n\r\n\r\n\r\n\r\ndef rwh_primes1v1(n):\r\n \"\"\" Returns a list of primes < n for n > 2 \"\"\"\r\n sieve = bytearray([True]) * (n//2)\r\n for i in range(3,int(n**0.5)+1,2):\r\n if sieve[i//2]:\r\n sieve[i*i//2::i] = bytearray((n-i*i-1)//(2*i)+1)\r\n return [2,*compress(range(3,n,2), sieve[1:])]\r\n\r\ndef rwh_primes1v2(n):\r\n \"\"\" Returns a list of primes < n for n > 2 \"\"\"\r\n sieve = bytearray([True]) * (n//2+1)\r\n for i in range(1,int(n**0.5)//2+1):\r\n if sieve[i]:\r\n sieve[2*i*(i+1)::2*i+1] = bytearray((n//2-2*i*(i+1))//(2*i+1)+1)\r\n return [2,*compress(range(3,n,2), sieve[1:])]\r\n\r\ndef roman_number(x):\r\n if x > 15999:\r\n return\r\n value = [5000, 4000, 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\r\n symbol = [\"F\", \"MF\", \"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"]\r\n roman = \"\"\r\n i = 0\r\n while x > 0:\r\n div = x // value[i]\r\n x = x % value[i]\r\n while div:\r\n roman += symbol[i]\r\n div -= 1\r\n i += 1\r\n return roman\r\n\r\ndef maxSubArraySum(a,size):\r\n \r\n max_so_far = a[0] \r\n max_ending_here = 0\r\n \r\n for i in range(0, size):\r\n max_ending_here = max_ending_here + a[i]\r\n if max_ending_here < 0:\r\n max_ending_here = 0\r\n\r\n elif (max_so_far < max_ending_here): \r\n max_so_far = max_ending_here\r\n \r\n return max_so_far\r\n\r\n \r\n\r\n\r\ndef lcm(x, y):\r\n\r\n if x > y:\r\n greater = x\r\n else:\r\n greater = y\r\n\r\n while(True):\r\n if((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break\r\n greater += 1\r\n\r\n return lcm\r\n\r\ndef primeFactors(n):\r\n a=[]\r\n while n % 2 == 0:\r\n a.append(2)\r\n n = n / 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n while n % i== 0:\r\n a.append(i)\r\n n = n / i\r\n \r\n if n > 2:\r\n a.append(n)\r\n \r\n\r\ndef findClosest(arr, n, target):\r\n \r\n if (target <= arr[0]):\r\n return arr[0]\r\n if (target >= arr[n - 1]):\r\n return arr[n - 1]\r\n \r\n i = 0; j = n; mid = 0\r\n while (i < j):\r\n mid = (i + j) // 2\r\n \r\n if (arr[mid] == target):\r\n return arr[mid]\r\n \r\n if (target < arr[mid]) :\r\n \r\n if (mid > 0 and target > arr[mid - 1]):\r\n return getClosest(arr[mid - 1], arr[mid], target)\r\n \r\n j = mid\r\n \r\n else :\r\n if (mid < n - 1 and target < arr[mid + 1]):\r\n return getClosest(arr[mid], arr[mid + 1], target)\r\n \r\n i = mid + 1\r\n \r\n return arr[mid]\r\n \r\n\r\ndef getClosest(val1, val2, target):\r\n \r\n if (target - val1 >= val2 - target):\r\n return val2\r\n else:\r\n return val1\r\n\r\nimport random\r\n \r\ndef is_Prime(n):\r\n \"\"\"\r\n Miller-Rabin primality test.\r\n \r\n A return value of False means n is certainly not prime. A return value of\r\n True means n is very likely a prime.\r\n \"\"\"\r\n if n!=int(n):\r\n return False\r\n n=int(n)\r\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\r\n return False\r\n \r\n if n==2 or n==3 or n==5 or n==7:\r\n return True\r\n s = 0\r\n d = n-1\r\n while d%2==0:\r\n d>>=1\r\n s+=1\r\n assert(2**s * d == n-1)\r\n \r\n def trial_composite(a):\r\n if pow(a, d, n) == 1:\r\n return False\r\n for i in range(s):\r\n if pow(a, 2**i * d, n) == n-1:\r\n return False\r\n return True \r\n \r\n for i in range(8):\r\n a = random.randrange(2, n)\r\n if trial_composite(a):\r\n return False\r\n \r\n return True \r\n\r\ndef LCS(s1 , s2):\r\n m, n = len(s1), len(s2)\r\n prev, cur = [0]*(n+1), [0]*(n+1)\r\n for i in range(1, m+1):\r\n for j in range(1, n+1):\r\n if s1[i-1] == s2[j-1]:\r\n cur[j] = 1 + prev[j-1]\r\n else:\r\n if cur[j-1] > prev[j]:\r\n cur[j] = cur[j-1]\r\n else:\r\n cur[j] = prev[j]\r\n cur, prev = prev, cur\r\n return prev[n]\r\n\r\nfib_matrix = [[1,1],\r\n [1,0]]\r\n\r\ndef matrix_square(A, mod):\r\n return mat_mult(A,A,mod)\r\n\r\n\r\ndef mat_mult(A,B, mod):\r\n if mod is not None:\r\n return [[(A[0][0]*B[0][0] + A[0][1]*B[1][0])%mod, (A[0][0]*B[0][1] + A[0][1]*B[1][1])%mod],\r\n [(A[1][0]*B[0][0] + A[1][1]*B[1][0])%mod, (A[1][0]*B[0][1] + A[1][1]*B[1][1])%mod]]\r\n\r\n\r\ndef matrix_pow(M, power, mod):\r\n if power <= 0:\r\n return M\r\n\r\n powers = list(reversed([True if i==\"1\" else False for i in bin(power)[2:]])) #Order is 1,2,4,8,16,...\r\n\r\n matrices = [None for _ in powers]\r\n matrices[0] = M\r\n\r\n for i in range(1,len(powers)):\r\n matrices[i] = matrix_square(matrices[i-1], mod)\r\n\r\n\r\n result = None\r\n\r\n for matrix, power in zip(matrices, powers):\r\n if power:\r\n if result is None:\r\n result = matrix\r\n else:\r\n result = mat_mult(result, matrix, mod)\r\n\r\n return result\r\n#print (matrix_pow(fib_matrix, n, 10**9+7)[0][1])\r\n\r\n\r\ndef multiply(T, M):\r\n \r\n a = (T[0][0] * M[0][0] + T[0][1] *\r\n M[1][0] + T[0][2] * M[2][0]) \r\n b = (T[0][0] * M[0][1] + T[0][1] *\r\n M[1][1] + T[0][2] * M[2][1])\r\n c = (T[0][0] * M[0][2] + T[0][1] *\r\n M[1][2] + T[0][2] * M[2][2])\r\n d = (T[1][0] * M[0][0] + T[1][1] *\r\n M[1][0] + T[1][2] * M[2][0])\r\n e = (T[1][0] * M[0][1] + T[1][1] *\r\n M[1][1] + T[1][2] * M[2][1])\r\n f = (T[1][0] * M[0][2] + T[1][1] *\r\n M[1][2] + T[1][2] * M[2][2])\r\n g = (T[2][0] * M[0][0] + T[2][1] *\r\n M[1][0] + T[2][2] * M[2][0])\r\n h = (T[2][0] * M[0][1] + T[2][1] *\r\n M[1][1] + T[2][2] * M[2][1])\r\n i = (T[2][0] * M[0][2] + T[2][1] *\r\n M[1][2] + T[2][2] * M[2][2])\r\n \r\n T[0][0] = a\r\n T[0][1] = b\r\n T[0][2] = c\r\n T[1][0] = d\r\n T[1][1] = e\r\n T[1][2] = f\r\n T[2][0] = g\r\n T[2][1] = h\r\n T[2][2] = i\r\n \r\n\r\ndef power(T, n):\r\n \r\n if (n == 0 or n == 1):\r\n return;\r\n M = [[ 1, 1, 1 ],\r\n [ 1, 0, 0 ],\r\n [ 0, 1, 0 ]]\r\n \r\n power(T, n // 2)\r\n \r\n multiply(T, T)\r\n \r\n if (n % 2):\r\n multiply(T, M)\r\n \r\ndef tribonacci(n):\r\n \r\n T = [[ 1, 1, 1 ],\r\n [1, 0, 0 ],\r\n [0, 1, 0 ]]\r\n \r\n if (n == 0 or n == 1):\r\n return 0\r\n else:\r\n power(T, n - 2)\r\n\r\n return T[0][0]\r\n\r\ndef check_colinear(x1,y1,x2,y2,x3,y3):\r\n doan12=math.sqrt((x1-x2)**2+(y1-y2)**2)\r\n doan13=math.sqrt((x1-x3)**2+(y1-y3)**2)\r\n doan23=math.sqrt((x2-x3)**2+(y2-y3)**2)\r\n if doan12==0 or doan13==0 or doan23==0:\r\n return False \r\n else:\r\n cos12=(doan13**2+doan23**2-doan12**2)/(2*doan13*doan23)\r\n cos13=(doan12**2+doan23**2-doan13**2)/(2*doan12*doan23)\r\n cos23=(doan13**2+doan12**2-doan23**2)/(2*doan13*doan12)\r\n if cos12==-1 or cos12==1 or cos13==-1 or cos13==1 or cos23==-1 or cos23==1:\r\n return False\r\n else:\r\n return True\r\n \r\n\r\ndef check_quadrilateral(x1,y1,x2,y2,x3,y3,x4,y4):\r\n if check_colinear(x1,y1,x2,y2,x4,y4)==True and check_colinear(x1,y1,x2,y2,x3,y3)==True and check_colinear(x1,y1,x3,y3,x4,y4)==True and check_colinear(x2,y2,x3,y3,x4,y4)==True:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\ndef linear_equation(x1,x2,y1,y2):\r\n if x1==x2: \r\n return True\r\n if y1==y2:\r\n return False\r\n a=(y1-y2)/(x1-x2)\r\n b=y1-a*x1\r\n return a,b\r\n\r\n\r\ndef check_quadrilateral(x1,y1,x2,y2,x3,y3,x4,y4):\r\n check=0\r\n if linear_equation(x1,x2,y1,y2)==True: \r\n if (x3>x1 and x4>x1) or (x3<x1 and x4<x1):\r\n check+=1\r\n elif linear_equation(x1,x2,y1,y2)==False: \r\n if (y3>y1 and y4>y1) or (y3<y1 and y4<y1):\r\n check+=1\r\n else:\r\n a,b=linear_equation(x1,x2,y1,y2)\r\n if (a*x3+b-y3>0 and a*x4+b-y4>0) or (a*x3+b-y3<0 and a*x4+b-y4<0):\r\n check+=1\r\n \r\n \r\n if linear_equation(x2,x3,y2,y3)==True: \r\n if (x4>x2 and x1>x2) or (x4<x2 and x1<x2):\r\n check+=1\r\n elif linear_equation(x2,x3,y2,y3)==False: \r\n if (y4>y2 and y1>y2) or (y4<y2 and y1<y2):\r\n check+=1\r\n else:\r\n a,b=linear_equation(x2,x3,y2,y3)\r\n if (a*x4+b-y4>0 and a*x1+b-y1>0) or (a*x1+b-y1<0 and a*x4+b-y4<0):\r\n check+=1 \r\n \r\n \r\n if linear_equation(x3,x4,y3,y4)==True: \r\n if (x1>x3 and x2>x3) or (x1<x3 and x2<x3):\r\n check+=1\r\n elif linear_equation(x3,x4,y3,y4)==False: \r\n if (y1>y3 and y2>y3) or (y1<y3 and y2<y3):\r\n check+=1\r\n else:\r\n a,b=linear_equation(x3,x4,y3,y4)\r\n if (a*x1+b-y1>0 and a*x2+b-y2>0) or (a*x1+b-y1<0 and a*x2+b-y2<0):\r\n check+=1 \r\n \r\n \r\n if linear_equation(x4,x1,y4,y1)==True: \r\n if (x2>x1 and x3>x1) or (x2<x1 and x3<x1):\r\n check+=1\r\n elif linear_equation(x4,x1,y4,y1)==False: \r\n if (y2>y1 and y3>y1) or (y2<y1 and y3<y1):\r\n check+=1\r\n else:\r\n a,b=linear_equation(x4,x1,y4,y1)\r\n if (a*x2+b-y2>0 and a*x3+b-y3>0) or (a*x2+b-y2<0 and a*x3+b-y3<0):\r\n check+=1 \r\n \r\n if check==4:\r\n return True\r\n else:\r\n return False\r\n\r\n\"\"\"\r\ndef find_shortest_path(graph, start, end, path):\r\n path = path + [start]\r\n if start == end:\r\n return path\r\n if start not in graph:\r\n return None\r\n shortest = None\r\n for node in graph[start]:\r\n if node not in path:\r\n newpath = find_shortest_path(graph, node, end, path)\r\n if newpath:\r\n if not shortest or len(newpath) < len(shortest):\r\n shortest = newpath\r\n return shortest\r\n\"\"\" \r\n\r\n\"\"\"\r\ndef dfs(root,nodeVal,nodeConnection,visited):\r\n leftVal = nodeVal[root][0]\r\n rightVal = nodeVal[root][1]\r\n solution = []\r\n if nodeConnection[root]:\r\n visited.add(root)\r\n for i in nodeConnection[root]:\r\n if i not in visited:\r\n solution.append(dfs(i,nodeVal,nodeConnection,visited))\r\n leftMax = 0\r\n rightMax = 0\r\n for i in solution:\r\n l, r = i\r\n leftMax += max(abs(leftVal - l[0]) + l[1], abs(leftVal - r[0]) + r[1])\r\n rightMax += max(abs(rightVal - l[0]) + l[1], abs(rightVal - r[0]) + r[1])\r\n return ((leftVal, leftMax), (rightVal, rightMax))\r\n else:\r\n return ((leftVal, 0), (rightVal, 0))\r\n \r\n\"\"\"\r\n \r\n\"\"\"\r\ndef BFS(adj,src,dist,paths,n):\r\n visited=[False]*n\r\n dist[src]=0\r\n paths[0]=1\r\n q=[src]\r\n visited[src]=True\r\n while(q):\r\n p=q.pop(0)\r\n for j in adj[p]:\r\n if not visited[j]:\r\n q.append(j)\r\n visited[j]=True\r\n if dist[j]>dist[p]+1:\r\n dist[j] = dist[p]+1\r\n paths[j] = paths[p]\r\n elif dist[j]==dist[p]+1:\r\n paths[j] +=paths[p]\r\n return paths\r\n \r\n\"\"\"\r\n\"\"\"from collections import defaultdict\r\n\r\na={}\r\na=DefaultDict(lambda:0,a)\r\nprint(a[5])\"\"\"\r\n# NOT MY CODE\r\n# https://codeforces.com/contest/1324/submission/73179914\r\n \r\n## PYRIVAL BOOTSTRAP\r\n# https://github.com/cheran-senthil/PyRival/blob/master/pyrival/misc/bootstrap.py\r\n# This decorator allows for recursion without actually doing recursion\r\nfrom types import GeneratorType\r\n \r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n if not stack:\r\n break\r\n stack.pop()\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc\r\n\r\n\r\n# generic memoizer\r\ndef memoize(func):\r\n '''Memoizing decorator that checks whether the wrapped function \r\n has been previously run with the current argument value. \r\n If it has then that value is retrieved and offered instead \r\n of rerunning the function'''\r\n memos = {}\r\n def wrapper(x):\r\n if x not in memos:\r\n memos[x] = func(x)\r\n return memos[x]\r\n return wrapper\r\n \r\n\r\n\r\nfrom collections import defaultdict\r\nfrom heapq import heappop, heappush\r\n\r\nclass Graph:\r\n INF=10**9\r\n #Searching Algorithms: DFS, BFS\r\n def __init__(self):\r\n self.graph = defaultdict(list)\r\n \r\n # Algorithms for finding the shortest path: Bellman Ford\r\n # def __init__(self, vertices):\r\n # self.V = vertices # No. of vertices\r\n # self.graph = []\r\n\r\n # Algorithms for finding the shortest path: Dijsktra\r\n # def __init__(self,vertices):\r\n # self.distance=[self.INF]*vertices\r\n # self.edges=defaultdict(dict)\r\n\r\n # Algorithms for finding the shortest path: Floyd Warshall \r\n # def __init__(self,vertices):\r\n # self.distance=defaultdict(lambda:defaultdict(lambda:self.INF))\r\n # self.edges=defaultdict(lambda:defaultdict(lambda:self.INF))\r\n # for i in range(1,vertices+1):\r\n # self.distance[i][i]=0\r\n # self.edges[i][i]=0\r\n \r\n #Minimum Spanning Trees: Kruskal's Algorithm\r\n # def __init__(self, vertices):\r\n # self.vertices=vertices\r\n # self.graph=[]\r\n \r\n\r\n \r\n #DFS,BFS\r\n def addEdge(self,u,v):\r\n self.graph[u].append(v)\r\n self.graph[v].append(u)\r\n \r\n #Bellman Ford\r\n # def addEdge(self, u, v, w):\r\n # self.graph.append([u, v, w])\r\n \r\n #Dijsktra\r\n # def addEdge(self,u,v,w):\r\n # self.edges[u][v]=w\r\n \r\n #Floyd Warshall\r\n # def addEdge(self,u,v,w):\r\n # self.edges[u][v]=w\r\n \r\n #:Kruskal's Algorithm finding MST\r\n # def addEdge(self,node1,node2,weight):\r\n # self.graph.append([node1,node2,weight])\r\n \r\n # 1.Handling A Disconnected Graph: \r\n def DFSUtil(self, vertex,visited,path):\r\n stack=[vertex]\r\n while len(stack):\r\n u=stack.pop()\r\n if visited[u]==0:\r\n path.append(u)\r\n visited[u]=1\r\n for neighbour in self.graph[u]:\r\n stack.append(neighbour)\r\n \r\n # def DFS(self,numVertex):\r\n # visited=defaultdict(lambda:0)\r\n # path=[]\r\n # for vertex in range(1,numVertex+1):\r\n # if visited[vertex]==0:\r\n # self.DFSUtil(vertex,visited,path) \r\n # return path\r\n \r\n # 2.DFS from a vertex \r\n def DFS(self,vertex):\r\n path=[]\r\n stack=[vertex]\r\n visited=defaultdict(lambda:0)\r\n ancestor=defaultdict(lambda:0)\r\n numCycle=0\r\n while len(stack):\r\n u=stack.pop()\r\n if visited[u]==0:\r\n path.append(u)\r\n visited[u]=1\r\n for neighbour in self.graph[u]:\r\n ancestor[neighbour]=u\r\n if visited[neighbour]==1: \r\n if ancestor[u]!=neighbour:\r\n numCycle+=1\r\n else:\r\n stack.append(neighbour)\r\n return numCycle\r\n\r\n \r\n # 1. Handling A Disconnected Graph:\r\n def BFS(self,numVertex):\r\n visited=defaultdict(lambda:0)\r\n queue=[]\r\n for i in range(1,numVertex+1):\r\n if visited[i]==0:\r\n queue.append(i)\r\n visited[i]=1\r\n while queue:\r\n u=queue.pop(0)\r\n print(u,end=' ')\r\n for v in self.graph[u]:\r\n if visited[v]==0:\r\n queue.append(v)\r\n visited[v]=1\r\n \r\n # 2. BFS from a vertex\r\n # def BFS(self,vertex):\r\n # visited = defaultdict(lambda:0)\r\n # queue=[vertex]\r\n # visited[vertex]=1\r\n # path=[]\r\n # while queue:\r\n # u=queue.pop(0)\r\n # path.append(u)\r\n # for v in self.graph[u]:\r\n # if visited[v]==0:\r\n # queue.append(v)\r\n # visited[v]=1\r\n # return path\r\n \r\n #DFSUtil in case finding Connected components\r\n def DFSUtilConnect(self, temp, v, visited):\r\n visited[v] = 1\r\n # Store the vertex to list\r\n temp.append(v)\r\n for neighbour in self.graph[v]:\r\n if visited[neighbour]==0:\r\n # Update the list\r\n temp = self.DFSUtilConnect(temp, neighbour, visited)\r\n return temp\r\n \r\n \r\n def connectedComponentsDFS(self,numVertex):\r\n path=[]\r\n visited=defaultdict(lambda:0)\r\n for vertex in range(1,numVertex+1):\r\n if visited[vertex] == 0:\r\n temp = []\r\n path.append(self.DFSUtilConnect(temp, vertex, visited))\r\n return path\r\n \r\n def connectedComponentsBFS(self,numVertex):\r\n visited=defaultdict(lambda:0)\r\n stack=[]\r\n path=[]\r\n for i in range(1,numVertex+1):\r\n if visited[i]==0:\r\n stack.append(i)\r\n visited[i]=1\r\n temp=[]\r\n while stack:\r\n u=stack.pop()\r\n temp.append(u)\r\n for v in self.graph[u]:\r\n if visited[v]==0:\r\n stack.append(v)\r\n visited[v]=1\r\n path.append(temp)\r\n return path\r\n \r\n \r\n\r\n def BellmanFord(self, S):\r\n d=defaultdict(lambda:self.INF)\r\n trace=defaultdict(lambda:-1)\r\n d[S]=0\r\n \r\n for _ in range(self.V - 1):\r\n for u, v, w in self.graph:\r\n if d[u]!=self.INF and d[v]>d[u]+w:\r\n d[v]=d[u]+w\r\n trace[v]=u\r\n\r\n #Trả về đường đi từ đỉnh S đến u nào đó\r\n #return trace\r\n # if u!=S and trace[u]==-1:\r\n # return -1 #Không có đường đi\r\n # else:\r\n # path=[]\r\n # while u!=-1:\r\n # path.append(u)\r\n # u=trace[u]\r\n # path.reverse()\r\n # return path\r\n\r\n #Nhận biết đường đi âm vô cực trong trường hợp có chu trình âm:\r\n \r\n # Chạy thuật toán Bellman-Ford thêm một lần nữa với N vòng lặp, những đỉnh nào vẫn còn tối ưu được ở lần chạy thứ hai\r\n # sẽ tối ưu được mãi mãi, và đó là các đỉnh không tồn tại đường đi ngắn nhất.\r\n \r\n for _ in range(self.V):\r\n for u, v, w in self.graph:\r\n if d[u]!=self.INF and d[v]>d[u]+w:\r\n d[v]=-self.INF # vẫn còn tối ưu được --> âm vô cực\r\n trace[v]=u\r\n return d\r\n \r\n def Dijsktra(self,S):\r\n self.distance[S]=0\r\n queue=[(0,S)]\r\n trace=defaultdict(lambda:-1)\r\n while queue:\r\n cost,vertex=heappop(queue)\r\n for neighbour, weight in self.edges[vertex].items():\r\n if cost+weight<self.distance[neighbour]:\r\n self.distance[neighbour]=cost+weight\r\n heappush(queue, (cost + weight, neighbour))\r\n trace[neighbour]=vertex\r\n #Trả về đường đi từ đỉnh S đến u nào đó\r\n #return trace\r\n # if u!=S and trace[u]==-1:\r\n # return -1 #Không có đường đi\r\n # else:\r\n # path=[]\r\n # while u!=-1:\r\n # path.append(u)\r\n # u=trace[u]\r\n # path.reverse()\r\n # return path \r\n return self.distance\r\n \r\n def FloydWarshall(self,vertices):\r\n for k in range(1,vertices+1):\r\n for i in range(1,vertices+1):\r\n for j in range(1,vertices+1):\r\n self.distance[i][j]=min(self.distance[i][j],self.edges[i][k]+self.edges[k][j])\r\n return self.distance\r\n\r\n\r\n #Finds the root of a subtree containing node 'i'\r\n def findSubtree(self,parent,i):\r\n if parent[i]==i:\r\n return i\r\n else:\r\n return self.findSubtree(parent,parent[i])\r\n #Connects subtrees containing node 'x' and 'y'\r\n def connectSubtree(self,parent,subtreeSize,x,y):\r\n xroot=self.findSubtree(parent,x)\r\n yroot=self.findSubtree(parent,y)\r\n if subtreeSize[xroot]<subtreeSize[yroot]:\r\n parent[xroot]=yroot\r\n elif subtreeSize[xroot]>subtreeSize[yroot]:\r\n parent[yroot]=xroot\r\n else:\r\n parent[yroot]=xroot\r\n subtreeSize[xroot]+=1\r\n \r\n def Kruskal(self):\r\n #Resulting tree\r\n res=[]\r\n \r\n #Iterator\r\n i=0\r\n #Number of edges in MST\r\n e=0\r\n\r\n #Sort edges by their weight\r\n self.graph=sorted(self.graph,key=lambda item: item[2])\r\n\r\n #Auxiliary arrays\r\n parent=[]\r\n subtreeSize=[]\r\n \r\n #initialize parent and subtreeSize arrays\r\n \r\n for node in range(self.vertices):\r\n parent.append(node)\r\n subtreeSize.append(0)\r\n \r\n #Number of edges in a MST is (node-1)\r\n \r\n while e<self.vertices-1:\r\n node1,node2,weight=self.graph[i]\r\n i+=1\r\n\r\n x=self.findSubtree(parent,node1)\r\n y=self.findSubtree(parent,node2)\r\n \r\n if x!=y:\r\n e+=1\r\n res.append([node1,node2,weight])\r\n self.connectSubtree(parent,subtreeSize,node1,node2)\r\n return res\r\n\r\n\r\n def isEulerian(self):\r\n path=self.connectedComponentsBFS(self.v)\r\n for compo in path:\r\n odd=0\r\n for vertex in compo:\r\n if self.degree[vertex]%2==1:\r\n odd+=1\r\n\r\n if odd == 0:\r\n return 2 # graph has a Euler cycle\r\n elif odd == 2:\r\n return 1 # graph has a Euler path\r\n elif odd > 2:\r\n return 0 # graph is not Euleria\r\n # '''If odd count is 2, then semi-eulerian.\r\n # If odd count is 0, then eulerian\r\n # If count is more than 2, then graph is not Eulerian\r\n # Note that odd count can never be 1 for undirected graph'''\r\n\r\nn,m=list(map(int,input().split()))\r\ng=Graph()\r\nfor i in range(m):\r\n u,v=list(map(int,input().split()))\r\n g.addEdge(u,v)\r\n\r\ncom=g.connectedComponentsDFS(n)\r\nif len(com)==1 and g.DFS(1)==1:\r\n print(\"FHTAGN!\")\r\nelse:\r\n print(\"NO\")\r\n\r\n#Nếu đi đến một đỉnh mà đỉnh đó đã được thăm nhưng tổ tiên của nó không phải là đỉnh đó nghĩa là có chu trình", "import sys\r\nimport queue\r\nsys.setrecursionlimit(100000)\r\n\r\n# global constant\r\nINF = int(1e7+1)\r\nMAX = 100005\r\n\r\n# For testing\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n#sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\n# global variables\r\nparents = []\r\nranks = []\r\nsize = []\r\nn = 0\r\n\r\n# classes\r\n\r\n\r\nclass Pair:\r\n def __init__(self, a, b):\r\n self.first = a\r\n self.second = b\r\n\r\n\r\n# functions\r\ndef init():\r\n global parents, ranks, size\r\n parents = [i for i in range(n)]\r\n ranks = [0 for i in range(n)]\r\n size = [1 for i in range(n)]\r\n\r\n\r\ndef findSet(u):\r\n if(parents[u] != u):\r\n parents[u] = findSet(parents[u])\r\n return parents[u]\r\n\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if up == vp:\r\n return\r\n if ranks[up] < ranks[vp]:\r\n parents[up] = vp\r\n elif ranks[vp] < ranks[up]:\r\n parents[vp] = up\r\n else:\r\n ranks[vp] += 1\r\n parents[up] = vp\r\n\r\n\r\n# main function\r\ndef main():\r\n global n\r\n n, m = map(int, input().split())\r\n init()\r\n flag = False\r\n firstLoop = False\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n if findSet(u) == findSet(v):\r\n flag = True\r\n if not firstLoop:\r\n firstLoop = True\r\n else:\r\n flag = False\r\n break\r\n unionSet(u, v)\r\n S = set()\r\n if flag:\r\n for i in range(n):\r\n S.add(findSet(i))\r\n if flag and len(S) > 1:\r\n flag = False\r\n if flag:\r\n print(\"FHTAGN!\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nmain()\r\n", "from typing import List\n\nMAX = 101\n\nclass Graph:\n def __init__(self) -> None:\n self.grafo = dict()\n\n\n def vertices(self):\n return list(self.grafo.keys())\n\n\n def add_aresta(self, v, u):\n self.add_vertices(v)\n self.add_vertices(u)\n self.grafo[v].append(u)\n self.grafo[u].append(v)\n\n\n def get_vizinhos(self, vertice):\n if (vertice in self.grafo):\n return self.grafo[vertice]\n return []\n \n\n def add_vertices(self, vertice):\n if (vertice not in self.grafo):\n self.grafo[vertice] = []\n \n\ndef dfs(grafo: Graph, vertice: int, visitado: List[bool]):\n visitado[vertice] = True\n for vizinho in grafo.get_vizinhos(vertice):\n if not visitado[vizinho]:\n dfs(grafo, vizinho, visitado)\n\n\ndef isCthulhu(n: int, m: int, grafo: Graph):\n vertices = grafo.vertices()\n visitado = [False]*(MAX + 1)\n\n if (len(vertices) > 0):\n dfs(grafo, vertices[0], visitado)\n\n n_visitados = 0\n for foi_visitado in visitado:\n if (foi_visitado):\n n_visitados += 1\n if (m == n and n == n_visitados):\n print(\"FHTAGN!\")\n else :\n print(\"NO\")\n\n\ndef main():\n grafo = Graph()\n n, m = map(int, input().split())\n for _ in range(m):\n u, v = map(int, input().split())\n grafo.add_aresta(u, v)\n isCthulhu(n, m, grafo)\nmain()\n\n \t\t\t\t \t\t\t\t \t \t\t \t\t \t \t \t\t", "num_nodes,num_edges = map(int,input().split())\r\nedges = {}\r\n\r\nfor i in range(num_edges):\r\n node1,node2 = map(int,input().split())\r\n keys = list(edges.keys())\r\n if node1 in keys:\r\n edges[node1].append(node2)\r\n else:\r\n edges[node1]=[node2]\r\n if node2 in keys:\r\n edges[node2].append(node1)\r\n else:\r\n edges[node2]=[node1]\r\n\r\n \r\ndef get_neighbors(edges,node):\r\n neighbors = edges[node]\r\n return neighbors\r\ndef DFS(edges, node):\r\n explorados = {node}\r\n to_explore = []\r\n for n in get_neighbors(edges, node):\r\n to_explore.append(n)\r\n while len(to_explore)>0:\r\n atual = to_explore[-1]\r\n to_explore.pop(-1)\r\n explorados.add(atual)\r\n neighbors = get_neighbors(edges,atual)\r\n for n in neighbors:\r\n if n not in explorados:\r\n to_explore.append(n)\r\n return explorados\r\n \r\n \r\n\r\ntotal = 0\r\nfor node1 in list(edges.keys()):\r\n explorados_final = DFS(edges,node1)\r\n if len(explorados_final)>=num_nodes:\r\n total+=1\r\n\r\n\r\nif total>=3 and num_edges==num_nodes:\r\n print('FHTAGN!')\r\nelse:\r\n print('NO')", "n, m = [int(i) for i in input().split()]\r\nc = [int(i) for i in range(n+1)]\r\n\r\ndef find (u):\r\n if u == c[u]:\r\n return u\r\n c[u] = find(c[u])\r\n return c[u]\r\n\r\nciclos = 0\r\nfor i in range(m):\r\n x, y = [int(j) for j in input().split()]\r\n x = find(x)\r\n y = find(y)\r\n if find(x) != find(y):\r\n c[x] = c[y] = max(x, y)\r\n else:\r\n ciclos += 1\r\n\r\nconexo = True\r\ncomponente = find(1)\r\nfor i in range(2, n+1, 1):\r\n if find(i) != componente:\r\n conexo = False\r\n\r\nif conexo and ciclos == 1:\r\n print('FHTAGN!')\r\nelse:\r\n print('NO')\r\nexit(0)", "import sys\r\n\r\n\r\ndef todos_visitados(list):\r\n return len(list) == sum(list)\r\n\r\n\r\ndef um_componente(vertices, n):\r\n vizinhos = [0]\r\n visitado = [False] * n\r\n\r\n while len(vizinhos) != 0:\r\n v = vizinhos.pop()\r\n visitado[v] = True\r\n\r\n for u in vertices[v]:\r\n if not visitado[u]:\r\n vizinhos.append(u)\r\n\r\n return todos_visitados(visitado)\r\n\r\n\r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n\r\n vertices = [[] for _ in range(n)]\r\n\r\n for _ in range(m):\r\n v, u = [int(x) - 1 for x in input().split()]\r\n vertices[v].append(u)\r\n vertices[u].append(v)\r\n\r\n somente_um_ciclo = n == m and um_componente(vertices, n)\r\n\r\n print(\"FHTAGN!\") if somente_um_ciclo else print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\ndef testin1(capsys):\r\n sys.stdin = open(\"in1\")\r\n main()\r\n out, err = capsys.readouterr()\r\n sys.stin = sys.__stdin__\r\n expected = open(\"in1_expeted\").read()\r\n assert out == expected\r\n\r\ndef testin2(capsys):\r\n sys.stdin = open(\"in2\")\r\n main()\r\n out, err = capsys.readouterr()\r\n sys.stin = sys.__stdin__\r\n expected = open(\"in2_expeted\").read()\r\n assert out == expected\r\n\r\ndef testin3(capsys):\r\n sys.stdin = open(\"in3\")\r\n main()\r\n out, err = capsys.readouterr()\r\n sys.stin = sys.__stdin__\r\n expected = open(\"in3_expeted\").read()\r\n assert out == expected\r\n\r\ndef testin4(capsys):\r\n sys.stdin = open(\"in4\")\r\n main()\r\n out, err = capsys.readouterr()\r\n sys.stin = sys.__stdin__\r\n expected = open(\"in4_expeted\").read()\r\n assert out == expected\r\n\r\ndef testin5(capsys):\r\n sys.stdin = open(\"in5\")\r\n main()\r\n out, err = capsys.readouterr()\r\n sys.stin = sys.__stdin__\r\n expected = open(\"in5_expeted\").read()\r\n assert out == expected\r\n\r\ndef testin6(capsys):\r\n sys.stdin = open(\"in6\")\r\n main()\r\n out, err = capsys.readouterr()\r\n sys.stin = sys.__stdin__\r\n expected = open(\"in6_expeted\").read()\r\n assert out == expected\r\n\r\n#https://stackoverflow.com/questions/26561822/pytest-capsys-checking-output-and-getting-it-reported\r\n#https://stackoverflow.com/questions/35851323/pytest-how-to-test-a-function-with-input-call", "n, m = map(int, input().split())\r\nif n < 3 or n != m:\r\n print('NO')\r\n exit()\r\ne, f = [[] for i in range(n + 1)], set()\r\nfor j in range(m):\r\n x, y = map(int, input().split())\r\n e[x].append(y)\r\n e[y].append(x)\r\ndef dfs(x):\r\n f.add(x)\r\n for y in e[x]:\r\n if not y in f:\r\n dfs(y)\r\ndfs(1)\r\nprint('FHTAGN!' if len(f) == n else 'NO')" ]

[ "n=int(input())\r\nif n>=4:\r\n print(\"YES\")\r\n if n==4:\r\n print(\"4 * 3 = 12\")\r\n print(\"12 * 2 = 24\")\r\n print(\"24 * 1 = 24\")\r\n elif n==5:\r\n print(\"5 * 4 = 20\")\r\n print(\"20 + 3 = 23\")\r\n print(\"23 + 2 = 25\")\r\n print(\"25 - 1 = 24\")\r\n else:\r\n print(\"4 * 3 = 12\")\r\n print(\"12 * 2 = 24\")\r\n print(str(n)+\" - \"+str(n-1)+\" = 1\")\r\n print(\"1 - 1 = 0\")\r\n for i in range(5,n-1):\r\n print(str(i)+\" * 0 = 0\")\r\n print(\"24 + 0 = 24\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nif n in [1, 2, 3]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if n % 2 == 0:\r\n for i in range((n - 4) // 2):\r\n print(f\"{n - 2 * i} - {n - 2 * i - 1} = 1\")\r\n print(\"4 * 3 = 12\", \"12 * 2 = 24\", \"24 * 1 = 24\", sep = '\\n')\r\n for j in range((n - 4) // 2):\r\n print(\"24 * 1 = 24\")\r\n else:\r\n for i in range((n - 5) // 2):\r\n print(f\"{n - 2 * i} - {n - 2 * i - 1} = 1\")\r\n print(\"2 + 1 = 3\", \"5 - 3 = 2\", \"2 * 3 = 6\", \"6 * 4 = 24\", sep = '\\n')\r\n for j in range((n - 5) // 2):\r\n print(\"24 * 1 = 24\")", "n = int(input())\n \nif n < 4:\n print( 'NO')\nelif n % 2 == 0:\n print ('YES')\n print ('1 + 2 = 3')\n print ('3 + 3 = 6')\n print ('6 * 4 = 24')\n for i in range(5, n + 1, 2):\n a, b = i, i + 1\n print( '%d - %d = 1' % (b, a))\n print ('24 * 1 = 24')\nelse:\n print ('YES')\n print ('2 + 5 = 7')\n print ('7 * 3 = 21')\n print ('21 + 4 = 25')\n print ('25 - 1 = 24')\n for i in range(6, n + 1, 2):\n a, b = i, i + 1\n print( '%d - %d = 1' % (b, a))\n print ('24 * 1 = 24')\n\n \t \t\t\t \t \t\t\t \t \t \t\t \t", "n = int(input())\r\nif n < 4: print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n while n > 5:\r\n a = str(n)\r\n b = str(n-1)\r\n print(a + \" - \" + b + \" = 1 \")\r\n print(\"1 * 1 = 1\")\r\n n -= 2\r\n if n == 4: print(\"4 * 3 = 12\\n12 * 2 = 24\\n24 * 1 = 24\")\r\n else: print(\"5 - 2 = 3\\n3 - 1 = 2\\n2 * 3 = 6\\n6 * 4 = 24\")\r\n", "a=int(input())\r\nif a<4:print('NO')\r\nelif a==4:print('YES\\n4 * 3 = 12\\n12 * 2 = 24\\n24 * 1 = 24')\r\nelif a==5:print('YES\\n5 * 4 = 20\\n20 + 3 = 23\\n23 + 2 = 25\\n25 - 1 = 24')\r\nelif a==6:print('YES\\n6 * 5 = 30\\n30 - 4 = 26\\n26 - 3 = 23\\n23 + 2 = 25\\n25 - 1 = 24')\r\nelif a==7:print('YES\\n7 * 6 = 42\\n5 * 4 = 20\\n42 - 20 = 22\\n22 + 3 = 25\\n25 - 2 = 23\\n23 + 1 = 24')\r\nelse:\r\n print('YES\\n5 + 8 = 13\\n6 + 7 = 13\\n13 - 13 = 0')\r\n for i in range(9,a+1):print('0 * %d = 0'%(i))\r\n print('4 * 3 = 12\\n12 * 2 = 24\\n24 * 1 = 24\\n24 + 0 = 24')", "n = int(input())\r\nif n < 4: print('NO')\r\nelse:\r\n print('YES')\r\n if n == 4: t = ['1 * 2 = 2', '2 * 3 = 6', '6 * 4 = 24']\r\n elif n == 5: t = ['2 - 1 = 1', '1 + 3 = 4', '4 * 5 = 20', '20 + 4 = 24']\r\n else:\r\n t = ['3 - 2 = 1', '1 - 1 = 0', '5 * 0 = 0', '6 * 4 = 24']\r\n t += [str(i) + ' * 0 = 0' for i in range(7, n + 1)]\r\n t.append('24 + 0 = 24')\r\n print('\\n'.join(t))", "n=int(input())\r\nif n<4:print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if n==4:print(\"4 * 3 = 12\\n12 * 2 = 24\\n24 * 1 =24\")\r\n elif n==5:print(\"5 * 4 = 20\\n20 + 3 = 23\\n23 + 2 = 25\\n25 - 1 = 24\")\r\n else:\r\n print(\"4 * 3 = 12\\n12 * 2 = 24\\n\"+str(n)+\" - \"+str(n-1)+\" = 1\\n1 - 1 = 0\")\r\n for i in range(5,n-1):print(str(i)+\" * 0 = 0\")\r\n print(\"24 + 0 = 24\")", "n = int(input())\n\nif (n < 4): print(\"NO\")\n\nif (n == 4):\n\tprint(\"YES\")\n\tprint(\"4 * 3 = 12\")\n\tprint(\"12 * 2 = 24\")\n\tprint(\"24 * 1 = 24\")\n\nif (n == 5):\n\tprint(\"YES\")\n\tprint(\"5 * 4 = 20\")\n\tprint(\"2 - 1 = 1\")\n\tprint(\"1 + 3 = 4\")\n\tprint(\"20 + 4 = 24\")\n\nif (n > 5):\n\tprint(\"YES\")\n\tprint(\"{} - {} = 1\".format(n, n - 1))\n\tprint(\"1 - 1 = 0\")\n\tfor i in reversed(range(5, n - 1)):\n\t\tprint(\"0 * {} = 0\".format(i))\n\tprint(\"4 * 3 = 12\")\n\tprint(\"12 * 2 = 24\")\n\tprint(\"24 + 0 = 24\")\n\n\n", "def four():\r\n print('YES')\r\n print('1 * 2 = 2')\r\n print('3 * 4 = 12')\r\n print('2 * 12 = 24')\r\n\r\ndef five():\r\n print('YES')\r\n print('1 + 2 = 3')\r\n print('5 - 3 = 2')\r\n print('2 * 4 = 8')\r\n print('3 * 8 = 24')\r\n\r\nn = int(input())\r\nif n <= 3:\r\n print('NO')\r\nelif n == 4:\r\n four()\r\nelif n == 5:\r\n five()\r\nelse:\r\n if n%2 == 0:\r\n four()\r\n for i in range(5, n, 2):\r\n print(f'{i+1} - {i} = 1')\r\n for i in range(0, n-5, 2):\r\n print('24 * 1 = 24')\r\n else:\r\n five()\r\n for i in range(6, n, 2):\r\n print(f'{i+1} - {i} = 1')\r\n for i in range(0, n-6, 2):\r\n print('24 * 1 = 24')\r\n\r\n", "\"\"\"\r\nCodeforces Contest 268 Div 1 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\ndef main():\r\n n, = read()\r\n if n < 4:\r\n print(\"NO\")\r\n return\r\n if n % 2 == 0:\r\n print(\"YES\")\r\n print(\"1 * 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n for i in range(5, n, 2):\r\n print(str(i+1) + \" - \" + str(i) + \" = 1\")\r\n print(\"24 * 1 = 24\")\r\n return\r\n if n % 2 == 1:\r\n print(\"YES\")\r\n print(\"1 * 2 = 2\")\r\n print(\"3 + 4 = 7\")\r\n print(\"7 + 5 = 12\")\r\n print(\"2 * 12 = 24\")\r\n for i in range(6, n, 2):\r\n print(str(i+1) + \" - \" + str(i) + \" = 1\")\r\n print(\"24 * 1 = 24\")\r\n return\r\n\r\n################################### NON-SOLUTION STUFF BELOW\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0: return inputs\r\n if mode == 1: return inputs.split()\r\n if mode == 2: return list(map(int, inputs.split()))\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = \"\"\r\n if isinstance(s, list): s = \" \".join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\nwrite(main())", "n = int(input())\nif n < 4:\n print('NO')\nelse:\n print('YES')\n if (n % 2 == 1):\n print('3 * 5 = 15')\n print('2 * 4 = 8')\n print('1 + 8 = 9')\n print('9 + 15 = 24')\n for i in range(6,n+1,2):\n print(i+1,' - ',i ,'= 1')\n print('24 * 1 = 24')\n else:\n print('1 * 2 = 2')\n print('3 * 4 = 12')\n print('12 * 2 = 24')\n for i in range(5,n+1,2):\n print(i+1,' - ',i ,'= 1')\n print('24 * 1 = 24')\n\t \t\t\t \t\t\t \t", "\"\"\"\n灵茶の试炼0714每日一题\nhttp://codeforces.com/problemset/problem/468/A\n\n输入整数 n(1<=n<=1e5)。\n一开始黑板上写了 n 个数：1,2,3,4,...,n。\n每次操作，你可以擦掉黑板上的两个数字 a 和 b，然后选择将 a+b，a-b 或 a*b 的其中一个写在黑板上。\n这样操作恰好 n-1 次后，最终黑板上就只剩下一个数字了。\n你能最终得到 24 吗？\n若不能，输出 \"NO\"；否则输出 \"YES\" 和具体操作方案，输出的格式形如\n\"a + b = c\"（注意空格）。若有多种操作方案，输出任意一种即可。\n\n样例：\n输入 1\n输出 NO\n\n输入 8\n输出\nYES\n8 * 7 = 56\n6 * 5 = 30\n3 - 4 = -1\n1 - 2 = -1\n30 - -1 = 31\n56 - 31 = 25\n25 + -1 = 24\n\"\"\"\n\ndef function468A(): # 思路大概是一步步往上找看，\n n = int(input())\n if n <= 3:\n print(\"NO\")\n return\n \n print(\"YES\")\n if n % 2 == 0: # 这种情况要转化到4的状态\n cnt = 0\n while n > 4:\n print(\"%d - %d = 1\"%(n, n-1))\n n -= 2\n cnt += 1\n for i in range(cnt):\n print(\"1 * 1 = 1\")\n print(\"4 * 3 = 12\")\n print(\"1 * 2 = 2\")\n print(\"2 * 12 = 24\")\n else:\n cnt = 0\n while n > 5:\n print(\"%d - %d = 1\"%(n, n-1))\n n -= 2\n cnt += 1\n for i in range(cnt):\n print(\"1 * 1 = 1\")\n print(\"2 * 4 = 8\")\n print(\"3 * 5 = 15\")\n print(\"8 + 15 = 23\")\n print(\"23 + 1 = 24\")\n \n\nif __name__ == '__main__':\n\n function468A()\n", "n = int(input())\r\nprint('YES' if n >= 4 else 'NO')\r\nif n == 4:\r\n print('4 * 3 = 12')\r\n print('12 * 2 = 24')\r\n print('24 * 1 = 24')\r\nelif n == 5:\r\n print('5 * 4 = 20')\r\n print('20 + 3 = 23')\r\n print('23 + 2 = 25')\r\n print('25 - 1 = 24')\r\nelif n >= 6:\r\n print('1 + 2 = 3')\r\n print('3 - 3 = 0')\r\n print('4 * 6 = 24')\r\n print('5 * 0 = 0')\r\n for i in range(7, n + 1):\r\n print(i, '* 0 = 0')\r\n print('24 + 0 = 24')", "n = int(input())\r\nif n < 4:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if n % 2 == 0:\r\n print(\"1 * 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n n = n - 4\r\n for i in range(n // 2):\r\n print(i*2 + 6,\"-\",i*2 + 5,\"= 1\")\r\n print(\"24 * 1 = 24\")\r\n else:\r\n print(\"5 - 2 = 3\")\r\n print(\"3 + 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n print(\"24 * 1 = 24\")\r\n n = n - 5\r\n for i in range(n // 2):\r\n print(i*2 + 7,\"-\",i*2 + 6,\"= 1\")\r\n print(\"24 * 1 = 24\")\r\n", "n = int(input())\n\nif n <= 3:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tif (n == 5):\n\t\tprint(\"\"\"5 - 2 = 3\n3 - 1 = 2\n4 * 3 = 12\n12 * 2 = 24\"\"\")\n\telse:\n\t\tprint(\"\"\"4 * 3 = 12\n12 * 2 = 24\"\"\")\n\t\tif (n >= 6):\n\t\t\tprint(\"\"\"6 - 5 = 1\n1 - 1 = 0\"\"\")\n\t\t\ti = 7\n\t\t\twhile i < n+1:\n\t\t\t\tprint(i, \"* 0 = 0\")\n\t\t\t\ti += 1\n\t\t\tprint(\"24 + 0 = 24\\n\")\n\t\telif n == 4:\n\t\t\tprint(\"24 * 1 = 24\\n\")", "numInts = int(input().strip())\r\n\r\nif numInts < 4:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tif numInts == 4:\r\n\t\tprint(\"1 * 2 = 2\")\r\n\t\tprint(\"2 * 3 = 6\")\r\n\t\tprint(\"6 * 4 = 24\")\r\n\telif numInts == 5:\r\n\t\tprint(\"5 - 2 = 3\")\r\n\t\tprint(\"3 - 1 = 2\")\r\n\t\tprint(\"3 * 4 = 12\")\r\n\t\tprint(\"12 * 2 = 24\")\r\n\telse:\r\n\t\tprint(\"3 - 2 = 1\")\r\n\t\tprint(\"1 - 1 = 0\")\r\n\t\tprint(\"4 * 6 = 24\")\r\n\t\tprint(\"5 * 0 = 0\")\r\n\t\tfor x in range(7, numInts + 1):\r\n\t\t\tprint(str(x) + \" * 0 = 0\")\r\n\t\tprint(\"24 + 0 = 24\")", "n = int(input())\r\n\r\nif n < 4 :\r\n print('NO')\r\nelse:\r\n print('YES')\r\n while n > 5 :\r\n print(n,'-',n-1,'= 1')\r\n print('1 * 1 = 1')\r\n n -= 2\r\n if n == 4 :\r\n print(\"3 * 4 = 12\")\r\n print(\"12 * 2 = 24\")\r\n print(\"24 * 1 = 24\")\r\n else:\r\n print(\"5 * 4 = 20\")\r\n print(\"20 + 3 = 23\")\r\n print(\"23 + 2 = 25\")\r\n print(\"25 - 1 = 24\")\r\n", "\"Codeforces Round #384 (Div. 2)\"\r\n\"C. Vladik and fractions\"\r\n# y=int(input())\r\n# a=y\r\n# b=a+1\r\n# c=y*b\r\n# if y==1:\r\n# print(-1)\r\n# else: \r\n# print(a,b,c)\r\n\"Technocup 2017 - Elimination Round 2\"\r\n\"D. Sea Battle\"\r\n# n,a,b,k=map(int,input().split())\r\n# s=list(input())\r\n# n=len(s)\r\n# lz=[]\r\n# zeros=[]\r\n# indexes=[]\r\n# flage=0\r\n# if s[0]==\"0\":\r\n# lz.append(0)\r\n# flage=1 \r\n# for i in range(1,n):\r\n# if flage==1 and s[i]==\"1\":\r\n# zeros.append(i-1-(lz[-1])+1)\r\n# lz.append(i-1)\r\n# flage=0\r\n# elif flage==0 and s[i]==\"0\":\r\n# lz.append(i)\r\n# flage=1 \r\n\r\n# if s[-1]==\"0\":\r\n# zeros.append(n-1-(lz[-1])+1)\r\n# lz.append(n-1)\r\n# min_no_spaces=(a-1)*b\r\n# spaces_left=n-k \r\n# l=len(lz) \r\n# # print(lz)\r\n# # print(zeros) \r\n# shot=0\r\n# for i in range(len(zeros)):\r\n# h=i*2\r\n# if min_no_spaces!=0:\r\n# # print(min_no_spaces)\r\n# if min_no_spaces>=zeros[i]:\r\n# min_no_spaces-=(int(zeros[i]/b))*b\r\n# elif min_no_spaces<zeros[i]:\r\n# shot+=int((zeros[i]-min_no_spaces)/b)\r\n# for j in range(int((zeros[i]-min_no_spaces)/b)):\r\n# indexes.append(lz[h]+((j+1)*b))\r\n# min_no_spaces=0 \r\n# elif min_no_spaces==0:\r\n# # print(min_no_spaces)\r\n# shot+=int(zeros[i]/b)\r\n# for j in range(int(zeros[i]/b)):\r\n# indexes.append(lz[h]+((j+1)*b))\r\n# print(shot)\r\n# for i in indexes:\r\n# print(i,\" \",end=\"\",sep=\"\")\r\n\"Codeforces Round #268 (Div. 1)\"\r\n\"A. 24 Game\"\r\ny=int(input())\r\na=[u for u in range(1,y+1)]\r\nif y>5:\r\n print(\"YES\")\r\n print(\"6 * 4 = 24\")\r\n print(\"5 - 3 = 2\")\r\n print(\"2 - 2 = 0\")\r\n print(\"1 * 0 = 0\")\r\n for i in range(7,y+1):\r\n print(i,\"* 0 = 0\")\r\n print(\"24 + 0 = 24\")\r\nelif y==5:\r\n print(\"YES\")\r\n print(\"5 + 1 = 6\")\r\n print(\"6 * 2 = 12\")\r\n print(\"4 * 3 = 12\")\r\n print(\"12 + 12 = 24\")\r\nelif y==4:\r\n print(\"YES\")\r\n print(\"1 * 2 = 2\")\r\n print(\"3 * 4 = 12\")\r\n print(\"2 * 12 = 24\")\r\nelse:\r\n print(\"NO\") ", "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 if n<=3: print('NO'); return\r\n print('YES') \r\n if n&1: \r\n for i in range(n,5,-2):\r\n print(i,'-',i-1,'=',1)\r\n ones=(n-5)//2+1\r\n for i in range(ones-1):\r\n print(1,'*',1,'=',1)\r\n print(\"1 * 2 = 2\")\r\n print(\"3 + 4 = 7\")\r\n print(\"7 + 5 = 12\")\r\n print(\"12 * 2 = 24\")\r\n else:\r\n for i in range(n,4,-2):\r\n print(i,'-',i-1,'=',1)\r\n ones=(n-4)//2+1\r\n for i in range(ones-1):\r\n print(1,'*',1,'=',1)\r\n print(\"1 * 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\nmain()\r\n", "n = int(input())\r\nif n < 4:\r\n print(\"NO\")\r\nelif (n & 1):\r\n print(\"YES\")\r\n print(\"5 - 1 = 4\")\r\n print(\"4 - 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n for i in range(6, n, 2):\r\n print(f\"{i + 1} - {i} = 1\\n1 * 24 = 24\")\r\nelse:\r\n print(\"YES\")\r\n print(\"1 * 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n for i in range(5, n, 2):\r\n print(f\"{i + 1} - {i} = 1\\n1 * 24 = 24\")", "n = int(input())\nif n <= 3:\n\tprint(\"NO\")\nelif n%2 == 0:\n\tprint(\"YES\")\n\tfor i in range(5,n,2):\n\t\tprint(i+1,\"-\",i,\"= 1\")\n\tprint(\"1 * 2 = 2\")\n\tprint(\"2 * 3 = 6\")\n\tprint(\"6 * 4 = 24\")\n\tfor i in range(5,n,2):\n\t\tprint(\"24 * 1 = 24\")\nelse:\n\tprint(\"YES\")\n\tfor i in range(6,n,2):\n\t\tprint(i+1,\"-\",i,\"= 1\")\n\tprint(\"5 - 1 = 4\")\n\tprint(\"4 - 2 = 2\")\n\tprint(\"2 * 3 = 6\")\n\tprint(\"6 * 4 = 24\")\n\tfor i in range(6,n,2):\n\t\tprint(\"24 * 1 = 24\")\n\t \t\t \t\t \t\t \t \t \t \t \t \t\t\t", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor\n\nN = int(input())\n\nif N<4:\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n\nif N%2==0:\n print(\"1 * 2 = 2\")\n print(\"3 * 4 = 12\")\n print(\"12 * 2 = 24\")\n\n for x in range(5,N+1,2):\n print(x+1,\"-\",x,\"=\",1)\n print(\"24 * 1 = 24\")\n\nelse:\n print(\"4 * 5 = 20\")\n print(\"3 + 2 = 5\")\n print(\"5 - 1 = 4\")\n print(\"20 + 4 = 24\")\n\n for x in range(6,N+1,2):\n print(x+1,\"-\",x,\"=\",1)\n print(\"24 * 1 = 24\")", "n = int(input())\r\nif n<4:\r\n print('NO')\r\nelif n%2==0:\r\n print('YES')\r\n print('4 * 3 = 12')\r\n print('2 * 1 = 2')\r\n print('12 * 2 = 24')\r\n for i in range(n,4,-2):\r\n print(f'{i} - {i-1} = 1')\r\n for i in range((n-4)//2):\r\n print('24 * 1 = 24')\r\nelse:\r\n print('YES')\r\n print('5 - 3 = 2')\r\n print('1 + 2 = 3')\r\n print('3 * 4 = 12')\r\n print('12 * 2 = 24')\r\n for i in range(n,5,-2):\r\n print(f'{i} - {i-1} = 1')\r\n for i in range((n-5)//2):\r\n print('24 * 1 = 24')", "i=int(input())\r\nif i<4: print('NO')\r\nelif i%2==0:\r\n print('YES')\r\n print('1 * 2 = 2')\r\n print('2 * 3 = 6')\r\n print('6 * 4 = 24')\r\n for x in range(5, i, 2):\r\n print('{0} - {1} = 1'.format(x+1,x))\r\n print('24 * 1 = 24')\r\nelse:\r\n print('YES')\r\n print('5 - 2 = 3')\r\n print('3 - 1 = 2')\r\n print('2 * 3 = 6')\r\n print('6 * 4 = 24')\r\n for x in range(6, i, 2):\r\n print('{0} - {1} = 1'.format(x+1,x))\r\n print('24 * 1 = 24')", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\nif n < 4:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n if n%2 == 0:\r\n print('1 * 2 = 2')\r\n print('2 * 3 = 6')\r\n print('6 * 4 = 24')\r\n for i in range(5, n, 2):\r\n print('{} - {} = 1'.format(i+1, i))\r\n print('24 * 1 = 24')\r\n else:\r\n print('5 - 3 = 2')\r\n print('2 + 1 = 3')\r\n print('2 * 3 = 6')\r\n print('6 * 4 = 24')\r\n for i in range(6, n, 2):\r\n print('{} - {} = 1'.format(i+1, i))\r\n print('24 * 1 = 24')\r\n", "import sys\n\nn = int(input())\n\nif 6<=n:\n print(\"YES\")\n\n print(\"6 * 4 = 24\")\n print(\"3 - 2 = 1\")\n print(\"1 - 1 = 0\")\n print(\"0 * 5 = 0\")\n\n for i in range(7,n+1):\n print(\"0 * \"+str(i)+\" = 0\")\n\n print(\"0 + 24 = 24\")\n \n sys.exit(0)\n\nif 5 == n:\n\n print(\"YES\")\n\n print(\"5 + 1 = 6\")\n print(\"6 * 4 = 24\")\n print(\"3 - 2 = 1\")\n print(\"24 * 1 = 24\")\n\n sys.exit(0)\n\nif 4 == n:\n\n print(\"YES\")\n\n print(\"1 + 2 = 3\")\n print(\"3 + 3 = 6\")\n print(\"6 * 4 = 24\")\n\n sys.exit(0)\n\nprint(\"NO\")\n", "n = int(input())\r\nif n < 4:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n if n % 2 == 1:\r\n for i in range(6, n, 2):\r\n print('%d - %d = 1' % (i + 1, i))\r\n for i in range(0, n - 5, 2):\r\n print('1 * 1 = 1')\r\n print('2 + 4 = 6')\r\n print('3 * 6 = 18')\r\n print('18 + 5 = 23')\r\n print('23 + 1 = 24')\r\n else:\r\n for i in range(5, n, 2):\r\n print('%d - %d = 1' % (i + 1, i))\r\n for i in range(0, n - 4, 2):\r\n print('1 * 1 = 1')\r\n print('2 * 3 = 6')\r\n print('6 * 4 = 24')\r\n print('24 * 1 = 24')", "n=int(input())\r\nif n<=3:\r\n print(\"NO\")\r\nif n==4:\r\n print(\"YES\\n3 * 4 = 12\\n2 * 1 = 2\\n12 * 2 = 24\")\r\nif n==5:\r\n print(\"YES\\n4 * 5 = 20\\n20 + 2 = 22\\n22 + 3 = 25\\n25 - 1 = 24\")\r\nif n==6:\r\n print(\"YES\\n6 - 5 = 1\\n3 * 4 = 12\\n2 * 1 = 2\\n12 * 2 = 24\\n1 * 24 = 24\")\r\nif n==7:\r\n print(\"YES\\n7 - 6 = 1\\n4 * 5 = 20\\n20 + 2 = 22\\n22 + 3 = 25\\n25 - 1 = 24\\n1 * 24 = 24\")\r\nif n==8:\r\n print(\"YES\")\r\n print(\"%d - %d = 1\\n%d - %d = 1\"%(n, n-1, n-2, n-3))\r\n print(\"1 - 1 = 0\")\r\n print(\"3 * 4 = 12\\n2 * 1 = 2\\n12 * 2 = 24\\n0 + 24 = 24\")\r\nif n>8:\r\n print(\"YES\")\r\n print(\"%d - %d = 1\\n%d - %d = 1\"%(n, n-1, n-2, n-3))\r\n print(\"1 - 1 = 0\")\r\n i=n-4\r\n while i>4:\r\n print(\"%d * 0 = 0\"%(i))\r\n i-=1\r\n print(\"3 * 4 = 12\\n2 * 1 = 2\\n12 * 2 = 24\\n0 + 24 = 24\")\r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\nif n <= 3:\r\n print(\"NO\")\r\nelif n % 2 == 0:\r\n print(\"YES\")\r\n print(\"1 * 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n for i in range(5, n, 2):\r\n print(\"%d - %d = 1\" % (i + 1, i))\r\n print(\"24 * 1 = 24\")\r\nelse:\r\n print(\"YES\")\r\n print(\"2 - 1 = 1\")\r\n print(\"1 + 3 = 4\")\r\n print(\"4 * 5 = 20\")\r\n print(\"20 + 4 = 24\")\r\n for i in range(6, n, 2):\r\n print(\"%d - %d = 1\" % (i + 1, i))\r\n print(\"24 * 1 = 24\")\r\n", "def f():\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\nx=int(input())\r\nif x<4:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if x==4:\r\n f()\r\n print(\"24 *1 = 24\")\r\n elif x==5:\r\n print(\"5 + 1 = 6\")\r\n print(\"6 * 4 = 24\")\r\n print(\"3 - 2 = 1\")\r\n print(\"1 * 24 = 24\")\r\n else:\r\n print(\"6 - 5 = 1\")\r\n print(\"1 - 1 = 0\")\r\n for q in range(7,x+1):\r\n print(q,\"* 0 = 0\")\r\n f()\r\n print(\"24 + 0 = 24\")\r\n", "n=int(input())\r\nif n <= 3:\r\n print (\"NO\")\r\nelif n % 2==0:\r\n print (\"YES\")\r\n print (\"1 * 2 = 2\")\r\n print (\"2 * 3 = 6\")\r\n print (\"6 * 4 = 24\")\r\n for i in range(5, n, 2):\r\n print (i + 1,\" - \", i, \" = 1\")\r\n print (\"24 * 1 = 24\")\r\nelse:\r\n print (\"YES\")\r\n print (\"2 - 1 = 1\")\r\n print (\"1 + 3 = 4\")\r\n print (\"4 * 5 = 20\")\r\n print (\"20 + 4 = 24\")\r\n for i in range(6,n,2):\r\n print (\"%d - %d = 1\" %(i+1,i))\r\n print (\"24 * 1 = 24\")", "n=int(input())\r\nif(n<=3):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if(n%2==0):\r\n print(\"1 * 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n for i in range(5,n,2):\r\n print(str(i+1)+\" - \"+str(i)+\" = 1\")\r\n print(\"24 * 1 = 24\")\r\n else:\r\n print(\"5 + 1 = 6\")\r\n print(\"6 * 4 = 24\")\r\n print(\"3 - 2 = 1\")\r\n print(\"24 * 1 = 24\")\r\n for i in range(6,n,2):\r\n print(str(i+1)+\" - \"+str(i)+\" = 1\")\r\n print(\"24 * 1 = 24\")", "#https://codeforces.com/problemset/problem/468/A\r\n#1500分\r\n#21:00\r\n\r\nn = int(input())\r\nif n <= 3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if n == 4:\r\n print(\"1 * 2 = 2\")\r\n print(\"2 * 3 = 6\")\r\n print(\"6 * 4 = 24\")\r\n elif n == 5:\r\n print(\"4 * 5 = 20\")\r\n print(\"2 + 3 = 5\")\r\n print(\"5 + 20 = 25\")\r\n print(\"25 - 1 = 24\")\r\n elif n == 6:\r\n print(\"2 + 3 = 5\")\r\n print(\"5 * 1 = 5\")\r\n print(\"5 - 5 = 0\")\r\n print(\"4 * 6 = 24\")\r\n print(\"24 + 0 = 24\")\r\n elif n == 7:\r\n print(\"3 + 7 = 10\")\r\n print(\"2 * 5 = 10\")\r\n print(\"10 - 10 = 0\")\r\n print(\"1 * 0 = 0\")\r\n print(\"4 * 6 = 24\")\r\n print(\"24 + 0 = 24\")\r\n else:\r\n #把3和8单独扣出来 & 将其他数组合成1或者0\r\n if n % 2 == 0:\r\n #8 => 1,2,4,5,6,7 => 1,1,1\r\n #10 => 1,2,4,5,6,7,9,10 => 1,1,1,1\r\n #12 => 1,2,4,5,6,7,9,10,11,12 => 1,1,1,1,1\r\n one_cnts = (n - 2) // 2\r\n start = n\r\n while start >= 2:\r\n if start == 8 or start == 3:\r\n start -= 1\r\n print(\"{} - {} = {}\".format(start, start - 1, 1))\r\n start -= 2\r\n for _ in range(one_cnts-1):\r\n print(\"1 * 1 = 1\")\r\n print(\"3 * 8 = 24\")\r\n print(\"24 * 1 = 24\")\r\n else:\r\n #9 => 1, 2,4,5,6,7,9 => 1, 2,1,2\r\n #11 => 1, 2,4,5,6,7,9,10,11 => 1,2,1,2,1\r\n #13 => 1, 2,4,5,6,7,9,10,11,12,13 => 1,2,1,2,1,1\r\n print(\"4 - 2 = 2\")\r\n print(\"9 - 7 = 2\")\r\n one_cnts = (n - 3) // 2 - 2 + 1 \r\n start = n\r\n while start >= 6:\r\n if start == 3 or start == 8:\r\n start -= 1\r\n elif start == 9 or start == 4:\r\n start -= 3\r\n print(\"{} - {} = {}\".format(start, start - 1, 1))\r\n start -= 2\r\n for _ in range(one_cnts - 1):\r\n print(\"1 * 1 = 1\")\r\n print(\"2 - 2 = 0\")\r\n print(\"3 * 8 = 24\")\r\n print(\"24 * 1 = 24\")\r\n print(\"24 + 0 = 24\")\r\n", "n = int(input())\n\nif n <= 3:\n print('NO')\n\nelif n == 4:\n print('YES')\n print('4 * 3 = 12')\n print('12 * 2 = 24')\n print('24 * 1 = 24')\n\nelif n == 5:\n print('YES')\n print('4 * 5 = 20')\n print('20 + 3 = 23')\n print('23 + 2 = 25')\n print('25 - 1 = 24')\n\nelse:\n print('YES')\n if (n-5) % 2 == 0:\n for i in range(6, n+1, 2):\n print('{} - {} = 1'.format(i+1, i))\n print('1 * 5 = 5')\n print('4 * 5 = 20')\n print('20 + 3 = 23')\n print('23 + 2 = 25')\n print('25 - 1 = 24')\n else:\n for i in range(5, n+1, 2):\n print('{} - {} = 1'.format(i+1, i))\n print('1 * 4 = 4')\n print('4 * 3 = 12')\n print('12 * 2 = 24')\n print('24 * 1 = 24')\n ", "n = int(input())\r\nnum = [i for i in range(2, n+1)]\r\nif n in [1,2,3]:\r\n print('NO')\r\n exit()\r\nprint(\"YES\")\r\nones = 0\r\nif n%2 == 0:\r\n ones += 1\r\n while num[-1] != 4 and num[-2] != 3:\r\n print(num[-1], '-', num[-2], '=', 1)\r\n num.pop()\r\n num.pop()\r\n ones += 1\r\n print(4, '*', 3, '=', 12)\r\n print(12, '*', 2, '=', 24)\r\nelse:\r\n while num[-1] != 5 and num[-2] != 4:\r\n print(num[-1], '-', num[-2], '=', 1)\r\n num.pop()\r\n num.pop()\r\n ones += 1\r\n print(5, '-', 3, '=', 2)\r\n print(2, '*', 4, '=', 8)\r\n print(1, '+', 2, '=', 3)\r\n print(8, '*', 3, '=', 24)\r\n\r\nwhile ones != 0:\r\n print(24, '*', 1, '=', 24)\r\n ones -= 1", "def main():\n n = int(input())\n \n if n <= 3:\n print('NO')\n return\n _4 = ('4 * 3 = 12\\n'\n '12 * 2 = 24\\n'\n '1 * 24 = 24')\n _5 = ('5 - 3 = 2\\n'\n '2 + 1 = 3\\n'\n '3 * 4 = 12\\n'\n '2 * 12 = 24')\n\n print('YES')\n for i in range(n, 4 + n%2, -2):\n print('{} - {} = 1'.format(i, i-1))\n print('{0} * 1 = {0}'.format(i-2))\n print(_5 if n%2 else _4)\n\n\nif __name__ == '__main__':\n main()\n\n", "#! /bin/env python3\n\nimport sys\n\n\nclass InputBuffer:\n\n @classmethod\n def initial(cls):\n cls.buffer = []\n cls.index = -1\n for line in sys.stdin.readlines():\n cls.buffer.extend(line.split())\n\n @classmethod\n def next_str(cls):\n cls.index += 1\n if cls.index >= len(cls.buffer):\n return None\n else:\n return cls.buffer[cls.index]\n\n @classmethod\n def next_int(cls):\n return int(cls.next_str())\n\n\ndef main():\n n = InputBuffer.next_int()\n if n < 4:\n print(\"NO\")\n return\n print(\"YES\")\n while n > 5:\n print(\"{0} - {1} = 1\".format(n, n-1))\n print(\"1 * 1 = 1\")\n n -= 2\n if n == 5:\n print(\"5 + 1 = 6\")\n print(\"6 - 3 = 3\")\n elif n == 4:\n print(\"1 * 2 = 2\")\n print(\"2 * 3 = 6\")\n print(\"6 * 4 = 24\")\n\n\nif __name__ == '__main__':\n InputBuffer.initial()\n main()\n", "n = int(input())\r\nif n <= 3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if n == 4:\r\n print(\"1 * 2 = 2\\n2 * 3 = 6\\n6 * 4 = 24\")\r\n elif n == 5:\r\n print(\"2 - 1 = 1\\n5 + 4 = 9\\n9 - 1 = 8\\n8 * 3 = 24\")\r\n else:\r\n print(\"6 * 4 = 24\\n1 + 2 = 3\\n3 - 3 = 0\\n5 * 0 = 0\")\r\n for i in range(7, n+1):\r\n print(str(i) + \" * 0 = 0\")\r\n print(\"0 + 24 = 24\")", "def printer(n):\n ones=1\n if(n%2==0 and n>4):\n while(n>4):\n print(str(n)+\" \"+\"-\"+\" \"+str(n-1)+\" = \"+\"1\")\n n-=2\n ones+=1\n \n elif(n%2==1 and n>5):\n while(n>5):\n print(str(n)+\" \"+\"-\"+\" \"+str(n-1)+\" = \"+\"1\")\n n-=2\n ones+=1\n \n if(ones==1):\n if(n==4):\n print(\"1 * 2 = 2\")\n print(\"2 * 3 = 6\")\n print(\"4 * 6 = 24\")\n else:\n print(\"1 + 5 = 6\")\n print(\"3 - 2 = 1\")\n print(\"1 * 4 = 4\")\n \n print(\"4 * 6 = 24\")\n else:\n for i in range(ones-1):\n print(\"1 * 1 = 1\")\n ones=1\n printer(n)\nn=int(input())\nif(n<4):\n print(\"NO\")\nelse:\n print(\"YES\")\n printer(n)\n ", "def main():\n n = int(input())\n if n < 4:\n print('NO')\n return\n print('YES')\n n -= 4\n l = [('1 + 2 = 3\\n3 + 3 = 6\\n6 * 4 = 24',\n '1 + 4 = 5\\n5 + 5 = 10\\n10 - 2 = 8\\n8 * 3 = 24')[n % 2]]\n for x in range(n % 2, n, 2):\n l.append(' '.join((str(x + 6), '-', str(x + 5), '= 1\\n24 * 1 = 24')))\n print('\\n'.join(l))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nif n>=4:\r\n print(\"YES\")\r\n if n%2:\r\n for i in range(n,5,-2):\r\n print(\"%s - %s = 1\"%(i,i-1))\r\n print(\"1 * 1 = 1\")\r\n print(\"5 * 3 = 15\")\r\n print(\"4 * 2 = 8\")\r\n print(\"15 + 8 = 23\")\r\n print(\"23 + 1 = 24\")\r\n else:\r\n for i in range(n,4,-2):\r\n print(\"%s - %s = 1\"%(i,i-1))\r\n print(\"1 * 1 = 1\")\r\n print(\"4 * 3 = 12\")\r\n print(\"2 * 1 = 2\")\r\n print(\"12 * 2 =24\")\r\n\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nif n <= 3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n i = n\r\n while i > 5:\r\n print(f\"{i} - {i-1} = 1\")\r\n print(\"1 * 1 = 1\")\r\n i -= 2\r\n \r\n if i == 4:\r\n print(\"4 * 3 = 12\")\r\n print(\"12 * 2 = 24\")\r\n print(\"1 * 24 = 24\")\r\n \r\n if i == 5:\r\n print(\"5 * 4 = 20\")\r\n print(\"20 + 3 = 23\")\r\n print(\"23 + 2 = 25\")\r\n print(\"25 - 1 = 24\")" ]

[ "import math\n\nN = 2000001\nsq = math.floor(N ** 0.5)\nisprime = [True] * N\nfor p in range(2, N):\n if isprime[p]:\n for i in range(p**2, N, p):\n isprime[i] = False\n\ndef solve():\n n = int(input())\n A = [int(x) for x in input().split()]\n odd = list(filter(lambda x: x%2, A))\n even = list(filter(lambda x: x%2 == 0, A))\n k = odd.count(1)\n res = None\n if k > 0:\n for i in even:\n if isprime[i+1]:\n res = [1]*k + [i]\n return res\n if k > 1:\n res = [1]*k\n return res\n if res is None:\n for i in odd:\n for j in even:\n if isprime[i+j]:\n res = [i, j]\n return res\n return [A[0]]\n\nres = solve()\nprint(len(res))\nprint(' '.join(map(str, res)))\n", "n=2*10**6\r\nprime = [True] * (n+1)\r\n\r\nprime[0] = False\r\nprime[1] = False\r\nfor i in range(2, n+1):\r\n if (prime[i]):\r\n if (i * i <= n):\r\n for j in range(i*i, n+1, i):\r\n prime[j] = False\r\n\r\ndef isprime(x):\r\n return prime[x]\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na_odd = []\r\na_even = []\r\ncount_of_1 = 0\r\nfor x in a:\r\n if x%2:\r\n a_odd.append(x)\r\n else:\r\n a_even.append(x)\r\n if x == 1:\r\n count_of_1 += 1\r\n#print(a_odd)\r\n#print(a_even)\r\n#print(count_of_1)\r\n\r\nif count_of_1 >= 2:\r\n ans = '1 '*count_of_1\r\n for x in a_even:\r\n if isprime(x+1):\r\n print(count_of_1+1)\r\n print(ans+str(x))\r\n exit()\r\n print(count_of_1)\r\n print(ans)\r\nelse:\r\n for x in a_even:\r\n for y in a_odd:\r\n if isprime(x+y):\r\n print(2)\r\n print(x, y)\r\n exit()\r\n #print('does not exist subset with >=2 elements')\r\n print(1)\r\n print(a[0])", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nq = [0] * (1000000 + 1)\r\nprime = [0] * (2000000 + 1)\r\n\r\nfor i in range(2, int(2e6 + 1)):\r\n for j in range(2 * i, int(2e6 + 1), i):\r\n prime[j] = 1\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(len(a)):\r\n q[a[i]] += 1\r\n\r\nif q[1] >= 2:\r\n for i in range(len(a)):\r\n if a[i] > 1 and prime[a[i] + 1] == 0:\r\n print(q[1] + 1)\r\n print('1 ' * q[1] + str(a[i]))\r\n exit(0)\r\n\r\n print(q[1])\r\n print('1 ' * q[1])\r\n exit(0)\r\n\r\nfor i in range(len(a)):\r\n for j in range(i + 1, len(a)):\r\n if prime[a[i] + a[j]] == 0:\r\n print('2')\r\n print(a[i],a[j])\r\n exit(0)\r\n\r\nprint('1')\r\nprint(a[0])\r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nP = [-1 for _ in range(2000001)]\r\n\r\ndef premier(n):\r\n if P[n] >= 0:\r\n return P[n]\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n P[n] = False\r\n return False\r\n P[n] = True\r\n return True\r\n\r\ne = L.count(1)\r\nif n == 1:\r\n print(1)\r\n print(L[0])\r\nelif e > 1:\r\n L.sort()\r\n i = 1\r\n while i < n and L[i] == 1:\r\n i += 1\r\n u = i\r\n ok = 0\r\n while i < n:\r\n if premier(L[i]+1):\r\n print(u+1)\r\n for j in range(u):\r\n print(1,end=\" \")\r\n print(L[i])\r\n ok = 1\r\n break\r\n i += 1\r\n if ok == 0:\r\n print(u)\r\n for i in range(u):\r\n print(1,end=\" \")\r\nelse:\r\n ok = 0\r\n for i in range(n-1): \r\n for j in range(i+1,n):\r\n t = premier(L[i]+L[j])\r\n if t:\r\n print(2)\r\n print(str(L[i])+\" \"+str(L[j]))\r\n ok = 1\r\n break\r\n if ok:\r\n break\r\n if ok == 0:\r\n print(1)\r\n print(L[0])\r\n", "import sys\r\n\r\n\r\ndef get_primes(n: int):\r\n from itertools import chain\r\n from array import array\r\n primes = {2, 3}\r\n is_prime = (array('b', (0, 0, 1, 1, 0, 1, 0)) +\r\n array('b', (1, 0, 0, 0, 1, 0))*((n-1)//6))\r\n\r\n for i in chain.from_iterable((range(5, n+1, 6), range(7, n+1, 6))):\r\n if is_prime[i]:\r\n primes.add(i)\r\n for j in range(i*3, n+1, i*2):\r\n is_prime[j] = 0\r\n\r\n return is_prime, primes\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nis_prime, primes = get_primes(2*10**6)\r\n\r\none_count = a.count(1)\r\nif one_count > 1:\r\n for i in range(n):\r\n if a[i] != 1 and is_prime[a[i] + 1]:\r\n print(one_count + 1)\r\n print(*([1]*one_count + [a[i]]))\r\n exit()\r\n else:\r\n print(one_count)\r\n print(*([1] * one_count))\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n if i != j and is_prime[a[i] + a[j]]:\r\n print(2)\r\n print(a[i], a[j])\r\n exit()\r\n else:\r\n print(1)\r\n print(a[0])\r\n" ]

[ "_, k = map(int, input().split())\nval = [0] + list(map(int, input().split()))\nn = len(val)\npls = []\n\ncur, i, sm = 0, 0, 0\nwhile i < n:\n if val[i] >= 0:\n cur += 1\n else:\n if cur > 0:\n pls.append(cur)\n cur = 0\n i += 1\n\nsm = sum(p for p in pls)\npls = pls[1:]\n\nif cur > 0:\n one = cur\n sm += cur\nelse:\n one = 10 ** 19\n\nans = 0\n\nfor i in range(1, n):\n if (val[i] >= 0 and val[i - 1] < 0) or (val[i] < 0 and val[i - 1] >= 0):\n ans += 1\n\nif n - sm > k:\n print(-1)\nelse:\n pls.sort()\n rem = k - (n - sm)\n for p in pls:\n if rem >= p:\n rem -= p\n ans -= 2\n\n if rem >= one:\n ans -= 1\n\n print(ans)", "n,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\np=[]\r\ncount=0\r\ncount1=0\r\nfor i in range(len(d)):\r\n if d[i]>=0:\r\n count+=1\r\n if d[i]<0 or i==len(d)-1:\r\n p.append(count)\r\n count=0\r\n count1+=1\r\nif d[len(d)-1]>=0:\r\n count1-=1\r\nif count1==0:\r\n print(0)\r\n exit()\r\na=p.pop() if d[len(d)-1]>=0 else 0\r\nif len(p)>0:\r\n p.reverse()\r\n p.pop()\r\n p.sort()\r\ncount=k-len(p)-1 if count1>1 else k-count1\r\nif count<0:\r\n print(-1)\r\n exit()\r\ncount1=0\r\nfor i in range(len(p)):\r\n if(count-p[i]>=0):\r\n count1+=1\r\n count-=p[i]\r\n else:\r\n break\r\nans=2*(len(p)+1-count1)\r\nif count-a>=0:\r\n ans-=1\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nt = [1] + list(map(int, input().split()))\r\nn += 1\r\nu = []\r\nfor i in range(n):\r\n if t[i] < 0:\r\n u.append(i)\r\nk -= len(u)\r\nif k < 0:\r\n ans = -1\r\n print(ans)\r\n exit()\r\nans = 0\r\nfor i in range(n - 1):\r\n if (t[i] >= 0 and t[i + 1] < 0) or (t[i] < 0 and t[i + 1] >= 0):\r\n ans += 1\r\nv = []\r\nfor i in range(len(u) - 1):\r\n if u[i + 1] - u[i] - 1:\r\n v.append(u[i + 1] - u[i] - 1)\r\nv.sort()\r\nfor i in v:\r\n if k >= i:\r\n ans -= 2\r\n k -= i\r\n else:\r\n break\r\nif u and 0 < n - u[-1] - 1 <= k:\r\n ans -= 1\r\nprint(ans)", "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,k=rm()\r\n a=rl()\r\n b=[1 if a[0]>=0 else -1]\r\n pos=1 if a[0]>=0 else 0\r\n for i in range(1,n):\r\n if int(a[i]<0)^pos: b[-1]+=(2*pos-1)\r\n else:\r\n pos=1-pos\r\n b.append(2*pos-1)\r\n m=len(b)\r\n l=n\r\n for i in range(m):\r\n if b[i]<0: l=i;break\r\n r=-1\r\n for i in range(m-1,-1,-1):\r\n if b[i]<0:r=i;break\r\n if l>r: return 0\r\n \r\n c=[]\r\n tot=0\r\n for i in range(l,r+1):\r\n if b[i]>=0: c.append(b[i])\r\n tot+=abs(b[i])\r\n c.sort(key=lambda x: -x)\r\n even=2\r\n for i in range(len(c)):\r\n if tot<=k: break\r\n else: tot-=c[i];even+=2\r\n if tot>k: return -1\r\n tot=0\r\n for i in range(l,m):\r\n tot+=abs(b[i])\r\n odd=1\r\n for i in range(len(c)):\r\n if tot<=k: break\r\n else: tot-=c[i];odd+=2\r\n if tot>k: return even\r\n return min(even,odd)\r\n\r\nprint(main())", "import copy\r\nimport gc\r\nimport itertools\r\nfrom array import array\r\nfrom fractions import Fraction\r\nimport heapq\r\nimport math\r\nimport operator\r\nimport os, sys\r\nimport profile\r\nimport cProfile\r\nimport random\r\nimport re\r\nimport string\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, deque, Counter\r\nfrom functools import reduce\r\nfrom io import IOBase, BytesIO\r\nfrom itertools import count, groupby, accumulate, permutations, combinations_with_replacement, product\r\nfrom math import gcd\r\nfrom operator import xor, add\r\nfrom typing import List\r\n\r\n# region fastio\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# print = lambda d: sys.stdout.write(str(d)+\"\\n\")\r\ndef read_int_list(): return list(map(int, input().split()))\r\n\r\n\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\n\r\n\r\ndef read_int(): return int(input())\r\n\r\n\r\n# endregion\r\n\r\n### CODE HERE\r\n\r\n\r\n\r\n# sys.setrecursionlimit(212345)\r\n\r\ndef solve(n, k, temps):\r\n # print(temps)\r\n rem = k - sum(temps)\r\n if rem < 0: return -1\r\n\r\n cate = [(t, len([*g])) for t, g in groupby(temps)]\r\n n = len(cate)\r\n res = n - 1\r\n\r\n if n & 1:\r\n _, last = cate.pop()\r\n n -= 1\r\n else:\r\n last = 1234567890\r\n\r\n # print([cate[i][1] for i in range(2, n, 2)], last)\r\n\r\n cur = 0\r\n\r\n for x in sorted([cate[i][1] for i in range(2, n, 2)]):\r\n if cur + x > rem: break\r\n cur += x\r\n res -= 2\r\n\r\n if cur + last <= rem:\r\n res -= 1\r\n\r\n return res\r\n\r\ndef main():\r\n n, k = read_int_tuple()\r\n temps = [0] + [1 if t < 0 else 0 for t in read_int_list()]\r\n print(solve(n, k, temps))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n# cProfile.run(\"main()\")\r\n", "import math\r\nfrom collections import Counter, defaultdict\r\nfrom itertools import accumulate\r\n\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\nts = list(R()) + [-1]\r\nk -= sum(1 if t < 0 else 0 for t in ts[:n])\r\nres = 0 if ts[0] >= 0 else 1\r\nfor i in range(1, n):\r\n if ts[i - 1] < 0 and ts[i] >= 0 or ts[i - 1] >= 0 and ts[i] < 0:\r\n res += 1\r\nlocs = [i for i, t in enumerate(ts) if t < 0]\r\nps = sorted((y - x - 1, y) for x, y in zip(locs, locs[1:]) if y - x > 1)\r\nres1 = res\r\nk1 = k\r\nfor p in ps:\r\n if k >= p[0]:\r\n res -= (2 if p[1] < n else 1)\r\n k -= p[0]\r\n if k1 >= p[0] and p[1] < n:\r\n res1 -= 2\r\n k1 -= p[0]\r\nres = res if k >= 0 else math.inf\r\nres1 = res1 if k1 >= 0 else math.inf\r\nprint(min(res, res1) if min(res, res1) < math.inf else -1)", "from itertools import groupby\r\n\r\n\r\ndef solve(N, K, A):\r\n A = [x < 0 for x in A]\r\n # A[i] = 1: need winter\r\n # A[i] = 0: dont need winter\r\n if sum(A) > K:\r\n return -1\r\n B = []\r\n i = 0\r\n while i < len(A) and A[i] == 0:\r\n i += 1\r\n for i in range(i, len(A)):\r\n B.append(A[i])\r\n\r\n cur_season = 0\r\n base = last = 0\r\n weights = []\r\n tires = K\r\n for season, grp in groupby(B):\r\n grp = list(grp)\r\n w = len(grp)\r\n base += 1\r\n if season == 0: # summer\r\n weights.append(w)\r\n last = w\r\n else:\r\n tires -= w\r\n last = 0\r\n\r\n if last:\r\n weights.pop()\r\n weights.sort()\r\n\r\n # try two cases: using last and not using last\r\n tires1 = tires\r\n ans1 = base\r\n for w in weights:\r\n if tires1 >= w:\r\n tires1 -= w\r\n ans1 -= 2\r\n\r\n tires2 = tires\r\n ans2 = base\r\n if tires2 >= last > 0:\r\n tires2 -= last\r\n ans2 -= 1\r\n for w in weights:\r\n if tires2 >= w:\r\n tires2 -= w\r\n ans2 -= 2\r\n return min(ans1, ans2)\r\n\r\n\r\nrlist = lambda: list(map(int, input().split()))\r\nN, K = rlist()\r\n\r\nprint(solve(N, K, rlist()))\r\n" ]

[ "import math\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\nm=int(input())\r\nbrr=[int(x) for x in input().split()]\r\nmx=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if int(math.ceil(brr[j]/arr[i]))==brr[j]//arr[i]:\r\n if brr[j]//arr[i]>mx:\r\n mx=brr[j]//arr[i]\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if int(math.ceil(brr[j]/arr[i]))==brr[j]//arr[i]:\r\n if brr[j]//arr[i]==mx:\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\ncount = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if((b[j]/a[i])==int(b[j]/a[i])):\r\n count.append(int(b[j]/a[i]))\r\no = max(count)\r\nprint(count.count(o))\r\n", "import sys\nmy_file = sys.stdin\n#my_file = open(\"input.txt\", \"r\")\nline = my_file.read().split(\"\\n\")\nn = int(line[0])\na = [int(i) for i in line[1].split()]\nm = int(line[2])\nb = [int(i) for i in line[3].split()]\nints = []\nfor an in a:\n for bn in b:\n if bn//an == bn/an:\n ints.append(bn//an)\nints.sort(reverse=True)\nprint(ints.count(ints[0]))", "import sys\n\ndef main():\n n = int(sys.stdin.readline())\n a = list(map(int, sys.stdin.readline().split(' ')))\n m = int(sys.stdin.readline())\n b = list(map(int, sys.stdin.readline().split(' ')))\n m = 0\n for ai in a:\n for bj in b:\n if bj % ai == 0:\n m = max(m, bj // ai)\n \n s = set()\n for ai in a:\n for bj in b:\n if bj % ai == 0 and bj // ai == m:\n s.add((min(ai, bj), max(ai, bj)))\n\n sys.stdout.write('{}\\n'.format(len(s)))\n\n\nmain()\n", "n = int(input())\r\np = input().split()\r\na = [int(i) for i in p]\r\nm = int(input())\r\nq = input().split()\r\nb = [int(i) for i in q]\r\nc = []\r\nfor i in a:\r\n for j in b:\r\n if int(j/i) == j/i:\r\n c.append(j/i)\r\nk=0\r\nfor i in c:\r\n if i == max(c):\r\n k+=1\r\nprint(k)\r\n", "def BicycleChain(n,a,m,b):\r\n\tmaxGear = 0\r\n\tcntMax = 0\r\n\tfor x in b:\r\n\t\tfor y in a:\r\n\t\t\tratio = x/y\r\n\t\t\tif ratio.is_integer():\r\n\t\t\t\tif ratio>maxGear:\r\n\t\t\t\t\tcntMax = 1\r\n\t\t\t\t\tmaxGear = ratio\r\n\t\t\t\telif ratio==maxGear:\r\n\t\t\t\t\tcntMax+=1\r\n\r\n\treturn cntMax\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nprint(BicycleChain(n,a,m,b))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\np=1\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n c=0\r\n ans=b[j]/a[i]\r\n if ans%1==0 and ans>p:\r\n p=ans\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]/a[i]==p:\r\n c+=1\r\nprint(c)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\ntemp = [0]\r\nfor i in a:\r\n for j in b:\r\n if j%i==0:\r\n if j/i > max(temp):\r\n temp = []\r\n temp.append(j/i)\r\n elif j/i == max(temp):\r\n temp.append(j/i)\r\nprint(len(temp))", "# cook your dish here\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\ncount=0\r\nm =0\r\nmylist = []\r\nfor i in a:\r\n for j in b:\r\n if j%i==0:\r\n c = j/i\r\n mylist.append(c)\r\nm = max(mylist)\r\ncount = mylist.count(m)\r\nprint(count)", "# https://codeforces.com/problemset/problem/215/A\r\n\r\n\"\"\"\r\nA bicycle chain consists of two parts\r\nn stars attached to the pedal axle\r\nm stars attached to rear wheel axle\r\n\r\nThe ith star on the pedal axle has a_i teeth\r\nThe jth star on the rear wheel axle has b_j teeth\r\n\r\na and b are strictly increasing\r\n\r\nAny pair (i, j) is called a gear\r\nGear ratio is b_j / a_i\r\n\r\nFind number of gears with max integer gear ratio\r\n\r\nJust check all pairs\r\n\"\"\"\r\n\r\nimport sys\r\n\r\nn = int(sys.stdin.readline())\r\na = list(map(int, sys.stdin.readline().split()))\r\nm = int(sys.stdin.readline())\r\nb = list(map(int, sys.stdin.readline().split()))\r\n\r\ngear_ratios = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n gear_ratio = b[j] / a[i]\r\n if gear_ratio % 1 == 0:\r\n gear_ratios.append(gear_ratio)\r\n\r\nanswer = gear_ratios.count(max(gear_ratios))\r\n\r\nsys.stdout.write(str(answer))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\ndiv = []\r\nfor i in b:\r\n for j in a:\r\n if i/j%1==0:\r\n div.append(i//j)\r\nprint(div.count(max(div)))\r\n", "n = 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\n\r\nmax_ = -1\r\ncount = 0\r\n\r\nfor ai in a:\r\n for bi in b:\r\n ratio = bi/ai\r\n #print(ai, bi)\r\n if ratio == int(ratio):\r\n if ratio > max_:\r\n max_ = ratio\r\n count = 1\r\n elif ratio == max_:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\na=[]\r\nb=[]\r\n\r\nc=input()\r\na=c.split()\r\nm = int(input()) \r\n\r\nd=(input())\r\nb=d.split()\r\n\r\nma=0\r\nans=0\r\n\r\n\r\nfor i in b:\r\n for j in a:\r\n if((int(i))%(int(j))==0):\r\n ma=max(ma,(int(i))/(int(j)))\r\n\r\n \r\n \r\nfor i in b:\r\n for j in a:\r\n \r\n if(int(i)%int(j)==0):\r\n if int(i)/int(j) == ma:\r\n \r\n ans=ans+1\r\n\r\nprint (ans)", "n = int(input())\r\nli1 = list(map(int,input().split()))\r\nm = int(input())\r\nli2 = list(map(int,input().split()))\r\nli2.sort(reverse=True)\r\nli=[0]*1000000\r\nmaxx=0\r\nfor i in li1:\r\n for j in li2:\r\n if j%i==0:\r\n z = j//i\r\n if maxx<z:\r\n maxx=z\r\n li[maxx]+=1\r\n elif maxx==z:\r\n li[maxx]+=1\r\nprint(li[maxx])", "from collections import Counter\r\ndef solve():\r\n n=int(input())\r\n p=[int(i) for i in input().split()]\r\n m=int(input())\r\n b=[int(i) for i in input().split()]\r\n\r\n Max,count=0,0\r\n array=[]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if b[j]//p[i]==b[j]/p[i]:\r\n if b[j]//p[i]>=Max:\r\n Max=b[j]//p[i]\r\n array.append(Max)\r\n\r\n array.sort(reverse=True)\r\n count=1\r\n for i in range(len(array)-1):\r\n if array[i]==array[i+1]:\r\n count+=1\r\n else:\r\n break\r\n\r\n return count\r\n \r\n\r\n\r\n\r\n\r\n\r\nprint(solve())\r\n\r\n", "import math\nn = int(input())\na = list(map(int,input().split()))\nm = int(input())\nb = list(reversed(list(map(int,input().split()))))\n\ncount = 0\nma = -math.inf\nfor ai in a:\n for bi in b:\n if bi%ai == 0:\n pm = bi//ai\n if pm>ma:\n ma = pm\n count=1\n elif pm==ma:\n count+=1\n break\n\nprint(count)", "n=int(input())\r\nara=list(map(int,input().split()))\r\nm=int(input())\r\narb=list(map(int,input().split()))\r\nma,co=0,0\r\nfor i in range(len(ara)):\r\n for j in range(len(arb)):\r\n r=arb[j]/ara[i]\r\n if(r>ma and r%1==0):\r\n ma=r\r\n co=1\r\n if(r==ma):\r\n co+=1\r\nprint(co-1)\r\n \r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nmx = []\r\nfor i in b:\r\n for j in a:\r\n if i % j == 0:\r\n mx.append(i // j)\r\nmxk = max(mx)\r\nl = 0\r\nfor i in mx:\r\n if i == mxk:\r\n l += 1\r\nprint(l)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nmax1=-1\r\nfor i in range(n):\r\n for j in range(m):\r\n s=b[j]/a[i]\r\n if(s.is_integer()==True):\r\n if(max1<=s):\r\n max1=s\r\n\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n s=b[j]/a[i]\r\n if(s.is_integer()==True):\r\n if(max1==s):\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nmax_gear = 0\r\ngear_counter = {}\r\n\r\nfor a_gear in a:\r\n for b_gear in b:\r\n if b_gear % a_gear == 0:\r\n tmp = b_gear // a_gear\r\n gear_counter[tmp] = gear_counter.get(tmp, 0) + 1\r\n max_gear = max(max_gear, tmp)\r\n\r\nprint(gear_counter.get(max_gear, 0))", "import sys\r\n\r\n# with open('input.txt') as f:\r\n# lines = f.readlines()\r\n\r\nlines = []\r\n\r\nfor line in sys.stdin:\r\n lines.append(line)\r\n\r\n\r\nfront = lines[0]\r\nrear = lines[2]\r\n\r\nfront_stars = []\r\nrear_stars = []\r\n\r\nfor star in lines[1].replace(\"\\n\",\"\").split(\" \"):\r\n front_stars.append(star)\r\n\r\nfor star in lines[3].replace(\"\\n\",\"\").split(\" \"):\r\n rear_stars.append(star)\r\n\r\ninterger_gear_ratios = {}\r\n\r\nfor front_star in front_stars:\r\n for rear_star in rear_stars:\r\n gear_ratio = int(rear_star) / int(front_star)\r\n\r\n if gear_ratio % 1 == 0:\r\n if interger_gear_ratios.get(int(gear_ratio), None):\r\n interger_gear_ratios[gear_ratio] += 1\r\n else:\r\n interger_gear_ratios[int(gear_ratio)] = 1\r\n\r\nprint(interger_gear_ratios[max(interger_gear_ratios)])\r\n", "n=int(input())\r\na = list(map(int, input().split(\" \")))\r\nm=int(input())\r\nb = list(map(int, input().split(\" \")))\r\nx=[]\r\nfor i in range(m):\r\n for j in range(n):\r\n if b[i]%a[j]==0:\r\n x.append(b[i]//a[j])\r\nprint(x.count(max(x)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nmaxi=-1\r\ncount=0\r\nfor i in range(0,len(a)):\r\n for j in range(0,len(b)):\r\n if b[j]%a[i]==0:\r\n if b[j]/a[i]>maxi:\r\n maxi=b[j]/a[i]\r\n count=1\r\n elif b[j]/a[i]==maxi:\r\n count+=1\r\nprint(count)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\nbrr=list(map(int,input().split()))\r\nans=[]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n temp=brr[j]/arr[i]\r\n curr=int(temp)\r\n if(curr==temp):\r\n ans.append(curr)\r\n\r\nm1=max(ans)\r\nprint(ans.count(m1))\r\n\r\n", "n = int (input ())\r\nA = list (map (int, input ().split ()))\r\nm = int (input ())\r\nB = list (map (int, input ().split ()))\r\nc = 0\r\nC=[]\r\nfor i in range(n):\r\n for j in range (m):\r\n if B[j] % A[i] == 0:\r\n C.append(B[j]//A[i])\r\n c += 1\r\nx=max(C)\r\nprint(C.count(x))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nli = []\r\nfor i in range(m):\r\n for j in range(n):\r\n if (b[i]/a[j]) % 1 == 0:\r\n li.append(b[i]/a[j])\r\nif len(li) == 0:\r\n print(0)\r\nelse:\r\n print(li.count(max(li)))\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = []\r\nm = int(input())\r\nl2 = list(map(int,input().split()))\r\n\r\nfor j in range(0,m):\r\n for i in range(0,n):\r\n\r\n if l2[j] % l[i] == 0 :\r\n a.append(l2[j]/l[i])\r\n\r\nmx = max(a)\r\n\r\nprint(a.count(mx))\r\n\r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nm=int(input())\r\nbrr=[int(i) for i in input().split()]\r\nc=0\r\nl=[]\r\nfor i in arr:\r\n for j in brr:\r\n if j%i==0:\r\n l.append(j//i)\r\nprint(l.count(max(l)))\r\n \r\n ", "x=int(input())\r\ns=[int(n) for n in input().split()]\r\ny=int(input())\r\nz=[int(n) for n in input().split()]\r\np=[]\r\nfor n in z:\r\n\tfor k in s:\r\n\t\tif n%k==0:\r\n\t\t\tp.append(n//k)\r\nprint(p.count(max(p)))", "n = int(input())\r\na = [int(x) for x in input().split(' ')]\r\nm = int(input())\r\nb = [int(x) for x in input().split(' ')]\r\n\r\nM = [0, 0]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n if b[j] // a[i] > M[0]:\r\n M = [b[j] // a[i], 1]\r\n elif b[j] // a[i] == M[0]:\r\n M[1] += 1\r\nprint(M[1])", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nmax = 0\r\nfor i in a:\r\n for j in b:\r\n if j%i== 0 and j/i > max:\r\n max = j/i\r\n count = 1\r\n #print(max,i,j,count)\r\n elif j/i == max:\r\n count += 1\r\n else:\r\n pass\r\nprint(count)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm= int(input())\r\nb = list(map(int,input().split()))\r\n\r\nans = 0\r\nl=[]\r\nfor i in range(len(b)):\r\n for j in range(len(a)):\r\n if b[i]/a[j]==b[i]//a[j]:\r\n \r\n if len(l)==0:\r\n l.append(b[i]//a[j])\r\n else:\r\n if l[-1]< b[i]//a[j]:\r\n l=[]\r\n l.append(b[i]//a[j])\r\n elif l[-1]== b[i]//a[j]:\r\n l.append(b[i]//a[j])\r\n\r\nprint(len(l))\r\n ", "from itertools import product\n\nn = int(input())\nateeth = [int(i) for i in input().split()]\nm = int(input())\nbteeth = [int(i) for i in input().split()]\n\nmax_ratio = 0\nnum_gears = 0\n\nfor teeth1, teeth2 in product(ateeth, bteeth):\n x = teeth2/teeth1\n if x == int(x):\n if x > max_ratio:\n num_gears = 1\n max_ratio = x\n elif x == max_ratio:\n num_gears += 1\n\nprint(num_gears)\n", "n, a = input(), map(int, input().split())\r\nm, b = input(), list(map(int, input().split()))\r\n \r\nr = [y // x for x in a for y in b if y % x == 0]\r\nprint(r.count(max(r)))", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nm=int(input())\r\nb=list(map(int,input().split(\" \")))\r\nlis=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tk=b[j]//a[i]\r\n\t\tif(k*a[i]==b[j]):\r\n\t\t\tlis.append(k)\r\nd=max(lis)\r\nprint(lis.count(d))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\ncount = 0\r\ngear_ratios = []\r\n\r\nfor j in range(m):\r\n for i in range(n):\r\n if b[j]/a[i] == b[j]//a[i]:\r\n gear_ratios.append(b[j]//a[i])\r\n\r\ngear_ratios.sort(reverse=True)\r\n\r\nfor i in gear_ratios:\r\n if i==max(gear_ratios):\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nmax = 0\r\ncount =0\r\nfor i in range(m):\r\n for j in range(n):\r\n x = b[i]/a[j]\r\n if x.is_integer():\r\n if x>max:\r\n max = x\r\n count = 0\r\n if x == max:\r\n count += 1\r\n \r\nprint(count)", "import sys\r\n\r\n# with open('input.txt') as f:\r\n# l = f.readlines()\r\n\r\nlines = []\r\n\r\nfor line in sys.stdin:\r\n lines.append(line.replace(\"\\n\",\"\").split(\" \"))\r\n\r\ninterger_gear_ratios = {}\r\n\r\nfor front_star in range(int(lines[0][0])):\r\n for rear_star in range(int(lines[2][0])):\r\n gear_ratio = int(lines[3][rear_star]) / int(lines[1][front_star])\r\n\r\n if gear_ratio % 1 == 0:\r\n if interger_gear_ratios.get(int(gear_ratio), None):\r\n interger_gear_ratios[gear_ratio] += 1\r\n else:\r\n interger_gear_ratios[int(gear_ratio)] = 1\r\n\r\nprint(interger_gear_ratios[max(interger_gear_ratios)])\r\n", "n = int(input())\r\narr1 = list(map(int, input().split()))\r\nm = int(input())\r\narr2 = list(map(int, input().split()))\r\nmaxi = 0\r\nc = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n ratio = arr2[j]/arr1[i]\r\n if (ratio).is_integer() == True:\r\n if ratio > maxi:\r\n maxi = ratio\r\n if ratio >= maxi: \r\n c.append(ratio)\r\n\r\nprint(c.count(max(c)))\r\n ", "import sys\r\n\r\ninput = sys.stdin.readline\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\n\r\nmv = -1\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n if b[j] // a[i] > mv:\r\n mv = b[j] // a[i]\r\n cnt = 1\r\n elif mv == b[j] // a[i]:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n=int(input())\r\nf=list(map(int,input().split()))\r\nm=int(input())\r\nr=list(map(int,input().split()))\r\nl=[x//y for x in r for y in f if x%y==0]\r\nprint(l.count(max(l)))", "n = input()\r\na = list(map(int, input().split()))\r\nm = input()\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\nb.sort(reverse=True)\r\ngear = []\r\n\r\nfor i in a:\r\n for j in b:\r\n if j/i == j//i:\r\n gear += [j//i]\r\nans = gear.count(max(gear))\r\nprint(ans)\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\nb=int(input())\r\nr=list(map(int,input().split()))\r\nres,m=0,0\r\nfor j in r:\r\n\tfor jj in l:\r\n\t\tif j%jj==0:\r\n\t\t\tp=j//jj\r\n\t\t\tif p>m:\r\n\t\t\t\tm=p\r\n\t\t\t\tres=1\r\n\t\t\telif p==m:\r\n\t\t\t\tres+=1\r\nprint(res)", "n = int(input())\r\ni = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nj = list(map(int, input().split()))\r\n\r\nmax = 0\r\ncount = 0\r\n\r\nfor l in j[::-1]:\r\n for k in i:\r\n if l % k == 0:\r\n if (l // k) > max:\r\n max = (l // k)\r\n count = 1\r\n break\r\n elif (l // k) == max:\r\n count += 1\r\n break\r\n else:\r\n pass\r\n\r\nprint(count)", "n = int(input())\r\nx = list(int(a) for a in input().split())\r\nm = int(input())\r\ny = list(int(a) for a in input().split())\r\ngear_ratio = []\r\nfor i in range(m):\r\n for j in range(n):\r\n if y[i]%x[j]==0:\r\n gear_ratio.append(y[i]/x[j])\r\ntimes = 0\r\nfor i in gear_ratio :\r\n if i == max(gear_ratio):\r\n times +=1 \r\nprint(times) \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n ", "n=int(input())\na=[int(x) for x in input().split()]\nm=int(input())\nb=[int(x) for x in input().split()]\nc=[]\nfor i in a:\n for j in b:\n if j%i==0:\n c.append(j//i)\nprint(c.count(max(c)))\n \t \t \t \t\t \t \t\t\t\t \t \t\t \t\t", "input()\r\nFront, Result = list(map(int, input().split())), []\r\ninput()\r\nRear = list(map(int, input().split()))\r\nfor i in Front:\r\n for j in Rear:\r\n if j / i == j // i:\r\n Result.append(j // i)\r\nprint(Result.count(max(Result)))\r\n\r\n# UB_CodeForces\r\n# Advice: Please just act, don't just talk\r\n# Location: Behind my desk\r\n# Caption: 1 more codes, reaching 1100 problems", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nd={}\r\nl=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i] == 0:\r\n l.append(b[j]//a[i])\r\n try:\r\n d[b[j]//a[i]]+=1\r\n except:\r\n d[b[j]//a[i]]=1\r\nprint(d[max(l)])\r\n", "n = input()\na = list(map(int,input().split()))\nm = input()\nb = list(map(int,input().split()))\nans = [-1,-1]\n\nfor bb in b:\n\tfor aa in a:\n\t\tt = bb//aa\n\t\tif(t == bb/aa):\n\t\t\tif t == ans[0]:\n\t\t\t\tans[1]+=1\n\t\t\telif t > ans[0]:\n\t\t\t\tans = [t,1]\nprint(ans[1])\n\t\t\t\n", "#import pdb\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nb=0\r\nc=0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tq,r=divmod(l2[j],l1[i])\r\n#\t\tpdb.set_trace()\r\n\t\tif r==0 and q>b:\r\n\t\t\tb=q\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif l2[j]%l1[i]==0:\r\n\t\t\tif l2[j]//l1[i]==b:\r\n\t\t\t\tc+=1\r\nprint(c)\r\n\r\n#3 5 7 11\r\n#3 5 7 22\r\n\r\n", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nm=int(input())\r\nB=list(map(int,input().split()))\r\narr=[]\r\nfor i in A:\r\n for j in B:\r\n if j%i==0:\r\n arr.append(j//i)\r\nprint(arr.count(max(arr)))\r\n", "class CodeforcesTask215ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.a = []\n self.m = 0\n self.b = []\n\n def read_input(self):\n self.n = int(input())\n self.a = [int(x) for x in input().split(\" \")]\n self.m = int(input())\n self.b = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n ratios = []\n for x in range(self.n):\n for y in range(self.m):\n ratio = self.b[y] / self.a[x]\n if ratio.is_integer():\n ratios.append(ratio)\n ratios.sort()\n self.result = str(ratios.count(ratios[-1]))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask215ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "# codeforces.com/problemset/problem/215/A\nn = int(input())\nl1 = [int(x) for x in input().split()]\nm = int(input())\nl2 = [int(x) for x in input().split()]\n\nans = [x//y for x in l2 for y in l1 if x%y==0]\nprint(ans.count(max(ans)))\n", "def main():\r\n _ = int(input())\r\n ns = list(map(int, input().split()))\r\n _ = int(input())\r\n ms = list(map(int, input().split()))\r\n\r\n gs = []\r\n for a in ns:\r\n for b in ms:\r\n if b % a == 0:\r\n gs.append(b // a)\r\n\r\n gs = sorted(gs, reverse = True)\r\n\r\n sol = 0\r\n for g in gs:\r\n if g == gs[0]:\r\n sol += 1\r\n print(sol)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nlist = []\r\n\r\nfor j in range(0,m):\r\n for i in range (0,n):\r\n if b[j]%a[i]==0:\r\n list.append(b[j]/a[i])\r\n \r\nma = max(list)\r\nprint(list.count(ma))", "from tkinter import X\r\n\r\n\r\nn=int(input())\r\nlist1=list(map(int,input().split()))\r\n\r\nm=int(input())\r\n\r\nlist2=list(map(int,input().split()))\r\n\r\nd={}\r\nfor x in list2:\r\n for y in list1:\r\n if x/y+0.5==x//y+0.5:\r\n if x/y in d:\r\n d[x//y]+=1\r\n else:\r\n d[x//y]=1\r\nj=max(d.keys())\r\nprint(d[j])\r\n\r\n\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nmx=0\r\nc={mx:0}\r\nfor i in range(n):\r\n for j in range(m):\r\n if(b[j]%a[i]==0 and b[j]//a[i]>=mx):\r\n mx=b[j]//a[i]\r\n if mx in c:\r\n c[mx]+=1\r\n else:\r\n c[mx]=1\r\nprint(c[mx])", "split = lambda: list(map(int, input().split()))\r\na = int(input())\r\npedal = split()\r\nb = int(input())\r\nrear = split()\r\nratios = {}\r\nfor x in pedal:\r\n for y in rear:\r\n p = y / x\r\n if int(p) == p:\r\n p = int(p)\r\n if not p in ratios:\r\n ratios[p] = 0\r\n ratios[p] += 1\r\nprint(ratios[max(ratios.keys())])", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = int(input())\r\nB = list(map(int, input().split()))\r\n\r\nmaxR = None\r\n\r\nfor a in A:\r\n for b in B:\r\n if b % a == 0:\r\n if maxR == None:\r\n maxR = b // a\r\n maxR = max(maxR, b // a)\r\n \r\nSb = set(B)\r\nans = 0\r\nfor a in A:\r\n if a * maxR in Sb:\r\n ans += 1\r\nprint(ans)", "#ROUNIAAUDI\r\nnum1=int(input())\r\nlist1=list(map(int,input().split()))\r\nnum2=int(input())\r\nlist2=list(map(int,input().split()))\r\nf=[0 for i in range((50*50)+4)]\r\n\r\nfor i in range(num2):\r\n for j in range(num1):\r\n if list2[i]%list1[j]==0:\r\n #print(list2[i],list1[j],end=\" \")\r\n f.append(int(list2[i]//list1[j]))\r\nprint(f.count(max(f)))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\nl=[]\r\nfor i in b:\r\n for j in a:\r\n if i%j==0:\r\n l.append(i/j)\r\nm=max(l)\r\nprint(l.count(m))", "import collections as cl\r\n\r\n\r\nn, a = int(input()), map(int, input().split())\r\nm, b = int(input()), list(map(int, input().split()))\r\n\r\nans = cl.Counter([xb // xa for xa in a for xb in b if xb % xa == 0])\r\nprint(ans[max(ans.keys())])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\nmaxRatio = float('-inf')\r\ngearCount = 0\r\nfor x in a:\r\n for y in b:\r\n ratio = y / x\r\n if int(ratio) == ratio:\r\n if ratio > maxRatio:\r\n maxRatio = ratio\r\n gearCount = 1\r\n elif ratio == maxRatio:\r\n gearCount += 1\r\nprint(gearCount)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn=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\tfor j in range(m):\r\n\t\td=b[j]/a[i]\r\n\t\tif d%1==0:\r\n\t\t\tc.append(d)\r\nprint(c.count(max(c)))\t\t\t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nmax = 0\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n if b[j] % a[i] == 0:\r\n if b[j] // a[i] > max:\r\n max = b[j] // a[i]\r\ncount = 0\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n if b[j] % a[i] == 0:\r\n if b[j] // a[i] == max:\r\n count += 1\r\nprint(count)", "a = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nb = int(input())\r\ny = list(map(int, input().split()))\r\n\r\nt = 0\r\nf = 0\r\n\r\nfor i in range(b):\r\n for j in range(a):\r\n if y[i] % x[j] == 0:\r\n d = y[i] // x[j]\r\n if t < d or t == 0:\r\n t = d\r\n f = 1\r\n elif t == d:\r\n f += 1\r\n\r\nprint(f)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nmaxVal = 0\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i]==0:\r\n ratio = b[j]//a[i]\r\n if ratio>maxVal:\r\n maxVal = ratio\r\n count = 1\r\n elif ratio == maxVal:\r\n count+=1\r\n \r\n\r\nprint(count)", "def bicycleChain():\r\n n=int(input())\r\n a=[int(x) for x in input().split()]\r\n m=int(input())\r\n b=[int(x) for x in input().split()]\r\n c=0\r\n highi=0\r\n for i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i]==0:\r\n if b[j]//a[i]>highi:\r\n highi=b[j]//a[i]\r\n c=1\r\n elif b[j]//a[i]==highi:\r\n c=c+1\r\n print(c)\r\n\r\nbicycleChain()\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_pedal = int(input())\r\npedal_stars = list(map(int, input().split()))\r\nnum_wheel = int(input())\r\nwheel_stars = list(map(int, input().split()))\r\n\r\nmax_ratio = -99999\r\ncount = 0\r\nfor wheel_star in wheel_stars:\r\n for pedal_star in pedal_stars:\r\n if wheel_star % pedal_star == 0:\r\n if wheel_star // pedal_star > max_ratio:\r\n max_ratio = wheel_star // pedal_star\r\n count = 1\r\n elif wheel_star // pedal_star == max_ratio:\r\n count += 1\r\nprint(count)", "n=int(input());a=list(map(int,input().split()))\r\nm=int(input());b=list(map(int,input().split()));u=0;c=0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tt=b[j]/a[i]\r\n\t\tif int(t)==t:u=max(t,u)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tt=b[j]/a[i]\r\n\t\tif t==u:c+=1\r\nprint(c)", "from collections import Counter\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nmaxi = -1\r\nratios = []\r\nfor i in range(n):\r\n for j in range(m):\r\n ratio = b[j]/a[i]\r\n if int(ratio) == ratio:\r\n ratios.append(ratio)\r\n if ratio > maxi:\r\n maxi = ratio\r\ncnt = Counter(ratios)\r\nans = cnt[maxi]\r\nprint(ans)\r\n ", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n m = int(input())\r\n B = list(map(int, input().split()))\r\n C = []\r\n for a in A:\r\n for b in B:\r\n if b % a == 0:\r\n C.append(b // a)\r\n ans = 0\r\n max_val = max(C)\r\n for a in C:\r\n if a == max_val:\r\n ans += 1\r\n print(ans)\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\nb=list(map(int,input().split()))\r\narr=[]\r\ncount=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(b[j]%a[i]==0):\r\n arr.append((b[j]//a[i]))\r\n#print(arr)\r\nfor i in range(len(arr)):\r\n #print(arr[i],max(arr))\r\n if(max(arr)==arr[i]):\r\n count+=1\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nx=[v//u for u in a for v in b if v%u==0]\r\nprint(x.count(max(x)))", "n = int(input())\narr1 = list(map(int, input().split()))\n\nm = int(input())\narr2 = list(map(int, input().split()))\n\nints = []\n\nfor i in range(n):\n for j in range(m):\n if arr2[j]%arr1[i] == 0:\n ints.append(arr2[j]//arr1[i])\n\n\nprint(ints.count(max(ints)))\n", "input()\r\na=input().split()\r\ninput()\r\nb=input().split()\r\nc=[]\r\nfor i in a:\r\n for j in b:\r\n if (int(j)%int(i))==0:\r\n c.append(int(j)/int(i))\r\nprint(c.count(max(c)))\r\n", "n = int(input())\r\nmas1 = list(map(int, input().split()))\r\nm = int(input())\r\nmas2 = list(map(int, input().split()))\r\nmas = []\r\nfor i in mas2:\r\n for j in mas1:\r\n if i % j == 0:\r\n mas.append(i/j)\r\nprint(mas.count(max(mas)))", "n = int(input())\r\nnn = list(map(int, input().split()))\r\nm = int(input())\r\nmm = list(map(int, input().split()))\r\nmx = -1\r\n\r\nfor i in mm:\r\n for j in nn:\r\n if i % j == 0 and i//j>mx:\r\n mx = i//j\r\n\r\nans = 0\r\n\r\nfor i in mm:\r\n for j in nn:\r\n if i % j == 0 and i//j == mx:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif b[i]/a[j] - int(b[i]/a[j]) == 0:\r\n\t\t\tans.append(b[i]/a[j])\r\nma=max(ans)\r\nprint(ans.count(ma))", "def sol(a,b,n,m):\r\n ans = 0\r\n r,count = 0,0\r\n for i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i] == 0:\r\n r = b[j]/a[i]\r\n if ans < r:\r\n ans = r \r\n count = 1 \r\n elif ans == r:\r\n count+=1 \r\n return (count)\r\n \r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nans = sol(a,b,n,m)\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nint_gears = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n c = b[j] / a[i]\r\n if c.is_integer():\r\n int_gears.append(c)\r\n\r\nmx = max(int_gears)\r\nprint(int_gears.count(mx))\r\n", "int(input())\r\na=list(map(int,input().split()))\r\nint(input())\r\nb=list(map(int,input().split()))\r\nMax=1\r\nnum=0\r\nfor i in b :\r\n for j in a:\r\n if i%j==0:\r\n if i//j>Max:\r\n Max=i//j\r\n num=1\r\n elif i//j==Max:\r\n num+=1\r\nprint(num)", "n=int(input())\r\nl1=[int(x) for x in input().split()]\r\nm=int(input())\r\nl2=[int(x) for x in input().split()]\r\nt1=0\r\nt2=0\r\nt=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if (l2[j]%l1[i]==0):\r\n t1=l2[j]/l1[i]\r\n if (t1>t2):\r\n t2=t1\r\nfor i in range(n):\r\n for j in range(m):\r\n if (l2[j]%l1[i]==0 and l2[j]/l1[i]==t2):\r\n t+=1\r\nprint(t)", "pedal = int(input())\r\npedal_stars = list(map(int, input().split()))\r\nrear_wheel = int(input())\r\nrear_wheel_stars = list(map(int, input().split()))\r\n\r\nintegers = list()\r\nfor star in pedal_stars:\r\n for star_ in rear_wheel_stars:\r\n if star_ % star == 0:\r\n integers.append(int(star_ / star))\r\n\r\nmaximum = max(integers)\r\ncounter = 0\r\nfor integer in integers:\r\n if integer == maximum:\r\n counter += 1\r\n\r\nprint(counter)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import Counter\r\n\r\ninput()\r\na = list(map(int, input().split()))\r\ninput()\r\nb = list(map(int, input().split()))\r\n\r\nx = Counter([j//i for j in b for i in a if j%i == 0])\r\nprint(x[sorted(x)[-1]])", "a = int(input().strip())\r\nb = input().strip().split()\r\nb = [int(i) for i in b]\r\nc = int(input().strip())\r\nd = input().strip().split()\r\nd = [int(i) for i in d]\r\nk=[]\r\nfor i in b:\r\n for j in d:\r\n if j%i ==0:\r\n k.append(j/i)\r\na=max(k)\r\nc=0\r\nfor i in k:\r\n if i==a:\r\n c=c+1\r\nprint(c)", "n=int(input())\r\nnarr=input().split()\r\nm=int(input())\r\nmarr=input().split()\r\nlst=[]\r\nfor j in range(m):\r\n for i in range(n):\r\n if(int(marr[j])%int(narr[i])==0):\r\n lst.append(int(marr[j])//int(narr[i]))\r\nlst.sort(reverse=True)\r\nif(len(lst)>0):\r\n print(lst.count(lst[0]))\r\nelse:\r\n print(0)", "n = int(input())\r\n\r\n\r\nl =[int(x) for x in input().split()]\r\n\r\nm = int(input())\r\nk = [int(x) for x in input().split()]\r\n\r\nans = [x//y for x in k for y in l if x%y==0]\r\nprint(ans.count(max(ans)))", "n=int(input())\nz=list(map(int,input().split()))\n\nm=int(input())\ny=list(map(int,input().split()))\n\narr=[]\n\nfor i in y :\n for j in z:\n if i%j==0 :\n arr.append(i//j)\n\nmaxi=max(arr)\ncount=0\nfor i in arr :\n if i==maxi :\n count+=1\nprint(count)\n\t \t \t \t \t\t \t \t \t \t\t\t \t", "#!/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[66]:\n\n\nn1 = int(input())\nline1 = list(map(int, input().split()))\nn2 = int(input())\nline2 = list(map(int, input().split()))\n\n\n# In[67]:\n\n\nn_max_gear = 0\nmax_gear = 0\n\nfor i in range(n1):\n for j in range(n2):\n ratio = line2[j]/line1[i]\n if ratio == line2[j]//line1[i]:\n if ratio > max_gear:\n n_max_gear = 1\n max_gear = ratio\n elif ratio == max_gear:\n n_max_gear += 1\n else:\n pass\n\n\n# In[68]:\n\n\nprint(n_max_gear)\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "\r\ndef main():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n m = int(input())\r\n b = list(map(int,input().split()))\r\n r = 0\r\n c = 0\r\n for i in b:\r\n for j in a:\r\n if i % j == 0:\r\n if i//j > r:\r\n r = i // j\r\n c=1\r\n elif i//j == r:\r\n c += 1\r\n print(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain()", "'''\n R E X\n\n Date - 20th May 2021\n\n\n @author:\n CodeForces -> kunalverma19\n CodeChef -> kunalverma_19\n AtCoder -> TLKunalVermaRX\n'''\nimport sys\nimport re\nimport math\nMOD = 1000000007\ninp = lambda :map(int,input().split(' '))\nninp = lambda :int(input())\n# sys.stdin=open(\"input.txt\",\"r\")\nres=list()\nn=ninp();\na=list(inp())\nm=ninp();\nb=list(inp())\nmx=-1\nfor i in range(len(a)):\n\tfor j in range(len(b)):\n\t\tif b[j]%a[i]==0:\n\t\t\tif (b[j]/a[i]>mx):\n\t\t\t\tmx=b[j]/a[i]\n\t\t\tres.append(b[j]/a[i])\nprint(res.count(mx))\n\n", "#import math\r\nn=int(input())\r\nf=list(map(int,input().split()))\r\nm=int(input())\r\nr=list(map(int,input().split()))\r\nmax=0\r\ncnt=1\r\nfor i in r:\r\n for j in f:\r\n if(i%j==0):\r\n x=int(i/j)\r\n if(x>max):\r\n max=x\r\n cnt=1\r\n elif(x==max):\r\n cnt+=1\r\n break\r\nprint(cnt)\r\n", "import math\r\n\r\nn=int(input())\r\na=[]\r\nb=[]\r\nmax=0\r\nnmax=0;\r\na=list(input().split())\r\na=[int(i) for i in a]\r\nm=int(input())\r\nb=list(input().split())\r\nb=[int(i) for i in b]\r\nfor i in a:\r\n for j in b:\r\n c=j/i\r\n d=math.floor(c)\r\n if(d==c and c>max):\r\n max=c\r\n nmax=0\r\n if(c==max):\r\n nmax=nmax+1\r\nprint(nmax)\r\n\r\n\r\n", "n1 = int(input())\r\nl1 = list(map(int, input().split(\" \")))\r\nn2 = int(input())\r\nl2 = list(map(int, input().split(\" \")))\r\n\r\nbest = -1\r\ncount = 0\r\n\r\nfor e2 in l2:\r\n for e1 in l1:\r\n ratio = int(e2/e1)\r\n if ratio == e2/e1:\r\n if ratio > best:\r\n count = 1\r\n best = ratio\r\n elif ratio == best:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "# coding: utf-8\nn = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nb = [int(i) for i in input().split()]\nmaxratio = -1\nans = 0\nfor bb in b[::-1]:\n for aa in a:\n if bb//aa < maxratio:\n break\n elif bb%aa != 0:\n continue\n elif bb//aa > maxratio:\n maxratio = bb//aa\n ans = 1\n else:\n ans += 1\nprint(ans)\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\nb=int(input())\r\nm=list(map(int,input().split()))\r\ng=[]\r\nfor i in range(len(m)):\r\n for j in range(len(l)):\r\n if m[i]//l[j]==m[i]/l[j]:\r\n g.append(m[i]//l[j])\r\nprint(g.count(max(g)))", "n = int(input())\r\nstarsPedal = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nstarsRear = list(map(int, input().split()))\r\n\r\nmaxVal = -1\r\ntotalGears = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if starsRear[j] % starsPedal[i] == 0:\r\n if starsRear[j]//starsPedal[i] == maxVal:\r\n totalGears += 1\r\n elif starsRear[j]//starsPedal[i] > maxVal:\r\n maxVal = starsRear[j]//starsPedal[i]\r\n totalGears = 1\r\nprint(totalGears)\r\n", "\r\n\"\"\"\r\n Sep 12, 2021\r\n Written by Zach Leach - at 04:21 AM CST\r\n\r\n\"\"\"\r\n\r\nimport sys\r\ngetline = sys.stdin.readline\r\n\r\ndef read_int():\r\n return int(getline())\r\n\r\ndef read_ints():\r\n return list(map(int, getline().split()))\r\n\r\n\"\"\"\r\n Bicycle Chain\r\n\r\n\"\"\"\r\n\r\nn = read_int()\r\nA = read_ints()\r\n\r\nm = read_int()\r\nB = read_ints()\r\n\r\nC = []\r\n\r\nfor a in A:\r\n for b in B:\r\n if b // a == b / a:\r\n C.append(b//a)\r\n\r\nm = max(C)\r\n\r\nans = 0\r\nfor c in C:\r\n ans += c == m\r\n\r\nprint(ans)\r\n", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nmx = 0\ncnt = 1\nfor x in a:\n for y in b:\n if y % x == 0:\n if y // x > mx:\n mx = y // x\n cnt = 1\n elif y // x == mx:\n cnt += 1\n\nprint(cnt)\n\n", "# Author: SaykaT\r\n# Problem: 215A\r\n# Time Created: August 29(Saturday) 2020 || 07:30:42\r\n\r\n#>-------------------------<#\r\n\r\n#>-------------------------<#\r\n\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\n\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n b = list(map(int, input().split()))\r\n\r\n mx = 0\r\n cnt = 0\r\n\r\n for i in a:\r\n for j in b:\r\n ratio = j / i\r\n if ratio.is_integer():\r\n if ratio == mx:\r\n cnt += 1\r\n if ratio > mx:\r\n mx = ratio\r\n cnt = 1\r\n\r\n print(cnt)\r\n# Single test cases\r\nsolve()\r\n\r\n", "an = int(input())\r\na = list(map(int, input().split()))\r\nbn = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nratios = []\r\nmx = 0\r\nfor i in a:\r\n for j in b:\r\n if j % i == 0:\r\n k = j//i\r\n ratios.append(k)\r\n if k > mx:\r\n mx= k\r\nct = 0\r\nfor i in ratios:\r\n if mx == i:\r\n ct+=1\r\nprint(ct) ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nres=[]\r\nfor j in b:\r\n for i in a:\r\n if j%i==0:\r\n res.append(j//i)\r\nres.sort()\r\nc=0\r\nm=res[-1]\r\nfor i in res:\r\n if m==i:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nlx=[]\r\nfor i in l:\r\n\tfor j in l2:\r\n\t\tif j%i==0:\r\n\t\t\tlx.append(j//i)\r\nprint(lx.count(max(lx)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nq,c=[],[]\r\nfor i in range(n):\r\n for j in range(m):\r\n q.append(b[j]/a[i])\r\n#print(q)\r\nfor i in range(len(q)):\r\n if q[i]-int(q[i])==0:\r\n c.append(q[i])\r\n\r\nprint(c.count(max(c)))", "n=int(input())\r\nlst1=list(map(int,input().split()))\r\nm=int(input())\r\nlst2=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst2[j]/lst1[i]==lst2[j]//lst1[i]:\r\n if lst2[j]//lst1[i] not in dic:\r\n dic[lst2[j]//lst1[i]]=0\r\n dic[lst2[j]//lst1[i]]+=1\r\nprint(dic[max(list(dic.keys()))])", "n=int(input())\r\narr1=list(map(int,input().split()))\r\nm=int(input())\r\narr2=list(map(int,input().split()))\r\nmaxVal=0\r\nfor i in range(n):\r\n for j in range(m):\r\n x=arr2[j]/arr1[i]\r\n if x*x==int(x*x):\r\n maxVal=max(maxVal,x)\r\n#print(maxVal)\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n x=arr2[j]/arr1[i]\r\n if maxVal==x:\r\n ans+=1\r\nprint(ans)\r\n", "n=input()\r\nal = list(map(int, input().split()))\r\nm = input()\r\nbl = list(map(int, input().split()))\r\ntl = []\r\nfor a in al:\r\n for b in bl:\r\n if b%a==0:\r\n tl.append(b//a)\r\nprint(tl.count(max(tl)))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nma = 0\r\nc = 0\r\nfor i in b:\r\n for j in a:\r\n k = i / j\r\n t = i // j\r\n if k == t:\r\n if ma < t:\r\n ma = t\r\n c = 1\r\n elif ma == t:\r\n c += 1\r\n\r\nprint(c)", "def main() :\r\n n = int(input())\r\n array1 = list(map(int,input().strip().split())) \r\n m = int(input())\r\n array2 = list(map(int,input().strip().split()))\r\n max_ = 0\r\n count = 0\r\n j = 0\r\n while j<m :\r\n i = 0\r\n while i<n :\r\n if array2[j] % array1[i] == 0 and array2[j]//array1[i] > max_ :\r\n max_ = array2[j]//array1[i]\r\n count = 1\r\n elif array2[j] % array1[i] == 0 and array2[j]//array1[i] == max_ : \r\n count +=1\r\n i+=1\r\n j+=1 \r\n print(count) \r\nmain()", "n=int(input());nl=list(map(int,input().split()))\r\nm=int(input());ml=list(map(int,input().split()))\r\nk=[j//i for i in nl for j in ml if j%i == 0]\r\nprint(k.count(max(k)))", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nMax = 0\r\ncount = 0\r\n\r\nfor i in b:\r\n for j in a:\r\n if i % j == 0 and ( i // j ) > Max:\r\n count = 1\r\n Max = i // j\r\n elif i % j == 0 and ( i // j ) == Max:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\npedal = list(map(int, input().split()))\r\nm = int(input())\r\nrear = list(map(int, input().split()))\r\ncnt = 0\r\nmx = 0\r\nfor i in range(len(rear)):\r\n for j in range(len(pedal)):\r\n ratio = rear[i] / pedal[j]\r\n if ratio == int(ratio):\r\n if ratio > mx:\r\n cnt = 1\r\n mx = ratio\r\n elif ratio == mx:\r\n cnt += 1\r\n\r\nprint(cnt)", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, = readln()\na = readln()\nm, = readln()\nb = readln()\nans = 0\nbest = 0\nfor i in b:\n for j in a:\n if i % j == 0 and i // j > best:\n ans = 0\n best = i // j\n ans += j * best == i\nprint(ans)\n", "def ratio(a,b,r):\r\n count = 0 \r\n for i in a :\r\n for j in b :\r\n if j / i == r :\r\n count+=1\r\n return count\r\na = []\r\nb = []\r\nn_1 = int(input())\r\na_1 = input().split(' ')\r\nfor i in range(n_1):\r\n a.append(int(a_1[i]))\r\nn_2 = int(input())\r\nb_1 = input().split(' ')\r\nfor i in range(n_2):\r\n b.append(int(b_1[i]))\r\nb.reverse()\r\nmax = 0\r\nfor i in b:\r\n for j in a :\r\n if i % j == 0 and i/j > max:\r\n max = i/j\r\nprint(ratio(a,b,max))\r\n", "#\t215A - Bicycle Chain\r\nif __name__ == '__main__':\r\n n, a, m ,b = int(input()), [int(x) for x in input().split()], int(input()), [int(y) for y in input().split()]\r\n max, times = 0, 0\r\n for x in range(n) :\r\n for y in range(m): \r\n if b[y]/a[x] > max and b[y]/a[x]==b[y]//a[x] : times = 0; max = b[y]//a[x]\r\n if b[y]/a[x] == max and b[y]/a[x]==b[y]//a[x]: times+=1\r\n print(times)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nm=int(input())\r\nlst1=list(map(int,input().split()))\r\nv=0\r\nc=0\r\nfor i in range(m):\r\n for j in range(n):\r\n f=lst1[i]/lst[j]\r\n if(f.is_integer()):\r\n if(f>v):\r\n v=f\r\n c=0\r\n c+=1\r\n elif(f==v):\r\n c+=1\r\nprint(c)", "n = int(input())\r\nai = list(map(int, input().split()))\r\nm = int(input())\r\nbi = list(map(int, input().split()))\r\nlst = []\r\nfor i in ai:\r\n for j in bi:\r\n if j % i == 0:\r\n lst.append(int(j / i))\r\nprint(lst.count(max(lst)))", "n, a = int(input()), [int(i) for i in input().split()]\nm, b = int(input()), [int(i) for i in input().split()]\nl = [j // i for j in b for i in a if not j % i]\nprint(l.count(max(l)))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nans = []\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if b[j]%a[i]==0:\r\n ans.append(b[j]/a[i])\r\n\r\nans.sort()\r\nprint(ans.count(ans[len(ans)-1]))\r\n", "n1 = int(input())\r\nk1 = list(map(int,input().split()))\r\nn2 = int(input())\r\nk2 = list(map(int,input().split()))\r\nk2.reverse()\r\nc = 0\r\nnum = 0\r\nfor i in k1:\r\n for j in k2:\r\n if j%i == 0:\r\n if int(j/i) > c:\r\n c = int(j/i) \r\n num = 1\r\n break\r\n elif int(j/i) == c:\r\n num += 1\r\n break\r\nprint(num)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\nc=[]\r\nfor i in range(len(b)):\r\n for j in range(len(a)):\r\n if(b[i]%a[j]==0):\r\n c.append(b[i]//a[j])\r\nprint(c.count(max(c)))", "n = float(input())\r\na = [float(i) for i in input().split()]\r\nm = float(input())\r\nb = [float(i) for i in input().split()]\r\nlis = []\r\nfor i in a:\r\n for j in b:\r\n # if isinstance((j/i),int):\r\n # lis = lis.append(j/i)\r\n if str(j/i).endswith('0'):\r\n lis.append(j/i)\r\n else :\r\n continue\r\n \r\n \r\nprint(lis.count(max(lis))) ", "#Har har mahadev\r\n#author : @harsh kanani\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nm = int(input())\r\nl1 = list(map(int, input().split()))\r\n\r\nc = 0\r\nl2 = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if l1[j]%l[i]==0:\r\n l2.append(l1[j]//l[i])\r\n c += 1\r\nm = max(l2)\r\nprint(l2.count(m))", "k=input\r\nint(k())\r\na=list(map(int,k().split()))\r\nint(k())\r\nb=list(map(int,k().split()))\r\nc=[]\r\nfor i in b:\r\n for j in a:\r\n if(i%j==0):\r\n c.append(i/j)\r\nprint(c.count(max(c)))", "m = int(input())\r\na = list(map(int, input().split()))\r\nn = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nmaxM = 0\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif b[j]//a[i] == b[j]/a[i] and b[j]//a[i] > maxM:\r\n\t\t\tmaxM = b[j]//a[i]\r\ncount = 0\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif b[j]//a[i] == b[j]/a[i] and b[j]//a[i] == maxM:\r\n\t\t\tcount+=1\r\nprint(count)", "n = int(input())\r\nli = list(map(int , input().split()))\r\nm = int(input())\r\nlim = list(map(int , input().split()))\r\nanslist = [j // i for j in lim for i in li if not j % i ]\r\nprint(anslist.count(max(anslist)))", "i=lambda:list(map(int,input().split()))\r\ni()\r\na=i()\r\ni()\r\nb=i()\r\nl=[x//y for x in b for y in a if x%y==0]\r\nprint(l.count(max(l)))\r\n", "n=int(input())\r\nstar_pe=[int(i) for i in input().split()]\r\nm=int(input())\r\nstar_re=[int(i) for i in input().split()]\r\nans=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if star_re[j]%star_pe[i]==0:\r\n ans.append(int(star_re[j]/star_pe[i]))\r\nprint(ans.count(max(ans)))", "n = int(input())\r\na = [int(x) for x in input().split(\" \",n-1)]\r\nm = int(input())\r\nb = [int(x) for x in input().split(\" \",m-1)]\r\nL = []\r\nfrom collections import Counter\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i]==0:\r\n L.append(b[j]/a[i])\r\na = max(L)\r\ns = Counter(L)\r\nprint(s[a])", "n=int(input())\r\nN=list(map(int,input().split()))\r\nm=int(input())\r\nM=list(map(int,input().split()))\r\nk=[]\r\nfor i in N:\r\n for j in M:\r\n if j/i==j//i:\r\n k.append(j//i)\r\nd={}\r\nfor i in k:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nd=dict(sorted(d.items(),key=lambda x:x[1],reverse=True))\r\nd=dict(sorted(d.items(),key=lambda x:x[0],reverse=True))\r\nfor i in d:\r\n print(d[i])\r\n break\r\n", "def rcheck(d,i):\n return d % i == 0\ntime_pass1 = int(input())\nlist1 = [x for x in map(int,input().split())]\ntime_pass2 = int(input())\nlist2 = [x for x in map(int,input().split())]\nres = [j / i for i in list1 for j in list2 if rcheck(j,i)]\nmax = max(res)\nprint(res.count(max))\n", "n=int(input())\r\na=input().split()\r\nl=int(input())\r\nb=input().split()\r\nc=[]\r\nfor i in range(n):\r\n for j in range(l):\r\n if (int(b[j])%int(a[i]))==0:\r\n c.append(int(b[j])/int(a[i]))\r\nprint(c.count(max(c)))", "def isInt(a):\r\n return (True if a == int(a) else False)\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\nMax , count = 0 , 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if isInt(b[j]/a[i]) and b[j]/a[i] > Max:\r\n Max = b[j]/a[i]\r\n count = 0\r\n if isInt(b[j]/a[i]) and b[j]/a[i] == Max:\r\n count += 1\r\n #print(count)\r\nprint(count)\r\n\r\n\r\n", "n= int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nmax_r = 1\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n curr_r = b[j]//a[i]\r\n if curr_r*a[i] == b[j]:\r\n max_r = max(max_r,curr_r)\r\nfor k in range(n):\r\n for l in range(m):\r\n curr_r = b[l]//a[k]\r\n if curr_r*a[k] == b[l] and curr_r == max_r:\r\n count +=1\r\n\r\nprint(count)\r\n \r\n ", "def bicycleChain(n,ng,m,mg):\r\n ratio = 0\r\n count = 0\r\n \r\n for i in mg:\r\n for j in ng:\r\n if i%j == 0:\r\n if (i/j) > ratio:\r\n ratio = i/j\r\n count = 1\r\n elif (i/j) == ratio:\r\n count += 1\r\n \r\n return count\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n ng = [int(i) for i in input().split()]\r\n m = int(input())\r\n mg = [int(i) for i in input().split()]\r\n \r\n ans = bicycleChain(n,ng,m,mg)\r\n print(ans)\r\n ", "def main_function():\r\n input()\r\n a = [int(i) for i in input().split(\" \")]\r\n input()\r\n b = [int(i) for i in input().split(\" \")]\r\n maxi = 0\r\n for i in b:\r\n for j in a:\r\n if not i % j:\r\n if maxi < i // j:\r\n maxi = i // j\r\n counter = 0\r\n for i in b:\r\n for j in a:\r\n if not i % j:\r\n if maxi == i // j:\r\n counter += 1\r\n return counter\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "def read():\r\n return [int(c) for c in input().split()]\r\n\r\n\r\ninput()\r\na = read()\r\ninput()\r\nb = read()\r\n\r\nint_gears = []\r\nfor bb in b:\r\n for aa in a:\r\n if bb % aa == 0:\r\n int_gears.append(bb // aa)\r\n\r\n_max = max(int_gears)\r\nans = sum(1 for e in int_gears if e == _max)\r\nprint(ans)\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=int(input())\r\nd=list(map(int,input().split()))\r\nL=[]\r\nfor i in range(a):\r\n for j in range(c):\r\n if d[j]%b[i]==0 :L.append(d[j]/b[i])\r\n else:continue\r\nprint(L.count(max(L)))", "n=int(input())\r\na=[int(x)for x in input().split()]\r\nm=int(input())\r\nb=[int(x)for x in input().split()]\r\nc=[]\r\nfor j in range(m):\r\n for i in range(n):\r\n x=b[j]/a[i]\r\n if int(x)==float(x):\r\n c.append(x)\r\n\r\nc.sort(reverse=True)\r\nans=0\r\nfor i in c:\r\n if i==c[0]:\r\n ans+=1\r\n else:break\r\n\r\nprint(ans)", "n = int(input())\r\n\r\npedal = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nrear = list(map(int, input().split()))\r\n\r\n\r\npedal.sort()\r\nrear.sort(reverse= True)\r\n\r\n#calculate max ratio\r\nratio = int(0)\r\nfor i in range(m):\r\n for j in range(n):\r\n if rear[i] % pedal[j] == 0:\r\n if rear[i] / pedal[j] > ratio: ratio = int(rear[i] / pedal[j])\r\n break\r\n\r\ncount =0\r\nfor i in range(m):\r\n for j in range(n):\r\n if rear[i] / pedal[j] == ratio: count+=1\r\n\r\nprint(count)", "n = int(input())\na = list(map(int,input().split()))\nm = int(input())\nb = list(map(int,input().split()))\nr = [0]\nfor i in range(m):\n for j in range(n):\n if b[i]%a[j]==0 and b[i]//a[j] >= max(r):\n r.append(b[i]//a[j])\nprint(r.count(max(r)))", "def is_divisible(a, b):\r\n return b/a == b//a\r\n\r\nn = int(input())\r\nn_lst = input().split()\r\nn_lst = [int(i) for i in n_lst]\r\n\r\nm = int(input())\r\nm_lst = input().split()\r\nm_lst = [int(j) for j in m_lst]\r\n\r\nratio = 0\r\ncount = 0\r\n\r\ni = 0\r\nj = m-1\r\nmin_j = -1\r\nwhile i<n:\r\n j = m-1\r\n flag = True\r\n while flag and j>min_j:\r\n if is_divisible(n_lst[i], m_lst[j]):\r\n if ratio < m_lst[j]/n_lst[i]:\r\n ratio = m_lst[j]/n_lst[i]\r\n count = 1\r\n elif ratio == m_lst[j]/n_lst[i]:\r\n count += 1\r\n \r\n flag = False\r\n min_j = j\r\n j -= 1\r\n i += 1\r\n\r\nprint (count)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nmaximum = 0\r\ncount = 0\r\nfor i1 in range(len(a)):\r\n for i2 in range(len(b)):\r\n if b[i2] / a[i1] > maximum and b[i2] % a[i1] == 0:\r\n count = 1\r\n maximum = b[i2] / a[i1]\r\n elif b[i2] / a[i1] == maximum:\r\n count += 1\r\nprint(count)", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nn = int(input())\r\na = arr_inp()\r\nm = int(input())\r\nb = arr_inp()\r\narr = []\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if (b[i] % a[j] == 0):\r\n arr.append(b[i] // a[j])\r\nprint(arr.count(max(arr)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nanswer= []\r\nfor j in b:\r\n for i in a:\r\n if j % i == 0:\r\n t = j // i\r\n answer.append(t)\r\nprint(answer.count(max(answer)))", "c=int(input())\r\nm=[int(c) for c in input().split(' ')]\r\nj=int(input())\r\nk=[int(j) for j in input().split(' ')]\r\ng=[]\r\n\r\nfor i in range(len(m)):\r\n for s in range(len(k)):\r\n q=((k[s])/m[i])\r\n if q.is_integer():\r\n g.append(q)\r\n\r\nf=max(g)\r\nw=g.count(f)\r\nprint(w)\r\n", "# 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\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\narr1 = L()\r\nm = I()\r\narr2 = L()\r\nmx = 1\r\nc = 0\r\nfor i in arr2:\r\n for j in arr1:\r\n if i%j == 0:\r\n if i//j == mx:\r\n c += 1 \r\n elif i//j > mx:\r\n mx = i//j \r\n c = 1\r\nprint(c)\r\n \r\n ", "n = int(input())\r\na = sorted([int(x) for x in input().split()])\r\nm = int(input())\r\nb = sorted([int(x) for x in input().split()])\r\nmaxRes = 0\r\nans = 0\r\nfor x in a:\r\n\tfor y in b:\r\n\t\tif y % x == 0:\r\n\t\t\tcur = y // x\r\n\t\t\tif cur > maxRes:\r\n\t\t\t\tmaxRes = cur\r\n\t\t\t\tans = 0\r\n\t\t\tif cur == maxRes:\r\n\t\t\t\tans += 1\r\nprint(ans)", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\nn = inp()\r\na = inlist()\r\nm = inp()\r\nb = inlist()\r\nratio = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n ratio.append(b[j]//a[i])\r\nmx = ratio.count(max(ratio))\r\nprint(mx)\r\n", "from collections import Counter\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\n\r\nratios = []\r\nfor i in range(m):\r\n for j in range(n):\r\n ratios.append(b[i] / a[j])\r\n\r\nratios = Counter(x for x in ratios if x.is_integer())\r\nprint(ratios[max(ratios.keys())])\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################\r\n", "def main():\r\n n = int(input())\r\n vals1 = [int(v) for v in input().split()]\r\n m = int(input())\r\n vals2 = [int(v) for v in input().split()]\r\n maxs = []\r\n for v1 in vals1:\r\n for v2 in vals2:\r\n if v2%v1 == 0:\r\n maxs.append(v2/v1)\r\n m = max(maxs)\r\n print(len([v for v in maxs if v == m]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input());a=list(map(int,input().split()))\r\nm=int(input());b=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(m):\r\n for x in range(n):\r\n if (b[i]/a[x])%1==0:\r\n c.append(b[i]/a[x])\r\nans=max(c)\r\npr=0\r\nfor i in range(len(c)):\r\n if c[i]==ans:\r\n pr+=1\r\nprint(pr)\r\n", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n n = int(input())\r\n a = sorted([int(word) for word in input().split()])\r\n m = int(input())\r\n b = sorted([int(word) for word in input().split()], reverse=True)\r\n max_match = 0\r\n result = 0\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n temp = b[j] // a[i]\r\n\r\n if temp > max_match:\r\n max_match = temp\r\n result = 1\r\n elif temp == max_match:\r\n result += 1\r\n\r\n break\r\n\r\n print(result)\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "# Bismillahir Rahmanir Rahim\r\n# Abu Hurayra - Handle: HurayraIIT\r\nimport sys\r\nimport math\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef rs(): return sys.stdin.readline().rstrip()\r\ndef ri(): return int(sys.stdin.readline())\r\ndef ria(): return list(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s + '\\n')\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\\n')\r\n#a = list(map(int, input().split()))\r\n \r\n \r\n \r\ndef main():\r\n n =ri()\r\n a = ria()\r\n m = ri()\r\n b = ria()\r\n sol = []\r\n for j in range(m-1,-1,-1):\r\n for i in range(n-1,-1,-1):\r\n if b[j]%a[i]==0:\r\n sol.append(b[j]//a[i])\r\n \r\n wi(sol.count(max(sol)))\r\n\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n t = 1\r\n for _ in range(t):\r\n main()\r\n", "n=int(input())\r\nnL=list(map(int,input().split()))\r\nm=int(input())\r\nmL=list(map(int,input().split()))\r\nans=[]\r\nfor i in nL:\r\n for y in mL:\r\n ratio=(y/i)\r\n if int(ratio)==ratio:\r\n ans.append(ratio)\r\n\r\nmaximum=max(ans)\r\nprint(ans.count(maximum))", "n = int(input())\r\nlst1 = sorted( list(map(int,input().split())) )\r\nm = int(input())\r\nlst2 = sorted( list(map(int, input().split())) )\r\n\r\nmx = 0\r\ncount = 0\r\nfor i in lst1:\r\n for j in lst2:\r\n if j%i == 0:\r\n mx = max(mx, j//i)\r\n\r\nfor i in lst1:\r\n for j in lst2:\r\n if j%i == 0 and j//i == mx:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nlst = []\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if (b[j] % a[i] == 0):\r\n lst.append(b[j] // a[i])\r\nx = max(lst)\r\nans = lst.count(x)\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nx=list(map(int,input().split()))\r\nfrom collections import Counter\r\nc=Counter()\r\nl1=[[x[j]/l[i] if x[j]%l[i]==0 else -5 for i in range(n)] for j in range(m)]\r\nfor k in l1:\r\n c.update(k)\r\nprint(max(c.items())[1])", "a=int(input())\r\nb=input().split()\r\nc=int(input())\r\nd=input().split()\r\nl=[]\r\nfor i in range(a):\r\n for j in range(c):\r\n ratio=int(d[j])/int(b[i])\r\n if int(ratio)==ratio:\r\n l.append(ratio)\r\n \r\n\r\ns=max(l)\r\n\r\nprint(l.count(s))", "\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n m = int(input())\r\n arr2 = list(map(int, input().split()))\r\n\r\n counts = dict()\r\n\r\n for i in range(m):\r\n for j in range(n):\r\n if arr2[i] / arr[j] == arr2[i] // arr[j]:\r\n if arr2[i] // arr[j] in counts:\r\n counts[arr2[i] // arr[j]] += 1\r\n else:\r\n counts[arr2[i] // arr[j]] = 1\r\n\r\n counts = sorted(counts.items(), key=lambda x: x[0])\r\n\r\n print(counts[-1][1])\r\n\r\nmain()", "s=int(input())\r\na=[int(i) for i in input().split()]\r\nt=int(input())\r\nb=[int(i) for i in input().split()]\r\nmax=0\r\nfor i in range(s):\r\n for j in range(t):\r\n if b[j]%a[i]==0:\r\n if b[j]/a[i]>max:\r\n max=b[j]/a[i]\r\n c=0\r\n c+=1\r\n elif b[j]/a[i]==max:\r\n c+=1\r\nprint(c)\r\n \r\n ", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/input.txt\"\r\n OUTPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(N, front_arr, M, back_arr):\r\n ratios = Counter()\r\n mx_ratio = 0\r\n\r\n for front in front_arr:\r\n for back in back_arr:\r\n if back % front == 0:\r\n ratios[back//front] += 1\r\n mx_ratio = max(mx_ratio, back//front)\r\n\r\n return ratios[mx_ratio]\r\n\r\n\r\nN = read_int()\r\nfront_arr = read_numeric_list()\r\n\r\nM = read_int()\r\nback_arr = read_numeric_list()\r\n\r\nprint(solve(N, front_arr, M, back_arr))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = int(input())\r\nb = list(map(int, input().split()))\r\ntrack = []\r\nfor i in range(len(b)):\r\n for e in range(len(a)):\r\n if b[i] % a[e] == 0:\r\n track.append(b[i] // a[e])\r\nprint(track.count(max(track)))\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nm=int(input())\r\np=[int(i) for i in input().split()]\r\nm=0\r\ncount=0\r\nfor i in l:\r\n for j in p:\r\n if j%i==0 and j//i>m:\r\n m=j//i\r\n count=1\r\n elif j%i==0 and j//i==m:\r\n count+=1\r\nprint(count)", "import math\r\n\r\nn = int(input())\r\nai = input().split()\r\n\r\nm = int(input())\r\nbi = input().split()\r\n\r\nmax = -math.inf\r\ncount = 0\r\nfor i in range(0, m):\r\n for j in range(0, n):\r\n if (int(bi[i]) % int(ai[j]) == 0):\r\n if (int(bi[i]) / int(ai[j]) > max):\r\n max = int((int(bi[i]) / int(ai[j])))\r\n count = 1\r\n elif (int(bi[i]) / int(ai[j]) == max):\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nmaxnum, occurrance = 0, 0\r\n\r\nfor i in b:\r\n\tfor j in a:\r\n\t\tif i%j == 0:\r\n\t\t\tif i//j > maxnum:\r\n\t\t\t\tmaxnum = i//j\r\n\t\t\t\toccurrance = 1\r\n\t\t\telse:\r\n\t\t\t\tif i//j == maxnum:\r\n\t\t\t\t\toccurrance += 1\r\nprint(occurrance)\r\n", "n = int(input())\r\nnl = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nml = list(map(int, input().split()))\r\n\r\nma = 0\r\nc = 0\r\n\r\nfor i in nl:\r\n for j in ml:\r\n if j/i%1 == 0:\r\n if j/i > ma:\r\n ma = j/i\r\n c = 1\r\n elif j/i == ma:\r\n c += 1\r\n\r\nprint(c)", "N = int(input())\na = list(map(int, input().split()))\n\nM = int(input())\nb = list(map(int, input().split()))\n\nmaxRatio = -1\nratioCount = 0\nfor gear1 in a:\n for gear2 in b:\n if gear2 % gear1:\n continue\n\n ratio = gear2 // gear1\n if maxRatio == ratio:\n ratioCount += 1\n\n if maxRatio < ratio:\n maxRatio = ratio\n ratioCount = 1\n\nprint(ratioCount)\n", "n = int(input())\na = list(map(int,input().split()))\nm = int(input())\nb = list(map(int,input().split()))\nmaxi = -1\nc = 0\nfor i in b:\n for j in a :\n if i % j == 0:\n if i//j > maxi :\n c= 1\n maxi = i//j\n elif i // j == maxi :\n c+=1\n\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nz = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i]==0:\r\n z.append(b[j]/a[i])\r\n\r\nprint(z.count(max(z)))", "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 b:\r\n for j in a:\r\n if i%j==0:\r\n c[i//j]=c.get(i//j,0)+1\r\nprint(c[max(list(c.keys()))])", "lines = []\nfor _ in range(4):\n lines.append(input())\n\nlena = int(lines[0])\na = [int(x) for x in str(lines[1]).split(' ')]\nlenb = int(lines[2])\nb = [int(x) for x in str(lines[3]).split(' ')]\n\n\ndef calc_max_gear_ratio_cnt() -> int:\n count = 0\n ratio = 0\n for j in range(lenb - 1, -1, -1):\n for i in range(lena):\n r = b[j] / a[i]\n if r != b[j] // a[i]:\n continue\n if r < ratio:\n break\n if r == ratio:\n count += 1\n break\n if r > ratio:\n ratio = r\n count = 1\n break\n return count\n\n\nprint(calc_max_gear_ratio_cnt())\n", "n, a = int(input()), sorted(int(i) for i in input().split())\nm, b = int(input()), sorted((int(i) for i in input().split()), reverse=True)\nres = ma = 0\nfor bi in b:\n for ai in a:\n ratio = bi // ai\n if ratio * ai == bi and ratio >= ma:\n res = res + 1 if ratio == ma else 1\n ma = ratio\nprint(res)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nans = {}\r\nfor elem in a:\r\n for el in b:\r\n if el%elem==0:\r\n ans[el//elem] =1 if el//elem not in ans.keys() else ans[el//elem]+1\r\nprint(ans[max(ans.keys())])\r\n", "a = int(input())\r\nc=list(map(int,input().split()))\r\nb = int(input())\r\nd=list(map(int,input().split()))\r\nx=0\r\nhighest=0\r\nhigh=[]\r\nfor i in c:\r\n for j in d:\r\n if j%i==0:\r\n if j/i>=highest:\r\n highest=j/i\r\n high.append(highest) \r\nprint(high.count(highest))", "m = int(input())\r\na = list(map(int, input().split()))\r\nn = int(input())\r\nb = list(map(int, input().split()))\r\ng = 0\r\ngearratios = []\r\nfor i in range(m):\r\n v1 = a[i]\r\n for o in range(n): \r\n v2 = b[o]\r\n if v2%v1 == 0:\r\n gearratios.append(int(v2/v1))\r\nmgr = max(gearratios)\r\nfor i in range(m):\r\n v1 = a[i]\r\n for o in range(n): \r\n v2 = b[o]\r\n if v2/v1 == mgr:\r\n g+= 1\r\nprint(g) ", "n=int(input())\r\nm=list(map(int,input().split()))\r\nx=int(input())\r\ny=list(map(int,input().split()))\r\nt=[]\r\nfor i in m:\r\n for j in y:\r\n if j%i==0:\r\n t.append(j/i)\r\n\r\nc=t.count(max(t))\r\nprint(c)\r\n\r\n\r\n", "n = int(input())\r\nnlst= list(map(int,input().split()))\r\nm = int(input())\r\nmlst = list(map(int,input().split()))\r\nintgears = []\r\nfor i in nlst:\r\n for j in mlst:\r\n if j%i==0:\r\n intgears.append(j/i)\r\nprint(intgears.count(max(intgears)))\r\n", "n=int(input())\r\nrare=list(map(int,input().split()))\r\nm=int(input())\r\nfront=list(map(int,input().split()))\r\nmaxx=-float('inf')\r\ncount=0\r\nfor i in range(n):\r\n bluff=0\r\n inmaxx=-float('inf')\r\n for j in range(m):\r\n val=front[j]/rare[i]\r\n if int(val)==val:\r\n if inmaxx<val:\r\n bluff=0\r\n bluff+=1\r\n inmaxx=val\r\n elif inmaxx==val:\r\n bluff+=1\r\n if inmaxx>maxx:\r\n maxx=inmaxx\r\n count=bluff\r\n elif inmaxx==maxx:\r\n count+=bluff\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, a, m, b, mx, dem = int(input()), list(map(int, input().split())), int(input()), list(map(int, input().split())), 0, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0: mx = max(mx, b[j] // a[i])\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0 and b[j] // a[i] == mx: dem += 1\r\nprint(dem)", "input()\r\nn = [int(x) for x in input().split()]\r\ninput()\r\nm = [int(x) for x in input().split()]\r\n\r\ngear = {}\r\nfor i in n:\r\n for j in m:\r\n if j%i == 0:\r\n gear[j/i] = gear.get(j/i, 0) + 1\r\nprint(sorted(gear.items(), reverse=True)[0][1])\r\n\r\n \r\n \r\n", "n = int(input())\r\na = list(map(int, input() .split()))\r\nm = int(input())\r\nb = list(map(int, input() .split()))\r\nl=[0]*(m+n)\r\nw = 0\r\nfor i in range(m):\r\n for j in range(n):\r\n z = b[i] / a[j] \r\n if(z.is_integer()):\r\n l[j] = z\r\n w+=1\r\nfor k in range(l.count(0)):\r\n l.remove(0)\r\nt = max(l)\r\nprint(l.count(t)) ", "n=int(input())\r\na=list(map(int,input().split())) \r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nmax_ratio=0\r\nfor i in a:\r\n for j in b:\r\n ratio=j/i\r\n if j/i==int(j/i):\r\n max_ratio=max(max_ratio,ratio)\r\nmax_ratio=int(max_ratio)\r\nnum=0\r\nfor i in a:\r\n for j in b:\r\n if (j/i)==max_ratio:\r\n num+=1\r\nprint(num)", "n = int(input())\na = [int(x) for x in input().split()]\nm = int(input())\nb = [int(y) for y in input().split()]\n\nintegers = [int(bn/an) for bn in b for an in a if bn%an == 0]\ngreatest = max(integers)\nprint(integers.count(greatest))\n\t\t\t\t\t\t\t \t\t \t \t\t\t\t \t\t \t \t\t \t", "a=int(input())\r\nar=list(map(int,input().split()))\r\nb=int(input())\r\nbr=list(map(int,input().split()))\r\nv=[ ]\r\nfor i in ar:\r\n for j in br:\r\n if(j%i==0):\r\n v.append(j//i)\r\nprint(v.count(max(v)))", "m = int(input())\nlim = [int(a) for a in input().split()]\nlim.sort()\nn = int(input())\nlin = [int(b) for b in input().split()]\nlin.sort(reverse = True)\n\n\n#determine the max ratio\nmaxratio = 0\ncount = 1\nfor c in range(n):\n\tfor d in range(m):\n\t\tratio = lin[c]/lim[d]\n\t\tif(int(ratio) == ratio and ratio >maxratio):\n\t\t\tcount = 1\n\t\t\tmaxratio = ratio\n\t\telif int(ratio) == ratio and ratio == maxratio:\n\t\t\tcount = count + 1\n\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nl=[]\r\nfor i in b:\r\n for j in a:\r\n if(i%j==0):\r\n l.append(i//j)\r\nprint(l.count(max(l)))", "\nn=int(input())\na=[int(i) for i in input().split()]\nm=int(input())\nb=[int(i) for i in input().split()]\nd=[]\nfor i in a: \n for j in b:\n k=j/i\n if (k-int(k)==0):\n d.append(int(k))\nk=max(d)\nprint(d.count(k))\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nk = []\r\n\r\nfor x in a:\r\n for y in b:\r\n if y%x == 0:\r\n k.append(int(y/x))\r\n else:\r\n pass \r\nprint(k.count(max(k)))\r\n", "n = int(input())\r\npedals = list(map(int, input().rstrip().split()))\r\n\r\nm = int(input())\r\ngears = list(map(int, input().rstrip().split()))\r\n\r\ndef solve(pedals, gears):\r\n mxc = 0\r\n mxv = 0\r\n for i in range(len(gears)):\r\n for j in range(len(pedals)):\r\n if gears[i] / pedals[j] > mxv and gears[i] % pedals[j] == 0:\r\n mxc = 1\r\n mxv = gears[i] / pedals[j]\r\n elif gears[i] / pedals[j] == mxv and gears[i] % pedals[j] == 0:\r\n mxc += 1\r\n print(mxc)\r\n\r\n\r\nsolve(pedals, gears)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nl3=[]\r\nfor i in range(len(l1)):\r\n for j in range(len(l2)):\r\n if(l2[j]%l1[i]==0):\r\n l3.append(l2[j]//l1[i])\r\n else:\r\n continue\r\nprint(l3.count(max(l3)))", "from sys import stdin\r\nimport math\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\n\r\nread()\r\na = list(read())\r\nread()\r\nb = list(read())\r\n\r\nmaxR = -1\r\ncnt = 0\r\nfor x in b:\r\n for y in a:\r\n if x%y == 0:\r\n if x/y == maxR:\r\n cnt += 1\r\n elif x/y > maxR:\r\n maxR = x/y\r\n cnt = 1\r\n\r\nprint(cnt)\r\n", "n=int(input())\r\nn1=[int(x) for x in input().strip().split()[:n]]\r\nm=int(input())\r\nm1=[int(x) for x in input().strip().split()[:m]]\r\nz=[]\r\nfor x in range(n):\r\n\tfor y in range(m):\r\n\t\tif m1[y]/n1[x]==int(m1[y]/n1[x]):\r\n\t\t\tz.append(m1[y]//n1[x])\r\nprint(z.count(max(z)))", "from collections import defaultdict\r\n\r\nd = defaultdict(int)\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nfor ai in a:\r\n for bj in b:\r\n if (bj%ai) == 0:\r\n d[bj//ai]+=1\r\nans = sorted(d.items(), key = lambda x: x[0])[-1][1]\r\nprint(ans)\r\n \r\n \r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nres=[]\r\nfor i in b:\r\n for j in a:\r\n if i/j==int(i/j):\r\n res.append(i//j)\r\nprint(res.count(max(res)))", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=int(input())\r\nd=list(map(int,input().split()))\r\nans=0\r\ncount=0\r\nfor i in d:\r\n for j in b:\r\n if i%j==0:\r\n if ans<i//j:\r\n ans=i//j\r\n count=1\r\n elif ans==i//j:\r\n count=count+1\r\nprint(count)", "def solve(n_a,arr_a,n_b,arr_b):\n count = 0\n max_value = 0\n for b in arr_b:\n for a in arr_a:\n if b % a == 0:\n val = b // a\n if val == max_value:\n count += 1\n elif val > max_value:\n count = 1\n max_value = val\n return count\n \n\n \n\ndef main() :\n n_a = int(input())\n arr_a = list(map(int, input().split(' ')))\n n_b = int(input())\n arr_b = list(map(int, input().split(' ')))\n print(solve(n_a,arr_a,n_b,arr_b))\nmain()\n", "n=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\nma=-1\r\ndic={-1:0}\r\nfor i in range(m):\r\n for j in range(n):\r\n # print(b[i], a[j])\r\n if b[i]%a[j]==0: \r\n if b[i]//a[j] >= ma:\r\n ma = b[i]//a[j]\r\n # print(ma)\r\n if ma not in dic:\r\n dic[ma] = 1\r\n else:\r\n dic[ma]+=1 \r\n# print(dic)\r\nprint(dic[ma]) \r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nratios = {}\r\n\r\nfor first in a:\r\n for second in b:\r\n if second % first == 0:\r\n if not second // first in ratios:\r\n ratios[second // first] = 0\r\n ratios[second // first] += 1\r\n\r\nhighest = max(ratios)\r\nprint(ratios[highest])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 29 17:46:27 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\na = input()\r\na = a.split()\r\na = list(map(lambda x: int(x),a))\r\na = sorted(a)\r\nm = int(input())\r\nb = input()\r\nb = b.split()\r\nb = list(map(lambda x: int(x),b))\r\nratio = []\r\nfor i in b:\r\n for j in a:\r\n if i%j==0:\r\n ratio.append(i//j)\r\n pass\r\nmaximo = max(ratio)\r\nans = 0\r\nfor x in ratio:\r\n if x==maximo:\r\n ans+=1\r\nprint(ans)\r\n\r\n \r\n", "n = int(input())\r\ns1 = [int(x) for x in input().split()]\r\nm = int(input())\r\ns2 = [int(x) for x in input().split()]\r\n\r\nmax_ = 0\r\nmc = 0\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if (s2[i]/s1[j] == int(s2[i]/s1[j])):\r\n if s2[i]/s1[j] > max_:\r\n max_ = s2[i]/s1[j]\r\n mc = 1\r\n elif s2[i]/s1[j] == max_:\r\n mc += 1\r\nprint(mc)\r\n", "n = int(input())\r\ns = input()\r\nlis = s.split()\r\nm = int(input())\r\ns = input()\r\nlis2 = s.split()\r\n\r\nfor i in range(n):\r\n lis[i] = int(lis[i])\r\nfor j in range(m):\r\n lis2[j] = int(lis2[j])\r\n\r\nlisRes = []\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if lis2[i] % lis[j] == 0:\r\n lisRes.append(lis2[i] / lis[j])\r\n\r\nmaxx = max(lisRes)\r\nprint(lisRes.count(maxx))", "#code\r\n\r\nR = lambda:map(int,input().split())\r\n\r\nn, = R()\r\nx = list(R())\r\nm, = R()\r\ny = list(R())\r\n\r\nans = {}\r\nfor i in x:\r\n for j in y:\r\n if j%i < 1:\r\n if j//i not in ans:\r\n ans[j//i] = 1\r\n else:\r\n ans[j//i] += 1\r\n\r\nprint(ans[max(ans.keys())])", "i1 = int(input())\r\na1 = [int(x) for x in input().split()]\r\ni2 = int(input())\r\na2 = [int(x) for x in input().split()]\r\nmax_ratio = 0\r\ncount = 0\r\nfor i in a1:\r\n for j in a2:\r\n if j//i == j/i:\r\n ratio = j/i\r\n if max_ratio < ratio:\r\n max_ratio = ratio\r\n count = 1\r\n elif max_ratio == ratio:\r\n count += 1\r\nprint(count)", "a = int(input())\r\nc=list(map(int,input().split()))\r\nb = int(input())\r\nd=list(map(int,input().split()))\r\n\r\nmax_ratio = 0\r\nans = 0\r\nfor i in c:\r\n for j in d:\r\n if j%i==0:\r\n if j/i > max_ratio:\r\n max_ratio = j/i\r\n ans = 1\r\n elif j/i == max_ratio:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nint_rat = []\r\n\r\nfor bi in b:\r\n for ai in a:\r\n if ((bi / ai) - (bi // ai)) == 0:\r\n int_rat.append(bi // ai)\r\n\r\nmax_int_rat = max(int_rat)\r\nprint(int_rat.count(max_int_rat))", "#laddder 11\r\n#119A\r\n\r\n'''\r\ndef main():\r\n from sys import stdin, stdout\r\n a=[0,1,1]\r\n for _ in range(43):\r\n a.append(a[-1]+a[-2])\r\n #print(a)\r\n #print(len(a))\r\n #print(a[-1])\r\n\r\n n = int(stdin.readline())\r\n if n==0:\r\n print(0,0,0)\r\n return\r\n fp = 0\r\n sp = 45\r\n while fp<sp:\r\n if a[fp]+a[sp] == n:\r\n break\r\n elif a[fp]+a[sp] < n:\r\n fp+=1\r\n elif a[fp]+a[sp] > n:\r\n sp-=1\r\n\r\n if a[fp]+a[sp]==n:\r\n stdout.write(str(a[fp])+' '+str(a[sp-2])+' '+str(a[sp-1])+'\\n')\r\n else:\r\n stdout.write(\"I'm too stupid to solve this problem\\n\")\r\n\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n\r\n#320A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n\r\n state = [\r\n [-1,1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n [-1,1,-1,-1,2,-1,-1,-1,-1,-1],\r\n [-1,1,-1,-1,3,-1,-1,-1,-1,-1],\r\n [-1,1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n [-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n [-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n [-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n [-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n [-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n [-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],\r\n ]\r\n\r\n number = [int(x) for x in list(stdin.readline().strip())]\r\n #print(number)\r\n curr = 0;\r\n for i in number:\r\n #print(i,curr,state[curr][i])\r\n \r\n curr = state[curr][i]\r\n if curr == -1:\r\n break\r\n if curr == -1:\r\n stdout.write('NO\\n')\r\n else:\r\n stdout.write('YES\\n')\r\n\r\n\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n\r\n#43A\r\n'''\r\ndef main():\r\n from sys import stdin, stdout\r\n import collections\r\n \r\n c = collections.Counter()\r\n for _ in range(int(stdin.readline())):\r\n c[stdin.readline().strip()]+=1\r\n print(c.most_common()[0][0])\r\n\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n\r\n#215A\r\ndef main():\r\n from sys import stdin, stdout\r\n n = int(stdin.readline())\r\n a = list(map(int,stdin.readline().split()))\r\n m = int(stdin.readline())\r\n b = list(map(int,stdin.readline().split()))\r\n \r\n ans = {}\r\n for i in b:\r\n for j in a:\r\n if i%j==0:\r\n if i//j in ans:\r\n ans[i//j]+=1\r\n else:\r\n ans[i//j]=1\r\n\r\n stdout.write(str(ans[max(ans.keys())])+'\\n')\r\n\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nn2=int(input())\r\nb=[int(i) for i in input().split()]\r\nmaxx=0\r\nfor i in range(n):\r\n for j in range(n2):\r\n if b[j]%a[i]==0 and b[j]//a[i]>maxx:\r\n maxx=b[j]//a[i]\r\nt=0\r\nfor i in range(n):\r\n for j in range(n2):\r\n if b[j]%a[i]==0 and b[j]//a[i]==maxx:\r\n t+=1\r\nprint(t)", "i=lambda :map(int,input().split())\r\nn=i()\r\na=list(i())\r\nm=i()\r\nb=list(i())\r\nl=[x//y for x in b for y in a if x%y==0]\r\nprint(l.count(max(l)))\r\n", "n = int(input())\n# print('n:{}'.format(n)) # debug\na = [int(i) for i in input().split()]\n# print('a:{}'.format(a)) # debug\nm = int(input())\n# print('m:{}'.format(m)) # debug\nb = [int(i) for i in input().split()]\n# print('b:{}'.format(b)) # debug\nres = list(filter(lambda x: x.is_integer(),\n list(i / j for j in a for i in b)))\nmaxv = max(res)\nprint(res.count(maxv))\n", "\r\ndef calc(fs, rs):\r\n best = 0\r\n count = 0\r\n\r\n for i in range(len(fs)):\r\n for j in range(len(rs)):\r\n if rs[j] % fs[i] != 0:\r\n continue\r\n ratio = rs[j]//fs[i]\r\n if ratio == best:\r\n count += 1\r\n elif ratio > best:\r\n best = ratio\r\n count = 1\r\n return count\r\n\r\n# get inputs\r\nN = int(input())\r\nfs = list(map(int, input().split()))\r\nm = int(input())\r\nrs = list(map(int, input().split()))\r\n\r\nprint(calc(fs, rs))\r\n", "\"\"\"\r\nLogic\r\n1. Take inputs.\r\n2. iterate 2 for loops and divide all b's by all a's to see the available gears.\r\n3. add the gears to the list, find out the max element.\r\n4. find the count of the max element and print to the user.\r\n\"\"\"\r\n\r\na_n = int(input())\r\na_lst = list(map(int, input().rstrip().split()))\r\nb_n = int(input())\r\nb_lst = list(map(int, input().rstrip().split()))\r\ngear_lst = []\r\n\r\nfor i in a_lst:\r\n for j in b_lst:\r\n if j / i == j // i:\r\n gear_lst.append(j // i)\r\n\r\nmax_gear_lst = max(gear_lst)\r\nprint(gear_lst.count(max_gear_lst))\r\n", "n = int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nk=list(map(int,input().split()))\r\nres=[]\r\nfor i in range(m):\r\n for j in range(n):\r\n if(k[i]%l[j]==0):\r\n res.append(k[i]//l[j])\r\nprint(res.count(max(res)))", "l1 = []\nl2 = []\n\na = int(input())\nc = input()\nl1 = [int(i) for i in c.split(' ')]\nengre_a = []\nfor i in range(0, a):\n engre_a.append(int(l1[i]))\n\nb = int(input())\nc = input()\nl2 = [int(i) for i in c.split(' ')]\nengre_b = []\nfor i in range(0, b):\n engre_b.append(int(l2[i]))\n\nmax = 0\nquant = 0;\nfor i in range(0, b):\n for j in range(0, a):\n if engre_b[i] % engre_a[j] == 0:\n r = engre_b[i] / engre_a[j]\n if r > max:\n max = r\n quant = 1\n elif r == max:\n quant += 1\n\nprint(quant)\n \t \t\t \t\t\t \t\t\t \t\t \t \t \t \t", "input()\r\nn_list = list(map(int, input().split()))\r\ninput()\r\nm_list = list(map(int, input().split()))\r\nbest = count = 0\r\nfor i in n_list:\r\n for j in m_list:\r\n if j % i == 0:\r\n if j // i > best:\r\n best = j // i\r\n count = 1\r\n elif j // i == best:\r\n count += 1\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nd=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n):\r\n for j in range(m):\r\n r=d[j]/l[i]\r\n if(int(r)==r):\r\n x=max(int(r),x)\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n r=d[j]/l[i]\r\n if(int(r)==r):\r\n if(int(r)==x):\r\n c=c+1\r\nprint(c)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nmax_glob=0\r\ncount=0\r\nfor i in range(n):\r\n for j in range(m-1,-1,-1):\r\n if b[j]%a[i]==0:\r\n # print(\"b[j]:{} and a[i]:{}\".format(b[j],a[i]))\r\n temp=b[j]/a[i]\r\n if temp>max_glob:\r\n max_glob=temp\r\n count=1\r\n # print(\"max_glob:{} and count:{} in reset\".format(max_glob,count))\r\n break\r\n elif temp==max_glob:\r\n count+=1\r\n # print(\"max_glob:{} and count:{} in increment\".format(max_glob,count))\r\nprint(count)\r\n \r\n ", "n=int(input())\na=[i for i in map(int,input().split())]\nm=int(input())\nb=[i for i in map(int,input().split())]\ns=[]\nfor i in a:\n for j in b:\n c=j/i\n if int(c)==c:\n s.append(c)\ns.sort()\nprint(s.count(s[-1]))\n", "input()\r\np=list(map(int,input().split()))\r\ninput()\r\nw=list(map(int,input().split()))\r\nmx=-1\r\nc=0\r\nfor b in w:\r\n for a in p:\r\n if b%a==0:\r\n if b//a==mx:\r\n c+=1\r\n elif b//a>mx:\r\n c=1\r\n mx=b//a\r\nprint(c)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nk=0\r\nk1=0\r\nfor i in b :\r\n for j in a :\r\n if i/j==k :\r\n k1+=1\r\n if i%j==0 and i/j>k :\r\n k=i/j\r\n k1=1\r\n\r\nprint(k1)", "n=int(input())\r\na=[float(x) for x in input().split()]\r\nm=int(input())\r\nb=[float(x) for x in input().split()]\r\nc=0\r\nmax=0.0\r\nfor i in a:\r\n for j in b:\r\n q=(float)(j/i)\r\n if(q-(j//i)==0):\r\n if(q==max):\r\n c+=1\r\n elif(q>max):\r\n max=q\r\n c=1\r\nprint(c)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n b = list(map(int, input().split()))\r\n\r\n L = list()\r\n for j in range(m):\r\n for i in range(n):\r\n if b[j] % a[i] == 0:\r\n L.append(b[j] // a[i])\r\n L.sort()\r\n L.reverse()\r\n print(L.count(L[0]))", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nans=[]\r\nfor i in l1:\r\n for j in l2:\r\n if(j/i)%1==0:\r\n ans.append(j//i)\r\nprint(ans.count(max(ans)))\r\n ", "n = int(input())\r\na = [int(_) for _ in input().split()]\r\nm = input()\r\nb = [int(_) for _ in input().split()]\r\nans = []\r\nfor x in a:\r\n for y in b:\r\n if y / x == y // x:\r\n ans.append(y // x)\r\nprint(ans.count(max(ans)))", "n=int(input())\r\nlstn=list(map(int,input().split()))\r\nm= int(input())\r\nlstm=list(map(int,input().split()))\r\nfinal=[]\r\nfor i in lstn:\r\n for j in reversed(lstm):\r\n if (j/i).is_integer():\r\n final.append(int(j/i))\r\n break\r\nprint(final.count(max(final)))", "n1=int(input())\r\nl1=list(map(int,input().split()))\r\nn2=int(input())\r\nl2=list(map(int,input().split()))\r\nd={}\r\nma=0\r\ncount=0\r\nfor i in l1:\r\n for j in l2:\r\n if j%i==0:\r\n if j//i>ma:\r\n count=1\r\n ma=j//i\r\n elif j//i==ma:\r\n count+=1\r\nprint(count)", "n1=int(input())\r\narr1=list(map(int,input().split()))\r\nn2=int(input())\r\narr2=list(map(int,input().split()))\r\n\r\nl=[]\r\nfor i in arr2:\r\n for j in arr1:\r\n if i%j==0:\r\n l.append(i//j)\r\n\r\nl.sort() \r\nx=l[-1]\r\nc=0\r\nfor i in l:\r\n if i==x:\r\n c=c+1\r\n \r\nprint(c)", "n=int(input())\nlis_n=list(map(int,input().split()))\nm=int(input())\nlis_m=list(map(int,input().split()))\nlis=[]\nfor b in lis_m:\n for a in lis_n:\n if (b/a)%1.0==0:\n lis.append(b/a)\nprint(lis.count(max(lis)))\n\n\n\n \n\n\n\n\n", "a=int(input())\r\nb=map(int,input().split())\r\nx=list(b)\r\nc=int(input())\r\nd=map(int,input().split())\r\ny=list(d)\r\nbos=[]\r\nfor i in range(len(y)):\r\n for k in range(len(x)):\r\n if y[i]%(x[k])==0:\r\n bos.append(y[i]/(x[k]))\r\nprint(bos.count(max(bos)))", "n=int(input())\r\nln=list(map(int,input().split()))\r\nm=int(input())\r\nlm=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n e=lm[j]/ln[i]\r\n if e%1==0:\r\n l.append(int(e))\r\nprint(l.count(max(l)))\r\n", "n = int(input())\r\n*a, = map(int, input().split())\r\nm = int(input())\r\n*b, = map(int, input().split())\r\nmx = 0\r\nfor i in a:\r\n for j in b:\r\n if j % i == 0:\r\n mx = max(j // i, mx)\r\nans = 0\r\nfor i in a:\r\n for j in b:\r\n if j % i == 0 and j // i == mx:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nln=list(map(int,input().split()))\r\nm=int(input())\r\nlm=list(map(int,input().split()))\r\nl=[]\r\nc=0\r\nfor i in range(len(lm)):\r\n for j in range(len(ln)):\r\n if lm[i]//ln[j]==lm[i]/ln[j]:\r\n l.append(lm[i]/ln[j])\r\nfor i in range(len(l)):\r\n if l[i]==max(l):\r\n c+=1\r\nprint(c)\r\n ", "n = int(input())\nnz = [int(s) for s in input().split()]\nm = int(input())\nmz = [int(s) for s in input().split()]\na = []\nfor i in range(n):\n for j in range(m):\n if mz[j] % nz[i] == 0:\n t = mz[j] / nz[i]\n a.append(int(t))\nmax = 0\nk = 0\nfor i in range(len(a)):\n if a[i] > max:\n max = a[i]\n k = 1\n else:\n if a[i] == max:\n k += 1\nprint(k)\n", "n = int(input())\r\n\r\nfront = list(int(i) for i in input().split())\r\n\r\nm = int(input())\r\n\r\nrear = list(int(i) for i in input().split())\r\n\r\ngear = []\r\n\r\nmax = 0\r\nmax_ratio = 0\r\n\r\nfor i in rear:\r\n for j in front:\r\n ratio = i/j\r\n # print(i/j, ratio.is_integer())\r\n if ratio.is_integer():\r\n gear.append(i/j)\r\n\r\n\r\nfor i in gear:\r\n \r\n if i >= max_ratio:\r\n if i != max_ratio:\r\n max_ratio = i\r\n max = 1\r\n \r\n elif i == max_ratio:\r\n max_ratio = i\r\n max += 1\r\n \r\n\r\nprint(max)\r\n", "n=int(input())\r\nlist1=[int(x) for x in input().split()]\r\nm=int(input())\r\nlist2=[int(x) for x in input().split()]\r\nlist3=[]\r\nfor i in list2:\r\n for j in list1:\r\n if i%j==0:\r\n list3.append(i//j)\r\nprint(list3.count(max(list3)))\r\n", "# https://codeforces.com/problemset/problem/215/A\r\n\r\n\r\na = int(input())\r\narr = [int(x) for x in input().split()]\r\nb = int(input())\r\nar = [int(x) for x in input().split()]\r\n\r\ncount = 0\r\nm = 0\r\nfor i in arr:\r\n for j in ar:\r\n if (j/i) - (j//i) == 0 and j/i >= m:\r\n # print(j,i )\r\n if m != j/i:count = 0\r\n count += 1\r\n m = j/i\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nr = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n r.append(b[j] // a[i])\r\nprint(r.count(max(r)))\r\n", "I = lambda: list(map(int, input().split()))\r\n\r\ninput()\r\nA = I()\r\ninput()\r\nB = I()\r\nX = [b//a for a in A for b in B if b%a==0]\r\n\r\nprint(X.count(max(X)))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nli = []\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tx = b[j] / a[i]\r\n\t\tif x == int(x):\r\n\t\t\tli.append(int(x))\r\nmx = max(li)\r\nprint(li.count(mx))\r\n", "import sys\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\nmp={}\r\nfor i in range(len(b)):\r\n\r\n for j in range(len(a)):\r\n if b[i]%a[j]==0:\r\n try:\r\n x=mp.get(b[i]//a[j])\r\n mp[b[i]//a[j]]=x+1\r\n except:\r\n mp[b[i]//a[j]]=1\r\n\r\nm=0\r\nfor i in mp:\r\n if i>m:\r\n m=i\r\n\r\n\r\nprint(mp[m])\r\n\r\n", "__author__ = 'Esfandiar'\nn = int(input())\na = list(map(int,input().split()))\nm = int(input())\nb = list(map(int,input().split()))\nM = -1e11\nres = 0\nfor i in range(m-1,-1,-1):\n for j in range(n):\n if b[i] % a[j] == 0:\n yy = b[i] // a[j]\n if yy > M:\n res = 1\n M = yy\n elif yy == M:\n res+=1\n \nprint(res)\n\n\n", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\tn = int(input())\n\tais = list(map(int, input().split()))\n\tm = int(input())\n\tbjs = list(map(int, input().split()))\n\tmax_count = 0\n\tmaxx = 0\n\tfor ai in ais:\n\t\tfor bj in bjs:\n\t\t\tif bj/ai == bj//ai:\n\t\t\t\tif bj//ai == maxx:\n\t\t\t\t\tmax_count += 1\n\t\t\t\telif bj//ai > maxx:\n\t\t\t\t\tmax_count = 1\n\t\t\t\t\tmaxx = bj//ai\n\tprint(max_count)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nans=[]\r\ni=0\r\nwhile (i<m):\r\n j=0\r\n while(j<n):\r\n if b[i]/a[j]==b[i]//a[j] and a[j]!=0:\r\n ans.append(b[i]//a[j])\r\n j+=1\r\n i+=1\r\nprint(ans.count(max(ans)))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nt=list(map(int,input().split()))\r\nk=[]\r\nfor i in t:\r\n for j in l:\r\n if i%j==0:\r\n k +=[i//j]\r\nelse:\r\n print(k.count(max(k)))\r\n \r\n ", "int(input())\r\nl = [int(i) for i in input().split()]\r\nint(input())\r\ns = [int(i) for i in input().split()]\r\n\r\nmr = 0\r\n\r\nfor i in s[::-1]:\r\n for j in l:\r\n if i%j==0 and i/j>mr:\r\n mr = i/j\r\nl2 = [i/j for i in s for j in l]\r\n\r\nprint(l2.count(mr))", "\r\nn = int(input())\r\nln = list(map(int, input().split()))\r\nm = int(input())\r\nlm = list(map(int, input().split()))\r\nl = []\r\n\r\nfor i in ln:\r\n\tfor j in lm:\r\n\t\tif j % i == 0:\r\n\t\t\tl.append(j // i)\r\n\r\n\r\nprint(l.count(max(l)))\r\n", "n,a = int(input()),list(map(int,input().split()))\r\nm,b = int(input()),list(map(int,input().split()))\r\narr = []\r\nfor i in b:\r\n for j in a:\r\n if i % j == 0:\r\n arr.append(i//j)\r\nm = max(arr)\r\nprint(arr.count(m))", "def main():\n #n, m = list(map(int, input().split(' ')))\n n = int(input())\n A = list(map(int, input().split(' ')))\n m = int(input())\n B = list(map(int, input().split(' ')))\n\n max_val = 0\n counter = {}\n\n for x in A:\n for y in B:\n if y % x != 0:\n continue\n val = y // x\n if val not in counter:\n counter[val] = 0\n counter[val] += 1\n if val > max_val:\n max_val = val\n\n print(counter[max_val])\n\n \nif __name__ == \"__main__\":\n main()\n", "from math import remainder\r\n\r\n\r\ninput()\r\nfirst_gear= list(map(int,input().split()))\r\ninput()\r\nsecond_gear = list(map(int,input().split()))\r\ndivisons = []\r\nfor teeth in second_gear:\r\n for spike in first_gear:\r\n if teeth % spike == 0:\r\n divisons.append(teeth/spike)\r\ndivisons.sort(reverse=True)\r\nout = 0\r\ndiv = -1\r\nfor number in divisons:\r\n if number > div:\r\n out = 1\r\n div = number\r\n elif number == div:\r\n out+=1\r\n else:\r\n break\r\nprint(out)", "import collections\r\nfrom math import log2, log10, ceil\r\n\r\ndef pow2(n):\r\n t = 0\r\n while not(n&1):\r\n n = n//2\r\n t += 1\r\n return t\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n b = list(map(int, input().split()))\r\n\r\n max = 0\r\n count = 0\r\n for i in a:\r\n for j in b:\r\n q = j//i\r\n if q*i == j and q>max:\r\n count = 1\r\n max = q\r\n elif q*i == j and q==max:\r\n count += 1\r\n print(count)\r\n \r\ndef main():\r\n t = 1\r\n while t:\r\n t -= 1\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = int(input())\r\nc=list(map(int,input().split()))\r\nb = int(input())\r\nd=list(map(int,input().split()))\r\n\r\nratios = []\r\nfor i in c:\r\n for j in d:\r\n if j%i==0:\r\n ratios.append(j/i) \r\nprint(ratios.count(max(ratios)))", "n=int(input(\"\"))\r\na=input(\"\").split(\" \")\r\nm=int(input(\"\"))\r\nb=input(\"\").split(\" \")\r\nlist1=[]\r\nlist2=[]\r\nfor i in a:\r\n list1.append(int(i))\r\nfor j in b:\r\n list2.append(int(j))\r\na1=sorted(list1)\r\nb1=sorted(list2)\r\nlist3=[]\r\nfor i in b1:\r\n for j in a1:\r\n if i%j==0:\r\n list3.append(i/j)\r\nprint(list3.count(max(list3)))", "n=int(input())\r\nai=[int(x) for x in input().split()]\r\nm=int(input())\r\nbj=[int(x) for x in input().split()]\r\ngears=[]\r\nfor i in ai:\r\n for j in bj:\r\n if(j%i==0):\r\n gears.append(int(j/i))\r\nmaxgear=max(gears)\r\nprint(gears.count(maxgear))", "n=int(input())\na = list(map(int, input().split()))\nm=int(input())\nb = list(map(int, input().split()))\nl=[]\nfor i in range(m):\n for j in range(n):\n if b[i]%a[j]==0:\n l.append(b[i]//a[j])\nprint(l.count(max(l)))\n \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\nb=list(map(int,input().split()))\r\ncount=[]\r\nfor i in a:\r\n for j in b:\r\n if(j%i==0):\r\n count.append(j//i)\r\nma=max(count)\r\nprint(count.count(ma))\r\n ", "n=int(input())\r\nx=list(map(int,input().split()))\r\nm=int(input())\r\ny=map(int,input().split())\r\nl=[]\r\nfor j in y:\r\n for i in x:\r\n if(j/i==int(j//i)):\r\n l.append(int(j//i))\r\np=max(l)\r\nd=l.count(p)\r\nprint(d)", "input()\ni = list(map(int, input().split()))\ninput()\nj = list(map(int, input().split()))\nx = [b // a for a in i for b in j if b % a == 0]\nprint(x.count(max(x)))\n", "a = int(input())\r\nA = list(map(int, input().split()))\r\nb = int(input())\r\nB = list(map(int, input().split()))\r\n\r\nk = 1\r\ns = 0\r\nfor i in B:\r\n for j in A:\r\n if j * k > i: continue\r\n if i % j == 0:\r\n if j * k == i: s += 1\r\n else:\r\n s = 1\r\n k = i // j\r\nprint(s) ", "n=int(input())\r\nl=[int(num) for num in input().split(\" \")]\r\nm=int(input())\r\nt=[int(num) for num in input().split(\" \")]\r\ny=[j/i for i in l for j in t if j%i==0]\r\nmaxi=max(y)\r\ncount=0\r\nfor i in y:\r\n if i==maxi:\r\n count=count+1\r\nprint(count)", "n=int(input())\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nl1=list(map(int,input().split()))\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nc=1\r\nfor i in l1:\r\n for j in l2:\r\n if (j%i==0):\r\n l3.append(j/i)\r\n\r\n\r\nl3.sort(reverse=True)\r\nfor i in range (1,len(l3)):\r\n if (l3[i]==l3[0]):\r\n c=c+1\r\n\r\nprint(c)\r\n", "p_gear=int(input())\r\np_gears=list(map(int,input().split()))\r\nr_gear=int(input())\r\nr_gears=list(map(int,input().split()))\r\ngear_ratio=[]\r\nfor i in range(p_gear):\r\n for j in range(r_gear):\r\n if r_gears[j]%p_gears[i]==0:\r\n gear_ratio.append(r_gears[j]/p_gears[i])\r\nmax_gear=max(gear_ratio)\r\nprint(gear_ratio.count(max_gear))", "x = int(input())\r\nlst = list(map(int,input().split()))\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nk = []\r\nmax=0\r\ncount=0\r\nfor i in ls:\r\n for j in lst:\r\n if i%j==0:\r\n x = i/j\r\n if x>max:\r\n max=x\r\n count = 1\r\n elif x==max:\r\n count+=1\r\nprint(count)", "n = int(input())\npedal_gear = list(map(int, input().split()))\nm = int(input())\nrear_gear = list(map(int, input().split()))\n\nratios = []\nexit = False\nfor j in range(m - 1, -1, -1):\n if exit:\n break\n for i in range(0, n):\n div = rear_gear[j] / pedal_gear[i]\n if int(div) == div:\n ratios.append(div)\n if i == 0:\n exit = True\n break\n\nprint(ratios.count(max(ratios)))\n\t\t\t \t\t \t \t\t\t \t\t \t \t\t \t\t \t", "n=input()\r\na1=input()\r\na=a1.split()\r\nm=input()\r\nb1=input()\r\nb=b1.split()\r\nk=int(n)*int(m)\r\nc=[0]*k\r\np=0\r\nfor i in a:\r\n for j in b:\r\n if (int(j)%int(i)) == 0:\r\n c[p]=(int(j)/int(i))\r\n p+=1\r\nc.sort()\r\nc.reverse()\r\nu=c.count(c[0])\r\nprint(u)\r\n\r\n", "n=int(input()) \r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nl=list()\r\nfor i in range(0,len(a)):\r\n for j in range(0,len(b)):\r\n if b[j]/a[i]%1==0:\r\n l.append(b[j]/a[i])\r\nprint(l.count(max(l))) ", "n=int(input())\r\narr1=list(map(int,input().split()))\r\nm=int(input())\r\narr2=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n k=arr2[j]/arr1[i]\r\n d1=arr2[j]//arr1[i]\r\n if(k==d1):\r\n \td.append(d1)\r\nd.sort(reverse=True)\r\nprint(d.count(d[0]))", "from collections import Counter\r\n\r\n\r\nclass Code:\r\n def __init__(self):\r\n self.n = int(input())\r\n self.arr_1 = list(map(int, input().split()))\r\n self.m = int(input())\r\n self.arr_2 = list(map(int, input().split()))\r\n\r\n def process(self):\r\n lis = []\r\n mx = 0\r\n for b in self.arr_2:\r\n for a in self.arr_1:\r\n if b / a == b // a:\r\n lis.append(b // a)\r\n mx = max(mx, b // a)\r\n break\r\n print(Counter(lis)[mx])\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "input()\r\na=list(map(int,input().split()))\r\ninput()\r\nb=list(map(int,input().split()))\r\ncnt,ans=0,0\r\nfor i in a:\r\n for j in b:\r\n if j%i==0:\r\n if ans < j//i:\r\n ans=j//i;\r\n cnt=1\r\n elif ans==j//i:\r\n cnt+=1\r\nprint(cnt)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nz=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n d=b[j]/a[i]\r\n if(d==int(d)):\r\n z.append(d)\r\nl=z.count(max(z))\r\nprint(l)\r\n", "def solve(n, m, pedal_axle, wheel_axle):\r\n maximum = 0\r\n for i in range(n):\r\n for j in range(m):\r\n temp1 = wheel_axle[j] / pedal_axle[i]\r\n temp2 = wheel_axle[j] // pedal_axle[i]\r\n if temp1 > maximum and temp2 == temp1:\r\n maximum = temp1\r\n count = 0\r\n for i in range(n):\r\n for j in range(m):\r\n temp1 = wheel_axle[j] / pedal_axle[i]\r\n temp2 = wheel_axle[j] // pedal_axle[i]\r\n if temp1 == temp2 and temp1 == maximum:\r\n count += 1\r\n return count\r\n\r\ndef main():\r\n n = int(input())\r\n pedal_axle = [int(a) for a in input().strip().split()]\r\n m = int(input())\r\n wheel_axle = [int(a) for a in input().strip().split()]\r\n print(solve(n, m, pedal_axle, wheel_axle))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\na=list(map(int,input().split()))\nm=int(input())\nb=list(map(int,input().split()))\nans=0\nmaxx=0\nfor j in range(m-1,-1,-1):\n for i in range(n):\n r=b[j]/a[i]\n if int(r)==r:\n if r==maxx:\n ans+=1\n elif r>maxx:\n maxx=r\n ans=1\n \nprint(ans)", "m = int(input())\r\nz = input()\r\npedal1 = z.split()\r\nfor i in range(0,m):\r\n\tpedal1[i] = int(pedal1[i])\r\nq = int(input())\r\nv = input()\r\npedal2 = v.split()\r\nfor i in range(0,q):\r\n\tpedal2[i] = int(pedal2[i])\r\ngearcount = 0\r\ngear = 0\r\n#-----------------------------\r\nfor i in range(0,m):\r\n chkptr = len(pedal2) - 1\r\n if(pedal1[i] != 1):\r\n while(pedal2[chkptr] % pedal1[i] !=0):\r\n chkptr -= 1\r\n if(chkptr < 0):\r\n break\r\n if(chkptr < 0):\r\n continue\r\n newgear = int(pedal2[chkptr] / pedal1[i])\r\n if(gear == newgear or gear == 0):\r\n gearcount += 1\r\n gear = newgear\r\n elif(gear < newgear):\r\n gear = newgear\r\n gearcount = 1\r\n else:\r\n gear = pedal2[-1]\r\n gearcount = 1\r\nprint(gearcount)\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\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\narr = [0]\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n\r\n if b[i] % a[j] == 0 and b[i]//a[j] >= max(arr):\r\n arr.append(b[i]//a[j])\r\n\r\nans = arr.count(max(arr))\r\nprint(ans)\r\n", "def main():\n A = int(input())\n a = [int(x) for x in input().split()]\n B = int(input())\n b = [int(x) for x in input().split()]\n\n count = 0\n m = -1\n for i in range(B-1, -1, -1):\n curr = b[i]\n for x in a:\n if (curr/x)==(curr//x):\n if m == (curr//x):\n count+=1\n else:\n if (curr//x)>m:\n m = (curr//x)\n count = 1\n\n\n\n print(count)\n return\n\n\nmain()\n", "n=int(input())\r\np=input()\r\np=list(map(int,p.split()))\r\nm=int(input())\r\nq=input()\r\nq=list(map(int,q.split()))\r\nq.sort(reverse=True)\r\nw=[]\r\nfor i in p:\r\n for j in q:\r\n if (j/i)==int(j/i):\r\n w.append(int(j/i))\r\nw.sort()\r\nc=max(w)\r\nprint(w.count(c))\r\n\r\n", "first_stars_quantity = int(input())\r\nfirst_stars = [int(x) for x in input().split()]\r\nsecond_stars_quantity = int(input())\r\nsecond_stars = [int(x) for x in input().split()]\r\nmax_gear_ratio = 0 #максимальное передаточное число\r\nmax_gear_ratio_quantity = 0\r\nif first_stars[0] == 1:\r\n\tprint(1)\r\nelse:\r\n\ti = 0\r\n\twhile i < second_stars_quantity:\r\n\t\tj = 0\r\n\t\twhile j < first_stars_quantity:\r\n\t\t\tif second_stars[i]%first_stars[j] == 0:\r\n\t\t\t\tif second_stars[i]//first_stars[j] > max_gear_ratio:\r\n\t\t\t\t\tmax_gear_ratio = second_stars[i]//first_stars[j]\r\n\t\t\t\t\tmax_gear_ratio_quantity = 1\r\n\t\t\t\telif second_stars[i]//first_stars[j] == max_gear_ratio:\r\n\t\t\t\t\tmax_gear_ratio_quantity += 1\r\n\t\t\t\tbreak\r\n\t\t\tj += 1\r\n\t\ti += 1\r\n\tprint(max_gear_ratio_quantity)", "#from collections import Counter\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nm = int(input())\r\nk = list(map(int,input().split()))\r\n\r\nmax1 = -1\r\nc = 0\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if k[i]/l[j] == int(k[i]/l[j]):\r\n if max1 < int(k[i]/l[j]):\r\n max1 = int(k[i]/l[j])\r\n c = 1\r\n elif max1 == int(k[i]/l[j]):\r\n c += 1\r\n\r\nprint(c)\r\n", "no_of_pedal_stars = int(input())\npedal_stars = list(map(int , input().split(\" \")))\nno_of_wheel_stars = int(input())\nwheel_stars = list(map(int , input().split(\" \")))\n\npairs = [j / i for i in pedal_stars for j in wheel_stars if j % i == 0]\n\nprint(pairs.count(max(pairs)))\n", "\n#input\nn = int(input())\na = input()\na = a.strip().split(' ')\na = list(map(int,a))\nm =int(input())\nb = input()\nb = b.strip().split(' ')\nb = list(map(int,b))\n\nmaxm = 0 #holds maxm\ncounter = 0 #counts maxm \nfor ai in a:\n for bj in b:\n if bj % ai == 0: #checks for integer ratio\n number = bj / ai\n if number > maxm:\n maxm = number\n counter = 1\n elif number == maxm:\n counter +=1\n\nprint(counter)\n \t \t\t\t\t \t \t \t\t\t \t\t\t\t\t \t \t\t\t\t", "i1 = int(input())\r\narr1 = list(map(int, input().split()))\r\ni2 = int(input())\r\narr2 = list(map(int, input().split()))\r\n\r\nbest = 0\r\n\r\nfor i in arr1:\r\n for j in arr2:\r\n if(j % i == 0):\r\n best = max(best, int(j/i))\r\n\r\ncount = 0\r\nfor i in arr1:\r\n for j in arr2:\r\n if(j % i == 0):\r\n if(int(j/i) == best):\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\na = input()\r\na = a.strip().split(' ')\r\na = list(map(int,a))\r\nm =int(input())\r\nb = input()\r\nb = b.strip().split(' ')\r\nb = list(map(int,b))\r\n \r\nmaxm = 0 #holds maxm\r\ncounter = 0 #counts maxm \r\nfor ai in a:\r\n for bj in b:\r\n if bj % ai == 0: #checks for integer ratio\r\n number = bj / ai\r\n if number > maxm:\r\n maxm = number\r\n counter = 1\r\n elif number == maxm:\r\n counter +=1\r\n \r\nprint(counter)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\nmr=0\r\n\r\nfor i in a:\r\n for j in b[::-1]:\r\n r=j/i\r\n if r==int(r) and mr<r:\r\n mr=r\r\n\r\n \r\n\r\nfor i in a:\r\n if mr*i in b:\r\n c+=1\r\n \r\nprint(c)\r\n\r\n \r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nn2=int(input())\r\nl1=list(map(int,input().split()))\r\n\r\nm=float('-inf')\r\n\r\nfor i in range(len(l)):\r\n for j in range(len(l1)):\r\n if l1[j]%l[i]==0:\r\n m=max(m,(l1[j]/l[i]))\r\n \r\nc=0\r\nfor i in range(len(l)):\r\n for j in range(len(l1)):\r\n if l1[j]%l[i]==0:\r\n if l1[j]/l[i]==m:\r\n c+=1\r\n \r\nprint(c)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\nmaxi=0\r\nme=0\r\nfor i in range(n):\r\n for j in range(m):\r\n # print(i,j,me,maxi)\r\n if b[j]%a[i]==0:\r\n if maxi==b[j]//a[i]:\r\n me+=1\r\n elif maxi<b[j]//a[i]:\r\n maxi=b[j]//a[i]\r\n me=1\r\nprint(me)", "n=int(input())\r\nA=[int(x) for x in input().split()]\r\nm=int(input())\r\nB=[int(x) for x in input().split()]\r\nC=[]\r\nfor i in A:\r\n for j in B:\r\n if j%i==0:\r\n C.append(j//i)\r\nprint(C.count(max(C)))", "n = int(input())\nl_n = list(map(int, input().split()))\nm = int(input())\nl_m = list(map(int, input().split()))\n\nmax = 0\nqtd = 0\nfor i in l_m:\n for j in l_n:\n if i % j == 0:\n if i / j > max:\n max = i / j\n qtd = 0\n if i / j == max:\n qtd += 1\n \n\nprint(qtd)\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\na=list(map(int,input().split(\" \")))\r\nm=int(input())\r\nb=list(map(int,input().split(\" \")))\r\nf=[]\r\nfor i in range(len(b)):\r\n for j in range(len(a)):\r\n g=b[i]/a[j]\r\n e=b[i]//a[j]\r\n if g-e==0:\r\n f.append(g)\r\nx=max(f)\r\nc1=0\r\nfor k in range(len(f)):\r\n if f[k]==x:\r\n c1+=1\r\nprint(c1)", "n=int(input())\r\na =[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\n\r\nb.reverse()\r\ncount = 0\r\n\r\nratios = []\r\nfor i in b:\r\n for j in a:\r\n z=i/j\r\n t=int(z)\r\n if(t==z):\r\n ratios.append(t)\r\n\r\nx=max(ratios)\r\n\r\nfor k in ratios:\r\n if(x == k):\r\n count += 1\r\n\r\nprint(count)\r\n", "m=int(input())\r\na=list(map(int,input().split()))\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in a:\r\n for j in b:\r\n if(j%i==0):\r\n c.append(j//i)\r\nm=max(c)\r\nprint(c.count(m))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\ng, res = 0, 0\r\nfor i in a:\r\n for j in b:\r\n if j % i == 0:\r\n if j / i > g:\r\n g = j // i\r\n res = 1\r\n elif j // i == g:\r\n res += 1\r\nprint(res)\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nm=int(input())\r\nr=list(map(int,input().split()))\r\nx=[]\r\nexit=False\r\nfor j in range(m-1,-1,-1):\r\n if exit:\r\n break\r\n for i in range(0,n):\r\n d=r[j]/p[i]\r\n if int(d)==d:\r\n x.append(d)\r\n if i==0:\r\n exit=True\r\n break\r\nprint(x.count(max(x)))", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\n\nmax_ratio = -1\nmax_counter = 0\nfor _a in a:\n for _b in b:\n if _b % _a != 0:\n continue\n ratio = _b // _a\n if ratio > max_ratio:\n max_ratio = ratio\n max_counter = 1\n elif ratio == max_ratio:\n max_counter += 1\nprint(max_counter)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nans=0\r\nmaxi=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i]==0:\r\n maxi.append(b[j]//a[i])\r\nx=max(maxi)\r\nans=maxi.count(x)\r\nprint(ans)\r\n ", "n=int(input())\r\n\r\na=list(map(int, input().split()))\r\n\r\nm=int(input())\r\n\r\nb=list(map(int, input().split()))\r\n\r\nmax=0\r\n\r\nfor j in b:\r\n for i in a:\r\n if j%i==0 and (j/i)>max:\r\n max=j/i\r\n count=0\r\n \r\n if j/i == max:\r\n count+=1\r\n \r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nmaxi=0\r\nres=0\r\nfor i in range(n):\r\n for j in range(m-1,-1,-1):\r\n if b[j]%a[i]==0:\r\n if maxi<b[j]/a[i]:\r\n maxi=b[j]/a[i]\r\n res=1\r\n elif maxi==b[j]/a[i]:\r\n res+=1\r\n \r\nprint(res)\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nma = 0\r\nfor i in a:\r\n for j in b:\r\n if not j % i:\r\n ma = max(ma, j // i)\r\nans = 0\r\nfor i in a:\r\n for j in b:\r\n if ma * i == j:\r\n ans += 1\r\nprint(ans)", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\nb = [int(i) for i in input().split()]\n\nans = 0\ncnt = 0\nfor i in a:\n for j in b:\n if j % i == 0:\n if ans < j // i:\n ans = j // i\n cnt = 1\n elif ans == j // i:\n cnt += 1\n\nprint(cnt)\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\ncount = 0\r\nmax_gear = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i] == 0:\r\n if b[j] / a[i] == max_gear:\r\n count+=1\r\n elif b[j]/a[i] > max_gear:\r\n count = 1\r\n max_gear = b[j]/a[i]\r\n\r\nprint(count)", "#L2 HW3 \"Bicycle Chain\"\r\n\r\nn = int(input())\r\nline1 = input().split()\r\nm = int(input())\r\nline2 = input().split()\r\n\r\npedal = []\r\nrear = []\r\n\r\nratio = []\r\n\r\nfor i in range(n):\r\n pedal.append(int(line1[i]))\r\n\r\n\r\nfor i in range(m):\r\n rear.append(int(line2[i]))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n fraction = rear[j]/pedal[i]\r\n if fraction.is_integer():\r\n ratio.append(fraction)\r\n\r\nratio.sort()\r\ncount = 0\r\nmaxi = ratio[len(ratio)-1]\r\n\r\nfor elem in ratio:\r\n if elem == maxi:\r\n count = count+1\r\n\r\nprint(count)\r\n\r\n \r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nk=list(map(int,input().split()))\r\np=[]\r\nfor i in l:\r\n for j in k:\r\n if j/i==int(j/i):\r\n p.append(int(j/i))\r\nprint(p.count(max(p)))\r\n ", "n = int(input())\naxle = list(map(int, input().split(' ')))\nm = int(input())\nwheel = list(map(int, input().split(' ')))\n\ngear_ratio = 0\nnum_max = 0\ni = 0\nj = m-1\n\nwhile(j >= 0):\n if(wheel[j]%axle[i] == 0):\n if(wheel[j]//axle[i] > gear_ratio):\n gear_ratio = wheel[j]//axle[i]\n num_max = 1\n elif(wheel[j]//axle[i] == gear_ratio):\n num_max += 1\n j -= 1\n i = 0\n elif(wheel[j] < axle[i] or i == n-1):\n j -= 1\n i = 0\n else:\n i += 1\n\nprint(num_max)\n \t \t \t\t \t \t\t \t\t \t\t", "def bicycle(n, a, m, b):\r\n maxi = -1\r\n for i in range(n):\r\n for j in range(m):\r\n ratio = b[j]/a[i]\r\n if(ratio==int(ratio)):\r\n maxi = max(maxi, ratio)\r\n count = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if (b[j]/a[i])==maxi:\r\n count+=1\r\n return count\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\nprint(bicycle(n, a, m, b))", "inp=lambda:map(int,input().split())\nn = int(input())\na = list(inp())\nm = int(input())\nb = list(inp())\n\nmaxm = 0\nl=[]\n\nfor i in range(m):\n for j in range(n):\n if b[i]/a[j] - b[i]//a[j] == 0:\n maxm = max(maxm, int(b[i]/a[j]))\n l.append(int(b[i]/a[j]))\n\nprint(l.count(maxm))\n\t \t\t\t \t\t\t\t \t \t\t\t \t \t \t", "#ashu@gate22\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nmxr=0\r\nno=0\r\nfor i in b:\r\n for j in a:\r\n if i%j==0:\r\n if mxr<i/j:\r\n mxr=i/j\r\n no=1\r\n elif mxr==i/j:\r\n no+=1\r\nprint(no)", "n = int(input())\r\ni = list(input().split())\r\nm = int(input())\r\nj = list(input().split())\r\n\r\nma = []\r\nfor k in j:\r\n for o in i:\r\n if int(k) % int(o) == 0:\r\n ma.append(int(k)//int(o))\r\nprint(ma.count(max(ma, default=0)))\r\n\r\n", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\nm = int(input())\r\npor = list(map(int, input().split()))\r\nblu = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if por[j] % moo[i] == 0:\r\n blu.append(por[j] / moo[i])\r\nprint(blu.count(max(blu)))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=int(input())\r\nb=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(0,len(b)):\r\n for j in range(0,len(a)):\r\n if((b[i]%a[j])==0):\r\n l.append(b[i]//a[j])\r\nprint(l.count(max(l))) \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nlist = []\r\n\r\nfor i in range(n):\r\n for j in range(m): \r\n if (b[j] / a[i]).is_integer():\r\n list.append(b[j] / a[i])\r\n\r\nprint(sum(i == max(list) for i in list))", "m=int(input())\r\nlstm=[int(x) for x in input().split()]\r\nn=int(input())\r\nlstn=[int(x) for x in input().split()]\r\nlst=[]\r\nfor i in lstm:\r\n for j in lstn:\r\n if j%i==0:lst.append(j//i)\r\nprint(lst.count(max(lst)))\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nm=int(input())\r\nli1=list(map(int,input().split()))\r\nli2=[]\r\nfor i in li1:\r\n for j in li:\r\n if (i/j)==int(i/j):\r\n li2.append(int(i/j))\r\nli2=sorted(li2,reverse=True)\r\nprint(li2.count(li2[0]))\r\n", "m = int(input())\r\na = list(map(int, input().split()))\r\nn = int(input())\r\nb = list(map(int, input().split()))\r\nl = []\r\nfor i in a:\r\n for j in b:\r\n if j%i == 0:\r\n l.append(j//i)\r\nm = max(l)\r\nprint(l.count(m))", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n b = list(map(int, input().split()))\r\n res = []\r\n for i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n res.append(b[j] // a[i])\r\n print(res.count(max(res)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from math import ceil\r\nn1 = int(input())\r\nl1 = list(map(int,input().split()))\r\nl1.sort()\r\nn2 = int(input())\r\nl2 = list(map(int,input().split()))\r\nl2.sort()\r\nd = {}\r\nz = float(\"-inf\")\r\nfor i in l1:\r\n\tfor j in l2:\r\n\t\tif ceil(j/i) == j//i:\r\n\t\t\tz = j//i\r\n\t\t\tif z in d:\r\n\t\t\t\td[z] = d[z] + 1\r\n\t\t\telse:\r\n\t\t\t\td[z] = 1\r\nprint(d[max(d)])\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nc = int(input())\r\nd= list(map(int, input().split()))\r\n\r\ne = [0]\r\n\r\nfor i in range(c):\r\n for j in range(a):\r\n\r\n if d[i] % b[j] == 0 and d[i]//b[j] >= max(e):\r\n e.append(d[i]//b[j])\r\n\r\nf= e.count(max(e))\r\nprint(f)", "import math\r\nm = int(input())\r\nl1 = list(map(int,input().split()))\r\nn = int(input())\r\nl2 = list(map(int,input().split()))\r\nx = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n z = l2[i]/l1[j]\r\n if(z==math.ceil(z)):\r\n x.append(z)\r\n\r\nt = max(x)\r\n\r\ncount = 0\r\nfor i in x:\r\n if(i == t):\r\n count+=1\r\nprint(count)", "max_1=0\r\ncount=0\r\nn=int(input())\r\nlist1=list(map(int,input().split()))\r\nm=int(input())\r\nlist2=list(map(int,input().split()))\r\nfor i in list1:\r\n\tfor j in list2:\r\n\t\tif(j%i==0):\r\n\t\t\tmax_1=max(max_1,j/i)\r\nfor i in list1:\r\n\tfor j in list2:\r\n\t\tif(j/i==max_1):\r\n\t\t\tcount+=1\r\nprint(count)", "n=int(input())\r\na=input()\r\na=a.split(\" \")\r\na=[int(x) for x in a]\r\na=tuple(a)\r\nm=int(input())\r\nb=input()\r\nb=b.split(\" \")\r\nb=[int(y) for y in b]\r\nb=tuple(b)\r\ni=0\r\nl1=[]\r\nwhile i<n:\r\n j=0\r\n while j<m:\r\n if (b[j]/a[i])%1==0:\r\n l1.append(b[j]/a[i])\r\n j=j+1\r\n i=i+1\r\nl1.sort()\r\nk=0\r\nsum=0\r\nwhile k<len(l1):\r\n if l1[k]==l1[len(l1)-1]:\r\n sum=sum+1\r\n k=k+1\r\nprint(sum)", "n = int(input())\npedal_axle = list(int(num) for num in input().strip().split())[:n]\nm = int(input())\nrear_axle = list(int(num) for num in input().strip().split())[:m]\n\nmaximum = 0\nnumber_of_maximums = 0\nfor b in rear_axle:\n for a in pedal_axle:\n if b % a == 0 and b/a > maximum:\n maximum = b/a\n number_of_maximums = 1\n elif b % a == 0 and b/a == maximum:\n number_of_maximums += 1\nprint(number_of_maximums)\n\t \t \t\t\t\t\t \t \t \t\t \t", "n=int(input())\r\npedal=list(map(int,input().split()))\r\nm=int(input())\r\nrearwheel=list(map(int,input().split()))\r\n\r\nalist=[]\r\nfor i in pedal:\r\n for j in rearwheel:\r\n if j%i==0:\r\n alist.append(j//i)\r\n\r\nalist.sort()\r\nprint(alist.count(alist[-1]))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nmaxi = 0\r\nr = []\r\nfor j in range(m):\r\n for i in range(n):\r\n if b[j]%a[i] == 0:\r\n maxi = max(maxi,b[j]//a[i])\r\n if maxi == b[j]//a[i]:\r\n r.append(maxi)\r\nprint(r.count(maxi))\r\n \r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=int(input())\r\nb=list(map(int,input().split()))\r\np=[]\r\nfor i in range(l-1,-1,-1):\r\n for j in range(n):\r\n if(b[i]/a[j]==b[i]//a[j]):\r\n p.append(b[i]//a[j])\r\nprint(p.count(max(p)))", " \r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(m):\r\n for j in range(n):\r\n if a[j]<=b[i]:\r\n if b[i]/a[j]==int(b[i]/a[j]):\r\n ans.append(b[i]/a[j])\r\nma=max(ans)\r\nprint(ans.count(ma))", "lst = [w.rstrip() for w in open(0).readlines()]\r\na = list(map(int, lst[1].split()))\r\nb = list(map(int, lst[3].split()))\r\nmaxi, aant = 0, 0\r\nfor ai in a:\r\n for bi in b:\r\n if bi % ai == 0:\r\n f = bi // ai\r\n if f == maxi: aant += 1\r\n elif f > maxi: maxi, aant = f, 1\r\nprint(aant)\r\n", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\nn=int(input());L1=list(map(int,input().split()))\r\nm=int(input());L2=list(map(int,input().split()))\r\n\r\ncnt=0\r\nm=0\r\nfor j in L1:\r\n for i in L2:\r\n if i%j==0:\r\n k=i//j\r\n if k==m:\r\n cnt+=1\r\n elif k>m:\r\n cnt=1\r\n m=k\r\nprint(cnt)\r\n\r\n \r\n\r\n#carpe diem \r\n#carpe diem", "n=int(input())\r\nl1=list(map(int, input().split()))\r\nm=int(input())\r\nl2=list(map(int, input().split()))\r\nrat=0\r\nfor i in range(m):\r\n for j in range(n):\r\n if(l2[i]%l1[j]==0):\r\n rat=max(rat,l2[i]/l1[j])\r\n\r\n\r\n\r\nc=0\r\nfor i in range(m):\r\n for j in range(n):\r\n if(l2[i]/l1[j]==rat):\r\n c+=1\r\nprint(c) ", "import itertools as it\r\nn=int(input())\r\npedal=list(map(int,input().split()))\r\nm=int(input())\r\naxel=list(map(int,input().split()))\r\ncount=0\r\nratio_list=[j/i for (i,j) in list(it.product(pedal,axel)) if j%i==0]\r\nmax_ratio=max(ratio_list)\r\nfor ratio in ratio_list:\r\n if ratio==max_ratio:\r\n count+=1\r\nprint(count)", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\np=list(map(int,input().split()))\r\nmax=0\r\nc=0\r\nfor i in l:\r\n for j in p:\r\n if math.ceil(j/i)-(j/i)==0:\r\n if max<int(j/i):\r\n max=int(j/i)\r\n c=1\r\n elif max==int(j/i):\r\n c+=1\r\nprint(c)", "n = int(input())\r\nai = list(map(int,input().split()))\r\nm = int(input())\r\nbi = list(map(int,input().split()))\r\nans = [bi[j]//ai[i]*int(bi[j]%ai[i] == 0) for i in range(n) for j in range(m)]\r\ntemp = max(ans)\r\nans2 = [temp == ans[i] for i in range(n*m)]\r\nprint(sum(ans2))\r\n", "n= int(input())\r\na= list(map(int, input().split()))\r\nm= int(input())\r\nb= list(map(int, input().split()))\r\nl=[]\r\nfor j in b:\r\n for i in a:\r\n if not j%i:\r\n l.append(j//i)\r\nprint(l.count(max(l)))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\nc=0\r\nrmax=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(b[j]%a[i]==0 and b[j]//a[i]>rmax):\r\n rmax=b[j]//a[i]\r\n c=1\r\n elif(b[j]%a[i]==0 and b[j]//a[i]==rmax):\r\n c+=1\r\nprint(c)", "n = int(input())\r\nFrontAxle = [int(x) for x in input().split(' ')]\r\n\r\nm = int(input())\r\nRearAxle = [int(x) for x in input().split(' ')]\r\nbestRatio=0\r\nacc=0\r\nfor f in FrontAxle:\r\n for r in RearAxle:\r\n ratio=r/f\r\n if(ratio.is_integer() and ratio>bestRatio):\r\n bestRatio=ratio\r\n acc=1\r\n elif(ratio.is_integer() and ratio==bestRatio):\r\n acc+=1\r\n\r\nprint(acc)", "# https://codeforces.com/problemset/problem/215/A\n\nna = int(input())\ngearA = [int(num) for num in input().split()]\n\nnb = int(input())\ngearB = [int(num) for num in input().split()]\n\n\nmax = -1\nmaxCount = 0\nfor gA in gearA:\n for gB in gearB:\n if gB%gA==0:\n # print(\"duv\", gB, gA, max)\n div = gB/gA\n if max < div:\n max = div\n maxCount = 1\n elif max == div:\n maxCount += 1\n \n\nprint(maxCount)", "# 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#############################################\na = input()\na = gint_arr()\nb = input()\nb = gint_arr()\nmx = -INF\ncnt_mx = 0\n\nfor n in b:\n for m in a:\n if m > n:\n break\n if n % m == 0:\n if n / m > mx:\n mx = n / m\n cnt_mx = 1\n elif n / m == mx:\n cnt_mx += 1\n\nprint(cnt_mx)\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\nm = int(sys.stdin.readline())\r\nbm = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvmax = 0\r\nres = 0\r\nfor i in an:\r\n vv = 0\r\n for j in bm:\r\n if(j % i == 0):\r\n if(int(j / i) > vv):\r\n vv = int(j / i)\r\n if(vmax == vv):\r\n res += 1\r\n elif(vv > vmax):\r\n vmax = vv\r\n res = 1\r\n \r\nprint(res)\r\n ", "input()\r\nlow = [int(x) for x in input().split()]\r\ninput()\r\nhigh = [int(x) for x in input().split()]\r\nres = []\r\nfor i in reversed(high):\r\n for j in low:\r\n if i%j == 0:\r\n res.append(i/j)\r\nprint(res.count(max(res)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nres=[]\r\nfor i,vb in enumerate(b):\r\n for j,va in enumerate(a):\r\n if vb%va==0:\r\n res.append(vb//va)\r\nprint(res.count(max(res)))\r\n", "n = int(input())\r\na = input().split()\r\nm = int(input())\r\nb = input().split()\r\nanswer = list()\r\nfor i in range(n):\r\n for j in range(m):\r\n thing = float(b[j])/float(a[i])\r\n if thing.is_integer():\r\n answer.append(thing)\r\nan = max(answer)\r\nprint(answer.count(an), end=\"\\n\")\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nm=int(input())\r\nlist2=list(map(int,input().split()))\r\nmax1=0\r\nfor i in list2:\r\n for j in list1:\r\n if i%j==0 and (i//j)>max1:\r\n max1=(i//j)\r\nc=0 \r\nfor i in list2:\r\n for j in list1:\r\n if i%j==0 and i//j==max1:\r\n c=c+1\r\nprint(c) ", "n = int(input())\r\npedal = list(map(int, input().split()))\r\nm = int(input())\r\nrear = list(map(int, input().split()))\r\n\r\nmaxratio = 0\r\ncount = 0\r\n\r\nfor j in range(m):\r\n for i in range(n):\r\n if rear[j]/pedal[i] > maxratio and rear[j]/pedal[i] == int(rear[j]/pedal[i]):\r\n maxratio = rear[j]/pedal[i]\r\n count = 1\r\n elif rear[j]/pedal[i] == maxratio:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=int(input())\r\nb=[int(i) for i in input().split()]\r\nma=0\r\nans=0\r\nfor i in range(m):\r\n for j in range(n):\r\n if int(b[i]/a[j])==b[i]/a[j] and ma<b[i]/a[j]:\r\n ma=int(b[i]/a[j])\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if ma==b[i]/a[j]:\r\n ans+=1\r\nprint(ans)\r\n \r\n", "def bicycle_chain(s1,s2):\r\n count=0\r\n l=[]\r\n for i in s2:\r\n for j in s1:\r\n if(i%j==0):\r\n l.append(i//j)\r\n max_ratio=max(l)\r\n for k in l:\r\n if(k==max_ratio):\r\n count=count+1\r\n return(count)\r\n \r\n\r\nn=int(input())\r\nstars_pedal=list(map(int,input().split()))\r\n\r\nm=int(input())\r\nstars_rear=list(map(int,input().split()))\r\n\r\nresult=bicycle_chain(stars_pedal,stars_rear)\r\nprint(result)\r\n", "t=int(input())\r\na=list(map(int,input().split(\" \")))\r\nm=int(input())\r\nb=list(map(int,input().split(\" \")))\r\nc=[]\r\nfor x in b:\r\n for y in a:\r\n if x%y==0:\r\n c.append(x//y)\r\nprint(c.count(max(c)))", "n = int(input())\nspikes1 = [int(x) for x in input().split(' ')]\nm = int(input())\nspikes2 = [int(x) for x in input().split(' ')]\n\nfrom collections import defaultdict\nd = defaultdict(int)\nmax_ratio = 0\nfor i in range(m-1, -1, -1):\n\tfor j in range(n):\n\t\tif spikes2[i] % spikes1[j] == 0:\n\t\t\tratio = spikes2[i] / spikes1[j]\n\t\t\tif ratio > max_ratio:\n\t\t\t\tmax_ratio = ratio\n\t\t\td[ratio] += 1\n\nprint(d[max_ratio])", "n=int(input())\r\nnl=list(map(int,input().split()))\r\nm=int(input())\r\nml=list(map(int,input().split()))\r\nl=[]\r\nans=-32\r\nfor i in range(m):\r\n for j in range(n):\r\n temp=ml[i]/nl[j]\r\n if temp.is_integer():\r\n l.append(temp)\r\nprint(l.count(max(l)))", "n=int(input())\r\ns= input().split()\r\na=[int(e) for e in s]\r\nm=int(input())\r\ns=input().split()\r\nb=[int(e) for e in s]\r\ngears=[]\r\nratio=[]\r\nfor i in a :\r\n for j in b :\r\n if(j%i==0):\r\n ratio.append(j/i)\r\n\r\nmaximum=max(ratio)\r\nindices=[i for i in ratio if i==maximum]\r\nprint (len(indices))\r\n \r\n ", "n = int(input())\na = [int (i) for i in input().split(' ')]\nm = int(input())\nb = [int (i) for i in input().split(' ')]\nmaxi = 0\nbSobreA = []\nfor i in range (n):\n for j in range (m):\n div = b[j]/a[i]\n bSobreA.append([div, a[i], b[j]])\n if (div > maxi and div.is_integer()):\n maxi = div\n\nsaida = [i[0] for i in bSobreA if (i[0].is_integer())]\nsaida = list(filter(lambda x: x == maxi, saida))\n# print(maxi)\n# print(bSobreA)\n# print(saida)\nprint(len(saida))\n\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\n\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nmx = -10000\r\n\r\nfor i in a:\r\n for j in b:\r\n if j // i == j / i:\r\n mx = max(mx, j//i)\r\n \r\nl = 0\r\n\r\nfor i in a:\r\n for j in b:\r\n if j // i == j / i:\r\n if j // i == mx:\r\n l += 1\r\n\r\nprint(l)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nresult = list()\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif b[i]%a[j]==0:\r\n\t\t\tresult.append(b[i]//a[j])\r\nprint(result.count(max(result)))", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nt = 0\r\nfor elem in a:\r\n for elek in b:\r\n if elek // elem > t and elek % elem == 0:\r\n t = elek // elem\r\n\r\nc = 0\r\nfor elem in a:\r\n for elek in b:\r\n if elek // elem == t and elek % elem == 0:\r\n c += 1\r\n\r\nprint(c)\r\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\nm=int(input())\r\nB=list(map(int,input().split()))\r\nr=[]\r\ncnt=0\r\nfor i in range(m):\r\n for j in range(n):\r\n if B[i]%A[j]==0:\r\n r.append(B[i]/A[j])\r\nm=(int(max(r)))\r\nfor w in r:\r\n if w==m:\r\n cnt+=1 \r\nprint(cnt)", "from collections import defaultdict\r\nn1=int(input())\r\na=list(map(int,input().split()))\r\nn2=int(input())\r\nb=list(map(int,input().split()))\r\ni=0\r\nj=n2-1\r\nm=0\r\nm_ele=0\r\nd=defaultdict(int)\r\nfor i in a:\r\n for j in b:\r\n if(j%i==0):\r\n div=int(j//i)\r\n #print(div)\r\n d[div]+=1\r\n if(div>=m):\r\n m=div\r\n m_ele=d[div]\r\n#print(d)\r\nprint(m_ele)\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nln=list(map(int,input().split()))\r\nm=int(input())\r\nlm=list(map(int,input().split()))\r\ng=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n gr=lm[j]/ln[i]\r\n if gr==int(gr):\r\n g.append(gr)\r\nprint(g.count(max(g)))", "n=int(input())\r\na= list(map(int, input().split()))\r\nm=int(input())\r\nb= list(map(int, input().split()))\r\ndef fn1(a,b):\r\n m=0\r\n count=0\r\n for i in b:\r\n for j in a:\r\n if i%j==0 and i//j>m:m=i//j\r\n for i in b:\r\n for j in a:\r\n if i//j==m and i%j==0:count+=1\r\n return count\r\nprint(fn1(a,b))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 9 00:42:34 2023\r\n\r\n@author: risha\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\ng=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j]%a[i]==0:\r\n g.append(b[j]/a[i])\r\nprint(g.count(max(g)))", "pedal = int(input())\na = list(map(int, input().split()))\nwheel = int(input())\nb = list(map(int, input().split()))\nratio = []\nmx = 0\nfor aj in a:\n for bj in b:\n if bj%aj == 0:\n ratio.append(bj//aj)\n if ratio[-1]>mx:\n mx = ratio[-1]\nprint(ratio.count(mx))", "def peredacha(a, b):\r\n count, result = 0, 0\r\n for j in range(len(b)):\r\n for i in range(len(a)):\r\n if b[j] % a[i] == 0:\r\n if b[j] // a[i] > count:\r\n count = b[j] // a[i]\r\n break\r\n for i in range(len(a)):\r\n for j in range(len(b)):\r\n if a[i] * count == b[j]:\r\n result += 1\r\n break\r\n return result\r\n\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nm = int(input())\r\nB = [int(y) for y in input().split()]\r\nprint(peredacha(A, B))\r\n", "g=[]\r\nn=int(input())\r\nx=[int(x) for x in input().split()]\r\nm=int(input())\r\ny=[int(y) for y in input().split()]\r\nfor i in range(m):\r\n for j in range(n):\r\n if y[i]%x[j]==0:\r\n g.append(y[i]//x[j])\r\nma=max(g)\r\nprint(g.count(ma))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\nl = [j // i for j in b for i in a if not j % i]\r\nprint(l.count(max(l)))", "from fractions import Fraction\nC=1\n\ndef main():\n n = int(input())\n aa = list(map(int, input().split()))\n m = int(input())\n bb = list(map(int, input().split()))\n l = [Fraction(b, a) for b in bb for a in aa]\n l.sort()\n while l[-1].denominator != 1:\n del l[-1]\n x, cnt = l.pop(), 1\n while l and l[-1] == x:\n del l[-1]\n cnt += 1\n print(cnt)\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\n\r\n\r\nn=int(input())\r\nl1=[int(i) for i in input().split()]\r\nm=int(input())\r\nl2=[int(j) for j in input().split()]\r\nl3=[]\r\nfor x in range(m):\r\n for y in range(n):\r\n k=l2[x]/l1[y]\r\n if k-math.floor(k)==0:\r\n l3.append(k)\r\na=max(l3)\r\nprint(l3.count(a))", "from sys import stdin\r\nimport math\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\n\r\nread()\r\na = list(read())\r\nread()\r\nb = list(read())\r\n\r\nmagic = [ x // y for x in b for y in a if x % y == 0 ]\r\n\r\nprint(magic.count ( max(magic) ) )\r\n", "num_pedal_axle_stars = int(input())\r\nnum_pedal_axle_stars_teeth = list(map(int, input().split()))\r\nnum_rear_wheel_axle_stars = int(input())\r\nnum_rear_wheel_axle_stars_teeth = list(map(int, input().split()))\r\nmax_int = 0\r\nnum_max_int = 0\r\nfor rear_teeth in num_rear_wheel_axle_stars_teeth:\r\n for pedal_teeth in num_pedal_axle_stars_teeth:\r\n if rear_teeth%pedal_teeth == 0:\r\n candidate = rear_teeth/pedal_teeth\r\n if candidate > max_int:\r\n max_int = candidate\r\n num_max_int = 1\r\n elif candidate == max_int:\r\n num_max_int += 1\r\nprint(num_max_int)\r\n", "n=int(input())\r\na= input().split()\r\na= [int(i) for i in a]\r\n\r\nm=int(input())\r\nb=input().split()\r\nb= [int(i) for i in b]\r\n\r\nx=[]\r\nfor i in a:\r\n for j in b:\r\n if (j/i).is_integer():\r\n x.append(j/i)\r\nx.sort()\r\nprint(x.count(x[-1]))", "#A. Bicycle Chain\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nt = 0\r\nmax_ = 0\r\nfor i in a:\r\n for j in b:\r\n if j%i==0:\r\n if j//i > max_:\r\n t = 1\r\n max_ = j//i\r\n elif j//i == max_:\r\n t += 1\r\nprint(t)", "from collections import defaultdict\nimport decimal\nn = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\n# ans = decimal.Decimal(nu)/decimal.Decimal(de)\nma = 0\nd = defaultdict(int)\nfor i in range(n):\n for j in range(m):\n if b[j] % a[i] == 0:\n ma = max(ma, b[j]/a[i])\n d[b[j]/a[i]] += 1\n# print(dict(d))\n# m = max(d.values())\n# print(int(m))\n# for i in d:\n# if d[i] == m:\n# print(i)\n# # break\n# print(max(d.keys()))\nprint(d[ma])\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\nlst=[]\r\nfor i in a:\r\n for j in b:\r\n if j%i==0:\r\n lst.append(j//i)\r\nprint(lst.count(max(lst)))", "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(len(a)):\r\n for j in range(len(b)):\r\n if b[j]%a[i]==0:\r\n c.append(b[j]//a[i])\r\nprint(c.count(max(c)))\r\n\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=list(map(int,input().split()))\r\nm=iinput()\r\nb=list(map(int,input().split()))\r\nk=[]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n l = b[j]/a[i]\r\n\r\n if l%1==0:\r\n k.append(l)\r\n\r\nl=max(k)\r\nc=k.count(l)\r\nprint(c)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nmaxNumCnt = 1\r\nmaxNum = -1\r\nfor i in b:\r\n for j in a:\r\n if i % j == 0:\r\n if maxNum < i // j:\r\n maxNum = i // j\r\n maxNumCnt = 1\r\n elif maxNum == i // j:\r\n maxNumCnt += 1\r\nprint(maxNumCnt)\r\n", "n = int(input())\nnlst = list(map(int,input().split()))\nm = int(input())\nmlst = list(map(int,input().split()))\n\nmaxRatio = 0\nfor j in mlst:\n for i in nlst:\n if j%i == 0 and j//i >maxRatio :\n maxRatio = j//i\ncount =0 \nfor j in mlst:\n for i in nlst:\n if j%i ==0 and j//i == maxRatio:\n count+=1\nprint(count)\n \n \n", "import sys\r\nn = int(input())\r\nf = list(map(int, input().split()))\r\nt = int(input())\r\nr = list(map(int, input().split()))\r\np = []\r\nc = 0\r\nfor i in r:\r\n for j in f:\r\n if i / j == int(i / j):\r\n p.append(max((c, i //j)))\r\ng = max(p)\r\nprint(p.count(g))", "n=int(input())\r\na=list(map(int, input().split()))[:n]\r\nm=int(input())\r\nb=list(map(int, input().split()))[:m]\r\nl=[]\r\nx=[]\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n p=b[j]%a[i]\r\n if p==0 and b[j] not in l:\r\n x.append(int(b[j]/a[i]))\r\n l.append(b[j])\r\nprint(x.count(max(x)))\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. Bicycle Chain\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\t\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=int(input())\r\nb=list(map(int,input().split()))\r\nl=[]\r\nfor i in b:\r\n for j in a:\r\n if i%j==0:\r\n l.append(i//j)\r\nprint(l.count(max(l)))", "a = int(input())\r\na_string = input().split(' ')\r\nb = int(input())\r\nb_string = input().split(' ')\r\nmx = 0\r\n\r\nfor i in range(a):\r\n a_string[i] = int(a_string[i])\r\n \r\nfor i in range(b):\r\n b_string[i] = int(b_string[i])\r\n\r\nfor i in range(a):\r\n for j in range(b):\r\n if b_string[j]%a_string[i] == 0:\r\n if b_string[j]/a_string[i] > mx:\r\n mx = b_string[j]/a_string[i]\r\n\r\nans = 0\r\nfor i in range(a):\r\n for j in range(b):\r\n if b_string[j]/a_string[i] == mx:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "input()\r\na=list(map(int, input().split()))\r\na.sort()\r\ninput()\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\nm=0\r\nc=1\r\nfor j in a:\r\n\tfor k in b:\r\n\t\tif k%j==0:\r\n\t\t\tx=k//j\r\n\t\t\tif m==x:\r\n\t\t\t\tc+=1\r\n\t\t\telif x>m:\r\n\t\t\t\tm=x\r\n\t\t\t\tc=1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\nprint(c)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=int(input())\r\nb=[int(j) for j in input().split()]\r\nm=0\r\ngr=0\r\nl=[]\r\nfor i in a:\r\n for j in b:\r\n #print(\"i is\",i)\r\n #print(\"j is\",j)\r\n gr=j/i\r\n #print(\"gr is\",gr)\r\n if gr.is_integer():\r\n #means it is an integer\r\n #100.0 is integer\r\n if gr>=m:\r\n m=gr\r\n l.append(gr)\r\nprint(l.count(m))\r\n#print(\"max gr is\",m)\r\n \r\n\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nif(1 in a):\r\n print(b.count(max(b)))\r\nelse:\r\n q=[0]*m\r\n for i in range(m):\r\n for j in range(n):\r\n if(b[i]%a[j]==0 and b[i]//a[j]>q[i]):\r\n q[i]=b[i]//a[j]\r\n print(q.count(max(q)))", "n = int(input())\r\nli = list(map(int,input().split()))[:n]\r\nm = int(input())\r\nli2 = list(map(int,input().split()))[:m]\r\ncount = 0\r\nl = []\r\nfor i in range(len(li2)):\r\n for j in range(len(li)):\r\n if li2[i]%li[j]==0:\r\n l.append(li2[i]/li[j])\r\n\r\nm = max(l)\r\ncount=0\r\nfor i in li:\r\n if (i*m) in li2:\r\n count+=1\r\n\r\nprint(count)", "n=int(input())\r\npedal=[int(i) for i in input().split()]\r\nm=int(input())\r\nrear=[int(i) for i in input().split()]\r\n\r\nmaximum=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if rear[j]%pedal[i]==0:\r\n if rear[j]//pedal[i]>maximum:\r\n maximum=rear[j]//pedal[i]\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if rear[j]%pedal[i]==0:\r\n if rear[j]//pedal[i]==maximum:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\ncnt = 0\r\nmx = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n val = b[j] // a[i]\r\n if val > mx:\r\n mx = val\r\n cnt = 1\r\n elif val == mx:\r\n cnt += 1\r\nprint(cnt)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nl = -1\r\nc = 0\r\nfor x in a:\r\n for y in b:\r\n if y%x == 0:\r\n if y/x > l:\r\n c = 1\r\n l = y/x\r\n elif y/x == l:\r\n c += 1\r\n\r\nprint(c)", "n=int(input())\r\nl2=[int(x) for x in input().split()]\r\nm=int(input())\r\nl1=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(m):\r\n for j in range(n):\r\n if(l1[i]%l2[j]==0):\r\n key=l1[i]/l2[j]\r\n if key in d :\r\n d[key]+=1\r\n else:\r\n d.update({key:1})\r\nl=list(d.items())\r\nl.sort(reverse=True)\r\nprint(d[l[0][0]])", "n = int(input())\r\npedalAxes = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nrearAxle = list(map(int, input().split()))\r\n\r\nmax_ratio = 0\r\nmax_count = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n a = pedalAxes[i]\r\n b = rearAxle[j]\r\n if b % a != 0:\r\n continue\r\n\r\n ratio = b/a\r\n\r\n if ratio == max_ratio:\r\n max_count += 1\r\n elif ratio > max_ratio:\r\n max_ratio = ratio\r\n max_count = 1\r\n\r\nprint(max_count)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nd={}\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if((b[j]/a[i])%1==0):\r\n if b[j]/a[i] not in d:\r\n d[b[j]/a[i]]=1\r\n else:\r\n d[b[j]/a[i]]+=1\r\nk =-999999\r\nfor i in d:\r\n k = max(i,k)\r\nprint(d[k])\r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\ncount=0\r\nMAX=0\r\nfor i in range(0,n):\r\n for j in range(m-1,-1,-1):\r\n if b[j]%a[i]==0:\r\n if b[j]//a[i]>MAX:\r\n MAX=b[j]//a[i]\r\n count=1\r\n elif b[j]//a[i]==MAX:\r\n count+=1\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nk=0\r\nc=[]\r\nmax=0\r\np=0\r\nfor i in range(n):\r\n l=0\r\n for j in range(k,m):\r\n if int(b[j]/a[i])==b[j]/a[i]:\r\n l=1\r\n if b[j]/a[i]>=max:\r\n max=b[j]/a[i]\r\n c.append(max)\r\n p=j\r\n k=p\r\ni=len(c)-1\r\nt=1\r\nwhile(i>=1):\r\n if c[i]!=c[i-1]:\r\n break\r\n else:\r\n i+=-1\r\n t+=1\r\nprint(t)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\ngears = {}\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n ratio = b[j] // a[i]\r\n gears[ratio] = gears.get(ratio, 0) + 1\r\nprint(gears[max(gears.keys())])", "n = int(input())\na = sorted([int(x) for x in input().split()])\nm = int(input())\nb = sorted([int(x) for x in input().split()])\nmaxRes = 0\nans = 0\nfor x in a:\n\tfor y in b:\n\t\tif y % x == 0:\n\t\t\tcur = y // x\n\t\t\tif cur > maxRes:\n\t\t\t\tmaxRes = cur\n\t\t\t\tans = 0\n\t\t\tif cur == maxRes:\n\t\t\t\tans += 1\nprint(ans)\n", "lst=[]\r\nz=int(input())\r\nx=list(map(int,input().split()))\r\nc=int(input())\r\nv=list(map(int,input().split()))\r\nfor i in v:\r\n for j in x:\r\n if i%j==0:\r\n lst.append(i//j)\r\nprint(lst.count(max(lst)))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ninput()\r\nl1=list(map(int,input().split()))\r\nd={}\r\nfor x in l :\r\n for x1 in l1 :\r\n if int(x1/x)-x1/x==0 :\r\n d[x1/x]=d.get(x1/x,0)+1\r\nprint(d[max(d)])\r\n \r\n", "def Bicycle_Chain():\r\n stars_pedal = int(input())\r\n gears_pedal = input().split(' ')\r\n gears_pedal = [eval(i) for i in gears_pedal]\r\n stars_rear = int(input())\r\n gears_rear = input().split(' ')\r\n gears_rear = [eval(i) for i in gears_rear]\r\n\r\n\r\n max_ratio = -1\r\n count = -1\r\n for i in gears_rear:\r\n for j in gears_pedal:\r\n if i % j == 0:\r\n if (i/j) > max_ratio:\r\n max_ratio = (i/j)\r\n count = 1\r\n elif (i/j) == max_ratio:\r\n count += 1\r\n\r\n print(count)\r\n\r\nBicycle_Chain()", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nmaxratio = -float('inf')\r\ncount =1\r\nfor x in b:\r\n for y in a:\r\n if x%y==0:\r\n if x//y==maxratio:\r\n count+=1\r\n elif x//y>maxratio:\r\n maxratio = x//y\r\n count = 1\r\nprint(count)\r\n\r\n ", "input()\r\na= list(map(int, input().split()))\r\ninput()\r\nb= list(map(int, input().split()))\r\ncounter= 0\r\nmax= 0\r\n\r\nfor i in b:\r\n for j in a:\r\n if i%j== 0 and i/j>= max:\r\n if i/j== max:\r\n counter+= 1\r\n else:\r\n counter= 1\r\n max= i/j\r\n\r\nprint(counter)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nans=[]\r\nfor x in a:\r\n for y in b:\r\n if y%x==0:\r\n ans.append(y//x)\r\nprint(ans.count(max(ans)))", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nm=int(input())\r\nb=list(map(int,input().split(\" \")))\r\nm=-1\r\nl=[]\r\nfor i in b:\r\n for j in a:\r\n if(i%j==0):\r\n if(m<=i//j):\r\n m=i//j\r\n l.append(m)\r\n\r\nc=l.count(m)\r\nprint(c)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nc = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if b[j] % a[i] == 0:\r\n c.append(b[j] // a[i])\r\nc.sort(reverse=True)\r\nprint(c.count(c[0]))", "I=lambda:map(int,input().split())\r\ninput()\r\na=*I(),\r\ninput()\r\nb=*I(),\r\nd={}\r\nfor x in a:\r\n for y in b:\r\n if y%x<1:\r\n if y//x not in d:d[y//x]=1\r\n else:d[y//x]+=1\r\nprint(d[max(d.keys())])", "n = int(input())\r\nfrontteeth = [int(item) for item in input().split()]\r\nm = int(input())\r\nrearteeth = [int(item) for item in input().split()]\r\ngears = []\r\nfor item in rearteeth:\r\n for teeth in frontteeth:\r\n if item/teeth==int(item/teeth):\r\n gears.append(item/teeth)\r\nprint(gears.count(max(gears)))\r\n", "n = int(input())\r\nls1 = list(map(int, input().split(\" \")))\r\nm = int(input())\r\nls2 = list(map(int, input().split(\" \")))\r\n\r\ng_r = 1\r\nc = 0\r\n\r\n\r\nfor ls1_i in ls1:\r\n for ls2_i in ls2:\r\n if ls2_i/ls1_i == g_r:\r\n c += 1\r\n elif ls2_i/ls1_i == ls2_i//ls1_i:\r\n if ls2_i/ls1_i > g_r:\r\n g_r = ls2_i/ls1_i\r\n c = 1\r\n\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nmax = 0\r\nans = []\r\nfor i in range(m):\r\n for j in range(n):\r\n if b[i] % a[j] == 0 and b[i] // a[j] >= max:\r\n max = b[i] // a[j]\r\n ans.append(b[i] // a[j])\r\nprint(ans.count(max))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = int(input())\r\nlt = list(map(int,input().split()))\r\nd = {}\r\nres = 0\r\nmx = -10000\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n a = lt[j]/l[i]\r\n if a == int(a):\r\n a = int(a)\r\n if a in d:\r\n d[a]+=1\r\n else:\r\n d[a] = 1\r\n\r\nmx = max(list(d.keys()))\r\n\r\nprint(d[mx])\r\n\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nmaxi = 0\r\nfor i in range(m):\r\n for j in range(n):\r\n val = b[i]/a[j]\r\n if int(str(val).split('.')[1])==0:\r\n if maxi<val:\r\n maxi = val\r\ncount = 0\r\nfor i in range(m):\r\n for j in range(n):\r\n if maxi==b[i]/a[j]:\r\n count += 1\r\nprint(count)\r\n", "a = int(input())\narr1 = [int(x) for x in input().split()]\nb = int(input())\narr2 = [int(x) for x in input().split()]\nmax_ratio = 0\nfor i in range(len(arr1)):\n\tfor j in range(len(arr2)):\n\t\tif(arr2[j] % arr1[i] == 0 and arr2[j] // arr1[i] > max_ratio):\n\t\t\tmax_ratio = arr2[j] // arr1[i]\ncount = 0\nfor i in range(len(arr1)):\n\tfor j in range(len(arr2)):\n\t\tif(arr2[j] % arr1[i] == 0 and arr2[j] // arr1[i] == max_ratio):\n\t\t\tcount += 1\nprint(count)", "numPedalStars = int(input())\r\npedalStars = list(map(int, input().split(' ')))\r\nnumRearStars = int(input())\r\nrearStars = list(map(int, input().split(' ')))\r\nmaxRatio = 0\r\nnumMax = 0\r\n\r\nfor pedalStar in pedalStars:\r\n for rearStar in rearStars:\r\n if (rearStar / pedalStar).is_integer() and rearStar / pedalStar > maxRatio:\r\n maxRatio = rearStar / pedalStar\r\n numMax = 1\r\n elif (rearStar / pedalStar).is_integer() and rearStar / pedalStar == maxRatio:\r\n numMax += 1\r\n\r\nprint(numMax)\r\n", "n=int(input())\r\nl = list(map(int,input().split()))\r\nm = int(input())\r\nl1 = list(map(int,input().split()))\r\nans =[j//i for i in l for j in l1 if j%i == 0]\r\nprint(ans.count(max(ans)))", "n = int(input())\r\na = [int(j) for j in input().split()]\r\n\r\nm = int(input())\r\nb = [int(j) for j in input().split()]\r\n\r\n\r\nma = -1\r\nfor x in range(n):\r\n\tfor y in range(m):\r\n\t\tif b[y]/a[x] % 1 == 0 and b[y]/a[x] > ma:\r\n\t\t\tcount = 1\r\n\t\t\tma = b[y]/a[x]\r\n\r\n\t\telif b[y]/a[x] % 1 == 0 and b[y]/a[x] == ma:\r\n\t\t\tcount += 1\r\n\r\nprint(count)\r\n\r\n", "\r\n\r\nn=int(input())\r\na=[]\r\na.append([j for j in map(int,input().split())])\r\na=a[0]\r\n\r\nm=int(input())\r\nb=[]\r\nb.append([j for j in map(int,input().split())])\r\nb=b[0]\r\n\r\nval=0\r\nans=0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif b[j]%a[i]==0:\r\n\t\t\t#print(j)\r\n\t\t\tif b[j]/a[i]==ans:\r\n\t\t\t\tans=b[j]/a[i]\r\n\t\t\t\tval+=1\r\n\t\t\tif b[j]/a[i]>ans:\r\n\t\t\t\tans=b[j]/a[i]\r\n\t\t\t\tval=1\t\r\n\r\n\r\n\r\n\r\n\r\nprint(val)", "n = int(input())\narr = [int(s) for s in input().split()]\nm = int(input())\nbrr = [int(s) for s in input().split()]\nbest_ratio, best_count = 0, 0\nfor b in brr:\n\tfor a in arr:\n\t\tif b%a == 0:\n\t\t\tratio = b/a\n\t\t\tif ratio > best_ratio:\n\t\t\t\tbest_ratio = ratio\n\t\t\t\tbest_count = 1\n\t\t\telif ratio == best_ratio:\n\t\t\t\tbest_count += 1\nprint(best_count)\n", "m=int(input())\r\na=list((map(int,input().split())))\r\nn=int(input())\r\nb=list((map(int,input().split())))\r\nb.reverse()\r\nr=0\r\nmax=0\r\nfor bele in b:\r\n for ele in a:\r\n if(bele%ele==0 and (bele/ele)>max):\r\n max=bele/ele\r\n r=1\r\n break\r\n elif(bele%ele==0 and (bele/ele)==max):\r\n r+=1\r\n break\r\nprint(r)", "# benzene_ <>\r\n\r\na=int(input())\r\na_=list(map(int,input().split()))\r\nb=int(input())\r\nb_=list(map(int,input().split()))\r\n\r\nc=0\r\nm=1\r\nfor i in range(a):\r\n for j in range(b):\r\n x=b_[j]/a_[i]\r\n if m==x:\r\n c=c+1\r\n \r\n if x>m and x%1==0:\r\n c=1\r\n m=x\r\nprint(c)\r\n", "def solve(n, m, pedal_axle, wheel_axle):\r\n maximum, answer = 0, 0\r\n # The outer loop controls the value of wheel_axle\r\n for i in range(m):\r\n # The inner loop controls the value of pedal_axle\r\n for j in range(n):\r\n # This is to check whether the ratio is an integer\r\n if wheel_axle[i] % pedal_axle[j] == 0:\r\n value = wheel_axle[i] / pedal_axle[j]\r\n if value > maximum:\r\n maximum = value\r\n answer = 1\r\n elif value == maximum:\r\n answer += 1\r\n # We are breaking out of loop because the value of pedal_axle will increase as we go on\r\n # but we reached the break statement because the current wheel_axle value is not maximum\r\n # So, there is no point in calculating for this value of wheel_axle\r\n break\r\n return answer\r\n\r\ndef main():\r\n n = int(input())\r\n pedal_axle = [int(a) for a in input().strip().split()]\r\n m = int(input())\r\n wheel_axle = [int(a) for a in input().strip().split()]\r\n print(solve(n, m, pedal_axle, wheel_axle))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "if __name__== \"__main__\":\r\n n=int(input())\r\n A=(input()).split(\" \")\r\n m=int(input())\r\n B=(input()).split(\" \")\r\n lst=[]\r\n for a in A:\r\n a=int(a)\r\n for b in B:\r\n b=int(b)\r\n if b%a==0:\r\n lst.append(b//a)\r\n print(lst.count(max(lst))) ", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nd = {}\r\ntt = -10000000\r\nfor bj in b:\r\n for ai in a:\r\n if bj%ai==0:\r\n num = bj//ai\r\n if num>tt:\r\n tt = num\r\n d[num] = d.get(num,0)+1\r\n\r\nprint(d[tt])" ]

[ "def distance(x, y):\r\n return abs(x - y)\r\n\r\nn, m, y0, y1 = map(int, input().split())\r\nmouse = list(map(int, input().split()))\r\ncheeses = list(map(int, input().split()))\r\n\r\ni = 0 \r\nj = 0\r\nres = 0\r\nmouse.append(float(\"inf\"))\r\ncheeses.append(float(\"inf\"))\r\nprevJ = -1\r\n\r\nfor i in range(n):\r\n while distance(mouse[i], cheeses[j]) > distance(mouse[i], cheeses[j + 1]):\r\n j += 1\r\n if prevJ < j or (0 < i and distance(mouse[i - 1], cheeses[j]) == distance(mouse[i], cheeses[j])):\r\n res += 1\r\n elif j + 1 < m and distance(mouse[i], cheeses[j + 1]) == distance(mouse[i], cheeses[j]):\r\n res += 1\r\n j += 1\r\n prevJ = j\r\n\r\nprint(n - res)\r\n ", "n,m,y0,y1=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\npos=0\r\nvis=[0]*m\r\ndis=[0]*m\r\nfor i in range(n):\r\n\twhile pos<m-1 and abs(b[pos]-a[i])>abs(b[pos+1]-a[i]): pos+=1\r\n\t# print('i=',i,'pos=',pos)\r\n\tif pos<m-1 and abs(b[pos]-a[i])==abs(b[pos+1]-a[i]):\r\n\t\tif not vis[pos]:\r\n\t\t\tvis[pos]=1\r\n\t\t\tdis[pos]=abs(a[i]-b[pos])\r\n\t\telse:\r\n\t\t\tif dis[pos]==abs(a[i]-b[pos]):\r\n\t\t\t\tvis[pos]+=1\r\n\t\t\telse:\r\n\t\t\t\tdis[pos+1]=abs(a[i]-b[pos+1])\r\n\t\t\t\tvis[pos+1]=1\r\n\telse:\r\n\t\tif not vis[pos]:\r\n\t\t\tvis[pos]=1\r\n\t\t\tdis[pos]=abs(a[i]-b[pos])\r\n\t\telse:\r\n\t\t\tif dis[pos]==abs(a[i]-b[pos]):\r\n\t\t\t\tvis[pos]+=1\r\n\t\t\telif dis[pos]>abs(a[i]-b[pos]):\r\n\t\t\t\tvis[pos]=1\r\n\t\t\t\tdis[pos]=abs(a[i]-b[pos])\r\nprint(n-sum(vis))\t\t\t\t", "'''\r\n有n只鼠、m个奶酪分别位于纵坐标为y0,y1两条水平线上的不同位置。对于每只老鼠，\r\n有多个奶酪可选时选择最近的；先到的吃到奶酪（如果存在），同时到达的都可以吃到，并把奶酪吃掉；\r\n若存在多种选择方案，将选择“所有老鼠的饥饿总值s最小”的方案。求最小的s。\r\n\r\n每个老鼠最多有左右两个可选奶酪，这是缩小解空间的关键。\r\n双指针遍历老鼠i最近的奶酪位置j，二者横坐标之差为d。\r\n若i可以吃j（i是j左边/右边最近的老鼠），那么不吃j+1、留给右边的老鼠；否则吃j+1（i是j+1左边最近的老鼠）。\r\n'''\r\nR=lambda:map(int,input().split());n,m,_,_=R();a,b=[*R()],[*R()]\r\nD=lambda i,j:abs(a[i]-b[j]);c,j,prej=0,0,-1\r\nfor i in range(n):\r\n while j+1<m and D(i,j)>D(i,j+1):j+=1\r\n d=D(i,j)\r\n if prej<j or 0<i and D(i-1,j)==d:c+=1\r\n elif j+1<m and D(i,j+1)==d:c+=1;j+=1\r\n prej=j\r\nprint(n-c)", "R=lambda:map(int,input().split());n,m,_,_=R();a,b=[*R()],[*R()]\r\nf=lambda i,j:abs(a[i]-b[j]);c,j,prej=0,0,-1\r\nfor i in range(n):\r\n \r\n while j+1<m and f(i,j)>f(i,j+1):j+=1\r\n d=f(i,j)\r\n if prej<j or 0<i and f(i-1,j)==d:c+=1\r\n elif j+1<m and f(i,j+1)==d:c+=1;j+=1\r\n prej=j\r\nprint(n-c)" ]

[ "import sys\r\nfrom collections import defaultdict as dd\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\nn,a,b=I()\r\nl=I()\r\ndic=dd(int)\r\nfor i in range(n):\r\n\tdic[l[i]]=1\r\nbs=[]\r\npa=dd(int)\r\nfor i in range(n):\r\n\tif dic[a-l[i]]==0:\r\n\t\tbs.append(l[i])\r\n\telse:\r\n\t\tpa[l[i]]=a-l[i]\r\nj=0\r\nwhile j<len(bs):\t\t\r\n\tfor i in range(j,len(bs)):\r\n\t\tcr=bs[i]\r\n\t\tdic[cr]=2\r\n\t\tif dic[b-cr]==0:\r\n\t\t\tprint(\"NO\");exit()\r\n\t\tdic[b-cr]=2\r\n\t\tif dic[a-b+cr]==1:\r\n\t\t\tdic[a-b+cr]=2\r\n\t\t\tbs.append(a-b+cr)\r\n\t\tj+=1\r\n\t\t#ct=0;vt=a-b+cr\r\n\t\t#while vt!=pa[pa[vt]]:\r\n\t\t#\tvt=pa[vt];dic[b-vt]=2\r\n\t\t#\tdic[vt]=2\r\nan=[0]*n\r\nfor i in range(n):\r\n\tan[i]=dic[l[i]]-1\r\nprint(\"YES\")\r\nprint(*an)\r\n", "def find(u):\r\n global par\r\n if u != par[u]:\r\n par[u] = find(par[u])\r\n return par[u]\r\n\r\ndef union(u, v):\r\n u = find(u)\r\n v = find(v)\r\n par[u] = v\r\n\r\nn, a, b = map(int, input().split())\r\np = list(map(int, input().split()))\r\nmp = dict()\r\nfor i in range(n):\r\n mp[p[i]] = i + 1\r\npar = [i for i in range(n + 2)]\r\n\r\nfor i in range(n):\r\n union(i + 1, mp.get(a - p[i], n + 1))\r\n union(i + 1, mp.get(b - p[i], 0))\r\n\r\nA = find(0)\r\nB = find(n + 1)\r\n\r\nif A != B:\r\n print('YES')\r\n print(' '.join(['1' if find(i) == B else '0' for i in range(1, n + 1)]))\r\nelse:\r\n print('NO')", "class DisjointSet:\n def __init__(self, n):\n self._fa = list(range(n))\n\n def union(self, x, y):\n x = self.get_father(x)\n y = self.get_father(y)\n self._fa[x] = y\n return y\n\n def get_father(self, x):\n y = self._fa[x]\n if self._fa[y] == y:\n return y\n else:\n z = self._fa[y] = self.get_father(y)\n return z\n\n def __repr__(self):\n return repr([self.get_father(i) for i in range(len(self._fa))])\n\ndef solve(n, a, b, xs):\n h = {x: i for i, x in enumerate(xs)}\n if a == b:\n if all(a - x in h for x in xs):\n return [0] * n\n return False\n g1 = n\n g2 = n + 1\n ds = DisjointSet(n + 2)\n\n for i, x in enumerate(xs):\n for t in (a, b):\n if t - x in h:\n ds.union(i, h[t - x])\n\n for i, x in enumerate(xs):\n b1 = (a - x) in h\n b2 = (b - x) in h\n if b1 + b2 == 0:\n return False\n if b1 + b2 == 1:\n if b1:\n ds.union(i, g1)\n else:\n ds.union(i, g2)\n if ds.get_father(g1) == ds.get_father(g2):\n return False\n group = [None] * n\n for i, x in enumerate(xs):\n f = ds.get_father(i)\n if f < n:\n return False\n group[i] = f - n\n return group\n\nn, a, b = map(int, input().split())\nxs = list(map(int, input().split()))\ngroup = solve(n, a, b, xs)\nif isinstance(group, list):\n print('YES')\n print(' '.join(map(str, group)))\nelse:\n print('NO')", "import sys\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef findSet(u):\r\n if u != parent[u]:\r\n parent[u] = findSet(parent[u])\r\n return parent[u]\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n parent[up] = vp\r\n \r\n \r\nn, a, b = map(int, input().split())\r\np = list(map(int, input().split()))\r\n\r\np.insert(0, -1)\r\n\r\nparent = [i for i in range(n + 2)]\t\r\n#A = 0, B = n + 1, mỗi phần tử trong p nằm trong tập hợp do vị trí i + 1 của nó đại diện\r\n\r\n\r\npos = {p[i]: i for i in range(1, n + 1)}\r\n#Tạo dict với key là p[i] và value là i - có thể truy cập phần tử dễ dàng và vị trí trong\r\n#mảng của nó\r\nif max(p) >= max(a, b): \t#Số dương nên không thể tồn tại a - p[i] hay b - p[i] mà ra số âm\r\n print('NO')\r\nelse:\r\n #Duyệt qua từng phần tử trong mảng:\r\n #-Nếu tồn tại a - p[i] thì ta hợp tập hợp chứa a - p[i] và p[i] (có cha là i) lại thành một. Nếu không thì chứng tỏ p[i] không thuộc A => nhét p[i] vào B\r\n #-Nếu tồn tại b - p[i] thì hợp tập hợp chưa b - p[i] và p[i] lại thành 1. Nếu không thì chứng tỏ p[i] không thuộc B => nhét vào A\r\n for i in range(1, n + 1):\r\n if a - p[i] in pos:\r\n unionSet(i, pos[a - p[i]])\r\n else:\r\n unionSet(i, n + 1)\r\n #print(p[i], parent, b - p[i])\r\n if b - p[i] in pos:\r\n unionSet(i, pos[b - p[i]])\r\n else:\r\n unionSet(i, 0)\r\n #print(p[i], parent)\r\n A = findSet(0)\r\n B = findSet(n + 1)\r\n if A == B:\r\n print('NO')\r\n else: \r\n print('YES')\r\n for i in range(1, n + 1):\r\n print(0 if findSet(i) == A else 1, end = \" \")", "def find(u):\r\n global parent\r\n if u != parent[u]:\r\n parent[u] = find(parent[u])\r\n return parent[u]\r\n \r\ndef union(u, v):\r\n u = find(u)\r\n v = find(v)\r\n parent[u] = v\r\n \r\nn, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmp = dict()\r\nfor i in range(n):\r\n mp[arr[i]] = i + 1\r\nparent = [i for i in range(n + 2)]\r\n \r\nfor i in range(n):\r\n union(i + 1, mp.get(a - arr[i], n + 1))\r\n union(i + 1, mp.get(b - arr[i], 0))\r\n \r\np1 = find(0)\r\np2 = find(n + 1)\r\n \r\nif p1 != p2:\r\n print('YES')\r\n print(' '.join(['1' if find(i) == p2 else '0' for i in range(1, n + 1)]))\r\nelse:\r\n print('NO')", "def findSet(u):\r\n if parents[u] != u:\r\n parents[u] = findSet(parents[u])\r\n return parents[u]\r\n\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if up == vp:\r\n return\r\n \r\n if ranks[up] > ranks[vp]:\r\n parents[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parents[up] = vp\r\n else:\r\n parents[up] = vp\r\n ranks[vp] += 1\r\n \r\nn, a, b = map(int, input().split())\r\nps = list(map(int, input().split())) \r\n\r\nmapping = set(ps)\r\n\r\nparents = {x: x for x in ps}\r\nparents['A'] = 'A'\r\nparents['B'] = 'B'\r\nranks = {x: 0 for x in ps}\r\nranks['A'] = 0\r\nranks['B'] = 0\r\n# print(parents)\r\nresult = True\r\nfor x in ps:\r\n if a - x in mapping:\r\n unionSet(x, a - x)\r\n else:\r\n unionSet(x, 'B')\r\n \r\n if b - x in mapping:\r\n unionSet(x, b - x)\r\n else:\r\n unionSet(x, 'A')\r\n # print(parents)\r\n\r\n# print(parents)\r\nif findSet('A') == findSet('B'):\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"YES\")\r\n for i in ps:\r\n if findSet(i) == findSet('A'):\r\n print(\"0\", end = ' ')\r\n else:\r\n print(\"1\", end = ' ')\r\n" ]

[ "import math\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom collections import deque\r\nimport bisect\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\nINF = 10 ** 18\r\nMOD = 10 ** 9 + 7\r\n\r\nfirst = 1 #if first node is 1\r\nG = defaultdict(list)\r\ndef addEdge(a,b):\r\n G[a].append(b)\r\n G[b].append(a)\r\n\t\r\ndef BFSUtil(queue,vis,level):\r\n while queue:\r\n s = queue.popleft()\r\n\r\n for child in G.get(s,[]):\r\n if vis[child] == False:\r\n queue.append(child)\r\n level[child] = level[s] + 1\r\n vis[child] = True\r\n \r\ndef nodesatlevel(node,N):\r\n vis = [False for i in range(N+1)]\r\n level ={}\r\n queue = deque()\r\n level[node] = 0\r\n queue.append(node)\r\n vis[node] = True\r\n BFSUtil(queue,vis,level)\r\n return level\r\n\r\nmark ={}\r\nN = int(input())\r\nfor i in range(N-1):\r\n u,v = ilele()\r\n addEdge(u,v)\r\nroot = 1\r\nmark = nodesatlevel(root,N)\r\n#print(mark,G)\r\nlen1 = 0;len2 =0\r\nfor j in mark.values():\r\n if j%2==0:\r\n len1+=1\r\n else:\r\n len2+=1\r\nAns = 0\r\n#print(len1,len2)\r\nfor i,j in G.items():\r\n if mark.get(i,-1) % 2== 0:\r\n Ans += max(0,len2 -len(j))\r\n else:\r\n Ans += max(0,len1-len(j))\r\n \r\nprint(Ans//2)\r\n \r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nd = [[] for _ in range(n)]\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n d[a-1].append(b)\r\n d[b-1].append(a)\r\n\r\nq = [1]\r\ne = [1] + [0]*(n-1)\r\n\r\nwhile len(q) > 0:\r\n x = q.pop()\r\n for i in d[x-1]:\r\n if e[i-1] == 0:\r\n q.append(i)\r\n e[i-1] = -e[x-1]\r\n\r\nx = e.count(1)\r\nprint(x*(n-x)-n+1)", "from collections import Counter,defaultdict,deque\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\n#import math\r\n\r\n#tt = 1#int(input())\r\n#total=0\r\n#n = int(input())\r\n#n,m,k = [int(x) for x in input().split()]\r\n#n = int(input())\r\n#n,m = [int(x) for x in input().split()]\r\nn = int(input())\r\n\r\n\r\ndef BFS(cmap,v):\r\n #order = deque([[]])\r\n visited = [False]*len(cmap)\r\n q = deque([v])\r\n level = 0\r\n \r\n blue = 0\r\n red = 0\r\n while len(q)!=0:\r\n for i in range(len(q)):\r\n vertex = q.popleft()\r\n if not visited[vertex]:\r\n if level%2==0:\r\n blue+=1\r\n else:\r\n red+=1\r\n #order[-1].append(vertex)\r\n visited[vertex] = True\r\n #globalvisited[vertex] = True\r\n q.extend(cmap[vertex])\r\n level+=1\r\n #order.append([])\r\n return blue,red\r\n\r\nconnections = [[] for x in range(n)]\r\nfor i in range(n-1):\r\n a,b = [int(x)-1 for x in input().split()]\r\n connections[a].append(b)\r\n connections[b].append(a)\r\n\r\nb,r = BFS(connections,0)\r\nprint(b*r-n+1)\r\n\r\n \r\n \r\n \r\n", "n = int(input())\nl = [1]+[0]*n\nd = [[]for _ in range(n)]\nc = [0]\nfor _ in range(n-1):\n a, b = map(int, input().split())\n d[a - 1] += [b - 1]\n d[b - 1] += [a - 1]\nwhile c:\n x = c.pop()\n for y in d[x]:\n if not l[y]:\n c += [y]\n l[y] -= l[x]\nr = l.count(1)\nprint(r*(n-r)-n+1)\n", "from collections import defaultdict\r\nfrom collections import deque\r\nn=int(input())\r\nd=defaultdict(list)\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n d[u].append(v)\r\n d[v].append(u)\r\nvisited=[0]*(n+1)\r\nc={}\r\nnr,nb=0,0\r\nq=deque()\r\nq.append(1)\r\nvisited[1]=1\r\nc[1]='R'\r\nnr=nr+1\r\nwhile q:\r\n i=q.popleft()\r\n co='R' if c[i]=='B' else 'B'\r\n for j in d[i]:\r\n if visited[j]==0:\r\n visited[j]=1\r\n c[j]=co\r\n if co=='R':\r\n nr=nr+1\r\n else:\r\n nb=nb+1\r\n q.append(j)\r\nans=0\r\nfor i in d:\r\n if c[i]=='R':\r\n ans=ans+nb-len(d[i])\r\n else:\r\n ans=ans+nr-len(d[i])\r\nprint(ans//2)", "n = int(input())\r\nli = [[] for i in range(n+1)]\r\nfor i in range(n-1):\r\n a, b = map(int,input().split())\r\n li[a].append(b)\r\n li[b].append(a)\r\nstack = [(1,1)]\r\ni, j = 0, 0\r\nvisited = [False] * (n+1)\r\nset1, set2 = 0, 0\r\nwhile len(stack) != 0:\r\n item = stack.pop()\r\n visited[item[0]] = True\r\n if item[1] == 1:\r\n set1 += 1\r\n else:\r\n set2 += 1\r\n for i in range(len(li[item[0]])):\r\n if not visited[li[item[0]][i]]:\r\n stack.append((li[item[0]][i],2 if item[1]==1 else 1))\r\nprint(set1*set2 - (n - 1))\r\n", "R = lambda: map(int, input().split())\r\nn = int(input())\r\ntree = [list() for i in range(n + 1)]\r\nfor i in range(n - 1):\r\n u, v = R()\r\n tree[u].append(v)\r\n tree[v].append(u)\r\nq = [(1, 1, 1)]\r\ncolorCnt = 1\r\nwhile q:\r\n curr, color, prev = q.pop()\r\n for neighbor in tree[curr]:\r\n if neighbor != prev:\r\n q.append((neighbor, 1 - color, curr))\r\n colorCnt += 1 - color\r\nprint(colorCnt * (n - colorCnt) - n + 1)", "number_of_nodes = int(input())\r\n\r\nTree = {}\r\n\r\ninteger1, integer2 = map(int, input().split())\r\nTree[integer1] = [integer2]\r\nTree[integer2] = [integer1]\r\nroot = integer1\r\nfor i in range(number_of_nodes - 2):\r\n integer1, integer2 = map(int, input().split())\r\n if integer1 not in Tree: Tree[integer1] = []\r\n if integer2 not in Tree: Tree[integer2] = []\r\n Tree[integer1].append(integer2)\r\n Tree[integer2].append(integer1)\r\n\r\ncurrent_nodes = [root]\r\nl = 0\r\nr = 0\r\ni = 0\r\nnode_side = {}\r\npassed = set()\r\nwhile len(current_nodes) != 0:\r\n new_nodes = []\r\n for node in current_nodes:\r\n if(node in passed):\r\n continue\r\n passed.add(node)\r\n new_nodes.extend(Tree[node])\r\n if (i % 2 == 0):\r\n node_side[node] = 'left'\r\n else:\r\n node_side[node] = 'right'\r\n\r\n if (i % 2) == 0:\r\n l += 1\r\n else:\r\n r += 1\r\n\r\n i += 1\r\n current_nodes = new_nodes\r\n\r\n\r\nnumber_of_edges = 0\r\nfor node in Tree:\r\n if node_side[node] == 'left':\r\n number_of_edges += r - len(Tree[node])\r\n else:\r\n number_of_edges += l - len(Tree[node])\r\n\r\nprint(number_of_edges // 2)", "import sys\r\n\r\n#comment these out later\r\n#sys.stdin = open(\"in.in\", \"r\")\r\n#sys.stdout = open(\"out.out\", \"w\")\r\n\r\ndef is_bipartite(graph):\r\n n = len(graph)\r\n color = [-1] * n\r\n\r\n for start in range(n):\r\n if color[start] == -1:\r\n color[start] = 0\r\n stack = [start]\r\n\r\n while stack:\r\n parent = stack.pop()\r\n\r\n for child in graph[parent]:\r\n if color[child] == -1:\r\n color[child] = 1 - color[parent]\r\n stack.append(child)\r\n elif color[parent] == color[child]:\r\n return False, color\r\n\r\n return True, color\r\n\r\ninp = [int(x) for x in sys.stdin.read().split()]; ii = 0\r\n\r\nn = inp[ii]; ii += 1\r\n\r\ng = [[] for _ in range(n)]\r\n\r\nfor _ in range(n-1):\r\n a = inp[ii] - 1; ii += 1\r\n b = inp[ii] - 1; ii += 1\r\n\r\n g[a].append(b)\r\n g[b].append(a)\r\n\r\n_, k = is_bipartite(g)\r\n\r\nx = k.count(0)\r\ny = n-x\r\n\r\nprint(x*y - n + 1)", "n = int(input())\r\nd = [[] for _ in range(n+1)]\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n d[u] += [v]\r\n d[v] += [u]\r\nl = [None]*(n+1)\r\nl[1] = 1\r\ntemp = [1]\r\nwhile temp:\r\n top = temp.pop()\r\n for x in d[top]:\r\n if l[x] == None:\r\n l[x] = 1-l[top]\r\n temp.append(x)\r\ns = l.count(1)\r\nprint(s*(n-s)-n+1)\r\n", "from sys import stdin , setrecursionlimit\r\ninput = stdin.readline\r\nsetrecursionlimit(5000)\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\r\n@bootstrap\r\ndef dfs(p , prev , what):\r\n\r\n global one , zero , subone , subzero\r\n\r\n one += what\r\n zero += what ^ 1\r\n\r\n count = 0\r\n for i in child[p]:\r\n if(i == prev):continue\r\n yield dfs(i , p , what ^ 1)\r\n count += 1\r\n\r\n\r\n if(what == 1):\r\n subone += count\r\n else:\r\n subzero += count\r\n\r\n yield\r\n\r\n\r\nfor T in range(1):\r\n\r\n n = int(input())\r\n child = [[] for i in range(n + 1)]\r\n for i in range(n - 1):\r\n u , v = map(int , input().split())\r\n child[u].append(v)\r\n child[v].append(u)\r\n \r\n\r\n one , zero , subone , subzero = 0 , 0 , 0 , 0\r\n dfs(1 , -1 , 0)\r\n\r\n print(one * zero - subone - subzero)\r\n", "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\nfrom math import *\r\ndef mrd(): return [int(x) for x in input().split()]\r\ndef rd(): return int(input())\r\nMAXN = 2 * 10**5 + 5\r\nINF = 10**16 * 2\r\nmod = 10**9 + 7\r\n#----------------------------------------------------------------------------------#\r\n \r\ndef solve():\r\n n = rd()\r\n adj = [[] for _ in range(n + 1)]\r\n for _ in range(n - 1):\r\n u,v = mrd()\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n \r\n \r\n cnt = [0,0]\r\n def dfs():\r\n q = deque()\r\n q.append((1,0,0))\r\n while q:\r\n u,fa,op = q.pop()\r\n cnt[op] += 1\r\n for v in adj[u]:\r\n if v == fa: continue\r\n q.append((v,u,op ^ 1))\r\n # def dfs(u,fa,op):\r\n # cnt[op] += 1\r\n # for v in adj[u]:\r\n # if v == fa: continue\r\n # dfs(v,u,op ^ 1)\r\n \r\n dfs()\r\n print(cnt[0] * cnt[1] - (n - 1))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n \t \t ", "import sys,threading\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(10**8)\r\ndef main():\r\n global al,va,ca,n0,n1\r\n n=int(input())\r\n al=[[]for i in range(n+1)]\r\n for i in range(n-1):\r\n a,b=map(int,input().split())\r\n al[a].append(b)\r\n al[b].append(a)\r\n\r\n c=0\r\n va=[0]*(n+1)\r\n ca=[-1]*(n+1)\r\n n0=0\r\n n1=0\r\n for e in range(1,n+1):\r\n if(va[e]==0):\r\n dfs(e,0)\r\n\r\n\r\n print(n0*n1-(n-1))\r\ndef dfs(n,col):\r\n global n0,n1,al,va,ca\r\n va[n]=1\r\n ca[n]=col\r\n if(col==0):\r\n n0=n0+1\r\n else:\r\n n1=n1+1\r\n for e in al[n]:\r\n if(va[e]==0):\r\n \r\n dfs(e,ca[n]^1)\r\n\r\n\r\nt=threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n\r\n", "from sys import stdin, stdout, setrecursionlimit\r\nimport threading\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, recursion_limit, stack_size):\r\n setrecursionlimit(recursion_limit)\r\n threading.stack_size(stack_size)\r\n return None\r\n \r\nclass SOLVE:\r\n def dfs(self, u, node, color, A, B):\r\n \r\n (A if color[u] else B).append(u)\r\n \r\n for v in node[u]:\r\n if color[v] == None:\r\n color[v] = color[u] ^ 1\r\n self.dfs(v, node, color, A, B)\r\n \r\n return 0\r\n \r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n ans = []\r\n \r\n n = int(R())\r\n node = [[] for i in range(n+1)]\r\n for i in range(n-1):\r\n u, v = [int(x) for x in R().split()]\r\n node[u].append(v)\r\n node[v].append(u)\r\n \r\n color = [None for i in range(n+1)]\r\n A, B = [], []\r\n color[1] = 1\r\n self.dfs(1, node, color, A, B)\r\n \r\n total = 0\r\n a, b = len(A), len(B)\r\n for i in range(1, n+1):\r\n total += (b if color[i] else a) - len(node[i])\r\n total //= 2\r\n \r\n W('%d' % total)\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\nTail_Recursion_Optimization(10**7, 2**26)\r\nthreading.Thread(target=main).start()", "def main():\r\n n = int(input())\r\n adj = [[] for _ in range(n+1)]\r\n\r\n for _ 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\n\r\n one = [0]\r\n two = [0]\r\n def dfs(node,parent,adj,state):\r\n\r\n for children in adj[node]:\r\n if children != parent:\r\n dfs(children,node,adj,1-state)\r\n if state:\r\n one[0] += 1\r\n else:\r\n two[0] += 1\r\n pass\r\n\r\n\r\n\r\n dfs(1,0,adj,1)\r\n print(one[0]*two[0]-(n-1))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n import sys, threading\r\n input = sys.stdin.readline\r\n sys.setrecursionlimit(2 ** 32 // 2 - 1)\r\n threading.stack_size(1 << 27)\r\n\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()\r\n\r\n\r\n", "n = int(input())\r\nm = n-1\r\nadj = [[] for i in range(n+1) ]\r\nfor i in range(m):\r\n x , y = list(map(int,input().split()))\r\n adj[x].append(y)\r\n adj[y].append(x)\r\nt = [0 for i in range(n+1)]\r\ndef dfs(r):\r\n t[r] = 2\r\n stk = [r]\r\n while (len(stk) > 0):\r\n u = stk[-1]\r\n stk.pop()\r\n for v in adj[u]:\r\n if t[v] == 0:\r\n stk.append(v)\r\n if t[u] == 2:\r\n t[v] = 1\r\n elif t[u] == 1:\r\n t[v] = 2\r\n else:\r\n if t[u] == t[v]:\r\n return True\r\n \r\nfor i in range(1,n+1):\r\n if t[i] == 0:\r\n a = dfs(i)\r\n\r\nprint((t.count(1) * t.count(2)) - m)\r\n", "n=int(input())\r\na=[[]for i in range(n)]\r\nfor i in range(n-1):\r\n f,s=map(int,input().split())\r\n a[s-1].append(f)\r\n a[f-1].append(s)\r\nq=[1]\r\nfl=[1]+[0]*n\r\nwhile len(q)!=0:\r\n x=q.pop()\r\n for i in a[x-1]:\r\n if fl[i-1]==0:\r\n q.append(i)\r\n fl[i-1]=-fl[x-1]\r\nprint(fl.count(1)*(n-fl.count(1))-n+1)", "from collections import defaultdict\r\ndef dfs(g,n):\r\n a1,a2=0,0\r\n\r\n q=[]\r\n q.append((1,1))\r\n visited=[True]*(n+1)\r\n visited[1]=False\r\n a1+=1\r\n while(len(q)!=0):\r\n # print(q)\r\n c,v=q.pop()\r\n\r\n for i in g[c]:\r\n if(visited[i]):\r\n visited[i]=False\r\n if(v==1):\r\n a2+=1\r\n q.append((i,0))\r\n else:\r\n a1+=1\r\n q.append((i,1))\r\n # print(a1,a2)\r\n return a1*a2-(n-1)\r\n\r\n \r\n\r\n\r\n\r\n\r\ng=defaultdict(list)\r\nn=int(input())\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\na=dfs(g,n)\r\nprint(a)\r\n", "# import sys\r\n# sys.stdin = open(\"in.in\", \"r\")\r\nn = int(input())\r\ngraph = {x: [] for x in range(1, n+1)}\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n\r\n graph[b].append(a)\r\nbipartite = {1: 1}\r\nstack = [1]\r\nvisited = {}\r\nwhile stack:\r\n current = stack.pop()\r\n\r\n\r\n if visited.get(current):continue\r\n for neighbour in graph[current]:\r\n if bipartite[current] == 1:\r\n bipartite[neighbour] = 2\r\n else:\r\n bipartite[neighbour] = 1\r\n stack.append(neighbour)\r\n visited[current] = 1\r\n\r\n\r\n\r\nfirst_group = []\r\nsecond_group = []\r\nfor key, value in bipartite.items():\r\n if value == 1:first_group.append(key)\r\n else:second_group.append(key)\r\n\r\nadd = 0\r\nfor item in first_group:\r\n add += len(second_group)-len(graph[item])\r\nprint(add)", "# In this template you are not required to write code in main\r\n\r\n # Remember you were also a novice when you started,\r\n # hence never be rude to anyone who wants to learn something\r\n # Never open a ranklist untill and unless you are done with solving problems, wastes 3/4 minuts\r\n # Donot treat CP as a placement thing, love it and enjoy it, you will succeed for sure.\r\n\r\nimport sys\r\n# inf = float(\"inf\")\r\n\r\n# abc='abcdefghijklmnopqrstuvwxyz'\r\n# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nMOD,mod=1000000007,998244353\r\n# vow=['a','e','i','o','u']\r\n# dx,dy=[-1,1,0,0],[0,0,1,-1]\r\n# sys.setrecursionlimit(10000000)\r\n\r\n\r\nfrom collections import deque, Counter, OrderedDict,defaultdict\r\n# from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\n# from math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n# from bisect import bisect_left,bisect_right\r\n#import numpy as np\r\n\r\ndef get_array(): return list(map(int , sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\ndef is_bipartite(graph):\r\n n = len(graph)\r\n color = [-1] *(n+1)\r\n\r\n for start in range(1,n+1):\r\n if color[start] == -1:\r\n color[start] = 0\r\n stack = [start]\r\n\r\n while stack:\r\n parent = stack.pop()\r\n\r\n for child in graph[parent]:\r\n if color[child] == -1:\r\n color[child] = 1 - color[parent]\r\n stack.append(child)\r\n elif color[parent] == color[child]:\r\n return False, color\r\n\r\n return True, color[1:]\r\n\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nn=int(input())\r\ngraph=defaultdict(list)\r\nfor i in range(n-1):\r\n x,y=get_ints()\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n\r\n# print(graph)\r\na,color=is_bipartite(graph)\r\nArr1=[]\r\nArr2=[]\r\nfor i in range(n):\r\n if color[i]==0:\r\n Arr1.append(i+1)\r\n else:\r\n Arr2.append(i+1)\r\ncount=0\r\nn1=len(Arr1)\r\nn2=len(Arr2)\r\nfor i in Arr1:\r\n count+=(n2-len(graph[i]))\r\nfor i in Arr2:\r\n count+=(n1-len(graph[i]))\r\nprint(count//2)\r\n\r\n\r\n", "\r\n\r\nfrom collections import deque, Counter, OrderedDict,defaultdict\r\n\r\n\r\ndef is_bipartite(graph):\r\n n = len(graph)\r\n color = [-1] *(n+1)\r\n\r\n for start in range(1,n+1):\r\n if color[start] == -1:\r\n color[start] = 0\r\n stack = [start]\r\n\r\n while stack:\r\n parent = stack.pop()\r\n\r\n for child in graph[parent]:\r\n if color[child] == -1:\r\n color[child] = 1 - color[parent]\r\n stack.append(child)\r\n elif color[parent] == color[child]:\r\n return False, color\r\n\r\n return True, color[1:]\r\n\r\n\r\n\r\nn=int(input())\r\ngraph=defaultdict(list)\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n\r\n# print(graph)\r\na,color=is_bipartite(graph)\r\nArr1=[]\r\nArr2=[]\r\nfor i in range(n):\r\n if color[i]==0:\r\n Arr1.append(i+1)\r\n else:\r\n Arr2.append(i+1)\r\ncount=0\r\nn1=len(Arr1)\r\nn2=len(Arr2)\r\nfor i in Arr1:\r\n count+=(n2-len(graph[i]))\r\nfor i in Arr2:\r\n count+=(n1-len(graph[i]))\r\nprint(count//2)\r\n\r\n\r\n", "import sys\r\nfrom collections import deque \r\ndef get_int():\r\n return int(sys.stdin.readline().strip())\r\n \r\ndef get_ints():\r\n return map(int,sys.stdin.readline().strip().split())\r\n \r\ndef get_list():\r\n return list(map(int,sys.stdin.readline().strip().split()))\r\n \r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\n\r\nn = get_int()\r\n\r\nadj = [[] for _ in range(n)]\r\n\r\nedgeSet = set()\r\nfor _ in range(n-1):\r\n u,v = get_ints()\r\n u-=1\r\n v-=1\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n edgeSet.add((min(u,v),max(u,v)))\r\n\r\ncolour = [-1]*n\r\n\r\nq = deque()\r\nq.append(0)\r\ncolour[0] = 0\r\n\r\nwhile q:\r\n node = q.pop()\r\n\r\n for u in adj[node]:\r\n if colour[u]!=-1:\r\n continue\r\n\r\n colour[u] = colour[node]^1\r\n q.append(u)\r\n\r\n\r\ncount1 = sum(colour)\r\ncount0 = n-count1\r\n\r\n# every 1 can have an edge with every 0 = count1*count0\r\n\r\nans = count1*count0 - (n-1)\r\n\r\nprint(ans)", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nvisited = [0]*(n+1)\r\n\r\nd = defaultdict(int)\r\nm = defaultdict(list)\r\n\r\nred = 0\r\nblue = 0\r\n\r\nfor i in range(n-1):\r\n u, v = map(int, input().split())\r\n m[u].append(v)\r\n m[v].append(u)\r\n\r\nkv = (1, 1)\r\nstack = []\r\nstack.append(kv)\r\n\r\nwhile stack:\r\n t = stack.pop()\r\n tv = 0 if t[1] else 1\r\n visited[t[0]] = 1\r\n d[t[0]] = t[1]\r\n for v in m[t[0]]:\r\n if not visited[v]:\r\n stack.append((v, tv))\r\n\r\n\r\n\r\n\r\nfor k in d:\r\n if d[k] == 1:\r\n red += 1\r\n else:\r\n blue += 1\r\n\r\n# print(d, red, blue)\r\n\r\nprint(red*blue - (n-1))\r\n", "count = [0]*2\r\nn = int(input())\r\ngraph = [[] for _ in range(n + 1)]\r\n\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nstack = [(1,0,0)]\r\n\r\nwhile stack:\r\n\r\n node, parent, color = stack.pop()\r\n\r\n count[color]+=1\r\n for i in graph[node]:\r\n if i!=parent:\r\n stack.append((i, node, 1-color))\r\n\r\nprint((count[0]*count[1])-(n-1))", "import sys\r\nfrom sys import stdin,stdout\r\n\r\nimport bisect\r\n\r\nimport math\r\n\r\nmod=10**9 +7 \r\n\r\ndef st():\r\n return list(stdin.readline().strip())\r\n\r\ndef inp():\r\n return int(stdin.readline())\r\n\r\ndef li():\r\n return list(map(int,stdin.readline().split()))\r\n\r\ndef mp():\r\n return map(int,stdin.readline().split())\r\n\r\ndef pr(n):\r\n stdout.write(str(n)+\"\\n\")\r\n \r\ndef DFS(dictionary,vertex,visited):\r\n visited[vertex]=True\r\n stack=[vertex]\r\n print(vertex)\r\n while stack:\r\n a=stack.pop()\r\n for i in dictionary[a]:\r\n if not visited[i]:\r\n print(i)\r\n visited[i]=True\r\n stack.append(i)\r\n \r\n\r\n\r\ndef soe(limit):\r\n l=[1]*(limit+1)\r\n l[0]=0\r\n l[1]=0\r\n prime=[]\r\n for i in range(2,limit+1):\r\n if l[i]:\r\n for j in range(i*i,limit+1,i):\r\n l[j]=0\r\n \r\n for i in range(2,limit+1):\r\n if l[i]:\r\n prime.append(i)\r\n return prime\r\n\r\ndef segsoe(low,high):\r\n limit=int(high**0.5)+1\r\n prime=soe(limit)\r\n n=high-low+1\r\n l=[0]*(n+1)\r\n for i in range(len(prime)):\r\n lowlimit=(low//prime[i])*prime[i]\r\n if lowlimit<low:\r\n lowlimit+=prime[i]\r\n if lowlimit==prime[i]:\r\n lowlimit+=prime[i]\r\n for j in range(lowlimit,high+1,prime[i]):\r\n l[j-low]=1\r\n for i in range(low,high+1):\r\n if not l[i-low]:\r\n if i!=1:\r\n print(i)\r\n \r\ndef gcd(a,b):\r\n while b:\r\n a=a%b\r\n b,a=a,b\r\n return a\r\n\r\ndef power(a,n):\r\n r=1\r\n while n:\r\n if n&1:\r\n r=(r*a)\r\n a*=a\r\n n=n>>1\r\n return r\r\n\r\ndef DFS(d,visited,ver,color,value):\r\n value[ver]=color\r\n visited[ver]=True\r\n stack=[ver]\r\n while stack:\r\n a=stack.pop()\r\n for i in d[a]:\r\n if not visited[i]:\r\n visited[i]=True\r\n stack.append(i)\r\n value[i]=value[a]^1\r\n else:\r\n if value[i]==value[a]:\r\n return False\r\n return True\r\n\r\ndef solve():\r\n n=inp()\r\n visited=[False for i in range(n+1)]\r\n d={i:[] for i in range(1,n+1)}\r\n for i in range(n-1):\r\n a,b=mp()\r\n d[a].append(b)\r\n d[b].append(a)\r\n\r\n ans=0\r\n value=[-1]*(n+1)\r\n \r\n for i in range(1,n+1):\r\n if not visited[i]:\r\n if not DFS(d,visited,i,0,value):\r\n pr(0)\r\n return\r\n a=value.count(1)\r\n pr(a*(n-a)-(n-1))\r\n \r\n \r\n\r\nfor _ in range(1):\r\n solve()\r\n \r\n", "n=int(input())\r\ng=[[] for i in range(n)]\r\nfor _ in range(n-1):\r\n s,t=map(int,input().split())\r\n g[s-1].append(t-1)\r\n g[t-1].append(s-1)\r\nq=[0]\r\ncolor=[1]+[0]*n\r\nwhile q:\r\n node=q.pop()\r\n for to in g[node]:\r\n if not color[to]:\r\n q.append(to)\r\n color[to]=-color[node]\r\nx=color.count(1)\r\ny=n-x\r\nprint(x*y-(n-1))", "graph = {}\n\nn = int(input())\n\nfor i in range(n):\n graph[i+1] = []\n\nfor i in range(n-1):\n u,v = map(int,input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nX = set()\nY = set()\n\nqueue = [1]\nvisited = set()\nX.add(1)\n\nwhile queue:\n v = queue.pop()\n if v not in visited:\n visited.add(v)\n for neighbor in graph[v]:\n if neighbor not in visited:\n queue.append(neighbor)\n if v in X:\n Y.add(neighbor)\n else: \n X.add(neighbor)\n\nprint(len(X)*len(Y)-(n-1))\n \n\n\n\n", "import collections, sys, threading\n\nsys.setrecursionlimit(10 ** 9)\nthreading.stack_size(67108864)\nde = [0] * 1000000\nadjlist = list()\nvisited = [0] * 1000000\neven, odd = 0, 0\n\n\ndef dfs(s, depth):\n global even\n global odd\n de[s] = depth\n visited[s] = 1\n if depth % 2 == 0:\n even = even + 1\n else:\n odd = odd + 1\n for i in range(0, len(adjlist[s])):\n v = adjlist[s][i]\n if visited[v] == 0:\n dfs(v, depth + 1)\n\n\ndef main():\n n = int(input())\n for i in range(0, n + 1):\n adjlist.append(list())\n for i in range(0, n - 1):\n hi = input()\n yo = hi.split()\n a = int(yo[0])\n b = int(yo[1])\n adjlist[a].append(b)\n adjlist[b].append(a)\n dfs(1, 0)\n tot = 0\n for i in range(1, n + 1):\n if de[i] % 2 == 0:\n tot = tot + odd - len(adjlist[i])\n else:\n tot = tot + even - len(adjlist[i])\n print(int(tot / 2))\n\n\nthread = threading.Thread(target=main)\nthread.start()\n", "n=int(input())\r\ng=[[] for _ in range(n+1)]\r\nfor _ in range(n-1):\r\n u,v=map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n \r\nst=[(1,0,0)]\r\nm=0\r\nwhile st:\r\n u,p,c=st.pop()\r\n m += c\r\n st.extend((v,u,1-c) for v in g[u] if v!=p)\r\n \r\nprint(m*(n-m)-n+1)", "n=int(input())\r\na=[]\r\nfor i in range(n-1):\r\n a.append(list(map(int,input().split(' '))))\r\n\r\nTable=[[] for i in range(n+1)]\r\nfor i in range(len(a)):\r\n Table[a[i][0]].append(a[i][1])\r\n Table[a[i][1]].append(a[i][0])\r\n\r\n\r\n\r\n#c[i[ = 0 means its the right\r\n#c[i] = 1 means its the left\r\n#c[i] = 2 means we dont know the colour\r\nc=[2 for i in range(n+1)]\r\nc[1]=1\r\n\r\nqueue=[]\r\nqueue.append(1)\r\n\r\npointer=-1\r\nwhile pointer+1<len(queue):\r\n pointer+=1\r\n x=queue[pointer]\r\n for i in range(len(Table[x])):\r\n if c[Table[x][i]]==2:\r\n queue.append(Table[x][i])\r\n c[Table[x][i]]=1-c[x]\r\n\r\n\r\n\r\nl=0\r\nr=0\r\nfor i in range(1,len(c)):\r\n if c[i]==1:\r\n l+=1\r\n else:\r\n r+=1\r\n\r\nMax=l*r\r\n\r\nprint(Max-(n-1))", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/11 22:08\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\n\r\ns, t = set(), set()\r\n\r\nedges = collections.defaultdict(list)\r\nfor i in range(N-1):\r\n u, v = map(int, input().split())\r\n edges[u].append(v)\r\n edges[v].append(u)\r\n # edges.add((v, u))\r\n\r\ns.add(1)\r\nq = [1]\r\nwhile q:\r\n s, t = t, s\r\n p = []\r\n for u in q:\r\n for v in edges[u]:\r\n if v not in s:\r\n s.add(v)\r\n p.append(v)\r\n q = p\r\n\r\n# print(s, t)\r\n\r\nns = len(s)\r\nnt = len(t)\r\n\r\nprint(ns * nt - (N-1))\r\n", "from sys import stdin, stdout\r\nimport queue\r\nAdjList = []\r\ndistance = []\r\nq = queue.Queue(0)\r\ndef bfs(u):\r\n q.put(u)\r\n distance[u] = 0\r\n while q.empty() == False:\r\n u = q.get()\r\n for j in AdjList[u]:\r\n if distance[j] == -1:\r\n q.put(j)\r\n distance[j] = distance[u] + 1\r\nn = int(input())\r\nfor _ in range(n):\r\n AdjList.append([])\r\n distance.append(-1)\r\nfor _ in range(n - 1):\r\n u,v = [int(x) for x in stdin.readline().split()]\r\n AdjList[u - 1].append(v - 1)\r\n AdjList[v - 1].append(u - 1)\r\nbfs(0)\r\nparni = neparni = 0\r\nfor i in range(len(distance)):\r\n if distance[i] % 2 == 0:\r\n parni += 1\r\n else:\r\n neparni += 1\r\nans = parni * neparni - n + 1\r\nprint(ans)\r\n", "n=int(input())\r\ngraph=[None]*(n+1)\r\nfor i in range(n-1):\r\n\tu,v=map(int,input().split())\r\n\tif graph[u]==None:\r\n\t\tgraph[u]=[v]\r\n\telse:\r\n\t\tgraph[u].append(v)\r\n\tif graph[v]==None:\r\n\t\tgraph[v]=[u]\r\n\telse:\r\n\t\tgraph[v].append(u)\r\n\r\nis_u=[None]*(n+1)\r\nis_u[1]=True\r\nstack=[1]\r\nwhile stack:\r\n\ttop=stack.pop()\r\n\tvals=graph[top]\r\n\tfor i in range(len(vals)):\r\n\t\tcur=vals[i]\r\n\t\tif is_u[cur]==None:\r\n\t\t\tis_u[cur]=not is_u[top]\r\n\t\t\tstack.append(cur)\r\ncount_u=is_u.count(True)\r\nprint(count_u*(n-count_u)-(n-1))", "import sys\nsys.setrecursionlimit(300005)\n#print(sys.getrecursionlimit())\nn = int(input())\ng = [[] for i in range(n)]\nused = [0] * n\n\nfor i in range(n - 1):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n g[a].append(b)\n g[b].append(a)\n\n\nx = 0\ny = 0\n\nq = [(0,1)]\nused[0]=1\nwhile(len(q)!=0):\n v,color = q.pop()\n for vert in g[v]:\n if (used[vert]==0):\n used[vert]=3-color\n q.append((vert,3-color))\n\nfor i in range(n):\n if (used[i] == 1):\n x += 1\n else:\n y += 1\n# print(used)\nprint(x * y - n + 1)\n\n\n\n\n\n\n\n\n\n\n\n", "from collections import *\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\ndef dfs():\n\tto_visit = deque()\n\tto_visit.append(0)\n\twhile to_visit:\n\t\tparent = to_visit.popleft()\n\t\tfor child in graph[parent]:\n\t\t\tif colors[child] == -1:\n\t\t\t\tcolors[child] = 1 - colors[parent]\n\t\t\t\tto_visit.append(child) \nn = ri()\ncolors = [-1]*n\ncolors[0] = 1\ngraph = [[] for _ in range(n)]\nfor i in range(n - 1):\n\tu, v = rl()\n\tu -= 1\n\tv -= 1\n\tgraph[u].append(v)\n\tgraph[v].append(u)\ndfs()\nC = Counter(colors)\nif n == 1:\n\tprint(\"0\")\n\tsys.exit()\n#otherwise have at least one node of each color\nans = 0\nfor u in range(n):\n\n\tcolor = colors[u]\n\tdegree = len(graph[u])\n\n\tans += C[1 - color] - degree\nprint(ans // 2)\n\n\n\n\n\t\n", "from collections import defaultdict\r\n\r\ndef checkbi(hash,node):\r\n\r\n queue = [node]\r\n s1 = {node}\r\n s2 = set()\r\n\r\n while queue!=[]:\r\n z = queue.pop(-1)\r\n\r\n if z in s1:\r\n yo = 1\r\n else:\r\n yo = 0\r\n for i in hash[z]:\r\n if i not in s1 and i not in s2:\r\n if yo == 1:\r\n s2.add(i)\r\n\r\n else:\r\n s1.add(i)\r\n queue.append(i)\r\n elif (i in s1 and yo == 1) or (i in s2 and yo == 0):\r\n return False\r\n\r\n\r\n return s1,s2\r\n\r\n\r\nn = int(input())\r\n\r\nhash = defaultdict(list)\r\n\r\nfor i in range(n-1):\r\n a,b = map(int,input().split())\r\n hash[a].append(b)\r\n hash[b].append(a)\r\n\r\ns1,s2 = checkbi(hash,1)\r\n\r\nans = 0\r\nfor i in s1:\r\n ans+=len(s2)-len(hash[i])\r\n\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\n\r\nMX = 200001\r\nadj = []\r\nmark = [0] * MX\r\ndis = [0] * MX\r\ngroups = [[1], []]\r\nfor i in range(MX):\r\n adj.append([])\r\n\r\nfor i 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\n\r\ndef BFS(u):\r\n a = [u]\r\n mark[u] = 1\r\n while len(a) > 0:\r\n v = a.pop(0)\r\n for i in adj[v]:\r\n if mark[i] == 0:\r\n a.append(i)\r\n mark[i] = 1\r\n dis[i] = dis[v] + 1\r\n groups[dis[i] % 2].append(i)\r\n\r\n\r\nBFS(1)\r\n\r\nprint(len(groups[0]) * len(groups[1]) - (n-1))\r\n", "n = int(input())\r\ns1 = set()\r\ns2 = set()\r\nd = {}\r\n\r\n# Initialize the dictionary with empty lists for each node\r\nfor i in range(n):\r\n d[i] = []\r\n\r\n# Read the tree edges and populate the dictionary\r\nfor i in range(n-1):\r\n p, m = map(int, input().split())\r\n d[p-1].append(m-1)\r\n d[m-1].append(p-1)\r\n\r\nx = [0] * n # Indexing starts from 0, so the size is n instead of n+1\r\nx[0] = 1 # Start with the first node in set s1\r\ns1.add(0)\r\n\r\n# Perform a depth-first search to segregate the tree into bipartite sets\r\nstack = [0]\r\nwhile stack:\r\n node = stack.pop()\r\n current_set = x[node]\r\n\r\n # Iterate over the neighbors of the current node\r\n for neighbor in d[node]:\r\n if x[neighbor] == 0:\r\n # Assign the neighbor to the opposite set of the current node\r\n x[neighbor] = 3 - current_set\r\n if x[neighbor] == 1:\r\n s1.add(neighbor)\r\n else:\r\n s2.add(neighbor)\r\n stack.append(neighbor)\r\n\r\n\r\n\r\n\r\nresult = len(s1) * len(s2) - n + 1\r\n\r\nprint(result)\r\n", "n = int(input())\r\na = [[] for _ in range(n+1)] \r\ng = [0]*(n+1)\r\nfor _ in range(n-1) :\r\n x, y = map(int,input().split())\r\n a[x].append(y)\r\n a[y].append(x)\r\nf=[1]\r\ng[1]=1\r\n\r\nwhile len(f)>0:\r\n num = f[0]\r\n f.remove(num)\r\n for e in a[num]:\r\n a[e].remove(num)\r\n g[e]=1-g[num]\r\n f.append(e)\r\n\r\nc=sum(g)\r\nprint((c-1)*(n-c-1))", "from collections import deque\r\n\r\ndef bfs(graph:list, n:int):\r\n queue = deque([1])\r\n visited = set()\r\n depth = {1:0}\r\n \r\n while queue:\r\n vertex = queue.popleft()\r\n visited.add(vertex)\r\n \r\n children = graph[vertex]\r\n for child in children:\r\n if child not in visited:\r\n queue.append(child)\r\n depth[child]=depth[vertex]+1\r\n \r\n return depth\r\n\r\n\r\n## Main\r\nn=int(input())\r\ngraph=[[] for _ in range(n+1)]\r\nfor _ in range(n-1):\r\n u,v=map(int,input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n \r\ndepth = bfs(graph,n)\r\nbp = [0,0]\r\nfor vertex in depth:\r\n if depth[vertex]%2==0:\r\n bp[1]+=1\r\n else:\r\n bp[0]+=1\r\n\r\nans = 0\r\nfor vertex in range(1,n+1):\r\n ans += bp[depth[vertex]%2] - len(graph[vertex])\r\n \r\nprint(ans//2)\r\n", "# n=int(input())\r\n# di={\"polycarp\":1}\r\n# ma=1\r\n# for i in range(n):\r\n# x,y,z=input().split()\r\n# x=x.lower()\r\n# z=z.lower()\r\n# di[x]=di[z]+1\r\n# ma=max(ma,di[x])\r\n# print(ma)\r\n\r\nfrom collections import defaultdict\r\nn=int(input())\r\nbl=0\r\nwh=0\r\ndi={}\r\ndi=defaultdict(lambda:[],di)\r\ndi[0]=[1]\r\nvisited=[False]*n\r\ncol={}\r\ncol=defaultdict(lambda:-1,col)\r\ncol[0]=0\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n l=di[x]\r\n l.append(y)\r\n di[x]=l\r\n m=di[y]\r\n m.append(x)\r\n di[y]=m\r\nvisited=[False]*(n+1)\r\nvisited[0]=True\r\nstack=[0]\r\ncolor=0\r\ncnt=0\r\nwhile True:\r\n if cnt>=n:\r\n break\r\n s=stack.pop()\r\n color=col[s]\r\n if visited[s]==True:\r\n for i in di[s]:\r\n if visited[i]==False:\r\n visited[i]=True\r\n bl=bl-color+1\r\n stack.append(i)\r\n col[i]=1-color\r\n cnt=cnt+1\r\nprint((n-bl)*bl-n+1)\r\n \r\n\r\n\r\n", "from collections import defaultdict\r\nfrom queue import Queue as Q\r\nn = int(input())\r\ne = defaultdict(list)\r\nfor i in range(n-1):\r\n x, y = tuple(map(int, input().split()))\r\n e[x].append(y)\r\n e[y].append(x) \r\n \r\ndef bfs(v):\r\n mark = defaultdict(int)\r\n q = Q()\r\n q.put(v)\r\n mark[v] = 1\r\n while not q.empty():\r\n v = q.get()\r\n for i in e[v]:\r\n if mark[i] == 0:\r\n mark[i] = mark[v]*(-1)\r\n q.put(i)\r\n return sum(value==1 for value in mark.values()) \r\n\r\na = bfs(1)\r\nprint(a*(n-a)-(n-1))\r\n", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nn=int(input())\r\nd={i:set() for i in range(1,n+1)}\r\na=set()\r\nb=set()\r\nfor i in range(n-1):\r\n\tx,y=map(int,input().split())\r\n\td[x].add(y)\r\n\td[y].add(x)\r\n# print(d)\r\nstack=[1]\r\nwhile stack:\r\n\ti=stack.pop()\r\n\t# if i not in a and i not in b:\r\n\tif i in a:\r\n\t\ta.add(i)\r\n\t\tfor j in d[i]:\r\n\t\t\tb.add(j)\r\n\t\t\td[j].remove(i)\r\n\t\t\tstack.append(j)\r\n\telse:\r\n\t\tb.add(i)\r\n\t\tfor j in d[i]:\r\n\t\t\ta.add(j)\r\n\t\t\td[j].remove(i)\r\n\t\t\tstack.append(j)\r\n\r\n# print(a,b)\r\nprint(len(a)*len(b)-n+1)", "def main():\r\n n = int(input())\r\n\r\n edges_dict = {}\r\n for _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n if u not in edges_dict:\r\n edges_dict[u] = [v]\r\n else:\r\n edges_dict[u].append(v)\r\n\r\n if v not in edges_dict:\r\n edges_dict[v] = [u]\r\n else:\r\n edges_dict[v].append(u)\r\n\r\n colors_dict = {1: 0}\r\n\r\n bfs_set = {1}\r\n while len(bfs_set) > 0:\r\n temp_set = set()\r\n for node in bfs_set:\r\n for neighbor in edges_dict[node]:\r\n if neighbor not in colors_dict:\r\n colors_dict[neighbor] = 1 - colors_dict[node]\r\n temp_set.add(neighbor)\r\n bfs_set = temp_set\r\n\r\n zero_nodes = list(colors_dict.values()).count(0)\r\n one_nodes = n - zero_nodes\r\n expected_edges = zero_nodes * one_nodes\r\n\r\n print(expected_edges - (n - 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import string\nimport sys\n# sys.setrecursionlimit(1000000)\n# sys.stdin = open(\".in\", \"r\")\n# sys.stdout = open(\".out\", \"w\")\ninput = sys.stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n sys.stdout.write(sep.join(map(str, args)) + end)\ndef map_int():\n return map(int, input().split())\ndef list_int():\n return list(map(int, input().split()))\nfrom collections import defaultdict, deque, Counter\nfrom math import sqrt, gcd, comb, perm\nfrom random import shuffle\nfrom heapq import heappop, heappush, heapify\n\ndef dfs(start, x, visited, adj):\n stack = [(start, x)]\n xcnt = 0\n ycnt = 0\n visited[start] = 1\n while stack:\n node, xx = stack.pop()\n if xx:\n xcnt += 1\n else:\n ycnt += 1\n for neighbor in adj[node]:\n if not visited[neighbor]:\n visited[neighbor] = 1\n stack.append((neighbor, not xx))\n\n return xcnt, ycnt\n\n\n\n\n\n\ndef solve():\n n = int(input())\n adj = defaultdict(list)\n for i in range(n-1):\n v1, v2 = map_int()\n adj[v1].append(v2)\n adj[v2].append(v1)\n\n visited = [0 for i in range(n+1)]\n\n xcnt, ycnt = dfs(1, True, visited, adj)\n total = xcnt*ycnt\n print(total - (n-1))\n\n\n return\n\n\n\nif __name__ == '__main__':\n # NumberOfTestcases = int(input())\n # for _ in range(NumberOfTestcases):\n solve()", "from functools import partial\r\n\r\n\r\nn = int(input())\r\nnodes = tuple(set() for _ in range(n))\r\nu = set()\r\nv = set()\r\nsets = (u, v)\r\ndiscovered = set()\r\nfor _ in range(n - 1):\r\n i, j = [int(i) - 1 for i in input().split()]\r\n nodes[i].add(j)\r\n nodes[j].add(i)\r\n\r\n\r\ndef discover(index: int, set_index: int) -> bool:\r\n if index in discovered:\r\n return True\r\n\r\n sets[set_index].add(index)\r\n discovered.add(index)\r\n for node in nodes[index]:\r\n functions.append(partial(discover, node, 1 - set_index))\r\n\r\n return False\r\n\r\n\r\nfunctions = [partial(discover, 0, 0)]\r\nwhile functions:\r\n results = [func() for func in functions]\r\n if all(results):\r\n break\r\n\r\nprint(len(u) * len(v) - n + 1)\r\n", "from collections import deque\r\ndef is_bipartite():\r\n visited = [False] * (n+1)\r\n black = set()\r\n white = set()\r\n def BFS_colouring(start):\r\n q = deque([start])\r\n visited[start] = True\r\n black.add(start)\r\n while q:\r\n parent = q.popleft()\r\n for child in graph[parent]:\r\n if (not visited[child]):\r\n visited[child] = True\r\n q.append(child)\r\n if (parent in black):\r\n white.add(child)\r\n else:\r\n black.add(child)\r\n for i in range(1,n+1):\r\n if not visited[i]:\r\n BFS_colouring(i)\r\n for parent in black:\r\n for child in graph[parent]:\r\n if child in black:\r\n return False,set(),set()\r\n for parent in white:\r\n for child in graph[parent]:\r\n if child in white:\r\n return False,set(),set()\r\n return True,black,white\r\n\r\nn=int(input())\r\ngraph=[[] for _ in range(n+1)]\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nans=is_bipartite()\r\nprint(len(ans[1])*len(ans[2])-(n-1))\r\n\r\n\r\n# input example\r\n# 10 11\r\n# 0 1\r\n# 0 3\r\n# 0 2\r\n# 1 4\r\n# 3 5\r\n# 5 7\r\n# 3 6\r\n# 2 8\r\n# 8 9\r\n# 9 10\r\n# 4 1\r\n\r\n\r\n", "inf = float('inf')\n\ndef solution():\n n = int(input())\n ans = 0\n adj = [set() for i in range(n)]\n unvisited = set(range(n))\n color = list(range(n))\n color[0] = 1\n\n for _ in range(n-1):\n edge = list(map(int, input().split()))\n adj[edge[0]-1].add(edge[1]-1)\n adj[edge[1]-1].add(edge[0]-1)\n\n def dfs(s):\n to_visit = [s]\n while to_visit:\n current = to_visit.pop()\n for next in adj[current]:\n if next in unvisited:\n color[next] = (not color[current])\n unvisited.remove(next)\n to_visit.append(next)\n \n # print(color)\n dfs(0)\n tCt = color.count(True)\n # print(color)\n print(tCt * (n - tCt) - (n - 1))\n\n\nif __name__ == \"__main__\":\n solution()", "double_graph = {}\r\nn = int(input())\r\nR = set()\r\nL = set()\r\nfor i in range(n-1):\r\n a1, a2 = input().split()\r\n if a1 not in double_graph.keys():\r\n double_graph[a1] = []\r\n if a2 not in double_graph.keys():\r\n double_graph[a2] = []\r\n double_graph[a1].append(a2)\r\n double_graph[a2].append(a1)\r\n \r\nstack = [('1', 0)]\r\nvisited = {'1'}\r\nL_R = [0, 0]\r\n \r\nwhile stack:\r\n a1, count = stack.pop()\r\n L_R[count] += 1\r\n for a2 in double_graph[a1]:\r\n if a2 not in visited:\r\n stack.append((a2, 1 - count))\r\n visited.add(a2)\r\n \r\nans = L_R[0]*L_R[1] - n + 1\r\nprint(ans)", "def solve(vertices,edge) :\r\n table = {i:[] for i in range(1,vertices+1)}\r\n visited = [False]*(vertices+1)\r\n setA = 0\r\n setB = 0\r\n putSetA = True\r\n \r\n for i,j in edge :\r\n table[i].append(j)\r\n table[j].append(i)\r\n \r\n queue = [edge[0][0]]\r\n \r\n while len(queue) > 0 :\r\n index = 0\r\n length = len(queue)\r\n while index < length :\r\n if visited[queue[index]]:\r\n index += 1\r\n continue\r\n if putSetA :\r\n setA += 1 \r\n else :\r\n setB += 1\r\n queue.extend(table[queue[index]])\r\n visited[queue[index]] = True\r\n index += 1\r\n \r\n queue = queue[index:]\r\n if putSetA :\r\n putSetA = False\r\n else :\r\n putSetA = True\r\n \r\n \r\n \r\n return (setA*setB)-(vertices-1)\r\n \r\n\r\nv = int(input())\r\ned = []\r\nfor _ in range(v-1):\r\n ed.append(list(map(int,input().split())))\r\n\r\nprint (solve(v,ed))\r\n \r\n \r\n \r\n \r\n ", "from collections import defaultdict\r\n\r\nG = defaultdict(set)\r\nn = int(input())\r\n\r\nfor _ in range(n-1):\r\n U, V = input().split()\r\n G[U].add(V)\r\n G[V].add(U)\r\n\r\nstack = [('1', 0)]\r\nseen = {'1'}\r\nc = [0, 0]\r\n\r\nwhile stack:\r\n U, x = stack.pop()\r\n c[x] += 1\r\n for V in G[U]:\r\n if V not in seen:\r\n stack.append((V, 1-x))\r\n seen.add(V)\r\n\r\nprint(c[0]*c[1] - n + 1)", "n=int(input());l=[1]+[0]*n;d=[[]for _ in range(n)];c=[0]\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split());d[a-1]+=[b-1];d[b-1]+=[a-1]\r\nwhile c:\r\n x=c.pop()\r\n for y in d[x]:\r\n if not l[y]:\r\n c+=[y];l[y]=-l[x]\r\nr=l.count(1);print(r*(n-r)-n+1)", "# http://codeforces.com/contest/862/problem/B\n \nfrom collections import deque\n \nn = int(input())\n \ngraph = dict((i, set()) for i in range(1, n + 1))\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].add(v)\n graph[v].add(u)\n \nred = set()\npurple = set()\n \nvisited = {1}\nQ = deque([(1, True)])\n \nwhile Q:\n cur, label = Q.popleft()\n \n if label:\n red.add(cur)\n else:\n purple.add(cur)\n \n for nei in graph[cur]:\n if nei not in visited:\n visited.add(nei)\n Q.append((nei, not label))\n\nprint(sum(len(purple) - len(graph[r]) for r in red))", "import queue\r\n\r\ndef read():\r\n n = int(input())\r\n edges = []\r\n for i in range(n - 1):\r\n edges.append(tuple(map(int, input().split(' '))))\r\n return (n, edges)\r\n\r\ndef parse_matrix(n, edges):\r\n matrix = [[0 for i in range(n + 1)] for j in range(n + 1)]\r\n for a, b in edges:\r\n matrix[a][b] = 1\r\n matrix[b][a] = 1\r\n return matrix\r\n\r\ndef parse_relations(n, edges):\r\n relations = {}\r\n for a, b in edges:\r\n if not relations.get(a):\r\n relations[a] = []\r\n if not relations.get(b):\r\n relations[b] = []\r\n relations[a].append(b)\r\n relations[b].append(a)\r\n return relations\r\n\r\ndef chop(relations, res, fr, flag):\r\n q = queue.Queue()\r\n q.put(fr)\r\n res[fr] = flag\r\n #new_s_to = s2 if s_to == s1 else s1\r\n while not q.empty():\r\n fr = q.get()\r\n flag = 3 - res[fr]\r\n for v in relations[fr]:\r\n if res[v] == 0:\r\n q.put(v)\r\n #s_to.add(v)\r\n res[v] = flag\r\n #chop(relations, s1, s2, v, new_s_to)\r\n\r\ndef compute(n, edges):\r\n # matrix = parse_matrix(n, edges)\r\n relations = parse_relations(n, edges)\r\n\r\n #s1, s2 = set(), set()\r\n res = [0] * (n + 1)\r\n chop(relations, res, 1, 1)\r\n s1, s2 = 0, 0\r\n for i in res[1:]:\r\n if i == 1:\r\n s1 += 1\r\n else:\r\n s2 += 1\r\n\r\n return s1 * s2 - (n - 1)\r\n\r\nn, edges = read()\r\nnew_edges_count = compute(n, edges)\r\n\r\nprint(new_edges_count)\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\ndef process(n, G):\r\n info = [None for i in range(n+1)]\r\n g = [[] for i in range(n+1)]\r\n for u, v in G:\r\n g[u].append(v)\r\n g[v].append(u)\r\n start = [1]\r\n info[1] = 0 \r\n while len(start) > 0:\r\n next_s = []\r\n for x in start:\r\n for y in g[x]:\r\n if info[y] is None:\r\n info[y] = 1-info[x]\r\n next_s.append(y)\r\n start = next_s \r\n a, b = 0, 0\r\n for i in range(1, n+1):\r\n if info[i]==0:\r\n a+=1 \r\n else:\r\n b+=1 \r\n answer = a*b-(n-1)\r\n sys.stdout.write(f'{answer}\\n')\r\nn = int(input())\r\nG = []\r\nfor i in range(n-1):\r\n u, v = [int(x) for x in input().split()]\r\n G.append([u, v])\r\nprocess(n, G)", "import sys\r\nfrom collections import defaultdict\r\n \r\ninput = __import__('sys').stdin.readline\r\n# sys.setrecursionlimit(10**5)\r\n# def dfs(node,anode,color):\r\n# global cnt\r\n# cnt[color] += 1\r\n# for x in adj[node]:\r\n# if x != anode:\r\n# dfs(x,node,color ^ 1)\r\n \r\nadj = defaultdict(list)\r\nn = int(input())\r\nfor i in range(n-1):\r\n u,v = map(int,input().split())\r\n u -= 1\r\n v -= 1\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\ncolor = [-1] * n\r\nfor i in range(n):\r\n if color[i] == -1:\r\n color[i] = 0\r\n stack = [i]\r\n while stack:\r\n node = stack.pop()\r\n for x in adj[node]:\r\n if color[x] == -1:\r\n color[x] = 1 - color[node]\r\n stack.append(x)\r\nleft = color.count(0)\r\nright = n - left\r\n \r\nprint(left * right - (n-1))", "from collections import deque, defaultdict\r\ntyp = defaultdict(int)\r\np = defaultdict(list)\r\n\r\nn = int(input())\r\nfor _ in range(n-1):\r\n tmp = list(map(int,input().split()))\r\n u, v = tmp[0], tmp[1]\r\n p[u].append(v)\r\n p[v].append(u)\r\n \r\ndeq = deque()\r\ndeq.append((1,1))\r\n\r\ns1 = 0\r\ns2 = 0\r\nwhile len(deq):\r\n cur = deq.popleft()\r\n v, t = cur[0], cur[1]\r\n typ[v] = t\r\n if t == 1:\r\n s1 += 1\r\n else:\r\n s2 += 1\r\n for i in p[v]:\r\n if not typ[i]:\r\n deq.append((i,(t*2)%3))\r\nprint(s1*s2-n+1)", "def BFS(s,Adj):\r\n level = {s:0}\r\n parent = {s:None}\r\n even_count = 1\r\n odd_count = 0\r\n i=1\r\n frontier = [s]\r\n while frontier:\r\n next1 = []\r\n for u in frontier:\r\n for v in Adj[u]:\r\n if v not in level:\r\n level[v] = i\r\n if i%2 == 0:\r\n even_count += 1\r\n else:\r\n odd_count += 1\r\n parent[v] = u\r\n next1.append(v)\r\n frontier = next1\r\n i += 1\r\n return (even_count, odd_count)\r\nn = int(input())\r\nadj_list = [[] for j in range(n+1)]\r\nfor i in range(n-1):\r\n u, v = map(int, input().split())\r\n adj_list[u].append(v)\r\n adj_list[v].append(u)\r\ne, o = BFS(1, adj_list)\r\nprint(e*o - n + 1)", "from collections import defaultdict\r\nn=int(input())\r\n#d=defaultdict(list)\r\nd=[[]for _ in range(n)]\r\nfor _ in range(n-1):\r\n a,b=input().split(\" \")\r\n a=int(a)\r\n b=int(b)\r\n d[a-1]+=[b-1]\r\n d[b-1]+=[a-1]\r\n\r\n\r\nvisited=[1]+[0]*n\r\nqueue=[0]\r\n#number=[1]+[0]*n\r\n\r\nwhile queue:\r\n k=queue.pop()\r\n for i in d[k]:\r\n if not visited[i]:\r\n visited[i]=-visited[k]\r\n queue+=[i]\r\n\r\nk=visited.count(1)\r\nprint(k*(n-k)-n+1)\r\n", "n = int(input())\nadj = [[] for i in range(n)]\nfor i in range(n - 1):\n a, b = map(int, input().split())\n adj[a - 1].append(b - 1)\n adj[b - 1].append(a - 1)\nvisited = [0] * n\nvalue = [-1] * n\nq = [0]\nvalue[0] = 0\nwhile q:\n x = q.pop(0)\n for u in adj[x]:\n if visited[u] == 0:\n visited[u] = 1\n q.append(u)\n value[u] = 1 - value[x]\nl = value.count(0)\nr = value.count(1)\nprint(l * r - (n-1))", "n = int(input())\r\ne = {}\r\n\r\nfor i in range(n-1):\r\n a, b = map(int, input().split(' '))\r\n \r\n x = e.get(a, [])\r\n x.append(b)\r\n e[a] = x\r\n x = e.get(b, [])\r\n x.append(a)\r\n e[b] = x\r\n\r\nx = 1\r\ny = 0\r\n\r\ntemp1 = [1]\r\ntemp2 = []\r\nseen = set()\r\nk = 0\r\nwhile len(temp1) > 0:\r\n for i in temp1:\r\n seen.add(i)\r\n for j in e[i]:\r\n if j not in seen:\r\n temp2.append(j)\r\n if k%2 == 0: y += 1\r\n else: x += 1\r\n \r\n temp1 = temp2\r\n temp2 = []\r\n k += 1\r\nprint(x*y-n+1)", "import os, sys\r\nfrom collections import *\r\n\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):\r\n\r\n self.gdict[node1].append(node2)\r\n self.gdict[node2].append(node1)\r\n\r\n def bfs_util(self, v):\r\n self.visit, color = [False] * (n + 1), [1, 0]\r\n queue, self.visit[v] = deque([(v, 0)]), True\r\n\r\n while queue:\r\n s, c = queue.popleft()\r\n\r\n for i1 in self.gdict[s]:\r\n if self.visit[i1] == False:\r\n queue.append((i1, c ^ 1))\r\n self.visit[i1] = True\r\n color[c ^ 1] += 1\r\n\r\n print(color[0] * color[1] - (n - 1))\r\n\r\n\r\ninput = sys.stdin.buffer.readline\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\nceil1 = lambda a, b: (a + b - 1) // b\r\n\r\nn = int(input())\r\ng = graph(n)\r\nfor i in range(n - 1):\r\n u, v = inp(int)\r\n g.addEdge(u, v)\r\ng.bfs_util(1)\r\n", "from queue import Queue\r\n\r\nn = int(input())\r\ngraph = [[] * n for _ in range(n)]\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n graph[u - 1].append(v - 1)\r\n graph[v - 1].append(u - 1)\r\nqueue = Queue()\r\ndistance = [-1] * n\r\nfor i in range(n):\r\n if distance[i] == -1:\r\n distance[i] = 0\r\n queue.put(i)\r\n while not queue.empty():\r\n u = queue.get()\r\n for v in graph[u]:\r\n if distance[v] == -1:\r\n distance[v] = 1 - distance[u]\r\n queue.put(v)\r\nleft = distance.count(0)\r\nright = n - left\r\nprint(left * right - (n - 1))", "n = int(input())\r\narr = {}\r\nfor i in range(1, n + 1):\r\n arr[i] = []\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n arr[u].append(v)\r\n arr[v].append(u)\r\n\r\ncolor = [0] * (n + 1)\r\nrec = [0] * (n + 1)\r\n\r\nf = [1]\r\ns = set()\r\nwhile len(f) > 0:\r\n num = f.pop()\r\n s.add(num)\r\n for i in arr[num]:\r\n color[i] = int(color[num] == 0)\r\n if i not in s:\r\n f.append(i)\r\n\r\none = 0\r\nzero = 0\r\nfor i in range(1, n + 1):\r\n if color[i] == 1:\r\n one += 1\r\n else:\r\n zero += 1\r\n\r\nres = 0\r\nfor v in arr:\r\n if color[v] == 1:\r\n res += zero - len(arr[v])\r\n else:\r\n res += one - len(arr[v])\r\nprint(res // 2)\r\n", "n=int(input())\r\nd={}\r\nfor i in range(1,n+1):\r\n d[i]=[]\r\n \r\nfor _ in range(n-1):\r\n u,v=map(int,input().split(\" \"))\r\n d[u].append(v)\r\n d[v].append(u)\r\n\r\n\r\narr=[-1]*(n+1)\r\n#print(d)\r\nvisited=[False]*(n+1)\r\n \r\nstack=[1]\r\nvisited[1]=True\r\narr[1]=0\r\nwhile len(stack)!=0:\r\n x=stack.pop(0)\r\n for i in d[x]:\r\n if not visited[i]:\r\n arr[i]=1-arr[x]\r\n stack.append(i)\r\n visited[i]=True\r\n\r\nzero=0\r\none=0\r\nfor i in range(1,n+1):\r\n if arr[i]==0:\r\n zero+=1\r\n else:\r\n one+=1\r\n \r\nprint(zero*one-(n-1))", "def bfs(d):\r\n queue = [[0,0]]\r\n mark = {i:False for i in range(n)}\r\n part1,part2 = 0,0\r\n while queue:\r\n q = queue.pop(0)\r\n v,e = q[0],q[1]\r\n if e==0:\r\n part1+=1\r\n else:\r\n part2+=1\r\n e = 1-e\r\n mark[v]=True\r\n for i,x in enumerate(d[v]):\r\n if mark[x]==False:\r\n queue.append([x,e])\r\n return part1,part2\r\nn = int(input())\r\nd = {}\r\nfrom sys import stdin\r\nfor i in range(n-1):\r\n a,b = map(int,stdin.readline().split())\r\n a,b=a-1,b-1\r\n if d.get(a)==None:\r\n d[a]=[]\r\n if d.get(b)==None:\r\n d[b]=[]\r\n d[a].append(b)\r\n d[b].append(a)\r\npart1,part2 = bfs(d)\r\nprint(part1*part2-n+1)", "n = int(input())\r\ncolors = [-1 for _ in range(n + 1)]\r\n\r\ngraph = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = [int(n) for n in input().split()]\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n \r\nstack = [(1, 1)]\r\nwhile stack:\r\n node, col = stack.pop()\r\n if colors[node] == -1:\r\n colors[node] = col\r\n for ngh in graph[node]:\r\n stack.append((ngh, 1 - col))\r\n\r\nprint(colors.count(1) * colors.count(0) - (n - 1))\r\n", "'''\r\nsubmitted by Aanchal Tiwari:\r\n“Good Morning :)\"\r\n'''\r\n\r\n\r\ndef dfs(node, c):\r\n visited[node] = True\r\n stack = [node]\r\n while stack:\r\n node = stack.pop()\r\n for child in g[node]:\r\n if visited[child] == False:\r\n color[child] = color[node] ^ 1\r\n stack.append(child)\r\n visited[child] = True\r\n return color\r\nn = int(input())\r\ng = {i: [] for i in range(1, n+1)}\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\ncolor = [0 for i in range(n+1)]\r\nvisited = [False for i in range(n + 1)]\r\nfor i in range(1, n + 1):\r\n if visited[i] == False:\r\n color = dfs(i, color[i])\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(1, n + 1):\r\n if color[i] == 0:\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nprint(c1*c2-(n-1))\r\n", "from collections import defaultdict , deque\r\n\r\nd = defaultdict(set)\r\na ,b , visited = set({1}) , set() , set({1})\r\nq = deque({1})\r\nn = int(input())\r\nfor _ in range(n-1):\r\n x,y = list(map(int , input().split()))\r\n d[x].add(y)\r\n d[y].add(x)\r\n\r\nwhile q:\r\n e = q.popleft()\r\n if e in a:\r\n to_add = b\r\n else:\r\n to_add = a\r\n for element in d[e]:\r\n if element not in visited:\r\n visited.add(element)\r\n q.append(element)\r\n to_add.add(element)\r\n\r\nprint(((len(a)*len(b))-(n-1)))\r\n", "n=int(input())\r\nd={}\r\ns1=set()\r\ns2=set()\r\nans=0\r\nfor _ in range(n-1):\r\n\tu,v=map(int,input().split())\r\n\tif u not in d:\r\n\t\td[u]={v}\r\n\telse:\r\n\t\td[u].add(v)\r\n\tif v not in d:\r\n\t\td[v]={u}\r\n\telse:\r\n\t\td[v].add(u)\r\nstack = [1]\r\nwhile stack:\r\n\ti=stack.pop()\r\n\r\n\tif i in s1:\r\n\t\tfor j in d[i]:\r\n\t\t\ts2.add(j)\r\n\t\t\td[j].remove(i)\r\n\t\t\tstack.append(j)\r\n\telse:\r\n\t\ts2.add(i)\r\n\t\tfor j in d[i]:\r\n\t\t\ts1.add(j)\r\n\t\t\td[j].remove(i)\r\n\t\t\tstack.append(j)\r\nprint((len(s1)*len(s2))-(n-1))", "import sys\nfrom collections import defaultdict, Counter, deque\nsys.setrecursionlimit(1000000000)\n \n \ndef bfs(graph,s,colors,counter):\n dequeNodes = deque()\n colors[s] = True\n counter[True]+=1\n dequeNodes.append(s)\n while len(dequeNodes):\n u = dequeNodes.popleft()\n for v in graph[u].keys():\n if colors.get(v,\"NO\") == \"NO\":\n colors[v] = not colors[u]\n counter[colors[v]]+=1\n dequeNodes.append(v)\n \n\n \n \ndef solver(graph, n):\n colors = dict()\n counter = Counter()\n for node in range(1, n+1):\n if colors.get(node, \"NO\") == \"NO\" and graph.get(node, False) != False:\n bfs(graph,node, colors, counter)\n \n # print(counter)\n return (counter[False]*counter[True])-(n-1)\n \n \ndef main():\n input = sys.stdin.readline\n n = int(input())\n graph = defaultdict(dict)\n for _ in range(n-1):\n u, v = map(int, input().split())\n graph[u][v] = 1\n graph[v][u] = 1\n \n print(solver(graph, n))\n \n \nmain()", "def main():\r\n n = int(input())\r\n adj_list = {i: [] for i in range(n + 1)[1:]}\r\n for i in range(n - 1):\r\n u, v = [int(inp) for inp in input().split()]\r\n adj_list[u].append(v)\r\n adj_list[v].append(u)\r\n visited = {i: False for i in range(n + 1)[1:]}\r\n node_type = {i: None for i in range(n + 1)[1:]}\r\n node_1, node_2 = [0, 0]\r\n\r\n stack = []\r\n stack.append(1)\r\n visited[1] = True\r\n node_type[1] = 1\r\n node_1 += 1\r\n\r\n while stack:\r\n v = stack.pop()\r\n\r\n for nbr in adj_list[v]:\r\n if not visited[nbr]:\r\n visited[nbr] = True\r\n stack.append(nbr)\r\n if node_type[v] is 1:\r\n node_type[nbr] = 2\r\n node_2 += 1\r\n else:\r\n node_type[nbr] = 1\r\n node_1 += 1\r\n\r\n ans = 0\r\n for i in range(n + 1)[1:]:\r\n if node_type[i] is 1:\r\n ans += (node_2 - len(adj_list[i]))\r\n else:\r\n ans += (node_1 - len(adj_list[i]))\r\n\r\n print(ans // 2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def main():\r\n n = int(input())\r\n tree = [[] for _ in range(n)]\r\n for _ in range(n-1):\r\n u, v = read_ints()\r\n u -= 1\r\n v -= 1\r\n tree[u].append(v)\r\n tree[v].append(u)\r\n\r\n queue = [(1, 0)]\r\n set1 = {0}\r\n set2 = set()\r\n for set_id, node in queue:\r\n for child in tree[node]:\r\n if child in set1 or child in set2:\r\n continue\r\n\r\n idx = 1 if set_id == 2 else 2\r\n\r\n if idx == 1:\r\n set1.add(child)\r\n else:\r\n set2.add(child)\r\n\r\n queue.append((idx, child))\r\n\r\n ans = len(set1) * len(set2) - n + 1\r\n print(ans)\r\n\r\n\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n import sys\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n main()\r\n", "from collections import defaultdict\r\nh=defaultdict(list)\r\nn = int(input())\r\nfor _ in range(n-1):\r\n\r\n x,y = map(int,input().split())\r\n h[x].append(y)\r\n h[y].append(x)\r\ncolor=[None for i in range(n+1)]\r\nqueue=[1]\r\ncolor[1]=1\r\nwhile queue:\r\n a = queue.pop()\r\n for i in h[a]:\r\n if color[i] is None:\r\n color[i] = 1-color[a]\r\n queue.append(i)\r\nk = color.count(1)\r\n\r\nprint((k*(n-k))-(n-1))\r\n", "n = int(input())\r\ntree = [[] for i in range(n)]\r\nfor _ in range(n - 1):\r\n a, b = list(map(int, input().split()))\r\n tree[a - 1].append(b - 1)\r\n tree[b - 1].append(a - 1)\r\n\r\nres = []\r\nlevel = [0]\r\nvisite = set([0])\r\nx = 0\r\nwhile level:\r\n x = 1 - x\r\n temp = []\r\n for i in level:\r\n for j in tree[i]:\r\n if j not in visite:\r\n visite.add(j)\r\n temp.append(j)\r\n res.append(x)\r\n level = temp\r\n\r\none = zero = ans = 0\r\nfor i in res:\r\n if i:\r\n ans += zero\r\n one += 1\r\n else:\r\n ans += one\r\n zero += 1\r\nprint(ans - n + 1)\r\n", "import bisect\nimport math\nfrom collections import deque\nimport heapq\nimport functools\nfrom queue import Queue\n\nmod = 998244353 \nN = 200005\n\ndef mul(a, b):\n\treturn (a*b)%mod\n\ndef add(a, b):\n\treturn (a+b) if (a+b<mod) else (a+b)-mod\n\ndef sub(a, b):\n\treturn (a-b) if (a-b>=0) else (a-b)+mod\n\ndef powr(a, b):\n\tans = 1\n\twhile b>0:\n\t\tif b & 1:\n\t\t\tans=mul(ans,a)\n\t\ta = mul(a,a) \n\t\tb//=2\n\treturn ans\n\ndef inv(n):\n\treturn powr(n, mod-2)\n\ndef factlist():\n\tfact = [1]\n\tfor i in range(1, N):\n\t\tfact.append(mul(fact[i-1],i))\n\treturn fact\n\ndef invfactlist(fact):\n\tinvfact=[0]*N\n\tinvfact[0]=1\n\tinvfact[N-1]= inv(fact[N-1])\n\tfor i in range(N-2, 0, -1):\n\t\tinvfact[i]= mul(invfact[i+1],(i+1))\n\t\n\treturn invfact\n\ndef rot(S):\n\treturn list(zip(*S[::-1]))\n\ndef gcd(a, b):\n\tif b==0:\n\t\treturn a\n\treturn gcd(b, a%b)\n\ndef generate():\n\tans = [0]\n\twhile ans[-1]<1000000000:\n\t\tans.append(1+ans[-1]*2)\n\treturn ans\n\n\n\ndef main():\n\tn=int(input())\n\tg=[[]*n for _ in range(n)]\n\tfor i in range(n-1):\n\t u,v=map(int,input().split())\n\t g[u-1].append(v-1)\n\t g[v-1].append(u-1)\n\tqueue=Queue()\n\td=[-1]*n\n\tfor i in range(n):\n\t if(d[i]==-1):\n\t d[i]=0\n\t queue.put(i)\n\t while(not queue.empty()):\n\t u=queue.get()\n\t for v in g[u]:\n\t if(d[v]==-1):\n\t d[v]=1-d[u]\n\t queue.put(v)\n\tl=d.count(0)\n\tr=n-l\n\tprint(l*r-(n-1))\n\n\nif __name__ == \"__main__\":\n main()\n \n\t", "import sys\r\n \r\n\r\n\r\ndef solve():\r\n n = int(sys.stdin.readline())\r\n g = [set() for _ in range(n+1)]\r\n count = 0\r\n for _ in range (n-1):\r\n a, b = map(int, sys.stdin.readline().split(' '))\r\n g[a].add(b)\r\n g[b].add(a)\r\n red, blue = set(), set()\r\n nodes = [1]\r\n #we can do this because it's a tree\r\n while nodes:\r\n node = nodes.pop()\r\n if (node not in red and node not in blue) or node in red:\r\n red.add(node)\r\n for other_node in g[node]:\r\n if other_node not in blue:\r\n blue.add(other_node)\r\n nodes.append(other_node)\r\n else:\r\n for other_node in g[node]:\r\n if other_node not in red :\r\n red.add(other_node)\r\n nodes.append(other_node)\r\n for red_node in red:\r\n count += (len(blue)) - len(g[red_node])\r\n sys.stdout.write(str(count))\r\n\r\n\r\n \r\nif __name__ == \"__main__\":\r\n solve()", "from collections import deque\r\n\r\nn = int(input())\r\n\r\nd = {}\r\n\r\nfor _ in range(n - 1):\r\n u, v = tuple(map(lambda x: int(x) - 1, input().split()))\r\n if u not in d:\r\n d[u] = []\r\n if v not in d:\r\n d[v] = []\r\n d[u].append(v)\r\n d[v].append(u)\r\n\r\nset_1 = set()\r\nset_1.add(0)\r\nans = 0\r\n\r\nq = deque()\r\nisNotVisited = [True] * n\r\nisNotVisited[0] = False\r\nq.append((d[0], False))\r\nwhile q:\r\n neighbors, isFirst = q.popleft()\r\n if isFirst:\r\n set_1.update(neighbors)\r\n for neighbor in neighbors:\r\n if isNotVisited[neighbor]:\r\n q.append((d[neighbor], not isFirst))\r\n isNotVisited[neighbor] = False\r\n\r\nfor vertex in set_1:\r\n ans += n - len(set_1) - len(d[vertex])\r\n\r\nprint(ans)\r\n", "# ---------------------------iye ha aam zindegi---------------------------------------------\r\n\r\nimport sys\r\n\r\nimport threading\r\nfrom collections import defaultdict\r\nthreading.stack_size(10**8)\r\nmod = 10 ** 9 + 7\r\nmod1 = 998244353\r\n\r\n# ------------------------------warmup----------------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nsys.setrecursionlimit(300000)\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\n\r\n# -------------------game starts now----------------------------------------------------import math\r\n\r\n\r\n\r\n# -----------------------------------------------binary seacrh tree---------------------------------------\r\n\r\n# --------------------------------------------------binary------------------------------------\r\ndef main():\r\n for _ in range(1):\r\n # for _ in range(int(input()) if True else 1):\r\n n = int(input())\r\n # n, u, r, d, l = map(int, input().split())\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 # s = list(input())\r\n # s = input()\r\n d = {}\r\n for i in range(n - 1):\r\n a, b = map(int, input().split())\r\n if a not in d:\r\n d[a] = [b]\r\n else:\r\n d[a] += [b]\r\n if b not in d:\r\n d[b] = [a]\r\n else:\r\n d[b] += [a]\r\n color = [-1] * n\r\n\r\n # print(d)\r\n def dfs(n, col):\r\n color[n - 1] = col\r\n # print('going to', d[n])\r\n for child in d[n]:\r\n if color[child - 1] == -1:\r\n dfs(child, col ^ 1)\r\n\r\n dfs(1, 1)\r\n # print(color)\r\n ans = color.count(0) * color.count(1) - n + 1 # n-1 edges are already present\r\n print(ans)\r\nt = threading.Thread(target=main)\r\nt.start()\r\nt.join()", "import sys\nimport threading\nsys.setrecursionlimit(300000)\nthreading.stack_size(10**8)\n\n\ndef main():\n def dfs(vertex, used, g, color):\n used[vertex] = color\n color *= -1\n if color == 1:\n rw[1] += 1\n else:\n rw[0] += 1\n for start in g[vertex]:\n if used[start] == 0:\n dfs(start, used, g, color)\n\n\n n = int(input())\n g = [set() for s in range(n + 1)]\n used = [0] * (n + 1)\n rw = [0] * 2\n for _ in range(n - 1):\n a, b = map(int, input().split())\n g[a].add(b)\n g[b].add(a)\n dfs(1, used, g, 1)\n print(rw[0] * rw[1] - n + 1)\n\n\n\nt = threading.Thread(target=main)\nt.start()\nt.join()\n", "from collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(list)\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split()) \r\n d[u - 1].append(v - 1)\r\n d[v - 1].append(u - 1)\r\n \r\ncolorArr = [-1] * n\r\ncolorArr[0] = 1\r\nqueue = []\r\nqueue.append(0)\r\nwhile queue:\r\n u = queue.pop()\r\n for v in d[u]:\r\n if(colorArr[v] == -1):\r\n colorArr[v] = 1 - colorArr[u]\r\n queue.append(v)\r\ns1 = colorArr.count(0)\r\ns2 = colorArr.count(1)\r\nprint(s1 * s2 - n + 1)\r\n ", "n = int(input())\nadjacency = [[] for _ in range(n)]\nfor _ in range(n - 1):\n a, b = (int(x) for x in input().split())\n adjacency[a - 1].append(b)\n adjacency[b - 1].append(a)\nvs, overall = {1}, [False] * n\nu, v, i = 1, 0, 0\noverall[0] = True\nwhile vs:\n childset = set()\n for x in vs:\n for y in adjacency[x - 1]:\n if not overall[y - 1]:\n childset.add(y)\n overall[y - 1] = True\n vs = childset\n i += 1\n if i % 2:\n v += len(vs)\n else:\n u += len(vs)\nprint(u * v - n + 1)", "n = int(input())\r\n\r\ntree = {}\r\nnode_count_edges = {}\r\nu, v = map(int, input().split())\r\ntree[u] = [v]\r\ntree[v] = [u]\r\nroot = u\r\nfor i in range(n - 2):\r\n u, v = map(int, input().split())\r\n if u not in tree: tree[u] = []\r\n if v not in tree: tree[v] = []\r\n tree[u].append(v)\r\n tree[v].append(u)\r\n\r\ncurr_nodes = [root]\r\nl = 0\r\nr = 0\r\ni = 0\r\nnode_side = {}\r\npassed = set()\r\nwhile len(curr_nodes) != 0:\r\n new_curr_nodes = []\r\n for node in curr_nodes:\r\n if node in passed:\r\n continue\r\n passed.add(node)\r\n new_curr_nodes.extend(tree[node])\r\n if i % 2 == 0:\r\n node_side[node] = 'left'\r\n else:\r\n node_side[node] = 'right'\r\n\r\n if i % 2 == 0:\r\n l += 1\r\n else:\r\n r += 1\r\n\r\n i += 1\r\n curr_nodes = new_curr_nodes\r\n\r\n\r\nans = 0\r\nfor node in tree:\r\n if node_side[node] == 'left':\r\n ans += r - len(tree[node])\r\n else:\r\n ans += l - len(tree[node])\r\n\r\nprint(ans // 2)", "#dfs\r\ndef dfs(v,lev):\r\n used[v]=1\r\n a = [0] * 2\r\n if lev:\r\n a[0] += 1\r\n else:\r\n a[1] += 1\r\n for u in g[v]:\r\n if not used[u]:\r\n b = dfs(u,lev^1)\r\n a[0] += b[0]\r\n a[1] += b[1]\r\n return a\r\n#ввод\r\nn=int(input())\r\nodd=0\r\neven=0\r\ng=[[]for i in range(n+1)]\r\nused=[0 for i in range(n+1)]\r\nlev = [0 for i in range(n + 1)]\r\nstack = []\r\nstack.append(1)\r\nfor i in range(n-1):\r\n v,u=map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\nlev[1] = 1\r\nwhile len(stack) > 0:\r\n v = stack[-1]\r\n stack.pop()\r\n for u in g[v]:\r\n if not used[u]:\r\n used[u] = True\r\n stack.append(u)\r\n lev[u] = lev[v] + 1\r\nfor i in range(1, n + 1):\r\n if lev[i] % 2 == 1:\r\n odd += 1\r\n else:\r\n even += 1\r\n\r\nprint(odd * even-(n-1))\r\n", "import sys;input=sys.stdin.readline;R=lambda:list(map(int,input().split()));I=lambda:int(input());II=lambda:input();P=lambda x:print(x);PP=lambda x:print(x,end=' ');\r\nn=I()\r\nb={1:1,-1:0}\r\na=[[]for i in range(n+1)]\r\nf=[0]*(n+1)\r\nf[1]=1\r\ns=[1]\r\nz=1\r\nfor _ in range(n-1):\r\n x,y=R()\r\n a[x].append(y)\r\n a[y].append(x)\r\nwhile s:\r\n z=s.pop()\r\n m=f[z]\r\n for i in a[z]:\r\n if not f[i]:\r\n f[i]=-m\r\n s.append(i)\r\n b[-m]+=1\r\nprint(b[1]*b[-1]-n+1)", "from collections import deque\r\n\r\nn = int(input())\r\ngraph = [[] for _ in range(n + 1)]\r\nout_degree = [0 for _ in range(n + 1)]\r\nvisited = [False for _ in range(n + 1)]\r\n\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n out_degree[v] += 1\r\n out_degree[u] += 1\r\n\r\ns = 0\r\nfor i in range(1, n + 1):\r\n if out_degree[i] > s:\r\n s = i\r\n\r\nq = deque([s])\r\none, two = [], []\r\ntemp = 1\r\n\r\nwhile len(q) > 0:\r\n size = len(q)\r\n for i in range(size):\r\n cur = q.popleft()\r\n visited[cur] = True\r\n if temp == 1:\r\n one.append(cur)\r\n else:\r\n two.append(cur)\r\n for nei in graph[cur]:\r\n if not visited[nei]:\r\n q.append(nei)\r\n temp = 3 - temp\r\n\r\n\r\nprint(max(0, len(one) * len(two) - (n - 1)))", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\ng = defaultdict(list)\r\n\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\nvis = [False]*(n+1)\r\nb = set()\r\nbb = set()\r\n\r\nd = 0\r\nstack = [[1, d]]\r\n\r\nwhile stack:\r\n\r\n cn, dt = stack.pop(0)\r\n vis[cn] = True\r\n if dt & 1:\r\n b.add(cn)\r\n else:\r\n bb.add(cn)\r\n\r\n for nn in g[cn]:\r\n if not vis[nn]:\r\n stack.append([nn, (dt+1) % 2])\r\n\r\n\r\nprint(len(b)*len(bb)-(n-1))\r\n", "WHITE, BLACK = 0, 1\r\n\r\n\r\ndef dfs(adj, node_colors):\r\n stk = [0]\r\n node_colors[0] = WHITE\r\n while stk:\r\n node = stk.pop()\r\n for i in range(len(adj[node])):\r\n if node_colors[adj[node][i]] == -1:\r\n node_colors[adj[node][i]] = 1 - node_colors[node]\r\n stk.append(adj[node][i])\r\n\r\n\r\nn = int(input())\r\nadj = [[] for _ in range(n)]\r\n\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n adj[a - 1].append(b - 1)\r\n adj[b - 1].append(a - 1)\r\n\r\nnode_colors = [-1] * n\r\ndfs(adj, node_colors)\r\nn_nodes = [node_colors.count(WHITE), node_colors.count(BLACK)]\r\n\r\nprint(sum([n_nodes[1 - node_colors[i]] - len(adj[i]) for i in range(n)]) // 2)\r\n", "from collections import deque\ndef bfs(edge_list,vis,T):\n q = deque()\n map = {0:0,1:0}\n q.append((0,0))\n vis[0] = 1\n\n while len(q)!=0:\n val,lev = q.popleft()\n map[lev]+=1\n for edge in edge_list[val]:\n if not vis[edge]:\n vis[edge] = 1\n q.append((edge,(lev+1)%2))\n return map[0]*map[1] - (T-1)\n\n\n\nT = int(input())\nedge_list = [[] for _ in range(T)]\nvis = [0 for _ in range(T)]\nfor _ in range(T-1):\n i,j = tuple(map(int,input().split()))\n edge_list[i-1].append(j-1)\n edge_list[j-1].append(i-1)\nprint(bfs(edge_list,vis,T))\n", "n = int(input())\r\ne = {}\r\n\r\nfor i in range(n-1):\r\n a, b = map(int, input().split(' '))\r\n \r\n x = e.get(a, [])\r\n x.append(b)\r\n e[a] = x\r\n x = e.get(b, [])\r\n x.append(a)\r\n e[b] = x\r\n\r\nc = set()\r\nd = set()\r\n\r\nc.add(1)\r\ntemp = [1]\r\nseen = set()\r\nwhile len(temp) > 0:\r\n i = temp.pop(0)\r\n seen.add(i)\r\n if i in c:\r\n for j in e[i]:\r\n d.add(j)\r\n if j not in seen: temp.append(j)\r\n else:\r\n for j in e[i]:\r\n c.add(j)\r\n if j not in seen: temp.append(j) \r\n\r\nx = len(c)\r\ny = len(d)\r\n\r\nprint(x*y-n+1)", "n = int(input())\r\na = [[] for i in range(n)]\r\nfor i in range(n-1):\r\n f,s = map(int, input().split())\r\n a[s-1].append(f)\r\n a[f-1].append(s)\r\n\r\nq = [1]\r\nf1 = [1] + [0] * n\r\nwhile len(q) != 0 :\r\n x = q.pop()\r\n for i in a[x-1]:\r\n if f1[i-1] == 0:\r\n q.append(i)\r\n f1[i-1] =- f1[x-1]\r\nprint(f1.count(-1) * (n-f1.count(-1)) - n+1)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\ndef bfs():\r\n q = deque([0])\r\n dist = [-1]*n\r\n dist[0] = 0\r\n \r\n while q:\r\n v = q.popleft()\r\n \r\n for nv in G[v]:\r\n if dist[nv]==-1:\r\n dist[nv] = dist[v]+1\r\n q.append(nv)\r\n \r\n return dist\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n)]\r\n\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n G[u-1].append(v-1)\r\n G[v-1].append(u-1)\r\n\r\ndist = bfs()\r\nb, w = 0, 0\r\n\r\nfor i in range(n):\r\n if dist[i]%2==0:\r\n b += 1\r\n else:\r\n w += 1\r\n \r\nprint(b*w-(n-1))", "n=int(input())\r\ngraph=[None]*(n+1)\r\nfor i in range(n-1):\r\n\tu,v=map(int,input().split())\r\n\tif graph[u]==None:\r\n\t\tgraph[u]=[v]\r\n\telse:\r\n\t\tgraph[u].append(v)\r\n\tif graph[v]==None:\r\n\t\tgraph[v]=[u]\r\n\telse:\r\n\t\tgraph[v].append(u)\r\n\r\nis_u=[None]*(n+1)\r\nfor i in range(1,n+1):\r\n\tif is_u[i]==None:\r\n\t\tis_u[i]=True\r\n\t\tstack=[i]\r\n\t\twhile stack:\r\n\t\t\ttop=stack.pop()\r\n\t\t\tvals=graph[top]\r\n\t\t\tfor j in range(len(vals)):\r\n\t\t\t\tcur=vals[j]\r\n\t\t\t\tif is_u[cur]==None:\r\n\t\t\t\t\tis_u[cur]=not is_u[top]\r\n\t\t\t\t\tstack.append(cur)\r\ncount_u=is_u.count(True)\r\nprint(count_u*(n-count_u)-(n-1))", "trie = {}\r\nedges_cnt = {}\r\nt = int(input())\r\nu, v = map(int, input().split())\r\ntrie[u] = [v]\r\ntrie[v] = [u]\r\nrt = u\r\nfor i in range(t - 2):\r\n u, v = map(int, input().split())\r\n if u not in trie: trie[u] = []\r\n if v not in trie: trie[v] = []\r\n trie[u].append(v)\r\n trie[v].append(u)\r\n\r\nnode_curr = [rt]\r\nl = 0\r\nr = 0\r\ni = 0\r\nside_node = {}\r\npassed = set()\r\nwhile len(node_curr) != 0:\r\n newnodes = []\r\n for node in node_curr:\r\n if node in passed:continue\r\n passed.add(node)\r\n newnodes.extend(trie[node])\r\n if i % 2 == 0:side_node[node] = 'left'\r\n else:side_node[node] = 'right'\r\n if i % 2 == 0:l += 1\r\n else:r += 1\r\n i += 1\r\n node_curr = newnodes\r\nans = 0\r\nfor node in trie:\r\n if side_node[node] == 'left':ans += r - len(trie[node])\r\n else:ans += l - len(trie[node])\r\nprint(ans // 2)", "import sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\ndef bipart(graph, n):\n visited = [False]*(n+1)\n index = [-1]*(n+1)\n \n index[1] = 0\n \n stack = [1]\n visited[1] = True\n while(stack):\n temp = stack.pop()\n for child in graph[temp]:\n if not visited[child]:\n stack.append(child)\n visited[child] = True\n if not index[temp]:\n index[child] = 1\n else:\n index[child] = 0\n u = 0\n v = 0\n for i in range(n+1):\n if index[i]==0:\n u+=1\n elif index[i]==1:\n v+=1\n return (u*v-n+1)\n\nn = int(input())\ngraph = defaultdict(list)\nfor i in range(n-1):\n a, b = map(int,input().split())\n graph[a].append(b)\n graph[b].append(a)\n\nprint(bipart(graph,n))\n\t \t\t\t\t\t \t\t \t \t\t\t\t \t \t", "n = int(input())\nmass = [[] for _ in range(n + 1)]\nfor _ in range(n-1):\n a, b = map(int,input().split())\n mass[a].append(b)\n mass[b].append(a)\n \nnum_class = {1:0, 0:0}\n\nnpc=[(1, 0, 0)]\nwhile npc:\n node, p_node, color = npc.pop()\n num_class[color] += 1\n for neig in mass[node]:\n if neig != p_node:\n npc.append(tuple((neig, node, 1 - color)))\n \nprint(num_class[0] * num_class[1] - n + 1)", "n = int(input())\r\n\r\nMX = 200001\r\nadj = []\r\ndis = [-1] * (n + 1)\r\nres = [1, 0]\r\nfor i in range(MX):\r\n adj.append([])\r\n\r\nfor i 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\n\r\ndef DFS(u):\r\n a = [u]\r\n dis[u] = 0\r\n while len(a) > 0:\r\n v = a.pop()\r\n for i in adj[v]:\r\n if dis[i] == -1:\r\n a.append(i)\r\n dis[i] = dis[v] ^ 1\r\n res[dis[i]] += 1\r\n\r\n\r\nDFS(1)\r\n\r\nprint(res[0] * res[1] - (n-1))\r\n", "n = int(input())\r\nl = [1] + [0] * n\r\nd = [[] for _ in range(n)]\r\nc = [0]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n d[a - 1] += [b - 1]\r\n d[b - 1] += [a - 1]\r\nwhile c:\r\n x = c.pop()\r\n for y in d[x]:\r\n if not l[y]:\r\n c += [y]\r\n l[y] = -l[x]\r\nr = l.count(1)\r\nprint(r * (n - r) - n + 1)\r\n", "from collections import defaultdict\n\nn = int(input())\n\nvisited = [0]*(n+1)\n\nd = defaultdict(int)\nm = defaultdict(list)\n\nred = 0\nblue = 0\n\nfor i in range(n-1):\n u, v = map(int, input().split())\n m[u].append(v)\n m[v].append(u)\n\nkv = (1, 1)\nstack = []\nstack.append(kv)\n\nwhile stack:\n t = stack.pop()\n tv = 0 if t[1] else 1\n visited[t[0]] = 1\n d[t[0]] = t[1]\n for v in m[t[0]]:\n if not visited[v]:\n stack.append((v, tv))\n\n\n\n\nfor k in d:\n if d[k] == 1:\n red += 1\n else:\n blue += 1\n\n# print(d, red, blue)\n\nprint(red*blue - (n-1))\n\n\t\t \t \t\t \t\t \t \t\t \t", "import sys\r\n# sys.stdin = open('input.txt', 'r')\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\ngraph = [[] for _ in range(n)]\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n\r\n# Count number of each color (using dfs)\r\n# We need a color array as we are doing iterative dfs. Alternatively, we can use a visited array\r\n# instead of a set and store the colors in there, but that is a tiny bit slower\r\ncolors = [None] * n\r\nunvisited = set(range(1, n))\r\nstack, colors[0] = [0], False\r\ncolored = not_colored = 0\r\nd = {0: colored, 1: not_colored}\r\n\r\nwhile stack:\r\n curr = stack.pop()\r\n # print(curr)\r\n curr_color = colors[curr]\r\n\r\n colored += curr_color\r\n not_colored += not curr_color\r\n\r\n for adj in graph[curr]:\r\n if adj in unvisited:\r\n stack.append(adj)\r\n unvisited.remove(adj)\r\n colors[adj] = not curr_color\r\n\r\n# print(colored, not_colored)\r\nprint((colored * not_colored) - (n-1))\r\n", "from collections import deque\r\n\r\nn = int(input())\r\ng = [[] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n u, v = u - 1, v - 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\ncolor = [-1 for _ in range(n)]\r\nstack = deque([[0, - 1]])\r\nwhile stack:\r\n v, p = stack.pop()\r\n if color[v] != -1: continue\r\n color[v] = 0 if p == -1 else (1 - color[p])\r\n for to in g[v]:\r\n stack.append([to, v])\r\n\r\nsm = sum(color)\r\nprint(sm * (n - sm) - n + 1)\r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Created on: 24/09/2020 04:03:43\r\n\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport heapq\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations, permutations\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\ndef partition(d):\r\n queue = deque([1, None])\r\n zero, one, temp = [], [], []\r\n seen = set()\r\n flag = 0\r\n while len(queue):\r\n cur = queue.popleft()\r\n if cur == None:\r\n if len(queue):\r\n queue.append(None)\r\n if flag == 0:\r\n zero.extend(temp)\r\n else:\r\n one.extend(temp)\r\n temp = []\r\n flag ^= 1\r\n elif cur not in seen:\r\n seen.add(cur)\r\n temp.append(cur)\r\n for neigh in d.get(cur, []):\r\n queue.append(neigh)\r\n return [set(one), set(zero)]\r\n\r\nn = ii1()\r\nd = {}\r\nfor i in range(n - 1):\r\n a, b = iia()\r\n d.setdefault(a, []).append(b)\r\n d.setdefault(b, []).append(a)\r\nzero, one = partition(d)\r\nres = 0\r\nfor i in zero:\r\n res += len(one) - len(d[i])\r\nprint(res)", "import itertools\r\nimport math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def bfs(s, c):\r\n color[s] = c\r\n color_count[c] += 1\r\n q = [s]\r\n it = 0\r\n\r\n while it != len(q):\r\n k = q[it]\r\n for u in g[k]:\r\n if color[u] == -1:\r\n color[u] = 1 - color[k]\r\n color_count[color[u]] += 1\r\n q.append(u)\r\n\r\n it += 1\r\n\r\n n = int(input())\r\n\r\n g = [[] for i in range(n)]\r\n\r\n for i in range(n - 1):\r\n x, y = map(int, input().split())\r\n x, y = x - 1, y - 1\r\n g[x].append(y)\r\n g[y].append(x)\r\n\r\n color = [-1 for i in range(n)]\r\n color_count = [0, 0]\r\n\r\n bfs(0, 0)\r\n\r\n print(color_count[0] * color_count[1] - n + 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "I=lambda:map(int,input().split())\r\nn,=I()\r\ng=[[]for i in' '*n]\r\nfor i in range(n-1):a,b=I();g[a-1]+=[b-1];g[b-1]+=[a-1]\r\nq=[0]\r\nl=[]\r\nu=[0]*n\r\nF=0\r\nwhile q:\r\n k=[]\r\n for d in q:\r\n if F:l+=[d]\r\n for i in g[d]:\r\n if u[i]==0:\r\n u[i]=1\r\n k+=[i]\r\n q=k\r\n F=-~-F\r\nprint(sum(n-len(l)-len(g[i]) for i in l))", "import queue\r\nn = int(input())\r\ngraph =dict.fromkeys([i+1 for i in range(n)])\r\nfor i in range(n):\r\n graph[i+1] = [i]\r\n graph[i+1].pop()\r\nfor i in range(n-1):\r\n path = list(map(int,input().split()))\r\n graph[path[0]].append(path[1])\r\n graph[path[1]].append(path[0])\r\ncntWhite = 0\r\nnodes = queue.Queue()\r\nnodes.put(1)\r\nisNotUsed = [0]*(n+1)\r\nisNotUsed[1]=1\r\nwhile not nodes.empty():\r\n cur = nodes.get()\r\n for i in graph[cur]:\r\n if isNotUsed[i]==0:\r\n nodes.put(i)\r\n isNotUsed[i]=1+(isNotUsed[cur]%2)\r\n if isNotUsed[i]==2:\r\n cntWhite+=1\r\ncntBlack = n - cntWhite\r\nprint(cntBlack*cntWhite - n+1)", "n=int(input())\r\ncolor=[ -1 for i in range(n+1)]\r\ngraph={}\r\n\r\nfor _ in range(n-1):\r\n a,b=list(map(int,input().split(\" \")))\r\n if a in graph:\r\n graph[a].append(b)\r\n else:\r\n graph[a]=[b]\r\n if b in graph:\r\n graph[b].append(a)\r\n else:\r\n graph[b]=[a]\r\n\r\nremaining=1\r\ncol=0\r\nnext=[1]\r\nwhile next!=[]:\r\n tempo=[]\r\n for node in next:\r\n color[node]=col\r\n for neighbor in graph[node]:\r\n if color[neighbor]==-1:\r\n tempo.append(neighbor)\r\n col=1-col\r\n next=tempo[:]\r\n\r\npair=color.count(0)\r\nimpair=color.count(1)\r\n\r\nprint(pair*impair-(n-1))", "import base64\r\nimport sys\r\nimport zlib\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\n# (¬‿¬)\r\nexec(zlib.decompress(base64.b64decode('eJztW1uP27gVfvevIHaBWtpR3R30pTXWAbZp0gbYBkUTtA+GYWhsakaJLAoiPZfN5r/3HN5JUbJnJpu2QAXsrCXyXHj4nQsvqQ8d6wUpuZjV6mfd8o7u7Ct/4OanoPfiri+7WdWzAxEPXd1eE932smya8qqhBfmp5qIg76iYzfpj29J+y8VBcLJCIYuu7DnN5vP5rKc71gloLHcfoXG9MV96yo+NgE9vWUvtR2CF4lbkddlwOpvtaUV0W3fkN1lVkO/K/prnyxmBx+e+KLuOtvsM+8gueUAOrFW/TNO2rG3YrmxIKNvn69R53x+pbLm7qRsayFXc8NGCoXugV8e6LHedMjWAtBw1bNUkjn1LAmvNwKL54ortH2azknPai23LLLmcgXACVCcYqohEFeSbsulpuX8g+ss3mvP6+83M2irBMtLLWdWjl3ZvywPdNqzcZ/V+Sbjoc/LbF5LTW2hZ+oM0H6FnIV9+QjIzgZIRF6ynT+D0TtIZVhxw3NAtTMDxQFvBM5yKpQTzGvhuLGPbQ3GvK/SQxS3tec3abd1WjPxAst8X5A+5m39PByfBtuKD4lZr3QGFr+C/nFSsxyZwStljUwREH+8AqQ+KdFPA6xaGUgIc1Lv/Yuny2CgjCnWM+8ynlf11FPUnpjq2OyTKcM7lVCuX8qaoIIgy/QGV+/Hdezdvr4GBgCn6M60GuPDaJP8V/lH8V0lg5ErWCv+g+jvWlwCnbQOiYRCh6hBJmgz1T6ttNcQQOlDtpSFeOa/B11yrt3af0/NAPtKHO9bvudPrmkLMLPvysEViOSIN6RAQUjOrZ6Caw0q23kw6AaEQt8i6RLZKO62bkrHwcAamuLB8xylk15kHkdua12Jb31WZzDQRAgpSLW160j6JXGUAA8aKxsqFsQC7FkJXu6OSYUEy5PWmUnHjXxjn1c/XrM89L8cn1GWhAFLlU30gDIGJgl74IeSr+noTiOFdZimeHLWcO0jC3tRZCgjbnAqdeZAf5FnF3sm0OdBSnbbQW02jjPOXhl2VTWwfp8QvSgtpAolDpU80mQUqF8Qsp5C1BSSz+ro92xDfkvflR0p27HBg6GVILKFFVGFzQ4m4Y+SqhwHeUC7RUldc0/7IOQBRpfvfYVPDWMfJnrVzxJPo2f64o6RsH3zWU7ZOGVSqL8kjA2orfBLXYlHvpW7w0wB5IcA7KIwk5Ak9CpsB888nJXsBcUS8nbbTzN6M8DiAiZyX5OQ33hflE84hjNjP1o62Lx/m2U/3Qw+XX+7x1c7A51lKG26rw64pd3R7BcXQx+2OtaJuj3QkxKhOQKJCKHwsiCEJPruYaoiXT4HGn1Be2qxrq4vq+g/5Ocs3J5m+1AqP8PXH81jWYxhYq0Y16YLiyiGCRTFEhSfPsMHmzVnYWJ+Hjc1Z2FDt43Hn+ROtTJxDONkrB78tmyMdt6WKGdnaK43nwUphngNcHaf8v2Umx+TJdDshUrZ/camY2cdlQmvmRVttz1rQ/n8DvpgzBetk+ScL3jwo7vALuSBz7DNXFICf+lD/jIjfHVWVB4bIOACL4q9lnDagnMGKXSb2VLEblON25DUHAQ29LVshy2a5ypSquwDqTIIUkKBhiUnvuz7VwxtU5s0zdi9seR0WZ/igs0XdFzgcL4cmaWxHzMwwHc4Eg0yWrqCU9yoxr4BZrhxfDdJzWmexm5KbObnVS43RaHTFWONsA5TBtoLhmAhO+NiCEOiCBuQDtdz41Lmxj9d2nmWQvx2egBqMA7wPcgGYVUmshaHWa9j49ayuGre3ZY8Dj2poyVm57MwRYRDdsWMLng0k37utGpDB1aZVYLv2Xiinuio5dRsS8P8RY/oSwh6+6IsVuUxhWilt3XUOf1GwfQG5mc8oD7U9QBW8rVqTxaZW1qOYcskjHKHeX2qozo45eREPAmKv17yC5uXAq74lbypZkOMaEbQoBcVyGtAGq8JKzzRBvBW6AsdBQVtL70jVDvjpXSspE/ej4nbQKUsmBOmNcWBwHulFE8L6AVvJ+lR6P8U4H5rHwwKShCvGFvdLcLCJHRQ1xYVKZ2bdlq2jUmGTbySKZOYIeCP+zbaqEpSnAGosl/lbIXNv23YOKih6CWMUZ3ZoDSu5k9I1tRgpvZ1Xx3kmUX35OOCXkQcbaRgaIKJ68SJL2F4vOnUoCZaglyA+ijgDcjNtrBd0n+FK2HXOyS+GfR6qh5n+A6YWiIvXNHP+k1AwwPqHJNbHKjyJx0RqUYXKCBBDk2m7xHZMUqZNqYWNyqqrUJxnylDquDnNg3EbJsRsakeBMUliyGS4n7f0HirrYrTnQN/xrh7W1x8uLpcA8QH1iKSR0SlMGncdFawL+NF2w0rV2dPd7BhkSgWvXvsm1kM6OZ4EO1VDP4dhGlDpr15s5ZdD406vWX5FJ/rPgdhDsNsLsztgJv22Dyosk2ToM88I0p8Kc7kjhyOWBdHKG5hqQSTO0/NsScFY+lDrZNoKxGHiinQ/IUn6BeSfZ7kjeuLqTJ+UBxbK5JP98JnY+9Jb2j7YisB+J3wZnwhIk/1PsFPxYPUVIsTmnOAaOV2AkViDIgTDCGCeGIJwA+P/AejrBiBY2wJREHmgXtvWYiTqoCzscH4V80mJ+Jzmh7xS4Q+/TwQ/TfaI0OcJMoEvHMcIlo0i9kbIdPR73z9MhyoZ0oJtT29XDlet/hgkuEB5ZcJNnm+mI8sNeE9De74aV9JX9tX9jnbir4rodITFRzx01DvWnb8TrHsDy/QSF7VTfjCwwRcNf+ZJz6F5TlgviMtfPN84yOY4Uvd6Qit8hmh9VgKq6rZsFBAnhD8jpUy6iMb9pIb+WYAC/ynoj108mOMW99xePbC73tEtgy9Te08mVi8CFakZjULNM3Lr6K5mOn2O5WO5f5QmwWfP7loXFYdrdXxo86iD4nH2HnD8M+PCu5gVnxnlYyrF9xT8py9riET/xG2sV33P+mx+bMHBdzd4E2MkGXmaXti9C0zNaVd5+p7D1y5WThQhbtwFSeT+xxUievP11IbiFC1eDHREC+PeBZnLndiO8RqzFFRY8mIjP3adLFzm6WkyruNXGJOBTYaf6cAbxSa/RjkRs+ObU8F5mDdqfZST221Q/V3unU5K8MLh46PhGeHQR+854dNOwJMCYchLsYm38g1geGIXP6TH6f07wCzLk3vGsRIeIPUpDZofZqLH+2GsJ95Hd89w0IC34x6BXu9+nI4q/o05x9kNAQGkauipWBJAzZ3fRID1ZIUNKlhE1w+8s6vCJ/WYevM1pZ1T6Ex91iOXjQtjjoKEV4Y3SZ3MeRYeK6QO/+SxJp41p8/+kvc7HfDw2rV3E329dMksOEtHAdKMyxjcJy9JufsZcvUVnP0O/UGdeCCwovPNtIfqUUA+1IRBj3QOTrlsZO345mvAQ16DVRYZwkFdjJWNw1CoFiRSfNgwuCY7gIJWLDHviMt87CqC7qJO6NPXDpSBLKvg4rr5Zw2LPd3TVmT6H0AssCZixx7n3PKHRAwVf0OleeY/qJzzwrvgLs0zTL9G8BA5kiLUbmuGuAc9T928KIJbBhGjA9sfG6pH+zf5AmvkoRwo4HExuoWSEFYJ6qqwGolYVPX99lBDuQiujRUJKs6zWIbq3+waRLW+pkfv6S7bsUMnb+hEBEk7FgQa4QNS4jrjWt4hhUxRSNa5Nzw5at9Q2MGNTR0nzrT/Dm4nv5C3k//olcwprgve77Txjq0CS8J4we3UFBuLWxhm9p0PULwg4K6FIQg72vtwG9z/ORv9gVaa8+zfCmQVgQ==')))\r\n\r\n@optrec('dfs')\r\ndef main():\r\n n = int(input())\r\n g = [[] for _ in range(n + 1)]\r\n for _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n cnts = [0, 0]\r\n def dfs(u, p, c):\r\n cnts[c] += 1\r\n for v in g[u]:\r\n if v != p:\r\n dfs(v, u, not c)\r\n dfs(1, 1, False)\r\n print(cnts[0] * cnts[1] - n + 1)\r\n\r\nmain()\r\n", "from collections import deque\r\n\r\ndef partition(graph):\r\n colors = [-1 for _ in graph]\r\n \r\n def search(start):\r\n q = deque([(start, 0)])\r\n colors[start] = 0\r\n \r\n while q:\r\n node, color = q.popleft()\r\n for ngh in graph[node]:\r\n if colors[ngh] == -1:\r\n q.append((ngh, 1 - color))\r\n colors[ngh] = 1 - color\r\n \r\n return True\r\n \r\n search(1)\r\n return colors\r\n\r\nn = int(input())\r\ngraph = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = [int(n) for n in input().split()]\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\ncolors = partition(graph)\r\nprint(colors.count(1) * colors.count(0) - (n - 1))\r\n", "from collections import deque\r\nimport sys\r\ndef print(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\nn=int(input())\r\ntree={}\r\ncolor={}\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split())\r\n tree.setdefault(a,set())\r\n tree.setdefault(b,set())\r\n tree[a].add(b)\r\n tree[b].add(a)\r\n#print(tree)\r\ncolor[1]=1\r\nq=deque()\r\nc=1\r\nq.append(1)\r\nwhile q:\r\n c=(c+1)%2 \r\n n1=len(q)\r\n for _ in range(n1):\r\n p=q.popleft()\r\n for child in tree[p]:\r\n if child not in color:\r\n color[child]=c \r\n q.append(child)\r\nc=0\r\nfor x in color:\r\n if color[x]==1:\r\n c+=1\r\n#print(color) \r\ngrp1=c \r\ngrp2=n-c\r\ngiven=n-1 \r\npossible= (grp1*grp2)-given\r\nprint(possible)", "from collections import defaultdict, deque\r\n\r\nvisited = set()\r\n\r\ndef solve():\r\n\r\n n = int(input())\r\n\r\n if n == 1:\r\n print(0)\r\n return\r\n\r\n graph = defaultdict(lambda: [])\r\n\r\n for i in range(n-1):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n the_node = u\r\n\r\n\r\n print(dfs(the_node, graph) - (n - 1))\r\n\r\n\r\ndef dfs(start, graph):\r\n stack = deque([(start, False)]) # Nodes to go through\r\n left = 0\r\n right = 0\r\n visited = set()\r\n\r\n while stack: # Continuously iterate while the stack is not empty\r\n\r\n current_node, flag = stack.pop()\r\n\r\n if flag:\r\n right += 1\r\n else:\r\n left += 1\r\n\r\n visited.add(current_node)\r\n\r\n for neighbour in graph[current_node]:\r\n if neighbour not in visited:\r\n stack.append((neighbour, not flag))\r\n\r\n\r\n return left * right\r\n\r\nsolve()", "# def main():\r\n# n = int(input())\r\n# answer = []\r\n# all_sets = []\r\n# digits = set()\r\n# d = dict()\r\n# for i in range((n * (n - 1) // 2)):\r\n# all_sets.append(set([int(s) for s in input().split()[1:]]))\r\n# for digit in all_sets[-1]:\r\n# digits.add(digit)\r\n# if n == 2:\r\n# for x in all_sets[0]:\r\n# print(1, x)\r\n# return\r\n# for digit in digits:\r\n# temp = []\r\n# for elem in all_sets:\r\n# if digit in elem:\r\n# temp.append(elem)\r\n# d[digit] = temp\r\n# for digit in digits:\r\n# answer.append(d[digit][0].intersection(d[digit][1]))\r\n# for i in range(len(answer)):\r\n# answer[i] = tuple(sorted(answer[i]))\r\n# answer = set(answer)\r\n# for elem in answer:\r\n# print(len(elem), *elem)\r\n#\r\n#\r\n# if __name__ == '__main__':\r\n# main()\r\n\r\nn = int(input())\r\ncolor = [0] * (n + 1)\r\na = [[] for i in range(n)]\r\nfor i in range(n - 1):\r\n f, s = map(int, input().split())\r\n a[s - 1].append(f)\r\n a[f - 1].append(s)\r\nstack = [(1, 1)]\r\nwhile stack:\r\n v,curr_color = stack.pop()\r\n if curr_color == 1:\r\n curr_color = -1\r\n else:\r\n curr_color = 1\r\n color[v] = curr_color\r\n for w in a[v - 1]:\r\n if color[w] == 0:\r\n stack.append((w, curr_color))\r\nprint(color.count(1) * color.count(-1) - (n - 1))\r\n", "from collections import defaultdict, deque\r\n\r\nn = int(input())\r\ngraph = defaultdict(set)\r\n\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n graph[a].add(b)\r\n graph[b].add(a)\r\n\r\ncolor_of = {0: 0}\r\nqueue = deque([0])\r\n\r\nwhile queue:\r\n cur = queue.popleft()\r\n for neighbor in graph[cur]:\r\n if neighbor not in color_of:\r\n color_of[neighbor] = 1 - color_of[cur]\r\n queue.append(neighbor)\r\n\r\nzeroes = len([key for key in color_of if color_of[key] == 0])\r\nones = len([key for key in color_of if color_of[key] == 1])\r\n\r\nprint(zeroes * ones - (n - 1))\r\n", "# your code goes here# your code goes here\nn = int(input())\nd = {}\npar, child = set(), set()\nfor i in range(n-1):\n\tx, y = map(int,input().split())\n\tif x not in d:\n\t\td[x] = []\n\tif y not in d:\n\t\td[y] = []\n\td[x].append(y)\n\td[y].append(x)\nstk = [1]\nwhile(len(stk)!=0):\n\tele = stk.pop()\n\tif ele in par:\n\t\tfor i in d[ele]:\n\t\t\tchild.add(i)\n\t\t\td[i].remove(ele)\n\t\t\tstk.append(i)\n\telse:\n\t\tchild.add(ele)\n\t\tfor i in d[ele]:\n\t\t\tpar.add(i)\n\t\t\td[i].remove(ele)\n\t\t\tstk.append(i)\nparl, chill = len(par), len(child)\nprint(parl * chill - n + 1)\n \t\t\t \t \t\t \t \t \t\t\t\t\t \t\t\t\t", "\r\nn = int(input())\r\n\r\ng1 = {}\r\ng2 = {}\r\n\r\ngr = [[] for i in range(n)]\r\n\r\nfor i in range(n-1):\r\n x,y = map(int,input().strip().split())\r\n gr[x-1].append(y)\r\n gr[y-1].append(x)\r\n\r\npar = {}\r\n\r\nfor i in range(n):\r\n if i+1 not in par:\r\n par[i+1] = 1\r\n g1[i+1] = 1\r\n st = [i+1]\r\n while st:\r\n u = st.pop()\r\n for x in gr[u-1]:\r\n if x not in par:\r\n par[x] = 1\r\n st.append(x)\r\n if u in g1:\r\n g2[x] = 1\r\n else:\r\n g1[x] = 1\r\n \r\n \r\n\r\n#print(g1)\r\n#print(g2)\r\nans = 0\r\nfor x in g1:\r\n ans+=n-len(g1)-len(gr[x-1])\r\n\r\nprint(ans)\r\n", "n=int(input());l=[1]+[0]*n;d=[[]for _ in range(n)];c=[0]\nfor _ in range(n-1):\n a,b=map(int,input().split());d[a-1].append(b-1);d[b-1].append(a-1)\nwhile c:\n x=c.pop()\n for y in d[x]:\n if not l[y]:\n c.append(y);l[y]=-1*l[x]\nr=l.count(1);print(r*(n-r)-n+1)\n\n\n\n# Made By Mostafa_Khaled", "from 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\nn = int(input())\r\ng = [[] for i in range(n+1)]\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n \r\nvisited = [False for _ in range(n+1)]\r\n\r\n@bootstrap\r\ndef dfs(node, prev):\r\n visited[node] = prev\r\n x = None\r\n for w in g[node]:\r\n if not visited[w]:\r\n yield dfs(w, 3 - prev)\r\n yield\r\n\r\nx = dfs(1, 1)\r\ncnt = 0\r\nfor visit in visited:\r\n if visit == 1:\r\n cnt += visit\r\n \r\nprint(cnt*(n-cnt)-n+1)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef bfs(s):\r\n q, k = [s], 0\r\n dist = [inf] * (n + 1)\r\n dist[s] = 0\r\n while len(q) ^ k:\r\n i = q[k]\r\n di = dist[i]\r\n for j in G[i]:\r\n if dist[j] == inf:\r\n q.append(j)\r\n dist[j] = di + 1\r\n k += 1\r\n return dist\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\ninf = pow(10, 9) + 1\r\ndist = bfs(1)\r\nc = 0\r\nfor i in dist[1:]:\r\n c += i % 2\r\nans = c * (n - c) - (n - 1)\r\nprint(ans)", "from collections import defaultdict\r\n\r\ndef dfs_coloring(tree, root): \r\n\r\n stack = [(root, 0)] \r\n visited = set() \r\n Color = {}\r\n while (stack): \r\n v = stack.pop() \r\n \r\n if v[0] not in visited : \r\n Color[v[0]] = v[1] \r\n visited.add(v[0]) \r\n \r\n for i in tree[v[0]] : \r\n if i not in visited : \r\n stack.append((i, 1-v[1])) \r\n \r\n return Color\r\n\r\ntree = defaultdict(list) \r\nn = int(input()) \r\nfor i in range(n-1): \r\n u, v = [int(i) for i in input().split()] \r\n tree[u].append(v) \r\n tree[v].append(u) \r\nColor = dfs_coloring(tree, 1)\r\ns1 = [i for i in Color if Color[i] == 0] \r\ns2 = [i for i in Color if Color[i] == 1] \r\nans = 0\r\n# print(s1, s2) \r\n# print(tree) \r\n#print(Color)\r\nfor i in range(len(s1)): \r\n ans += len(s2) - len(tree[s1[i]]) \r\nprint(ans)", "read = lambda: tuple(map(int, input().split()))\nn = read()[0]\neds = []\n\ng = {}\nk = {}\nfor i in range(n - 1):\n u, v = read()\n r = u\n k[v] = True\n if not u in g:\n g[u] = [v]\n else:\n g[u] += [v]\n \n if not v in g:\n g[v] = [u]\n else:\n g[v] += [u]\n \ndef req(vl, visited):\n vs = []\n for v in vl:\n if v in g and not v in visited:\n vs += [el for el in g[v] if not el in visited]\n visited[v] = True\n return vs\n\nvs = [r]\nk = 0\n\nz = [0, 1]\nvisited = {}\n\nwhile True:\n vs = req(vs, visited)\n if len(vs) == 0: break\n z[k % 2] += len(vs)\n k += 1\n \nprint(z[0] * z[1] - n + 1)\n", "def bfs():\r\n visit = [True for _ in range(n)]\r\n visit[0] = False\r\n dis = [float(\"inf\") for _ in range(n)]\r\n dis[0] = 0\r\n Q = [0]\r\n a1, a2 = 1, 0\r\n while Q:\r\n u = Q.pop(0)\r\n for v in Graph[u]:\r\n if visit[v]:\r\n visit[v] = False\r\n dis[v] = dis[u] + 1\r\n if (dis[v]) % 2 == 0:\r\n a1 += 1\r\n else:\r\n a2 += 1\r\n Q.append(v)\r\n return a1*a2 - (n-1)\r\n\r\n\r\nn = int(input())\r\n\r\nGraph = {}\r\n\r\nfor i in range(n):\r\n Graph[i] = []\r\n\r\nfor _ in range(n-1):\r\n u,v = map(int, input().split())\r\n Graph[u-1].append(v-1)\r\n Graph[v-1].append(u-1)\r\n\r\ncnt = [0,0]\r\nvisit = [True for _ in range(n)]\r\n\r\nans = bfs()\r\n\r\nprint(ans)", "import sys\r\n# sys.stdin = open(\"CFBipartiteness.in\")\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\nn = int(input())\r\nadj = {i: [] for i in range(1, n + 1)}\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\nok = True\r\ncolor = [-1] * (n + 1)\r\ndef bfs(start):\r\n global ok\r\n queue = deque([(start, 0)])\r\n while queue:\r\n current, c = queue.popleft()\r\n color[current] = c\r\n for neighbor in adj[current]:\r\n if color[neighbor] == -1:\r\n queue.append((neighbor, 1 - color[current]))\r\n # else:\r\n # if color[current] == color[neighbor]:\r\n # ok = False\r\n # return\r\n return\r\n\r\nfor i in range(1, n + 1):\r\n if color[i] == -1:\r\n bfs(i)\r\nL, R = color.count(0), color.count(1)\r\nprint(L * R - (n - 1))\r\n\r\n'''\r\neditorial:\r\nlet L be the number of elements in one color\r\nand R in the other\r\nwe can't add an edge between any 2 nodes in the same set\r\nand there are already n - 1 edges\r\nso ans = L * R - (n - 1)\r\n'''", "from collections import defaultdict\r\n \r\nn = int(input())\r\ng = defaultdict(list)\r\n \r\nfor i in range(n - 1):\r\n u , v = map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n \r\ncolored = [None] * (n + 1)\r\n \r\ncolored[1] = 1\r\ntemp = [1]\r\nwhile temp:\r\n top = temp.pop()\r\n for x in g[top]:\r\n if colored[x] == None :\r\n colored[x] = 1 - colored[top]\r\n temp.append(x)\r\nr = colored.count(1)\r\n \r\nans = r * (n - r) - n + 1\r\nprint(ans)", "from collections import defaultdict\r\nclass Graph:\r\n def __init__(self):\r\n self.graph=defaultdict(list)\r\n def addedge(self, v, w):\r\n self.graph[v].append(w)\r\n self.graph[w].append(v)\r\n #print(v,self.graph[v])\r\n\r\n def dfs(self,s):\r\n visited=[False for i in range(len(self.graph)+1)]\r\n color=[-1 for i in range(len(self.graph)+1)]\r\n\r\n stack=[]\r\n stack.append(s)\r\n color[s] = 1\r\n while len(stack)!=0:\r\n s=stack[-1]\r\n stack.pop()\r\n if(not visited[s]):\r\n #print(s,end=' ')\r\n visited[s]=True\r\n\r\n for node in self.graph[s]:\r\n if(color[s]==1):\r\n color[node]=0\r\n else:\r\n color[node]=1\r\n if(not visited[node]):\r\n stack.append(node)\r\n return color\r\nif __name__ == '__main__':\r\n n=int(input())\r\n g=Graph()\r\n for i in range(n-1):\r\n u,v=map(int,input().split())\r\n g.addedge(u,v)\r\n l=g.dfs(1)\r\n a=l.count(1)\r\n b=l.count(0)\r\n print(a*b-n+1)", "import itertools\nimport sys\nimport math\nfrom bisect import *\nfrom collections import deque\ninput = sys.stdin.readline\nfrom collections import defaultdict\nfrom collections import Counter\n# n, k = map(int, input().split())\n# lst = list(map(int, input().split()))\nn = int(input())\np = defaultdict(list)\nfor i in range(n-1):\n u, v = map(int, input().split())\n p[u].append(v)\n p[v].append(u)\ns = [1]\nvis = [-1]*n\nvis[0] = 1\nt = [1]\nm = []\ncnt = 0\nwhile len(s) != 0:\n dummy = []\n for i in s:\n for j in p[i]:\n if vis[j-1] == -1:\n vis[j-1] = 0\n dummy.append(j)\n cnt += 1\n if cnt%2 == 0:\n t += dummy\n else :\n m += dummy\n s = dummy\nans = 0\nk = len(t)\n# print(p, m, t)\nfor i in m:\n ans += k - len(p[i])\nprint(ans)" ]

[ "#!/usr/bin/env python3\n\nfrom heapq import heappop, heappush\n# from collections import defaultdict\n\n\ndef pprint(*args):\n print(*args)\n\n\ndef discard_earlier(h, pos):\n while h and h[0][1] <= pos:\n heappop(h)\n\n\nend, max_fuel, num_stations = map(int, input().strip().split(' '))\n# pprint('end', end, 'max_fuel', max_fuel, 'num_stations', num_stations)\n\nstations = []\nfor _ in range(num_stations):\n pos, price = map(int, input().strip().split(' '))\n stations.append((pos, price))\nstations = sorted(stations, reverse=True) # by pos descending (pop right)\n\npossible_stations = []\n\nfuel = max_fuel\npos = 0\nspent = 0\ncur_price = float('inf')\n\n# buys = defaultdict(lambda: 0)\n\nwhile pos + fuel < end:\n # pprint(f'{pos}m {fuel}u {spent}$ @{cur_price}$')\n # cheaper reachable with current fuel\n reach = pos + fuel\n while stations and stations[-1][0] <= reach:\n _pos, _price = stations.pop()\n # pprint(f'entering {_pos}m at {_price}$')\n heappush(possible_stations, (_price, _pos))\n discard_earlier(possible_stations, pos)\n # pprint(f'considering {possible_stations[0]}')\n if possible_stations[0][0] < cur_price:\n tar_price, tar_pos = heappop(possible_stations)\n # pprint(f'cheaper in {tar_pos}m at {tar_price}$')\n break\n else: # can't reach cheaper, need to buy\n reach = pos + max_fuel\n while stations and stations[-1][0] <= reach:\n _pos, _price = stations.pop()\n # pprint(f'entering_ {_pos}m at {_price}$')\n heappush(possible_stations, (_price, _pos))\n discard_earlier(possible_stations, pos)\n # pprint(f'considering_ {possible_stations[0]}')\n if possible_stations[0][0] < cur_price:\n tar_price, tar_pos = heappop(possible_stations)\n amount = (tar_pos - pos) - fuel\n # pprint(f'cheaper_ in {tar_pos}m at {tar_price}$')\n break\n else: # can't reach cheaper at all\n discard_earlier(possible_stations, pos)\n if pos + max_fuel >= end: # can reach end\n tar_price = float('inf')\n tar_pos = end\n amount = end - pos - fuel\n # pprint(f'buy to reach end')\n elif possible_stations: # can reach more expensive station\n tar_price, tar_pos = heappop(possible_stations)\n amount = max_fuel - fuel\n # pprint(f'buy to full')\n else: # can't reach anything\n # pprint('can\\'t reach anything')\n spent = -1\n break\n fuel += amount\n spent += amount * cur_price\n # buys[cur_price] += amount\n # pprint(f'bought {amount}u at {cur_price}$')\n # drive to target\n # pprint(f'driving {tar_pos-pos}u to {tar_pos}')\n fuel -= (tar_pos - pos)\n pos = tar_pos\n cur_price = tar_price\n\n# list(map(pprint, sorted(buys.items())))\nprint(spent)\n" ]

[ "s = input().split()\nt = s[::]\nreq = int(s[-1])\nlim = req\nS = 0\nfor i in range(len(s)):\n\tif s[i] == '?':\n\t\ts[i] = '1'\n\t\tS += 1 if i == 0 or s[i - 1] == '+' else -1\n\nif S < req:\n\tfor i in range(len(s)):\n\t\tif t[i] == '?':\n\t\t\tsign = 1 if i == 0 or s[i - 1] == '+' else -1\n\t\t\tif sign == 1:\n\t\t\t\td = min(req - S, lim - 1)\n\t\t\t\ts[i] = str(d + 1)\n\t\t\t\tS += d\nelse:\n\tfor i in range(len(s)):\n\t\tif t[i] == '?':\n\t\t\tsign = 1 if i == 0 or s[i - 1] == '+' else -1\n\t\t\tif sign == -1:\n\t\t\t\td = min(S - req, lim - 1)\n\t\t\t\ts[i] = str(d + 1)\n\t\t\t\tS -= d\nif S == req:\n\tprint(\"Possible\")\n\tprint(' '.join(s))\nelse:\n\tprint(\"Impossible\")\n\n", "'''\r\nCreated on Apr 18, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nraw = input()\r\ns = raw.replace('?', '')\r\nn =int(s.split( )[-1])\r\nm = s.count('-')\r\np = s.count('+')\r\nc = p - m\r\n'''print(\"S = \",s)\r\nprint(\"n = \",n)\r\nprint(\"m = \",m)\r\nprint(\"p = \",p)\r\nprint(\"c = \",c)'''\r\nif (p+1)*n - m < n or p+1 - m*n >n:\r\n print('Impossible')\r\nelse:\r\n print('Possible')\r\n rez = n-c \r\n s = raw[1:]\r\n #print(\"Ss = \",s)\r\n #? + ? - ? + ? + ? = 42\r\n while rez > n or rez <1:\r\n if rez>n:\r\n s = s.replace(\"+ ?\",\"+ \"+str(n),1)\r\n rez -= n-1\r\n else:\r\n s = s.replace(\"- ?\",\"- \"+str(n),1)\r\n rez += n-1\r\n print(str(rez)+s.replace('?','1'))\r\n", "import sys\n\nX = sys.stdin.read()\n\na = X.split()\n\nplus, minus = 1, 0\nfor i in a:\n\tif i=='+': plus += 1\n\tif i=='-': minus += 1\n\nN = int(a[-1])\n\ndef calcmaxv(p, m, calc): return p*N - m + calc\ndef calcminv(p, m, calc): return p - m*N + calc\n\nnow = 0\nif calcminv(plus, minus, now)>N:\n\tprint (\"Impossible\")\n\tquit()\nif calcmaxv(plus, minus, now)<N:\n\tprint (\"Impossible\")\n\tquit()\nsign = +1\nfor j in range(len(a)):\n\ti = a[j]\n\tif i=='+':\n\t\tsign = +1\n\t\tcontinue\n\tif i=='-':\n\t\tsign = -1\n\t\tcontinue\n\tif i!='?': continue\n\tmaxv = calcmaxv(plus, minus, now)\n\tif sign>0:\n\t\ta[j] = str(max(2*N-maxv, 1))\n\t\tnow += max(2*N-maxv, 1)\n\telse:\n\t\ta[j] = str(min(N, 1+maxv-N))\n\t\tnow -= min(N, 1+maxv-N)\n\tif sign>0: plus-= 1\n\telse: minus -= 1\n\nprint (\"Possible\")\nprint (\" \".join(a))\n", "#!/usr/bin/env python3\r\n\r\nimport re\r\n\r\ntry:\r\n while True:\r\n s = input()\r\n n = int(s[s.rfind(' '):])\r\n pos = s.count('+') + 1\r\n neg = s.count('-')\r\n if n * pos - neg < n or pos - n * neg > n:\r\n print(\"Impossible\")\r\n else:\r\n print(\"Possible\")\r\n need = n - (pos - neg)\r\n prev = '+'\r\n first = True\r\n for m in re.finditer(r\"[+-]\", s):\r\n if first:\r\n first = False\r\n else:\r\n print(prev, end=' ')\r\n\r\n if prev == '+' and need > 0:\r\n x = min(need + 1, n)\r\n need -= x - 1\r\n elif prev == '-' and need < 0:\r\n x = min(-need + 1, n)\r\n need += x - 1\r\n else:\r\n x = 1\r\n\r\n print(x, end=' ')\r\n prev = m.group()\r\n\r\n if not first:\r\n print(prev, end=' ')\r\n\r\n if prev == '+' and need > 0:\r\n x = min(need + 1, n)\r\n need -= x - 1\r\n elif prev == '-' and need < 0:\r\n x = min(-need + 1, n)\r\n need += x - 1\r\n else:\r\n x = 1\r\n\r\n print(x, '=', n)\r\n\r\nexcept EOFError:\r\n pass\r\n", "a = ['+'] + input().split()\r\nn, m, s0, s1 = int(a[-1]), len(a) // 2 - 1, 0, 0\r\nfor i in range(m):\r\n if a[2*i] == '+':\r\n a[2*i+1], s0, s1 = 1, s0+1, s1+n\r\n else:\r\n a[2*i+1], s0, s1 = n, s0-n, s1-1\r\nif n not in range(s0, s1+1):\r\n print('Impossible')\r\n exit()\r\nfor i in range(m):\r\n d = n - max(1, s0)\r\n a[2*i+1] += d if a[2*i] == '+' else -d\r\n s0 += d\r\nprint('Possible')\r\nprint(' '.join(map(str, a[1:])))\r\n", "def func():\r\n s=list(input().strip())\r\n plus,minus,n,st=1,0,'',0\r\n for e in s:\r\n if e == '+': plus+=1\r\n elif e == '-': minus+=1\r\n elif e == '=' or st > 0:\r\n st += 1\r\n if st > 2: n += e\r\n N = int(n)\r\n def calcmaxv(p, m, calc): return p*N - m + calc\r\n def calcminv(p, m, calc): return p - m*N + calc\r\n \r\n now = 0\r\n if calcminv(plus, minus, now)>N or calcmaxv(plus, minus, now)<N: print (\"Impossible\"); return\r\n sign = +1\r\n for j in range(len(s)):\r\n i = s[j]\r\n if i=='+':\r\n sign = +1\r\n continue\r\n if i=='-':\r\n sign = -1\r\n continue\r\n if i!='?': continue\r\n maxv = calcmaxv(plus, minus, now)\r\n if sign>0:\r\n s[j] = str(max(2*N-maxv, 1))\r\n now += max(2*N-maxv, 1)\r\n else:\r\n s[j] = str(min(N, 1+maxv-N))\r\n now -= min(N, 1+maxv-N)\r\n if sign>0: plus-= 1\r\n else: minus -= 1\r\n \r\n print (\"Possible\")\r\n print (\"\".join(s))\r\n\r\ndef init(flag=True):\r\n for _ in range(int(input()) if flag else 1):\r\n func()\r\n\r\nif __name__ == '__main__':\r\n init(0)", "raw = input()\r\ns = raw.replace('?','')\r\nn = int(s.split(' ')[-1])\r\nm = s.count('-')\r\np = s.count('+')\r\nc = p - m\r\n\r\nif (p+1)*n - m < n or p+1 - m*n > n:\r\n print('Impossible')\r\nelse:\r\n print('Possible')\r\n acc = n-c\r\n s = raw[1:]\r\n while acc > n or acc < 1:\r\n if acc > n:\r\n s = s.replace(\"+ ?\", \"+ \" + str(n), 1)\r\n acc -= n-1\r\n else:\r\n s = s.replace(\"- ?\", \"- \" + str(n), 1)\r\n acc += n-1\r\n print(str(acc) + s.replace('?', '1'))", "s = input().split()\r\nplus = 1\r\nminus = 0\r\nfor c in s:\r\n\tif (c == '+') : \r\n\t\tplus += 1\r\n\tif (c == '-') : \r\n\t\tminus += 1\r\n\r\nn = int(s[len(s) - 1])\r\nmx = plus * n - minus\r\nmn = plus - n * minus\r\nnow = n - (plus - minus)\r\n\r\nif (n > mx or n < mn): \r\n print(\"Impossible\")\r\n exit()\r\n\r\npre = '+'\r\nprint(\"Possible\")\r\nfor c in s: \r\n if (c == '?'):\r\n if (pre == '+') :\r\n val = 1\r\n if (now > 0) : \r\n val = min(n-1, now) + 1 \r\n now -= val - 1\r\n print(val, end = ' ')\r\n if (pre == '-'):\r\n val = 1\r\n if (now < 0) : \r\n val = min(abs(n)-1, abs(now)) + 1\r\n now += val - 1\r\n print(val, end = ' ')\r\n else :\r\n print(c, end = ' ')\r\n pre = c\r\n", "sgn, a, b = 1, 0, 0\r\nsol = \"\"\r\nok = 0\r\nfor ch in input().split():\r\n if ch == '?':\r\n if sgn == 1:\r\n a += 1\r\n ch = 'P'\r\n else:\r\n b += 1\r\n ch = 'M'\r\n elif ch == '+':\r\n sgn = 1\r\n elif ch == '-':\r\n sgn = -1\r\n elif ch != '=':\r\n n = int(ch)\r\n ok = 1\r\n if not ok:\r\n sol += ch\r\npl, mn = [n]*a, [1]*b\r\ns = n*a-b\r\ni, j = 0, 0\r\nwhile s > n and (i < a or j < b):\r\n if i < a:\r\n amt = min(s-n, n-1)\r\n pl[i] -= amt\r\n s -= amt\r\n i += 1\r\n else:\r\n amt = min(s-n, n-1)\r\n mn[j] += amt\r\n s -= amt\r\n j += 1\r\nif s != n:\r\n print(\"Impossible\")\r\nelse:\r\n print(\"Possible\")\r\n for ch in sol:\r\n if ch != 'P' and ch != 'M':\r\n print(ch, end = ' ')\r\n elif ch == 'P':\r\n print(pl[-1], end = ' ')\r\n pl.pop()\r\n else:\r\n print(mn[-1], end = ' ')\r\n mn.pop()\r\n print(n)", "s=input()\r\na=s.split()\r\n\r\ntot=0\r\nb=[1 if x=='?' else x for x in a]\r\nfor i,x in enumerate(b):\r\n if x==1:\r\n if i==0 or b[i-1]=='+':\r\n tot+=1\r\n elif b[i-1]=='-':\r\n tot-=1\r\n\r\ngoal=int(b[-1])\r\nif tot<goal:\r\n for i,x in enumerate(b):\r\n if x==1 and i==0 or b[i-1]=='+' and tot<goal:\r\n a=min(goal-1,goal-tot)\r\n tot+=a\r\n b[i]+=a\r\n\r\nelif tot>goal:\r\n for i,x in enumerate(b):\r\n if x==1 and b[i-1]=='-' and tot>goal:\r\n a=min(goal-1,tot-goal)\r\n tot-=a\r\n b[i]+=a\r\n \r\nif tot!=goal:\r\n print(\"Impossible\")\r\nelse:\r\n print(\"Possible\")\r\n print(' '.join([str(x) for x in b]))\r\n\r\n\r\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef clamp(x, lo, hi):\n assert lo <= hi\n return max(min(x, hi), lo)\n\n\ndef rebus(R):\n n = int(R[-1])\n a = 0\n b = 0\n for i in range(1, len(R) - 2, 2):\n if R[i] == '+':\n a += 1\n else:\n b += 1\n if b > n * a or a + 1 > n * (b + 1):\n return None\n\n lo = a + 1 - n*b\n hi = n*a + n - b\n if lo > n or hi < n:\n return False\n\n for i in range(0, len(R) - 2, 2):\n assert lo <= n <= hi\n if i == 0 or R[i-1] == '+':\n lo -= 1\n hi -= n\n x = clamp(1, n - hi, n - lo)\n assert 1 <= x <= n\n lo += x\n hi += x\n R[i] = str(x)\n else:\n lo += n\n hi += 1\n x = clamp(1, lo - n, hi - n)\n assert 1 <= x <= n\n lo -= x\n hi -= x\n R[i] = str(x)\n\n assert lo == hi == n\n\n return True\n\n\ndef main():\n R = input().split()\n if rebus(R):\n print('Possible')\n print(' '.join(R))\n else:\n print('Impossible')\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", "#!/bin/python3\n\na = input()\nwhile a:\n expr, n = a.split('=')\n n = int(n.strip())\n pos = 1\n neg = 0\n sg = [1]\n for c in expr:\n if c == '+':\n pos += 1\n sg.append(1)\n elif c == '-':\n neg += 1\n sg.append(0)\n csum = pos - neg\n rez = []\n for i in sg:\n if csum < n:\n if i > 0:\n v = min(n-csum, n-1)\n csum += v\n rez.append(1+v)\n else:\n rez.append(-1)\n else:\n if i > 0:\n rez.append(1)\n else:\n v = min(csum - n, n-1)\n csum -= v\n rez.append(-1-v)\n if csum == n:\n print(\"Possible\")\n ans = str(rez[0])\n for j in rez[1:]:\n ans += \" \" + (\"+\" if j > 0 else \"-\") + \" \"\n ans += str(abs(j))\n ans += \" = \" + str(n)\n print(ans)\n else:\n print(\"Impossible\")\n break\n a = input()\n", "s = input().split()\r\n\r\nnrpoz = 0\r\nnrneg = 0\r\n\r\nfor i in s:\r\n\tif i == '+':\r\n\t\tnrpoz += 1 \r\n\tif i == '-':\r\n\t\tnrneg += 1\r\n\r\nif s[0] == '?':\r\n\tnrpoz += 1\r\n\r\nn = int(s[-1])\r\n# print(nrpoz, nrneg, n)\r\n\r\nif nrpoz * n - nrneg >= n >= nrpoz - nrneg * n:\r\n\tprint('Possible')\r\nelse:\r\n\tprint('Impossible')\r\n\texit(0)\r\n\r\nneg = []\r\npoz = []\r\n\r\nif nrpoz - nrneg > n:\r\n\t#toate pozitive o sa fie 1\r\n\t#negativele tre sa aiba suma nrpoz - n;\r\n\tpoz = [1] * nrpoz;\r\n\tneg = [1] * nrneg;\r\n\tsn = nrneg;\r\n\tfor i in range(len(neg)):\r\n\t\tif sn < nrpoz - n:\r\n\t\t\tneg[i] += min(nrpoz - n -sn, n - neg[i])\r\n\t\t\tsn += neg[i] - 1\r\nelse:\r\n\tneg = [1] * nrneg\r\n\tpoz = [1] * nrpoz\r\n\tsp = nrpoz - nrneg;\r\n\tfor i in range(len(poz)):\r\n\t\tif sp < n:\r\n\t\t\tpoz[i] += min(n - poz[i], n - sp)\r\n\t\t\tsp += poz[i] - 1\r\n\r\nsgn = '+'\r\nipoz, ineg = 0, 0\r\nfor i in s:\r\n\tif i == '?':\r\n\t\tif sgn == '+':\r\n\t\t\tprint(poz[ipoz], end = ' ')\r\n\t\t\tipoz += 1\r\n\t\telse:\r\n\t\t\tprint(neg[ineg], end = ' ')\r\n\t\t\tineg += 1\r\n\telse:\r\n\t\tsgn = i\r\n\t\tprint(i, end = ' ')", "a = list(input().split())\r\nn = int(a[-1])\r\nR = int(a[-1])\r\none, two = 0, 0\r\nfor i in range(1,len(a),2):\r\n if a[i] == '=':\r\n break\r\n if a[i] == '+':\r\n R -= 1\r\n one += 1\r\n else:\r\n R += 1\r\n two += 1\r\nR -= 1\r\none += 1\r\nif R >= 0:\r\n if one * (n - 1) >= R:\r\n print('Possible')\r\n for i in range(0, len(a), 2):\r\n if i > 0 and a[i - 1] == '=':\r\n print(a[i])\r\n else:\r\n if i == 0 or a[i - 1] == '+':\r\n print(min(n - 1, R) + 1, a[i + 1], end = ' ')\r\n R -= min(n - 1, R)\r\n else:\r\n print(1, a[i + 1], end = ' ')\r\n else:\r\n print('Impossible')\r\nelse:\r\n if two * (1 - n) <= R:\r\n print('Possible')\r\n for i in range(0, len(a), 2):\r\n if i > 0 and a[i - 1] == '=':\r\n print(a[i])\r\n else:\r\n if i > 0 and a[i - 1] == '-':\r\n print(-(max(1 - n, R) - 1), a[i + 1], end = ' ')\r\n R -= max(1 - n, R)\r\n else:\r\n print(1, a[i + 1], end = ' ')\r\n \r\n else:\r\n print('Impossible')", "def main():\n s, n = input().rsplit(sep=\"= \", maxsplit=2)\n n = int(n)\n m = s.count('-')\n p = s.count('+') + 1\n if p * n - m < n or p - m * n > n:\n print(\"Impossible\")\n return\n x = (n + m) // p\n if x:\n src = ([x + 1] * ((n + m) % p) + [x] * (p - (n + m) % p), [1] * m)\n else:\n x = (p - n) // m\n src = ([1] * p, [x + 1] * ((p - n) % m) + [x] * (m - (p - n) % m))\n res = [str(src[0].pop())]\n for c in s[2:len(s):4]:\n res.append(c)\n res.append(str(src[c == '-'].pop()))\n res.append('=')\n res.append(str(n))\n print(\"Possible\")\n print(' '.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nr=input()\r\nr,n=r.split('=')\r\nz=''\r\nfor i in r: z=z+i*(i in ['+','-'])\r\nr=z\r\nn=int(n)\r\np,v=r.count('+')+1,r.count('-')\r\nif not(p-n*v<=n<=p*n-v):\r\n print('Impossible')\r\n sys.exit()\r\nprint('Possible')\r\ns=0\r\nans=''\r\nfor i in range(len(r)):\r\n zn=1\r\n if i>0 and r[i-1]=='-': zn=-1\r\n if zn==1: p-=1\r\n else: v-=1 \r\n for x in range(1,n+1):\r\n if s+x*zn+p-n*v<=n<=s+x*zn+p*n-v:\r\n s+=x*zn\r\n zn='+' if zn==1 else '-'\r\n ans=ans+str(x)+' '+str(r[i])+' '\r\n break\r\nans=ans+str(abs(n-s))+' '\r\nprint(ans+'= '+str(n))", "l = str(input()).split(' ')\r\npos=1\r\nn=0\r\nneg=0\r\ndum=[]\r\nfor x in range(1, len(l)):\r\n\tif(l[x]=='='):\r\n\t\tn = int(l[x+1])\r\n\t\tbreak\r\n\telif l[x]=='+':\r\n\t\tpos+=1\r\n\t\tdum.append('+')\r\n\telif l[x]=='-':\r\n\t\tneg+=1\r\n\t\tdum.append('-')\r\nif neg==0:\r\n\tif(n%pos!=0):\r\n\t\tprint(\"Impossible\")\r\n\t\texit(0)\r\n\tprint(\"Possible\")\r\n\tres = \"\"\r\n\tfor i in range(pos):\r\n\t\tres += str(n//pos) + ' '\r\n\t\tif(i!=pos-1):\r\n\t\t\tres+= \"+ \"\r\n\tres += \"= \" + str(n)\r\n\tprint(res)\r\n\texit(0)\r\ntot = pos+neg\r\nps=-1\r\nys=-1\r\nmds=0\r\na1, a2=[], []\r\nfor y in range(1, n+1):\r\n\tz = n + y*neg\r\n\tif ((z+pos-1)//(pos))<=n and (z//pos)>=1:\r\n\t\tys=y\r\n\t\tps=(z)//pos\r\n\t\tmds=z%pos\r\n\t\tbreak\r\nif ys==-1:\r\n\tfor x in range(1, n+1):\r\n\t\tif(x*pos-n<=0):\r\n\t\t\tcontinue\r\n\t\tz = x*pos-n\r\n\t\tif ((z+neg-1)//neg)<=n and (z//neg)>=1:\r\n\t\t\tys=z//neg\r\n\t\t\tmds=z%neg\r\n\t\t\tps=x\r\n\t\t\tbreak\r\n\tif(ys==-1):\r\n\t\tprint(\"Impossible\")\r\n\t\texit(0)\r\n\tfor i in range(mds):\r\n\t\ta2.append(ys+1)\r\n\tfor i in range(neg-mds):\r\n\t\ta2.append(ys)\r\n\tfor i in range(pos):\r\n\t\ta1.append(ps)\r\nfor i in range(mds):\r\n\ta1.append(ps+1)\r\nfor i in range(pos-mds):\r\n\ta1.append(ps)\r\nfor i in range(neg):\r\n\ta2.append(ys)\r\nres=str(a1[0])+' '\r\nu1, u2=1,0\r\nfor i in range(1, len(l)):\r\n\tif(l[i]=='+'):\r\n\t\tres += \"+ \" + str(a1[u1])+' '\r\n\t\tu1+=1\r\n\telif(l[i]=='-'):\r\n\t\tres += \"- \" +str(a2[u2])+' '\r\n\t\tu2+=1\r\n\telif l[i]=='=':\r\n\t\tbreak\r\nres +=\"= \"+str(n)\r\nprint(\"Possible\")\r\nprint(res)\r\n\r\n\r\n\r\n", "a = ['+'] + input().split()\r\nn, m, s0, s1 = int(a[-1]), len(a) // 2 - 1, 0, 0\r\nfor i in range(m):\r\n if a[2 * i] == '+':\r\n a[2 * i + 1], s0, s1 = 1, s0 + 1, s1 + n\r\n else:\r\n a[2 * i + 1], s0, s1 = n, s0 - n, s1 - 1\r\nif n not in range(s0, s1 + 1):\r\n print('Impossible')\r\nelse:\r\n for i in range(m):\r\n d = n - max(1, s0)\r\n if a[2 * i] == '+':\r\n a[2 * i + 1] += d\r\n else:\r\n a[2 * i + 1] -= d\r\n s0 += d\r\n print('Possible')\r\n print(' '.join(map(str, a[1:])))", "data = input()\ndata = data.split()\ndata.reverse()\nn = int(data[0])\ndata.reverse()\npos = 1\nneg = 0\nfor x in data:\n if x == '-':\n neg += 1\n if x == '+':\n pos += 1\n\nans = pos - neg\n\nif ans <= n:\n tmp = n - ans\n if tmp > pos * (n - 1):\n print('Impossible')\n exit(0)\n else:\n print('Possible')\n fin = ''\n for x in range(len(data)):\n if data[x] != '?':\n fin += data[x] + ' '\n continue\n if x == 0 or data[x - 1] == '+':\n t = min(n - 1, tmp)\n tmp -= t\n fin += str(1 + t) + ' '\n else:\n fin += '1 '\n print(fin)\nelse:\n tmp = ans - n\n if tmp > neg * (n - 1):\n print('Impossible')\n exit(0)\n else:\n print('Possible')\n fin = ''\n for x in range(len(data)):\n if data[x] != '?':\n fin += data[x] + ' '\n continue\n if x != 0 and data[x - 1] == '-':\n t = min(n - 1, tmp)\n tmp -= t\n fin += str(1 + t) + ' '\n else:\n fin += '1 '\n print(fin)\n", "l = [i for i in input().split(' ')]\r\nn , make = int(l[-1]) , int(l[-1])\r\n \r\npositives = 1\r\nnegatives = 0\r\nfor i in l :\r\n if i == '-' :\r\n make += 1\r\n negatives += 1\r\n elif i == '+' :\r\n positives += 1\r\n \r\n \r\nif make > n*positives or (make < positives and negatives == 0) :\r\n print('Impossible')\r\n exit(0)\r\n \r\nans = []\r\nfor i in range(n,0,-1) :\r\n while make >= i :\r\n ans.append(i)\r\n make-=i\r\n if make == 0 :\r\n break\r\n \r\n\r\nidx = 0\r\nwhile len(ans) > 0 and len(ans) < positives :\r\n if ans[idx] == 1 :\r\n idx+=1\r\n if idx > len(ans) or ans[idx] == 1 :\r\n break\r\n ans[idx]-=1\r\n ans.append(1)\r\n\r\nidx = 0\r\nnegs = [0]*negatives\r\nwhile len(ans) < positives :\r\n ans.append(1)\r\n negs[idx]+=1\r\n if negs[idx] == n :\r\n print('Impossible')\r\n exit(0)\r\n idx = (idx+1)%negatives\r\n \r\nprint('Possible')\r\nprint(ans[0],end=' ')\r\nj,k = 0,1\r\nfor i in l :\r\n if i == '-' :\r\n print(i,1 + negs[j],end=' ')\r\n j+=1\r\n elif i == '+' :\r\n print(i,ans[k],end=' ')\r\n k+=1\r\n elif i != '?' :\r\n print(i,end=' ')\r\nprint()\r\n", "s = ('+ ' + input()).strip().split()\r\nplus = 0\r\nminus = 0\r\nfor c in s:\r\n if c == '+':\r\n plus += 1\r\n elif c == '-':\r\n minus += 1\r\n\r\nn = int(s[-1])\r\n\r\nmaxn = plus * n - minus\r\nminn = plus - minus * n\r\n\r\nif not (maxn >= n >= minn):\r\n print(\"Impossible\")\r\n exit()\r\n\r\nans = []\r\n\r\nfor i in range(1, len(s)):\r\n need = min(maxn - n, n - 1)\r\n \r\n if s[i-1] == '+':\r\n ans.append(str(n - need))\r\n maxn -= need\r\n elif s[i-1] == '-':\r\n ans.append(str(1 + need))\r\n maxn -= need\r\n else:\r\n ans.append(s[i])\r\nprint(\"Possible\")\r\nprint(' '.join(ans))", "\ndef max(a, b):\n\tif(a>=b):\n\t\treturn a\n\telse:\n\t\treturn b\n\n####################################\n\ns=input().split()\nlength=len(s)\nn=int(s[length-1])\n\nplus=1\nminus=0\n\n\nfor i in s:\n\tif(i== '+'):\n\t\tplus+=1\n\tif(i== '-'):\n\t\tminus+=1\n\nif(plus*n - minus < n or plus - n*minus > n):\n\tprint('Impossible')\n\texit()\nelse:\n\tprint('Possible')\n\nfor i in range(0, length-1, 2): #initializing all placeholders with 1\n\ts[i]='1'\n\n\n# if(minus==0):\n# \ts[0]= repr(n-plus+1)\n\n# else:\n\n\n# \tdiff=plus-1-minus\n\n\n# \tif(diff>0):\n# \t\ts[0]=repr(n-diff)\n# \t\tfor i in range(2, length-1, 2):\n# \t\t\ts[i]='1'\n\n# \tflag=0\n# \tif(diff<=0):\n# \t\ts[0]=repr(n)\n# \t\tfor i in range(2, length-1, 2):\n# \t\t\ts[i]='1'\n# \t\t\tif(flag==0 and s[i-1] == '+'):\n# \t\t\t\tflag=1\n# \t\t\t\ts[i]=repr(1-diff)\n\nres=n-plus+minus\nfor i in range(0, length-1, 2):\n\tif((i==0 or s[i-1]=='+' ) and res>0):\n\t\tval=int(s[i])\n\t\tif(res>n-val):\n\t\t\tres-=(n-val)\n\t\t\ts[i]=repr(n)\n\t\telse:\n\t\t\tval+=res\n\t\t\ts[i]=repr(val)\n\t\t\tres=0\n\telif(s[i-1]=='-' and res<0):\n\t\tval=int(s[i])\n\t\tif(res<val-n):\n\t\t\tres+=(n-val)\n\t\t\ts[i]=repr(n)\n\t\telse:\n\t\t\tval-=res\n\t\t\ts[i]=repr(val)\n\t\t\tres=0\n\n\n\n\n\nprint (' '.join(s))\n\n\n\n\n\n" ]

[ "import sys\r\nres = ''\r\nhas_endl = True\r\nfor line in sys.stdin:\r\n if '#' in line:\r\n i = line.index('#')\r\n if list(line[:i]) == [' '] * i:\r\n if not has_endl:\r\n res += '\\n'\r\n res += line\r\n has_endl = True\r\n continue\r\n for i in line.strip().split():\r\n res += i\r\n has_endl = False\r\nif not has_endl:\r\n res += '\\n'\r\nsys.stdout.write(res)\r\n", "import sys\n\t\t\t\nlines = sys.stdin.readlines()\ncleaned_lines = []\nprev_line_is_amplifying = True\nfor line in lines:\n\tlstripped = line.lstrip()\n\tif lstripped and lstripped[0] == '#':\n\t\tif prev_line_is_amplifying == False:\n\t\t\tcleaned_lines.append('\\n' + line)\n\t\telse:\n\t\t\tcleaned_lines.append(line)\n\t\tprev_line_is_amplifying = True\n\telse:\n\t\tcleaned_lines.append(''.join(\n\t\t\t[c for c in line if c not in (' ', '\\n')]\n\t\t))\n\t\tprev_line_is_amplifying = False\n\n# add \\n for last line if not amplifying\nif not prev_line_is_amplifying:\n\tcleaned_lines[-1] += '\\n'\nout = ''.join(cleaned_lines)\nprint(''.join(cleaned_lines), end='') # don't print extra \\n\n\n", "v = []\r\nc = []\r\nresp = \"\"\r\n\r\nwhile True:\r\n\ttry:\r\n\t\tv.append(input())\r\n\texcept:\r\n\t\tbreak\r\n\r\ni = 0\r\nwhile i < len(v):\r\n\tk = v[i].replace(\" \",\"\")\r\n\tif(k == \"\"):\r\n\t\tv[i] = k\r\n\t\tc.append(False)\r\n\telif(k[0] == '#'):\r\n\t\tc.append(True)\r\n\telse:\r\n\t\tv[i] = k\r\n\t\tc.append(False)\r\n\ti+=1\r\n\r\nn = len(v)\r\ni = 0\r\nwhile i < n - 1:\r\n\tif(not c[i] and not c[i+1]):\r\n\t\tresp += v[i]\r\n\telse:\r\n\t\tresp += v[i] + \"\\n\"\r\n\ti += 1\r\nresp += v[i]\r\n\r\nprint(resp)" ]

[ "#from sys import stdin\r\n#input=lambda :stdin.readline()[:-1]\r\nimport math\r\nn,l=map(int,input().split())\r\nd=[0]\r\nb=[0]\r\n#data=[0]*n\r\n#data1=[0]*n\r\n#data2=[-1]*n\r\nfor i in range(0,n):\r\n t,tt=map(int,input().split())\r\n d.append(t)\r\n b.append(tt)\r\ndata=[]\r\nfor i in range(0,n):\r\n data.append([])\r\n for j in range(0,n+1):\r\n data[i].append(-1)\r\nfor i in range(0,n):\r\n #data.append([])\r\n for j in range(i+1,n+1):\r\n data[i][j]=math.sqrt(abs(l-(d[j]-d[i])))\r\nmin_=0\r\na1=1\r\na2=sum(b)\r\n#data0=[0]*(n+1)\r\nfor i in range(0,n):\r\n a1+=data[i][i+1]\r\n# data0[i+1]\r\nmax_=a1/a2\r\nwhile True:\r\n mid_=(max_+min_)/2\r\n data1=[0]*(n+1)\r\n data2=[-1]*(n+1)\r\n for i in range(1,n+1):\r\n data1[i]=data1[i-1]+data[i-1][i]-mid_*b[i]\r\n data2[i]=i-1\r\n for i in range(1,n+1):\r\n for j in range(0,i):\r\n x=data1[j]+data[j][i]-mid_*b[i]\r\n if x<data1[i]:\r\n data1[i]=x\r\n data2[i]=j\r\n if data1[n]<=0:\r\n max_=mid_\r\n else:\r\n min_=mid_\r\n if max_-min_<10e-10 and data1[n]<=0:\r\n break\r\ns=[n]\r\nl1=0\r\nwhile True:\r\n if data2[s[l1]]==-1:\r\n break\r\n s.append(data2[s[l1]])\r\n l1+=1\r\ns.reverse()\r\ns=s[1:]\r\nprint(*s)" ]

[ "apples=int(input())\n\nif apples<=3:\n\n print(0)\n\nelse:\n\n halfpr=int(apples/2)\n\n def primes(n):\n\n isPrime = [True for i in range(n + 1)]\n\n isPrime[0] = isPrime[1] = False\n\n \n\n idx = 2\n\n while idx * idx <= n:\n\n if isPrime[idx]:\n\n for i in range(idx * 2, n, idx):\n\n isPrime[i] = False\n\n idx += 1\n\n \n\n return isPrime\n\n\n\n primeslist=primes(halfpr)\n\n totallist=[False]*(apples+1)\n\n applepairs=[]\n\n for prime in range(len(primeslist)-1, 1, -1):\n\n if primeslist[prime]:\n\n numprimes=int(apples/prime)\n\n primesx=[int(i*prime) for i in range(1, numprimes+1) if not totallist[i*prime]]\n\n if len(primesx)%2==1:\n\n primesx.remove(2*prime)\n\n for pr in primesx:\n\n applepairs.append(pr)\n\n totallist[pr]=True\n\n print(int(len(applepairs)/2))\n\n for t in range(int(len(applepairs)/2)):\n\n print(applepairs[2*t], applepairs[2*t+1])\n\n \n\n\n\n\n\n# Made By Mostafa_Khaled", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nfrom math import *\r\ndef prm(x):\r\n s = int(sqrt(x+0.5))\r\n for i in range(2, s+1):\r\n if not (x%i): return False\r\n return True\r\ndef ap(a):\r\n while(len(a) >= 2):\r\n print(a[-1], a[-2])\r\n a.pop()\r\n a.pop()\r\nn, cnt, ans, vis, ansl, ansr = int(input()), 0, 0, [False]*100100, [], []\r\nprime = filter(prm, range(3, n//2+1))\r\nfor x in prime:\r\n tcnt, nlst = 0, []\r\n for i in range(1, n//x+1):\r\n if not vis[i*x]:\r\n vis[i*x] = True\r\n nlst.append(i)\r\n tcnt += 1\r\n ans += tcnt >> 1\r\n cnt += tcnt & 1\r\n if tcnt & 1 :\r\n nlst = nlst[0:1] + nlst[2:]\r\n ansr.append(x<<1)\r\n ansl += list(map(lambda k : x*k, nlst))\r\nfor i in range(1, n+1):\r\n if not vis[i] and not (i&1):\r\n ansr.append(i)\r\n cnt += 1\r\nprint(ans+(cnt>>1))\r\nap(ansl)\r\nap(ansr)\r\n", "\"\"\"\r\nCodeforces Round 257 Div 1 Problem C\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(map(str,s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\n################################################### SOLUTION\r\n\r\n# croft algorithm to generate primes\r\n# from pyprimes library, not built-in, just google it\r\nfrom itertools import compress\r\nimport itertools\r\ndef croft():\r\n \"\"\"Yield prime integers using the Croft Spiral sieve.\r\n\r\n This is a variant of wheel factorisation modulo 30.\r\n \"\"\"\r\n # Implementation is based on erat3 from here:\r\n # http://stackoverflow.com/q/2211990\r\n # and this website:\r\n # http://www.primesdemystified.com/\r\n # Memory usage increases roughly linearly with the number of primes seen.\r\n # dict ``roots`` stores an entry x:p for every prime p.\r\n for p in (2, 3, 5):\r\n yield p\r\n roots = {9: 3, 25: 5} # Map d**2 -> d.\r\n primeroots = frozenset((1, 7, 11, 13, 17, 19, 23, 29))\r\n selectors = (1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0)\r\n for q in compress(\r\n # Iterate over prime candidates 7, 9, 11, 13, ...\r\n itertools.islice(itertools.count(7), 0, None, 2),\r\n # Mask out those that can't possibly be prime.\r\n itertools.cycle(selectors)\r\n ):\r\n # Using dict membership testing instead of pop gives a\r\n # 5-10% speedup over the first three million primes.\r\n if q in roots:\r\n p = roots[q]\r\n del roots[q]\r\n x = q + 2*p\r\n while x in roots or (x % 30) not in primeroots:\r\n x += 2*p\r\n roots[x] = p\r\n else:\r\n roots[q*q] = q\r\n yield q\r\n\r\nn, = read()\r\ncr = croft()\r\nprimes = []\r\nfor i in cr:\r\n if i < n:\r\n primes.append(i)\r\n else:\r\n break\r\nprimes.reverse()\r\n\r\nused = [0] * (n+1)\r\nres = []\r\nfor p in primes:\r\n k = n//p\r\n tmp = []\r\n while k:\r\n if not used[k*p]:\r\n tmp.append(k*p)\r\n used[k*p] = 1\r\n if len(tmp) == 2:\r\n res.append(tmp)\r\n tmp = []\r\n k -= 1\r\n if tmp == [p] and p > 2 and p*2 <= n and len(res) and res[-1][1] == p*2:\r\n res[-1][1] = p\r\n used[p*2] = 0\r\n used[p] = 1\r\n\r\nprint(len(res))\r\nfor i in res:\r\n print(\" \".join(map(str, i)))" ]

[ "from heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\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\ndef main():\r\n\tn,k=rl()\r\n\tc=rl()\r\n\tdp=[[0 for i in range(k+1)] for i in range(k+1)]\r\n\tdp[0][0]=1\r\n\t\r\n\tfor a in sorted(c):\r\n\t\tfor i in range(k,a-1,-1):\r\n\t\t\tfor j in range(k+1):\r\n\t\t\t\tdp[i][j]|=dp[i-a][j]\r\n\t\t\t\tif j>=a:\r\n\t\t\t\t\tdp[i][j]|=dp[i-a][j-a]\r\n\tprint(sum(dp[k]))\r\n\tfor i in range(k+1):\r\n\t\tif dp[k][i]:print(i,end=' ')\r\n\t\t\t\t\r\n\tpass\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "from collections import Counter\r\nimport sys\r\nn,k = list(map(int,sys.stdin.readline().split()))\r\nc = list(map(int,sys.stdin.readline().split()))\r\ndp = [0]*(k+1)\r\ndp[0]=1\r\nfor i in c:\r\n tmp = dp[:]\r\n for j in range(k,i-1,-1):\r\n tmp[j] |= dp[j-i]|(dp[j-i]<<i)\r\n dp = tmp\r\nb = bin(dp[-1])\r\nans = [i for i in range(k + 1) if b[-i - 1] == '1']\r\nsys.stdout.write(\"{0}\\n{1}\".format(len(ans),str(ans)[1:-1].replace(\",\",\"\")))\r\n", "n, k =map(int, input().split())\r\n\r\ndp = []\r\nk += 1\r\nfor j in range(k):\r\n dp.append([0] * k)\r\n\r\ndp[0][0]=1\r\nc = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(k-1, c[i]-1, -1):\r\n for t in range(j+1):\r\n if t>=c[i] and dp[j-c[i]][t-c[i]] > 0:\r\n dp[j][t] = 1\r\n if dp[j-c[i]][t] > 0:\r\n dp[j][t] = 1\r\n \r\nprint(sum(dp[k-1]))\r\nfor i in range(k):\r\n if dp[k-1][i]:\r\n print(i)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\nn,m = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ndp = [False]*251001\r\ndp[0] = True\r\nfor i in range(n):\r\n for j in range(m,-1,-1):\r\n for k in range(m - j,-1,-1):\r\n if j >= a[i]:\r\n dp[j*(m + 1) + k] |= dp[(j - a[i])*(m + 1) + k]\r\n if k >= a[i]:\r\n dp[j*(m + 1) + k] |= dp[j*(m + 1) + k - a[i]]\r\n# print(dp)\r\nans = [i for i in range(m + 1) if dp[i*(m + 1) + m - i]]\r\nprint(len(ans))\r\nprint(*ans)", "cin =lambda : map(int,input().split())\r\nn, k = cin()\r\nc=list(cin())\r\ndp = [0]*(k+1)\r\ndp[0]=1\r\nfor i in c:\r\n tmp = dp[:]\r\n for x in range(k,i-1,-1):\r\n tmp[x] |= dp[x-i]|(dp[x-i]<<i)\r\n dp = tmp\r\nb = bin(dp[-1])\r\nans = [i for i in range(k + 1) if b[-i - 1] == '1']\r\nprint(len(ans))\r\nprint(*ans)", "n,m=map(int,input().split())\r\ns=[0]+list(map(int,input().split()))\r\ndp=[[[False for i in range(m+1)] for j in range(m+1)] for k in range(2)]\r\ndp[0][0][0]=True\r\ncur=0\r\nfor i in range(1,n+1):\r\n cur+=1\r\n cur%=2\r\n last=(cur+1)%2\r\n for j in range(m+1):\r\n for k in range(j+1):\r\n if j-s[i]>-1 and k-s[i]>-1:\r\n dp[cur][j][k]=dp[last][j][k] or dp[last][j-s[i]][k] or dp[last][j-s[i]][k-s[i]]\r\n elif j-s[i]>-1 :\r\n dp[cur][j][k]=dp[last][j][k] or dp[last][j-s[i]][k]\r\n elif k-s[i]>-1:\r\n dp[cur][j][k]=dp[last][j][k] or dp[last][j-s[i]][k-s[i]]\r\n else:\r\n dp[cur][j][k]=dp[last][j][k]\r\n \r\nans=[]\r\nfor i in range(k+1):\r\n if dp[cur][k][i]:\r\n ans.append(i)\r\nprint(len(ans))\r\nprint(*ans)", "# Problem: C. The Values You Can Make\r\n# Contest: Codeforces - Codeforces Round 360 (Div. 1)\r\n# URL: https://codeforces.com/problemset/problem/687/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/687/C\r\n\r\n输入正整数 n(≤500) k(≤500) 和长为 n 的数组 c(1≤c[i]≤500)。\r\n\r\n从 c 中选择若干个数，组成数组 A，满足 sum(A) = k。\r\n从 A 中再选择若干个数，组成数组 B（可以为空）。\r\n你需要计算 sum(B) 的所有可能的值。\r\n输出这些值的个数 q，然后按升序输出这 q 个数。\r\n输入\r\n6 18\r\n5 6 1 10 12 2\r\n输出\r\n16\r\n0 1 2 3 5 6 7 8 10 11 12 13 15 16 17 18 \r\n\r\n输入\r\n3 50\r\n25 25 50\r\n输出\r\n3\r\n0 25 50 \r\n\"\"\"\r\n\"\"\"https://codeforces.com/problemset/submission/687/197390629\r\n\r\n提示 1：问题转换成，能否从 c 中选出两个不相交的子集，其中一个和为 x，另一个和为 k-x。（求所有 x）\r\n\r\n提示 2：相当于一个二维体积的 0-1 背包问题。\r\n每个 c[i] 要么不选，要么放入一种体积，要么放入另一种体积。\r\n\r\n所以\r\nf[i][j1][j2] = f[i-1][j1][j2] || f[i-1][j1-c[i]][j2] || f[i-1][j1][j2-c[i]]\r\n\r\n代码实现时第一个维度可以优化掉（倒序循环）\r\n\r\n答案就是所有 f[x][k-x] 为 true 的 x。\"\"\"\r\n\r\n\r\n# TLE 6 ms\r\ndef solve1():\r\n n, k = RI()\r\n c = RILST()\r\n\r\n @lru_cache\r\n def dfs(i, s): # 01背包求方案数,从i开始的后缀里，选出和为s的方案数\r\n if i == n:\r\n return int(s == 0)\r\n return dfs(i + 1, s) + dfs(i + 1, s - c[i])\r\n\r\n ans = [1] + [0] * k # ans[i]代表这个i是否在答案里\r\n ans[k] = 1\r\n f = [1] + [0] * k # f[i]代表本path下前缀数据里构成的和恰好为i时的方案数\r\n\r\n def dfs2(i, s): # 回溯，检查从i开始的后缀里，选出和为s时，c[i]能不能选\r\n if i == n:\r\n return\r\n if dfs(i + 1, s - c[i]) > 0: # 如果c[i]可以选，则尝试加入\r\n g = f[:]\r\n for j in range(k, c[i] - 1, -1):\r\n f[j] += f[j - c[i]]\r\n if f[j] > 0:\r\n ans[j] = 1\r\n dfs2(i + 1, s - c[i])\r\n f[:] = g # 回溯\r\n if dfs(i + 1, s) > 0: # 如果不选c[i]可以，则向后尝试\r\n dfs2(i + 1, s)\r\n\r\n dfs2(0, k)\r\n p = [i for i, v in enumerate(ans) if v]\r\n print(len(p))\r\n print(*p)\r\n\r\n\r\n# TLE 6 ms\r\ndef solve2():\r\n n, k = RI()\r\n c = RILST()\r\n\r\n @lru_cache\r\n def dfs(i, s): # 01背包求方案数,从i开始的后缀里，选出和为s的方案数\r\n if i == n:\r\n return int(s == 0)\r\n return dfs(i + 1, s) + dfs(i + 1, s - c[i])\r\n\r\n ans = [1] + [0] * k # ans[i]代表这个i是否在答案里\r\n ans[k] = 1\r\n path = []\r\n\r\n def dfs2(i, s): # 回溯，检查从i开始的后缀里，选出和为s时，c[i]能不能选\r\n if i == n:\r\n if s == 0:\r\n f = [1] + [0] * k\r\n for v in path:\r\n for j in range(k, v - 1, -1):\r\n f[j] += f[j - v]\r\n for i, v in enumerate(f):\r\n if v: ans[i] = 1\r\n return\r\n if dfs(i + 1, s - c[i]) > 0: # 如果c[i]可以选，则尝试加入\r\n path.append(c[i])\r\n dfs2(i + 1, s - c[i])\r\n path.pop()\r\n if dfs(i + 1, s) > 0: # 如果不选c[i]可以，则向后尝试\r\n dfs2(i + 1, s)\r\n\r\n dfs2(0, k)\r\n p = [i for i, v in enumerate(ans) if v]\r\n print(len(p))\r\n print(*p)\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, k = RI()\r\n c = RILST()\r\n\r\n f = [[0] * (k + 1) for _ in range(k + 1)] # f[x][i][j] 代表 从前x个物品里选，能组合成体积i+j的方案是否存在\r\n f[0][0] = 1\r\n for v in c:\r\n for i in range(k, -1, -1):\r\n for j in range(k, -1, -1):\r\n if i >= v:\r\n f[i][j] |= f[i - v][j]\r\n if j >= v:\r\n f[i][j] |= f[i][j - v]\r\n \r\n ans = [i for i in range(k + 1) if f[i][k - i]]\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "# Problem: C. The Values You Can Make\r\n# Contest: Codeforces - Codeforces Round 360 (Div. 1)\r\n# URL: https://codeforces.com/problemset/problem/687/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/687/C\r\n\r\n输入正整数 n(≤500) k(≤500) 和长为 n 的数组 c(1≤c[i]≤500)。\r\n\r\n从 c 中选择若干个数，组成数组 A，满足 sum(A) = k。\r\n从 A 中再选择若干个数，组成数组 B（可以为空）。\r\n你需要计算 sum(B) 的所有可能的值。\r\n输出这些值的个数 q，然后按升序输出这 q 个数。\r\n输入\r\n6 18\r\n5 6 1 10 12 2\r\n输出\r\n16\r\n0 1 2 3 5 6 7 8 10 11 12 13 15 16 17 18 \r\n\r\n输入\r\n3 50\r\n25 25 50\r\n输出\r\n3\r\n0 25 50 \r\n\"\"\"\r\n\"\"\"https://codeforces.com/problemset/submission/687/197390629\r\n\r\n提示 1：问题转换成，能否从 c 中选出两个不相交的子集，其中一个和为 x，另一个和为 k-x。（求所有 x）\r\n\r\n提示 2：相当于一个二维体积的 0-1 背包问题。\r\n每个 c[i] 要么不选，要么放入一种体积，要么放入另一种体积。\r\n\r\n所以\r\nf[i][j1][j2] = f[i-1][j1][j2] || f[i-1][j1-c[i]][j2] || f[i-1][j1][j2-c[i]]\r\n\r\n代码实现时第一个维度可以优化掉（倒序循环）\r\n\r\n答案就是所有 f[x][k-x] 为 true 的 x。\"\"\"\r\n\r\n\r\n# 982 ms\r\ndef solve3():\r\n n, k = RI()\r\n c = RILST()\r\n\r\n f = [[0] * (k + 1) for _ in range(k + 1)] # f[x][i][j] 代表 从前x个物品里选，能组合成体积i+j的方案是否存在\r\n f[0][0] = 1\r\n for v in c:\r\n for i in range(k, -1, -1):\r\n for j in range(k, -1, -1):\r\n if i >= v:\r\n f[i][j] |= f[i - v][j]\r\n if j >= v:\r\n f[i][j] |= f[i][j - v]\r\n\r\n ans = [i for i in range(k + 1) if f[i][k - i]]\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\n# 1013 ms\r\ndef solve4():\r\n n, k = RI()\r\n c = RILST()\r\n\r\n f = [[0] * (k + 1) for _ in range(k + 1)] # f[x][i][j] 代表 从前x个物品里选，能组合成体积i+j的方案是否存在\r\n f[0][0] = 1\r\n for v in c:\r\n for i in range(k, v - 1, -1):\r\n for j in range(k, v - 1, -1):\r\n f[i][j] |= f[i - v][j]\r\n f[i][j] |= f[i][j - v]\r\n for i in range(v - 1, -1, -1):\r\n for j in range(k, v - 1, -1):\r\n f[i][j] |= f[i][j - v]\r\n for i in range(k, v - 1, -1):\r\n for j in range(v - 1, -1, -1):\r\n f[i][j] |= f[i - v][j]\r\n\r\n ans = [i for i in range(k + 1) if f[i][k - i]]\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\n# 109 ms\r\ndef solve5():\r\n n, k = RI()\r\n c = RILST()\r\n\r\n f = [0] * (k + 1) # f[i][j] 是个二进制的编码，其第x位上是1代表从前i个物品里选，能组合成体积j的方案里，是否存在体积x\r\n f[0] = 1\r\n for v in c:\r\n for i in range(k, v - 1, -1):\r\n f[i] |= f[i - v] | (f[i - v] << v)\r\n\r\n ans = [i for i in range(k + 1) if f[k] & (1 << i)]\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, k = RI()\r\n c = RILST()\r\n\r\n f = [[0] * (k + 1) for _ in range(k + 1)] # f[x][i][j] 代表 从前x个物品里选，能组合成体积i+j的方案是否存在\r\n f[0][0] = 1\r\n for v in c:\r\n for i in range(k, -1, -1):\r\n for j in range(k, -1, -1):\r\n f[i][j] |= (i >= v and f[i - v][j]) | (j >= v and f[i][j - v])\r\n\r\n ans = [i for i in range(k + 1) if f[i][k - i]]\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\n# f[x][i][j] 代表 从前x个物品里选，能组合成体积i+j的方案是否存在\r\n# f[i][j] 是个二进制的编码，其第x位上是1代表从前i个物品里选，能组合成体积j的方案里，是否存在体积x\r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n f = [0]*(k+1)\r\n f[0] = 1\r\n for x in a:\r\n for j in range(k, x-1, -1):\r\n f[j] |= f[j-x] | (f[j-x]<<x)\r\n res = [i for i in range(k+1) if f[-1]>>i&1]\r\n print(len(res))\r\n print(*res)\r\nsolve()", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\ncc=list(map(int,input().split())) # 1-indexed\r\ndp=[[0]*(k+1) for i in range(2)]\r\ndp[0][0]=1\r\nfor i,c in enumerate(cc,1):\r\n for j in range(k+1):\r\n dp[i%2][j]|=dp[(i-1)%2][j]\r\n if c<=j:\r\n dp[i%2][j]|=dp[(i-1)%2][j-c]\r\n dp[i%2][j]|=(dp[(i-1)%2][j-c]<<c)\r\nans=[i for i in range(k+1) if (dp[n%2][k]>>i)&1]\r\nprint(len(ans))\r\nprint(*ans)", "import sys\r\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right, insort\r\nfrom collections import deque, Counter, defaultdict\r\n# from heapq import heappush, heappop, heapify\r\n# from math import ceil, floor, gcd\r\n# from string import ascii_lowercase as chars\r\n# from functools import reduce, cache\r\nfrom itertools import accumulate\r\nfrom copy import deepcopy\r\ninf = float(\"inf\")\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\n\r\ndef group_read_ints():\r\n return map(lambda x: int(x)-1, input().split())\r\n\r\n\r\nclass SortedList:\r\n def __init__(self, a=None):\r\n self.small = []\r\n self.big = [] if not a else a\r\n\r\n def add(self, v):\r\n if len(self.small) > 1500:\r\n self.big += self.small\r\n self.big.sort()\r\n self.small.clear()\r\n insort(self.small, v)\r\n\r\n def __len__(self):\r\n return len(self.small) + len(self.big)\r\n\r\n def bisect_left(self, v):\r\n return bisect_left(self.small, v) + bisect_left(self.big, v)\r\n\r\n\r\ndef todo():\r\n print(\"Not impletment yet\")\r\n raise RuntimeError()\r\n\r\n\r\ndef main():\r\n n, k = read_ints()\r\n coins = sorted(read_ints())\r\n dp = [[0] * (k+1) for _ in range(k+1)]\r\n dp[0][0] = 1\r\n for c in coins:\r\n for x in range(k, -1, -1):\r\n for y in range(k, -1, -1):\r\n dp[x][y] |= dp[x][y] or (\r\n x >= c and dp[x-c][y]) or (y >= c and dp[x][y-c])\r\n res = []\r\n for x in range(k+1):\r\n if dp[x][k-x]:\r\n res.append(x)\r\n\r\n print(len(res))\r\n print(*res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn,m = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ndp = [0]*(m + 1)\r\ndp[0] = 1\r\nfor i in range(n):\r\n for j in range(m,a[i] - 1,-1):\r\n dp[j] |= dp[j - a[i]] | (dp[j - a[i]]<< a[i])\r\nans = [i for i in range(m + 1) if (dp[-1] >> i)&1]\r\nprint(len(ans))\r\nprint(*ans)", "\ndef check(arr, l, s):\n m = []\n for _ in range(l+1) : m.append([1] + [0] * (s))\n m[0][0] = 1\n for i, ei in enumerate(arr, 1):\n for j in range(s+1):\n m[i][j] |= m[i-1][j]\n if j >= ei: \n m[i][j] |= m[i-1][j-ei]\n m[i][j] |= (m[i-1][j-ei] << ei)\n return [i for i in range(s+1) if (m[-1][s] >> i) & 1]\n\nn, s = map(int, input().split())\nl = list(map(int, input().split()))\nL = check(l, n, s)\nprint(len(L))\nprint(*L, sep=' ')\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\nn, k = map(int, input().split())\r\ndp = [1 << 501] * (k + 1)\r\ndp[0] = 1\r\na = input().split()\r\na = [int(i) for i in a]\r\nfor i in range(n):\r\n for j in range(k, -1, -1):\r\n if j < a[i]:\r\n break\r\n dp[j] |= (dp[j - a[i]] << a[i]) # 选择让所有答案变多\r\n dp[j] |= dp[j - a[i]] # 不选择\r\np = []\r\nans = 0\r\nfor i in range(k + 1):\r\n if dp[k] & (1 << i):\r\n ans += 1\r\n p.append(i)\r\nprint(ans)\r\nfor v in p:\r\n print(v, end=\" \")\r\n", "n, k = map(int, input().split())\ncs = map(int, input().split())\n\n# table[c][s] has bit ss set if can make subset s and sub-subset ss\n# using only the first c coins.\n# We only ever need to know table[c-1] to compute table[c].\ntable = [[0 for _ in range(k+1)] for _ in range(2)]\n\n# Can always make subset 0 and sub-subset 0 using 0 coins.\ntable[0][0] = 1\n\nfor i, c in enumerate(cs,1):\n\tfor s in range(k+1):\n\t\t# Include the coin in neither subset nor sub-subset.\n\t\ttable[i%2][s] |= table[(i-1)%2][s]\n\t\tif c <= s:\n\t\t\t# Include the coin in subset but not sub-subset.\n\t\t\ttable[i%2][s] |= table[(i-1)%2][s-c]\n\t\t\t# Include the coin in both the subset and sub-subset.\n\t\t\ttable[i%2][s] |= (table[(i-1)%2][s-c] << c)\n\npossible = [str(i) for i in range(k+1) if (table[n%2][k] >> i) & 1]\nprint(len(possible))\nprint(*possible)\n\n\n\n\n# Made By Mostafa_Khaled", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nA = map(int, input().split())\r\n\r\nDP = [[False]*(k+1) for _ in range(k+1)]\r\n\r\nDP[0][0] = True\r\n\r\nfor a in sorted(A):\r\n for i in range(k, a-1, -1):\r\n for j in range(0, k+1):\r\n DP[i][j] |= DP[i-a][j]\r\n if j >= a:\r\n DP[i][j] |= DP[i-a][j-a]\r\n\r\nprint(sum(DP[k]))\r\nfor i in range(k+1):\r\n if DP[k][i]:\r\n print(i)\r\n" ]

[ "try:\r\n t=int(input())\r\n a=[int(i) for i in input().split()]\r\n c=0\r\n j=[]\r\n for i in range(t):\r\n c=(a[i]-1)*(i+1)+1\r\n j.append(c)\r\n \r\n print(sum(j)) \r\nexcept:\r\n pass", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = 0\r\n\r\nfor i in range(len(a)):\r\n\ts += (a[i]-1)*(i+1)+1\r\n\r\nprint(s)\r\n", "n = int(input())\r\ns = input().split()\r\nans = 0\r\nfor i in range(1, n + 1) :\r\n x = int(s[i - 1])\r\n ans += (x - 1) * (i - 1) + x\r\nprint(ans)", "n=int(input())\r\np=input().split()\r\nl=[]\r\ni=0\r\nwhile i<n:\r\n l.append(int(p[i]))\r\n i=i+1\r\ns=l[0]\r\nfor i in range(1,n):\r\n s=s+l[i]+i*(l[i]-1)\r\nprint(s)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(l)):\r\n s=s+l[i]+((l[i]-1)*i)\r\nprint(s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nx=0\r\nfor j in range(n):\r\n x=x+(l[j]-1)*(j+1)+1\r\nprint(x)", "# 103A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\nn = int(stdin.readline().strip())\r\ncount = 0\r\na = list(map(int, stdin.readline().strip().split()))\r\nfor i in range(n):\r\n v = a[i]\r\n count += (v - 1) * i\r\n count += v\r\nprint(count)", "class CodeforcesTask104BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.questions = []\n\n def read_input(self):\n self.n = int(input())\n self.questions = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n wrong_click_cost = [x for x in range(self.n)]\n cost = 0\n for x in range(self.n):\n cost += 1 + (self.questions[x] - 1) * (1 + wrong_click_cost[x])\n self.result = str(cost)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask104BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans=a[0]\r\nfor i in range(1,n):\r\n ans+=1+(a[i]-1)*(i+1)\r\n\r\nprint(ans)\r\n", "a=int(input());b=[int(x) for x in input().split()];c=b[0]\r\nfor i in range(1,a):\r\n c+=b[i]+i*(b[i]-1) \r\nprint(c)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nres = sum((i+1)*x for i, x in enumerate(lst)) - n * (n-1) // 2\r\nprint(res)", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = 0\r\nfor i in range(1, n+1):\r\n s+=(a[i-1]-1)*i+1\r\nprint(s)\r\n", "\"\"\"\r\n Template written to be used by Python Programmers.\r\n Use at your own risk!!!!\r\n Owned by adi0311(rating - 5 star at CodeChef and Specialist at Codeforces).\r\n\"\"\"\r\nimport sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush, nlargest, nsmallest, _heapify_max, _heapreplace_max\r\nfrom math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nfrom collections import defaultdict as dd, deque, Counter as c\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\nfrom fractions import Fraction\r\n# sys.setrecursionlimit(2*pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(str(var))\r\ndef outln(var): sys.stdout.write(str(var)+\"\\n\")\r\ndef l(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\n\r\n\r\nn = int(data())\r\narr = l()\r\nfor i in range(n-2, -1, -1):\r\n arr[i] = arr[i+1] + arr[i] - 1\r\nprint(sum(arr))\r\n", "'''input\n2\n1 1\n'''\nn = int(input())\na = list(map(int, input().split()))\ns = 0\nfor x in range(n):\n\ts += (a[x]-1)*(x+1) + 1\nprint(s)", "input()\ns=0\nfor x,i in enumerate(input().split(),1):\n s+=(int(i)-1)*x+1\nprint(s)\n\n \t \t \t\t \t \t\t \t\t\t\t\t\t \t\t", "input(); print(sum(i * x - i + x for i, x in enumerate(map(int, input().split()))))", "def trausers(lst):\r\n result = 0\r\n for i in range(len(lst)):\r\n result += (lst[i] - 1) * (i + 1) + 1\r\n return result\r\n\r\n\r\nn = int(input())\r\na = [int(j) for j in input().split()]\r\nprint(trausers(a))\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n ans+=(i+1)*(ar[i]-1)+(i+1)-i\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(l)):\r\n if l[i]==1:\r\n s=s+1\r\n else:\r\n s=s+l[i]+((l[i]-1)*i)\r\nprint(s)", "n=int(input())\r\ns=0\r\nl=list(map(int,input().split()))\r\npenalty=0\r\ns=0\r\nfor i in range(0,len(l)):\r\n penalty+=(l[i]-1)*(i)\r\n s+=l[i]\r\nclicks=penalty+s\r\n\r\n\r\nprint(clicks)", "n=int(input())\na=list(map(int,input().split()))\nans=0\nfor i in range(n):\n ans+=(i+1)*(a[i]-1) + 1\nprint(ans)\n", "\r\ninput()\r\na = list(map(int, input().split()))\r\ntotal = 0\r\ntotal = a[0]\r\nfor i in range(1, len(a)):\r\n total += 1 + (a[i]-1)*(i+1)\r\nprint(total)\r\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n\r\nn=L()[0]\r\nA=L()\r\nB=[(A[i]-1)*(i+1) for i in range(n)]\r\nprint(sum(B)+n)", "n = int(input())\n\nvariants = list(map(int, input().split()))\n\nres = 0\n\nfor i in range(n):\n v = variants[i]\n\n currRes = (v-1)*(i+1)\n\n res+=(currRes+1)\n\n\nprint(res)", "n = int(input())\n\narr = list(map(int,input().split(\" \")) )\n\nans = 0 \nfor i in range(1,n+1) :\n op = arr[i-1] \n ans += 1+(op-1)*i \nprint(ans) \n \t\t \t \t \t \t\t\t\t\t\t \t\t\t\t \t\t \t\t", "n=int(input())\r\narr=[0]*n\r\nb=input().split()\r\nfor i in range(n):\r\n arr[i]=int(b[i])\r\ntot=0\r\nfor i in range(n):\r\n tot+=arr[i]\r\n current=0\r\n if(i>0):\r\n current=(i-0)*(arr[i]-1)\r\n tot+=current\r\nprint(tot,end=\"\\n\")\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nc = len(l)\r\nfor index, i in enumerate(l):\r\n c += (i-1)*(index+1)\r\n\r\nprint(c)", "a = int(input())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(1,a+1):\r\n ans += (arr[i-1] - 1) * i + 1\r\nprint(ans)\r\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n ans += lis[i]\r\n else:\r\n ans += (i-0)*(lis[i]-1) + lis[i]\r\n \r\nprint(ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncnt = []\r\ns = 0\r\nfor i in range(n):\r\n s += 1 + (i + 1) * (arr[i] - 1)\r\nprint(s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=l[0]\r\nfor i in range(1,n):\r\n ans+=l[i]+((l[i]-1)*i)\r\nprint(ans)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans,i=a[0],1\r\nwhile i<n:\r\n ans+=(a[i]-1)*(i+1)+1\r\n i+=1\r\nprint(ans)\r\n \r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nclick = 0\r\nfor i in range(n):\r\n if arr[i] == 1:\r\n click += 1\r\n else:\r\n click += (arr[i] - 1) * (i + 1) + 1\r\nprint(click)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n c = c + ((l[i]-1)*(i+1)) + 1\r\n\r\nprint(c)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = sum([l[i]*(i+1)-i for i in range(n)])\r\nprint(s)\r\n", "n=int(input())\na=list(map(int,input().split()))\nc=0\nfor i in range(n):\n\tc=c+a[i]+(a[i]-1)*i\nprint(c)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nt=0\r\nfor i in range(n):\r\n t+=((a[i]-1)*(i+1))\r\nprint(t+n)", "from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from random import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3*(10**5))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=inp()\r\n a=lis()\r\n r=0\r\n for i in range(n):\r\n te=(i+1)*(a[i]-1) + 1\r\n r+=te\r\n print(r)\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\ns=0\r\nfor x in range(n):\r\n s+=a[x]+a[x]*x-x\r\nprint(s)", "#!/usr/bin/env python3\r\n\r\nn = int(input().rstrip())\r\na = map(int, input().rstrip().split())\r\n\r\nres = 0\r\nfor (i, v) in enumerate(a):\r\n res += v + (v-1) * i\r\n\r\nprint(res)", "from itertools import accumulate\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef s(v):\r\n return sum([i+1 for i in range(v)])\r\n\r\ns = a[0]\r\n\r\nfor i in range(1, n):\r\n s += a[i] + i*(a[i]-1)\r\n\r\nprint(s)", "clicks = 0\r\nnums = int(input())\r\narray = list(map(int, input().split(' ')))\r\nfor i in range(1, nums + 1):\r\n clicks += (array[i-1]-1) * i + 1\r\nprint(clicks)\r\n", "n = int(input())\na = [int(each) for each in input().split()]\n# print(n)\n# print(a)\nres = 0\nfor i in range(n):\n #前边正确的一次不用考虑，直接加一就行，剩下的所有答案过一遍前边的东西\n if a[i] == 1:\n res += 1\n else:\n # res += (i + 1) * a[i]\n res += (i + 1) * (a[i] - 1) + 1\n\nprint(res)\n \t \t \t\t\t\t \t\t\t \t\t\t\t\t\t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=(i+1)*(a[i]-1)\r\ns+=n\r\nprint(s)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=l[0]\r\nfor i in range(1,n):\r\n ans+=(i+1)*(l[i]-1) + 1\r\nprint(ans)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nx=sum(a)\r\nfor i in range(1,n):\r\n x+=(a[i]-1)*i\r\nprint(x)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n #print('A: %s' % str(A))\r\n B = [0] * n\r\n for i in range(n):\r\n if i == 0:\r\n B[i] = A[i]\r\n else:\r\n if A[i] == 1:\r\n B[i] = B[i-1] + 1\r\n else:\r\n B[i] = B[i-1] + 1 + (i + 1) * (A[i] - 1)\r\n #print('B: %s' % str(B))\r\n return B[-1]\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n ans = solve(A)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def number_of_clicks():\r\n\tcount = int(input())\r\n\toptions = map(int, input().split())\r\n\r\n\ttotal_clicks = 0\r\n\tfor index, choices in enumerate(options):\r\n\t\ttotal_clicks += (choices - 1)*(index+1) + 1\r\n\t\r\n\tprint(total_clicks)\r\n\r\n\r\nnumber_of_clicks()\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\ns=list1[0]\r\nx=1\r\nfor i in range(1,n):\r\n s+=1\r\n s+=(list1[i]-1)*(x+1)\r\n x+=1\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i, j in enumerate(a):\r\n ans += (j-1)*(i+1) + 1\r\nprint(ans)", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n current_counter = 0\r\n for i in range(len(a)):\r\n if i != len(a) - 1:\r\n current_counter += (a[i] - 1) * (i + 1)\r\n else:\r\n current_counter += (a[i]) * (i + 1)\r\n print(current_counter)\r\n\r\n \r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n", "def q103a():\n\tnum_questions = int(input())\n\tquestion_arr = [int(num) for num in input().split()]\n\t# position = 0\n\t# count = 0\n\t# while(position != len(question_arr)):\n\t# \tif(question_arr[position] == 1):\n\t# \t\tposition += 1\n\t# \telse:\n\t# \t\tquestion_arr[position] -= 1\n\t# \t\tposition = 0\n\t# \tcount += 1\n\t# print(count)\n\tcount = len(question_arr)\n\tfor i in range(len(question_arr)):\n\t\tcount += (i+1) * (question_arr[i]-1)\n\tprint(count)\n\nq103a()", "input()\nr=0\nfor i,j in enumerate(map(int, input().split())):\n r+=j+(j-1)*i\nprint(r)\n", "def solve(n, arr):\r\n i = 0\r\n c = 0\r\n while i < n:\r\n c += (arr[i]-1)*(i+1) + 1\r\n i += 1\r\n return c\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(solve(n, arr))\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nc=l[0]\r\nfor i in range(1,n):\r\n c+=(l[i]-1)*i+l[i]\r\nprint(c)", "n=eval(input())\ntemp=input()\ntemp=temp.split()\ntemp.reverse()\ntotal=0\nsubtotal=0\n\nfor i in range(n):\n temp[i]=int(temp[i])\n subtotal+=temp[i]\n total+=subtotal-i\n\nprint(total)\n\n\t\t \t\t\t \t \t\t\t \t\t \t\t \t\t\t", "print(int(input()) + sum(i * (a - 1) for i, a in enumerate(map(int, input().split()), 1)))\n", "def clicks(l, i):\r\n if i==len(l):\r\n return 0\r\n return (i*(l[i]-1))+l[i]+clicks(l, i+1)\r\nn = int(input())\r\nif n==1:\r\n arr = [int(input())]\r\nelse:\r\n arr = list(map(int, input().split()))\r\nprint(clicks(arr,0))\r\n", "num_questions = int(input())\n\nnum_answers = [int(i) for i in input().split()]\n\ntot = 0\n\nfor i in range(len(num_answers)):\n tot += (i+1)*num_answers[i] - i\n\nprint(tot)", "def shtany(lst):\r\n count = 0\r\n for i in range(len(lst)):\r\n count += (lst[i] - 1) * (i + 1) + 1\r\n return count\r\n\r\n\r\nn = int(input())\r\na = [int(j) for j in input().split()]\r\nprint(shtany(a))\r\n", "c = 0\r\nn = int(input())\r\nclicks = [int(i) for i in input().split()]\r\nfor i in range(len(clicks)):\r\n c+=(i+1)*(clicks[i]-1)\r\nprint(c+n)\r\n \r\n", "import sys,math\ns = int(input())\narr = list(map(int,input().split(' ')))\nm = 0\nfor i in range(0,s):\n m+=(arr[i]-1)*(i+1)+1\nprint(m)\n'''\n2 2 2\n1+1 2 \n1+1+1 3\n(1+1+1,1) 4\n\n3 3 \n1+1+1 3 \n1+1+1+1+1 5 \n1+1+1,1+1+1,1 7\n\n3\n2 4 1\n1+1\n1+1+1+1+1+1+1\n1\n1+1+1+1\n'''\n", "input()\r\nprint(sum(i * a - i + 1 for i, a in enumerate(map(int, input().split()), 1)))", "n=eval(input())\ntemp=input()\ntemp=temp.split()\n\nsubtotal=0\ntotal=0\ntemp.reverse()\n\nfor i in range(len(temp)):\n temp[i]=int(temp[i])\n subtotal+=temp[i]\n total+=subtotal-i\nprint(total)\n \t\t\t \t\t\t \t\t \t \t\t \t \t \t \t \t", "n = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\nans=0\r\nfor i in range(n):\r\n ans+=(i*(a[i]-1)+a[i])\r\nprint(ans)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled65.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1kH9gF2Sz0uEW-8MC5Exb7nZuB4f5BTlb\n\"\"\"\n\nn=int(input())\nl1=list(map(int,input().split()))\nc=l1[0]\nfor i in range(1,n):\n c=c+l1[i]+(l1[i]-1)*(i)\nprint(c)", "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\nans = n\r\nfor i in range(n):\r\n ans += (i + 1) * (a[i] - 1)\r\nprint(ans)", "input()\r\n\r\nprint(sum(x+i*(x-1) for i,x in enumerate(map(int, input().split()))))", "n=int(input())\r\nc=0\r\na=[int(x) for x in input().split()]\r\nfor i in range(n-1,-1,-1):\r\n if c==0:\r\n c+=a[i]\r\n prev=a[i]\r\n else:\r\n x=a[i]-1+prev\r\n prev=x\r\n c+=x\r\n \r\nprint(c)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsumahead=0\r\nans=0\r\nfor i in range(n-1,-1,-1):\r\n ahead=n-i-1\r\n ans+=sumahead-ahead+l[i]\r\n sumahead+=l[i]\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\nans=[0]*(n+1)\r\nans=a[0]\r\nfor i in range(1,n):\r\n ans+=a[i]+(a[i]-1)*i\r\nprint(ans)\r\n ", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = 0\r\n\r\nfor i in range(n):\r\n\r\n\ts = s + i*(l[i]-1) + l[i]\r\nprint(s)", "n = int(input())\r\ns = input().split()\r\na = [int(i) for i in s]\r\n\r\nres = 0\r\nfor i in range(n):\r\n\tres += a[i] + (i*(a[i]-1))\r\nprint(res)", "n = int(input())\r\nc = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(n):\r\n k += (c[i] - 1) * (i + 1) + 1\r\nprint(k)\r\n", "n = int(input())\na_arr = input().split()\n\ns_click = 0\nfor q_number in range(1,n+1):\n s_click = s_click + q_number * int(a_arr[q_number-1])-q_number + 1\nprint(s_click)\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\nans=0\r\nfor i in range(n):\r\n ans+=a[i]*(i+1)-i\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns, c = 1, 0\r\nfor i in range(n):\r\n c += s*(w[i]-1)\r\n s += 1\r\nc += n\r\nprint(c)\r\n", "# LUOGU_RID: 101455956\nn, *a = map(int, open(0).read().split())\r\nprint(sum(i * (x - 1) + x for i, x in enumerate(a)))", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn=ii()\r\nl=il()\r\nsm=l[0]\r\nfor i in range(1,n):\r\n sm+=(l[i]-1)*i+l[i]\r\nprint(sm)", "\r\nn=int(input())\r\na = list(map(int,input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n if a[i]==1:\r\n res+=1\r\n else:\r\n res+=(i+1)*(a[i]-1)+1\r\n\r\nprint(res)", "x=int(input())\r\ns=[int(n) for n in input().split()]\t\r\nl=0\r\nfor n in range(x):\r\n\tl+=(s[n]-1)*(n+1)+1\r\nprint(l)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif n==1:\r\n print(l[0])\r\n exit()\r\nans=n \r\nfor i in range(n):\r\n ans+=(l[i]-1)*(i+1)\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(len(l)):\r\n ans=ans+l[i]+((l[i]-1)*i)\r\n\r\n\r\nprint(ans)\r\n", "\r\n\r\n\r\nn = int(input())\r\n\r\nt= list(map(int,input().split()))\r\n\r\n\r\np=t[0]\r\n\r\nif n>1:\r\n for j in range(1,n):\r\n p+=(t[j]-1)*(j+1)+1\r\n\r\nprint(p)\r\n", "n = int(input())\r\nquestions = [int(c) for c in input().split()]\r\n\r\nans = sum((q - 1) * i + 1 for i, q in enumerate(questions, 1))\r\nprint(ans)\r\n", "#TestingPantsforSadness.py\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = sum(a)\r\nfor i in range(n):\r\n ans += (a[i] - 1)*i\r\nprint(ans)\r\n", "def main():\n n, aa = int(input()), list(map(int, input().split()))\n for i, a in enumerate(aa, 1):\n n += i * (a - 1)\n print(n)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n\tans += i * (a[i] - 1) + 1 + a[i] - 1\r\nprint(ans)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nres=lst[0]\r\nfor i in range(1,n):\r\n res+=(lst[i]-1)*(i+1)+1\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\n\r\nfor i in range(n):\r\n\tans+=l[i]+ i*(l[i]-1)\r\nprint(ans)", "n = int(input())\r\nls = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n c += ls[i]\r\n c += i * (ls[i] - 1)\r\nprint(c)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(0, n):\r\n s = s + l[i] + (l[i] - 1) * i\r\nprint(s)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nans = 0\r\nfor i, a in enumerate(A):\r\n ans += (i+1)*(a-1)+1\r\nprint(ans)\r\n", "n = int(input())\nsum1 = 0\ncnt = 1\ns = input()\nl = [int(i) for i in s.split()]\nif n > 1:\n for i in range(1, n):\n cnt += 1\n sum1 += 1 + (cnt * (l[i] - 1))\n sum1 += l[0]\n print(sum1)\nelse:\n print(l[0])\n \t \t \t \t \t\t\t \t \t \t \t \t \t\t", "r=input;r();print(sum(int(v)*i-i+1for i,v in enumerate(r().split(),1)))", "n=int(input())\r\nL=input().split()\r\nans=int(L[0])\r\nfor i in range(1,n):\r\n\tans+= (i+1)*(int(L[i])-1)+1\r\nprint(ans)", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import *\r\n\r\nn, a = int(input()), arr_inp()\r\nprint(sum([a[i] + (a[i] - 1) * i for i in range(n)]))\r\n", "\nn = int(input())\na = list(map(int, input().split()))\nres = 0\nfor i in range(len(a)):\n res += (1 + (i+1)*(a[i]-1))\n\nprint(res)", "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\nres = an[0]\r\n\r\nfor i in range(1, n):\r\n res += (an[i] - 1) * (i + 1)\r\n res += 1\r\n \r\nprint(res)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=a[i]+(a[i]-1)*i\r\nprint(s)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nans=0\r\ndef func(i):\r\n return (i+1)*(arr[i]-1)+1\r\nfor i in range(n):\r\n ans+=func(i)\r\nprint(ans) \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()) ; arr=list(map(int,input().split())) ; ans=0\r\nfor i in range(n):\r\n ans+=(arr[i]-1)*i+arr[i]\r\nprint(ans)", "# https://codeforces.com/contest/103/problem/A\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nsumm = 0\r\nfor idx, v in enumerate(arr):\r\n summ += v + (v - 1) * (idx)\r\n\r\nprint(summ)", "#l,r = map(int, input().strip().split(' '))\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\ns=0\r\nfor i in range(n):\r\n s+=(lst[i]-1)*(i+1)+1\r\nprint(s)\r\n \r\n " ]

[ "#!/usr/bin/env python\n'''\n' Author: Cheng-Shih Wong\n' Email: [email protected]\n' Date: 2017-08-26\n'''\n\ndef main():\n\n import math\n from itertools import combinations, chain\n EPS = 1e-12\n\n def fcomp(x):\n return -1 if x < -EPS else int(x>EPS)\n\n def dist(A, B):\n return math.sqrt((A[0]-B[0])**2+(A[1]-B[1])**2)\n\n def root(a, b, c):\n if fcomp(b**2-4*a*c) >= 0:\n sq = math.sqrt(b**2-4*a*c) if b**2-4*a*c > 0 else 0\n return ((-b+sq)/(2*a), (-b-sq)/(2*a))\n return None\n\n def circle_intersect(A, r1, B, r2):\n if fcomp(dist(A, B)-(r1+r2)) <= 0:\n if fcomp(dist(A, B)+r2-r1)<=0 or fcomp(dist(A, B)+r1-r2)<=0:\n return True, None\n else:\n\n a, b = A\n c, d = B\n r = r1\n s = r2\n e = c - a\n f = d - b\n\n p = math.sqrt(e**2+f**2)\n k = (p**2 + r**2 - s**2)/(2*p)\n\n if fcomp(r**2-k**2)<=0:\n r = k\n\n intsec = (\n (a+e*k/p+(f/p)*math.sqrt(r**2-k**2), b+f*k/p-(e/p)*math.sqrt(r**2-k**2)),\n (a+e*k/p-(f/p)*math.sqrt(r**2-k**2), b+f*k/p+(e/p)*math.sqrt(r**2-k**2))\n )\n\n return True, intsec\n else:\n return False, None\n\n def check(CA, CB, CC):\n intsec = []\n\n if CA[1]<=0 or CB[1]<=0 or CC[1]<=0:\n return False\n\n # print(CA)\n # print(CB)\n # print(CC)\n \n for pair in combinations([CA, CB, CC], 2):\n ret, ip = circle_intersect(*pair[0], *pair[1])\n # print(ret, ip)\n if not ret:\n return False\n intsec.append(ip)\n\n # print(intsec)\n if None not in intsec:\n for p in chain.from_iterable(intsec):\n if fcomp(dist(p, CA[0])-CA[1])<=0 and \\\n fcomp(dist(p, CB[0])-CB[1])<=0 and \\\n fcomp(dist(p, CC[0])-CC[1])<=0:\n return True\n\n return False\n\n return True\n\n def bisec(l, r):\n nonlocal A, B, C, T1, T2\n\n while fcomp(r-l) > 0:\n mid = (l+r)/2\n # print('(L, M, R) =', l, mid, r)\n \n if check((A, mid), (B, T2-mid), (C, T1-dist(B, C)-mid)):\n l = mid\n else:\n r = mid\n\n return l\n \n # input\n t1, t2 = map(float, input().split())\n\n A, B, C = [tuple(map(float, input().split())) for _ in range(3)]\n\n # init\n T1 = dist(A, C)+dist(C, B)+t1\n T2 = dist(A, B)+t2\n\n if T2 >= dist(A, C)+dist(C, B):\n print('{0:6f}'.format(min(T1, T2)))\n else:\n print('{0:6f}'.format(bisec(0, min(T1, T2))))\n \nif __name__ == '__main__':\n import sys, os\n from time import time\n if len(sys.argv)>1 and os.path.exists(sys.argv[1]):\n sys.stdin = open(sys.argv[1], 'rb')\n st = time()\n main()\n print('----- Run {:.6f} seconds. -----'.format(time()-st), file=sys.stderr)\n" ]

[ "n, m = map(int, input().split(' '))\r\nx = list(map(int, input().split(' ')))\r\ny = list(map(int, input().split(' ')))\r\n\r\nsumx, sumy = x[0], y[0]\r\nix, iy = 0, 0\r\n\r\nans = 0\r\n\r\nwhile 1:\r\n if sumx == sumy and ix < n - 1 and iy < m - 1:\r\n ix += 1\r\n iy += 1\r\n sumxnew = x[ix]\r\n sumynew = y[iy]\r\n ans += 1\r\n elif sumx < sumy and ix < n - 1:\r\n ix += 1\r\n sumxnew = sumx + x[ix]\r\n sumynew = sumy\r\n elif sumx > sumy and iy < m - 1:\r\n iy += 1\r\n sumxnew = sumx\r\n sumynew = sumy + y[iy]\r\n else:\r\n break\r\n sumx, sumy = sumxnew, sumynew\r\n\r\nif sumx == sumy:\r\n ans += 1\r\nprint(ans)\r\n", "n, m = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\ns1=0\r\ns2=0\r\nj=0\r\ncnt=0\r\nfor i in range(0,n):\r\n s1+=a[i]\r\n while(s1>s2):\r\n s2+=b[j]\r\n j+=1\r\n if (s1==s2):\r\n cnt+=1\r\n s1=0\r\n s2=0\r\n\r\nprint(cnt)\r\n", "import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn, m = map(int, input().split())\r\n\r\nx = [int(x) for x in input().split()]\r\ny = [int(x) for x in input().split()]\r\ni = 0\r\nj = 0\r\nbal = 0\r\nans = 0\r\nwhile(i<n or j<m):\r\n # print(bal, i, j)\r\n if(bal == 0):\r\n if(i<n):\r\n bal+=(x[i])\r\n i+=1\r\n if(j<m):\r\n bal-=(y[j])\r\n j+=1\r\n elif(bal <0):\r\n if(i<n):\r\n bal+=(x[i])\r\n i+=1\r\n else:\r\n if(j<m):\r\n bal-=(y[j])\r\n j+=1\r\n\r\n \r\n if(bal == 0):\r\n ans+=1\r\nprint(ans)\r\n", "def solve():\r\n # Read n and m\r\n n, m = map(int, input().split())\r\n # Read lists a and b\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n # initialize left pointer and right pointer\r\n l_ptr = 0\r\n r_ptr = 0\r\n ans = 0\r\n sum1 = a[l_ptr]\r\n sum2 = b[r_ptr]\r\n while (l_ptr < n) and (r_ptr < m):\r\n if sum1 == sum2:\r\n ans += 1\r\n l_ptr += 1\r\n r_ptr += 1\r\n if l_ptr < n:\r\n sum1 += a[l_ptr]\r\n if r_ptr < m:\r\n sum2 += b[r_ptr]\r\n elif sum1 < sum2:\r\n l_ptr += 1\r\n sum1 += a[l_ptr]\r\n else:\r\n r_ptr += 1\r\n sum2 += b[r_ptr]\r\n print(ans)\r\nsolve()", "n,m = map(int, input().strip().split(' '))\r\na = list(map(int, input().strip().split(' ')))\r\nb = list(map(int, input().strip().split(' ')))\r\ni=0\r\nj=0\r\nc=0\r\nsa=a[0]\r\nsb=b[0]\r\nwhile(i<n-1 or j<m-1):\r\n if j<m-1 and sa>sb:\r\n j+=1\r\n sb+=b[j]\r\n \r\n \r\n elif i<n-1 and sa<sb:\r\n i+=1\r\n sa+=a[i]\r\n else:\r\n c+=1\r\n if i<n-1:\r\n i+=1\r\n sa=a[i]\r\n if j<m-1:\r\n j+=1\r\n sb=b[j]\r\n \r\n \r\n \r\n \r\nprint(c+1)\r\n ", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\nr = [x[0]]\np = [y[0]]\nfor i in range(1, n):\n r.append(r[i-1] + x[i])\nfor i in range(1, m):\n p.append(p[i-1] + y[i])\nprint(len(set(r).intersection(p)))\n", "n, m = map( int, input().split() )\r\na = list( map( int, input().split() ) )\r\nb = list( map( int, input().split() ) )\r\n\r\nans = 0\r\n\r\ns1 = a[0]\r\ns2 = b[0]\r\ni = 0\r\nj = 0\r\nwhile i < len(a) or j < len(b):\r\n if s1 == s2:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n if i < len(a) and j < len(b):\r\n s1 = a[i]\r\n s2 = b[j]\r\n elif s1 < s2:\r\n i += 1\r\n s1 += a[i]\r\n elif s2 < s1:\r\n j += 1\r\n s2 += b[j]\r\n\r\nprint(ans)", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nsum=0\r\nsums=0\r\nfor i in range(0,len(a)):\r\n sum=sum+a[i]\r\n a[i]=sum\r\nfor i in range(0,len(b)):\r\n sums=sums+b[i]\r\n b[i]=sums\r\nprint(n+m-(len(set(a+b))))\r\n", "from itertools import accumulate\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nI()\r\n\r\nprint(len(set(accumulate(I())) & set(accumulate(I()))))", "GI = lambda: int(input()); GIS = lambda: map(int, input().split()); LGIS = lambda: list(GIS())\n\ndef main():\n n, m = GIS()\n xs = LGIS()\n ys = LGIS()\n\n xi = yi = 0\n sx = sy = 0\n\n count = 0\n while xi < n and yi < m:\n if sx == 0:\n sx = xs[xi]\n sy = ys[yi]\n\n if sx > sy:\n yi += 1\n sy += ys[yi]\n elif sx < sy:\n xi += 1\n sx += xs[xi]\n else:\n count += 1\n xi += 1\n yi += 1\n sx = sy = 0\n\n print(count)\n\nmain()\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ni=0\r\nj=0\r\ncurr1=a[0]\r\ncurr2=b[0]\r\ncount=0\r\nwhile(1):\r\n if(curr1==curr2):\r\n curr1=0\r\n curr2=0\r\n count+=1\r\n i+=1\r\n j+=1\r\n if(i<=n-1):\r\n curr1=a[i]\r\n if(j<=m-1):\r\n curr2=b[j]\r\n elif(curr1<curr2):\r\n i+=1\r\n curr1+=a[i]\r\n else:\r\n j+=1\r\n curr2+=b[j]\r\n if(i>=n or j>=m):\r\n break\r\nprint(count)\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\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\ns = set()\r\nu = 0\r\nfor i in x:\r\n u += i\r\n s.add(u)\r\nu = 0\r\nans = 0\r\nfor i in y:\r\n u += i\r\n if u in s:\r\n ans += 1\r\nprint(ans)", "import sys, copy\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\na = list(map(int, sys.stdin.readline().split()))\r\nb = list(map(int, sys.stdin.readline().split()))\r\ni = 0\r\nj = 0\r\nsigma_a = a[0]\r\nsigma_b = b[0]\r\nans = 0\r\nwhile i < n and j < m:\r\n if sigma_a < sigma_b:\r\n i += 1\r\n sigma_a += a[i]\r\n\r\n elif sigma_a > sigma_b:\r\n j += 1\r\n sigma_b += b[j]\r\n\r\n else:\r\n i += 1\r\n j += 1\r\n ans += 1\r\n if i < n or j < m:\r\n sigma_a = a[i]\r\n sigma_b = b[j]\r\nprint(ans)\r\n", "l1, l2 = map(int, input().split())\r\nFa = list(map(int, input().split()))\r\nFb = list(map(int, input().split()))\r\nfor i in range(1, l1):\r\n Fa[i] += Fa[i-1]\r\nf = 0\r\nc = 0\r\nl = 0\r\nfor i in range(l2):\r\n c += Fb[i]\r\n while l < l1:\r\n if c > Fa[l]:\r\n l += 1\r\n elif c == Fa[l]:\r\n f += 1\r\n break\r\n elif c < Fa[l]:\r\n break\r\nprint(f)", "read = lambda: list(map(int, input().split()))\r\nread()\r\n\r\nmessageOne, messageTwo, i, j, counts, sumx, sumy = read(), read(), 0, 0, 0, 0, 0\r\n\r\n\r\nfor a in messageOne:\r\n sumx += a;\r\n while sumy < sumx:\r\n sumy += messageTwo[j];\r\n j += 1;\r\n if sumy == sumx:\r\n sumy, sumx = 0, 0;\r\n counts += 1;\r\n\r\n \r\nprint(counts)", "size1, size2 = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb= list(map(int,input().split()))\r\ni=0\r\nj=0\r\nsum1=a[0]\r\nsum2=b[0]\r\ncount=0\r\n\r\nwhile i<size1-1 and j<size2-1:\r\n if sum1>sum2:\r\n j=j+1\r\n sum2=sum2+b[j]\r\n elif sum1<sum2:\r\n i=i+1\r\n sum1=sum1+a[i]\r\n else:\r\n i=i+1\r\n j=j+1\r\n sum1=a[i]\r\n sum2=b[j]\r\n count=count+1\r\ncount = count +1\r\nprint(count)", "n, m = map(int, input().split())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\n\r\nfile=0; sum1=0; sum2=0; i=0; j=0\r\n\r\nwhile i<n or j<m:\r\n if sum1 >= sum2:\r\n sum2 += arr2[j]\r\n j+=1\r\n else:\r\n sum1 += arr1[i]\r\n i+=1\r\n\r\n if sum1==sum2:\r\n file+=1\r\n\r\nprint(file)\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\nfirst_message_block_sized = list(map(int, input().split()))\nsecond_message_block_sized = list(map(int, input().split()))\n\n\nif len(first_message_block_sized) > len(second_message_block_sized):\n first_message_block_sized, second_message_block_sized = second_message_block_sized, first_message_block_sized\n\ntmp_first_sum = 0\ntmp_second_sum = 0\nresult = 0\nlast_second_index = 0\nfor k in range(len(first_message_block_sized)):\n tmp_first_sum += first_message_block_sized[k]\n for last_second_index in range(last_second_index, len(second_message_block_sized)):\n if tmp_first_sum == tmp_second_sum:\n result += 1\n tmp_first_sum = tmp_second_sum = 0\n break\n if tmp_second_sum > tmp_first_sum:\n break\n tmp_second_sum += second_message_block_sized[last_second_index]\nif tmp_first_sum == tmp_second_sum and tmp_first_sum != 0:\n result += 1\n\n\nprint(result)", "rd = input().split()\r\nn = int(rd[0])\r\nm = int(rd[1])\r\n\r\nx = input().split()\r\ny = input().split()\r\n\r\nj = 0\r\nctx = 0; cty = 0\r\nans = 0\r\nfor i in range(0, n) :\r\n ctx += int(x[i])\r\n while (cty < ctx) & (j < m) :\r\n cty += int(y[j])\r\n j += 1\r\n if ctx == cty :\r\n ans += 1\r\n ctx = 0\r\n cty = 0\r\n\r\nprint(ans)", "n, m = map(int, input().strip().split())\r\nx = list(map(int, input().strip().split()))\r\ny = list(map(int, input().strip().split()))\r\n\r\nres = 0\r\np, q = 0, 0\r\na, b = x[p], y[q]\r\nwhile p < len(x) or q < len(y):\r\n if a < b:\r\n a += x[p + 1]\r\n p += 1\r\n elif a > b:\r\n b += y[q + 1]\r\n q += 1\r\n else: # a == b \r\n res += 1\r\n p += 1\r\n q += 1\r\n if p < len(x):\r\n a, b = x[p], y[q]\r\nprint(res)\r\n\r\n\r\n\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nAr=[None]*1000001\r\nt=0\r\nfor x in input().split():\r\n# x=int(input())\r\n t+=int(x)\r\n Ar[t]=1\r\ncnt=0\r\nt=0\r\nfor x in input().split():\r\n# x=int(input())\r\n t+=int(x)\r\n if Ar[t]==1:\r\n cnt+=1\r\nprint(cnt)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\ns=0\r\nd1=d2=0\r\nf1=f2=1\r\ns1=l1[d1]\r\ns2=l2[d2]\r\nwhile d1<n and d2<m:\r\n if s1<s2:\r\n s1+=l1[f1]\r\n f1+=1\r\n \r\n elif s1>s2:\r\n s2+=l2[f2]\r\n f2+=1\r\n else:\r\n d1=f1\r\n d2=f2\r\n f1+=1\r\n f2+=1\r\n if d1<n:\r\n s1=l1[d1]\r\n if d2<m:\r\n s2=l2[d2]\r\n s+=1\r\n \r\nprint(s)\r\n \r\n \r\n", "a,b = map(int,input().split())\nla = list(map(int,input().split()))\nlb = list(map(int,input().split()))\nsuma ,sumb = 0,0\nsta ,stb = set(),set()\nfor i in range(a):\n suma += la[i]\n sta.add(suma)\nfor i in range(b):\n sumb += lb[i]\n stb.add(sumb)\nsetjiao = sta & stb\nprint(len(setjiao))\n\n\n \t\t\t\t \t\t \t \t \t\t \t \t\t \t", "n, m = [int(x) for x in input().split()]\r\nlst1 = [int(x) for x in input().split()]\r\nlst2 = [int(x) for x in input().split()]\r\nlst1+=[0]\r\nlst2+=[0]\r\ns1 = 0\r\ns2 = 0\r\ni = 0\r\nj = 0\r\nans=0\r\nwhile(len(lst1)>0 and len(lst2)>0):\r\n s1+=lst1[i]\r\n i+=1\r\n s2+=lst2[j]\r\n j+=1\r\n #print(s1,s2, ans)\r\n while(s1!=s2):\r\n if s1>s2:\r\n s2+=lst2[j]\r\n j+=1\r\n elif s2>s1:\r\n s1+=lst1[i]\r\n i+=1\r\n \r\n s1=0\r\n s2=0\r\n ans+=1\r\n if (i>=len(lst1) or len(lst2)<=j):\r\n break\r\nprint(ans-1)\r\n ", "import sys\nn,m = map(int,sys.stdin.readline().split())\na = list(map(int,sys.stdin.readline().split()))\nb = list(map(int,sys.stdin.readline().split()))\nfor i in range(1,n):\n a[i] = a[i-1] + a[i]\nfor i in range(1,m):\n b[i] = b[i-1] + b[i]\nprint(len(set(a) & set(b)))\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\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\ni,j,s1,s2=0,0,0,0\r\n\r\ncount=1\r\n\r\nwhile i <= n-1 and j <= m-1:\r\n if s1==s2 and s1:\r\n count+=1\r\n s1=0\r\n s2=0\r\n elif s1>s2 or not s2:\r\n s2+=y[j]\r\n j+=1\r\n elif s1<s2 or not s1:\r\n s1+=x[i]\r\n i+=1\r\nprint(count)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Mar 13 22:46:16 2018\n\n@author: hsnsd\n\"\"\"\nsize = input()\nblockA = input().split(' ')\nblockB = input().split(' ')\n\n\nbigger = max(len(blockA), len(blockB))\ncount = 0\ncurr = 0\nindexA =0 \nindexB = 0\na =0\nb =0\nflagA = True\nflagB = True\nwhile True:\n if flagA and indexA < len(blockA):\n a = a + int(blockA[indexA])\n #print(str(a))\n if flagB and indexB < len(blockB):\n b = b + int(blockB[indexB])\n #print(str(b))\n if a < b:\n indexA +=1\n flagB = False\n flagA = True\n elif b < a:\n indexB +=1\n flagA = False\n flagB = True\n elif a == b:\n #print('her')\n flagA = True\n flagB = True\n a = 0\n b = 0\n indexA +=1\n indexB +=1\n count +=1\n curr = 0\n if indexA ==len(blockA) and indexB ==len(blockB):\n break\nprint(count)", "# Codeforces Submission\n# User : sudoSieg\n# Time : 14:40:09\n# Date : 21/10/2020\n\nimport io\nimport os\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\nn, m = map(int, input().split())\na = [*map(int, input().split())]\nb = [*map(int, input().split())]\nj = 0\nf = 0\ni = 0\nsi, sj = 0, 0\nwhile i < n or j < m:\n if si > sj:\n sj += b[j]\n j += 1\n elif si < sj:\n si += a[i]\n i += 1\n elif si == sj and sj == 0:\n sj += b[j]\n j += 1\n if si == sj != 0:\n si = 0\n sj = 0\n f += 1\n \nprint(f)\n", "n,m = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\nb = list(map(int, input().split(\" \")))\r\ncount1 = 0\r\ncount2 = 0\r\nres = 0\r\nsum1 = a[0]\r\nsum2 = b[0]\r\nwhile count1 < n-1 or count2 < m-1:\r\n if sum1 > sum2:\r\n count2 += 1\r\n sum2 += b[count2]\r\n elif sum1 < sum2:\r\n count1 += 1\r\n sum1 += a[count1]\r\n else:\r\n res += 1\r\n count1 += 1\r\n count2 += 1\r\n sum1 = a[count1]\r\n sum2 = b[count2]\r\nif sum1 == sum2:\r\n res += 1\r\nprint(res)", "n, m = input().split()\r\nn, m = [int(n), int(m)]\r\n\r\nfirstMessage = [int(i) for i in input().split()]\r\nsecondMessage = [int(i) for i in input().split()]\r\n\r\nans = 0\r\n\r\ni = 0\r\nj = 0\r\n\r\nwhile i < n and j < m:\r\n if firstMessage[i] == secondMessage[j]:\r\n ans += 1\r\n else:\r\n if firstMessage[i] < secondMessage[j]:\r\n Temp = firstMessage[i]\r\n while True:\r\n i += 1\r\n Temp += firstMessage[i]\r\n if Temp == secondMessage[j]:\r\n ans += 1\r\n break\r\n elif Temp > secondMessage[j]:\r\n firstMessage[i] = Temp\r\n i -= 1\r\n j -= 1\r\n break\r\n\r\n else:\r\n Temp = secondMessage[j]\r\n while True:\r\n j += 1\r\n Temp += secondMessage[j]\r\n if Temp == firstMessage[i]:\r\n ans += 1\r\n break\r\n elif Temp > firstMessage[i]:\r\n secondMessage[j] = Temp\r\n i -= 1\r\n j -= 1\r\n break\r\n i += 1\r\n j += 1\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split(\" \"))\nx=list(input().split(\" \"))\nx=[int(number) for number in x]\ny=list(input().split(\" \"))\ny=[int(number) for number in y]\ncount=0\ni=0\nj=0\nsumx=x[i]\nsumy=y[j]\nwhile i!=n-1 and j!=m-1:\n if sumx==sumy:\n count+=1\n i+=1\n j+=1\n sumx=x[i]\n sumy=y[j]\n elif sumx<sumy:\n i+=1\n sumx+=x[i]\n else:\n j+=1\n sumy+=y[j]\nprint(count+1)", "def arr_sums(a):\r\n sum_arr = set()\r\n sums = 0\r\n for i in a:\r\n sums += i\r\n sum_arr.add(sums)\r\n return sum_arr\r\n\r\nlena, lenb = [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\nass = arr_sums(a)\r\nbs = arr_sums(b)\r\nprint(len(ass&bs))", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\ni=0\r\nj=0\r\ns1=0\r\ns2=0\r\ncount=1\r\nwhile i<n and j<m:\r\n if s1==s2 and s1>0:\r\n count+=1\r\n s1=0\r\n s2=0\r\n elif s1>s2 or s2==0:\r\n s2+=y[j]\r\n j+=1\r\n elif s1<s2 or s1==0:\r\n s1+=x[i]\r\n i+=1\r\nprint(count)", "n, m = map(int, input().split())\r\nfich1 = list(map(int, input().split()))\r\nfich2 = list(map(int, input().split()))\r\ni = j = ans = 0\r\nbloc1, bloc2 = fich1[0], fich2 [0]\r\nwhile i <= (n - 2) and j <= (m - 2):\r\n #print(\"{} {} || {} {}\".format(i, j, bloc1, bloc2))\r\n if bloc1 < bloc2:\r\n i += 1\r\n bloc1 += fich1[i]\r\n continue\r\n if bloc1 > bloc2:\r\n j += 1\r\n bloc2 += fich2[j]\r\n continue\r\n if bloc1 == bloc2:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n bloc1 = fich1[i]\r\n bloc2 = fich2[j]\r\n\r\nprint(ans + 1)\r\nexit()\r\n", "n, m = map(int, input().split())\nX = list(map(int, input().split()))\nY = list(map(int, input().split()))\nfrom itertools import accumulate\nCX = list(accumulate(X))\nCY = list(accumulate(Y))\nCY = set(CY)\nans = 0\nfor x in CX:\n if x in CY:\n ans += 1\nprint(ans)\n", "# cook your dish here\na, b = input().split()\nal = list(map(int, input().split(' ')))\nbl = list(map(int, input().split(' ')))\n#print(a)\ni, j = 0, 0\nx = al[i]\ny = bl[j]\nz = 0\nwhile True:\n if x > y:\n j = j + 1\n y = y + bl[j]\n elif y > x:\n i = i + 1\n x = x + al[i]\n else:\n if i==len(al)-1 or j == len(bl)-1:\n break\n else:\n i=i+1\n j=j+1\n x = al[i]\n y = bl[j]\n z = z + 1\n\nprint(z+1)\n\n \n \n \n ", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ni, j = 0, 0\nsumi, sumj = 0, 0\nans = 0\nwhile i < n and j < m:\n if sumi == sumj and sumi != 0:\n ans += 1\n sumi, sumj = 0, 0\n elif sumi < sumj:\n sumi += a[i]\n i += 1\n else:\n sumj += b[j]\n j += 1\nprint(ans + (1 if i < n or j < m else 0))\n", "import sys\nreadline = sys.stdin.readline\n\nN, M = map(int, readline().split())\nx = list(map(int, readline().split()))\ny = list(map(int, readline().split()))\n\nxs = 0\nys = 0\nans = 0\nwhile len(x) > 0 and len(y) > 0:\n if xs <= ys:\n xs += x.pop()\n else:\n ys += y.pop()\n if xs == ys:\n ans += 1\nprint(ans + 1)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[0]*1000001\r\nd=[0]*1000001\r\ncount=sum1=sum2=0\r\nfor i in range(max(n,m)):\r\n try:\r\n sum1+=a[i]\r\n c[i]+=sum1\r\n except:k=0\r\n try:\r\n sum2+=b[i]\r\n d[sum2]+=1\r\n except:k=0\r\nfor i in c:\r\n if d[i]==1:\r\n count+=1\r\nprint(count)\r\n \r\n \r\n ", "n,m=map(int,input().split())\r\nA=[int(i) for i in input().split()]\r\nB=[int(i) for i in input().split()]\r\ni=1\r\nj=1\r\nsmA=A[0]\r\nsmB=B[0]\r\ncnt=0\r\nwhile i<n or j<m:\r\n # print(smA,smB)\r\n if smA==smB:\r\n cnt+=1 \r\n if i==n-1 and j==m-1:\r\n break\r\n smA=A[i]\r\n smB=B[j]\r\n i+=1 \r\n j+=1 \r\n elif smA<smB:\r\n smA+=A[i] \r\n i+=1\r\n else:\r\n smB+=B[j]\r\n j+=1\r\nprint(cnt+1)", "d = str(input())\r\nw = []\r\n\r\nfor i in d.split():\r\n w.append(int(i))\r\n\r\nn = w[0]\r\nm = w[1]\r\n\r\ns1 = str (input())\r\ns2 = str (input())\r\n\r\na = []\r\nb = []\r\n\r\nfor i in s1.split():\r\n a.append(int(i))\r\n\r\nfor i in s2.split():\r\n b.append(int(i))\r\n\r\np, q, r, j = 0, 0, 0, 0\r\nfor i in a:\r\n p += i\r\n while p > q:\r\n q += b[j]\r\n j += 1\r\n if p == q:\r\n r += 1; p, q = 0, 0\r\nprint (r)", "from collections import deque\n\ndef solve(n, m, blocks_1, blocks_2):\n blocks_1 = deque(blocks_1)\n blocks_2 = deque(blocks_2)\n sum_1 = blocks_1.popleft()\n sum_2 = 0\n ans = 0\n\n while len(blocks_1) > 0 and len(blocks_2) > 0:\n if sum_1 < sum_2:\n sum_1 += blocks_1.popleft()\n else:\n sum_2 += blocks_2.popleft()\n if sum_1 == sum_2:\n ans += 1\n \n if len(blocks_1) + len(blocks_2) > 0:\n ans += 1\n\n return ans\n \n \n\nif __name__ == '__main__':\n n, m = list(map(int, input().split()))\n blocks_1 = list(map(int, input().split()))\n blocks_2 = list(map(int, input().split()))\n print(solve(n, m, blocks_1, blocks_2))\n\n \t\t \t \t\t\t \t\t\t\t\t \t \t\t\t", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nres = 0\ni = j = 0\nsu1 = a[i]\nsu2 = b[j]\nwhile True:\n\n if su1 == su2:\n res+=1\n i+=1\n j+=1\n if i == n or j == m:\n break\n su1 = a[i]\n su2 = b[j]\n else:\n if su1 < su2:i+=1;su1+=a[i]\n else: j+=1;su2+=b[j]\nprint(res)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nc, i, j, x, y = 1, 0, 0, 0, 0\r\nwhile i < n or j < m:\r\n if x == 0:\r\n x += a[i]\r\n i += 1\r\n\r\n if x > y:\r\n y += b[j]\r\n j += 1\r\n elif x < y:\r\n x += a[i]\r\n i += 1\r\n else:\r\n c += 1\r\n x = y = 0\r\nprint(c)\r\n", "def cin():\n return map(int,input().split())\ndef rar():\n return list(cin())\n \n \nn , m = cin()\na = rar()\nb = rar()\nmp = {}\nx = 0;s = 0\nfor i in range(n):\n s = a[i]+x\n mp[s]=1\n x=s\n \nx=0;s=0\nans = 0\nfor i in range(m):\n s = b[i]+x\n if s in mp:\n ans+=1\n x=s\nprint(ans)\n", "Count = 0\r\nSizes = list(map(int, input().split()))\r\nL1 = list(map(int, input().split()))\r\nL2 = list(map(int, input().split()))\r\nSum1, Sum2 = L1[0], L2[0]\r\ni = 0\r\nj = 0\r\nwhile True:\r\n if Sum1 > Sum2:\r\n j += 1\r\n Sum2 += L2[j]\r\n elif Sum2 > Sum1:\r\n i += 1\r\n Sum1 += L1[i]\r\n else:\r\n Count += 1\r\n i += 1\r\n j += 1\r\n if i == Sizes[0] or j == Sizes[1]:\r\n break\r\n else:\r\n Sum1 += L1[i]\r\n Sum2 += L2[j]\r\nprint(Count)\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: Preparing for UBCOMP4 and new starting\r\n# CodeNumber: 611\r\n", "def s():\r\n c, v = 0, set()\r\n for x in map(int, input().split()):\r\n c += x\r\n v.add(c)\r\n return v\r\nn, m = map(int, input().split())\r\nprint(len(s() & s()))", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ntotal_a = 0\r\ntotal_b = 0\r\nl = 0\r\nr = 0\r\ntotal = 0\r\n\r\nwhile l < len(a)-1 or r < len(b)-1:\r\n #print(l,r, total_a, total_b, total)\r\n if (r == len(b)-1 or total_a < total_b) and l != len(a)-1:\r\n \r\n total_a += a[l]\r\n l += 1\r\n \r\n else:\r\n \r\n total_b += b[r]\r\n r += 1\r\n\r\n \r\n if total_a == total_b and total_b > 0:\r\n total_a = 0\r\n total_b = 0\r\n total += 1\r\n \r\nprint(total+1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nsa,sb=[],[]\r\nfor i in range(n):sa.append(sa[i-1]+a[i] if i>0 else a[0])\r\nfor j in range(m):sb.append(sb[j-1]+b[j] if j>0 else b[0])\r\nprint(len(set(sa)&set(sb)))", "n,m=map(int,input().split())\r\ns1=list(map(int,input().split()))\r\ns2=list(map(int,input().split()))\r\nsum1=0\r\nsum2=0\r\ni=0\r\nj=0\r\nsl=[]\r\nwhile i<n or j<m:\r\n if sum1==sum2 :\r\n if sum1 != 0:\r\n sl+=[sum1]\r\n sum1=0\r\n sum2=0\r\n sum1+=s1[i]\r\n sum2+=s2[j]\r\n j+=1\r\n i+=1\r\n elif sum2>sum1:\r\n sum1+=s1[i]\r\n i+=1\r\n elif sum1>sum2:\r\n sum2+=s2[j]\r\n j+=1\r\nif sum1==sum2:\r\n sl+=[sum1]\r\nprint(len(sl))", "n,m = map(int,input().split())\r\nl1= list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\ni =0\r\nj =0\r\na = l1[i]\r\nb = l2[i]\r\nres = 0\r\nwhile(True):\r\n if(a<b):\r\n i=i+1\r\n a = a+l1[i]\r\n elif(b<a):\r\n j= j+1\r\n b= b+l2[j]\r\n else:\r\n i=i+1\r\n j =j+1\r\n if(i==n and j==m ):\r\n pass\r\n else:\r\n a= l1[i]\r\n b= l2[j]\r\n res =res+1 \r\n if(i==n and j == m):\r\n break\r\nprint(res)\r\n\r\n\r\n\r\n", "m,n=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ni=j=1\r\nk=0\r\nx=a[0]\r\ny=b[0]\r\nwhile i<m or j<n:\r\n if x==y:\r\n k+=1\r\n x,y=a[i],b[j]\r\n i+=1\r\n j+=1\r\n elif x>y:\r\n y+=b[j]\r\n j+=1\r\n else:\r\n x+=a[i]\r\n i+=1\r\nif x==y:\r\n k+=1\r\nprint(k)\r\n ", "def binary_search(arr, x, l):\r\n r = len(arr) - 1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if arr[mid] == x:\r\n return mid\r\n elif arr[mid] > x:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return -1\r\n\r\n\r\ndef main():\r\n n, m = list(map(int, input().split()))\r\n arr1 = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split()))\r\n\r\n presum_arr1 = [0]\r\n for i in range(n):\r\n presum_arr1.append(presum_arr1[-1] + arr1[i])\r\n\r\n presum_arr2 = [0]\r\n for i in range(m):\r\n presum_arr2.append(presum_arr2[-1] + arr2[i])\r\n\r\n pointer1, pointer2 = 0, 0\r\n counter = 0\r\n for i in range(1, n + 1):\r\n s = presum_arr1[i] - presum_arr1[pointer1]\r\n\r\n j_index = binary_search(presum_arr2, s + presum_arr2[pointer2], pointer2 + 1)\r\n if j_index != -1:\r\n counter += 1\r\n pointer1 = i\r\n pointer2 = j_index\r\n\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "q=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nf=0\r\nx=a[0]\r\ny=b[0]\r\ni=0\r\nj=0\r\nwhile i<q[0] and j<q[1]:\r\n if x==y:\r\n f+=1\r\n if i==q[0]-1 and j==q[1]-1 :\r\n break\r\n x=a[i+1]\r\n y=b[j+1]\r\n i+=1\r\n j+=1\r\n elif x>y:\r\n y+=b[j+1]\r\n j+=1\r\n else:\r\n x+=a[i+1]\r\n i+=1\r\n \r\nprint(f)\r\n \r\n \r\n ", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\ns1=0\r\ns2=0\r\nj=0\r\nfor i in range(n):\r\n\ts1=s1+a[i]\r\n\twhile(s1>s2):\r\n\t\ts2=s2+b[j]\r\n\t\tj=j+1\r\n\tif(s1==s2):\r\n\t\tc=c+1\r\n\t\ts1=0\r\n\t\ts2=0\r\ns1=0\r\ns2=0\r\nj=0\r\nfor i in range(m):\r\n\ts2=s2+b[i]\r\n\twhile(s1>s2):\r\n\t\ts2=s2+a[j]\r\n\t\tj=j+1\r\n\tif(s1==s2):\r\n\t\tc=c+1\r\n\t\ts1=0\r\n\t\ts2=0\r\nprint(c)", "n, m = map(int, input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int, input().split()))\r\ni = 0\r\nj = 0\r\nk = 0\r\nwhile i != n and j != m:\r\n sa = a[i]\r\n sb = b[j]\r\n while sa != sb:\r\n if sa < sb:\r\n i += 1\r\n sa += a[i]\r\n elif sb < sa:\r\n j += 1\r\n sb += b[j]\r\n k += 1\r\n i += 1\r\n j += 1\r\nprint(k)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ni, j = 0, 0\r\nsa, sb = 0, 0\r\nans = 0\r\nwhile i < n:\r\n if sa == sb:\r\n ans += 1\r\n sa += a[i]\r\n sb += b[j]\r\n i += 1\r\n j += 1\r\n elif sa > sb:\r\n sb += b[j]\r\n j += 1\r\n else:\r\n sa += a[i]\r\n i += 1\r\nprint(ans)# 1698407402.495163", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ni = 0\r\nj = 0\r\ns = a[0]\r\nt = b[0]\r\nk = 0\r\nwhile i != n and j != m:\r\n while s < t:\r\n i += 1\r\n s += a[i]\r\n while t < s:\r\n j += 1\r\n t += b[j]\r\n if s == t:\r\n i += 1\r\n j += 1\r\n k += 1\r\n if i != n:\r\n s = a[i]\r\n t = b[j]\r\nprint(k)", "n, m = (int(x) for x in input().split())\r\nx = [int(x) for x in input().split()]\r\ny = [int(x) for x in input().split()]\r\n\r\ni = 0\r\nj = 0\r\nsum_x = x[i]\r\nsum_y = y[j]\r\ncount = 0\r\nwhile True:\r\n\r\n if i == n and j == m:\r\n break\r\n elif i == n:\r\n if sum_y == sum_x and sum_y != 0:\r\n count += 1\r\n break\r\n elif sum_y > sum_x:\r\n break\r\n elif sum_x > sum_y:\r\n for k in range(j, m-1):\r\n j += 1\r\n sum_y += y[j]\r\n if sum_x == sum_y:\r\n count += 1\r\n break\r\n break\r\n\r\n elif j == m:\r\n if sum_y == sum_x and sum_y != 0:\r\n count += 1\r\n break\r\n elif sum_x > sum_y:\r\n break\r\n elif sum_y > sum_x:\r\n for k in range(i, n-1):\r\n i += 1\r\n sum_x += x[i]\r\n if sum_x == sum_y:\r\n count += 1\r\n break\r\n break\r\n\r\n if sum_x > sum_y:\r\n j += 1\r\n if i == n or j == m:\r\n break\r\n sum_y += y[j]\r\n\r\n elif sum_y > sum_x:\r\n i += 1\r\n if i == n or j == m:\r\n break\r\n sum_x += x[i]\r\n else:\r\n count += 1\r\n i += 1\r\n j += 1\r\n if i == n or j == m:\r\n break\r\n sum_x = 0\r\n sum_x += x[i]\r\n sum_y = 0\r\n sum_y += y[j]\r\n\r\nprint(count)", "import math\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n x = [int(i) for i in input().split(\" \")]\r\n y = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n index_x = 0\r\n index_y = 0\r\n collector_x = 0\r\n collector_y = 0\r\n while True:\r\n if index_x == len(x):\r\n counter += 1\r\n break\r\n elif index_y == len(y):\r\n counter += 1\r\n break\r\n elif collector_y == collector_x and collector_x != 0:\r\n counter += 1\r\n collector_x = 0\r\n collector_y = 0\r\n elif collector_x == collector_y:\r\n collector_x += x[index_x]\r\n index_x += 1\r\n elif collector_x > collector_y:\r\n collector_y += y[index_y]\r\n index_y += 1\r\n else:\r\n collector_x += x[index_x]\r\n index_x += 1\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "from sys import stdin,stdout\nimport bisect as bs\nfrom itertools import accumulate\nnmbr = lambda: int(stdin.readline())\nlst = lambda: list(map(int, stdin.readline().split()))\nfor _ in range(1):\n na,nb=lst()\n a=list(accumulate(lst()))\n b=lst()\n ans=sm=0\n for v in b:\n sm+=v\n p=bs.bisect_left(a,sm)\n if a[p]==sm:ans+=1\n print(ans)\n\t\t\t\t \t\t\t\t\t \t \t \t\t \t \t \t \t", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\ni = 0\r\nj = 0\r\nsi = x[0]\r\nsj = y[0]\r\nt = 0\r\nwhile i < n and j < m:\r\n\tif si < sj:\r\n\t\ti += 1\r\n\t\tsi += x[i]\r\n\telif si > sj:\r\n\t\tj += 1\r\n\t\tsj += y[j]\r\n\telse:\r\n\t\tt += 1\r\n\t\ti += 1\r\n\t\tj += 1\r\n\t\tif i >= n or j >= m:\r\n\t\t\tbreak \r\n\t\tsi = x[i]\r\n\t\tsj = y[j]\r\n\r\nprint(t)", "#~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\r\n#Idea\r\n#~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\r\n#Essentially scan through the two lists simultaneously while keeping a subtotal. Call the two\r\n#sequences X and Y. If the subtotals are not equal, get an element from the sequence with the smaller\r\n#subtotal and add it in. If they are equal, we have found a possible end for a file. Add one to the\r\n#max possible number of files and continue scanning. When the subtotals are equal, default to picking\r\n#a term from the first sequence.\r\n\r\n#For fast I/O\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nHomura = [int(i) for i in input().split()]\r\nm = Homura[0]\r\nn = Homura[1]\r\n\r\nl_x = [int(i) for i in input().split()]\r\nl_y = [int(i) for i in input().split()]\r\n\r\nsub_x = 0 #Current subtotal for sequence X\r\nsub_y = 0 #Current subtotal for sequence Y\r\ni_x = 0 #Current index while scanning sequence X\r\ni_y = 0 #Current index while scanning sequence Y\r\nans = 0 #Answer aka max number of possible files\r\n\r\n#Terminate when one of the sequences has been fully scanned\r\nwhile i_x < m and i_y < n:\r\n\tif sub_x == sub_y: #Equal subtotals\r\n\t\tans += 1 #Possible file start\r\n\t\tsub_x += l_x[i_x] #Default add a term to X's subtotal\r\n\t\ti_x += 1 #Move X's scanner up\r\n\telif sub_x < sub_y: #X has a smaller subtotal\r\n\t\tsub_x += l_x[i_x] #Add a term to X's subtotal to close the gap\r\n\t\ti_x += 1 #Move X's scanner up\r\n\telif sub_x > sub_y: #Y has a smaller subtotal\r\n\t\tsub_y += l_y[i_y] #Add a term to Y's subtotal to close the gap\r\n\t\ti_y += 1 #Move Y's scanner up\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\n\nxp, yp, xs, ys = 0, 0, -1, -1\n\nc = 0\n\nwhile True:\n try:\n if xs == -1:\n xs = x[xp]\n ys = y[yp]\n xp += 1\n yp += 1\n elif xs < ys:\n xs += x[xp]\n xp += 1\n elif xs > ys:\n ys += y[yp]\n yp += 1\n elif xs == ys:\n c += 1\n xs = -1\n ys = -1\n except IndexError:\n break\n\n\nprint(c)\n", "n, m = list(map(int, input().strip().split()))\nxs = list(map(int, input().strip().split()))\nys = list(map(int, input().strip().split()))\n\nsumx = []\ncur = 0\nfor i in range(n):\n cur += xs[i]\n sumx.append(cur)\n\n#sumy = []\ncur = 0\nres = 0\ni = 0\nfor j in range(m):\n cur += ys[j]\n #sumy.append(cur)\n while cur > sumx[i]:\n i += 1\n if cur == sumx[i]:\n res += 1\n i += 1\nprint(res)\n\n'''\nres = 0\nd = []\nfor item in sumx:\n if item in sumy:\n #j = sumy.index(item)\n #d[i] = j\n res += 1\nprint(res)\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=list(map(int,input().split()))\r\nt1=0\r\nt2=-1\r\ns1=a[0]\r\ns2=0\r\nans=0\r\nwhile t1<len(a) and t2<len(b):\r\n if s1<s2:\r\n t1+=1\r\n s1+=a[t1]\r\n elif s1>s2:\r\n t2+=1\r\n s2+=b[t2]\r\n else:\r\n ans+=1\r\n t1+=1\r\n if t1<len(a):s1=a[t1]\r\n s2=0\r\nprint(ans)\r\n", "primera_linea=input()\r\nmensaje_1 = input()\r\nmensaje_2 = input()\r\n\r\nn,m = primera_linea.split(' ')\r\nlargos_1 = mensaje_1.split(' ')\r\nlargos_2 = mensaje_2.split(' ')\r\n\r\nresultado = suma_1 = suma_2 = i = j = 0\r\nn = int(n)\r\nm = int(m)\r\n\r\nwhile True:\r\n if i >= n and j >= m:\r\n\t break\r\n if suma_1 <= suma_2:\r\n suma_1 += int(largos_1[i])\r\n i += 1\r\n else:\r\n suma_2 += int(largos_2[j])\r\n j += 1\r\n if suma_1 == suma_2:\r\n resultado += 1\r\n\r\nprint(resultado)", "n, m = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nprefix1 = [l[0]] + [0] * (n-1)\r\nprefix2 = [b[0]] + [0] * (m-1)\r\n\r\n\r\nfor i in range(1, max(n, m)):\r\n\tif i < n:\r\n\t\tprefix1[i] += (l[i] + prefix1[i-1])\r\n\tif i < m:\r\n\t\tprefix2[i] += (b[i] + prefix2[i-1])\r\n\r\ns = (m+n) - len(set(prefix1+prefix2))\r\n\r\nprint(s)", "I = lambda: map(int, input().split())\r\n\r\nn, m = I()\r\nX, Y = list(I()), list(I())\r\ni = j = k = x = y = 0\r\n\r\nwhile i < n and j < m:\r\n if x < y:\r\n x += X[i]\r\n i += 1\r\n elif x > y:\r\n y += Y[j]\r\n j += 1\r\n elif x > 0:\r\n x = y = 0\r\n k += 1\r\n else:\r\n x += X[i]\r\n i += 1\r\n\r\nprint(k+1)", "R = lambda:list(map(int,input().split()))\r\nR()\r\na,b,sa,sb,i,j = R(),R(),0,0,0,0\r\nfor x in a:\r\n sa += x\r\n while sb < sa:\r\n sb += b[j]\r\n j += 1\r\n if sb == sa:\r\n i += 1\r\nprint(i)\r\n", "lengthOfMessage1 , lengthOfMessage2 = map(int, input().split())\r\nmessage1 = list(map(int, input().split()))\r\nmessage2 = list(map(int, input().split()))\r\niA = 0\r\niB = 0\r\nsum1 = message1[0]\r\nsum2 = message2[0]\r\nfile = 0\r\nwhile iA<lengthOfMessage1 and iB<lengthOfMessage2:\r\n if sum1 == sum2:\r\n file+=1\r\n if iA == lengthOfMessage1 - 1:\r\n break\r\n else:\r\n iA+=1\r\n if iB == lengthOfMessage2 - 1:\r\n break\r\n else:\r\n iB+=1\r\n sum1 = message1[iA]\r\n sum2 = message2[iB]\r\n elif sum1>sum2:\r\n if iB == lengthOfMessage2-1:\r\n break\r\n else:\r\n iB+=1\r\n sum2+=message2[iB]\r\n else:\r\n if iA == lengthOfMessage1 - 1:\r\n break\r\n else:\r\n iA+=1\r\n sum1+=message1[iA]\r\nprint(file)\r\n", "import sys\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\n\nans = 0\nxi = 0\nyi = 0\nsum_x = 0\nsum_y = 0\nwhile True:\n if sum_x == sum_y and sum_x != 0:\n ans += 1\n sum_x = 0\n sum_y = 0\n if xi == n and yi == m :\n break\n continue\n if sum_x < sum_y:\n sum_x += x[xi]\n xi += 1\n elif sum_x > sum_y:\n sum_y += y[yi]\n yi += 1\n else:\n sum_x += x[xi]\n xi += 1\nprint(ans)\n\t\t \t \t \t\t \t \t\t \t\t \t \t\t\t \t\t\t", "\nn, m = list(map(int, input().split()))\n\nan = list(map(int, input().split()))\nam = list(map(int, input().split()))\n\n\npa = 0\npb = 0\nrunningSuma = an[0]\nrunningSumb = am[0]\ncount = 0\n\nwhile (pa < n and pb < m):\n\n if (runningSuma == runningSumb and runningSuma != 0):\n count+=1\n pa+=1\n pb+=1\n if (pa < n and pb < m):\n runningSuma = an[pa]\n runningSumb = am[pb]\n elif (runningSumb > runningSuma):\n pa+=1\n runningSuma += an[pa]\n else:\n pb+=1\n runningSumb += am[pb]\n\nprint(count)\n\n", "n, m = [int(k) for k in input().split(' ') if k]\nx = [int(k) for k in input().split(' ') if k]\ny = [int(k) for k in input().split(' ') if k]\ncount = 0\npx = 0\npy = 0\n'''\nsx = [0 for _ in range(len(x) + 1)]\nsy = [0 for _ in range(len(x) + 1)]\nfor i in range(len(x)):\n sx[i + 1] = sx[i] + x[i]\n sy[i + 1] = sy[i] + y[i]\n'''\nwhile px < len(x) and py < len(y):\n delta = x[px] - y[py]\n while delta != 0:\n if delta > 0:\n assert py + 1 < len(y)\n while delta > 0 and py + 1 < len(y):\n py += 1\n delta -= y[py]\n if delta < 0:\n assert px + 1 < len(x)\n while delta < 0 and px + 1 < len(x):\n px += 1\n delta += x[px]\n count += 1\n px += 1\n py += 1\nprint(count)\n", "import sys\r\nimport bisect\r\ninput=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10**9+7\r\nfor _ in range(t):\r\n #n=int(input())\r\n n,m=map(int,input().split())\r\n l1=list(map(int,input().split()))\r\n l2=list(map(int,input().split()))\r\n #pref=[[0 for j in range(3001)] for i in range(n+2)]\r\n \r\n i,j=0,0\r\n suma1,suma2=l1[0],l2[0]\r\n ans=0\r\n while i<n and j<m:\r\n #print(suma1,suma2,i,j)\r\n if suma1==suma2:\r\n suma1,suma2=0,0\r\n ans+=1\r\n i+=1\r\n j+=1\r\n if i<n:\r\n suma1+=l1[i]\r\n if j<m:\r\n suma2+=l2[j]\r\n elif suma1>suma2:\r\n j+=1\r\n if j<m:\r\n suma2+=l2[j]\r\n \r\n else:\r\n i+=1\r\n if i<n: \r\n suma1+=l1[i]\r\n print(ans) \r\n ", "n, m = list(map(int, input().split()))\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\nfilesCnt = 0\n\nxs = 0\nys = 0\n\nxcnt = 0\nycnt = 0\n\nwhile n >= xcnt or m >= ycnt:\n # print(xs, ys)\n if xs == ys and xs != 0:\n filesCnt += 1\n xs = 0\n ys = 0\n if n > xcnt or m > ycnt:\n continue\n else:\n break\n\n else:\n if xs > ys:\n ys += y[ycnt]\n ycnt += 1\n else:\n xs += x[xcnt]\n xcnt += 1\n\nprint(filesCnt)", "n,m = map(int,input().split(' '))\r\na = list(map(int,input().split(' ')))\r\nb = list(map(int,input().split(' ')))\r\ni = j = 0\r\nsa = a[0]\r\nsb = b[0]\r\nk = 0\r\nwhile i<n-1 and j<m-1:\r\n if sa<sb:\r\n i+=1\r\n sa+=a[i]\r\n elif sb<sa:\r\n j+=1\r\n sb+=b[j]\r\n else:\r\n i+=1\r\n j+=1\r\n sa+=a[i]\r\n sb+=b[j]\r\n k+=1\r\n\r\nif i<n or j<m:\r\n k+=1\r\nprint(k)\r\n", "n, m = map (int, input ().split ())\r\nx = list (map (int, input ().split ()))\r\ny = list (map (int, input ().split ()))\r\nprex = [0] * n; prey = [0] * m\r\nfor i in range (n) : prex[i] = prex[i - 1] + x[i]\r\nfor i in range (m) : prey[i] = prey[i - 1] + y[i]\r\np = 0; ans = 0\r\nfor i in range (n) :\r\n while p + 1 < m and prey[p + 1] <= prex[i] : p += 1\r\n if prex[i] == prey[p] : ans += 1\r\nprint (ans)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\ni=0\r\nj=0\r\ncnt1=l[0]\r\ncnt2=l1[0]\r\ncnt3=0\r\nwhile(i<n and j<m):\r\n if cnt1<cnt2:\r\n if i<n:\r\n i+=1\r\n cnt1+=l[i]\r\n elif cnt2<cnt1:\r\n if j<m:\r\n j+=1\r\n cnt2+=l1[j]\r\n else:\r\n cnt3+=1\r\n j+=1\r\n i+=1\r\n if i>=n and j>=m:\r\n break\r\n \r\n cnt1+=l[i]\r\n cnt2+=l1[j]\r\nprint(cnt3)\r\n ", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nx = a[0]\r\ny = b[0]\r\ni = 0\r\nj = 0\r\nans = []\r\nwhile(1):\r\n if(x<y):\r\n if(i<n):\r\n x+=a[i+1]\r\n i+=1\r\n if(y<x):\r\n if(j<m):\r\n y+=b[j+1]\r\n j+=1\r\n if(x==y):\r\n ans.append(x)\r\n i+=1\r\n j+=1\r\n if(i<n):\r\n x = a[i]\r\n if(j<m):\r\n y = b[j]\r\n if(i>n-1 and j>m-1):\r\n break\r\nprint(len(ans))\r\n ", "import sys\r\n\r\nl = next(sys.stdin).split()\r\nl1 = int(l[0])\r\nlst1 = [int(x) for x in next(sys.stdin).split()]\r\nlst2 = [int(x) for x in next(sys.stdin).split()]\r\n\r\nfiles = x1 = x2 = 0\r\n\r\nwhile (x1 != l1):\r\n sum1 = lst1[x1]\r\n sum2 = lst2[x2]\r\n while(sum1 != sum2):\r\n if sum1 < sum2:\r\n x1 += 1\r\n sum1 += lst1[x1]\r\n else:\r\n x2 += 1\r\n sum2 += lst2[x2]\r\n x1 += 1\r\n x2 += 1\r\n files += 1\r\n\r\nprint(files)\r\n", "def main():\r\n n, m = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n y = list(map(int, input().split()))\r\n\r\n i = 0\r\n number = 0\r\n\r\n xi = 0\r\n yi = 0\r\n c = 1\r\n \r\n while i < n+m:\r\n if not i:\r\n number_x = x[xi]\r\n xi += 1\r\n number_y = y[yi]\r\n yi += 1\r\n i += 1\r\n else:\r\n if number_x > number_y:\r\n number_y += y[yi]\r\n yi += 1\r\n elif number_y > number_x:\r\n number_x += x[xi]\r\n xi += 1\r\n else:\r\n c += 1\r\n number_x = x[xi]\r\n xi += 1\r\n number_y = y[yi]\r\n yi += 1\r\n i += 1\r\n i += 1\r\n print(c)\r\n \r\nif __name__ == '__main__':\r\n main()", "def main():\n input()\n x = r = 0\n a, b = (list(map(int, input().split())) for _ in 'ab')\n while a or b:\n if x < 0:\n x += a.pop()\n elif x > 0:\n x -= b.pop()\n else:\n r += 1\n x += a.pop() - b.pop()\n print(r)\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "x = int(input())\r\nhash = []\r\nfor i in range(10):\r\n hash.append(0)\r\nt = x\r\nwhile t > 0:\r\n hash[t % 10] = 1\r\n t //= 10\r\nans = 0\r\ni = 1\r\nwhile i * i <= x:\r\n if x % i == 0:\r\n t = i\r\n while t > 0 and hash[t % 10] == 0:\r\n t //= 10\r\n if t > 0:\r\n ans += 1\r\n if x // i != i:\r\n t = x // i\r\n while t > 0 and hash[t % 10] == 0:\r\n t //= 10\r\n if t > 0:\r\n ans += 1\r\n i += 1\r\nprint(ans)", "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\nn = int(rd())\r\ni = 1 \r\ndef compare(x,y):\r\n\tflag = False\r\n\tfor i in x :\r\n\t\tif i in y :\r\n\t\t\tflag = True\r\n\t\t\tbreak\r\n\treturn flag == True\r\nif n == 1 :\r\n\tprint(1)\r\nelse:\t\r\n\tcounter = 0 \r\n\twhile i * i <= n:\r\n\t\tif n % i ==0 :\r\n\t\t\tresult = compare(str(i),str(n))\r\n\t\t\tresult2 = compare(str(n//i),str(n))\r\n\t\t\tif (n//i) == i:\r\n\t\t\t\tresult = False\r\n\t\t\tcounter+=(result2+result)\r\n\t\ti+=1\r\n\tprint(counter)\r\n", "x=int(input())\r\ndef check(d):\r\n if any(i in str(x) for i in str(d)):\r\n return 1 \r\n return 0 \r\ncnt=0 \r\nfrom math import sqrt as S \r\nfor i in range(1,int(S(x))+1):\r\n if x%i==0:\r\n cnt+=check(i)\r\n if i!=x//i:\r\n cnt+=check(x//i)\r\nprint(cnt)", "from math import *\r\nn = int(input())\r\nl = []\r\nc = 0\r\nfor i in range(1, floor(sqrt(n)) + 1):\r\n if n % i == 0:\r\n if n//i == i:\r\n l.append(i)\r\n else:\r\n l.append(n//i)\r\n l.append(i)\r\nl2 = [0]*10\r\nm = n\r\nwhile m != 0:\r\n l2[m % 10] += 1\r\n m //= 10\r\n\r\nfor i in range(len(l)):\r\n e = l[i]\r\n flag = False\r\n l1 = [0]*10\r\n while e != 0:\r\n l1[e % 10] += 1\r\n e //= 10\r\n for _ in range(10):\r\n if l1[_] >= 1 and l2[_] >= 1:\r\n flag = True\r\n if flag:\r\n c += 1\r\n\r\nprint(c)\r\n", "from math import sqrt\r\nn = int(input())\r\ndivisors = set()\r\ndivisors.add(\"1\")\r\ndivisors.add(str(n))\r\nfor i in range(2, int(sqrt(n)) + 1):\r\n if not bool(n%i):\r\n divisors.add(str(i))\r\n if ((n/i) != i):\r\n divisors.add(str(int(n/i)))\r\nanswer = set()\r\nfor digit in str(n):\r\n for divisor in divisors:\r\n for p in divisor:\r\n if (digit == p):\r\n answer.add(divisor)\r\n break;\r\nprint(len(answer))\r\n", "import math\r\n\r\ndef verif(x,y):\r\n ok=False\r\n x=str(x)\r\n y=str(y)\r\n for e in x:\r\n if e in y:\r\n ok=True\r\n break\r\n return ok\r\n\r\n\r\n\r\nx=int(input())\r\nres=0\r\nfor i in range(1,int(math.sqrt(x))+1):\r\n if x%i==0:\r\n if verif(x,i):\r\n res+=1\r\n if x//i!=i and verif(x,x//i):\r\n res+=1\r\nprint(res)", "n = int(input())\r\nans = 0\r\ni = 1\r\nwhile i*i<=n:\r\n f = 0\r\n if n%i==0:\r\n num = n//i\r\n num1 = i\r\n if num == num1:f=1\r\n if len(set(list(str(num))).intersection(set(list(str(n))))):\r\n ans+=1\r\n if len(set(list(str(num1))).intersection(set(list(str(n))))) and f == 0:\r\n ans+=1\r\n i+=1\r\nprint(ans)", "'''input\n10\n'''\ndef factor(n):\n\treturn list(set(sum([[x, n//x] for x in range(1, int(n**0.5)+1) if n % x == 0], [])))\ndef same(a, b):\n\tif any(d in str(a) and d in str(b) for d in \"0123456789\"):\n\t\treturn True\n\treturn False\nn = int(input())\nt = 0\nfor x in factor(n):\n\tif same(x, n):\n\t\tt += 1\nprint(t)", "x=int(input())\r\nd=set([1,x])\r\nfor y in range(2,int(x**0.5)+1):\r\n if x%y==0:\r\n d.add(y)\r\n d.add(x//y)\r\nans=0\r\nz1=set(list(str(x)))\r\nfor z in d:\r\n z2=set(list(str(z)))\r\n if z1&z2:\r\n ans+=1\r\nprint(ans)\r\n", "from math import sqrt\r\n\r\n\r\ndef check(n, d):\r\n n = str(n)\r\n d = str(d)\r\n for c in d:\r\n if c in n:\r\n return True\r\n return False\r\n\r\n\r\ndef get_divisors(n):\r\n m = int(sqrt(n)) + 1\r\n divisors = set()\r\n for d in range(1, m):\r\n if n % d == 0:\r\n divisors.add(d)\r\n divisors.add(n // d)\r\n return list(divisors)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n divs = get_divisors(n)\r\n c = 0\r\n for d in divs:\r\n if check(n, d):\r\n c += 1\r\n print(c)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = input()\r\nif n == '1': print(1)\r\nelse:\r\n t, y, x = ['1', n], set(n), int(n)\r\n for d in range(2, int(x ** 0.5) + 1):\r\n if x % d == 0: t += [str(d), str(x // d)]\r\n if t[-1] == t[-2]: t.pop()\r\n print(sum(1 for i in t if set(i) & y))", "import math\r\nimport sys\r\n\r\nn=int(input())\r\nhv=[0]*10\r\n\r\nxn=str(n)\r\nfor i in range(len(xn)):\r\n hv[int(xn[i])]=1\r\n\r\ncnt=1\r\nx=math.sqrt(n)+1\r\n\r\nmp={}\r\nfor i in range(1,int(x)):\r\n if n%i==0:\r\n yn=str(i)\r\n for j in range(len(yn)):\r\n if hv[int(yn[j])]==1:\r\n mp[yn]=1\r\n break\r\n\r\n yn=str(n//i)\r\n for j in range(len(yn)):\r\n if hv[int(yn[j])]==1:\r\n mp[yn]=1;\r\n\r\n\r\nprint(len(mp))", "n=int(input())\r\nif n==1:\r\n print(1)\r\n exit()\r\ncount=0\r\nimport math as m\r\nfor x in range(1,int(m.sqrt(n))+1):\r\n ans=int(n)%int(x)\r\n num=str(n)\r\n nn=str(x)\r\n yy=str(n//x)\r\n for x in nn:\r\n if x in num and ans==0:\r\n #print(nn)\r\n count+=1\r\n break\r\n for x in yy:\r\n if x in num and ans==0 and yy!=nn:\r\n #print(yy)\r\n count+=1\r\n break\r\nif count==0:\r\n count+=1\r\n\r\nprint(count)", "ct = 0\r\na = int(input())\r\nsa1 = [x for x in str(a)]\r\nfor i in range(1, int(a**0.5)+1):\r\n if a%i==0:\r\n if i == a**0.5:\r\n sa2 = [x for x in str(i)]\r\n if set(sa1).intersection(set(sa2)) != set():\r\n ct += 1\r\n else:\r\n sa2 = [x for x in str(i)]\r\n if set(sa1).intersection(set(sa2)) != set():\r\n ct += 1\r\n \r\n sa2 = [x for x in str(int(a/i))]\r\n if set(sa1).intersection(set(sa2)) != set():\r\n ct += 1\r\nprint(ct)\r\n", "from math import sqrt\r\nx = int(input())\r\ncount = 0\r\nfor i in range(1, int(sqrt(x)) + 1):\r\n\tif x%i == 0:\r\n\t\tcount += int(any(j in str(x) for j in str(i)))\r\n\t\tif not i*i == x:\r\n\t\t\tcount += int(any(j in str(x) for j in str(x//i)))\r\nprint(count)\r\n ", "from math import*\r\nx=int(input())\r\nw=0\r\n\r\np=int(sqrt(x))\r\nfor i in range (1,p+1):\r\n if x%i==0:\r\n b=i\r\n test=True\r\n while b!=0 and test :\r\n k=b%10\r\n b=b//10\r\n if str(x).find(str(k))!=-1:\r\n w=w+1\r\n test=False\r\n q=x//i\r\n if (q!=i):\r\n b=q\r\n test=True\r\n while b!=0 and test :\r\n k=b%10\r\n b=b//10\r\n if str(x).find(str(k))!=-1:\r\n w=w+1\r\n test=False\r\nprint(w)\r\n\r\n", "def ok(n,q):\r\n countn,countq=[0]*10,[0]*10\r\n while n>0:\r\n countn[n%10]=1\r\n n//=10\r\n while q>0:\r\n countq[q%10]=1\r\n q//=10\r\n for i in range(10):\r\n if countn[i]==countq[i] and countn[i]>0:\r\n return True\r\n return False\r\nn=int(input())\r\nans=0\r\nsq=int((n)**0.5)\r\nfor i in range(1,sq+1):\r\n if n%i==0 and n//i!=i:\r\n if ok(i,n):\r\n ans+=1\r\n if ok(n//i,n):\r\n ans+=1\r\n if n%i==0 and n//i==i:\r\n if ok(i,n):\r\n ans+=1\r\nprint(ans)", "from math import sqrt\n\n\nn = int(input())\nans = 0\ndef match(num1,num2):\n for i in str(num1):\n if i in str(num2):\n return True\n return False\n\nfor i in range(1,int(sqrt(n))+1):\n if n%i==0:\n if match(i,n):\n ans+=1\n if i != n//i and match(n//i,n):\n ans +=1\n # print(i)\nprint(ans)", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\ndef fn(x,fact):\r\n same=0\r\n for ch in str(x):\r\n for ch1 in str(fact):\r\n if ch==ch1:return 1\r\n return 0\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n p=1;ans=0\r\n while p*p<=n:\r\n if n%p==0:\r\n ans+=fn(n,p)\r\n if p!=n//p:ans+=fn(n,n//p)\r\n p+=1\r\n print(ans)", "import math\r\nn=int(input())\r\n\r\ndef single(n):\r\n l=[]\r\n while n!=0:\r\n a=n%10\r\n l.append(a)\r\n n=n//10\r\n \r\n return l \r\n\r\ndef simple(n):\r\n l=[]\r\n x=int(math.sqrt(n))\r\n for i in range(1,x+1):\r\n if n%i==0:\r\n if i*i==n:\r\n l.append(i)\r\n else:\r\n l.append(i)\r\n l.append(n//i)\r\n \r\n return l \r\n\r\ntemp=simple(n)\r\ncount=0\r\nmlist=single(n)\r\nfor i in range(len(temp)):\r\n pink=single(temp[i])\r\n done=0\r\n for j in pink:\r\n if j in mlist:\r\n done=1\r\n \r\n if done==1:\r\n count+=1\r\n \r\nprint(count) \r\n\r\n\r\n\r\n", "a=int(input())\r\nx=0\r\ndiv=[]\r\nfor i in range(1,int(a**0.5)+1):\r\n if a%i==0:\r\n div.append(i)\r\nb=len(div)\r\nfor i in div[:b]:\r\n div.append(a//i)\r\ndiv=list(set(div))\r\n\r\nfor i in div:\r\n t=0\r\n for j in str(i):\r\n if j in str(a):\r\n t=1\r\n x+=t\r\n\r\nprint(x)\r\n", "def divisor(s):\r\n l = []\r\n for i in range(1,int(s**.5)+1):\r\n if s % i == 0:\r\n l.append(i)\r\n l.append(s//i)\r\n return l\r\n\r\ndef sic(l1,l2):\r\n if len(l1) < len(l2):\r\n for i in range(len(l1)):\r\n if l1[i] in l2:\r\n return 1\r\n else:\r\n for i in range(len(l2)):\r\n if l2[i] in l1:\r\n return 1\r\n return 0\r\n\r\ni = int(input())\r\nl = list(set(divisor(i)))\r\np = 0\r\nfor j in range(len(l)):\r\n if sic(list(str(l[j])),list(str(i))) == 1:\r\n p += 1\r\n\r\nprint(p)", "x, val, i = int(input()), 0, 1\n\nxs = set(str(x))\n\ndef dc(n):\n\n return bool(xs & set(str(n)))\n\nwhile i * i < x:\n\n if x % i == 0:\n\n val += dc(i) + dc(x // i)\n\n i += 1\n\nprint(val + (i * i == x and dc(i)))\n\n\n\n# Made By Mostafa_Khaled", "'https://codeforces.com/contest/221/problem/B'\r\ndef chck(x):\r\n\twhile(x>0):\r\n\t\trem=x%10\r\n\t\tx//=10\r\n\t\tif(num[rem]==1):\r\n\t\t\treturn True\r\n\treturn False\r\n\r\nx=int(input())\r\nnum=[0]*10\r\nx1=x\r\nwhile(x>0):\r\n\trem=x%10\r\n\tnum[rem]=1\r\n\tx//=10\r\nx=x1\r\nans=0\r\nfor i in range(1,int(x**0.5)+1):\r\n\tif(x%i==0):\r\n\t\tif(chck(i)):\r\n\t\t\tans+=1\r\n\t\t\t# print(i,ans)\r\n\t\tif(i*i!=x):\r\n\t\t\tif(chck(x//i)):\r\n\t\t\t\tans+=1\r\n\t\t\t\t# print(i,ans)\r\n\r\nprint(ans)\r\n", "import math\nimport sys\n\nn = int(input())\narr = [0,0,0,0,0,0,0,0,0,0]\nnumber = str(n)\ncounter = 0\nx = math.sqrt(n)+1\ndivisores = []\n\nfor i in range(len(number)):\n arr[int(number[i])]=1\n \nfor i in range(1,int(x)):\n if n%i==0:\n d = str(i)\n for j in range(len(d)):\n if arr[int(d[j])]==1:\n divisores.append(d)\n break\n inv_d = str(n//i)\n for j in range(len(inv_d)):\n if arr[int(inv_d[j])]==1:\n divisores.append(inv_d)\ndiv = list(dict.fromkeys(divisores))\nprint(len(div))\n\n\t\t\t\t \t \t \t \t\t \t \t \t", "n=int(input())\r\nans=0\r\nans=0\r\nfor i in range(1,int(n**.5)+1):\r\n if n%i:\r\n continue\r\n \r\n f=str(i)\r\n s=''\r\n if i**2!=n:\r\n s =str(n//i)\r\n for i in range(10):\r\n if str(i) in f and str(i) in str(n):\r\n ans += 1\r\n break\r\n for i in range(10):\r\n if str(i) in s and str(i) in str(n):\r\n ans += 1\r\n break\r\nprint(ans)", "n = int(input())\nstrN = str(n)\ndigits = [0 for x in range(10)]\nfor i in range(len(strN)):\n digits[int(strN[i])] = 1\nresp = {}\nsqrtN = int((n ** 0.5) + 1)\nfor i in range(1, sqrtN):\n if n % i == 0:\n strI = str(i)\n for j in range(len(strI)):\n if digits[int(strI[j])] == 1:\n resp[strI] = 1\n break\n strNDivI = str(n//i)\n for j in range(len(strNDivI)):\n if digits[int(strNDivI[j])] == 1:\n resp[strNDivI] = 1\n break\nprint (len(resp))\n \t\t\t\t \t\t\t \t \t \t\t \t \t\t \t", "x = int(input())\r\nxs = set(str(x))\r\n\r\ndef is_intersection(x):\r\n return bool(xs & set(str(x)))\r\n\r\nres, i = 0, 1\r\nwhile i * i < x:\r\n if x % i == 0:\r\n res += is_intersection(i) + is_intersection(x // i)\r\n i += 1\r\nprint(res + (i * i == x and is_intersection(i)))\r\n", "import math\r\na=int(input())\r\nflag=0\r\nfor i in range(1,int(math.sqrt(a))+1):\r\n if(a%i==0):\r\n if(a/i==i):\r\n p=str(int(i))\r\n for j in range(0,len(p)):\r\n if(p[j] in str(a)):\r\n flag=flag+1\r\n break\r\n else:\r\n p=str(int(i))\r\n for j in range(len(p)):\r\n if(p[j] in str(a)):\r\n flag=flag+1\r\n break\r\n b=str(int(a/i))\r\n for j in range(len(b)):\r\n if b[j] in str(a):\r\n flag=flag+1\r\n break\r\nprint(flag)", "from math import sqrt\r\nx = int(input())\r\nnumbers = [int(i) for i in str(x)]\r\ncount = 0\r\nfor i in range(1, int(sqrt(x)) + 1):\r\n if x % i == 0:\r\n digits = [int(j) for j in str(i)]\r\n flag = 0\r\n for j in digits:\r\n if j in numbers:\r\n flag = 1\r\n break\r\n if flag:\r\n count += 1\r\n digits = [int(j) for j in str(x // i)]\r\n flag = 0\r\n for j in digits:\r\n if j in numbers:\r\n flag = 1\r\n break\r\n if flag and x // i != i:\r\n count += 1\r\nprint (count)", "from functools import reduce\r\nk = 0\r\nfor e in (lambda n: list(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))))((x:=int(input()))): k+=int(len(set(list(str(e))).intersection(set(list(str(x))))) != 0)\r\nprint(k)", "from functools import reduce\ndef factors(n): \n return set(reduce(list.__add__, \n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\n\nn = int(input())\nlist_ = map(str, factors(n))\nn = str(n)\n\ncont=0\n\nfor el in list_:\n flag = False\n for i in el:\n if i in n:\n flag = True\n if flag==True:\n cont+=1\n\nprint(cont)", "import math\r\ndef divisors(n):\r\n ans=[]\r\n for i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n ans.append(i)\r\n if n/i!=i:\r\n ans.append(int(n/i))\r\n return ans\r\n\r\nn=int(input())\r\ncount=0\r\nans=divisors(n)\r\nfor i in range(0,len(ans)):\r\n p=str(ans[i])\r\n for i in range(0,len(p)):\r\n if p[i] in str(n):\r\n count+=1\r\n break\r\nprint(count)\r\n", "def is_match(n):\n while n!= 0:\n if digit[n % 10]:\n return True\n n = int(n / 10)\n return False\n\nx = int(input())\nx2 = x\ndigit = list()\nd = 1\ncount = 0\n\nfor i in range(10):\n digit.append(False)\n\nwhile x2 != 0:\n digit[x2 % 10] = True\n x2 = int(x2 / 10)\n\nwhile d * d < x:\n if x% d == 0:\n if(is_match(d)):\n count += 1\n if(is_match(int(x / d))):\n count += 1\n d += 1\n\nif d * d == x and is_match(d):\n count += 1\n\nprint(count)\n\n\n\n\n \t\t\t \t\t\t \t \t \t \t\t\t \t \t \t\t", "from sys import stdin\r\n\r\ndef num_in_num(a,b):\r\n astr, bstr = str(a), str(b)\r\n for c in astr:\r\n if c in bstr:\r\n return True\r\n return False\r\n\r\n\r\ndef get_divs(n):\r\n arr = []\r\n for i in range(1,n+1):\r\n if i*i > n:\r\n return arr\r\n if n%i == 0:\r\n arr.append(i)\r\n if n//i != i:\r\n arr.append(n//i)\r\n return arr\r\n\r\ndef get_count(n,arr):\r\n count = 0\r\n for x in arr:\r\n if num_in_num(x,n):\r\n count += 1\r\n return count\r\n\r\n\r\nn = int(stdin.readlines()[0])\r\nprint(get_count(n,get_divs(n)))", "from math import*\r\n\r\ndef get_dec_nums(num):\r\n nums=set()\r\n while num>=10:\r\n nums.add(num%10)\r\n if len(nums)>9:\r\n break\r\n num//=10\r\n nums.add(num)\r\n return list(nums)\r\n\r\n\r\ndef one_overlap(nums,t):\r\n tnums=get_dec_nums(t)\r\n for c in nums:\r\n for d in tnums:\r\n if c==d:\r\n return 1\r\n return 0\r\n\r\nn=int(input())\r\nd=0\r\nnums=get_dec_nums(n)\r\nsq=int(floor(sqrt(n)))\r\nfor c in range(1,sq+1):\r\n if n%c==0:\r\n if(one_overlap(nums,c)):\r\n d+=1\r\n if(one_overlap(nums,n//c) and c!=n//c):\r\n d+=1\r\nprint(d)\r\n", "from math import sqrt,floor\r\ndef div(x):\r\n s=0\r\n for i in range(2,floor(sqrt(x))+1):\r\n if x%i==0 and set(str(i)).intersection(set(str(x))):s+=1\r\n if i!=x//i and x%(x//i)==0 and set(str(x//i)).intersection(set(str(x))):s+=1\r\n if \"1\" in str(x):s+=1\r\n if 1!=x:s+=1\r\n return s\r\nprint(div(int(input())))", "x = int(input())\ns = set(str(x))\ni = 1\nans = 0\nwhile i * i <= x:\n\tif x % i == 0:\n\t\tif any(c in s for c in str(i)):\n\t\t\tans += 1\n\t\tif i * i != x and any(c in s for c in str(x // i)):\n\t\t\tans += 1\n\ti += 1\nprint(ans)\n", "\r\ndef factors(n):\r\n arr=[]\r\n for i in range(1,int(n**(0.5))+1):\r\n if n%i==0:\r\n div=n//i\r\n if i!=div:\r\n arr.extend([i,div])\r\n else:\r\n arr.append(i)\r\n return arr\r\nx=input()\r\nn=int(x)\r\n\r\narr=factors(n)\r\ncnt=0\r\nfor i in arr:\r\n for j in str(i):\r\n if j in x:\r\n cnt+=1\r\n break\r\nprint(cnt)\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "import math\n\ndef digitosEmComum(a, b):\n digitos = [0] * 10\n result = 0\n\n while(a > 0):\n digitos[a % 10] = 1\n a = a // 10\n \n while(b > 0):\n if (digitos[b % 10] != 0):\n result = 1\n break\n b = b // 10\n \n return result\n\nn = int(input())\ntotal = 0\n\ndivisores = []\n\ni = 1\nwhile(i <= math.sqrt(n)):\n if(n % i == 0):\n divisores.append(i)\n if (n / i > i):\n divisores.append(n // i)\n i += 1\n\nfor i in range(0, len(divisores)):\n if (digitosEmComum(n, divisores[i]) == 1):\n total += 1\n\nprint(total)\n\t\t\t\t\t \t\t\t\t \t \t \t \t\t\t \t", "def factors(x):\r\n # We will store all factors in `result`\r\n result = []\r\n i = 1\r\n\r\n while i*i <= x:\r\n\r\n if x % i == 0:\r\n result.append(i)\r\n\r\n if x//i != i: # In Python, // operator performs integer/floored division\r\n result.append(x//i)\r\n i += 1\r\n\r\n return result\r\nimport math\r\nx=input()\r\nn=int(x)\r\nlst=[]\r\nans=[]\r\nlst=factors(n)\r\n\r\n\r\nfor i in lst:\r\n if (set(str(i)) & set(x)):\r\n ans.append(i)\r\nprint(len(ans)) \r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ndef check(s1,s2):\r\n\tfor i in range(len(s1)):\r\n\t\tfor j in range(len(s2)):\r\n\t\t\tif(s1[i]==s2[j]):\r\n\t\t\t\treturn True\r\n\treturn False\r\n\r\nN = int(input())\r\ndiv = 0\r\nbound = math.floor(math.sqrt(N))\r\nfor i in range(bound):\r\n\tk = i+1\r\n\tif(N%k==0):\r\n\t\tf1 = str(k)\r\n\t\tf2 = str(N//k)\r\n\t\tif(check(f1,str(N))):\r\n\t\t\tdiv += 1\r\n\t\tif(f1!=f2 and check(f2,str(N))):\r\n\t\t\tdiv += 1\r\nprint (div)\r\n\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = int(input())\r\ns = set()\r\nfor i in range(1, int(x**0.5)+1):\r\n if x % i == 0:\r\n s.add(i)\r\n s.add(x//i)\r\nc = 0\r\nx = set(str(x))\r\nfor i in s:\r\n if len(set(str(i)) & x) > 0:\r\n c += 1\r\nprint(c)", "x = int(input())\nc = 0\nls_1 = []\nfor h in str(x):\n ls_1.append(h)\nls_x = set(ls_1)\nfor i in range(1,int(x**0.5)+1):\n if x % i == 0:\n ls_a = []\n for u in str(i):\n ls_a.append(u)\n ls_a = set(ls_a)\n if ls_x & ls_a != set():\n c += 1\n if x // i != i:\n ls_b = []\n for k in str(x//i):\n ls_b.append(k)\n ls_b = set(ls_b)\n if ls_x & ls_b != set():\n c+=1\nprint(c)", "n = int(input())\r\ni = 1\r\np = str(n)\r\nd = 0\r\nwhile i ** 2 <= n:\r\n if n % i == 0:\r\n s_possible = False\r\n t_possible = False\r\n s = str(i)\r\n t = str(n // i)\r\n for j in range(len(p)):\r\n for k in range(len(s)):\r\n if p[j] == s[k]:\r\n s_possible = True\r\n for j in range(len(p)):\r\n for k in range(len(t)):\r\n if p[j] == t[k]:\r\n t_possible = True\r\n if s != t:\r\n if s_possible:\r\n d += 1\r\n if t_possible:\r\n d += 1\r\n else:\r\n if s_possible:\r\n d += 1\r\n i += 1\r\nprint(d)\r\n", "from math import ceil,sqrt\n\ndef con(x,d):\n\tfor i in d:\n\t\tif x.find(i)!=-1:\n\t\t\treturn True\n\t\n\treturn False\n\t\nx=int(input())\n\n\nans=0\ni=1\nwhile i*i<=x:\n\tif x%i==0:\n\t\tif con(str(x),str(i)):\n\t\t#\tprint(i)\n\t\t\tans+=1\n\t\tif (x//i)!=i and con(str(x),str(x//i)):\n\t\t\tans+=1\n\t\t\t#print(x//i)\n\ti+=1\nprint(ans)\n", "def digit(x, n):\r\n for i in range(10):\r\n if str(i) in str(n) and str(i) in str(x):\r\n return True\r\n return False\r\n\r\n\r\ndef factorize(n): # o(sqr(n))\r\n c, ans = 1, 0\r\n while (c * c < n):\r\n if n % c == 0:\r\n if digit(c, n):\r\n ans += 1\r\n if digit(n // c, n):\r\n ans += 1\r\n c += 1\r\n\r\n if c * c == n:\r\n if digit(c, n):\r\n ans += 1\r\n return ans\r\n\r\n\r\nprint(factorize(int(input())))\r\n", "x = int(input())\r\ns = set(str(x))\r\ni = 1\r\nans = 0\r\nwhile i * i <= x:\r\n\tif x % i == 0:\r\n\t\tif any(c in s for c in str(i)):\r\n\t\t\tans += 1\r\n\t\tif i * i != x and any(c in s for c in str(x // i)):\r\n\t\t\tans += 1\r\n\ti += 1\r\nprint(ans)\r\n", "import math\n\nl1 = input()\n#l2 = input().split()\n\n#l1 = [int(i) for i in l1]\n#l2 = [int(i) for i in l2]\n\nn = int(l1)\nm = list(l1)\n\ndiv = []\ntotal = 0\n\nfor k in range (1, int(math.sqrt(n))+1):\n if(n % k == 0):\n div.append(k); \n if(n/k > k): div.append(int(n/k))\n\n\nfor i in div:\n cont = False\n lk = list(str(i))\n for j in lk:\n if j in m:\n cont = True\n if cont == True:\n total += 1\n\nprint(total)\n\n \t \t \t\t\t\t\t\t\t\t\t \t \t \t \t", "from math import sqrt\r\ni=int(input());ans=0\r\np=set(str(i))\r\nx=1\r\nwhile x*x<i:\r\n if i%x==0:\r\n if p-set(str(x))!=p:ans+=1\r\n if p-set(str(i//x))!=p:ans+=1\r\n x+=1\r\nif x*x==i:\r\n if p-set(str(x))!=p:ans+=1\r\nprint(ans)", "f=lambda x,y:bool(set(str(x)).__rand__(set(str(y))))\r\nx=int(input())\r\nk=0\r\ni=1\r\nwhile i*i<=x:\r\n if x%i==0:\r\n k+=f(x,i)\r\n t=x//i\r\n if t!=i:k+=f(x,t)\r\n i+=1\r\nprint(k)", "x = int(input())\r\n\r\ndef checker(n):\r\n if any(i in str(x) for i in str(n)):\r\n return True\r\n else:\r\n return False\r\n\r\nc = 0\r\n\r\nfor i in range(1, int(x**0.5)+1):\r\n if x%i == 0:\r\n c += checker(i)\r\n if i*i != x:\r\n c += checker(x//i)\r\nprint(c)\r\n", "x = int(input())\n\nimport math\n\ndef divisorGenerator(n):\n large_divisors = []\n for i in range(1, int(math.sqrt(n) + 1)):\n if n % i == 0:\n yield i\n if i*i != n:\n large_divisors.append(n / i)\n for divisor in reversed(large_divisors):\n yield int(divisor)\n\nlist_of_x_divisors = list(divisorGenerator(x))\n\ncount = 0\nx = str(x)\nfor number in list_of_x_divisors:\n if (any(list(map(lambda sn: sn in x, [sn for sn in str(number)])))):\n count += 1\nprint(count)" ]

[ "def main():\n s = input()\n heidi = \"heidi\"\n\n j = 0\n hasHeidi = 0\n\n for i in s:\n if(i == heidi[j]):\n if(j < 4):\n j += 1\n else:\n hasHeidi = 1\n\n if(hasHeidi == 0):\n print(\"NO\")\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n\t \t \t\t\t\t\t\t\t\t \t \t \t\t\t \t\t\t \t\t\t", "s = input()\r\nh = 'heidi'\r\nj = 0\r\n\r\nfor i in s:\r\n if i == h[j]:\r\n j += 1\r\n if j == 5:\r\n break\r\n\r\nprint('YES' if j == 5 else 'NO')\r\n", "n=input()\r\na=\"heidi\"\r\nj=0\r\nfor i in n:\r\n if i==a[j] :\r\n j+=1\r\n if j==5:\r\n break\r\nif(j==5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[1]:\n\n\nx='heidi'\ns=input()\nj=0\nfor i in range(len(s)):\n if s[i]==x[j]:\n j+=1\n if j==5:\n break\nif j==5:\n print('YES')\nelse:\n print('NO')\n\n\n# In[ ]:\n\n\n\n\n", "s = input()\r\na = 0\r\npat = \"heidi\"\r\nfor i in s:\r\n if i == pat[a]:\r\n a+=1\r\n if(a == 5):\r\n break\r\nprint(\"YES\") if a==5 else print(\"NO\")", "res, key, s, i = \"NO\", \"heidi\", input(), 0\r\nfor x in s:\r\n if x == key[i]:\r\n i += 1\r\n if i == 5:\r\n res = \"YES\"\r\n break\r\nprint(res)", "s = input()\r\nk = 0\r\nword = \"heidi\"\r\nc = 0\r\nwhile k< len(s) and c < len(word):\r\n if s[k] == word[c]:\r\n c += 1\r\n k += 1\r\nif c == len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def news(s):\r\n h= \"heidi\"\r\n c= 0\r\n m = len(s)\r\n for k in range(m):\r\n if s[k] == h[c]:\r\n c+= 1\r\n if c == 5:\r\n break\r\n \r\n if c == 5:\r\n print(\"YES\")\r\n else:\r\n print( \"NO\")\r\n \r\ns = input()\r\nnews(s)", "string = input()\nheidi = \"heidi\"\nj = 0\nt = \"\"\nfor i in range(len(string)):\n if heidi[j] == string[i]:\n j += 1\n t += string[i]\n if t == heidi:\n break\nb = j == len(heidi)\nprint(\"YES\") if b else print(\"NO\")\n\t\t \t\t\t \t \t \t\t \t \t \t", "s=input()\r\nif s.count('h')<1 or s.count('e')<1 or s.count('d')<1 or s.count('i')<2:\r\n print('NO')\r\nelse:\r\n pos=-1\r\n for i in range(len(s)-1,-1,-1):\r\n if s[i]=='i':\r\n pos=i \r\n break\r\n if pos==-1:\r\n print('NO')\r\n else:\r\n pos1=-1\r\n for i in range(pos-1,-1,-1):\r\n if s[i]=='d':\r\n pos1=i \r\n break\r\n if pos1==-1:\r\n print('NO')\r\n else:\r\n pos2=-1 \r\n for i in range(pos1-1,-1,-1):\r\n if s[i]=='i':\r\n pos2=i \r\n break\r\n if pos2==-1:\r\n print('NO')\r\n else:\r\n pos3=-1 \r\n for i in range(pos2-1,-1,-1):\r\n if s[i]=='e':\r\n pos3=i \r\n break\r\n if pos3==-1:\r\n print('NO')\r\n else:\r\n pos4=-1 \r\n for i in range(pos3-1,-1,-1):\r\n if s[i]=='h':\r\n pos4=i \r\n break\r\n if pos4==-1:\r\n print('NO')\r\n else:\r\n print('YES')", "if __name__ == '__main__':\n string = input()\n test = \"heidi\"\n\n len_string = len(string)\n len_test = len(test)\n\n i = 0\n j = 0\n\n while i < len_string and j < len_test:\n if test[j] == string[i]:\n j += 1\n i = i + 1\n\n if j == len_test:\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t \t\t\t \t \t \t \t \t\t \t\t\t \t\t\t \t", "import sys\r\n##from math import log10, ceil, gcd, log2\r\n##from bisect import bisect_left as bs\r\n##from re import match, compile\r\n##from collections import defaultdict\r\n\r\ninput = sys.stdin.readline\r\nii = lambda: int(input())\r\nist = lambda: input().strip()\r\niilist = lambda: list(map(int, input().split()))\r\n\r\nINFINITY = 10**9 + 7\r\n\r\ndef solve(s):\r\n got_your_nose = 'h'; ct = 0; word = 'heidi'\r\n for i in range(len(s)):\r\n if s[i] == got_your_nose:\r\n ct += 1\r\n if ct == 5: return True\r\n got_your_nose = word[ct]\r\n return False\r\n\r\nprint(['NO', 'YES'][solve(ist())])\r\n", "s = input()\r\ncount = 0\r\ntemp = \"heidi\"\r\nfor i in s:\r\n if i == temp[count]:\r\n count += 1\r\n if count == 5:\r\n break \r\nprint('YES' if count==5 else \"NO\")", "s = str(input())\r\no = \"\"\r\nfor c in s:\r\n if c=='h' or c=='e' or c=='i' or c=='d':\r\n o+=c\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nc4 = 0\r\nc5 = 0\r\nfor c in o:\r\n if c=='h':\r\n c1=1\r\n elif c=='e' and c1 ==1: c2=1\r\n elif c=='i' and c4==1: c5 =1\r\n elif c=='i' and c2==1: c3=1 \r\n elif c=='d' and c3==1: c4=1 \r\n \r\nif bool(c5):print(\"YES\")\r\nelse: print(\"NO\")", "arr = input()\ncount = 0\nif len(arr) <= 1000:\n\tfor i in arr:\n\t\tif count == 0 and i == 'h':\n\t\t\tcount += 1\n\t\telif count == 1 and i == 'e':\n\t\t\tcount += 1\n\t\telif count == 2 and i == 'i':\n\t\t\tcount += 1\n\t\telif count == 3 and i == 'd':\n\t\t\tcount += 1\n\t\telif count == 4 and i == 'i':\n\t\t\tcount += 1\n\tif count == 5:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t \t \t\t\t \t\t\t\t \t\t \t\t \t \t", "s = input()\nkey = 'heidi'\ncounter = 0\nis_found = []\n\nfor index, letter in enumerate(s):\n if len(is_found) == 5:\n break\n if (s[index] == key[counter]):\n is_found.append(key[counter])\n counter = counter + 1\n\nif key == ''.join(is_found):\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", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\ns=input()\r\ns1='heidi'\r\nc=0\r\nfor i in range(len(s)):\r\n if(s[i]==s1[c]):\r\n c+=1\r\n if(c==5):\r\n break\r\nif(c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Fake News (easy)\r\ns = input()\r\nsub = \"heidi\"\r\nflag = 0\r\ns_ind = 0\r\nsub_ind = 0\r\nwhile s_ind < len(s):\r\n if s[s_ind] == sub[sub_ind]:\r\n sub_ind += 1\r\n s_ind += 1\r\n if sub_ind == len(sub):\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'''\r\nabcheaibcdi\r\na == h ? sub_ind = 0\r\nb == h ? sub_ind = 0\r\nc == h ? sub_ind = 0\r\nh == h ? => h++ = e sub_ind = 1\r\ne == e ? => e++ = i sub_ind = 2\r\na == i ? sub_ind = 2\r\ni == i ? => i++ = d sub_ind = 3\r\nb == d ? sub_ind = 3\r\nc == d ? sub_ind = 3\r\nd == d ? => d++ = i sub_ind = 4\r\ni == i ? => i++ =...sub_ind = 5\r\n'''", "news = str(input())\r\nheidi = \"heidi\"\r\ncount = 0\r\nfor i in range(len(news)):\r\n if news[i] == heidi[count]:\r\n count += 1\r\n if count == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s=input()\r\nt=\"heidi\"\r\nps=0\r\nfor e in s:\r\n if(e==t[ps]):\r\n ps+=1\r\n if(ps==len(t)):\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n", "s = input()\ncomp = \"heidi\"\n\nachou = True\n\nfor w in comp:\n\tx = s.find(w)\n\tif x == -1:\n\t\tachou = False\n\t\tbreak\n\telse:\n\t\ts = s[x+1:]\n\nif achou:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t\t \t\t \t\t\t \t\t \t\t\t \t\t \t \t", "def isSubSequence(str1, str2):\n m = len(str1)\n n = len(str2)\n \n j = 0 \n i = 0 \n \n while j < m and i < n:\n if str1[j] == str2[i]:\n j = j+1\n i = i + 1\n return j == m\n \n \n \nstr1 = \"heidi\"\nstr2 = input()\n \nprint (\"YES\") if isSubSequence(str1, str2) else print(\"NO\")\n\t \t\t \t \t \t \t\t \t\t \t \t\t\t\t\t\t", "a=input()\r\nk=0\r\nfor i in a:\r\n if k==0 and i=='h':\r\n k=1\r\n elif k==1 and i=='e':\r\n k=2\r\n elif k==2 and i=='i':\r\n k=3\r\n elif k==3 and i=='d':\r\n k=4\r\n elif k==4 and i=='i':\r\n k=5\r\n break\r\nprint(\"YNEOS\"[(k!=5)::2])", "\ns = input()\n\ni = 0\n\n_match = \"heidi\"\n\nfor c in s:\n\tif c == _match[i]:\n\t\ti += 1\n\tif i == 5:\n\t\tbreak\n\nif i == 5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t\t \t\t \t\t\t\t\t \t \t\t\t\t \t\t\t\t\t \t", "s = \"heidi\"\r\np = input()\r\n\r\nn = len(p)\r\n\r\ni = 0\r\nc = 0\r\nwhile (i < n):\r\n if len(s) > 0 and p[i] == s[0]:\r\n c += 1\r\n s = s[1::]\r\n i += 1\r\n \r\nif c == 5 and n != 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=list(input())\r\nun=['h','e','i','d','i']\r\nsc=0\r\nfor i in s:\r\n if(sc==5):\r\n break\r\n if(i==un[sc]):\r\n sc+=1\r\nif(sc==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\ncount=0\r\nflag1,flag2,flag3,flag4,flag5=0,0,0,0,0\r\nfor i in range(len(n)):\r\n if flag1==0 and n[i]==\"h\" and count<1:\r\n count+=1\r\n flag1=1\r\n elif flag1==1 and n[i]==\"e\"and count<2:\r\n count+=1\r\n flag2=1\r\n elif flag2==1 and n[i]==\"i\"and count<3:\r\n count+=1\r\n flag3=1\r\n elif flag3==1 and n[i]==\"d\"and count<4:\r\n count+=1\r\n flag4=1\r\n elif flag4==1 and n[i]==\"i\"and count<5:\r\n count+=1\r\n flag5=1\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str_in = input()\r\n\r\ncontains_heidi = False\r\n\r\n# discouraged word or subsequence = 'heidi'\r\n# Note: A string s contains another string p as a subsequence if it is possible to delete some characters from s and obtain p.\r\n\r\nfound_h = False\r\nfound_e = False\r\nfound_i = False\r\nfound_d = False\r\n# found_i2 = False # No need to track final i\r\n\r\nfor char in str_in:\r\n\tif found_h or char == \"h\":\r\n\t\tfound_h = True\r\n\t\tif found_e or char == \"e\":\r\n\t\t\tfound_e = True\r\n\t\t\tif found_i or char == \"i\":\r\n\t\t\t\tfound_i = True\r\n\t\t\t\tif found_d or char == \"d\":\r\n\t\t\t\t\tfound_d = True\r\n\t\t\t\t\tif char == \"i\": # No need to track final i\r\n\t\t\t\t\t\tcontains_heidi = True\r\n\r\nif contains_heidi:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "s=input()\r\na='heidi'\r\nj,flag=0,0\r\nfor i in range(len(s)):\r\n\tif s[i]==a[j]:\r\n\t\tj+=1\r\n\tif j==5:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag:print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nn = len(s)\r\nh = 0\r\ne = 0\r\nii = 0\r\nd = 0\r\ni2 = 0\r\nindex =0\r\nfor i in range(n):\r\n if s[i] == 'h':\r\n h = 1\r\n index = i+1\r\n break\r\nfor i in range(index, n):\r\n if s[i] == 'e':\r\n e = 1\r\n index = i+1\r\n break\r\nfor i in range(index, n):\r\n if s[i] == 'i':\r\n ii = 1\r\n index = i+1\r\n break\r\nfor i in range(index, n):\r\n if s[i] == 'd':\r\n d = 1\r\n index = i+1\r\n break\r\nfor i in range(index, n):\r\n if s[i] == 'i':\r\n i2 = 1\r\n index = i+1\r\n break\r\nif h+e+ii+d+i2 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "z=[\"h\",\"e\",\"i\",\"d\",\"i\"]\r\nfor i in input()+\".\":\r\n try:\r\n if z[0]==i:z.pop(0)\r\n except:exit(print(\"YES\"))\r\nprint(\"NO\")\r\n", "string = input()\r\nheidi = \"heidi\"\r\ntemp = 0\r\nfound = False\r\nfor i in range(0, len(string)):\r\n if heidi[temp] == string[i]:\r\n temp = temp + 1\r\n if temp > 4:\r\n found = True\r\n break\r\n\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-13 23:40:11\nLastEditTime: 2021-11-13 23:48:07\nDescription: Fake News (easy) \nFilePath: CF802G.py\n'''\n\n\ndef func():\n s = input().strip()\n key = \"heidi\"\n i = 0\n for item in s:\n if item == key[i]:\n i += 1\n if i == 5:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "def isSequence(string, subStr):\r\n counter = 0\r\n\r\n\r\n for i in range(len(string)):\r\n if string[i] == subStr[counter]:\r\n counter += 1\r\n if counter == len(subStr):\r\n \r\n return \"YES\"\r\n\r\n return \"NO\"\r\n \r\nrequiredSequence = \"heidi\"\r\ngivenString = input()\r\nprint(isSequence(givenString, requiredSequence))", "s = input()\r\na, y = \"heidi\", -1\r\n\r\nfor i in range(5):\r\n if s[y+1:].find(a[i]) > -1:\r\n y += s[y+1:].find(a[i]) + 1\r\n if i == 4:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n", "s1='heidi'\ns2=input()\nx=0\nfor i in s2:\n\tif x==5:\n\t\tbreak\n\tif i==s1[x]:\n\t\tx+=1\nprint(['NO','YES'][x==5])\n \t \t \t\t\t \t \t \t\t \t \t\t", "i, t = 0, 'heidi!'\nfor q in input():\n if q == t[i]: i += 1\nprint(['YES', 'NO'][i < 5])\n \t\t \t \t \t\t \t \t \t \t\t\t \t", "s = input()\r\nctr = 0\r\nsub = \"heidi\"\r\nfor i in s:\r\n if i == sub[ctr]:\r\n ctr += 1\r\n if ctr == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "a=iter(input())\r\nprint(('NO','YES')[all(i in a for i in 'heidi')])", "s1='heidi'\r\ns=input()\r\nx=0\r\nfor i in s:\r\n\tif x==5:\r\n\t\tbreak\r\n\tif i==s1[x]:\r\n\t\tx+=1\r\nprint(['NO','YES'][x==5])", "newspiece = input()\nsearchFor = \"heidi\"\nresult = ''\nj = 0\nfor i in range(len(newspiece)):\n if newspiece[i] == searchFor[j]:\n j+=1\n if j == 5:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\t \t\t \t \t\t\t \t \t\t \t \t", "s=input()\r\n\r\nif('h' in s):\r\n c=s.find('h')\r\n if('e' in s[c+1:]):\r\n k=s[c+1:].find('e')\r\n h=k+c+1 \r\n if('i' in s[h+1:]):\r\n i=s[h+1:].find('i')\r\n l=i+h+1 \r\n if('d' in s[l+1:]):\r\n t=s[l+1:].find('d')\r\n r=l+t+1 \r\n if('i' in s[r+1:]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "import math\r\nimport sys\r\nimport re\r\ndef func(n):\r\n if 'h' not in n:\r\n return 'NO'\r\n else:\r\n a = n.index('h')\r\n if 'e' not in n[a:]:\r\n return 'NO'\r\n else:\r\n b = n[a:].index('e')\r\n if 'i' not in n[a:][b:]:\r\n return 'NO'\r\n else:\r\n c = n[a:][b:].index('i')\r\n l1 = n[a:][b:][c:]\r\n if 'd' not in l1:\r\n return 'NO'\r\n else:\r\n d = l1.index('d')\r\n l2 = l1[d:]\r\n if 'i' not in l2:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\nn = input()\r\nprint(func(n))", "news = input()\r\nt=0\r\ncount=0\r\nfor x in 'heidi':\r\n for y in range(t,len(news)):\r\n if x==news[y]:\r\n t = y+1\r\n count+=1\r\n break\r\nif count==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n ", "from typing import Pattern\r\n\r\n\r\ndef found(s,pat):\r\n i=0\r\n j=0\r\n while(i<len(s) and j<len(pat)):\r\n if(s[i]==pat[j]):\r\n j+=1\r\n i+=1\r\n else:\r\n i+=1\r\n #print(j,len(pat))\r\n return j==len(pat)\r\n\r\n\r\ns = str(input())\r\nif(found(s,\"heidi\")):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = list(input())\r\n\r\nstack = list(\"heidi\")\r\n\r\nwhile s and stack:\r\n x = s.pop()\r\n\r\n if x == stack[-1]:\r\n stack.pop()\r\n\r\nif not stack:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s=input()\r\nflag=0\r\nfor z in s:\r\n if flag==0:\r\n if z==\"h\":\r\n flag=1\r\n elif flag==1:\r\n if z==\"e\":\r\n flag=2\r\n elif flag==2:\r\n if z==\"i\":\r\n flag=3\r\n elif flag==3:\r\n if z==\"d\":\r\n flag=4\r\n else :\r\n if z==\"i\":\r\n flag=5\r\nif flag==5:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s = input()\r\nl = 'heidi'\r\nc = 0\r\nflag = 0\r\nfor i in s:\r\n if i == l[c]:\r\n c += 1\r\n if c == 5:\r\n flag = 1\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\nh1 = 0\ne1 = 0\ni1 = 0\nd1 = 0\ni2 = 0\nfor a in range(0,len(s)):\n if s[a] == 'h':\n h1 = 1\n if (s[a] == 'e') and (h1 == 1):\n e1 = 1\n if (s[a] == 'i') and ((h1 and e1) == 1):\n i1 = 1\n if (s[a] == 'd') and ((h1 and e1 and i1) == 1):\n d1 = 1\n if (s[a] == 'i') and ((h1 and e1 and i1 and d1) == 1):\n i2 = 1\nif i2 == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t\t\t\t\t\t \t\t \t \t", "def buscar_letra(letra, n):\n if n.find(letra) != -1:\n return True\n else:\n return False\n \n\nnoticia = input()\n\nif buscar_letra(\"h\", noticia):\n n = noticia.split(\"h\", 1)\n\n if buscar_letra(\"e\", n[1]):\n n = n[1].split(\"e\", 1)\n \n if buscar_letra(\"i\", n[1]):\n n = n[1].split(\"i\", 1)\n\n if buscar_letra(\"d\", n[1]):\n n = n[1].split(\"d\", 1)\n\n if buscar_letra(\"i\", n[1]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\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\t \t \t", "s=input()\nh=s.find('h')\nif h!=-1:\n\ta=s[h+1:]\n\te=a.find('e')\n\tif (e!=-1):\n\t\tb=a[e+1:]\n\t\ti1=b.find('i')\n\t\tif i1!=-1:\n\t\t\tc=b[i1+1:]\n\t\t\td=c.find('d')\n\t\t\tif d!=-1:\n\t\t\t\tt=c[d+1:]\n\t\t\t\ti2=t.find('i')\n\t\t\t\tif i2!=-1:\n\t\t\t\t\tprint(\"YES\")\n\t\t\t\telse:\n\t\t\t\t\tprint(\"NO\")\n\t\t\telse:\n\t\t\t\tprint(\"NO\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"NO\")\nelse:\n\tprint(\"NO\")\t\t", "news = input()\nsub = 'heidi'\ni = 0\nflag = False\n\nfor char in news:\n if char == sub[i]:\n i += 1\n if i == 5:\n flag = True\n break\n\nif(flag == True):\n print('YES')\nelse:\n print('NO')\n\n", "a='heidi'\r\ns=input()\r\ncc=0\r\nfor i in range(len(s)):\r\n if s[i]==a[cc]:\r\n cc+=1 \r\n if cc==5:\r\n break\r\nif cc==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "string=input()\n\ntargetString='heidi'\n\ntargetCharPyindex=0\nfinishTargetString=''\n\nfor char in string:\n if char==targetString[targetCharPyindex]:\n finishTargetString+=targetString[targetCharPyindex]\n targetCharPyindex+=1\n if targetCharPyindex==len(targetString):\n break\n\nif finishTargetString==targetString:\n print('YES')\nelse:\n print('NO')\n \t \t\t \t \t\t \t\t\t\t\t \t \t\t\t", "s = input()\r\ns1 = 'heidi'\r\nl = 0\r\nfor i in s:\r\n if i == s1[l]:\r\n l += 1\r\n if l == 5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n ", "s=input()\r\nn=''\r\nfor i in s:\r\n if i=='h'and n=='':\r\n n+=i\r\n if i=='e' and n=='h':\r\n n+=i\r\n if i=='i' and n=='he':\r\n n+=i\r\n if i=='d' and n=='hei':\r\n n+=i\r\n if i=='i' and n=='heid':\r\n n+=i\r\nif n=='heidi':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "string = input()\nheidi = \"heidi\"\nidx = 0\n\nfor each in string:\n \n if each == heidi[idx]:\n idx += 1\n \n if idx == 5:\n break\n \nprint('YES' if idx == 5 else 'NO')\n\t\t \t\t \t \t\t\t \t \t \t \t", "s = input()\r\nh = \"heidi\"\r\ni = j = 0\r\nn = len(s)\r\nm = len(h)\r\nwhile i < n and j < m:\r\n while i < n and s[i] != h[j]:\r\n i += 1\r\n if i < n and s[i] == h[j]:\r\n j += 1\r\nif j == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\ndef ss(a , b):\r\n m = len(a)\r\n n = len(b)\r\n i = 0\r\n j = 0\r\n while i < m and j < n:\r\n if a[i] == b[j]:\r\n i += 1\r\n j += 1\r\n return i == m\r\n\r\n\r\na = 'heidi'\r\nb = input()\r\n\r\nprint('YES' if ss(a , b) else 'NO')", "s = input()\r\ncheck = True\r\nidx = 0\r\n\r\nfor c in 'heidi':\r\n if c in s:\r\n idx = s.index(c)\r\n s = s[idx+1:]\r\n else:\r\n check = False\r\n break\r\nprint('YES' if check else 'NO')", "def main():\r\n n = list(input())\r\n tp = ['h', 'e', 'i', 'd', 'i']\r\n akt = 0\r\n for i in n:\r\n if i == tp[akt]:\r\n akt += 1\r\n if akt == len(tp):\r\n print('YES')\r\n return\r\n print('NO')\r\nmain()", "def is_subseq(x, y):\r\n it = iter(y)\r\n return all(any(c == ch for c in it) for ch in x)\r\ns=input()\r\nif is_subseq(\"heidi\",s):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "a = input()\nheidi = \"heidi\"\nh = 0\n \nfor i in range(len(a)):\n if h == 5:\n break\n lofh = heidi[h]\n if lofh == a[i]:\n h += 1 \n \nif (h <= 4):\n print(\"NO\")\nelse:\n print(\"YES\")\n \t\t\t \t \t \t\t \t\t \t\t\t\t \t \t", "string = input(\"\")\r\nheidicounter = 0\r\ncounter = 0\r\n \r\nfor a in range(len(string)):\r\n counter += 1\r\n if string[a] == \"h\":\r\n heidicounter += 1\r\n break\r\n \r\nfor b in range(counter, len(string)):\r\n counter += 1\r\n if string[b] == \"e\":\r\n heidicounter += 1\r\n break\r\n \r\nfor c in range(counter, len(string)):\r\n counter += 1\r\n if string[c] == \"i\":\r\n heidicounter += 1\r\n break\r\n \r\nfor d in range(counter, len(string)):\r\n counter += 1\r\n if string[d] == \"d\":\r\n heidicounter += 1\r\n break\r\n \r\nfor e in range(counter, len(string)):\r\n counter += 1\r\n if string[e] == \"i\":\r\n heidicounter += 1\r\n break\r\n \r\nif heidicounter == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nfool=\"heidi\"\r\nk=0\r\nf=0\r\nfor i in s:\r\n if i == fool[k]:\r\n k+=1\r\n if k>=len(fool):\r\n f=1\r\n break\r\nif f==1:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "\r\nimport sys\r\nInput = sys.stdin.readline\r\ns = Input()\r\na = 'heidi'\r\nq = 0\r\nfor i in s:\r\n if i == a[q]:\r\n q += 1\r\n if q == 5:\r\n break\r\nprint('YES' if q == 5 else 'NO')\r\n\r\n# FMZJMSOMPMSL\r\n", "s = input()\r\n\r\ns2 = ['h', 'e', 'i', 'd', 'i']\r\ncount = 0\r\n\r\nfor k in range(len(s)):\r\n ch1 = s[k]\r\n ch2 = s2[count]\r\n if ch1 == ch2:\r\n count += 1\r\n # print(ch1, ch2, count)\r\n if count == 5:\r\n break\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "s=input()\r\nfake=\"heidi\"\r\ncount=0\r\nn=0\r\nfor i in fake:\r\n for j in range(n,len(s)):\r\n if(i==s[j]):\r\n count=count+1\r\n n=j\r\n break\r\n\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n=input()\r\n\r\na='heidi'\r\ncount=i=0\r\nwhile i<len(n):\r\n if a[count]==n[i]:\r\n count+=1\r\n i+=1\r\n if count==5:\r\n break\r\n \r\nif count==5 and i<=len(n):\r\n print('YES')\r\n \r\nelse:\r\n print('NO')", "s = input()\r\nj = 0\r\nss = 'heidi#'\r\nfor i in s:\r\n if i == ss[j]:\r\n j += 1\r\n if j == 5:\r\n break\r\nprint(\"YES\" if j == 5 else \"NO\")", "a=input()\r\ns='heidi'\r\ncnt=0\r\nfor i in a:\r\n if i==s[cnt]:\r\n cnt+=1\r\n if cnt==5:\r\n print('YES')\r\n break\r\nelse: print('NO')", "s=input()\r\ndef f(s):\r\n\tfor i in \"heidi\":\r\n\t\tif i in s:\r\n\t\t\ts=s[s.index(i)+1:]\r\n\t\telse:\r\n\t\t\treturn \"NO\"\r\n\treturn \"YES\"\r\nprint(f(s))", "s = input()\nh = 0\ne = 0\ni1 = 0\nd = 0\ni2 = 0\nfor i in range(len(s)):\n if s[i] == \"h\":\n s = s[i:]\n h = 1\n break\nfor i in range(len(s)):\n if s[i] == \"e\":\n s = s[i:]\n e = 1\n break\nfor i in range(len(s)):\n if s[i] == \"i\":\n s = s[i:]\n i1 = 1\n break\nfor i in range(len(s)):\n if s[i] == \"d\":\n s = s[i:]\n d = 1\n break\nfor i in range(len(s)):\n if s[i] == \"i\":\n s = s[i:]\n i2 = 1\n break\nif h == 1 and e == 1 and i1 == 1 and d == 1 and i2 == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t\t\t \t \t \t\t \t\t \t \t", "s=input()\r\na=len(s)-s[::-1].find('i')\r\n\r\nif s.find('h')<s.find('e',s.find('h'))<s.find('i',s.find('e',s.find('h')))<s.find('d',s.find('i',s.find('e',s.find('h'))))<a:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\nlst = \"heidi\"\r\nsum1 = 0\r\nd, f = 0, 0\r\nwhile f < len(s) and d < len(lst):\r\n if s[f] == lst[d]:\r\n d += 1\r\n f += 1\r\n sum1 += 1\r\n else:\r\n f += 1\r\nif sum1 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nh = 'heidi'\r\np = 0\r\n\r\nfor i in s:\r\n\tif i == h[p]:\r\n\t\tp += 1\r\n\tif p == 5:\r\n\t\tbreak\r\n\r\nif p==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "s=input()\r\np=['h','e','i','d','i','',]\r\nfor x in range(len(s)):\r\n if s[x]==p[0]:\r\n p.pop(0)\r\nif len(p)==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ch = input()\r\nch1 = ['h','e','i','d','i']\r\ni=0; j=0;\r\nwhile(i<len(ch) and j<5):\r\n if(ch[i]==ch1[j]): j+=1;\r\n i+=1\r\nif(j==5): print(\"YES\")\r\nelse: print(\"NO\")\r\n", "s=input().strip()\r\np='heidi'\r\ndef subseq(p,s):\r\n i=0\r\n j=0\r\n n=len(s)\r\n while(j<5 and i<n):\r\n if(p[j]==s[i]):\r\n j+=1\r\n i+=1 \r\n return j==5 \r\nif subseq(p,s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nv = 'heidi'\ni = 0\nfor c in s:\n if c == v[i]:\n i+=1\n if i == len(v):\n break\nif i == len(v): print('YES')\nelse: print('NO')\n\t\t\t \t \t\t\t \t\t \t\t \t\t\t\t", "s=input()\r\na='heidi'\r\nj=0\r\nfor i in s:\r\n if i==a[j]:\r\n j=j+1\r\n if j==5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "\r\na='heidi'\r\ns=input()\r\n\r\ncount=0\r\nfor i in s:\r\n\tif(i=='h' and count==0):\r\n\t\tcount+=1\r\n\telif(count==1 and i =='e'):\r\n\t\tcount+=1\r\n\telif(count==2 and i == 'i'):\r\n\t\tcount+=1\r\n\telif(count==3 and i == 'd'):\r\n\t\tcount+=1\r\n\telif(count==4 and i == 'i'):\r\n\t\tcount+=1\r\n\telse:\r\n\t\tpass\r\n\t\r\nif(count==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a = [x for x in list(input()) if x in \"heid\"]\r\nif \"h\" in a:\r\n first = a.index(\"h\")\r\n if \"e\" in a[first:]:\r\n second = first+a[first:].index(\"e\")\r\n if \"i\" in a[second:]:\r\n third = second+a[second:].index(\"i\")\r\n if \"d\" in a[third:]:\r\n fourth = third+a[third:].index(\"d\")\r\n if \"i\" in a[fourth:]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else: \r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n s = input()\r\n state = 0\r\n for i in range(len(s)):\r\n if s[i] == \"h\":\r\n s = s[i:]\r\n state += 1\r\n break\r\n\r\n if state == 1:\r\n for i in range(len(s)):\r\n if s[i] == \"e\":\r\n s = s[i:]\r\n state += 1\r\n break\r\n\r\n if state == 2:\r\n for i in range(len(s)):\r\n if s[i] == \"i\":\r\n s = s[i:]\r\n state += 1\r\n break\r\n\r\n if state == 3:\r\n for i in range(len(s)):\r\n if s[i] == \"d\":\r\n s = s[i:]\r\n state += 1\r\n break\r\n\r\n if state == 4:\r\n for i in range(len(s)):\r\n if s[i] == \"i\":\r\n s = s[i:]\r\n state += 1\r\n break\r\n\r\n return \"YES\" if state == 5 else \"NO\"\r\n\r\n\r\nprint(main())\r\n", "n = input()\nname = \"\"\nfor i in range(len(n)):\n if n[i]==\"h\" and name == \"\":\n name +=\"h\"\n elif n[i] == \"e\" and name == \"h\":\n name +=\"e\"\n elif n[i]==\"i\" and name ==\"he\":\n name += \"i\"\n elif n[i]==\"d\" and name ==\"hei\":\n name+=\"d\"\n elif n[i]==\"i\" and name ==\"heid\":\n name += \"i\"\nif name == \"heidi\":\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", "s = input()\r\np = \"heidi\"\r\nk = 0\r\nfor i in range(len(s)):\r\n if k == 5:\r\n break\r\n else:\r\n if s[i] == p[k]:\r\n k += 1\r\n\r\nprint(\"YES\" if k == 5 else \"NO\")", "t=list(input())\r\ntry:\r\n while t[0]!='h':\r\n t.pop(0)\r\n while t[1]!='e':\r\n t.pop(1)\r\n while t[2]!='i':\r\n t.pop(2)\r\n while t[3]!='d':\r\n t.pop(3)\r\n while t[4]!='i':\r\n t.pop(4)\r\n print('YES')\r\nexcept:\r\n print('NO')", "def fake_news(txt):\r\n t = \"heidi\"\r\n l= 0\r\n n = len(t)\r\n m = len(txt)\r\n for j in range(m):\r\n if txt[j] == t[l]:\r\n l+= 1\r\n if l == n:\r\n break\r\n\r\n return \"YES\" if l == n else \"NO\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n txt = input()\r\n \r\n print (fake_news(txt))", "string = input()\r\nword = \"heidi\" \r\nword_counter = 0\r\nif len(string) < 5:\r\n print(\"NO\")\r\nfor i in range(len(string)):\r\n if word_counter == 5:\r\n break\r\n if word[word_counter] == string[i]:\r\n word_counter += 1\r\n \r\nif word_counter >= 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "\r\nstr = str(input())\r\nj = 0\r\ns = 'heidi#'\r\nfor i in str:\r\n if i == s[j]:\r\n j += 1\r\nprint ('YES' if j == 5 else 'NO')", "#D\nstrings=input()\ns=[]\nfor c in strings:\n if c==\"h\" and len(s)==0:\n s+=\"h\"\n if c==\"e\" and len(s)==1:\n s+=\"e\"\n if c==\"i\" and len(s)==2:\n s+=\"i\"\n if c==\"d\" and len(s)==3:\n s+=\"d\"\n if c==\"i\" and len(s)==4:\n s+=\"d\"\n break\nif len(s)==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t \t \t \t\t\t \t \t\t\t \t", "s = input()\r\nfound = 'YES'\r\nidx = 0\r\nfor ch in 'heidi':\r\n idx = s.find(ch, idx)\r\n if idx == -1:\r\n found = 'NO'\r\n break\r\nprint(found)\r\n", "\ns = input()\n\npos = 0\n\nfor c in s:\n\n if c == \"heidi\"[pos]:\n pos += 1\n\n if pos == 5:\n print(\"YES\")\n break\n\n else:\n continue\n\nif pos != 5:\n print(\"NO\")\n \t \t \t\t\t \t\t \t\t \t \t \t \t\t \t", "x=input().lower()\r\ny=len(x)\r\ncount=0\r\nfor i in range(y):\r\n if x[i]=='h' and count==0:\r\n count+=1\r\n elif x[i]=='e' and count==1:\r\n count+=1\r\n elif x[i]=='i' and (count==2 or count==4):\r\n count+=1\r\n elif x[i]=='d' and count==3:\r\n count+=1\r\nif count==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = input()\r\nfin = [\"h\",\"e\",\"i\",\"d\",\"i\"]\r\ni = 0\r\nfor a in x:\r\n if a == fin[i]:\r\n i += 1\r\n if i == 5:\r\n print(\"YES\")\r\n break\r\nif i < 5:\r\n print(\"NO\")\r\n", "s = input()\nb = \"heidi\"\ni = 0\nj = 0\nwhile(1):\n if j==len(b):\n print(\"YES\")\n break\n elif i==len(s):\n print(\"NO\")\n break\n if s[i]==b[j]:\n i+=1\n j+=1\n else:\n i+=1\n\n \n\t\t \t \t \t \t\t \t\t\t \t \t \t", "a='heidi'\ns=input()\nj=0\nfor i in range(len(s)):\n if s[i]==a[j]:\n j+=1 \n if j==5:\n break\nif j==5:\n print('YES')\nelse:\n print('NO')\n\t \t \t\t\t \t \t\t \t\t \t \t\t\t\t\t", "s=input()\r\ntarg='heidi'\r\ncur=0\r\nfor i in s:\r\n if i==targ[cur]:\r\n cur+=1\r\n if cur==5:\r\n break\r\n \r\nif cur==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "checking = \"heidi\"\r\nres = \"YES\"\r\nl = 0\r\nz = input()\r\nwhile True and l < 5:\r\n new = z.find(checking[l])\r\n if new == -1:\r\n res = \"NO\"\r\n break\r\n z = z[new:]\r\n l += 1\r\nprint(res)", "n=input()\r\na=0\r\nfor i in n:\r\n if i=='h' and a==0:\r\n a+=1\r\n elif i=='e' and a==1:\r\n a+=1\r\n elif i=='i' and a==2:\r\n a+=1\r\n elif i=='d' and a==3:\r\n a+=1\r\n elif i=='i' and a==4:\r\n a+=1\r\nif a==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\ns = \"\"\r\nsp = [\"h\",\"i\",\"e\",\"d\"]\r\nfor i in range(len(a)):\r\n if(a[i] in sp):\r\n s = s + a[i]\r\nc = 0\r\nfor i in range(len(s)):\r\n if(s[i] == \"h\" and c == 0):\r\n c +=1\r\n elif(s[i] == \"e\" and c == 1):\r\n c += 1\r\n elif(s[i] == \"i\" and c == 2):\r\n c += 1\r\n elif(s[i] == \"d\" and c == 3):\r\n c += 1\r\n elif(s[i] == \"i\" and c == 4):\r\n c += 1\r\n#print(s)\r\n#print(c)\r\nif(c == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=0\r\nfor k in range(len(s)):\r\n if a==0 and s[k]==\"h\":\r\n a+=1\r\n if a==1 and s[k]==\"e\":\r\n a+=1\r\n if a==2 and s[k]==\"i\":\r\n a+=1\r\n if a==3 and s[k]==\"d\":\r\n a+=1\r\n if a==4 and s[k]==\"i\":\r\n a+=1\r\nif a==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\nanswer = \"\"\nfor i in range(len(n)):\n if n[i]==\"h\" and answer==\"\":\n answer+=\"h\"\n elif n[i]==\"e\" and answer==\"h\":\n answer+=\"e\"\n elif n[i]==\"i\" and answer==\"he\":\n answer+=\"i\"\n elif n[i]==\"d\" and answer==\"hei\":\n answer+=\"d\"\n elif n[i]==\"i\" and answer==\"heid\":\n answer+=\"i\"\nif answer==\"heidi\":\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t \t\t \t \t\t\t \t \t\t\t", "s=input()\r\ns1=0\r\nl=[]\r\nfor h in s:\r\n l.append(h)\r\nfor i in range(len(l)):\r\n if l[i]=='h':\r\n s1+=1\r\n del l[0:i]\r\n break\r\nfor i in range(len(l)):\r\n if l[i]=='e':\r\n s1+=1\r\n del l[0:i]\r\n break\r\nfor i in range(len(l)):\r\n if l[i]=='i':\r\n s1+=1\r\n del l[0:i]\r\n break\r\nfor i in range(len(l)):\r\n if l[i]=='d':\r\n s1+=1\r\n del l[0:i]\r\n break\r\nfor i in range(len(l)):\r\n if l[i]=='i':\r\n s1+=1\r\n del l[0:i]\r\n break\r\nif s1==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# x = [int(x) for x in input().split()]\r\ns = input() # take input from user\r\n\r\n# initialize variables to keep track of the characters of \"heidi\" to match\r\ni = 0\r\nj = 0\r\n\r\n# iterate over each character of s to check for \"heidi\" as a subsequence\r\nwhile i < len(s) and j < 5:\r\n if s[i] == \"h\" and j == 0:\r\n j += 1\r\n elif s[i] == \"e\" and j == 1:\r\n j += 1\r\n elif s[i] == \"i\" and j == 2:\r\n j += 1\r\n elif s[i] == \"d\" and j == 3:\r\n j += 1\r\n elif s[i] == \"i\" and j == 4:\r\n j += 1\r\n i += 1\r\n\r\nif j == 5: # if all characters of \"heidi\" were matched\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_subseq(x, y):\r\n it = iter(y)\r\n return all(any(c == ch for c in it) for ch in x)\r\n\r\ns = input()\r\nif is_subseq('heidi',s) == False:\r\n print('NO')\r\nelse:\r\n print('YES')", "string = input()\nx = 0\nwhile x < len(string) and string[x] != \"h\":\n x += 1\nwhile x < len(string) and string[x] != \"e\":\n x += 1\nwhile x < len(string) and string[x] != \"i\":\n x += 1\nwhile x < len(string) and string[x] != \"d\":\n x += 1\nwhile x < len(string) and string[x] != \"i\":\n x += 1\nif x >= len(string):\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", "string = input()\nchecker = 'heidi'\ncounter = 0\nfor i in string:\n if checker[counter] == i:\n counter += 1\n if counter == 5:\n break\nif counter == 5:\n print('YES')\nelse:\n print('NO')\n \t \t\t \t\t \t \t\t\t\t\t\t \t \t\t\t \t\t", "\r\n\r\n\r\n#numbers = list(map(int, input().split()))\r\n\r\nn = input()\r\ncnt = 0\r\nchk = 1\r\nfor i in range(len(n)):\r\n if n[i] == 'h' and chk == 1:\r\n cnt+=1\r\n chk+=1\r\n elif n[i] == 'e' and chk == 2:\r\n cnt+=1\r\n chk+=1\r\n elif n[i] == 'i' and chk == 3:\r\n cnt+=1\r\n chk+=1\r\n elif n[i] == 'd' and chk == 4:\r\n cnt+=1\r\n chk+=1\r\n elif n[i] == 'i' and chk == 5:\r\n cnt+=1\r\n chk+=1\r\n\r\nif(cnt==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = list(input())\r\ngiven = list(\"heidi\")\r\nindex_value = 0\r\ni = 0\r\nindices = []\r\nwhile i < len(s):\r\n if given[index_value] == s[i]:\r\n indices.append(s[i])\r\n index_value += 1\r\n if \"\".join(indices) == \"heidi\":\r\n break\r\n i += 1\r\nif \"\".join(indices) == \"heidi\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "f = False\nh = \"heidi\"\ni = 0\nj = 0\nv = input()\nfor j in v:\n if h[i] == j:\n if i == 4:\n f = True\n break\n i += 1\nprint([\"NO\", \"YES\"][f])\n", "\r\ns = input()\r\ntarget = \"heidi\"\r\nindex = 0\r\n\r\nfor char in s:\r\n if char == target[index]:\r\n index += 1\r\n if index == len(target):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\n\nh, e, iFirst, d, iSecond = False, False, False, False, False\n\nfor x in s:\n if x == 'h' and not h:\n h = True\n if x == 'e' and h and not e:\n e = True\n if x == 'i' and e and not iFirst:\n iFirst = True\n if x == 'd' and iFirst:\n d = True\n if x == 'i' and d:\n iSecond = True\n\n\nif h and e and d and iFirst and iSecond:\n print('YES')\nelse:\n print('NO')\n", "s = input()\nname = 'heidi'\nj = 0\nfor i in range(len(s)):\n if (s[i] == name[j]):\n j +=1\n if (j==5):\n break\nprint('YES' if j == 5 else 'NO')\n\t\t\t \t \t\t \t\t \t \t \t \t\t \t\t\t\t", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=read()\n\tb=\"heidi\"\n\ti=0\n\tfor c in a:\n\t\tif c==b[i]:\n\t\t\ti+=1\n\t\t\tif i==5:\n\t\t\t\tprint(\"YES\")\n\t\t\t\treturn\n\tprint(\"NO\")\n\nsolve()\n", "a=input()\r\nb='heidi'; cnt=0\r\nfor i in a:\r\n if i==b[cnt]:\r\n cnt+=1\r\n if cnt==5:\r\n break\r\nprint('YES' if cnt==5 else 'NO')", "def check_subsequence(s):\r\n target = \"heidi\"\r\n j = 0\r\n for char in s:\r\n if char == target[j]:\r\n j += 1\r\n if j == len(target):\r\n return \"YES\"\r\n return \"NO\"\r\ns = input().strip()\r\nresult = check_subsequence(s)\r\nprint(result)\r\n", "\nline = input()\nheidi = 'heidi'\nidx = 0\nfor ch in line:\n # match current character\n if ch == heidi[idx]:\n # move to next character\n idx = idx + 1\n if idx >= len(heidi):\n break\nif idx >= len(heidi):\n print('YES')\nelse:\n print('NO')\n \t\t \t\t \t\t\t \t \t \t\t \t", "#Davidson Lisboa Della Piazza, 169786\n\nn = input()\nheidi = ['h','e','i','d','i']\nflag = 0\nfor i in n:\n if(i == heidi[0]):\n del heidi[0]\n if not heidi:\n flag = 1\n break\n\nif(flag==1):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t\t\t \t \t \t\t \t \t\t", "s='heidi$'\r\ni=0\r\nfor x in input():\r\n if x==s[i]:i+=1\r\nprint('YNEOS'[i<5::2])", "a = list(input())\r\nb = list('heidi')\r\nwhile a and b:\r\n if a[-1] == b[-1]:\r\n b.pop()\r\n a.pop()\r\nprint('NO' if b else 'YES')\r\n", "s = input()\r\nif s.find('i',s.find('d',s.find('i',s.find('e',s.find('h'))))) == -1 or \\\r\n s.find('e',s.find('h')) == -1 or s.find('h') == -1 or \\\r\n s.find('i',s.find('e',s.find('h'))) ==-1 or s.find('d',s.find('i',s.find('e',s.find('h')))) == -1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "s = iter(input())\r\nprint((\"NO\",\"YES\")[all(i in s for i in \"heidi\")])", "j = 0; a = 'heidi!'\r\nfor i in input():\r\n if i == a[j]: j += 1\r\nprint('NO' if j < 5 else 'YES')", "s = input()\r\ntry:\r\n h = s.index('h')\r\n e = s.index('e', h)\r\n i = s.index('i', e)\r\n d = s.index('d', i)\r\n ii = s.index('i', d)\r\nexcept:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "s = input()\n\nheidi = \"heidi\"\nx = 0\n\nfor i in range(len(s)):\n if(s[i] == heidi[x]):\n x +=1\n if (x == 5):\n break\n\nif(x == 5): print(\"YES\")\nelse: print(\"NO\")\n\n \t\t \t\t \t \t \t \t \t \t\t\t", "i = input()\r\nt = \"heidi\"\r\nk = 0\r\nflag = 0\r\nfor j in i:\r\n\tif j == t[k]:\r\n\t\tk = k + 1\r\n\tif k == 5:\r\n\t\tflag = 1\r\n\t\tbreak\r\nif flag == 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = 'heidi'\r\nc = 0\r\ni = 0\r\na = input()\r\nwhile (i<len(a) and c < len(s)):\r\n if a[i] == s[c]:\r\n c += 1\r\n i += 1\r\nif c == len(s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "text = input()\nindex = 0\nname = [\"h\", \"e\", \"i\", \"d\", \"i\"]\naux_name = 0\nfor i in range(len(text)):\n if text[i] == name[aux_name]:\n aux_name += 1\n if aux_name == len(name):\n break\nif aux_name != len(name):\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", "s=input()\r\nsa='heidi'\r\nj=0\r\nnk=0\r\nfor i in s:\r\n if sa[j]==i:\r\n j+=1\r\n if j==5:\r\n nk=1\r\n print('YES')\r\n break\r\nif nk==0:\r\n print('NO')", "#heidi\r\n#idieh\r\ndef check(s):\r\n h=False;e=False;i1=False;d=False;i2=False\r\n for i in range(len(s)):\r\n if s[i]=='h':\r\n h=True\r\n #print(h)\r\n if h and s[i]=='e':\r\n \te=True\r\n \t#print(h,e)\r\n if h and e and s[i]=='i':\r\n \ti1=True\r\n \t#print(h,e,i1)\r\n if h and e and i1 and s[i]=='d':\r\n \td=True\r\n \t#print(h,e,i1,d)\r\n if h and e and i1 and d and s[i]=='i':\r\n \ti2=True\r\n \t#print(h,e,i1,d,i2)\r\n return h and e and i1 and d and i2\r\n\r\nst=str(input())\r\nprint('YES' if check(st) else 'NO')\r\n#print(fact(a) if a<b else fact(b))", "j = 0; a = 'heidi!'\nfor i in input():\n if i == a[j]: j += 1\nprint('NO' if j < 5 else 'YES')", "s = input()\r\nk = 0\r\nif 'h' in s:\r\n s = s[s.index('h'):]\r\n k += 1\r\nif 'e' in s:\r\n s = s[s.index('e'):]\r\n k += 1\r\nif 'i' in s:\r\n s = s[s.index('i'):]\r\n k += 1\r\nif 'd' in s:\r\n s = s[s.index('d'):]\r\n k += 1\r\nif 'i' in s:\r\n s = s[s.index('i'):]\r\n k += 1\r\nif k == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nname='heidi'\r\nfor i in s:\r\n if i==name[0]:\r\n name=name[1:]\r\n if name=='': break\r\nif name=='': print('YES')\r\nelse: print('NO')\r\n", "a=iter(input());b=\"heidi\";print(\"YES\"*all(i in a for i in b)or\"NO\")\r\n", "user = input()\n\nheidi = \"heidi\"\n\ni = 0\nj = 0\n\n\nwhile i < len(user) and j < len(heidi):\n if heidi[j] == user[i]:\n j += 1\n i += 1\n\nif user == \"heidi\":\n print(\"NO\")\nelif j == len(heidi):\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", "N=str(input())\nM=\"heidi\"\nX=0\nfor Y in N:\n if Y==M[X]: X=X+1\n if X<len(M): continue\n if X==len(M): break\nif X==5: print(\"YES\")\nelse:print(\"NO\")\n\n\t \t\t \t \t\t\t \t\t \t\t\t \t\t", "def is_subseq(x, y):\r\n it = iter(y)\r\n return all(c in it for c in x)\r\n\r\ntarget_subsequence = \"heidi\"\r\n\r\ns = input() \r\n\r\nif is_subseq(target_subsequence, s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nt = \"heidi\"\r\ncnt = 0\r\nfor i in s:\r\n if cnt!=5 and i == t[cnt]: cnt+=1\r\nif cnt < 5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "word = input()\ns = []\nif len(word) < 5:\n print(\"NO\")\nelif len(word) >= 5:\n for x in range(len(word)):\n if len(s) == 0 and word[x] == 'h':\n s.append('h')\n elif word[x] == 'e'and len(s) == 1:\n s.append('e')\n elif word[x] == 'i' and len(s) == 2:\n s.append('i')\n elif word[x] == 'd' and len(s) == 3:\n s.append('d') \n elif word[x] == 'i' and len(s) == 4:\n s.append('i')\nif len(s) == 5:\n print('YES')\nelse:\n print('NO')\n\n \t\t\t \t \t \t\t \t\t \t \t \t \t", "news=str(input())\r\nsearch='heidi'\r\npointer=0\r\nans='NO'\r\nfor i in news:\r\n if i==search[pointer]:\r\n pointer+=1\r\n if pointer==5:\r\n ans='YES'\r\n break\r\nprint(ans)\r\n", "str = input()\ncheck = ''\nif str == 'heidi':\n print('NO')\nelse:\n for c in str:\n if c == 'h' and len(check) == 0:\n check += 'h'\n if c == 'e' and len(check) == 1:\n check += 'e'\n if c == 'i' and len(check) == 2:\n check += 'i'\n if c == 'd' and len(check) == 3:\n check += 'd'\n if c == 'i' and len(check) == 4:\n check += 'i'\n if len(check) == 5:\n break\n\nif len(check) == 5:\n print('YES')\nelse:\n print('NO')\n \t \t \t \t\t \t\t\t \t\t \t\t \t\t", "S = input()\r\nh = 'heidi'\r\ni = 0\r\nfor s in S:\r\n if s == h[i]:\r\n i += 1\r\n if i == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "x = input()\r\ny = [\"h\", \"e\", \"i\", \"d\", \"i\"]\r\nfor i in x:\r\n if len(y) == 0:\r\n break\r\n elif y[0] == i:\r\n y = y[1:]\r\nprint(\"NO\") if len(y) else print(\"YES\")\r\n", "Bruh = input()\ncounter = 0\nHeidi_String = 'heidi_'\nfor i in Bruh:\n if i == Heidi_String[counter]:\n counter += 1\nif counter == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t\t\t \t\t\t\t\t \t \t\t \t\t \t \t \t\t", "n= input()\r\nl=\"heidi\"\r\nans=\"YES\"\r\nj=0\r\nfor i in n:\r\n if l[j]==i:\r\n\r\n j+=1\r\n if j==5:\r\n break\r\n\r\nif j!=5:\r\n print(\"NO\")\r\nelse:\r\n print(ans)", "test='heidi'\r\ns=input()\r\ncount=0\r\nisFake=False\r\n\r\nfor i in range(len(s)):\r\n if(s[i]==test[count]):\r\n count=count+1\r\n if(count>=len(test)):\r\n isFake=True\r\n break\r\n\r\n\r\nif(isFake): print('YES')\r\nelse : print('NO')", "def fakeNews():\n entrada = input()\n codigo = \"heidi\"\n for i in entrada:\n if i == codigo[0]:\n codigo = codigo[1:]\n if codigo == \"\":\n return \"YES\"\n return \"NO\"\n\n\nif __name__ == '__main__':\n print(fakeNews())\n\t \t\t \t \t \t \t \t \t\t\t \t\t \t\t\t", "s = input()\r\na = 'heidi.'\r\nj = 0\r\nfor i in s:\r\n\tif i == a[j]:\r\n\t\tj+=1\r\nprint(\"YNEOS\"[j!=5::2])", "entrada = str(input())\na = entrada.lower()\n\nif \"h\" in a:\n a = a[a.index(\"h\"):len(a)]\n if \"e\" in a:\n a = a[a.index(\"e\"):len(a)]\n if \"i\" in a:\n a = a[a.index(\"i\"):len(a)]\n if \"d\" in a:\n a = a[a.index(\"d\"):len(a)]\n if \"i\" in a:\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\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\t\t\t", "# --------------------------------#\r\n#-----------<HajLorenzo>-----------\r\n#Most Important Thing About Life\r\n#Is Loving What You Do...\r\n# --------------------------------#\r\n_=\"heidi\"\r\nn=input()\r\n__=0\r\nwhile(True):\r\n if(n[__] not in _):\r\n n=n.replace(n[__],\"\")\r\n else:\r\n __+=1\r\n if(__>=len(n)):\r\n break\r\nDFX=0\r\nfor i in range(len(n)):\r\n if(n[i]==\"heidi\"[DFX]):\r\n DFX+=1\r\n if(DFX==5):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "s = input()\r\n\r\nstring = ''\r\n\r\nfor i in range(len(s)):\r\n if string == '' and s[i] == 'h':\r\n string += 'h'\r\n if string == 'h' and s[i] == 'e':\r\n string += 'e'\r\n if string == 'he' and s[i] == 'i':\r\n string += 'i'\r\n if string == 'hei' and s[i] == 'd':\r\n string += 'd'\r\n if string == 'heid' and s[i] == 'i':\r\n string += 'i'\r\n break\r\n \r\nif string == 'heidi':\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\nnlist=list(n)\nlookfor = \"heidi\"\ncount = 0\nfor x in \"heidi\":\n index = n.find(x)\n n=n[index:]\n if index != -1:\n count+=1\nif count == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t\t \t \t \t \t\t\t \t", "s=input()\r\na=\"heidi\"\r\nm=len(s)\r\nn=len(a)\r\nc=0\r\ni=0\r\nj=0\r\nwhile(m>0 and n>0):\r\n if(a[j]==s[i]):\r\n c+=1\r\n j+=1\r\n n-=1\r\n i+=1\r\n m-=1\r\nif(c==len(a)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nk = 0\r\nl = 'heidi'\r\nfor i in s:\r\n\tif i == l[k]:\r\n\t\tk += 1\r\n\t\tif k == 5:\r\n\t\t\tprint('YES')\r\n\t\t\texit()\r\nprint('NO')", "x=input()\r\na=\"heidi\"\r\nb=0\r\nfor i in x:\r\n if i==a[b]:\r\n b=b+1\r\n if b==5:\r\n break\r\nif b==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str=input()\nstr2='heidi'\nl1=len(str2)\nl2=len(str)\nj=0\nres=0\nfor i in range(l2):\n if j<5 and str[i]==str2[j]:\n res +=1\n j +=1\n\nif res==5:\n print('YES')\nelse:\n print('NO')\n", "s=str(input())\r\nl=['h','e','i','d','i']\r\nans=[]\r\ni=0\r\nwhile len(l)>0 and i<len(s):\r\n if s[i]==l[0]:\r\n l.remove(l[0])\r\n i=i+1\r\n\r\n\r\nif len(l)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "# MSI\nn = input()\nlookingfor = \"heidi\"\ncount = 0\nfor i in \"heidi\":\n index = n.find(i)\n n = n[index:]\n if index != -1:\n count += 1\nif count == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t\t \t \t\t\t\t \t\t\t\t\t\t \t\t \t", "a=input()\r\nb='heidi'\r\nc=0\r\nfor i in range(0,len(a)):\r\n if a[i]==b[c]:\r\n c=c+1\r\n if c==5:\r\n break\r\nif c==5:\r\n\r\n print('YES' )\r\nelse:\r\n print(\"NO\") ", "# https://codeforces.com/problemset/problem/802/G\r\n\r\ns = input()\r\nprev = 0\r\nfinal = \"\"\r\nfor i in \"heidi\":\r\n temp = prev\r\n for j in s[prev:]:\r\n temp += 1\r\n if j == i:\r\n final += i\r\n prev = temp\r\n break\r\n\r\nif final == \"heidi\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s = input()\r\nword = 'heidi'\r\nindex = 0\r\nfor char in s:\r\n if char == word[index]:\r\n index += 1\r\n if index == 5:\r\n break\r\n\r\nif index == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#D\nlett = str(input())\nheidi = [\"h\", \"e\", \"i\", \"d\", \"i\"]\nspots = []\nsum = 0\nh = len(lett)\n\nfor y in range(len(lett)):\n if (lett[y] == \"h\"):\n spots.append(y)\n sum+=1\n break\nif (len(spots) > 0):\n for y in range(spots[0],h):\n if (lett[y] == \"e\"):\n spots.append(y)\n sum+=1\n break\nif (len(spots) > 1):\n for y in range(spots[1],h):\n if (lett[y] == \"i\"):\n spots.append(y)\n sum+=1\n break\nif (len(spots) > 2):\n for y in range(spots[2],h):\n if (lett[y] == \"d\"):\n spots.append(y)\n sum+=1\n break\nif (len(spots) > 3):\n for y in range(spots[3],h):\n if (lett[y] == \"i\"):\n spots.append(y)\n sum+=1\n break\n\nif (sum == 5):\n if (spots[1] > spots[0] and spots[2] > spots[1] and spots[3] > spots[2] and spots[4] > spots[3]):\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n\t\t\t \t\t \t \t\t\t\t \t \t\t\t\t \t\t\t \t", "t=input().strip()\r\nh=\"heidi\"\r\ni=0\r\nfor s in t:\r\n if h[i]==s:\r\n i+=1\r\n if i==5:\r\n break\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nidx = 0\nfor c in s:\n if c == \"heidi\"[idx]:\n idx += 1\n \n if idx == 5:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n\t \t \t\t\t \t \t\t\t\t\t \t\t\t\t\t\t", "j = input()\r\nh = 'heidi'\r\na = 0\r\nfor x in j:\r\n\tif a<5 and h[a] == x:\r\n\t\ta += 1\r\nif a < 5 or a>5:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "li = list(input())\r\n\r\ndef f(n,s):\r\n global li\r\n while True:\r\n if li[n] != s:\r\n li.pop(n)\r\n else:\r\n break\r\ntry: \r\n f(0,'h')\r\n f(1,'e')\r\n f(2,'i')\r\n f(3,'d')\r\n f(4,'i')\r\nexcept:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#D\n# MSI tutor helped\nnews= input()\nlf= \"heidi\"\ncount = 0\nfor i in \"heidi\":\n index = news.find(i)\n news = news[index:]\n if index != -1:\n count += 1\nif count == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t\t \t\t\t\t\t\t\t\t\t \t\t \t \t\t\t", "match_sequence = \"heidi\"\nmatch_sequence_length = len(match_sequence)\n\ntest_case = input()\n\ncurrent_match_index = 0\nfor letter in test_case:\n if letter == match_sequence[current_match_index] and current_match_index < 5:\n current_match_index += 1 \n if current_match_index == 5:\n break\n\nif current_match_index == match_sequence_length and len(test_case) > 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t\t\t\t \t\t\t\t\t\t\t\t \t \t \t", "t=input()\r\np=\"heidi\"\r\nj=0\r\nfor c in t:\r\n if c==p[j]:\r\n j+=1\r\n if j==5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\n\r\nh = -1\r\ne = -1\r\ni1 = -1\r\nd = -1\r\ni2 = -1\r\n\r\nfor k in range(len(s)):\r\n if s[k] == \"h\" and h == -1:\r\n h = k\r\n elif s[k] == \"e\" and e == -1 and k > h and h != -1:\r\n e = k\r\n elif s[k] == \"i\":\r\n if i1 == -1:\r\n if k > e and e != -1:\r\n i1 = k\r\n elif i2 == -1:\r\n if k > d and d != -1:\r\n i2 = k\r\n break\r\n elif s[k] == \"d\" and d == -1 and k > i1 and i1 != -1:\r\n d = k\r\n\r\nif h < e < i1 < d < i2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\np=\"heidi\"\r\nj=0\r\nlst=[]\r\nfor i in range(len(p)):\r\n while j<len(s):\r\n if p[i]==s[j]:\r\n lst.append(s[j])\r\n j=j+1\r\n break\r\n else:\r\n j=j+1\r\nls=\"\".join(lst)\r\nif ls==p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# from collections import defaultdict\r\n# from sys import stdin\r\n# import itertools\r\n# import bisect\r\n# from math import sqrt,ceil,floor\r\n\r\ndef func(put,mapping,unpack):\r\n s,t=list(put(str)),list('heidi')\r\n n,m=len(s),len(t)\r\n dp = [[0 for __ in range(m+1)] for _ in range(n+1)]\r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if s[i-1] == t[j-1]: dp[i][j] = 1 + dp[i-1][j-1]\r\n else: dp[i][j] = max(dp[i][j-1],dp[i-1][j])\r\n if dp[n][m] == m: print('YES')\r\n else: print('NO') \r\n \r\ndef init(TestCases=True):\r\n put = lambda s: s(input().strip())\r\n mapping = lambda s: list(map(s,input().split()))\r\n unpack = lambda s: map(s,input().split())\r\n for _ in range(int(input()) if TestCases else 1):\r\n func(put,mapping,unpack)\r\n\r\nif __name__ == '__main__':\r\n init(False)", "s=input().lower()\nh,e1,i1,d,i2=0,0,0,0,0\nfor i in s:\n if i==\"h\": h+=1\n if h and i==\"e\": e1+=1\n if e1 and i==\"i\": i1+=1\n if i1 and i==\"d\": d+=1\n if d and i==\"i\": i2+=1\nif i2:\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\t", "import sys\n\nstr = input()\nfake_str = \"heidi\"\n\nif len(str) == 5:\n if fake_str == input:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n count = 0\n indx = 0\n for letter in str:\n if letter == fake_str[indx]:\n count += 1\n if count == 5:\n print(\"YES\")\n sys.exit(0)\n indx += 1\n \n if count == 5:\n print(\"YES\")\n else:\n print(\"NO\")", "s = str(input())\r\nt = 0\r\nn = 0\r\n\r\nwhile (t != 1 and n<len(s)):\r\n\tif(s[n] == 'h'):\r\n\t\tt += 1\r\n\tn += 1\r\n\r\nwhile (t != 2 and n<len(s)):\r\n\tif(s[n] == 'e'):\r\n\t\tt += 1\r\n\tn += 1\r\n\r\nwhile (t != 3 and n<len(s)):\r\n\tif(s[n] == 'i'):\r\n\t\tt += 1\r\n\tn += 1\r\n\r\nwhile (t != 4 and n<len(s)):\r\n\tif(s[n] == 'd'):\r\n\t\tt += 1\r\n\tn += 1\r\n\r\nwhile (t != 5 and n<len(s)):\r\n\tif(s[n] == 'i'):\r\n\t\tt += 1\r\n\tn += 1\r\n\r\nif (t == 5):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n", "# LUOGU_RID: 101452292\np=0\r\nfor c in input():\r\n if c=='heidi'[p]:\r\n p+=1\r\n if p==5:\r\n exit(print('YES'))\r\nprint('NO')", "s = str(input())\n\nsub = [\"h\", \"e\", \"i\", \"d\", \"i\"]\nj = 0\nend = False\n\nfor i in range(len(s)):\n if j == 5:\n end = True\n break\n if sub[j] == s[i]:\n j += 1\n\nif j == 5:\n end = True\n\nif end == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t\t \t \t \t\t \t", "n=input()\nm=\"\"\nfirst=0\nsecond=0\nthird=0\nfourth=0\nfor i in range(len(n)):\n if(n[i]==\"h\"):\n m+=n[i]\n first=i\n break\nfor j in range(first+1,len(n)):\n if(n[j]==\"e\"):\n m+=n[j]\n second=j\n break\nfor k in range(second+1,len(n)):\n if(n[k]==\"i\"):\n m+=n[k]\n third=k\n break\nfor l in range(third+1,len(n)):\n if(n[l]==\"d\"):\n m+=n[l]\n fourth=l\n break\nfor o in range(fourth+1,len(n)):\n if(n[o]==\"i\"):\n m+=n[o]\n break\nif(m==\"heidi\"):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t \t \t\t\t\t\t\t \t \t \t", "def main():\n phrase = input()\n heidi = ['h', 'e', 'i', 'd', 'i']\n idx = 0\n for letter in phrase:\n if (letter == heidi[idx]):\n idx += 1\n if (idx == len(heidi)):\n print(\"YES\")\n return\n \n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()\n \t\t\t\t \t \t \t \t \t\t \t\t \t\t \t", "s=input()\nsubsequence=\"\"\na=0\nb=0\nc=0\nd=0\ne=0\nfor a1 in range(len(s)):\n if s[a1] == \"h\":\n subsequence=subsequence+s[a1]\n a=a1\n break\nfor b1 in range(a+1,len(s)):\n if s[b1] == \"e\":\n subsequence=subsequence+s[b1]\n b = b1\n break\nfor c1 in range(b+1,len(s)):\n if s[c1] == \"i\":\n subsequence=subsequence+s[c1]\n c = c1\n break\nfor d1 in range(c+1,len(s)):\n if s[d1] == \"d\":\n subsequence=subsequence+s[d1]\n d = d1\n break\nfor e1 in range(d+1,len(s)):\n if s[e1] == \"i\":\n subsequence=subsequence+s[e1]\n break\nif subsequence != \"heidi\":\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", "def isFakeNews(news):\r\n i = 0 \r\n n = len(news)\r\n for char in \"heidi\":\r\n if i >= n :\r\n return \"NO\"\r\n \r\n while news[i] != char :\r\n i += 1 \r\n if i >= n :\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n \r\n \r\n\r\n\r\n\r\nnews = input()\r\n\r\nprint(isFakeNews(news))", "s=input()\nname = \"heidi\"\n\nlen1 = len(s)\nlen2 = len(name)\ncounter = 0\n\nfor a in range(len2):\n index = s.find(name[a])\n\n if index == -1:\n print(\"NO\")\n counter = 1\n break\n \n if index == len1 - 1 and a < len2 - 1:\n print(\"NO\")\n counter = 1\n break\n\n s = s[index + 1:]\n\nif counter == 0:\n print(\"YES\")\n\t \t\t \t \t\t\t\t \t \t \t\t\t\t \t\t\t", "s=list(input())\r\nh=0\r\nif 'h' not in s or 'e' not in s or 'i' not in s or 'd' not in s:\r\n print('NO')\r\nelse:\r\n p=[]\r\n for i in s:\r\n if i=='h' or i=='e' or i=='i' or i=='d' :\r\n p.append(i)\r\n for i in range(0,len(p)):\r\n if p[i]=='h':\r\n h+=1\r\n break\r\n for j in range(i,len(p)):\r\n if p[j]=='e':\r\n h+=1\r\n break\r\n for i in range(j,len(p)):\r\n if p[i]=='i':\r\n h+=1\r\n break\r\n for j in range(i,len(p)):\r\n if p[j]=='d':\r\n h+=1\r\n break\r\n for i in range(j,len(p)):\r\n if p[i]=='i':\r\n h+=1\r\n break\r\n if h!=5:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "# Matheus de Souza Oliveira - RA: 203407\n\nnews = input()\nfakeString = \"heidi\"\nisFake = False\n\nstartingIndex = 0\nfor letter in fakeString:\n result = news.find(letter, startingIndex)\n if result != -1:\n startingIndex = result\n isFake = True\n else:\n isFake = False\n break\n \nif isFake:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t\t \t \t \t \t\t \t\t \t\t", "s = input()\n# heidi\ni = 0\nfor c in \"heidi\":\n i = s.find(c, i)\n if i == -1:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\n\n# i = s.find(\"h\")\n# if i == -1:\n# print(\"NO\")\n# else:\n# i = s.find(\"e\", i)\n# if i == -1:\n# print(\"NO\")", "import math\r\nif __name__ == \"__main__\":\r\n a=input()\r\n flag=0\r\n for i in a:\r\n if i=='h' and flag==0:\r\n flag+=1\r\n if i=='e' and flag==1:\r\n flag+=1\r\n if i=='i' and flag==2:\r\n flag+=1\r\n if i=='d' and flag==3:\r\n flag+=1\r\n if i=='i' and flag==4:\r\n flag+=1\r\n if flag>=5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "linea = input()\r\n\r\ntarget = \"heidi\"\r\ncont = 0\r\n\r\nfor i in linea:\r\n if cont == 5:\r\n break\r\n if i == target[cont] :\r\n cont+=1\r\n \r\nif cont == 5:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "# Input\r\ns = input()\r\n\r\n# Check if \"heidi\" is a subsequence of the input string\r\ntarget = \"heidi\"\r\ni, j = 0, 0\r\n\r\nwhile i < len(s) and j < len(target):\r\n if s[i] == target[j]:\r\n j += 1\r\n i += 1\r\n\r\n# Output\r\nif j == len(target):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "'''\r\n * @author Md. Sohanuzzaman Soad\r\n * @email [email protected]\r\n * @university University of Asia Pacific, Bangladesh\r\n * @create date 2022-07-02 16:47:51\r\n * @modify date 2022-07-02 16:49:22\r\n'''\r\n\r\n\r\n\r\ndef solve(s):\r\n\r\n t = \"heidi\"\r\n j = 0\r\n t_len = len(t)\r\n s_len = len(s)\r\n for i in range(s_len):\r\n if s[i] == t[j]:\r\n j += 1\r\n if j == t_len:\r\n break\r\n\r\n return \"YES\" if j == t_len else \"NO\"\r\n\r\n\r\nstr = input()\r\nprint(solve(str))", "linha = input()\n\nfalhou = False\n\nif 'h' in linha:\n posicao = linha.index('h')\n linha = linha[posicao:]\nelse:\n falhou = True\n\nif 'e' in linha:\n posicao = linha.index('e')\n linha = linha[posicao:]\nelse:\n falhou = True\n\nif 'i' in linha:\n posicao = linha.index('i')\n linha = linha[posicao:]\nelse:\n falhou = True\n\nif 'd' in linha:\n posicao = linha.index('d')\n linha = linha[posicao:]\nelse:\n falhou = True\n\nif 'i' in linha:\n posicao = linha.index('i')\n linha = linha[posicao:]\nelse:\n falhou = True\n\nif falhou:\n print('NO')\nelse:\n print('YES')\n\n\t\t\t\t\t \t\t\t\t \t\t\t \t\t \t\t\t\t\t \t \t", "heidi = ['h', 'e', 'i', 'd', 'i']\n\ntext = input()\n\nis_fake_news = False\nfor letter in text:\n\tif heidi[0] == letter:\n\t\theidi = heidi[1:]\n\t\tif len(heidi) == 0:\n\t\t\tis_fake_news = True\n\t\t\tbreak\n\nif is_fake_news:\n\tprint('YES')\nelse:\n\tprint('NO')\n\t \t \t \t\t\t \t \t\t \t \t \t\t \t \t", "t = \"heidi\"\r\ns = input()\r\nr = False\r\nind = 0\r\n\r\nfor p in range(len(s)):\r\n if s[p] == t[ind]:\r\n ind += 1\r\n if ind >= len(t):\r\n r = True\r\n break\r\n\r\nprint(\"YES\" if r else \"NO\")", "s=input()\r\np=\"heidi\"\r\nk=0\r\nfor i in range(len(s)):\r\n if k==5:\r\n break\r\n else:\r\n if s[i]==p[k]:\r\n k+=1\r\nprint(\"YES\" if k==5 else \"NO\") ", "x=input()\r\nflag=1;\r\nfor char in x:\r\n if(char=='h' and flag==1) :\r\n flag+=1\r\n elif(char == 'e' and flag == 2):\r\n flag+=1\r\n elif (char == 'i' and flag == 3):\r\n flag+=1\r\n elif (char == 'd' and flag == 4):\r\n flag+=1\r\n elif (char == 'i' and flag == 5):\r\n flag+=1\r\n\r\nif(flag==6 and len(x)>=6):\r\n print('YES')\r\nelse:\r\n print('NO')", "x = (input())\r\nname = (\"heidi\")\r\nlen_x = len(x)\r\nlen_name = len(name)\r\nn = 0\r\nr = ''\r\n\r\nfor i in x:\r\n if i == name[n: n+1]:\r\n n += 1\r\n if n == len_name:\r\n r = ('YES')\r\n break\r\n elif i == x[len_x-1]:\r\n r = ('NO')\r\n\r\nprint(r)", "\na = input()\nlocations = []\nheidi = \"heidi\"\nh = 0\ni = 0\n \nwhile i < len(a):\n if h == 5:\n break\n lofh = heidi[h]\n if lofh == a[i]:\n locations.append(i)\n h += 1 \n i += 1 \n \nif (h <= 4):\n print(\"NO\")\nelse:\n print(\"YES\")\n \t\t\t\t \t\t \t\t \t\t\t \t\t \t \t\t", "st = input()\nl = len(st)\nfor a in range(l):\n\tif st[a] == 'h':\n\t\tfor b in range(a+1, l):\n\t\t\tif st[b] == 'e':\n\t\t\t\tfor c in range(b+1, l):\n\t\t\t\t\tif st[c] == 'i':\n\t\t\t\t\t\tfor d in range(c+1, l):\n\t\t\t\t\t\t\tif st[d] == 'd':\n\t\t\t\t\t\t\t\tfor e in range(d+1, l):\n\t\t\t\t\t\t\t\t\tif st[e] == 'i':\n\t\t\t\t\t\t\t\t\t\tprint('YES')\n\t\t\t\t\t\t\t\t\t\texit()\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\tbreak\n\t\t\t\tbreak\n\t\tbreak\nprint('NO')\n\n# zalil nashi hosein ", "import math \r\nt = input()\r\nans = [\"h\", \"e\", \"i\", \"d\", \"i\"]\r\nfor i in t:\r\n if len(ans) == 0:\r\n break\r\n elif ans[0] == i:\r\n ans = ans[1:]\r\nif len(ans):\r\n print(\"NO\") \r\nelse:\r\n print(\"YES\")", "s = input()\n\ni = 0\n\nheidi = []\n\nwhile i < len(s):\n if s[i] == 'h':\n heidi.append(s[i])\n break\n i += 1\n\nwhile i < len(s):\n if s[i] == 'e':\n heidi.append(s[i])\n break\n i += 1\n\nwhile i < len(s):\n if s[i] == 'i':\n heidi.append(s[i])\n break\n i += 1\n\nwhile i < len(s):\n if s[i] == 'd':\n heidi.append(s[i])\n break\n i += 1\n\nwhile i < len(s):\n if s[i] == 'i':\n heidi.append(s[i])\n break\n i += 1\n\nfinal = ''.join(heidi)\n\nif final == 'heidi':\n print('YES')\nelse:\n print('NO')", "# HW 4d\n\n\n# input string\nstring = input()\n\n# search for substring hiedi in string\nhiedi = 'heidi'\ni = 0\nj = 0\nwhile i < len(hiedi) and j < len(string):\n if hiedi[i] == string[j]:\n i += 1\n j += 1\n\nif i == len(hiedi):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t \t\t \t \t\t\t \t \t\t", "\n\ndef isSubSequence(str1, str2):\n m = len(str1)\n n = len(str2)\n \n j = 0 \n i = 0 \n \n while j < m and i < n:\n if str1[j] == str2[i]:\n j = j+1\n i = i + 1\n \n return j == m\n \n \n \nstr1 = 'heidi'\nstr2 = input()\n \nprint(\"YES\") if isSubSequence(str1, str2) else print(\"NO\")\n\n\n'''\ndef isSubSequence(string1, string2, m, n):\n if m == 0:\n return True\n if n == 0:\n return False\n \n if string1[m-1] == string2[n-1]:\n return isSubSequence(string1, string2, m-1, n-1)\n \n return isSubSequence(string1, string2, m, n-1)\n \n \nstring1 = \"heidi\"\nstring2 = input()\n \nif isSubSequence(string1, string2, len(string1), len(string2)):\n print(\"YES\")\nelse:\n print(\"NO\")\n'''", "m='heidi'\r\nn=input()\r\na=0\r\nfor i in range(len(n)):\r\n\tif m[a]==n[i]:\r\n\t\ta+=1\r\n\t\tif a==5:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\nprint(\"NO\")", "# D.4.3 heidi\ns = input()\na = [\"h\",\"e\",\"i\",\"d\",\"i\"]\np = []\nb = 0\nfor i in a:\n for j in s[b:]:\n b += 1\n if i == j:\n p.append(j)\n break\nif p == a:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t\t \t\t\t\t \t \t\t \t\t \t", "x =[i for i in input()]\n\ndef charpos(c1,arr):\n\tfor i in range(len(arr)):\n\t\tif arr[i] ==c1:\n\t\t\treturn i\n\treturn -1\ntemp=0\nresult =True\nfor i in \"heidi\":\t\n\ttemp = charpos(i,x)\n\tx = x[temp:]\n\tif temp==-1:\n\t\tresult=False\n\t\tbreak\n\t\nif result:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "s = input()\r\nw = \"heidi\"\r\npos = [0] * len(w)\r\ni = j = 0\r\n\r\nwhile i < len(w) and j < len(s):\r\n if w[i] == s[j]:\r\n pos[i] = j\r\n i += 1\r\n j += 1\r\n\r\nif i == len(w):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nj=0\r\ns='heidi#'\r\nfor i in a:\r\n if i==s[j]:j+=1\r\nprint('YES'if j==5else'NO')", "x=input()\r\ns=0\r\nans=\"\"\r\nlookup=[\"h\",\"e\",\"i\",\"d\",\"i\"]\r\nfor item in lookup:\r\n x=x[s:]\r\n if x.count(item)!=0:\r\n ans=ans+item\r\n s=x.index(item)\r\nprint({True:\"YES\",False:\"NO\"}[ans==\"heidi\"])", "s = \"heidi\"\r\na = input()\r\ni = 0\r\nfor j in a:\r\n if s[i] == j:\r\n i += 1\r\n if i == 5:\r\n break\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\ntry:\r\n x = x[x.index(\"h\"):]\r\n x = x[x.index(\"e\"):]\r\n x = x[x.index(\"i\"):]\r\n x = x[x.index(\"d\"):]\r\n x = x[x.index(\"i\"):]\r\n print(\"YES\")\r\nexcept ValueError:\r\n print(\"NO\")\r\n", "h=[]\r\ns=input()\r\ns = s + '0'\r\nk=len(s)\r\nx=False\r\nfor i in range (k):\r\n if s[i] == 'h':\r\n h.append('h')\r\n elif (s[i] == 'e'):\r\n for j in range (len(h)):\r\n if len(h[j]) == 1:\r\n h[j] = h[j] + 'e'\r\n elif (s[i] == 'i'):\r\n for j in range (len(h)):\r\n if (len(h[j]) == 2) or (len(h[j]) == 4):\r\n h[j] = h[j] + 'i'\r\n elif (s[i] == 'd'):\r\n for j in range (len(h)):\r\n if len(h[j]) == 3:\r\n h[j] = h[j] + 'd'\r\n if ('heidi' in h) and (x == False):\r\n print('YES')\r\n x = True\r\nif x == False:\r\n print('NO')", "ans = False\ni = 0\nfor c in input():\n if 'heidi'[i] == c:\n i += 1\n if i >= 5:\n ans = True\n break\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\nn=len(s)\r\na=0\r\nif(n<5):\r\n print('NO')\r\nelse:\r\n l=['h','e','i','d','i']\r\n c=0\r\n for i in range(n):\r\n if(s[i]==l[c]):\r\n c+=1\r\n if(c==5):\r\n a=1\r\n break\r\n if(a==0):\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "news = input()\n\nif len(news) > 1000:\n exit()\nelse:\n news = news.lower()\n news_str = ''\n comp_string = 'heidi'\n count = 0\n for i in range(0,len(news)):\n if len(comp_string) != 0 and news[i] == comp_string[0]:\n news_str += comp_string[0]\n comp_string = comp_string[1:]\n \n if news_str == 'heidi':\n print('YES')\n else:\n print('NO')\n\t \t\t\t\t\t\t\t \t \t\t \t \t", "s = input() # i\nn = \"heidi\" # j\nsum1 = 0\nj = 0\ni = 0\n\nwhile i < len(s) and j < len(n):\n if s[i] == n[j]:\n j += 1\n i += 1\n sum1 += 1\n else:\n i += 1\n\nif sum1 == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t \t \t \t\t \t \t \t\t \t\t", "str = input()\r\n\r\nh = False\r\ne = False\r\ni = False\r\nd = False\r\ni_2 = False\r\n\r\nfor a in str:\r\n if a == \"h\" and h == False:\r\n h = True\r\n\r\n if a == \"e\" and h:\r\n e = True\r\n\r\n if a == \"i\" and h and e:\r\n i = True\r\n\r\n if a == \"d\" and h and e and i:\r\n d = True\r\n\r\n if a == \"i\" and h and e and i and d:\r\n i_2 = True\r\n\r\nif h and e and i and d and i_2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na='heidi'\r\nu=s\r\nq=0\r\nfor i in range(5):\r\n u=u[q:]\r\n w=u.find(a[i])\r\n if(w==-1):\r\n print(\"NO\")\r\n break\r\n q=w+1\r\nelse:\r\n print(\"YES\")", "s = str(input())\nh = \"h\"\ne = \"e\"\ni = \"i\"\nd = \"d\"\ni2 = \"i\"\n\nfound_h = False\nfound_e = False\nfound_i = False\nfound_d = False\nfound_i2 = False\nfor x in s:\n if (x == h):\n found_h = True\n if (x == e and found_h):\n found_e = True\n if (x == i and found_e):\n found_i = True\n if (x == d and found_i):\n found_d = True\n if (x == i and found_d):\n found_i2 = True\nif (found_i2):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t \t \t\t \t\t\t \t \t \t", "s = input()\nheidi = ['h','e','i','d', 'i']\norder = []\ni = 0\nx = 0\nwhile x != 5:\n i = s.find(heidi[x], i)\n if i != -1:\n order.append(i)\n x+=1\n i+=1\n if x == 5:\n if order != sorted(order):\n print(\"NO\")\n break\n print(\"YES\")\n else:\n print(\"NO\")\n break\n\t\t \t\t\t\t \t\t\t \t \t\t \t \t", "def issubsequence(s1,s2):\r\n m=len(s1)\r\n n=len(s2)\r\n i=0\r\n j=0\r\n while i<m and j<n:\r\n if s1[i]==s2[j]:\r\n i=i+1\r\n j=j+1\r\n return i==m\r\n\r\ns1=\"heidi\"\r\ns2=input()\r\nif issubsequence(s1,s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = 'heidi'\r\nc = 0\r\nflag = False\r\nt = input()\r\nfor i in t:\r\n if i == string[c]:\r\n c+=1\r\n if c == len(string):\r\n flag = True\r\n break\r\nif flag:\r\n print('YES')\r\nelse:print('NO')", "s=input()\r\nh=s.find('h')\r\ns=s[h:]\r\nif 'e' not in s:\r\n print(\"NO\")\r\nelse:\r\n e=s.find('e')\r\n s=s[e:]\r\n if 'i' not in s:\r\n print(\"NO\")\r\n else:\r\n i=s.find('i')\r\n s=s[i:]\r\n if 'd' not in s:\r\n print(\"NO\")\r\n else:\r\n d=s.find('d')\r\n s=s[d:]\r\n if 'i' not in s:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "# #✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\n# ◕ █ █ █ █ /████\\ ██\\ █ /██\\ ██ ██\\ █ ◕\r\n# ◕ █ █ █ █ █\\ \\█ █\\█\\ █ /█/\\█\\ █\\█\\ █ ◕\r\n# ◕ █\\ /█ █ █ █ █ \\█\\ █ /█/ \\█\\ ██ █ \\█\\ █ ◕\r\n# ◕ █████ █ █ \\████\\ █ \\█\\ █ █/ \\█ ██ █ \\█\\ █ ◕\r\n# ◕ █/ \\█ █ █ \\█ █ \\█\\ █ ████████ ██ █ \\█\\ █ ◕\r\n# ◕ █ █ █\\ /█ █\\ /█ █ \\█\\█ █ █ ██ █ \\█\\█ ◕\r\n# ◕ █ █ \\██████/ \\████/ █ \\██ █ █ ██ █ \\██ ◕\r\n#✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\na = input() \r\nb = 0 \r\nc = 'heidi'\r\nfor i in a:\r\n if i == c[b]:\r\n b += 1\r\n if b == 5:\r\n break\r\nprint(\"YES\" if b>=5 else \"NO\")", "word = input()\nhtrue = False\netrue = False\nitrue = False\ndtrue = False\nlast = False\nfor letter in word:\n if letter == 'h':\n htrue = True\n if (letter == 'e') & htrue:\n etrue = True\n if (letter == 'i') & etrue:\n itrue = True\n if (letter == 'd') & itrue:\n dtrue = True\n if (letter == 'i') & dtrue:\n last = True\nif last == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t \t\t \t\t \t\t\t \t\t \t \t", "## G - Fake News (easy)\n\ninput_str = input()\n\np_string = \"heidi\"\n\np_str_ptr = 0\np_str_len = len(p_string)\n\nis_subsequence = False\n\nfor ch in input_str:\n if ch == p_string[0]:\n p_string = p_string[1:]\n if p_string == \"\":\n is_subsequence = True\n break \n\nif p_string == \"\":\n is_subsequence = True\n\nif is_subsequence:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t \t\t \t \t \t\t\t \t", "s = input()\r\na, b, c, d = 0, 0, 0, 0\r\nfor i in s:\r\n if i == 'h':\r\n a = 1\r\n elif i == 'e' and a == 1:\r\n b = 1\r\n elif i == 'i' and b == 1:\r\n if d == 1:\r\n c = 2\r\n else:\r\n c = 1\r\n elif i == 'd' and c > 0:\r\n d = 1\r\n\r\n if a > 0 and b > 0 and c > 1 and d > 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\n\ni = 0\n\nheidi = ''\n\nfor a in range(len(s)):\n if s[a] == 'h':\n heidi += 'h'\n i = a\n break\n\nfor b in range(i + 1, len(s)):\n if s[b] == 'e':\n heidi += 'e'\n i = b\n break\n\nfor c in range(i + 1, len(s)):\n if s[c] == 'i':\n heidi += 'i'\n i = c\n break\n\nfor d in range(i + 1, len(s)):\n if s[d] == 'd':\n heidi += 'd'\n i = d\n break\n\nfor e in range(i + 1, len(s)):\n if s[e] == 'i':\n heidi += 'i'\n i = e\n break\n\nif heidi == 'heidi':\n print('YES')\nelse:\n print('NO')", "s = input()\ntry:\n i1 = s.index('h')\n i2 = s.index('e', i1)\n i3 = s.index('i', i2)\n i4 = s.index('d', i3)\n s.index('i', i4)\n print('YES')\nexcept ValueError:\n print('NO')\n", "s=input()\nx=\"heidi\"\nj=0\nfor i in s:\n if i==x[j]:j+=1\n if j==5:\n print(\"YES\")\n exit()\nprint(\"NO\")\n \t \t \t \t \t \t\t \t\t\t\t \t\t \t \t\t", "s = input()\r\ntest = 'heidi'\r\nk = 0\r\nfor i in range(len(s)):\r\n if s[i] == test[k]:\r\n k += 1\r\n if k == 5:\r\n print('YES')\r\n break\r\nif k != 5:\r\n print('NO')", "#!/bin/env python3\nimport sys\ns = input()\nstart = 0\nfor c in \"heidi\":\n x = s.find(c, start)\n if x > -1:\n start = x + 1\n else:\n print(\"NO\")\n sys.exit()\nprint(\"YES\")", "def function(s):\r\n h = s.find('h')\r\n if(h!=-1):\r\n s = s[h:]\r\n else:\r\n print(\"NO\")\r\n return\r\n e = s.find('e')\r\n if(e!=-1):\r\n s = s[e:]\r\n else:\r\n print(\"NO\")\r\n return\r\n i = s.find('i')\r\n if(i!=-1):\r\n s = s[i:]\r\n else:\r\n print(\"NO\")\r\n return\r\n d = s.find('d')\r\n if(d!=-1):\r\n s = s[d:]\r\n else:\r\n print(\"NO\")\r\n return\r\n i = s.find('i')\r\n if(i!=-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return\r\n\r\ns = input()\r\nfunction(s)", "user=str(input())\na=0\nb=\"heidi#\"\nfor i in user:\n if i ==b[a]:\n a+=1\nprint(\"YES\"if a==5 else\"NO\")\n\t\t\t\t \t\t \t \t \t\t\t\t \t\t\t \t\t \t", "s=\"heidi\"\nsi=0\nfor c in input():\n if c==s[si]:\n si+=1\n if si==5:\n break\nprint(\"YES\" if si==5 else \"NO\")\n \t \t\t\t\t \t\t \t\t \t \t \t \t \t \t", "x = input()\nx = list(x)\nheidi = ['h', 'e', 'i', 'd', 'i']\n\nfor letter in x:\n if letter == heidi[0]:\n heidi.pop(0)\n if len(heidi) == 0:\n print('YES')\n exit()\nprint('NO')\n\t \t\t\t \t\t \t\t \t\t \t \t\t", "st = 'heidi'\nstr2= input()\ni =0\nj=0\nn = len(str2)\nm = len(st)\nif(n>5):\n while(j<m and i<n):\n if(st[j] == str2[i]):\n j += 1\n i +=1\n if(j==m):\n print(\"YES\")\n else:print(\"NO\")\nelse:\n print(\"NO\")\n\n\t\t\t\t \t\t \t\t \t\t\t\t\t\t\t \t \t \t", "# cook your dish here\ns=input() \ni=0\ns1=\"heidi\"\ns2=\"\"\nfor j in s:\n if(s1[i]==j):\n s2+=j\n i+=1\n if(i==5):\n break\nif(s2=='heidi'):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t\t \t\t\t\t \t \t \t\t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 7 20:45:41 2020\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\n\r\ns = input()\r\n\r\ni = 0\r\nstring = 'heidi'\r\nwhile i < len(s):\r\n k = s.find(string[0], i)\r\n if k != -1:\r\n string = string[1:]\r\n i = k\r\n if len(string) == 0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\na='heidi'\r\nj=0\r\nflag = 0\r\nfor i in s:\r\n if i==a[j]:\r\n j+=1\r\n if j==5:\r\n flag =1\r\n break\r\nif flag == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\npoint = 0\r\nfor i in s:\r\n if i == 'h' and point == 0: point += 1\r\n elif i == 'e' and point == 1: point += 1\r\n elif i == 'i' and point == 2: point += 1\r\n elif i == 'd' and point == 3: point += 1\r\n elif i == 'i' and point == 4: point += 1\r\nif point == 5: print('YES')\r\nelse: print('NO')\r\n", "input_string = input()\r\n\r\nheidi_list = ['h','e','i','d','i']\r\ncurrent_index = 0\r\n\r\nheidi_string_from_input_string = ''\r\n\r\nfor item in input_string:\r\n if item == heidi_list[current_index]:\r\n heidi_string_from_input_string += heidi_list[current_index]\r\n current_index += 1\r\n if heidi_string_from_input_string == 'heidi':\r\n print(\"YES\")\r\n break\r\n\r\nif heidi_string_from_input_string != 'heidi':\r\n print('NO')\r\n", "# --------------------------------#\r\n#-----------<HajLorenzo>-----------\r\n#Most Important Thing About Life\r\n#Is Loving What You Do...\r\n# --------------------------------#\r\n_=\"heidi\"\r\nn=input()\r\nDFX=0\r\nfor i in range(len(n)):\r\n if(n[i]==\"heidi\"[DFX]):\r\n DFX+=1\r\n if(DFX==5):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "import logging\n\nl = logging.Logger(\"\")\nh = logging.StreamHandler()\nf = logging.Formatter(fmt=\"[{filename}:{lineno}] {msg}\", style=\"{\")\nh.setFormatter(f)\nl.addHandler(h)\nbug = l.info\n\n\n# To disable uncomment the next line\n# bug = lambda x:None\n\n# teste=(1,2,3,4)\n# bug(f'{teste=}')\n# bug(f'{2*teste=}')\n\n# -------------------------------------------------------------------- #\ndef main():\n n = input()\n heidi = \"heidi\"\n aux = 0\n for i in n:\n if aux == 5:\n break\n if i == heidi[aux]:\n aux += 1\n\n if aux == 5:\n print('YES')\n else:\n print('NO')\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", "s = input()\r\n\r\ni = 0\r\nt = 'heidi'\r\nfor v in s:\r\n if v == t[i]:\r\n i += 1\r\n\r\n if i == 5:\r\n break\r\n\r\nprint('YES' if i == 5 else 'NO')", "s=input()\r\nt='heidi'\r\nc=0\r\nfor i in s:\r\n if i==t[c]:\r\n c+=1\r\n if c==5:\r\n break\r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x='heidi'\r\ns=input()\r\nindex=0\r\nfor i in range(len(s)):\r\n\tif s[i]==x[index]:\r\n\t\tindex+=1\r\n\tif index==5:\r\n\t\tbreak\r\nif index==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "s = input()\r\ntarget = \"heidi\"\r\nj = 0\r\ns_len = len(s)\r\nfor i in range(0, s_len):\r\n if s[i] == target[j]:\r\n j += 1\r\n if j == len(target):\r\n break\r\nif (j == len(target)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nword = 'heidi'\r\ni = 0\r\nfor a in s:\r\n if a == word[i]:\r\n i += 1\r\n if i == 5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "s = input()\r\nq = \"heidi\"\r\npos = 0\r\nfor el in s:\r\n if pos >= 5:\r\n break\r\n if el == q[pos]:\r\n pos += 1\r\n \r\n#print(pos)\r\nif pos == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\na, b, c = \"heidi\", \"\", 0\r\nfor i in s:\t\r\n\tif c < 5 and i == a[c]:\r\n\t\tb += i\r\n\t\tc += 1\r\nprint(\"YES\" if a == b else \"NO\")", "def main():\n s = input()\n substring = 'heidi'\n cont = 0\n for letter in s:\n if letter == substring[ cont ]:\n cont += 1\n if cont == 5:\n break\n if cont == 5:\n print( 'YES' )\n else:\n print( 'NO' )\nmain()\n\t\t \t\t\t \t\t \t \t \t \t \t \t\t \t", "x = input()\r\n\r\nxl = len(x)\r\n\r\nh = False\r\ne = False\r\nl = False\r\nl2 = False\r\no = False\r\ntis = \"NO\"\r\n\r\nfor i in range(xl):\r\n if(x[i]) == \"h\" and h == False:\r\n h = True\r\n for f in range(i):\r\n x.replace(x[f], \"\")\r\n\r\n if (x[i]) == \"e\" and e == False and h == True:\r\n e = True\r\n for f in range(i):\r\n x.replace(x[f], \"\")\r\n\r\n if (x[i]) == \"i\" and l == False and e == True:\r\n l = True\r\n for f in range(i):\r\n x.replace(x[f], \"\")\r\n f = False\r\n\r\n if (x[i]) == \"d\" and l2 == False and l == True and f:\r\n l2 = True\r\n for f in range(i):\r\n x.replace(x[f], \"\")\r\n\r\n if (x[i]) == \"i\" and o == False and l2 == True:\r\n o = True\r\n for f in range(i):\r\n x.replace(x[f], \"\")\r\n f = True\r\n\r\nif h and e and l and l2 and o:\r\n tis = \"YES\"\r\nprint(tis)", "s = input()\nh = \"heidi\"\nm = len(h)\nn = len(s)\nj = 0\ni = 0\nwhile j < m and i < n:\n if h[j] == s[i]:\n j = j+1\n i = i + 1\nif j == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t \t\t\t\t \t\t \t\t\t\t", "n=list(input())\r\nc=0\r\nfor i in range(len(n)):\r\n\tif(c==0 and n[i]==\"h\"):\r\n\t\tc+=1\r\n\telif(c==1 and n[i]==\"e\"):\r\n\t\tc+=1\r\n\telif(c==2 and n[i]==\"i\"):\r\n\t\tc+=1\r\n\telif(c==3 and n[i]==\"d\"):\r\n\t\tc+=1\r\n\telif(c==4 and n[i]==\"i\"):\r\n\t\tc+=1\r\n\t\tbreak\r\nif(c==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\n\r\ndef main_function():\r\n word = \"heidi\"\r\n s = input()\r\n i = 0\r\n j = 0\r\n while j < len(s):\r\n\r\n if s[j] == word[i]:\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n if i == len(word):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(main_function())\r\n", "s = str(input())\r\nh = 'heidi'\r\ncor = True\r\nfor i in h:\r\n if(i in s):\r\n s = s[s.index(i):]\r\n else:\r\n cor = False\r\nif(cor):\r\n print('YES')\r\nelse:\r\n print('NO')", "a='heidi'\r\ns=input()\r\nc=0;\r\nfor ic in range(len(s)):\r\n if s[ic]==a[c]:\r\n c+=1;\r\n if c==5:\r\n break;\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nt = 'heidi'\r\ni = j = 0\r\nwhile i < len(s) and j < 5:\r\n\tif s[i] == t[j]:\r\n\t\tj += 1\r\n\ti += 1\r\nprint('YES' * (j == 5) + 'NO' * (j != 5))", "string = str(input())\r\npat, pointer = \"heidi\", 0\r\nfor j in range(len(string)):\r\n if string[j] == pat[pointer]:\r\n pointer += 1\r\n if pointer == len(pat):\r\n break\r\nif pointer == len(pat):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "news = input().strip()\nfake_news = \"heidi\"\ni = 0\nfor j in news:\n if j == fake_news[i]:\n i += 1\n if i == len(fake_news):\n print(\"YES\")\n break\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", "news = input()\r\ntry:\r\n index_h = news.index('h')\r\n news = news[index_h:]\r\n index_e = news.index('e')\r\n news = news[index_e:]\r\n index_i = news.index('i')\r\n news = news[index_i:]\r\n index_d = news.index('d')\r\n news = news[index_d:]\r\n index_i_1 = news.index('i')\r\n print('YES')\r\nexcept:\r\n print('NO')", "x = input()\nhehe = 0\nz = 0\nz1 = 0\nz2 = 0\nz3 = 0\nz4 = 0\nfor y in x:\n if y == \"h\" and z == 0:\n hehe += 1\n z += 1\n if y == \"e\" and z == 1 and z1 == 0:\n hehe += 1\n z1 += 1\n if y == \"i\" and z1 == 1 and z2 == 0:\n hehe += 1\n z2 += 1\n if y == \"d\" and z2 == 1 and z3 == 0:\n hehe += 1\n z3 += 1\n if y == \"i\" and z3 == 1 and z4 == 0:\n hehe += 1\n z4 += 1\n\nif hehe == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t\t\t\t\t \t \t \t\t \t\t \t\t", "n=str(input())\r\nst=\"heidi\"\r\ncnt=0\r\nfor i in n:\r\n if i==st[cnt]:\r\n cnt+=1\r\n if(cnt==5):\r\n break;\r\nprint('YES' if cnt==5 else 'NO')", "if __name__ == '__main__':\r\n s = str(input())\r\n t = \"heidi\"\r\n i, j, m, n = 0, 0, len(s), len(t)\r\n while i < m and j < n:\r\n if s[i] == t[j]:\r\n i += 1; j += 1\r\n else:\r\n i += 1\r\n if j == n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\r\nheidi = 'heidi#'\r\ncnt = 0\r\nn = len(s)\r\n\r\nfor i in range(n):\r\n if heidi[cnt] == s[i]:\r\n cnt += 1\r\nif cnt ==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "temp = 'heidi'\r\nj,length=0,0\r\ninp = input()\r\nwhile length<len(inp) and j<5:\r\n if inp[length] == temp[j]:\r\n j+=1\r\n length+=1\r\nif j>=5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\ni = 0\nj = 0\nt = ['h', 'e', 'i', 'd', 'i']\n\nwhile j < len(s):\n if s[j] == t[i]:\n i += 1\n j += 1\n\n if i == 5:\n break\n\nif i == 5:\n print('YES')\nelse:\n print('NO')\n\n\n", "s = input()\r\nanswer = 'YES'\r\nfor char in 'heidi':\r\n if char in s:\r\n s = s[s.index(char) + 1:]\r\n else:\r\n answer = 'NO'\r\n break\r\nprint(answer)\r\n\r\n\r\n", "def main():\r\n s = input()\r\n i = 0\r\n heidi = 'heidi'\r\n for char in s:\r\n if char == heidi[i]:\r\n i += 1\r\n if i == 5:\r\n break\r\n if i == 5:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n\r\nmain()\r\n", "s = str(input())\ntarget = \"heidi\"\ni, j = 0, 0\nwhile(True):\n if s[i] == target[j]:\n i += 1\n j += 1\n else:\n i += 1\n if j == len(target):\n break\n elif i == len(s):\n break\n else:\n pass\n\nprint(\"YES\") if j == len(target) else print(\"NO\")\n \t \t\t \t\t \t \t\t\t \t\t\t \t\t \t \t\t", "h = 'heidi'\r\na = input()\r\nnum = 0\r\nfor i in range(len(a)):\r\n if a[i] == h[num] :\r\n num += 1\r\n if num == 5:\r\n break;\r\n\r\nif num == 5:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\ns = list(input())\r\ncheck = list('heidi')\r\nindex = 0\r\nfor i, c in enumerate(s):\r\n if c == check[index]:\r\n index += 1\r\n if index == len(check):\r\n print('YES')\r\n exit()\r\nprint('NO')", "import sys\ninput = sys.stdin.readline\n\ns = input()\nretazec = \"heidi\"\npredosle = 0\nfor pismeno in retazec:\n ok = False\n for i in range(predosle, len(s)):\n if s[i] == pismeno:\n ok = True\n break\n predosle += 1\n if not ok:\n print(\"NO\")\n exit()\nprint(\"YES\")", "import sys\n\n\nstring = input()\nfound = \"\"\n\nfor char in string:\n if char == \"h\" and found == \"\":\n found += \"h\"\n elif char == \"e\" and found == \"h\":\n found += \"e\"\n elif char == \"i\":\n if found == \"he\":\n found += \"i\"\n elif found == \"heid\":\n found += \"i\"\n print(\"YES\")\n sys.exit()\n elif char == \"d\" and found == \"hei\":\n found += \"d\"\n\nprint(\"NO\")", "s = input()\r\na = 'heidi'\r\n\r\ndef check(x,y):\r\n m = len(x)\r\n n = len(y)\r\n i, j = 0, 0\r\n\r\n while i < m and j < n:\r\n if x[i] == y[j]:\r\n i += 1\r\n\r\n j += 1\r\n\r\n return i == m\r\n\r\nif check(a,s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "\r\nl = list(input())\r\n\r\ntarget = list('heidi')\r\n\r\nj = 0\r\nfor i in range(len(l)):\r\n\tif l[i] == target[j]:\r\n\t\tj += 1\r\n\t\r\n\tif j == 5:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\r\n\r\nprint('NO')", "s = input()\r\nheidi = 'heidi'\r\ni = 0\r\nfor c in s:\r\n if c == heidi[i]:\r\n i += 1\r\n if i == len(heidi):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "str = input().casefold()\na= 'heidi'\nposition= 0\nfor input_char in range(len(str)):\n if str[input_char]==a[position]:\n position = position+1\n if position==5:\n break\nif position==5:\n print(\"YES\")\nelse:print(\"NO\")\n\t\t \t \t \t\t \t\t\t\t\t \t\t \t\t \t \t\t \t \t", "s=input()\r\nx=\"heidi\"\r\nj=0\r\nfor i in s:\r\n if i==x[j]:j+=1\r\n if j==5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "from typing import List\r\n\r\ndef solve(string: str):\r\n needle = \"heidi\"\r\n\r\n if needle == string:\r\n print(\"NO\")\r\n return \r\n\r\n curr_index = 0\r\n for char in string:\r\n if char == needle[curr_index]:\r\n curr_index += 1\r\n if curr_index >= len(needle):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\ndef take_input():\r\n string = input()\r\n solve(string)\r\n\r\ntake_input()", "news=input() #input-abcheaibcdi\r\ndef check_subsequence(fakenews):\r\n subsequence = 'heidi'\r\n k = 0\r\n i=0\r\n while i<len(fakenews) and k<len(subsequence):\r\n if fakenews[i]==subsequence[k]:\r\n k += 1\r\n if k==len(subsequence):\r\n return 'YES'\r\n i+=1\r\n return 'NO'\r\n\r\nprint(check_subsequence(news))", "a=input()\r\nb='heidi';j=0\r\nfor i in a:\r\n if i==b[j]:\r\n j+=1\r\n if j==5:\r\n break\r\nprint('YES' if j==5 else 'NO')", "N=input()\nS=\"\"\nN=N.lower()\nA=0\n\nfor i in range(len(N)):\n if(N[i]==\"h\"):\n S=S+N[i]\n A=i\n break\nfor i in range(A+1,len(N)):\n if(N[i]==\"e\"):\n S=S+N[i]\n A=i\n break\nfor i in range(A+1,len(N)):\n if(N[i]==\"i\"):\n S=S+N[i]\n A=i\n break\nfor i in range(A+1,len(N)):\n if(N[i]==\"d\"):\n S=S+N[i]\n A=i\n break\nfor i in range(A+1,len(N)):\n if(N[i]==\"i\"):\n S=S+N[i]\n break\nif(S==\"heidi\"):\n print(\"YES\")\nif not (S==\"heidi\"):\n print(\"NO\")\n\n \t \t\t\t\t\t\t\t \t \t \t \t \t \t", "n = input()\r\nh = n.find('h')\r\ne = n.find('e',h+1)\r\ni = n.find('i',e+1)\r\nd = n.find('d',i+1)\r\ni2 = n.find('i',d+1)\r\nif h < e < i < d < i2:\r\n print('YES')\r\nelse :\r\n print('NO')\r\n \r\n \r\n \r\n", "cadena = input()\ncadArr = [char for char in cadena]\n\nsearch = 'heidi'\nfound = False\n\nfor i in cadArr:\n if len(search)==0:\n yes = print('YES')\n found = True\n break\n \n cAct = search[0]\n \n if i == cAct:\n s1 = search[1:]\n search = s1\n \nif len(search) != 0 and found==False:\n print('NO')\nelif found == False and len(search) == 0:\n print('YES')\n\t\t \t\t\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t", "s = input()\nheidi = 'heidi#'\ncnt = 0\nn = len(s)\n\nfor i in range(n):\n if heidi[cnt] == s[i]:\n cnt += 1\nif cnt ==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n S = wtf[0]\r\n f = ''\r\n FNT = 'heidi'\r\n z = FNT\r\n for s in S:\r\n if len(f) == 5:\r\n if f == FNT:\r\n break\r\n f = ''\r\n z = FNT\r\n if s == z[0]:\r\n f += s\r\n z = z[1:]\r\n print('YES' if f == 'heidi' else 'NO')\r\n", "s = input()\r\ndef findS(s, sub):\r\n ##print(s,sub)\r\n if len(sub) == 0:\r\n return 0\r\n if len(s) == 0:\r\n return -1\r\n num = s.find(sub[0])\r\n if num == -1:\r\n return -1\r\n return findS(s[num+1:],sub[1:])\r\nif findS(s,\"heidi\") != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\r\ns = 'heidiN'\r\nvar = 0\r\nfor c in string:\r\n if s[var] == c:\r\n var += 1\r\nif var == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "string = input(\"\")\nheidicounter = 0\ncounter = 0\n\nfor a in range(len(string)):\n counter += 1\n if string[a] == \"h\":\n heidicounter += 1\n break\n\nfor b in range(counter, len(string)):\n counter += 1\n if string[b] == \"e\":\n heidicounter += 1\n break\n\nfor c in range(counter, len(string)):\n counter += 1\n if string[c] == \"i\":\n heidicounter += 1\n break\n\nfor d in range(counter, len(string)):\n counter += 1\n if string[d] == \"d\":\n heidicounter += 1\n break\n\nfor e in range(counter, len(string)):\n counter += 1\n if string[e] == \"i\":\n heidicounter += 1\n break\n\nif heidicounter == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = input()\nb = 'heidi'\nj = 0\nfor i in a:\n if i == b[j]:\n j += 1\n if j == 5:\n break\nprint('YES' if j == 5 else 'NO')\n\n\t\t \t \t\t\t \t\t\t\t\t \t \t \t\t\t\t\t", "a = input()\nb = \"heidi\"\nc = 0\nd = \"\"\nfor i in a:\n if i == b[c]:\n d+=b[c]\n c += 1\n if c == len(b):\n break\nif d != b:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t\t \t\t\t\t \t \t\t\t\t \t\t\t\t\t \t \t\t\t\t", "lmp = lambda:list(map(int, input().split()))\r\nmp = lambda:map(int, input().split())\r\nintp = lambda:int(input())\r\ninp = lambda:input()\r\nfinp = lambda:float(input())\r\n\r\ns = inp()\r\nq = 'heidi'\r\nind = 0\r\n\r\nfor i in s:\r\n if i == q[ind]:\r\n ind += 1\r\n if ind == 5:\r\n break\r\n\r\nif ind == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nk = 0\r\nfor i in range(len(s)):\r\n if k == 0 and s[i] == 'h':\r\n k += 1\r\n elif k == 1 and s[i] == 'e':\r\n k += 1\r\n elif k == 2 and s[i] == 'i':\r\n k += 1\r\n elif k == 3 and s[i] == 'd':\r\n k += 1\r\n elif k == 4 and s[i] == 'i':\r\n k += 1\r\nif k == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "string = input()\r\nh = False\r\ne = False\r\ni_1 = False\r\nd = False\r\ni_2 = False\r\nfor symbol in string:\r\n if h:\r\n if e:\r\n if i_1:\r\n if d:\r\n if i_2 is False:\r\n if symbol == \"i\":\r\n i_2 = True\r\n else:\r\n if symbol == \"d\":\r\n d = True\r\n else:\r\n if symbol == \"i\":\r\n i_1 = True\r\n else:\r\n if symbol == \"e\":\r\n e = True\r\n else:\r\n if symbol == \"h\":\r\n h = True\r\nif i_2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\nsample = 'heidi'\r\ncheck = []\r\ne = 0\r\nfor i in range(len(s)):\r\n while e < len(sample):\r\n if s[i] == sample[e]:\r\n check.append(s[i])\r\n e += 1\r\n break\r\n else:\r\n break\r\nfinal = ''.join(check)\r\nif final == sample:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n", "a=input()\ntry:\n for i in'heidi':\n exec('while a[0]!=\\''+i+'\\':\\n\\ta=a[1:]\\na=a[1:]')\n print('YES')\nexcept:\n print('NO')", "substring = 'heidi'\r\ninput_string = input()\r\n\r\ndef subsequence(s, t):\r\n for i in range(len(s)):\r\n try:\r\n idx = t.index(s[i])\r\n except:\r\n return \"NO\"\r\n t = t[idx+1:]\r\n return \"YES\"\r\n\r\nres = subsequence(substring, input_string)\r\nprint(res)", "st=input()\r\nls=[]\r\ns='heidi'\r\np=0\r\nfor i in s:\r\n q=st.find(i)\r\n if q==-1:\r\n break\r\n else:\r\n p+=q\r\n ls.append(p) \r\n st=st[q:]\r\nps=ls\r\nps.sort()\r\nprint(\"YES\") if ps==ls and len(ls)==len(s) else print(\"NO\")", "s=input()\n\ni=0\ntarget='heidi'\nfor c in s:\n\tif c==target[i]:\n\t\ti+=1\n\n\tif i >= 5:\n\t\tbreak\n\nif i >= 5:\n\tprint('YES')\nelse:\n\tprint('NO')\n\n\n\t \t\t\t \t \t \t \t\t\t\t \t \t", "#Get the input\nword = input()\n#Save the variables\nh = 'heidi'\nx = len(h)\ny = len(word)\n#Use counters\nextra = 0\ncounter = 0\n#Use the logic and counters to iterate through the strings\nwhile extra < x and counter < y:\n if h[extra] == word[counter]:\n extra = extra + 1\n counter = counter + 1\n#Compare and print answer\nif extra == x:\n print('YES')\nelse:\n print('NO')\n\t \t\t\t \t \t\t\t \t \t\t\t \t \t", "a = 'heidi'\r\nc = 0\r\nfor i in input():\r\n if i == a[c]:\r\n c += 1\r\n if c == 5:\r\n print('YES')\r\n quit()\r\nprint('NO')\r\n", "need_string = \"heidi\"\r\nindex = 0\r\n\r\nfor i in input():\r\n if index != 5 and i == need_string[index]:\r\n index += 1\r\n\r\nprint(\"YES\" if index == 5 else \"NO\")", "# get input\ninput_str = input()\n\ni , j = 0, 0\nto_find = 'heidi'\n\nwhile i < len(input_str) and j < len(to_find):\n if input_str[i] == to_find[j]:\n i += 1\n j += 1\n else:\n i += 1\n\nif j == len(to_find):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \t\t \t\t\t \t \t \t\t\t \t\t \t \t", "word = input()\ntarget = \"heidi\"\noutput = \"\"\nstringlength = 0\nfor i in word:\n if i == target[stringlength]:\n output += i\n stringlength += 1\n if stringlength == 5:\n break\nif target == output:\n print(\"YES\")\nelse:\n print(\"NO\")\n# discuss with tian tian and zhangjie pan\n\n\t\t \t \t\t \t \t \t \t\t\t\t \t \t \t", "a = iter(input())\r\nprint(('NO', 'YES')[all(i in a for i in 'heidi' )])", "S = input()\nh = 'heidi'\ntrack = 0\ni = 0\nres = 'NO'\nwhile i < len(S):\n\tif track == 5:\n\t\tres = 'YES'\n\t\tbreak\n\telif S[i] == h[track]:\n\t\ttrack += 1\n\ti += 1\nif track == 5:\n\tres = 'YES'\nprint(res)\n\t\t \t \t \t \t\t \t \t \t\t \t", "paper=input()\r\nfake=\"heidi\"\r\nlst=[]\r\nfor i in fake:\r\n lst.append(i)\r\n#print(lst)\r\ni=0\r\nj=0\r\nwhile((i<len(paper))and(j<len(lst))):\r\n if(paper[i]==lst[j]):\r\n #print(i,lst[j])\r\n lst.pop(j)\r\n #print(paper[i])\r\n i+=1\r\nif(len(lst)!=0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s=input()\r\nf=[\"h\",\"e\",\"i\",\"d\",\"i\"]\r\nj=0\r\nfor i in s:\r\n if j==5:\r\n break\r\n if i ==f[j] :\r\n j+=1\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\ncheck='heidi#'\nj=0\nfor i in s:\n if(i==check[j] ):\n j+=1\n\nif(j==5):\n print('YES')\nelse:\n print('NO')\n\t \t\t \t \t\t \t \t \t \t\t \t", "x = input()\ntarget = \"heidi\"\nindex = 0\nfor i in range(len(x)):\n if x[i] == target[index]:\n index += 1\n if index == 5:\n break\nif index >= 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t\t\t\t\t \t \t \t \t \t", "a=input();\r\nstr=\"heidi\"\r\nind=0\r\nfor i in a:\r\n if str[ind]==i:\r\n ind+=1\r\n if ind==5:\r\n break\r\nif ind==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef is_subsequence(s, t):\r\n n = len(s)\r\n m = len(t)\r\n j = 0\r\n for i in range(n):\r\n if s[i] == t[j]:\r\n j += 1\r\n if j == m:\r\n return True\r\n return False\r\n\r\ndef main():\r\n if is_subsequence(input(), 'heidi'):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = input()\ntest = ['h','e','i','d','i']\n#print(test,n)\n\niota = []\nfor i in range(0,len(n)):\n if n[i] in test:\n iota.append(n[i])\n#print(iota)\n\nfor i in range(0,len(iota)):\n if iota[i] == test[0]:\n test.pop(0)\n #print(test)\n if len(test) == 0:\n break\nif len(test) > 0:\n print('NO')\nelse:\n print('YES')\n\n \t\t \t\t\t \t\t\t\t \t\t \t\t \t \t\t \t\t \t\t\t", "s = input()\r\nver = ''\r\n\r\nfor i in s:\r\n if ver == '' and i == 'h':\r\n ver += 'h'\r\n elif ver == 'h' and i == 'e':\r\n ver += 'e'\r\n elif ver == 'he' and i == 'i':\r\n ver += 'i'\r\n elif ver == 'hei' and i == 'd':\r\n ver += 'd'\r\n elif ver == 'heid' and i == 'i':\r\n ver += 'i'\r\n break\r\n\r\nif ver == 'heidi':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input_list=list(input())\r\nflag=0\r\nfor a in input_list:\r\n if(a=='h' and flag==0):\r\n flag=1\r\n elif(a=='e' and flag==1):\r\n flag=2\r\n elif(a=='i' and flag==2):\r\n flag=3\r\n elif(a=='d' and flag==3):\r\n flag=4\r\n elif(a=='i' and flag==4):\r\n flag=5\r\nif(flag==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "newsString = input().lower()\r\nword = 'heidi'\r\ncount = 0\r\nnew=[]\r\nfor i in newsString:\r\n if count==5:\r\n break\r\n else:\r\n if i==word[count]:\r\n count+=1\r\n new.append(i)\r\nif \"\".join(new)==word:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input().lower().strip() \r\ndef fake_news(s):\r\n string=[\"h\",\"e\",\"i\",\"d\",\"i\"]\r\n lst=[]\r\n w=0\r\n \r\n for i in s:\r\n if i==string[w]:\r\n w+=1\r\n \r\n if w==5:\r\n return \"YES\"\r\n \r\n \r\n return \"NO\"\r\n \r\nprint(fake_news(s))", "heidi = \"heidi\"\r\n\r\nn = input()\r\ni_h = 0\r\nisOk = 0\r\nfor i in n:\r\n if i == heidi[i_h]:\r\n isOk += 1\r\n if isOk == 5:\r\n break\r\n i_h += 1\r\n\r\nif isOk == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "heidi = input()\r\nc = 0\r\ntemp = ''\r\nfor p in heidi:\r\n if p == 'heidi'[c]:\r\n temp += p\r\n c+=1\r\n if temp == 'heidi':\r\n print('YES')\r\n break\r\n\r\nif temp != 'heidi':\r\n print('NO')", "dic = {i:s for i, s in enumerate(\"heidi\")}\ni=0\nfor s in input():\n if(s==dic.get(i)):\n i+=1\nif(i==len(dic)):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t \t\t \t\t \t\t \t \t\t\t", "word=str(input())\r\nwza=0\r\nif \"h\" in word and \"i\" in word:\r\n a=word.index(\"h\")\r\n b=word[::-1]\r\n c=b.index(\"i\")\r\n d=len(word)-c\r\n word=word[a:d]\r\nelse:\r\n wza=1\r\nif wza==0: \r\n if \"e\" in word:\r\n m=word.index(\"e\")\r\n word=word[m::]\r\n if \"i\" in word:\r\n k=word.index(\"i\")\r\n word=word[k::]\r\n \r\n if \"d\" in word:\r\n wza=0\r\n else:\r\n wza=1\r\n else:\r\n wza=1\r\n else:\r\n wza=1\r\nif wza==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = input()\ncha = \"heidi\"\ncount = 0\nfor i in n:\n if i == cha[count]:\n count += 1\n if count == 5:\n print(\"YES\")\n quit()\nprint(\"NO\")\n \t \t\t\t \t\t\t\t\t \t\t \t \t \t", "a=str(input())\r\nl=[\"h\",\"e\",\"i\",\"d\",\"i\"]\r\ns=\"\"\r\nt=\"NO\"\r\nfor i in range(5):\r\n if l[i] in a:\r\n s+=l[i]\r\n a=a[1+a.index(l[i]):]\r\n if s==\"heidi\":\r\n t=\"YES\"\r\nprint(t)\r\n", "y = str(input())\r\nn = len(y)\r\nans = 'NO'\r\nx = 'heidi'\r\ni =0\r\nc=0\r\nwhile i < n:\r\n if c< 5:\r\n if y[i]==x[c]:\r\n c=c+1\r\n i=i+1\r\n else:\r\n break\r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n\r\n\r\n\r\n\r\n \r\n\r\n", "A=input()\n\ntarget='heidi'\n\ntargetCharPyindex=0\nfinishTarget=''\n\nfor char in A:\n if char==target[targetCharPyindex]:\n finishTarget+=target[targetCharPyindex]\n targetCharPyindex+=1\n if targetCharPyindex==len(target):\n break\n\nif finishTarget==target:\n print('YES')\nelse:\n print('NO')\n \n# discuss with Jiannan Luo and tiantian\n\t\t \t\t \t \t \t\t \t \t \t \t \t\t", "s=input()\nx='heidi'\ni=0\na='NO'\nfor c in s:\n if c==x[i]: i+=1\n if i==len(x):\n a='YES'\n break\nprint(a)\n\t\t \t \t \t \t \t \t\t \t\t\t\t\t \t", "s = input()\ni = -1\n \nfor ch in 'heidi':\n i = s.find(ch, i+1)\n if i < 0:\n print('NO')\n break\nelse:\n print('YES')\n \t \t\t\t\t\t\t\t \t \t\t \t\t\t \t\t", "s = input()\nh = -1\ne = -1\ni1 = -1\nd = -1\ni2 = -1\nfor i, j in enumerate(s):\n if j == 'h' and h == -1:\n h = i\n if j == 'e' and e == -1 and h != -1:\n e = i\n if j == 'i' and e != -1 and i1 == -1:\n i1 = i\n if j == 'd' and d == -1 and i1 != -1:\n d = i\n if j == 'i' and d != -1 and i2 == -1:\n i2 = i\nprint(\"YES\" if h != -1 and e != -1 and d != -1 and i1 != -1 and i2 != -1 else \"NO\")", "x = input()\r\ns = \"heidi\"\r\nres = \"\" \r\nidx = 0\r\nfor i in x : \r\n if i == s[idx] :\r\n idx += 1\r\n res += i\r\n if idx == 5 :\r\n break\r\nif res == s : \r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")" ]

[ "n = int(input())\narr = list(map(int, input().split()))\nmina = min(arr)\nmaxa = max(arr)\nif maxa - mina < 2:\n print(n)\n print(*arr)\n exit()\na, b, c = 0, 0, 0\nfor i in arr:\n if i == mina:\n a += 1\n elif i == maxa:\n c += 1\n else:\n b += 1\nm = max(2 * min(a, c), b // 2 * 2)\nif 2 * min(a, c) > b:\n b += 2 * min(a, c)\n a, c = a - min(a, c), c - min(a, c)\nelse:\n a += b // 2\n c += b // 2\n b = b % 2\nans = ((str(mina) + \" \") * a) + ((str(mina + 1) + \" \") * b) + ((str(mina + 2) + \" \") * c)\nprint(n - m)\nprint(ans[:-1])", "# vars: c1, c2, c3, ins, max_val, mid_val, min_val, n, res, res2, t1, t2, t3, x\r\nfrom collections import Counter\r\nn = int(input())\r\nins = input()\r\nx = Counter(map(int, ins.split()))\r\nmax_val = max(x.keys())\r\nmin_val = min(x.keys())\r\nif max_val - min_val < 2:\r\n\tprint(n)\r\n\tprint(ins)\r\nelse:\r\n\tmid_val = (min_val+max_val)//2\r\n\tc1, c2, c3 = x[min_val], x[mid_val], x[max_val]\r\n\tt1, t2 = c2 // 2, c2 % 2\r\n\tt3 = min(c1, c3)\r\n\tres = min((c1+t2+c3, (c1+t1, t2, c3+t1)), (c1+c2+c3-t3*2, (c1-t3, c2+t3*2, c3-t3)))\r\n\tprint(res[0])\r\n\tres2 = []\r\n\tfor k, v in zip((min_val, mid_val, max_val), res[1]):\r\n\t\tres2.extend([k]*v)\r\n\tprint(*res2)\r\n#\tres = min((c1+t1, t2, c3+t1), (c1-t3, c2+t3*2, c3-t3))\r\n#\tres1 = 0\r\n#\tfor vs in zip((c1, c2, c3), res):\r\n#\t\tres1 += min(vs)\r\n#\tprint(res1)\r\n#\tres2 = []\r\n#\tfor k, v in zip((min_val, mid_val, max_val), res):\r\n#\t\tres2.extend([k]*v)\r\n#\tprint(*res2)\r\n", "n = int(input())\r\nx = sorted(list(map(int, input().split())))\r\nc = [0, 0, 0]\r\n\r\nfor i in x:\r\n\tc[i - x[0]] += 1\r\nif max(x) - x[0] < 2:\r\n print(n)\r\n print(*x)\r\n exit()\r\n\r\nif 2 * min(c[0], c[2]) >= c[1]:\r\n t = min(c[0], c[2])\r\n print(n - 2 * t)\r\n print(*[x[0]]*(c[0] - t), end=' ')\r\n print(*[x[0]+1]*(c[1] + 2 * t), end=' ')\r\n print(*[x[0]+2]*(c[2] - t), end=' ')\r\nelse:\r\n t = c[1] // 2\r\n print(n - t * 2)\r\n print(*[x[0]]*(c[0] + t), end=' ')\r\n print(*[x[0]+1]*(c[1] - t * 2), end=' ')\r\n print(*[x[0]+2]*(c[2] + t), end=' ')\r\n", "n = int(input())\r\nx = list(map(int, input().strip().split()))\r\n\r\nxmin = min(x)\r\nxmax = max(x)\r\n\r\nif xmax - xmin < 2:\r\n print(n)\r\n print(' '.join(map(str, x)))\r\n exit(0)\r\n\r\nx.sort()\r\n\r\na, b, c = 0, 0, 0\r\nfor e in x:\r\n if e == xmin:\r\n a += 1\r\n elif e == xmax:\r\n c += 1\r\n else:\r\n b += 1\r\n\r\ntmin = n\r\nres = [a, b, c]\r\nfor a2 in range(n+1):\r\n c2 = c + a2 - a\r\n b2 = n - (2*a2 + c - a)\r\n if c2 < 0 or c2 > n or b2 < 0 or b2 > n:\r\n continue\r\n t = min(a, a2) + min(b, b2) + min(c, c2)\r\n if t < tmin:\r\n tmin = t\r\n res = [a2, b2, c2]\r\ns = list()\r\ns.extend([xmin] * res[0])\r\ns.extend([xmin + 1] * res[1])\r\ns.extend([xmin + 2] * res[2])\r\nprint(tmin)\r\nprint(' '.join(map(str, s)))", "n = int(input())\r\nx = list(map(int, input().split()))\r\n[Min, Max, Mid] = [min(x), max(x), max(x)-1]\r\nif (Max-Min < 2):print(n);print(*x);exit()\r\n[nMin, nMax, nMid] = list(map(x.count, [Min, Max, Mid]))\r\n[nfMinMax, nfMid] = [min(nMin, nMax), nMid//2]\r\nnf = max(nfMinMax, nfMid); b = ((nf==nfMid) or -1)\r\nnMin += nf * b; nMax += nf * b; nMid += -2 * nf * b\r\nprint(n - 2*nf);print(*([Min]*nMin + [Max]*nMax + [Mid]*nMid))\r\n", "n = int(input())\nx = list(map(int, input().split()))\nmx, mn = max(x), min(x)\nif mx - mn <= 1:\n print(n)\n for i in range(n):\n print(x[i], end = ' ')\nelse:\n a1 = x.count(mn)\n a2 = x.count(mx - 1)\n a3 = x.count(mx)\n\n z1, z2, z3 = -1, -1, -1\n res = 10 ** 19\n for b1 in range(0, 100010):\n b3 = a3 - (a1 - b1)\n b2 = n - b1 - b3\n if min(b1, b2, b3) < 0: continue\n if res > min(a1, b1) + min(a2, b2) + min(a3, b3):\n res = min(a1, b1) + min(a2, b2) + min(a3, b3)\n z1, z2, z3 = b1, b2, b3\n \n print(res)\n for i in range(z1): print(mn, end = ' ')\n for i in range(z2): print(mn + 1, end = ' ')\n for i in range(z3): print(mn + 2, end = ' ')\n \n\n", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\na1=max(a)\r\na2=min(a)\r\nif((a1-a2)<2):\r\n print(n)\r\n print(*a)\r\nelse:\r\n counta1=0\r\n counta2=0\r\n for i in range(n):\r\n if(a[i]==a1):\r\n counta1+=1\r\n elif(a[i]==a2):\r\n counta2+=1\r\n s1=str(a1)+ ' '\r\n s2=str(a2) + ' '\r\n s3=str(a2+1) + ' ' \r\n if(min(counta1,counta2)>(n-counta1-counta2)//2):\r\n print(n-2*min(counta1,counta2))\r\n print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))\r\n else:\r\n x=n-counta1 - counta2\r\n print(n-(x//2)*2) \r\n print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))\r\n \r\n\r\n\r\n", "n = int(input())\nX = list(map(int, input().split()))\np = min(X)\nQ = [0, 0, 0]\nfor i in X:\n Q[i - p] += 1\nz = min(Q[0], Q[2])\nrch = Q[1]\nv1 = n - 2 * min(Q[0], Q[2])\nv2 = Q[0] + Q[2] + Q[1] % 2\nif v1 <= v2 or Q[2] == 0 or Q[0] == 0:\n Q[0] -= z\n Q[2] -= z\n Q[1] += 2 * z\n ans = []\n print(v1)\n for _ in range(Q[0]):\n ans.append(p)\n for _ in range(Q[1]):\n ans.append(p + 1)\n for _ in range(Q[2]):\n ans.append(p + 2)\n print(' '.join(list(map(str, ans))))\nelse:\n Q[0] += rch // 2\n Q[2] += rch // 2\n Q[1] %= 2\n ans = []\n print(v2)\n for _ in range(Q[0]):\n ans.append(p)\n for _ in range(Q[1]):\n ans.append(p + 1)\n for _ in range(Q[2]):\n ans.append(p + 2)\n print(' '.join(list(map(str, ans))))", "#!/usr/bin/env python3\n\nimport sys\n\nn = int(sys.stdin.readline().strip())\nxis = list(map(int, sys.stdin.readline().strip().split()))\n\n\nxmin = min(xis)\nxmax = max(xis)\nif xmax - xmin != 2:\n\tprint (n)\n\tprint (' '.join(map(str, xis)))\n\tsys.exit(0)\n\nxm = (xmin + xmax) // 2\n\na = xis.count(xmin)\nb = xis.count(xm)\nc = xis.count(xmax)\n\nedg = min(a, c)\nmid = b // 2\nif edg > mid:\n\tk = -edg\nelse:\n\tk = mid\ntarget = a + b + c - 2 * abs(k)\nA = a + k\nB = b - 2 * k\nC = c + k\nyis = ([xmin] * A) + ([xm] * B) + ([xmax] * C)\n\nprint (target)\nprint (' '.join(map(str, yis)))\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\ns = sum(l) // len(l)\r\nmn, mx = min(l), max(l)\r\nif mx - mn <= 1:\r\n print(n)\r\n for i in l:\r\n print(i, end=' ')\r\nelse:\r\n a, b, c = l.count(mn), l.count(mn + 1), l.count(mx)\r\n a1, b1, c1 = a - min(a, c), b + 2 * min(a, c), c - min(a, c)\r\n a2, b2, c2 = a + b // 2, b % 2, c + b // 2\r\n diff1 = min(a, a1) + min(b, b1) + min(c, c1)\r\n diff2 = min(a, a2) + min(b, b2) + min(c, c2)\r\n if diff1 <= diff2:\r\n print(diff1)\r\n s = (str(mn) + ' ') * a1 + (str(mn + 1) + ' ') * b1 + (str(mx) + ' ') * c1\r\n s = s[:-1]\r\n print(s)\r\n else:\r\n print(diff2)\r\n s = (str(mn) + ' ') * a2 + (str(mn + 1) + ' ') * b2 + (str(mx) + ' ') * c2\r\n s = s[:-1]\r\n print(s)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nif x[-1] - x[0] == 2:\r\n ans = n\r\n aa, bb = x[0], x[-1]\r\n cc = (aa + bb) // 2\r\n cnt = x.count(cc)\r\n \r\n for i in range(n):\r\n if x[i] != aa or x[n - 1 - i] != bb:\r\n break\r\n ans -= 2\r\n \r\n ans2 = n - (cnt // 2) * 2\r\n if ans < ans2:\r\n print(ans)\r\n for i in range(n):\r\n if x[i] != aa or x[n - 1 - i] != bb:\r\n break\r\n x[i] += 1\r\n x[n - 1 - i] -= 1\r\n print(*x)\r\n else:\r\n print(ans2)\r\n cnt = (cnt // 2) * 2\r\n for i in x:\r\n if i == cc and cnt:\r\n print(cc + (1 if cnt % 2 else -1), end=' ')\r\n cnt -= 1\r\n else:\r\n print(i, end=' ')\r\n print()\r\nelse:\r\n print(n)\r\n print(*x)# 1698310268.8836966", "n=int(input())\nx=input()\na=list(map(int,x.split()))\nif max(a)-min(a)<2:\n print(n)\n print(x)\n exit()\ns=set(a)\nq=min(a)\ns=max(a)\nr=q+1\nm={}\nm[q]=m[s]=m[r]=0\nfor i in a:m[i]+=1\nif n-2*min(m[q],m[s])<n-m[r]//2*2:\n print(n-2*min(m[q],m[s]))\n e=min(m[q],m[s])\n m[r]+=e+e\n m[q]-=e\n m[s]-=e\nelse:\n print(n-m[r]//2*2)\n e=m[r]//2\n m[r]-=e+e\n m[q]+=e\n m[s]+=e\nb=[r for i in range(m[r])]\nb=b+[q for i in range(m[q])]\nb=b+[s for i in range(m[s])]\nprint(*b)\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = [int(e) for e in input().split()]\r\nb = {e: a.count(e) for e in set(a)}\r\nif max(b) - min(b) < 2:\r\n print(n)\r\n print(*a)\r\nelse:\r\n m = min(b)\r\n M = max(b)\r\n d = m + 1\r\n b[d] = b.get(d, 0)\r\n x = b[d] // 2\r\n X = b[m] + b[M] + b[d] % 2\r\n y = min(b[m], b[M])*2\r\n Y = abs(b[m] - b[M]) + b[d]\r\n if X < Y:\r\n print(X)\r\n print(*[m]*(b[m] + x), *[d]*(b[d]%2), *[M]*(b[M]+x))\r\n else:\r\n print(Y)\r\n print(*[m]*max(0, b[m] - b[M]), *[d]*(b[d]+y), *[M]*max(0, b[M] - b[m]))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmn = min(arr)\r\nmx = max(arr)\r\nif mn == mx:\r\n print(n)\r\n print(*arr)\r\nelif mn + 1 == mx:\r\n print(n)\r\n print(*arr)\r\nelse:\r\n a = 0\r\n b = 0\r\n c = 0\r\n for i in range(n):\r\n if arr[i] == mn:\r\n a += 1\r\n elif arr[i] == mx:\r\n c += 1\r\n else:\r\n b += 1\r\n a1 = a + b // 2\r\n c1 = c + b // 2\r\n b1 = b % 2\r\n s1 = min(a1, a) + min(b1, b) + min(c1, c)\r\n b2 = b + min(a, c) * 2\r\n q = min(a, c)\r\n a2 = a - q\r\n c2 = c - q\r\n s2 = min(a2, a) + min(b2, b) + min(c2, c)\r\n if s1 < s2:\r\n print(s1)\r\n ans = [mn] * a1 + [mn + 1] * b1 + [mx] * c1\r\n print(*ans)\r\n else:\r\n print(s2)\r\n ans = [mn] * a2 + [mn + 1] * b2 + [mx] * c2\r\n print(*ans)\r\n\r\n\r\n", "n = int(input())\r\nx = [int(y) for y in input().split()]\r\nmaxx = max(x)\r\nminx = min(x)\r\nSum = sum(x)\r\nif (maxx - minx) <= 1:\r\n print(n)\r\n for i in range(n):\r\n print(x[i],end=' ')\r\nelse:\r\n cntMin = x.count(minx)\r\n cntMax = x.count(maxx)\r\n ans = [n,cntMin,cntMax]\r\n for i in range(0,n+1):\r\n leftSum = Sum - minx*i\r\n minSum = (n-i)*(minx+1)\r\n maxSum = (n-i)*(maxx)\r\n if leftSum < minSum or leftSum > maxSum:\r\n continue\r\n else:\r\n cMax = leftSum-minSum\r\n cMinAddOne = n-i-cMax\r\n numOfCommon = min(cMax,cntMax)+min(cntMin,i)+min(n-cntMax-cntMin,cMinAddOne)\r\n if( numOfCommon < ans[0]):\r\n ans[0] = numOfCommon\r\n ans[1] = i\r\n ans[2] = cMax\r\n print(ans[0])\r\n print((str(minx)+' ')*ans[1]+(str(maxx)+' ')*ans[2]+(str(minx+1)+' ')*(n-ans[1]-ans[2]))", "n=int(input())\nx=input().split()\nx=[int(k) for k in x]\n\nrem=[]\nx.sort()\n\nmn = x[0]\nmx = x[-1]\n\nif (mx-mn<=1):\n\tprint(len(x))\n\tfor k in x:\n\t\tprint(k, end=' ')\n\tprint()\nelse:\n\tavg=mn+1\n\texpsum = avg*len(x)\n\tsm=0\n\tcountmn=0\n\tcountavg=0\n\tcountmx=0\n\tfor k in x:\n\t\tsm+=k\n\tif (sm-expsum)>0:\n\t\trem=x[len(x)-(sm-expsum):len(x)]\n\t\tx=x[0:len(x)-(sm-expsum)]\n\tif (sm-expsum)<0:\n\t\trem=x[0:(expsum-sm)]\n\t\tx=x[(expsum-sm):len(x)]\n\tif len(x)%2==1:\n\t\trem.append(avg)\n\t\tfor i in range(len(x)):\n\t\t\tif (x[i]==avg):\n\t\t\t\tx=x[0:i]+x[i+1:len(x)]\n\t\t\t\tbreak\n\tfor k in x:\n\t\tif k==mn:\n\t\t\tcountmn+=1\n\t\tif k==avg:\n\t\t\tcountavg+=1\n\t\tif k==mx:\n\t\t\tcountmx+=1\n\tif countmn+countmx<countavg:\n\t\tprint(countmn+countmx+len(rem))\n\t\tfor i in range(int(len(x)/2)):\n\t\t\trem.append(mn)\n\t\t\trem.append(mx)\n\telse:\n\t\tprint(countavg+len(rem))\n\t\tfor i in range(len(x)):\n\t\t\trem.append(avg)\n\tfor k in rem:\n\t\tprint(k, end=' ')\n\tprint()", "from collections import Counter\r\n\r\nn = int(input())\r\nizms = Counter(map(int, input().split()))\r\n\r\n\r\nmax_val = max(izms)\r\nmin_val = min(izms)\r\nmax_cnt = izms[max_val]\r\nmin_cnt = izms[min_val]\r\nmed_cnt = n - max_cnt - min_cnt\r\nres = n\r\n\r\n# print(' '.join(' '.join([str(iz)]*izms[iz]) for iz in izms), izms)\r\n\r\nif max(izms) - min(izms) == 2:\r\n med_val = max(izms) - 1\r\n krainie = min(max_cnt, min_cnt)\r\n if krainie>med_cnt//2:\r\n res -= 2*krainie\r\n izms[max_val] -= krainie\r\n izms[min_val] -= krainie\r\n izms[med_val] += krainie*2\r\n else:\r\n srednie = 2 * (med_cnt //2)\r\n res -= srednie\r\n izms[med_val] -= srednie\r\n izms[max_val] += (med_cnt //2)\r\n izms[min_val] += (med_cnt //2)\r\n\r\n\r\nprint(res)\r\na = [' '.join([str(iz)]*izms[iz]) for iz in izms]\r\nprint(' '.join(k for k in a if len(k)>0))\r\n\r\n", "n = int(input())\r\nxi = list(map(int,input().split()))\r\n\r\nmaxi = max(xi)\r\nmini = min(xi)\r\nmid = mini + (maxi - mini) // 2\r\n\r\nif 2 > maxi - mini:\r\n print(n)\r\n for i in xi:\r\n print(i,end=\" \")\r\nelse:\r\n temp = 0\r\n temp2 = 0\r\n temp3 = 0\r\n for i in xi:\r\n if i == mini:\r\n temp += 1\r\n elif i == mid:\r\n temp2 += 1\r\n else:\r\n temp3 += 1\r\n temp4 = maxi\r\n temp5 = temp3-temp\r\n if temp > temp3:\r\n temp4 = mini\r\n temp5 = temp - temp3\r\n temp = temp3\r\n temp6 = temp2\r\n temp2 //= 2\r\n if temp > temp2:\r\n temp *= 2\r\n print(n - temp)\r\n for i in range(temp5):\r\n print(temp4,end=\" \")\r\n for i in range(n-temp5):\r\n print(mid,end=\" \")\r\n \r\n else:\r\n print(n - temp2 * 2)\r\n for i in range(temp6 % 2):\r\n print(mid,end=\" \")\r\n for i in range(temp2 + temp):\r\n print(mini,maxi,end=\" \")\r\n for i in range(temp5):\r\n print(temp4,end=\" \")\r\n", "n = int(input())\r\nlst = [int(x) for x in input().split()]\r\nlst.sort()\r\nif (lst[0] + 1) in lst:\r\n a = lst.index(lst[0] + 1)\r\nelif (lst[0] + 2) in lst:\r\n a = lst.index(lst[0] + 2)\r\n b = 0\r\nelse:\r\n a = len(lst)\r\n b = 0\r\n c = 0\r\nif (lst[0] + 2) in lst:\r\n b = lst.index(lst[0] + 2) - a\r\n c = len(lst) - b - a\r\nelse:\r\n b = len(lst) - a\r\n c = 0\r\nif c == 0:\r\n print(n)\r\n for x in lst:\r\n print(x, end = ' ')\r\n'''elif b == 0:\r\n print(abs(c - a))\r\n if c >= a:\r\n for k in range(a):\r\n print(lst[0] + 1, end = ' ')\r\n for k in range():\r\n print(lst[0] + 2, end = ' ')\r\n else:\r\n for k in range(c):\r\n print(lst[0] + 1, end = ' ')\r\n for k in range(a - c):\r\n print(lst[0], end = ' ')'''\r\nif c != 0:\r\n if b // 2 >= a or b // 2 >= c:\r\n print(n - (b // 2) * 2)\r\n for k in range(a + (b // 2)):\r\n print(lst[0], end = ' ')\r\n if b % 2 == 1:\r\n print(lst[0] + 1, end = ' ')\r\n for k in range(c + (b // 2)):\r\n print(lst[0] + 2, end = ' ')\r\n \r\n elif c <= a:\r\n print(n - 2 * c)\r\n for k in range(a - c):\r\n print(lst[0], end = ' ')\r\n for k in range(b + 2 * c):\r\n print(lst[0] + 1, end = ' ')\r\n else:\r\n print(n - 2 * a)\r\n for k in range(c - a):\r\n print(lst[0] + 2, end = ' ')\r\n for k in range(b + 2 * a):\r\n print(lst[0] + 1, end = ' ')\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nx2 = list(x)\r\nr = n\r\ni = 0\r\nif(x[n - 1] - x[0] != 2):\r\n\tprint(r)\r\n\tprint(*x)\r\n\texit(0)\r\nwhile x[n - 1 - i] - x[i] == 2:\r\n\tx[i] += 1\r\n\tx[n - 1 - i] -= 1\r\n\ti += 1\r\n\tr -= 2\r\ni = n - 1\r\nj = 0\r\nr2 = n\r\nwhile(x2[i] == x2[n - 1]):\r\n\ti -= 1\r\nwhile(x2[j] == x2[0]):\r\n\tj += 1\r\nwhile j < i:\r\n\tx2[j] -= 1\r\n\tx2[i] += 1\r\n\tj += 1\r\n\ti -= 1\r\n\tr2 -= 2\r\n\tpass\r\nif(r > r2):\r\n\tprint(r2)\r\n\tprint(*x2)\r\nelse:\r\n\tprint(r)\r\n\tprint(*x)", "n = int(input())\r\ns = input()\r\nnums = [int(x) for x in s.split(' ')]\r\n\r\ndef helper():\r\n mi = 1000000\r\n ma = -1000000\r\n for x in nums:\r\n if x > ma:\r\n ma = x\r\n if x < mi:\r\n mi = x\r\n\r\n if ma <= mi + 1:\r\n print(n)\r\n print(s)\r\n return\r\n\r\n a = b = c = 0\r\n for x in nums:\r\n if x == ma:\r\n c += 1\r\n elif x == mi:\r\n a += 1\r\n else:\r\n b += 1\r\n t = min(a, c)\r\n if t >= b // 2:\r\n a -= t\r\n c -= t\r\n b += 2*t\r\n else:\r\n t = b // 2\r\n a += t\r\n c += t\r\n b &= 1\r\n ans = n - 2 * t\r\n print(ans)\r\n mid = mi + 1\r\n out = [mi] * a + [mid] * b + [ma] * c\r\n print(*out)\r\n return\r\n\r\nhelper()", "n = int(input())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\ndef main():\r\n maxi = max(lst)\r\n mini = min(lst)\r\n if maxi - mini < 2:\r\n print(n)\r\n print(*lst)\r\n else:\r\n MIN = 0\r\n MAX = 0\r\n k2 = 0\r\n for x in lst:\r\n if x == mini:\r\n MIN += 1\r\n elif x == maxi:\r\n MAX += 1\r\n else:\r\n k2 += 1\r\n k1 = min(MIN, MAX)\r\n if 2 * k1 >= k2:\r\n count_min = 0\r\n count_max = 0\r\n for x in range(len(lst)):\r\n if lst[x] == mini and count_min < k1:\r\n lst[x] += 1\r\n count_min += 1\r\n elif lst[x] == maxi and count_max < k1:\r\n lst[x] -= 1\r\n count_max += 1\r\n print(k2 + abs(MIN - MAX))\r\n print(*lst)\r\n else:\r\n k = 0\r\n if k2 % 2 == 1:\r\n k += 1\r\n k2 = k2 // 2\r\n count_min = 0\r\n count_max = 0\r\n for x in range(len(lst)):\r\n if lst[x] == maxi - 1:\r\n if count_max > count_min and count_min < k2:\r\n count_min += 1\r\n lst[x] -= 1\r\n else:\r\n if count_max < k2:\r\n count_max += 1\r\n lst[x] += 1 \r\n print(k + MIN + MAX)\r\n print(*lst)\r\n \r\nmain() \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmina = min(arr)\r\nmaxa = max(arr)\r\nif maxa - mina < 2:\r\n print(n)\r\n print(*arr)\r\n exit()\r\na, b, c = 0, 0, 0\r\nfor i in arr:\r\n if i == mina:\r\n a += 1\r\n elif i == maxa:\r\n c += 1\r\n else:\r\n b += 1\r\nm = max(2 * min(a, c), b // 2 * 2)\r\nif 2 * min(a, c) > b:\r\n b += 2 * min(a, c)\r\n a, c = a - min(a, c), c - min(a, c)\r\nelse:\r\n a += b // 2\r\n c += b // 2\r\n b = b % 2\r\nans = ((str(mina) + \" \") * a) + ((str(mina + 1) + \" \") * b) + ((str(mina + 2) + \" \") * c)\r\nprint(n - m)\r\nprint(ans[:-1])", "n = int(input())\r\nCyrill = list(map(int, input().split()))\r\nAnn = [x for x in Cyrill]\r\nmini = min(Cyrill)\r\nmaxi = max(Cyrill)\r\nminn = Cyrill.count(mini)\r\nmaxn = Cyrill.count(maxi)\r\nsred = mini + 1\r\nsredn = Cyrill.count(sred)\r\nif mini >= maxi - 1:\r\n print(n)\r\n print(*Cyrill)\r\nelse:\r\n way1 = min(minn, maxn) * 2\r\n way2 = sredn // 2 * 2\r\n print(len(Cyrill) - max(way1, way2))\r\n if way1 > way2:\r\n print((str(sred) + \" \") * (way1 + sredn), end=\"\")\r\n print((str(mini) + \" \") * (minn - way1 // 2), end=\"\")\r\n print((str(maxi) + \" \") * (maxn - way1 // 2), end=\"\")\r\n else:\r\n print((str(mini) + \" \") * (way2 // 2 + minn), end=\"\")\r\n print((str(sred) + \" \") * (sredn - way2), end=\"\")\r\n print((str(maxi) + \" \") * (way2 // 2 + maxn), end=\"\")", "n = int(input())\r\nmeas = [int(x) for x in input().split()]\r\n\r\nmax_m = int(max(meas))\r\nmin_m = int(min(meas))\r\nmid_m = min_m + 1\r\nnormalized_meas = [x - min_m for x in meas]\r\n\r\nc0 = normalized_meas.count(0)\r\nc2 = normalized_meas.count(2)\r\nc02_pairs = min(c0, c2)\r\nc1 = normalized_meas.count(1)\r\nc1_pairs = c1 // 2\r\n\r\nif max_m - min_m < 2:\r\n print(n)\r\nelif c1_pairs >= c02_pairs:\r\n print(n - c1 + c1 % 2)\r\n meas = list(filter(lambda x: x != mid_m, meas))\r\n meas += [min_m, max_m] * c1_pairs + [mid_m] * (c1 % 2)\r\nelse:\r\n print(n - 2 * c02_pairs)\r\n meas = list(filter(lambda x: x == mid_m, meas))\r\n meas += [min_m] * (c0 - c02_pairs) + [max_m] * (c2 - c02_pairs) + [mid_m] * 2 * c02_pairs\r\n\r\n\r\nprint(*meas)", "import base64\r\nimport zlib\r\ns=\"\"\"eJx9U8FOwzAMvecrjBBqwmhJOU6UIz9R9RBYNkWsaZS0iAnx79hxy8aYyCWx896zHTuuD0McYWfH\r\nYFISjs10SEJs7Mu0gwaezT5ZIdwWimF/6EMBTbMQKtynZKNUawG4kFilceM88oZgvSxGm8bK+UIJ\r\nUtxCdGYBR+RGD63zo3QKtkMEB0h1PkyjVFUKe4d7h0zSy8xWd8LExRKid96hhZs0UYk3+2bYdLCC\r\nWvxoRuN3Vvo5somt66BsgPCoVyWsGuVMHKKjmtH1OoQDRUhTT5K45Qgi2pQTaDt6knz7CHqpiO5W\r\nDci2rDu4BfOSJEGUmuNm7fbHvT6KPF0QyRqXBNYlOTtxHSK9HiWGOnubXwFu4IF6VJ/oVSZgOzZS\r\nLzpVtP3wbskh+pB1P8t6zZVPqFnW6g5TOjo02qeAWn1RUCLnald8xNMjn3QHxm+gNx85K8qIHdws\r\ncpT1Wc3zu8mllPt7eFBnkEsIizN6LqUJN8NyH7HbWKZejiueG36fk6J5Co4e9Q9Bn+P1v/A/8qQ+\r\nj4DkCwVXPG2ZNw+s/XCEXZrMVwTk8jLvN5IHgzNRJ/+AmIxkBP0T+gV3gOPRFIAf9RvN3jEG\r\n\"\"\"\r\nexec(zlib.decompress(base64.decodebytes(s.encode())).decode())\r\n\r\n", "n = int(input())\r\nar = list(map(int, input().split()))\r\n\r\nmn = min(ar)\r\nmx = max(ar)\r\nif mx - mn < 2:\r\n print(n)\r\n print(' '.join([str(i) for i in ar]))\r\n exit()\r\na=0\r\nb=0\r\nc =0\r\nfor i in ar:\r\n if i == mn:\r\n a +=1\r\n elif i == mx:\r\n c +=1\r\n else:\r\n b+=1\r\ncans1 = b - (b%2)\r\ncans2 = 2*min(a,c)\r\nif cans1 > cans2:\r\n ans = []\r\n for i in range(a):\r\n ans.append(mn)\r\n for i in range(c):\r\n ans.append(mx)\r\n for i in range(b//2):\r\n ans.append(mn)\r\n ans.append(mx)\r\n if len(ans) < n:\r\n ans.append(mn+1)\r\n print(n-cans1)\r\n print(' '.join([str(i) for i in ans]))\r\nelse:\r\n ans = []\r\n if c > a:\r\n ans = [mx for i in range(c-a)]\r\n while len(ans) < n:\r\n ans.append(mn+1)\r\n else:\r\n ans = [mn for i in range(a-c)]\r\n while len(ans) < n:\r\n ans.append(mn+1)\r\n print(n-cans2)\r\n print(' '.join([str(i) for i in ans]))", "from collections import Counter,UserString\r\nimport sys\r\ntry:\r\n pass\r\n sys.stdin=open('test','r')\r\nexcept:\r\n pass\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=Counter(a)\r\nc0=c.keys()\r\nif abs(min(c0)-max(c0))<=1:\r\n print(n)\r\n print(*a)\r\nelse:\r\n a=min(c0)+1\r\n d=c[a+1]-c[a-1]\r\n if d<0:\r\n d=abs(d)\r\n nn=(n-d)//2\r\n ny=(n-d)%2\r\n if min(c[a-1],d)+min(c[a],n-d)<min(c[a-1],d+nn)+min(c[a],ny)+min(c[a+1],nn):\r\n print(min(c[a-1],d)+min(c[a],n-d))\r\n for i in range(d):\r\n print(a-1,end=' ')\r\n for i in range(n-d):\r\n print(a,end=' ')\r\n else:\r\n print(min(c[a-1],d+nn)+min(c[a],ny)+min(c[a+1],nn))\r\n for i in range(d+nn):\r\n print(a-1,end=' ')\r\n for i in range(nn):\r\n print(a+1,end=' ')\r\n if ny==1:\r\n print(a)\r\n else:\r\n nn=(n-d)//2\r\n ny=(n-d)%2\r\n if min(c[a+1],d)+min(c[a],n-d)<min(c[a+1],d+nn)+min(c[a],ny)+min(c[a-1],nn):\r\n print(min(c[a+1],d)+min(c[a],n-d))\r\n for i in range(d):\r\n print(a+1,end=' ')\r\n for i in range(n-d):\r\n print(a,end=' ')\r\n else:\r\n print(min(c[a+1],d+nn)+min(c[a],ny)+min(c[a-1],nn))\r\n for i in range(d+nn):\r\n print(a+1,end=' ')\r\n for i in range(nn):\r\n print(a-1,end=' ')\r\n if ny==1:\r\n print(a)" ]

[ "n=int(input())\r\nc=1+n*(n+1)//2*6\r\nprint(c)\r\n", "n=int(input())\r\nprint((3*n*n)+(3*n)+1)", "n=int(input())\r\nprint((((n+1)*3)*n)+1)", "a=int(input())\r\nprint(1+a*(a+1)//2*6)", "n = int(input())\r\nprint(1 + n * (n + 1) * 3)\n# Sat Aug 05 2023 13:29:16 GMT+0300 (Moscow Standard Time)\n", "a=int(input())\r\nprint((1+a)*a//2*6+1)", "n = int(input())\r\nprint(3*n**2+3*n+1)", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(1 + ((6 + n*6) // 2) * n)", "n = int(input())\r\nprint(3*(n*(n+1))+1)\r\n", "# LUOGU_RID: 130281059\na=int(input())\nprint((1+a)*a//2*6+1)", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nn=int(input())\r\nprint(((3*(n+1))*n)+1)\r\n ", "n = int(input())\r\nprint((((n*(n+1))//2)*6)+1)", "n=int(input())\r\nprint(3*n*(n+1)+1)", "n = int(input())\r\nprint(1 + (n*(6+(n-1)*3)))\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\nans=((n*(n+1))//2)*6\r\nprint(ans+1)", "x = int(input())\nprint(1 + 3 * x * (x+1))\n \t\t\t \t\t \t \t \t\t \t\t\t\t\t", "# Wadea #\r\n\r\nn = int(input());print(((n*((n+1))//2)*6)+1)", "a = int(input())\r\nprint((a*(a+1)*3) + 1)", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n print(1 + ((n*(n+1))//2)*6)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\nprint(3*a*(a+1)+1)", "t=int(input())\r\nprint(t*(t+1)*3+1)" ]

[ "n, a = map(int, input().split())\r\n\r\na -= 1\r\nl = list(map(int, input().split()))\r\n\r\nans = l[a]\r\n\r\ni, j = a-1, a+1\r\n\r\nwhile i >= 0 and j < n:\r\n if l[i] == 1 and l[j] == 1:\r\n ans += l[i] + l[j]\r\n i -= 1\r\n j += 1\r\nwhile i >= 0:\r\n ans += l[i]\r\n i -= 1\r\nwhile j < n:\r\n ans += l[j]\r\n j += 1\r\nprint(ans)\r\n", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\nfr = bk = a - 1\r\ncounter = 0\r\n\r\nwhile fr >= 0 and bk <= len(t) - 1:\r\n \r\n if t[fr] + t[bk] == 2:\r\n if fr == bk:\r\n counter += 1\r\n else:\r\n counter += 2\r\n\r\n fr -= 1\r\n bk += 1\r\n\r\ncounter += sum(t[0:fr + 1])\r\ncounter += sum(t[bk :])\r\nprint(counter)\r\n \r\n", "n, a = map(int, input().split())\nt = list(map(int, input().split()))\nc = sum(t)\na = a-1\nfor i in range(n):\n if a+i < n and a-i>-1 and ((t[a+i] == 1 and t[a-i] == 0) or (t[a+i] == 0 and t[a-i] == 1)):\n c -= 1\n\nprint(c)", "n,a=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nans=sum(x)\r\np=min(a-1,n-a)\r\nfor i in range(1,p+1):\r\n if x[a-1-i]+x[a-1+i]==1:\r\n ans=ans-1\r\nprint(ans)", "nOfCities , x = map(int, input().split())\nx -= 1\ncriminals = list(map(int, input().split()))\n\ndef criminalsFound(cities, criminals):\n Counter = 0\n for i in range(0, nOfCities):\n if x - i >= 0 and x+i < nOfCities:\n if criminals[x - i] == 1 and criminals[x + i] == 1:\n Counter += 2\n elif x - i >= 0:\n if criminals[x - i] == 1:\n Counter += 1\n elif x + i < nOfCities:\n if criminals[x + i] == 1:\n Counter += 1\n if criminals[x] == 1:\n Counter -= 1\n print(Counter)\n return Counter\ncriminalsFound(nOfCities, criminals)\n \t \t \t\t \t \t\t\t\t \t\t", "n, a = map(int, input().split())\r\na -= 1\r\nc = list(map(int, input().split()))\r\nans = 0\r\nif c[a] == 1:\r\n ans += 1\r\n\r\nfor i in range(1,n):\r\n if a-i >= 0 and c[a-i] == 1 and a+i<=n-1 and c[a+i] == 1:\r\n ans += 2\r\n elif a-i < 0 and a+i<=n-1 and c[a+i] == 1:\r\n ans += 1\r\n elif a+i>n-1 and a-i >= 0 and c[a-i] == 1:\r\n ans += 1\r\nprint(ans)", "def main():\r\n n, city = [int(x) for x in input().split()]\r\n city = city - 1\r\n count = 0\r\n\r\n lis = [int(x) for x in input().split()]\r\n\r\n if lis[city]==1:\r\n count = count +1\r\n\r\n for i in range(1,n):\r\n lef,rig = 0,0\r\n rig = city +i\r\n lef = city -i\r\n\r\n if lef >=0 or rig <n:\r\n if lef >=0 and rig<n:\r\n if lis[rig]==1 and lis[lef]==1:\r\n count =count +2\r\n elif lef >=0:\r\n if lis[lef]==1:\r\n count = count +1\r\n elif rig<n:\r\n if lis[rig] ==1:\r\n count = count +1\r\n\r\n print(count)\r\nif __name__ == '__main__':\r\n main()", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\ni = j = a-1\r\ns = sum(t)\r\n\r\nwhile (i>=0 and j<n):\r\n if t[i]+t[j]==1:\r\n s -= 1\r\n i -= 1\r\n j += 1\r\nprint(s)\r\n", "import math\r\n\r\nans = 0\r\n\r\ndef solve(start, arr):\r\n global ans\r\n start -= 1\r\n if arr[start] == 1: ans+=1\r\n dist = 1\r\n for i in range(dist, len(arr)):\r\n one = start + i\r\n two = start - i\r\n if one < len(arr):\r\n if two >= 0:\r\n if arr[one] == arr[two] == 1:\r\n ans += 2\r\n else:\r\n if arr[one] == 1: ans += 1\r\n else:\r\n if two >= 0:\r\n if arr[two] == 1: ans += 1\r\n \r\n \r\n \r\n \r\n \r\nf = int(input().split(\" \")[1])\r\na = input().split(\" \")\r\na = [int(x) for x in a]\r\nsolve(f, a)\r\n\r\nprint(ans)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\narr=[int(i) for i in input().split()]\r\ni=b-1\r\nj=b-1\r\ncount=0\r\n\r\nwhile 0<=i<=b-1 or b-1<=j<=a-1:\r\n if 0<=i<=b-1 and b-1<=j<=a-1:\r\n if arr[i]==1 and arr[j]==1:\r\n if i==j:\r\n count+=1\r\n else:\r\n\r\n count+=2\r\n i=i-1\r\n j=j+1\r\n\r\n else:\r\n i=i-1\r\n j=j+1\r\n elif i<0 and j<a:\r\n if arr[j]==1:\r\n count+=1\r\n j+=1\r\n else:\r\n j+=1\r\n else:\r\n if arr[i]==1:\r\n count+=1\r\n i=i-1\r\n else:\r\n i=i-1\r\nprint(count)\r\n", "n,a=map(int,input().split())\nl,a=list(map(int,input().split())),a-1\nc=1 if l[a] else 0\nfor i in range(1,n):\n if a+i<n and a-i>=0:\n c += 2 if l[a+i] and l[a-i] else 0\n else:\n c += sum(l[:a-i+1]) if a+i>=n else sum(l[a+i:]) if a-i<0 else 0\n break\nprint(c)\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\nn = list(map(int, input().split()))\r\nb -= 1\r\ncount = 0\r\nthing = 0\r\nstooge = False\r\nstooge2 = False\r\nwhile True:\r\n if b + count>=a:\r\n stooge = True\r\n if b - count< 0:\r\n stooge2 = True\r\n if stooge == True and stooge2 == True:\r\n break\r\n if stooge == False and stooge2 == False:\r\n if n[b+ count] == 1 and n[b - count] == 1:\r\n if count == 0:\r\n thing += 1\r\n else:\r\n thing += 2\r\n elif stooge == True:\r\n if n[b - count] == 1:\r\n thing += 1\r\n elif n[b+ count] == 1:\r\n thing += 1\r\n count += 1\r\nprint(thing)", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=0\r\nk=k-1\r\npos1,pos2=min(k,n-1-k),max(k,n-1-k)\r\nif a[k]==1:\r\n res+=1\r\nfor i in range(1,pos1+1):\r\n if a[k-i]+a[k+i]==2:\r\n res+=2\r\nfor i in range(pos1+1,pos2+1):\r\n if k-i>=0:\r\n if a[k-i]==1:\r\n res+=1\r\n else:\r\n if a[k+i]==1:\r\n res+=1\r\nprint(res)", "n, idx = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = r = idx-1\r\nans = 0\r\n\r\nwhile l>=0 or r<n:\r\n if l>=0 and r<n:\r\n if a[l]==1 and a[r]==1:\r\n ans += 1 if l==r else 2 \r\n \r\n \r\n else:\r\n if l>=0 and a[l]==1:\r\n ans +=1\r\n if r<n and a[r]==1:\r\n ans +=1\r\n l -=1\r\n r +=1\r\n\r\nprint(ans)\r\n ", "\r\nn, a = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\na -= 1\r\n\r\nres = 0\r\nfor i in range(n):\r\n if i == 0:\r\n res += arr[a]\r\n elif a+i < n and a - i > -1:\r\n if arr[a+i] == 1 and arr[a-i] == 1:\r\n res += 2\r\n elif a+i < n:\r\n res += arr[a+i]\r\n elif a-i > -1:\r\n res += arr[a-i]\r\nprint(res)\r\n", "#!/bin/python3\r\n\r\nn, limak = tuple(map(int, input().split()))\r\n\r\nlimak_idx = limak - 1\r\ntotal_caught = 0\r\n\r\ncriminals = list(map(int, input().split()))\r\ncompleted = []\r\n\r\n\r\ni = 0\r\nwhile i < n:\r\n distance = abs(limak_idx - i)\r\n left_side_idx = limak_idx - distance\r\n right_side_idx = limak_idx + distance\r\n if left_side_idx == limak_idx:\r\n if criminals[left_side_idx] == 1:\r\n total_caught += 1\r\n completed.append(left_side_idx)\r\n elif left_side_idx >= 0 and right_side_idx < n and left_side_idx not in completed and right_side_idx not in completed:\r\n if criminals[left_side_idx] == 1 and criminals[right_side_idx] == 1:\r\n total_caught += 2\r\n completed.append(left_side_idx)\r\n completed.append(right_side_idx)\r\n elif left_side_idx >= 0 and right_side_idx >= n and left_side_idx not in completed:\r\n if criminals[left_side_idx] == 1:\r\n total_caught += 1\r\n completed.append(left_side_idx)\r\n elif left_side_idx < 0 and right_side_idx < n and right_side_idx not in completed:\r\n if criminals[right_side_idx] == 1:\r\n total_caught += 1\r\n completed.append(right_side_idx)\r\n i += 1\r\n\r\nprint(total_caught)\r\n", "n, p = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\nright = n - p\r\nleft = n - right - 1\r\nres = 0\r\nif left < right:\r\n\r\n\r\n if arr[p - 1] == 1:\r\n res = 1\r\n\r\n s = 0\r\n for i in reversed(range(left)):\r\n if arr[i] == 1 and arr[p + s] == 1:\r\n res += 2\r\n s += 1\r\n else:\r\n s += 1\r\n continue\r\n\r\n \r\n for i in range(p + left, n):\r\n if arr[i] == 1:\r\n res += 1\r\n\r\n\r\n\r\n\r\nelse:\r\n\r\n if arr[p - 1] == 1:\r\n res = 1\r\n\r\n\r\n for i in range(p, p + right):\r\n if arr[i] == 1 and arr[left - (i - p) - 1] == 1:\r\n res += 2\r\n else:\r\n continue\r\n\r\n\r\n for i in range(0, p - right - 1):\r\n if arr[i] == 1:\r\n res += 1\r\n\r\nprint(res)\r\n", "n,a=map(int,input().split())\r\n*aa,=map(int,input().split())\r\nii=[1,-1][a<=int(n/2)]\r\nfor i in range(a-1,[-1,n][ii==1],ii):\r\n if aa[i]==0 or aa[2*a-2-i]==0:\r\n aa[i]=0; aa[2*a-2-i]=0\r\nprint(sum(aa))", "n, x = map(int,input().split())\nd = list(map(int,input().split()))\ni, j, s = x-1, x-1, 0\nif d[x-1] == 1:\n s += 1\nwhile True:\n ok = 1\n ok1 = 1 \n if i-1 >= 0:\n i -= 1\n ok = 0\n if j+1 < n:\n j += 1\n ok1 = 0\n if ok1 == 0 and ok == 0:\n if d[i] == 1 and d[j] == 1:\n s+=2\n elif ok1 == 1 and ok == 0:\n if d[i] == 1:\n s+=1\n else:\n if ok == 1 and ok1 == 0:\n if d[j] == 1:\n s+=1\n if i == 0 and j == n-1:\n print(s)\n break\n \n", "n,a = [int(x) for x in input().split()]\r\narray = [int(x) for x in input().split()]\r\nleft = a-1\r\nright = a-1\r\nans =0\r\nwhile left>=0 and right<n:\r\n if array[left]==1 and array[right]==1:\r\n # print('left is',left,'right is ',right)\r\n ans +=1 \r\n if left!=right:\r\n ans+=1\r\n left-=1 \r\n right+=1\r\nwhile left>=0:\r\n if array[left]==1:\r\n ans+=1 \r\n left -=1 \r\nwhile right<n:\r\n if array[right]==1:\r\n ans+=1 \r\n right +=1\r\nprint(ans)", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\na -= 1\r\n\r\nres = 0\r\n\r\nif t[a]:\r\n res += 1\r\n\r\nfor i in range(1, n):\r\n left = a - i\r\n right = a + i\r\n\r\n if (left >= 0 or right < n):\r\n if (left >= 0 and right < n):\r\n if (t[left] and t[right]):\r\n res += 2\r\n elif (left >= 0):\r\n if (t[left]):\r\n res += 1\r\n elif (right < n):\r\n if (t[right]):\r\n res += 1\r\n\r\nprint(res)\r\n", "n, k = input().split()\r\nn, policePos = int(n), int(k) - 1\r\ncriminals = input().split()\r\ni = 1\r\nnumberOfCriminals = 0;\r\nnumberOfCriminals += int(criminals[policePos])\r\nwhile(policePos + i < n or policePos - i >= 0):\r\n leftPos = int(criminals[policePos - i]) if policePos - i >= 0 else -1\r\n rightPos = int(criminals[policePos + i]) if policePos + i < n else -1\r\n if leftPos == 1 and rightPos == 1:\r\n numberOfCriminals += 2\r\n i += 1\r\n continue\r\n if (leftPos == 1 and rightPos == -1) or (rightPos == 1 and leftPos == -1):\r\n numberOfCriminals += 1\r\n i += 1\r\n\r\nprint(numberOfCriminals)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 25 00:13:03 2021\r\n\r\n@author: Mo'men\r\n\"\"\"\r\n\r\nn, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\na -= 1\r\ncounter = arr[a]\r\nleft = a - 1\r\nright = a + 1\r\nwhile left >= 0 or right < n:\r\n if (left < 0 or arr[left]) and (right >= n or arr[right]):\r\n if left >= 0 and right < n:\r\n counter += 2\r\n else:\r\n counter += 1\r\n left -= 1\r\n right += 1\r\n \r\n\r\nprint(counter)", "n, a = tuple(map(int, input().split()))\nargs = tuple(map(int, input().split()))\n\na -= 1\nstart_distance = abs(0 - a)\nend_distance = abs(len(args) - a - 1)\n\nif start_distance == 0 or end_distance == 0:\n result = 0\n for arg in args:\n result += arg\nelse:\n indexes = set()\n result = 0\n min_distance = min(start_distance, end_distance)\n start = a\n end = a\n\n for i in range(min_distance + 1):\n indexes.add(start)\n indexes.add(end)\n\n if start == a and end == a:\n result += args[start]\n else:\n if args[start] and args[end]:\n result += 2\n\n start -= 1\n end += 1\n \n for index, arg in enumerate(args):\n if index not in indexes:\n result += arg\n\nprint(result)", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n\nif __name__ == '__main__':\n\ta = [int(x) for x in input().strip().split(\" \")]\n\tb = [int(x) for x in input().strip().split(\" \")]\n\tl, r = a[1]-1, a[1]-1\n\tans = 0\n\tif b[l] == 1 and b[r] == 1:\n\t\tans += 1\n\tl -= 1\n\tr += 1\n\twhile l >= 0 and r < a[0]:\n\t\tif b[l] == 1 and b[r] == 1:\n\t\t\tans += 2\n\t\tl -= 1\n\t\tr += 1\n\tif l >= 0:\n\t\twhile l >= 0:\n\t\t\tif b[l] == 1:\n\t\t\t\tans += 1\n\t\t\tl -= 1\n\tif r < a[0]:\n\t\twhile r < a[0]:\n\t\t\tif b[r] == 1:\n\t\t\t\tans += 1\n\t\t\tr += 1\n\tprint(ans)\n\t \t \t\t\t \t \t\t\t\t\t \t \t \t \t \t\t", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\nfrom functools import lru_cache\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n \r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n \r\n'''\r\n'''\r\ndef solve():\r\n n, a = MII()\r\n l = r = a-1\r\n s = LII()\r\n\r\n ans = 0\r\n while l >= 0 or r < len(s):\r\n if l >= 0 and r < len(s):\r\n if s[l] and s[r]:\r\n ans += 2 if l != r else 1\r\n elif l >= 0 and r >= len(s):\r\n ans += int(s[l])\r\n elif r < len(s) and l < 0:\r\n ans += int(s[r])\r\n l -= 1\r\n r += 1\r\n print(ans)\r\n\r\nsolve()", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,a=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nle=a-2\r\nri=a\r\nif(l[a-1]==1):\r\n c=1\r\nelse:\r\n c=0\r\nwhile(le>=0 and ri<=n-1):\r\n c1=0\r\n if(l[le]==1):\r\n c1+=1\r\n if(l[ri]==1):\r\n c1+=1\r\n if(c1==2):\r\n c+=2\r\n le-=1\r\n ri+=1\r\nwhile(le>=0):\r\n if(l[le]==1):\r\n c+=1\r\n le-=1\r\nwhile(ri<=n-1):\r\n if(l[ri]==1):\r\n c+=1\r\n ri+=1\r\nprint(c)", "n,a = map(int,input().split())\r\nt = list(map(int,input().split()))\r\nt = [0]+t\r\ni = a+1\r\nj = a-1\r\ncri = t[a]\r\nwhile True:\r\n # print(i,j)\r\n if j==0 and i==(n+1):\r\n break\r\n elif j>0 and i<=n:\r\n if t[i]*t[j]==1:\r\n cri += 2\r\n i+=1\r\n j-=1\r\n elif j==0 and i<=n:\r\n if t[i]==1:\r\n cri+=1\r\n i+=1\r\n elif j>0 and i>n:\r\n if t[j]==1:\r\n cri+=1\r\n j-=1\r\nprint(cri)", "n, a = (int(x) for x in input().split(' '))\r\na -= 1\r\narr = [int(x) for x in input().split(' ')]\r\nres = arr[a]\r\nd = 1\r\nwhile d <= min(a, n - a - 1):\r\n res += 2 if arr[a + d] and arr[a - d] else 0\r\n d += 1\r\nwhile d < n:\r\n x = 0 if a + d >= n else arr[a + d]\r\n y = 0 if a - d < 0 else arr[a - d]\r\n res += x + y\r\n d += 1\r\nprint(res)", "n, a = map(int, input().split(' '))\narray = list(map(int, input().split(' ')))\ndistance = []\nresult = 0\na -= 1\n\nfor i in range(n):\n distance.append(i-a)\n\ncounter = 0\nfor ar in array:\n if ar == 1:\n dist = distance[counter]\n if dist == 0:\n result += 1\n elif a-dist > n-1 or a-dist < 0:\n result += 1\n elif ar == array[a-dist]:\n result += 2\n ar = 0\n array[a-dist] = 0\n counter += 1\nprint(result)\n", "(n,a) = (int(num) for num in input().split())\nl = list(input().split())\ncount = 0\nif l[a-1]=='1':\n count+=1\nback = a-2\nforw = a\nwhile (back>=0 and forw<n):\n if l[back]=='1' and l[forw]=='1':\n count+=2\n back -=1\n forw +=1\n\nif back>=0:\n while(back>=0):\n if l[back]=='1':\n count+=1\n back -=1\nif forw<n:\n while(forw<n):\n if l[forw]=='1':\n count+=1\n forw +=1\nprint(count)\n", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na-=1\r\nl=a-1\r\nr=a+1\r\ntotal=sum(t)\r\nwhile l>-1 and r<n:\r\n total-=(t[l]+t[r])%2\r\n l-=1\r\n r+=1\r\nprint(total)", "class Solution:\r\n def Limakcatches(self,cities,limak,criminals):\r\n limak_ = limak-1\r\n i = limak_-1\r\n j = limak_+1\r\n if criminals[limak_]==1:\r\n count=1\r\n else:\r\n count = 0\r\n while(i>=0 and j<cities):\r\n if (criminals[i]==criminals[j] and criminals[i]==1):\r\n count+=2\r\n i-=1\r\n j+=1\r\n \r\n if i>=0:\r\n while(i>=0):\r\n if criminals[i]==1:\r\n count+=1\r\n i-=1\r\n return count\r\n elif j<cities:\r\n while(j<cities):\r\n if criminals[j]==1:\r\n count+=1\r\n j+=1\r\n return count\r\n else:\r\n return count\r\n \r\n \r\n \r\n \r\n \r\n \r\n # code here\r\n\r\n#{ \r\n # Driver Code Starts.\r\ndef main():\r\n \r\n cities,limak=[int(x) for x in input().split()]\r\n criminals = [int(x) for x in input().split()]\r\n \r\n ob=Solution()\r\n print(ob.Limakcatches(cities,limak,criminals))\r\n \r\n\r\nif __name__== \"__main__\":\r\n main()\r\n# } Driver Code Ends", "#!/usr/bin/env python3\r\n\r\ninitial = list(map(int, input().split()))\r\n\r\nposition = initial[1] - 1 \r\n\r\ncitiesNum = initial[0]\r\n\r\ncities = list(map(int, input().split()))\r\n\r\nif cities[position] == 1:\r\n criminals = 1\r\nelse:\r\n criminals = 0\r\n\r\nfor i in range(1,citiesNum):\r\n left = True\r\n leftCrim = 0\r\n right = True\r\n rightCrim = 0\r\n \r\n \r\n if position - i >= 0:\r\n if cities[position - i] == 1:\r\n leftCrim = 1\r\n else:\r\n left = False\r\n \r\n if position + i <= (citiesNum-1):\r\n if cities[position + i] == 1:\r\n rightCrim = 1 \r\n else: \r\n right= False\r\n # print(i, \" rightCrim\",rightCrim, \" leftCrim\", leftCrim, \" left\", left, \" right\", right ) \r\n if (left and right) and (rightCrim == 1 and leftCrim == 1):\r\n criminals += 2 \r\n elif left != right and (rightCrim == 1 or leftCrim == 1):\r\n criminals += 1\r\n \r\nprint(criminals)", "n,a = map(int,input().split())\r\nti = list(map(int,input().split()))\r\nnum = a - 1\r\nans = ti[num]\r\nfor i in range(1,n):\r\n if num + i >= n and num - i < 0:\r\n break\r\n elif num + i >= n:\r\n ans += ti[num - i]\r\n continue\r\n elif num - i < 0:\r\n ans += ti[num + i]\r\n continue\r\n ans += ti[num+i] * ti[num-i] * 2\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\nn, a = list(invr())\nc = list(invr())\n\na -= 1\n\nnum_criminals = 0\nif c[a]:\n num_criminals += 1\nl, r = a - 1, a + 1\nwhile l >= 0 and r < n:\n if c[l] and c[r]:\n num_criminals += 2\n l -= 1\n r += 1\nwhile l >=0:\n if c[l]:\n num_criminals += 1\n l -= 1\nwhile r < n:\n if c[r]:\n num_criminals += 1\n r += 1\nprint(num_criminals)", "n,a = input().split()\nmylist = input().split()\n\nn = int(n)\na = int(a)\n\nd1 = a - 1\nd2 = n - a\nd3 = abs(d1 - d2)\n\nif d1 > d2 :\n\tmylist += ['3']*d3\nelse:\n\tmylist = ['3']*d3 + mylist\n\ncounter = 0\nif mylist[len(mylist)//2]=='1':\n\tcounter += 1\n\nfor i in range((len(mylist)//2)):\n\tif mylist[i]==mylist[-1-i]==\"1\":\n\t\tcounter += 2\n\telif mylist[i] != '0' and mylist[-1-i] != '0' :\n\t\tcounter += 1\nprint(counter)\t\t\t\t\t", "n,m=list(map(int,input().split()))\r\ncr=list(map(int,input().split()))\r\nst=m-1\r\ned=m-1\r\nans=0\r\nwhile st>=0 and ed<=n-1 :\r\n if st>=0 and ed<=(n-1) :\r\n if cr[st] == cr[ed] == 1 and st!=ed :\r\n ans+=2\r\n elif cr[st] == cr[ed] == 1 and st==ed:\r\n ans+=1\r\n st-=1\r\n ed+=1\r\nif st<0 and ed<=(n-1):\r\n ans+=cr[ed:].count(1)\r\n \r\nelif ed>=(n-1) and st>=0:\r\n ans+=cr[:st+1].count(1)\r\n \r\nprint(ans)", "ip = list(map(int, input().strip().split()))\r\nind = ip[1] - 1\r\nlista = list(map(int, input().strip().split()))\r\nnew = [-1 for i in range(ip[0])]\r\ni = 0\r\nwhile i < ip[0]:\r\n if ind == i:\r\n i += 1\r\n continue\r\n gap = abs(ind - i)\r\n if new[gap] != -1:\r\n i += 1\r\n continue\r\n if lista[i] == 0:\r\n new[gap] = 0\r\n i += 1\r\n continue\r\n else:\r\n if i <= ind:\r\n if ind + gap >= ip[0]:\r\n new[gap] = 1\r\n i += 1\r\n continue\r\n else:\r\n if lista[ind + gap] == 1:\r\n new[gap] = 2\r\n i += 1\r\n continue\r\n else:\r\n new[gap] = 0\r\n i += 1\r\n continue\r\n else:\r\n if ind - gap < 0:\r\n new[gap] = 1\r\n i += 1\r\n continue\r\n else:\r\n if lista[ind - gap] == 1:\r\n new[gap] = 2\r\n i += 1\r\n continue\r\n else:\r\n new[gap] = 0\r\n i += 1\r\n continue\r\nif lista[ind] == 1:\r\n new[0] = 1\r\nres = 0\r\nfor j in range(len(new)):\r\n if new[j] != -1:\r\n res += new[j]\r\nprint(res)\r\n", "# Problem Link: https://codeforces.com/problemset/problem/680/B\r\n# Problem Status:\r\n# -------------------- SEPARATOR --------------------\r\ndef TheAmazingFunction(Arr: list, A):\r\n Answer = 0\r\n i = A - 1\r\n j = A - 1\r\n while i >= 0 or j < len(Arr):\r\n if i == j:\r\n if Arr[i] == 1:\r\n Answer += 1\r\n else:\r\n if i >= 0 and j < len(Arr):\r\n if Arr[i] + Arr[j] == 2:\r\n Answer += 2\r\n else:\r\n if i >= 0:\r\n Answer += Arr[i]\r\n else:\r\n Answer += Arr[j]\r\n i -= 1\r\n j += 1\r\n return Answer\r\n\r\n\r\n# -------------------- SEPARATOR --------------------\r\nN, A_ = list(map(int, input().split()))\r\nArr_ = list(map(int, input().split()))\r\nprint(TheAmazingFunction(Arr_, A_))\r\n# -------------------- SEPARATOR --------------------\r\n", "n , curr = map(int, input().split())\r\ncurr -=1\r\na = list(map(int, input().split()))\r\n\r\nif len(a)-curr-1 < curr:\r\n sub = a[curr-(len(a)-curr-1):]\r\n rest = a[:curr-(len(a)-curr-1)]\r\n \r\n \r\n \r\nelif len(a)-curr-1 > curr:\r\n sub = a[:2*curr+1]\r\n rest = a[2*curr+1:]\r\n \r\nelse:\r\n sub = a\r\n rest = []\r\n \r\nmid = len(sub) // 2\r\nleft = sub[:mid]\r\nright = sub[mid+1:][::-1]\r\n\r\n\r\nsumm = 0\r\nfor i in range(len(left)):\r\n if left[i] == 1 and left[i] == right[i]:\r\n summ += 2\r\n\r\nprint(summ + a[curr] + sum(rest))\r\n ", "n , a = map(int,input().split())\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\nprefix = [0 for i in range(n+1)]\r\no = 0\r\nfor i in range(len(l)):\r\n \r\n if l[i] ==1:\r\n t = abs(a-i-1)\r\n if a -t <=0 or a + t > n or t ==0:\r\n o += 1\r\n elif prefix[t] ==1:\r\n o += 2\r\n else:\r\n prefix[abs(a-i-1)] = 1\r\nprint(o)\r\n\r\n", "\r\ndef solve():\r\n n,m = list(map(int, input().split()))\r\n l = list(map(int, input().split()))\r\n i = m-2\r\n j = m\r\n ans = 0\r\n if l[m-1] == 1:\r\n ans += 1\r\n while i >= 0 and j < n:\r\n if l[i] == 1 and l[j] == 1:\r\n ans += 2\r\n i -= 1\r\n j += 1\r\n while i >= 0:\r\n ans += l[i]\r\n i -= 1\r\n while j < n:\r\n ans += l[j]\r\n j += 1\r\n print(ans)\r\n\r\nsolve()", "n,a = map(int,input().split())\r\na-=1\r\nt=list(map(int,input().split()))\r\nl=[]\r\nk=0\r\nif a+1>n-a:\r\n k=a+1\r\nelse:\r\n k=n-a\r\ncount=0\r\nfor i in range(0,k+1):\r\n indx1 = a+i\r\n indx2 = a-i\r\n if indx1 < n and indx2 >= 0:\r\n if t[indx1]==t[indx2]==1 and indx1!=indx2:\r\n count+=2\r\n elif t[indx1]==t[indx2]==1:\r\n count+=1\r\n elif indx1 < n:\r\n if t[indx1]==1:\r\n count+=1\r\n elif indx2 >= 0:\r\n if t[indx2]==1:\r\n count+=1\r\n else:\r\n break\r\n\r\nprint(count)", "def handle_input():\n n,a= tuple(map(int,input().split()))\n criminals = list(map(int, input().split()))\n return a,criminals\n\n\na,criminals = handle_input()\n\n\ni = j = a-1\ncounter = 0\nn = len(criminals)\nwhile i >= 0 or j <= n-1 :\n if i >= 0 and j <= n-1 :\n if criminals[i] == 1 and criminals[j] == 1 and i != j:\n counter +=2\n elif criminals[i] == 1 and criminals[j] == 1:\n counter +=1\n i-=1\n j+=1\n elif i >=0 :\n if criminals[i] == 1:\n counter+=1\n i-=1\n else:\n if criminals[j] == 1:\n counter+=1\n j+=1\n\nprint(counter)\n\n \t \t \t\t\t \t\t\t\t \t\t\t\t \t \t \t", "n,a=map(int,input().split())\r\nd=list(map(int,input().split()))\r\ni=a-2\r\nj=a\r\nc=0\r\nif d[a-1]==1:\r\n c=1\r\nwhile (i>=0 and j<n):\r\n if d[i]==d[j]==1:\r\n c+=2\r\n i-=1\r\n j+=1\r\nif i<0:\r\n c+=d[j:].count(1)\r\nif j>a-1:\r\n c+=d[:i+1].count(1)\r\nprint(c)", "n , m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nm -=1\r\n\r\ny = []\r\nx = [0] * (n + 1 )\r\nd = {}\r\nfor i in range(n):\r\n r = abs( i - m )\r\n y.append(r)\r\n if r not in d :\r\n d[r] = l[i]\r\n else:\r\n d[r] += l[i]\r\n\r\n\r\n#print(y)\r\n#print(d)\r\n\r\ncnt = 0\r\nfor i in d.keys():\r\n if d[i] == 2 :\r\n cnt += d[i]\r\n\r\n elif i == 0 :\r\n cnt += d[i]\r\n\r\n elif y.count(i) == 1 :\r\n cnt += d[i]\r\n\r\nprint(cnt)\r\n\r\n", "n, a = map(int,input().split())\r\na -= 1\r\ncrim = list(map(int,input().split()))\r\ni = 1\r\ncounter = crim[a]\r\nwhile a - i >= 0 and a + i <= n-1:\r\n if crim[a-i] == 1 and crim[a+i] ==1:\r\n counter += 2\r\n i += 1\r\n\r\nwhile a - i >= 0:\r\n counter += crim[a - i]\r\n i += 1\r\n \r\nwhile a + i <= n-1:\r\n counter += crim[a + i]\r\n i += 1\r\n \r\nprint(counter)", "n, a = map(int, input().split())\r\na -= 1\r\ncts = list(map(int, input().split()))\r\n\r\nd = 1\r\nk = cts[a]\r\nwhile True:\r\n l_ind, r_ind = a - d, a + d\r\n l_val = r_val = 0\r\n if l_ind < 0 and r_ind >= len(cts):\r\n break\r\n elif l_ind >= 0 and r_ind < len(cts):\r\n l_val, r_val = cts[l_ind], cts[r_ind]\r\n if l_val + r_val == 2:\r\n k += 2\r\n elif l_ind >= 0:\r\n l_val = cts[l_ind]\r\n if l_val:\r\n k += 1\r\n else:\r\n r_val = cts[r_ind]\r\n if r_val:\r\n k += 1\r\n d += 1\r\n\r\nprint(k)\r\n \r\n \r\n ", "a,c=([int(x) for x in input().split()])\r\nb=c-1\r\nl1=list(map(int,input().split()))\r\nl1=[1]*a+l1+[1]*a\r\ni=a+b-1\r\nj=a+b+1\r\ng=0\r\nwhile i>=a or j<2*a:\r\n if l1[i]==l1[j] and l1[j]==1:\r\n if i>=a and j<2*a:\r\n g=g+2\r\n else:\r\n g=g+1\r\n i=i-1\r\n j=j+1\r\nif l1[a+b]==1:\r\n print(g+1)\r\nelse:\r\n print(g)\r\n", "#\r\n# Author: eloyhz\r\n# Date: Sep/11/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n, a = [int(x) for x in input().split()]\r\n t = [int(x) for x in input().split()]\r\n max_d = max(a - 1, n - a)\r\n d = 0\r\n criminals = 0\r\n while d <= max_d:\r\n i = a - d - 1\r\n j = a + d - 1\r\n left = t[i] if i >= 0 else -1\r\n right = t[j] if j < n else -1\r\n # print(f'{d = }, {i = }, {j = }, {left = }, {right = }')\r\n if left == right == 1:\r\n criminals += 1 if i == j else 2\r\n elif left == 1 and right == -1 or left == -1 and right == 1:\r\n criminals += 1\r\n d += 1\r\n print(criminals)\r\n\r\n \r\n", "n, a = (int(x) for x in input().split(' '))\r\nv = [int(x) for x in input().split(' ')]\r\nans = 0\r\na -= 1\r\nfor i in range(n):\r\n if a-i >= 0 and a+i < n:\r\n if v[a-i]+v[a+i] == 2:\r\n ans += 1\r\n if(a-i != a+i):\r\n ans += 1\r\n elif a-i >= 0:\r\n ans += v[a-i]\r\n elif a+i < n:\r\n ans += v[a+i]\r\nprint(ans)", "z=lambda:map(int,input().split());a,b=z();c=list(z());i=j=b-1;s=sum(c)\r\nwhile(i>=0 and j<a):\r\n if c[i]+c[j]==1:s-=1\r\n i-=1;j+=1\r\nprint(s)", "a,b=map(int,input().split())\r\nn=list(map(int,input().split()))\r\ni=1\r\nj=1\r\ncount=0\r\ncount=count+n[b-1]\r\nif b-1==0:\r\n count=count+n[1:a].count(1)\r\n print(count)\r\nelif b==a:\r\n count=count+n[0:a-1].count(1)\r\n print(count)\r\nelse:\r\n i=b-2\r\n j=b\r\n while i>=0 and j<=a-1:\r\n if n[i]==1 and n[j]==1:\r\n count=count+2\r\n i=i-1\r\n j=j+1\r\n if i<0 and j==a:\r\n print(count)\r\n elif i<0 and j<a:\r\n count=count+n[j:a].count(1)\r\n print(count)\r\n else:\r\n count=count+n[0:i+1].count(1)\r\n print(count)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "Limak = int((input().split(' '))[1])\ncities = [int(city) for city in input().split(' ')]\nif len(cities) - Limak > Limak - 1:\n a = len(cities) - Limak\nelse:\n a = Limak - 1\ncriminals = 0\ncriminals += cities[Limak - 1]\nfor number in range(a + 1)[1:]:\n first_num = 1\n second_num = 1\n changed1 = False\n changed2 = False\n if Limak - number > 0:\n first_num = cities[Limak - number - 1]\n changed1 = True\n if Limak + number <= len(cities):\n second_num = cities[Limak + number - 1]\n changed2 = True\n if second_num == 1 and first_num == 1:\n if changed1 == True and changed2 == True:\n criminals += 2\n else:\n criminals += 1\n\nprint(criminals)\n\n\n\n", "n,a=map(int,input().split())\r\na-=1\r\nb=[1]*n+[*map(int,input().split())]+[1]*n\r\nprint(sum(b[n+a-abs(a-x)]*b[n+a+abs(a-x)] for x in range(n)))", "n, a = input().split(\" \")\nn = int(n)\na = int(a)\nvalues = [int(s) for s in input().split(\" \")]\n\na_down = a - 2\na_up = a\n\ntotal = values[a - 1]\n\nwhile a_down >= 0 and a_up < len(values):\n if values[a_down] + values[a_up] == 2:\n total += 2\n a_down -= 1\n a_up += 1\n\nwhile a_down >= 0:\n total += values[a_down]\n a_down -= 1\n\nwhile a_up < len(values):\n total += values[a_up]\n a_up += 1\n\nprint(total)", "n, a=[int(x) for x in input().split()] \r\nl=[int(x) for x in input().split()]\r\nres=l[a-1]\r\ni=1\r\nwhile a-1-i in range(n) and a-1+i in range(n):\r\n if l[a-1-i]+l[a-1+i]==2:\r\n res+=2 \r\n i+=1\r\nif a-1-i<0:\r\n res+=sum(l[a-1+i:])\r\nelse:\r\n res+=sum(l[:a-i])\r\nprint(res)", "n,a=map(int,input().split())\r\na=a-1\r\nar=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if(ar[i]==1 and (not(0<=a*2-i<n) or ar[a*2-i]==1)):\r\n #print(i,a*2-i)\r\n count+=1\r\nprint(count)\r\n", "import sys\ninput = sys.stdin.readline\n\ndef inpit(): #int\n return(int(input()))\ndef inplt(): #list \n return(list(map(int,input().split())))\ndef inpstr(): #string\n s = input()\n return(list(s[:len(s) - 1]))\ndef inpspit(): #spaced intergers \n return(map(int,input().split()))\n\n\nn,c = inpspit() \nc = c -1\nh = inplt()\nsure = 0\nchor = 0\nfor i in range(n):\n chor = 0\n sh = 2 \n if(c-i <0 or i +c > n -1 or i == 0):\n sh = 1\n if(c-i>=0 ): \n chor = h[c-i] + chor \n if(i+c <n):\n chor = h[c+i] + chor \n if(chor == sh ):\n sure = sure + chor \n if(chor > sh ):\n sure = sure + 1 \nprint(sure)", "n,ind=map(int,input().split())\r\nind=ind-1\r\na=list(map(int,input().split()))\r\ni,j=ind,ind\r\ncount=0\r\nwhile i>=0 or j<n:\r\n if i>=0 and j<n:\r\n if a[i]==a[j]==1 and i==j:\r\n count+=1\r\n elif a[i]==a[j]==1 and i!=j:\r\n count+=2\r\n i-=1\r\n j+=1\r\n elif i==-1 and j<n:\r\n if a[j]==1:\r\n count+=1\r\n j+=1\r\n elif j==n and i>=0:\r\n if a[i]==1:\r\n count+=1\r\n i-=1\r\nprint(count)", "[n, a]=list(map(int, input().split()))\r\nt=list(map(int, input().split()))\r\na-=1\r\nans=t[a]\r\nbefore, after = a-1, a+1\r\nwhile(before>=0 and after<n):\r\n ans+=2*(int(t[before]==t[after]==1))\r\n before-=1\r\n after+=1\r\nwhile(before>=0):\r\n ans+=t[before]\r\n before-=1\r\nwhile(after<n):\r\n ans+=t[after]\r\n after+=1\r\nprint(ans)", "n,a=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nif n-a>a-1:\r\n d=a-1\r\nelse:\r\n d=n-a\r\nif a==1:print(sum(arr))\r\nelif a==n:print(sum(arr))\r\nelse:\r\n a-=1\r\n if arr[a]==1:\r\n c=1\r\n arr[a]=0\r\n else:c=0\r\n for i in range(1,d+1):\r\n if arr[a-i]==1 and arr[a+i]==1:\r\n c+=2\r\n arr[a-i]=0\r\n arr[a+i]=0\r\n\r\n print(c+sum(arr)) \r\n ", "n, a = map(int, input().split())\r\na -= 1\r\nsumm = 0\r\nt = list(map(int, input().split()))\r\nfor x in t:\r\n summ += x\r\nl = a - 1\r\nr = a + 1\r\nwhile l >= 0 and r < n:\r\n summ -= (t[l] + t[r]) % 2\r\n l -= 1\r\n r += 1\r\nprint(summ)", "n, a = map(int, input().strip().split(\" \"))\nli = list(map(int, input().strip().split(\" \")))\nt = 0\nc = 0\na -= 1\nwhile a+t < n or a-t >= 0:\n\tif a+t<n and a-t >= 0:\n\t\tif li[a+t] and li[a-t] and t:\n\t\t\tc += 2\n\t\telif li[a+t] and li[a-t]:\n\t\t\tc += 1\n\telif a+t<n and li[a+t]:\n\t\tc += 1\n\telif a-t >= 0 and li[a-t]:\n\t\tc += 1\n\t# print(t, c)\n\tt += 1\nprint(c)", "\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\nx=input().split()\r\nn=input().split()\r\nr=0\r\ns=0\r\narr=[]\r\nj=0\r\ng=0\r\nsh=min(int(x[0])-int(x[1]),int(x[1])-1)\r\nfor g in range(int(x[0])):\r\n if(g>=(int(x[1])-1-sh) and g<=(int(x[1])-1+sh) ):\r\n continue\r\n if(int(n[g])):\r\n s=s+1\r\n\r\nfor i in range(int(x[1])-1,int(x[1])-1+sh+1 ):\r\n \r\n if(j and int(n[i]) and int(n[int(x[1])-1-j]) ):\r\n s=s+2\r\n elif(j==0 and int(n[i]) ):\r\n s=s+1\r\n j=j+1\r\nprint(s)", "import math\r\nn1=input().split()\r\na=int(n1[1])-1\r\narr=input().split()\r\narr=map(int,arr)\r\narr=list(arr)\r\nn=len(arr)\r\nx=arr[:a]\r\nx=len(x)\r\ny=arr[a+1:]\r\ny=len(y)\r\n\r\nif len(arr)==1:\r\n res =sum(arr)\r\nelse:\r\n res=arr[a]\r\n if x>y:\r\n res+=sum(arr[:a-y])\r\n arr=arr[a-y:]\r\n n=int(math.ceil(len(arr) / 2))\r\n a = int(math.ceil(len(arr) / 2) - 1)\r\n elif y>x:\r\n res +=sum(arr[abs(a + x + 1):])\r\n arr=arr[:a+x+1]\r\n n = int(math.ceil(len(arr) / 2))\r\n a = int(math.ceil(len(arr) / 2) - 1)\r\n else:\r\n n = int(math.ceil(len(arr) / 2))\r\n\r\n\r\n for i in range(1,n):\r\n if arr[a-i]+arr[a+i]==2:\r\n res +=2\r\nprint(res)\r\n\r\n\r\n", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ni = a - 1\r\nj = i\r\nans = 0\r\nwhile i != n or j != -1:\r\n if i < n and j >= 0:\r\n if t[i] == t[j] and t[i] == 1:\r\n if i == j:\r\n ans += 1\r\n else:\r\n ans += 2\r\n i += 1\r\n j -= 1\r\n elif i == n:\r\n if t[j] == 1:\r\n ans += 1\r\n j -= 1\r\n elif j < 0:\r\n if t[i] == 1:\r\n ans += 1\r\n i += 1\r\nprint(ans)", "n, a = map(int, input().split())\r\na -= 1\r\nt = list(map(int, input().split()))\r\nb = sum(t)\r\nl = a - 1\r\nr = a + 1\r\nwhile l >= 0 and r < n:\r\n b -= (t[l] + t[r]) % 2\r\n l -= 1\r\n r += 1\r\nprint(b)", "n, a = [int(i) for i in input().split()]\r\ncrim = [int(j) for j in input().split()]\r\ncount = 0\r\na -= 1\r\nif (crim[a] == 1):\r\n count += 1\r\nj = a - 1\r\nk = a + 1\r\nwhile (j >= 0 and k < n):\r\n if (crim[j] + crim[k] == 2):\r\n count += 2\r\n j -= 1\r\n k += 1\r\n\r\nif (j < 0 and k != n):\r\n while (k < n):\r\n if (crim[k] == 1):\r\n count += 1\r\n k += 1\r\nelif (j >= 0 and k == n):\r\n while (j >= 0):\r\n if(crim[j]==1):\r\n count += 1\r\n j -= 1\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\ncnt=0\r\nli=list(map(int,input().split()))\r\np=m-1\r\nif li[p]==1:\r\n cnt+=1\r\nq=max(m-1,n-m)\r\n#print(p,q)\r\nfor i in range(1,q+1):\r\n #print(li[p-i],li[p+i])\r\n if p+i<=n-1 and p-i>=0:\r\n #print(li[p-1],li[p+1])\r\n #print(\"!st\")\r\n if li[p+i]+li[p-i]==2:\r\n cnt+=2\r\n elif p+i>n-1 and p-i>=0:\r\n #print(\"2nd\")\r\n if li[p-i]==1:\r\n cnt+=1\r\n elif p+i<=n-1 and p-i<0:\r\n #print(\"#rd\")\r\n if li[p+i]==1:\r\n cnt+=1\r\n #print(cnt)\r\n\r\nprint(cnt)", "n,a = map(int,input().split())\narr = list(map(int,input().split()))\na = a-1\nj = 1\ncount = arr[a]\nfront = 0\nback = 0\nwhile(1):\n k = a-j\n k1 = a+j\n if(k<0 and k1>=n):\n break\n if(k<0):\n front = k1\n break\n if(k1>=n):\n back = k\n break\n if(arr[k]==1 and arr[k1]==1):\n count+=2\n j+=1\nif(front!=0):\n for i in range(front,n):\n count+=arr[i]\nelif(back!=0):\n for i in range(back+1):\n count+=arr[i]\nprint(count)\n\n\n", "n, a = map(int, input().split())\r\n\r\nt = list(map(int, input().split()))\r\n\r\ni,j = a-1,a-1\r\nans = 0\r\nwhile True:\r\n if i>=0 and j< len(t):\r\n if i != j and t[i] == 1 and t[j] == 1:\r\n ans += 2\r\n elif (i == j and t[i] == 1 and t[j] == 1):\r\n ans += 1\r\n if (i<0 and j < len(t) and t[j] ==1) or (i>=0 and j >= len(t) and t[i] ==1):\r\n ans += 1\r\n if i<0 and j>= len(t):\r\n break\r\n i -= 1\r\n j += 1\r\nprint(ans)\r\n\r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 9 16:18:27 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nx = list(map(int,input().split()))\r\nn = x[0]\r\na = x[1]\r\ns = list(map(int,input().split()))\r\nd=0\r\n\r\nmaximo=max(n-a,a-1)\r\n\r\nk = 0\r\ni = 0\r\natual = a-1\r\nwhile i<=maximo:\r\n if i!=0:\r\n if atual-i>=0 and atual+i<=n-1:\r\n if s[atual-i]+s[atual+i]>=2:\r\n k+=s[atual-i]+s[atual+i]\r\n elif atual-i>=0 and atual+i>n-1:\r\n k+=s[atual-i]\r\n elif atual-i<0 and atual+i<=n-1:\r\n k+=s[atual+i]\r\n \r\n else:\r\n k+=s[atual]\r\n i+=1\r\n\r\nprint(k)\r\n \r\n \r\n \r\n ", "#680B (69No. Problem B)\r\nc,p = map(int,input().split())\r\ncrim = list(map(int,input().split()))\r\n# print(crim)\r\nm,n = p-2,p\r\nt,flag = 0,0\r\nif (crim[p-1] == 1):\r\n t+=1\r\nwhile m > -1 or n < c:\r\n # print(m,n) \r\n if (m <= -1):\r\n flag = 1\r\n if (n >= c):\r\n flag = 2 \r\n if (flag == 0):\r\n if (crim[m] == 1 and crim[n] == 1):\r\n t+=2\r\n elif (flag == 1 and crim[n] == 1):\r\n t+=1\r\n elif (flag == 2 and crim[m] == 1):\r\n t+=1\r\n m-=1\r\n n+=1 \r\nprint(t) ", "n, a = map(int, input().split())\r\nt = *map(int, input().split()),\r\nmax_distance = max(a, len(t) - a + 1)\r\na -= 1\r\ncount = 0\r\nif t[a] == 1:\r\n count = 1\r\nfor d in range(1, max_distance):\r\n if a - d >= 0 and a + d < len(t):\r\n if t[a - d] and t[a + d]:\r\n count += 2\r\n elif a - d >= 0:\r\n if t[a - d]:\r\n count += 1\r\n elif a + d < len(t):\r\n if t[a + d]:\r\n count += 1\r\n\r\nprint(count)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # single integer input\r\n return(int(input()))\r\ndef inlt(): # list of integer 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(): # multiple integer variable input\r\n return(map(int,input().split()))\r\n\r\nanswer = 0\r\nn, a = invr()\r\ncriminals = inlt()\r\nmax_dist = max(a, n-a+1)\r\nfor d in range(max_dist):\r\n BCD = []\r\n if d != 0 and a-1-d >= 0:\r\n BCD.append(criminals[a-1-d])\r\n if a-1+d < n :\r\n BCD.append(criminals[a-1+d])\r\n \r\n \r\n if 0 not in BCD:\r\n answer += len(BCD) \r\n\r\nprint(answer)\r\n\r\n\r\n", "n, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.insert(0, 0)\r\ncnt = 0\r\ncnt += arr[a]\r\nk = 1\r\nwhile(a - k >= 1 and a + k <= n):\r\n if((arr[a - k] ^ arr[a + k]) == 0):\r\n cnt += arr[a - k] + arr[a + k]\r\n k += 1\r\nwhile(a - k >= 1):\r\n cnt += arr[a - k]\r\n k += 1\r\nwhile(a + k <= n):\r\n cnt += arr[a + k]\r\n k += 1\r\nprint(cnt)", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\n# Index 0\r\na -= 1\r\n\r\nm = max(a, n - a - 1)\r\n\r\nans = 0\r\nfor i in range(m + 1):\r\n\tif i == 0: \r\n\t\tans += t[a]\r\n\t\tcontinue\r\n\tleft, right = a - i, a + i\r\n\t# print(i)\r\n\tif left < 0:\r\n\t\tans += t[right]\r\n\telif right >= n:\r\n\t\tans += t[left]\r\n\t# Implies both in range\r\n\telse:\r\n\t\tcount = t[left] + t[right]\r\n\t\tif count == 2: ans += count\r\n\r\nprint(ans)\r\n", "\"\"\"\n680B | Bear and Finding Criminals: constructive algorithms, implementation\n\"\"\"\n\ndef bear_and_finding_criminals():\n n, a = map(int, input().split(' '))\n t = list(map(int, input().split(' ')))\n c = sum(t)\n m = min(len(t[:a - 1]), len(t[a:]))\n for i in range(m):\n if t[a - 2 - i] + t[a + i] == 1:\n c -= 1\n print(c)\n\n\nif __name__ == '__main__':\n bear_and_finding_criminals()", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ns = []\r\nl = 0\r\nfor i in range(n):\r\n if t[i] == 1:\r\n s.append(i+1)\r\nfor i in range(1, n):\r\n if a-i in s and a+i in s:\r\n l+=2\r\n if a+i in s and a-i<=0:\r\n l+=1\r\n if a-i in s and a+i>=n+1:\r\n l+=1\r\nprint(l+int(t[a-1]==1))\r\n", "n,a=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nind=a-1\r\ncnt=0\r\nif arr[ind]==1: cnt+=1\r\nfor i in range(1,n):\r\n left=ind-i\r\n right=ind+i\r\n if left>=0 or right<n:\r\n if left>=0 and right<n:\r\n if arr[right]==1 and arr[left]==1: cnt+=2\r\n elif left>=0:\r\n if arr[left]==1:\r\n cnt+=1\r\n elif right<n:\r\n if arr[right]==1:\r\n cnt+=1\r\nprint(cnt)", "n, a = map(int, input().split())\nc = list(map(int, input().split()))\n\na -= 1\nans = 0\nctr = 1\nif (c[a] == 1):\n ans += 1\nwhile (ctr <= a and ctr<=(n-a-1)):\n if (c[a-ctr] == c[a+ctr] and c[a-ctr] == 1):\n ans += 2\n ctr += 1\n\nwhile (ctr <= n-a-1):\n if (c[a+ctr] == 1):\n ans += 1\n ctr += 1\n\nwhile (ctr <= a):\n if (c[a-ctr] == 1):\n ans += 1\n ctr += 1\n\nprint(ans)", "n,a = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\na-=1\r\nans = 0\r\nfor i in range(n):\r\n if i+a>=n and a-i<0:\r\n break\r\n elif i+a<n and a-i>=0:\r\n if arr[i+a]==1 and arr[a-i]==1:\r\n if i+a!=a-i:\r\n ans+=2\r\n else:\r\n ans+=1\r\n elif i+a<n:\r\n if arr[a+i]==1:\r\n ans+=1\r\n elif a-i>=0:\r\n if arr[a-i]==1:\r\n ans+=1\r\nprint(ans)", "n, a = map(int, input().split())\r\ndata = [0] + list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(min(a, n - a + 1)):\r\n if data[a - i] == data[a + i] == 1:\r\n cnt += 1 if i == 0 else 2\r\n\r\nif a > n - a + 1:\r\n cnt += data[:a - (n - a + 1) + 1].count(1)\r\nelse:\r\n cnt += data[a * 2:].count(1)\r\n\r\nprint(cnt)", "def numCriminals(start, cities):\r\n i = start-1; j = start+1;\r\n numCriminals = cities[start]\r\n while i >= 0 or j < len(cities):\r\n bcd = 0; numCities = 0\r\n if i >= 0:\r\n bcd += cities[i]\r\n numCities += 1\r\n if j < len(cities):\r\n bcd += cities[j]\r\n numCities += 1\r\n\r\n if bcd == numCities:\r\n numCriminals += bcd\r\n i -= 1\r\n j += 1\r\n return numCriminals\r\nn, start = list(map(int, input().split(' ')))\r\ncities = list(map(int, input().split(' ')))\r\nprint(numCriminals(start-1, cities))\r\n", "ll=lambda:map(int,input().split())\r\nt=lambda:int(input())\r\nss=lambda:input()\r\nlx=lambda x:map(int,input().split(x))\r\nyy=lambda:print(\"YES\")\r\nnn=lambda:print(\"NO\")\r\nfrom math import log10 ,log2,ceil,factorial as fac,gcd,inf\r\n#from itertools import combinations_with_replacement as cs \r\n#from functools import reduce\r\n#from bisect import bisect_right as br,bisect_left as bl\r\n#from collections import Counter\r\n#from math import inf\r\n\r\n\r\n\r\n#for _ in range(t()):\r\ndef f():\r\n \r\n n,m=ll()\r\n a=list(ll())\r\n m-=1\r\n i=m-1\r\n j=m+1\r\n \r\n c=a[m]\r\n while i>=0 and j<n:\r\n if a[i]==1 and a[j]==1:\r\n c+=2\r\n i-=1\r\n j+=1\r\n \r\n while j<n:\r\n if a[j]:\r\n c+=1\r\n j+=1\r\n\r\n while i>=0:\r\n if a[i]:\r\n c+=1\r\n i-=1\r\n print(c)\r\n \r\n \r\nf()\r\n\r\n'''\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n'''\r\n", "# B 680 - Bear and Finding Criminals - Codeforces\r\n# Link : https://codeforces.com/contest/680/problem/B\r\n\r\n\r\nnumberOfCities, bearIndex = list(map(int, input().split()))\r\n\r\nbearIndex -= 1\r\n\r\ncriminals = list(map(int, input().split()))\r\n\r\nnumberOfCatched = 0\r\n\r\nif criminals[bearIndex] == 1:\r\n numberOfCatched += 1\r\n\r\nfor i in range(1, numberOfCities):\r\n if ((bearIndex + i <= numberOfCities-1) and criminals[bearIndex + i] == 1) and ((bearIndex - i >= 0) and criminals[bearIndex - i] == 1):\r\n numberOfCatched += 2\r\n elif ((bearIndex + i > numberOfCities-1)) and ((bearIndex - i >= 0) and criminals[bearIndex - i] == 1):\r\n numberOfCatched += 1\r\n elif ((bearIndex + i <= numberOfCities-1) and criminals[bearIndex + i] == 1) and ((bearIndex - i < 0)):\r\n numberOfCatched += 1\r\n\r\nprint(numberOfCatched)\r\n", "def bcd(n, a, t):\n distance = 1\n bears = t[a] # 0 or 1\n while distance < n:\n right_oob_flag = False\n left_oob_flag = False\n bears_on_level = 0\n\n if a - distance >= 0:\n bears_on_level += t[a-distance]\n else:\n left_oob_flag = True\n\n if a + distance < n:\n bears_on_level += t[a+distance]\n else:\n right_oob_flag = True\n\n if bears_on_level == 2:\n bears += 2\n elif bears_on_level == 1 and (right_oob_flag or left_oob_flag):\n bears += 1\n\n distance += 1\n\n return bears\n\ndef main():\n first_line = input()\n first_line = first_line.split(' ')\n n = int(first_line[0]) # len of t\n a = int(first_line[1]) - 1 # index of home city\n second_line = input()\n t = [int(x) for x in second_line.split(' ')]\n\n bears = bcd(n, a, t)\n print(bears)\n\n\nif __name__ == '__main__':\n main()\n \t\t\t \t\t \t\t\t \t\t \t\t\t\t\t \t\t\t\t \t\t", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nif l[m-1]==1:\r\n\tc=1\r\na=min(m-1,n-m)\r\nfor i in range(1,a+1):\r\n\tif l[m-i-1]==l[m-1+i]==1:\r\n\t\tc+=2\r\nif a==m-1:\r\n\tc+=l[m+a:].count(1)\r\nelse:\r\n\tc+=l[:m-a-1].count(1)\r\nprint(c)", "a,n=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nNbC=0\r\nfor i in range(a):\r\n D=abs(n-1-i)\r\n if n-1>i:\r\n if t[i] and n-1+D<a and t[n-1+D]:\r\n NbC+=1\r\n elif t[i] and (n-1+D>=a or i==n-1):\r\n NbC+=1\r\n else:\r\n if t[i] and n-1-D>-1 and t[n-1-D]:\r\n NbC+=1\r\n elif t[i] and (n-1-D<0 or i==n-1):\r\n NbC+=1\r\nprint(NbC)", "n,a=map(int,input().split())\r\nt=list(map(int,input().split()))\r\na=a-1\r\nif t[a]==1:\r\n c=1\r\nelse:\r\n c=0\r\nm=min(a,n-1-a)\r\n\r\nfor i in range(1,m+1):\r\n if(t[a-i]==t[a+i]==1):\r\n c=c+2\r\ndel t[a-m:a+m+1]\r\n\r\nc=c+sum(t)\r\nprint(c)", "R = lambda: map(int, input().split())\r\nL = lambda: list(R())\r\n\r\nn,p = R()\r\nl=L()\r\nans = l[p-1]\r\ni,j=p-2,p\r\nwhile i >= 0 and j < n :\r\n if l[i] == l[j] == 1 : ans+=2\r\n i-=1\r\n j+=1\r\nans+=sum(l[0:i+1])+sum(l[j:n])\r\nprint(ans)", "\r\nn, a = list(map(int, input().split()))\r\n\r\nt = list(map(int, input().split()))\r\n\r\na -=1\r\n\r\nans = t[a]\r\n\r\ni=a-1\r\nj=a+1\r\n\r\nwhile(i >= 0 and j < n):\r\n sum = t[i]+t[j]\r\n if(sum==2):\r\n ans += 2\r\n i-=1\r\n j+=1\r\n\r\nif(i==-1):\r\n for k in range(j, n):\r\n ans += t[k]\r\n\r\nif(j==n):\r\n for k in range(i, -1, -1):\r\n ans += t[k]\r\n\r\nprint(ans)\r\n\r\n\r\n", "line2=input()\r\nline2=line2.split()\r\nn=int(line2[0])\r\nk=int(line2[1])\r\nline3=input()\r\nline3=line3.split()\r\nlist0=[]\r\nfor i in range(n):\r\n op=int(line3[i])\r\n list0.append(op)\r\n\r\ni=k-1\r\np=0\r\ns=0\r\nu=1\r\nif(list0[i]==1):\r\n s=1\r\nwhile(p==0):\r\n if(i-u>=0):\r\n if(list0[i-u] ==1):\r\n if(i+u<n):\r\n if(list0[i+u]==1):\r\n s=s+2\r\n else:\r\n s=s+1\r\n \r\n\r\n elif(i+u<n):\r\n if(list0[i+u]==1):\r\n \r\n s=s+1\r\n u=u+1\r\n if(i-u<0 and i+u>=n):\r\n p=1\r\nprint(s) ", "def main(arr,a):\r\n \r\n a-=1\r\n ans=1 if arr[a] else 0\r\n n=len(arr)\r\n if a<=n//2:\r\n for i in range(a+1,len(arr)):\r\n \r\n dist=i-a\r\n c=0\r\n if a-dist>=0:\r\n \r\n c+=arr[a-dist] \r\n c+=arr[i]\r\n if c==2:\r\n ans+=2\r\n else:\r\n ans+=arr[i] \r\n else:\r\n for i in range(a-1,-1,-1):\r\n \r\n dist=a-i\r\n c=0\r\n if a+dist<n:\r\n c+=arr[a+dist] \r\n c+=arr[i]\r\n if c==2:\r\n ans+=2\r\n \r\n else:\r\n ans+=arr[i]\r\n \r\n return ans \r\n \r\nn,a=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nprint(main(arr,a))\r\n \r\n ", "a,b = map(int,input().split())\r\narray = list(map(int,input().split()))\r\nb-=1\r\nl = r = b\r\nans = 0\r\nwhile l>-1 and r<a:\r\n if array[l]+array[r]==2:\r\n if l==r:\r\n ans+=1\r\n else:\r\n ans+=2\r\n l-=1\r\n r+=1\r\nif l==-1:\r\n ans+=sum(array[r:])\r\nelse:\r\n ans+=sum(array[:l+1])\r\nprint(ans)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc = 0\r\nm -= 1\r\nidk = 0\r\nwhile m-idk >= 0 or m+idk < n:\r\n if a[m] == 1 and idk == 0:\r\n c += 1\r\n elif m-idk >= 0 and m+idk < n:\r\n if a[m-idk] == 1 and a[m+idk] == 1:\r\n c += 2\r\n elif m-idk >= 0 and m+idk >= n:\r\n if a[m-idk] == 1:\r\n c += 1\r\n elif m+idk < n and m-idk < 0:\r\n if a[m+idk] == 1:\r\n c += 1\r\n idk += 1\r\n \r\nprint(c)\r\n \r\n ", "n, a = [int(x) for x in input().split()]\r\nt = [1] + [int(x) for x in input().split()] + [1]\r\n\r\nl = a - 1\r\nr = a + 1\r\n\r\nans = t[a]\r\n\r\nwhile l > 0 or r <= n:\r\n if t[l] == 1 and t[r] == 1:\r\n ans += 2\r\n if l == 0 or r == n + 1:\r\n ans -= 1\r\n\r\n if l > 0:\r\n l -= 1\r\n if r <= n:\r\n r += 1\r\n\r\nprint(ans)\r\n", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\nimport bisect\r\n\r\nn,a=R()\r\n\r\nol=L()\r\ncnt=0\r\n\r\nfor i in range(n):\r\n if i>0 and a-i>=1 and a+i<=n:\r\n cnt+=2*(ol[a-i-1]+ol[a+i-1]==2)\r\n\r\n if i>0 and a-i<1 and a+i<=n:\r\n cnt+=(ol[a+i-1]==1)\r\n\r\n if i>0 and a-i>=1 and a+i>n:\r\n cnt+=(ol[a-i-1]==1)\r\n\r\n if i==0 and ol[a-1]==1:\r\n cnt+=1\r\n \r\nprint(cnt)", "def start():\r\n n,a = map(int, input().split())\r\n count = 0\r\n a -= 1\r\n arr =[int(item) for item in input().split()]\r\n i = a -1\r\n j = a +1\r\n if arr[a] == 1:\r\n count += 1\r\n while (True) :\r\n\r\n if i < 0 and j >= len(arr):\r\n break\r\n elif i >= 0 and j < len(arr) :\r\n if arr[i] == 1 and arr[j] == 1:\r\n count += 2\r\n i = i - 1\r\n j = j + 1\r\n\r\n elif i < 0 and j < len(arr) :\r\n if arr[j] == 1 :\r\n count += 1\r\n j = j +1\r\n\r\n elif j >= len(arr) and i >= 0 :\r\n if arr[i] == 1 :\r\n count += 1\r\n i = i-1\r\n print(count)\r\n\r\nif __name__ == '__main__':\r\n start()", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ni, j = a - 1, a - 1\r\nans = 0\r\nwhile i >= 0 and j < n:\r\n if t[i] == 1 and t[j] == 1:\r\n if i == j:\r\n ans += 1\r\n else:\r\n ans += 2\r\n i -= 1\r\n j += 1\r\nwhile i >= 0:\r\n if t[i] == 1:\r\n ans += 1\r\n i -= 1\r\nwhile j < n:\r\n if t[j] == 1:\r\n ans += 1\r\n j += 1\r\nprint(ans)", "a,n = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nd,n=0,n-1\r\nr=0\r\nfor i in range(a):\r\n if n-d<0:\r\n r+=c[n+d:].count(1)\r\n break\r\n elif n+d>=a:\r\n r+=c[:n-d+1].count(1)\r\n break\r\n if c[n+d] + c[n-d] == 2 and d:\r\n d+=1\r\n r+=2\r\n elif not d:\r\n d+=1\r\n r+=c[n]\r\n else:\r\n d+=1\r\nprint(r)", "n , k= map(int,input().split())\r\ncity = list(map(int,input().split()))\r\nk-=1\r\nl = 0\r\nr = n-1\r\ncrim = 0\r\nwhile(l <= r):\r\n dif_r = r - k\r\n dif_l = k - l\r\n if dif_r == dif_l:\r\n if city[l] == city[r] == 1 and l==r:\r\n crim+=1\r\n elif city[l] == city[r] == 1:\r\n crim+=2\r\n l+=1\r\n r-=1\r\n elif dif_r > dif_l:\r\n if city[r] == 1:\r\n crim+=1\r\n r-=1\r\n elif dif_r < dif_l:\r\n if city[l] == 1:\r\n crim+=1\r\n l+=1\r\nprint(crim)", "number, place = [int(i) for i in input().split()]\r\nplace -= 1\r\ncities = [int(i) for i in input().split()]\r\ncriminals = 0\r\nfor i in range(number):\r\n if place - i >= 0 and place + i < number:\r\n if cities[place - i] == 1 and cities[place + i] == 1:\r\n criminals += 2\r\n elif place - i >= 0:\r\n if cities[place - i] == 1:\r\n criminals += 1\r\n elif place + i < number:\r\n if cities[place + i] == 1:\r\n criminals += 1\r\nif cities[place] == 1:\r\n criminals -= 1\r\nprint(criminals)", "n, a = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nd = 0\r\nans = 0\r\nwhile a + d - 1 < n or a - d - 1 >= 0:\r\n\tif d == 0:\r\n\t\tif lst[a - 1] == 1:\r\n\t\t\tans += 1\r\n\telse:\r\n\t\tleft = a - d - 1\r\n\t\tright = a + d - 1\r\n\t\tif left < 0 and right < n and lst[right] == 1:\r\n\t\t\tans += 1\r\n\t\telif right >= n and left >= 0 and lst[left] == 1:\r\n\t\t\tans += 1\r\n\t\telif right < n and left >= 0 and lst[left] == lst[right] and lst[left] == 1:\r\n\t\t\tans += 2\r\n\td += 1\r\nprint(ans)", "n, a = [int(x) for x in input().split()]\n\nts = [int(x) for x in input().split()]\n\n\ndef f(a, ts):\n\n res = 0\n # 1-index\n a -= 1\n\n for d in range(max(len(ts) - a, a+1)):\n\n l = a - d\n r = a + d\n \n if l == r:\n res += ts[a]\n continue\n\n if l >= 0:\n lv = ts[l]\n else:\n lv = -1\n\n if r < len(ts):\n rv = ts[r]\n else:\n rv = -1\n\n if lv + rv == 2:\n res += 2\n elif lv == -1 and rv == -1:\n continue\n elif lv == -1:\n res += rv\n elif rv == -1:\n res += lv\n\n return res\n\nprint(f(a, ts))\n", "n, a = [int(i) for i in input().split()]\r\nbcd = [int(i) for i in input().split()]\r\n\r\n\r\ncount = 0\r\n\r\np1 = a - 1\r\np2 = a - 1\r\nwhile p1 > -1 and p2 < n:\r\n if p1 == p2 and bcd[p1] == 1:\r\n count += 1\r\n elif bcd[p1] == bcd[p2] and bcd[p1] == 1:\r\n count += 2\r\n # print(p1, p2, count)\r\n p1 -= 1\r\n p2 += 1\r\nif p1 == -1 and p2 != n:\r\n count += sum(bcd[p2:])\r\nelif p1 != -1 and p2 == n:\r\n count += sum(bcd[:p1 + 1])\r\nprint(count)", "n = input()\r\nn = n.split(\" \")\r\nl = input()\r\nl = l.split(\" \")\r\ni = int(n[1])-1\r\nlow = i\r\nhigh = i\r\ncount = 0\r\n \r\nwhile high<=int(n[0])-1 and low>=0:\r\n if int(l[low])+int(l[high])==1:\r\n count+=1\r\n \r\n high+=1\r\n low-=1\r\n \r\nsummer = 0\r\nfor i in range(len(l)):\r\n summer += int(l[i])\r\n\r\nprint(summer - count)", "n, a = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\ncount = 0\r\n\r\nif a == 1 or a == n:\r\n for i in range(n):\r\n if l[i] == 1:\r\n count += 1\r\nelif a - 1 < n - a:\r\n for i in range(1, a):\r\n if l[a-i-1] == 1 and l[a+i-1] == 1:\r\n count += 2\r\n for j in range(2*a-1, n):\r\n if l[j] == 1:\r\n count += 1\r\n if l[a-1] == 1:\r\n count += 1\r\nelse:\r\n for i in range(1, n-a+1):\r\n if l[a-i-1] == 1 and l[a+i-1] == 1:\r\n count += 2\r\n for j in range(2*a-n-1):\r\n if l[j] == 1:\r\n count += 1\r\n if l[a-1] == 1:\r\n count += 1\r\nprint(count)", "n,a1=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=j=a1-1\r\ncount=0\r\nif a[i]==1:\r\n count+=1 \r\ni-=1\r\nj+=1\r\nwhile i>=0 and j<len(a):\r\n if a[i]==1 and a[j]==1:\r\n count+=2\r\n i-=1 \r\n j+=1\r\nwhile j<len(a):\r\n if a[j]==1:\r\n count+=1\r\n j+=1 \r\n \r\nwhile i>=0:\r\n if a[i]==1:\r\n count+=1\r\n i-=1 \r\n \r\nprint(count)", "n , k = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\ncnt = 0\r\nk -= 1\r\nfor i in range(0, len(arr)):\r\n if arr[i] == 1:\r\n if i == k:\r\n cnt += 1\r\n elif k > i:\r\n if k + (k - i) >= n:\r\n cnt += 1\r\n else:\r\n cnt += 2 * arr[k + (k - i)]\r\n arr[k + (k - i)] = 0\r\n else:\r\n if k - (i - k) < 0:\r\n cnt += 1\r\n else:\r\n cnt += 2 * arr[k - (i - k)]\r\n arr[k - (k - i)] = 0\r\n arr[i] = 0\r\nprint(cnt)\r\n", "# -- B. Bear and Finding Criminals --\n# n, a = map(int, input().split())\n# cities = [int(x) for x in input().split()]\n\n# a -= 1\n# criminals = 1 if cities[a] == 1 else 0\n# k = 1\n# while a+k < n and a-k >= 0:\n# if (cities[a+k] + cities[a-k]) == 2:\n# criminals += 2\n# k += 1\n# if a+k == n:\n# rem = cities[:a-k+1]\n# if a-k < 0:\n# rem = cities[a+k:]\n# # print()\n# for city in rem:\n# if city == 1:\n# criminals += 1\n# print(criminals)\n\n#######\nn, a = map(int, input().split())\ncities = [int(x) for x in input().split()]\ncriminals = 1 if cities[a-1] == 1 else 0\n\nif n % 2 != 0:\n mid = n//2 + 1\n if a > mid:\n cities = cities + [3]*(2*a-n-1)\n if a < mid:\n cities = [3]*(n+1-2*a) + cities\nelse:\n mid = n//2\n if a > mid:\n cities = cities + [3]*(2*a-n-1)\n else:\n cities = [3]*(n+1-(2*a)) + cities\n\nk = 1\na = len(cities)//2\nwhile a+k < len(cities):\n if (cities[a+k] + cities[a-k]) == 2:\n criminals += 2\n if (cities[a+k] + cities[a-k]) == 4:\n criminals += 1\n k += 1\n\nprint(criminals)\n", "n, a = map(int, input().split())\r\nar = list(map(int, input().split()))\r\n\r\nl = r = a-1\r\nc = 0\r\nwhile l >= 0 and r < n:\r\n if ar[l] == ar[r] == 1:\r\n c += 1\r\n if l != r:\r\n c += 1\r\n l -=1\r\n r += 1\r\n\r\nfor i in range(r, n):\r\n if ar[i] == 1:\r\n c += 1\r\n\r\nfor i in range(l, -1, -1):\r\n if ar[i] == 1:\r\n c += 1\r\n\r\n\r\nprint(c)\r\n", "n , k = list(map(int,input().split()))\r\nls = list(map(int,input().split()))\r\nk=k-1\r\nl=k-1\r\nr=k+1\r\nif ls[k]==1:\r\n res=1\r\nelse:\r\n res=0\r\nwhile l>=0 or r <len(ls):\r\n \r\n if l >=0:\r\n vall=ls[l]\r\n else:\r\n vall=-2\r\n if r<len(ls):\r\n valr=ls[r]\r\n else:\r\n valr=-2\r\n if vall+valr==2:\r\n res+=2\r\n elif vall+valr==-1:\r\n res+=1\r\n l=l-1\r\n r=r+1\r\nprint(res)", "n,p=(int(x) for x in input().split())\r\ncount=0\r\nch=0\r\nch2=0\r\nx=input()\r\nc=[0]*(n+1)\r\nc[1:]=[int(x) for x in x.split()]\r\n\r\nif c[p]==1:\r\n count+=1\r\nfor d in range(1,n):\r\n ch=0\r\n ch2=0\r\n if p+d<=n:\r\n ch2 += 1\r\n if c[p+d]==1:\r\n ch+=1\r\n\r\n\r\n if p-d>0:\r\n ch2 += 1\r\n if c[p-d]==1:\r\n ch+=1\r\n\r\n\r\n if ch==1 and ch2==1 :\r\n count+=1\r\n elif ch==2 and ch2==2:\r\n count+=2\r\n\r\n\r\nprint(count) \r\n\r\n", "[n, k] = [int(i) for i in input().split(' ')]\r\n\r\narr = [int(i) for i in input().split(' ')]\r\n\r\nl = k - 1\r\nr = k + 1\r\nres = arr[k-1]\r\n\r\nwhile l >= 1 or r <= n:\r\n\tif (l == 0):\r\n\t\tres += arr[r-1]\r\n\t\tr += 1\r\n\telif (r == n+1):\r\n\t\tres += arr[l-1]\r\n\t\tl -= 1\r\n\telif arr[l-1] == arr[r-1]:\r\n\t\tres += arr[l-1]*2\r\n\t\tl -= 1\r\n\t\tr += 1\r\n\telse:\r\n\t\tl -= 1\r\n\t\tr += 1\r\n\r\nprint(res)", "n, a = [int(x) for x in input().split()]\r\ncriminals = [int(x) for x in input().split()]\r\n#bcd\r\ncaught = 0\r\na = a-1\r\nif criminals[a] == 1:\r\n caught += 1\r\ni = 1\r\nif len(criminals) > 1:\r\n while a-i >=0 or a+i<n:\r\n if a-i>=0 and a+i<n:\r\n if criminals[a-i] ==1 and criminals[a+i] ==1:\r\n caught += 2\r\n if a+i >=n:\r\n if criminals[a-i] == 1:\r\n caught += 1\r\n if a-i <0:\r\n if criminals[a+i] == 1:\r\n caught += 1\r\n i+=1\r\nprint(caught)", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline()\n\nn, a = tuple([int(x) for x in input().strip().split(' ')])\n\n\ntowns = [0] + [int(x) for x in input().strip().split(' ')]\n\nanswer = 0\n\nfor i in range(1, n+1):\n\tif not towns[i]: continue\n\n\td = i - a\n\tj = a - d\n\n\tif j < 1 or j > n or towns[i] == towns[j]:\n\t\tanswer += 1\n\nprint(answer)\n\n\n\n\n\n\n\n\n\n\n\n\n\t\n\n\n\n\t\t\n\n\t\t\n\n", "n,a=map(int,input().split())\r\ns1=list(map(int,input().split()))\r\ndist=[]\r\nfor i in range(n):\r\n dist.append([i+1,abs(a-i-1),s1[i]])\r\n \r\n \r\ndist1=[] \r\nfor i in range(n):\r\n if(dist[i][2]==0):\r\n p=dist[i][1]\r\n for j in range(n):\r\n if(dist[j][1]==p):\r\n if(dist[i] not in dist1):\r\n dist1.append(dist[i])\r\n if(dist[j] not in dist1):\r\n dist1.append(dist[j])\r\n \r\n \r\n\r\n \r\n\r\nprint(len(dist)-len(dist1))", "n,k=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ntot=0\r\nif c[k-1]==1:\r\n\ttot+=1\r\npivot=k-1\r\n\r\nleft_pointer=k-1\r\nright_pointer=k-1\r\n\r\nwhile left_pointer>0 or right_pointer<n-1:\r\n\tleft_pointer-=1\r\n\tright_pointer+=1\r\n\tif left_pointer>=0 and right_pointer<=n-1:\r\n\t\tif c[left_pointer]==c[right_pointer] and c[left_pointer]==1:\r\n\t\t\ttot+=2\r\n\telif left_pointer<0 and right_pointer<=n-1:\r\n\t\tif c[right_pointer]==1:\r\n\t\t\ttot+=1\r\n\telif left_pointer>=0 and right_pointer>=n:\r\n\t\tif c[left_pointer]==1:\r\n\t\t\ttot+=1\r\n\telse:\r\n\t\tbreak\r\n\t\t\r\n\r\nprint(tot)\r\n\r\n", "n,a=map(int,input().split())\r\nt=list(map(int,input().split()))\r\np,r=a-1,0\r\nfor i in range(0,n):\r\n if t[i]==1:\r\n d=p-i\r\n if p+d>n-1 or p+d<0:r+=1\r\n elif t[p+d]==1:r+=1\r\nprint(r)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer\r\n return(int(input()))\r\ndef inlt(): # list of integer\r\n return(list(map(int,input().split())))\r\ndef insr(): # string\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # multiple integer variables\r\n return(map(int,input().split()))\r\n# position is a, n is number of cities.\r\nn,a = invr()\r\nc = inlt()\r\nmd = max(a-1, n-a)\r\ncaught = 0\r\nfor d in range(md+1):\r\n cities = []\r\n if a - d != a and a - d >= 1:\r\n cities.append(c[a - d - 1])\r\n if a + d <= n:\r\n cities.append(c[a + d - 1])\r\n if 0 not in cities:\r\n caught += len(cities)\r\nprint(caught)", "import pdb\n\ndef solve():\n m, n = map(int, input().split())\n criminals = list(map(int, input().split()))\n l = n - 1\n r = n - 1\n acc = 0\n while l >= 0 or r < len(criminals):\n if l == r:\n acc += criminals[l]\n else:\n if l >= 0 and r < len(criminals):\n if criminals[l] == criminals[r]:\n acc += 2*criminals[l]\n elif l >= 0:\n acc += criminals[l]\n elif r < len(criminals):\n acc += criminals[r]\n l -= 1\n r += 1\n print(acc)\n\nif __name__ == '__main__':\n solve()\n", "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\n# for test in range(int(input())):\r\nn, a = read()\r\nlst = tuple(read())\r\ni = a - 2\r\nj = a\r\nans = int(lst[a - 1] == 1)\r\nwhile i >= 0 and j < n:\r\n if lst[i] == lst[j] == 1:\r\n ans += 2\r\n i -= 1\r\n j += 1\r\n# print(ans)\r\nif i >= 0:\r\n for j in reversed(range(i + 1)):\r\n ans += int(lst[j] == 1)\r\nelse:\r\n for i in range(j, n):\r\n ans += int(lst[i] == 1)\r\nprint(ans)\r\n", "def main():\r\n output = 0\r\n number_of_cities, limak_index = map( int, input().split() )\r\n criminals_per_city = list( map( int, input().split() ) )\r\n\r\n criminals_per_balanced_city, criminals_per_extra_city = splitter(criminals_per_city, number_of_cities, limak_index)\r\n\r\n for i in range( len(criminals_per_balanced_city) // 2 ):\r\n if ( criminals_per_balanced_city[i] == 1 ) and ( criminals_per_balanced_city[ len(criminals_per_balanced_city) - i - 1 ]):\r\n output += 2\r\n\r\n if criminals_per_balanced_city[ ( ( len(criminals_per_balanced_city) + 1 ) // 2) - 1 ] == 1:\r\n output += 1\r\n\r\n output += sum( criminals_per_extra_city )\r\n\r\n print(output)\r\n\r\ndef splitter(criminals_per_city, number_of_cities, limak_index):\r\n criminals_per_balanced_city = []\r\n number_of_balanced_cities = 2 * min(limak_index - 1, number_of_cities - limak_index) + 1\r\n \r\n if limak_index > ( number_of_cities + 1 ) / 2:\r\n for i in range(number_of_balanced_cities):\r\n criminals_per_balanced_city.append( criminals_per_city.pop(-1) )\r\n\r\n else:\r\n for i in range(number_of_balanced_cities):\r\n criminals_per_balanced_city.append( criminals_per_city.pop(0) )\r\n\r\n return criminals_per_balanced_city, criminals_per_city;\r\n\r\nmain()", "n , a = map(int,input().split())\r\nt = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n if a-1+i<=n-1 and a-1-i>=0:\r\n if t[a-1+i] == t[a-1-i] and t[a-1+i] == 1:\r\n if i == 0:\r\n cnt+=1\r\n else:\r\n cnt+=2\r\n elif a-1+i<=n-1 and a-1-i<0:\r\n if t[a-1+i]==1:\r\n cnt+=1\r\n elif a-1+i>n-1 and a-1-i>=0:\r\n if t[a-1-i]==1:\r\n cnt+=1\r\nprint(cnt)", "def solve():\r\n n,a = map(int,input().split())\r\n l=list(map(int,input().split()))\r\n ans=0\r\n a -= 1\r\n for i in range(n):\r\n k = a - i\r\n r = a + i\r\n \r\n if k == r and l[a]:\r\n ans += 1\r\n elif k > -1 and r < n:\r\n if l[k] and l[r]:\r\n ans += 2\r\n elif k > -1:\r\n for j in range(k, -1, -1):\r\n if l[j]:\r\n ans += 1\r\n break\r\n else:\r\n for j in range(r, n):\r\n if l[j]:\r\n ans += 1\r\n break\r\n \r\n print(ans) \r\nif __name__ == '__main__':\r\n solve()", "n,a = map(int,input().split())\r\nA = list(map(int,input().split()))\r\ni=a-1;j=a-1\r\nans = 0\r\nwhile(i>=0 and j<n):\r\n if(A[i]==1 and A[j]==1 and j==i):\r\n ans+=1\r\n i-=1;j+=1\r\n continue\r\n if(A[i]==1 and A[j]==1):\r\n ans+=2\r\n i-=1;j+=1\r\nwhile(i>=0):\r\n ans+=A[i]\r\n i-=1\r\nwhile(j<n):\r\n ans+=A[j]\r\n j+=1\r\nprint(ans)\r\n", "n, a = map(int, input().split())\r\na -= 1\r\narray = list(map(int, input().split()))\r\ncount = 0\r\nif array[a] == 1:\r\n count += 1\r\nflag = True\r\nl, r = a, a\r\nwhile l > 0 or r < n:\r\n if l - 1 > -1 and r + 1 < n:\r\n if array[l - 1] == 1 and array[r + 1] == 1:\r\n count += 2\r\n l -= 1\r\n r += 1\r\n elif l - 1 < 0:\r\n if r + 1 < n: \r\n if array[r + 1] == 1:\r\n count += 1\r\n r += 1\r\n elif r + 1 >= n:\r\n if l - 1 > -1:\r\n if array[l - 1] == 1:\r\n count += 1\r\n l -= 1\r\n else:\r\n l -= 1\r\n r += 1\r\nprint(count)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Aug 13 16:37:01 2022\r\nthinking: 09:14 --> 9:16\r\nimp 9:16 -->\r\n@author: A\r\n\"\"\"\r\nn,a = list(map(int,str.split(input())))\r\nn-=1\r\na-=1\r\nlst_t= list(map(int,str.split(input())))\r\n\r\ncount = 0 \r\nfor i in range(max(n-a,a)+1): #check range\r\n a_pi = False\r\n a_ni = False\r\n if (a+i <= n and lst_t[a+i]==1): \r\n a_pi = True\r\n if (a-i >=0 and lst_t[a-i]==1) :\r\n a_ni = True\r\n \r\n if ((a+i <= n and lst_t[a+i]==1) and a-i <0) or ((a-i >= 0 and lst_t[a-i]==1) and a+i > n ):\r\n count+=1\r\n continue\r\n if a_pi and a_ni:\r\n if i!=0:\r\n count+=2\r\n continue\r\n else:\r\n count+=1\r\nprint(count)\r\n ", "n, a = map(int, input().split())\r\nb = list(map(int, input().split()))\r\n\r\na -= 1\r\n\r\ncount = 0\r\ncount1 = min(a, len(b) - 1 - a)\r\n\r\nif (b[a] == 1):\r\n count = 1\r\n \r\ncount2 = b[a - count1:a]\r\ncount4 = b[a + 1 : a + 1 + count1]\r\n\r\nfor i in range(count1):\r\n if count2[i] == 1 and count4[count1 - i - 1] == 1:\r\n count += 2\r\n \r\ncount += b[0:a - count1].count(1)\r\ncount += b[a + 1 + count1:len(b)].count(1)\r\n\r\nprint(count)", "n,a=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=sum(l)\r\nx=min(a-1,n-a)\r\nfor i in range(1,x+1):\r\n\tif l[a-i-1]+l[a+i-1]==1:\r\n\t\tans-=1\r\nprint(ans)", "_, a = [int(x) for x in input().split(' ')]\r\nt = [int(x) for x in input().split(' ')]\r\n\r\na = a - 1\r\nc, i = t[a], 1\r\n\r\nwhile a - i >= 0 and a + i < len(t):\r\n if t[a + i] == 1 and t[a - i] == 1:\r\n c += 2\r\n \r\n i += 1\r\n\r\nif a - i >= 0:\r\n for j in range(0, a - i + 1):\r\n c += t[j]\r\n\r\nif a + i < len(t):\r\n for j in range(a + i, len(t)):\r\n c += t[j]\r\n\r\nprint(c)\r\n", "n,a=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.insert(0,0)\r\nsum=sum(c)\r\nfor distance in range(1,n+1):\r\n if (distance < a and distance <=n-a) :\r\n if c[a+distance] + c[a-distance] == 1 :\r\n sum-=1\r\n\r\n else : break\r\n\r\n\r\nprint(sum)", "from sys import stdin, stdout\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\n#for _ in range(int(stdin.readline())):\r\nn,a=get_ints()\r\nt=get_array()\r\ni=a-1\r\nj=a-1\r\nc=0\r\nwhile i>=0 or j<n:\r\n if i==j and t[i]==1:\r\n c+=1\r\n elif i>=0 and j<n:\r\n if t[i]==1 and t[j]==1:\r\n c+=2\r\n elif i>=0:\r\n if t[i]==1:\r\n c+=1\r\n elif j<n and t[j]==1:\r\n c+=1\r\n \r\n i-=1\r\n j+=1\r\nprint(c)", "R=lambda:map(int, input().split())\r\nn, a = R()\r\narr = list(R())\r\nans = 0\r\nfor i in range(1, n+1):\r\n if arr[i-1]:\r\n dist = i - a\r\n j = a - dist\r\n if j < 1 or j > n or arr[i-1] == arr[j-1]:\r\n ans += 1\r\nprint(ans)", "n, a = map(int, input().split())\r\ncriminals = list(map(int, input().split()))\r\n\r\nans = 0\r\ncur_sum = 0\r\nok = True\r\n\r\nfor i in range(max(a, n-a+1)):\r\n if a-1 - i >= 0:\r\n if criminals[a-1 - i] == 1:\r\n cur_sum += 1\r\n else:\r\n ok = False\r\n \r\n if i:\r\n if a-1 + i <= n-1:\r\n if criminals[a-1 + i] == 1:\r\n cur_sum += 1\r\n else:\r\n ok = False\r\n else:\r\n ok = False\r\n\r\n if ok:\r\n if cur_sum == 2:\r\n ans += 2\r\n else:\r\n if cur_sum == 1:\r\n ans += 1\r\n\r\n cur_sum = 0\r\n ok = True\r\n\r\nprint(ans)", "n, a = [int(i) for i in input().split()]\nt = [int(i) for i in input().split()]\na -= 1\n\nif a < (n // 2): # closer to the left\n\tleft = t[:a][::-1]\n\tright = t[a+1:2*a+1]\n\texcess = t[2*a+1:]\nelif a == (n // 2): # in the middle\n\tleft = t[:a][::-1]\n\tright = t[a+1:]\n\texcess = []\nelse: # closer to the right\n\tright = t[a+1:]\n\tleft = t[a-len(right):a][::-1]\n\texcess = t[:a-len(right)]\n\t\ncriminals = t[a] + 2*sum([i==1 and j==1 for i, j in zip(left, right)]) + sum(excess)\nprint(criminals)\n \t\t\t \t \t\t \t\t \t \t \t \t \t\t\t", "n, a = map(int, input().split())\r\nt = [int(i) for i in input().split()]\r\nres = 0\r\n\r\na -= 1\r\nfor i in range(n):\r\n l = a - i\r\n r = a + i\r\n\r\n if l == r and t[a]:\r\n res += 1\r\n elif l > -1 and r < n:\r\n if t[l] and t[r]:\r\n res += 2\r\n elif l > -1:\r\n for j in range(l, -1, -1):\r\n if t[j]:\r\n res += 1\r\n break\r\n else:\r\n for j in range(r, n):\r\n if t[j]:\r\n res += 1\r\n break\r\n\r\nprint(res)\r\n", "n, a = map(int, input().split())\nar = list(map(int, input().split()))\ncurr = a - 1\nans = ar[curr]\nleft = curr - 1\nright = curr + 1\nwhile left >= 0 and right <= n - 1:\n if ar[left] + ar[right] == 2:\n ans += 2\n left -= 1\n right += 1\nwhile left >= 0:\n ans += ar[left]\n left -= 1\nwhile right <= n - 1:\n ans += ar[right]\n right += 1\nprint(ans)\n", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline()\n\nn, a = tuple([int(x) for x in input().strip().split(' ')])\n\na -= 1\n\ncriminals = [int(x) for x in input().strip().split(' ')]\n\nd = 0\n\ndistances = {}\n\nwhile a - d >= 0 or a + d <= n-1:\n\tdistances[d] = []\n\n\tif a + d == a - d:\n\t\tdistances[d].append(criminals[a-d])\n\t\td += 1\n\t\tcontinue\n\n\tif a - d >= 0:\n\t\tdistances[d].append(criminals[a-d])\n\n\tif a + d <= n - 1:\n\t\tdistances[d].append(criminals[a+d])\n\n\td += 1\n\ntotal = 0\nfor d in distances:\n\tif sum(distances[d]) == len(distances[d]):\n\t\ttotal += len(distances[d])\n\nprint(total)\n\n\n\n\n\n\n\n\n\t\n\n\n\n\t\t\n\n\t\t\n\n", "def cal (a_comm):\r\n i = len(a_comm)//2\r\n j = 1\r\n criminals_count = 0\r\n if a_comm[i]==1:\r\n criminals_count+=1\r\n while i-j>=0 and i+j<n:\r\n if a_comm[i-j]==1 and a_comm[i+j]==1:\r\n criminals_count+=2\r\n j+=1\r\n else:\r\n j+=1\r\n return criminals_count\r\n\r\nn,a=map(int, input().split())\r\nt = list(map(int, input().split()))\r\ncriminals_count = 0\r\nif a>(n/2):\r\n a_comm = t[(n-(2*(n-a)))-1 : n]\r\n del(t[(n-(2*(n-a)))-1 : n])\r\n criminals_count+=cal(a_comm)\r\n for i in range(len(t)):\r\n if t[i]==1:\r\n criminals_count+=1\r\nelif a <= n/2:\r\n a_comm = t[0 : ((a-1)*2)+1]\r\n del(t[0 : ((a-1)*2)+1])\r\n criminals_count+=cal(a_comm)\r\n for i in range(len(t)):\r\n if t[i]==1:\r\n criminals_count+=1\r\nprint (criminals_count)\r\n", "N,T=map(int,input().split())\r\nQ=list(map(int,input().split()))\r\nB=min(T-1,N-T)\r\nAns=Q[T-1]\r\nfor i in range(B):\r\n if Q[T-1-i-1] == Q[T+i] == 1:\r\n Ans += 2\r\n \r\n#add the extra ones that are out of range of symmetricity wrt b\r\n#we r checking of minimum symmetricity wrt b...ie B..and starting with one element more\r\n#and one element less we check for symmetricity on both sides..till symmetricity exists..\r\n#that is till B....then we add extra elements out of range of symmmetricty\r\nAns += sum(Q[:T-B-1])\r\nAns += sum(Q[T+B:])\r\nprint(Ans)\r\n", "n, a = map(int, input().split())\r\nA = list(map(int, input().split()))\r\na -= 1 \r\nans = A[a]\r\ni = a-1\r\nj = a+1\r\nwhile(i > -1 and j < len(A)):\r\n if A[i] and A[j]:\r\n ans += 2\r\n i -= 1\r\n j += 1\r\n\r\nwhile i > -1:\r\n if A[i]:\r\n ans += 1\r\n i -= 1\r\n\r\nwhile j < n:\r\n if A[j]:\r\n ans += 1\r\n j += 1\r\n\r\nprint(ans)\r\n", "#%%\r\ncons = input().split(\" \")\r\ncons[0] = int(cons[0])\r\ncons[1] = int(cons[1])\r\n\r\nins = list(map(int, input().split(\" \")))\r\ncrims = ins[cons[1] - 1]\r\nleft, right = cons[1] - 2, cons[1]\r\n\r\nwhile left >= 0 and right < len(ins): \r\n\r\n if ins[left] and ins[right]: \r\n crims += (ins[left] + ins[right])\r\n \r\n left -= 1\r\n right += 1\r\n\r\nif left < 0: \r\n crims += sum(ins[right:])\r\n\r\nif right >= len(ins): \r\n crims += sum(ins[:left + 1])\r\n\r\nprint(crims)", "a,n = map(int,input().split())\r\nx=[int(q) for q in input().split()]\r\ni=n-2\r\nj=n\r\nc=0\r\nif x[n-1]==1:\r\n c=1\r\nif x[n-1]==0:\r\n c=0\r\nwhile (i>=0 and j<=a-1):\r\n if x[i]==x[j]==1:\r\n c+=2\r\n i-=1\r\n j+=1\r\n\r\nif i<0:\r\n c+= x[j:].count(1)\r\nif j>a-1:\r\n c+= x[:i+1].count(1)\r\nprint(c)", "def list_input(data):\n\treturn list(map(data, input().strip().split()))\n\ndef single_input(data):\n\treturn map(data, input().strip().split())\n\nn, a = single_input(int)\na -= 1\nl1 = list_input(int)\n\n\nres = 0\n\nif l1[a] == 1:\n\tres += 1\n\nfor i in range(1,n):\n\tcri_coun = 0\n\tflag7 = 0\n\tflag5 = 0\n\tif a+i<n:\n\t\tcri_coun += l1[a+i]\n\t\tflag7 = 1\n\tif a-i>-1:\n\t\tcri_coun +=l1[a-i]\n\t\tflag5 = 1\n\n\tif cri_coun == 2:\n\t\tres += 2\n\n\n\n\telif cri_coun == 1:\n\n\t\tif flag5 == 1 and flag7 == 1:\n\t\t\t# print(i, cri_coun, \"asdas\")\n\t\t\tpass\n\t\telif flag5 == 1 or flag7 == 1:\n\t\t\t# print(i, cri_coun, \"asdaszasdsa\")\n\t\t\tres += 1\n\t# print(i ,res)\nprint(res)", "n,a = map(int,input().split())\r\n\r\nt = list(map(int,input().split()))\r\na = a-1\r\n\r\nl,r = a-1,a+1\r\nc = 0\r\nif t[a] == 1: c+=1\r\nwhile r < n and l >= 0:\r\n if t[l] == 1 and t[r] ==1 :\r\n c+=2\r\n l-=1\r\n r+=1\r\nif l > 0:\r\n while l >= 0:\r\n if t[l] == 1:\r\n c+=1\r\n l-=1\r\nif r:\r\n while r < n:\r\n if t[r] == 1:\r\n c+=1\r\n r+=1 \r\nprint(c) \r\n\r\n", "n, l = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\nc = 1\r\nl -= 1\r\ncount = 0\r\nwhile l - c > -1 and l + c < n:\r\n if arr[l - c] == arr[l + c] == 1:\r\n count += 2\r\n c += 1\r\n\r\nwhile l - c > -1:\r\n count += arr[l - c]\r\n c += 1\r\n\r\nwhile l + c < n:\r\n count += arr[l + c]\r\n c += 1\r\n\r\nprint(count + arr[l])", "import sys\n\nn, a = map(int, sys.stdin.readline().strip().split())\nt = list(map(int, sys.stdin.readline().strip().split()))\na = a - 1\n\nres = 0\nfor i in range(len(t)):\n if (a - i) >= 0 and (a + i) < len(t):\n res += (1 if i == 0 else 2) * (t[a - i] * t[a + i])\n elif not ((a - i) >= 0 or (a + i) < len(t)):\n break\n elif (a - i) < 0:\n res += t[a + i]\n else:\n res += t[a - i]\nprint(res)\n\n\t \t \t \t \t\t\t\t \t\t \t\t\t\t \t \t \t", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=n-k\r\nl=k-1\r\nif a[k-1]==1:\r\n c=1\r\nelse:\r\n c=0\r\nif l<r:\r\n for i in range(1,l+1):\r\n if a[k-i-1]==1 and a[k+i-1]==1:\r\n c+=2\r\n c+=a[(k+l):].count(1)\r\nelif l==r:\r\n for i in range(1,l+1):\r\n if a[k-i-1]==1 and a[k+i-1]==1:\r\n c+=2\r\nelse:\r\n for i in range(1,r+1):\r\n if a[k-i-1]==1 and a[k+i-1]==1:\r\n c+=2\r\n c+=a[:(k-r-1)].count(1)\r\nprint(c) \r\n \r\n ", "n, a = map(int, input().split())\r\nt = [0]+[*map(int, input().split())]\r\n\r\nr, ans = 0, 0\r\nwhile a-r >= 1 or a+r <= n:\r\n if a-r < 1: ans += t[a+r]\r\n elif a+r > n: ans += t[a-r]\r\n elif t[a+r] + t[a-r] == 2:\r\n ans += 2 - (r == 0)\r\n r += 1\r\n\r\nprint(ans)", "n,a = map(int, input().split())\r\ncities = list(map(int, input().split()))\r\n\r\na-=1\r\n\r\ncriminals =0\r\n\r\nif cities[a] ==1:\r\n criminals +=1\r\n\r\nright = a+1\r\nleft = a-1\r\n\r\nwhile(True):\r\n if right < n and left >=0:\r\n if cities[right] == 1 and cities[left] ==1:\r\n criminals+=2\r\n else:\r\n if right >= n and left <0:\r\n break\r\n if right < n and cities[right] ==1:\r\n criminals+=1\r\n elif left >=0 and cities[left] ==1:\r\n criminals+=1\r\n right+=1\r\n left-=1\r\n\r\nprint(criminals)", "n,a=map(int,input().split())\r\ncities=[int(i) for i in input().split()]\r\n#print(n,a,cities)\r\ncriminal=0\r\n \r\nif cities[a-1] == 1:\r\n criminal+=1\r\nfor j in range(1,max([(a-1),(n-1)-(a-1)])+1):\r\n if (a-1)-j>=0 and (a-1)+j<=(n-1):\r\n if cities[(a-1)-j]==1 and cities[(a-1)+j]==1:\r\n criminal+=2\r\n else:\r\n if ((a-1)-j<0 and (a-1)+j<=(n-1) and cities[(a-1)+j]==1) or ((a-1)-j>=0 and (a-1)+j>(n-1) and cities[(a-1)-j]==1):\r\n criminal+=1\r\nprint(criminal)", "n,a=map(int,input().split())\r\nn-=1\r\na-=1\r\nc=0\r\nt=list(map(int,input().split()))\r\nfor i in range(1000000):\r\n x=0\r\n if i ==0:\r\n x+=t[a]\r\n if x==1:\r\n c+=1\r\n elif (a-i)>=0 and (i+a)<=n:\r\n x+=t[abs(i-a)]\r\n x+=t[i+a]\r\n if x==2:\r\n c+=2 \r\n elif (a-i)<0 and (i+a)<=n:\r\n x+=t[i+a]\r\n if x==1:\r\n c+=1\r\n elif (a-i)>=0 and (i+a)>n:\r\n x+=t[abs(i-a)]\r\n if x==1:\r\n c+=1\r\n elif (a-i)<0 and (i+a)>n:\r\n break \r\nprint(c)", "n, a = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nnodes_right = n - a\r\nnodes_left = a - 1\r\nleft = a - 2\r\nright = a\r\nmin_dist = min(nodes_left,nodes_right)\r\n#print(min_dist)\r\nif arr[a-1] == 1:\r\n count = 1\r\nelse:\r\n count = 0\r\nwhile min_dist > 0:\r\n if arr[left] == 1 and arr[right] == 1:\r\n count += 2\r\n left -= 1\r\n right += 1\r\n min_dist -= 1\r\n#print(count)\r\n#print(left,right)\r\nwhile left >= 0:\r\n if arr[left] == 1:\r\n count += 1\r\n left -= 1\r\nwhile right < n:\r\n if arr[right] == 1:\r\n count += 1\r\n right += 1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Mar 5 16:32:40 2020\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\n\r\n#https://codeforces.com/problemset/problem/680/B\r\n\r\ndef criminal_city():\r\n cities = input().split()\r\n criminals = input().split()\r\n cities[1] = int(cities[1]) - 1\r\n cities.append(int(cities[1]))\r\n \r\n if cities[1] == 0:\r\n output = 0\r\n for i in range(len(criminals)):\r\n if int(criminals[i]) == 1:\r\n output += 1\r\n print(output)\r\n return\r\n else:\r\n output = 0\r\n distance = 0\r\n left = right = True\r\n if int(criminals[cities[1]]) == 1:\r\n output += 1\r\n while left or right:\r\n distance += 1\r\n detector = 0\r\n if (cities[1]-1) < 0:\r\n left = False\r\n else:\r\n if int((criminals[cities[1]-1])) == 1:\r\n detector += 1\r\n if (cities[2]+1) >= len(criminals):\r\n right = False\r\n else:\r\n if int((criminals[cities[2]+1])) == 1:\r\n detector += 1\r\n \r\n cities[1] -= 1\r\n cities[2] += 1\r\n \r\n if detector != 0:\r\n if detector == 2 and left and right:\r\n output += 2\r\n elif detector == 1 and left and not right:\r\n output += 1\r\n elif detector == 1 and not left and right:\r\n output += 1\r\n print(output)\r\n return\r\n\r\ncriminal_city()\r\n \r\n \r\n \r\n \r\n \r\n ", "\r\n# Problem: B. Bear and Finding Criminals\r\n# Contest: Codeforces - Codeforces Round #356 (Div. 2)\r\n# URL: https://codeforces.com/contest/680/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,a = get_ints()\r\narr = get_ints()\r\ncurr = a-1\r\ns =0 \r\nif arr[curr] ==1:\r\n\ts+=1\r\nm = min(len(arr[:curr]),len(arr[curr+1:]))\r\nfor i in range(1,m+1):\r\n\ta,b = arr[curr-i],arr[curr+i]\r\n\tif a ==1 and b==1:\r\n\t\ts+=2\r\n\r\ns+= max(sum(arr[:curr-m]),sum(arr[curr+m+1:]))\r\nprint(s)", "n, a = (int(i) for i in input().split())\nt = [int(i) for i in input().split()]\nres, lo, hi = 0, a - 1, a - 1\nwhile lo >= 0 or hi < n:\n if lo >= 0 and hi < n:\n res += 1 + (lo != hi) if t[lo] == t[hi] == 1 else 0\n lo, hi = lo - 1, hi + 1\n elif lo >= 0:\n res += t[lo] == 1\n lo -= 1\n else:\n res += t[hi] == 1\n hi += 1\nprint(res)\n", "arr = list(map(int,input().split()))\r\n\r\nn = arr[0]\r\nloc = arr[1]\r\n\r\n\r\ncriminals = 0\r\nind = loc -1\r\n\r\nli = list(map(int,input().split()))\r\n\r\n\r\nf = min(ind,n-1-ind)\r\n\r\n\r\n\r\nif li[ind] == 1:\r\n criminals+=1\r\n li[ind] = \"x\"\r\n\r\n\r\nfor i in range(1,f+1):\r\n\r\n if li[ind+i] == 1 and li[ind-i] == 1:\r\n criminals+=2\r\n li[ind+i] = \"x\"\r\n li[ind-i] = \"x\"\r\n else:\r\n li[ind+i] = \"x\"\r\n li[ind-i] = \"x\"\r\n \r\n\r\nfor i in li:\r\n\r\n if i == 1:\r\n criminals+=1\r\n \r\n\r\n\r\n\r\n\r\nprint(criminals)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, a = map(int, input().split())\r\ncriminals = list(map(int, input().split()))\r\ncriminals.insert(0,0)\r\ncatchedCriminals = criminals.count(1)\r\n\r\ndistance = 1\r\nwhile(distance < a and distance <= n-a):\r\n if(criminals[a+distance] + criminals[a-distance] == 1):\r\n catchedCriminals -= 1\r\n distance += 1\r\nprint(catchedCriminals)\r\n", "n, a = [int(x) for x in input().split()]\r\ncriminals = [int(x) for x in input().split()]\r\na = a - 1\r\nnew_criminals = []\r\n\r\nif a < n/2:\r\n l_limit = 0\r\n r_limit = 2*a + 1\r\nelse:\r\n l_limit = a - (n - a - 1)\r\n r_limit = n\r\n\r\nfor i, c in enumerate(criminals):\r\n if l_limit <= i < r_limit:\r\n new_i = -1*(i - a) + a\r\n if c == 1 and criminals[new_i]==1:\r\n new_criminals.append(1)\r\n else:\r\n new_criminals.append(0)\r\n else:\r\n new_criminals.append(c)\r\nprint(sum(new_criminals))", "n,k=map(int,input().split());l=[0,]+list(map(int,input().split()));c=0\r\nm=min(k-1,n-k);lw,u=k-m,k+m\r\nfor i in range(1,n+1):\r\n\tif lw<=i<=u and l[i]==l[2*k-i]==1:c+=1\r\n\telif (i>u or i<lw) and l[i]==1 :c+=1\r\nprint(c)", "n,a = map(int,input().split())\r\nl = list(map(int,input().split()))\r\na-=1\r\nans = 0\r\nfor i in range(n):\r\n if(a-i<0 or a+i>=n):\r\n break\r\n if(l[a-i]==1 and l[a+i]==1):\r\n if(i==0):\r\n ans+=1\r\n else:\r\n ans+=2\r\n l[a-i]=0\r\n l[a+i]=0\r\n#print(l)\r\nans+=l.count(1)\r\nprint(ans)", "n,a = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nsum = 0\r\nq = a - 1\r\nr = n - a\r\ns = min(q,r)\r\nif q < r:\r\n p = l[:a + a - 1]\r\nelse:\r\n p = l[-((r*2)+1):]\r\nfor num in range(s+1):\r\n if (p[num] == p[-(num+1)]) and (p[num] == 1):\r\n sum += 2\r\nif p == l[:a + a - 1]:\r\n sum += l[a + a - 1:].count(1)\r\nelse:\r\n sum += l[:-((r*2)+1)].count(1)\r\nif l[a-1] == 1:\r\n sum -= 1\r\nprint(sum)", "# If you win, you live. You cannot win unless you fight.\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nimport heapq\r\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,log2,factorial,radians,sin,cos\r\nrandom = randint(1, 10 ** 9)\r\nmod=10**9+7\r\nclass myDict:\r\n def __init__(self,func):\r\n self.RANDOM = randint(0,1<<32)\r\n self.default=func\r\n self.dict={}\r\n def __getitem__(self,key):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n self.dict[myKey]=self.default()\r\n return self.dict[myKey]\r\n def __setitem__(self,key,item):\r\n myKey=self.RANDOM^key\r\n self.dict[myKey]=item\r\n def getKeys(self):\r\n return [self.RANDOM^i for i in self.dict]\r\n\r\nn,d=rd()\r\nd-=1\r\na=list(rd())\r\nans=0\r\nif a[d]==1:\r\n ans=1\r\nfor s in range(1,n):\r\n l=-1\r\n r=-1\r\n if d+s <n:\r\n r=a[d+s]\r\n if d-s>=0:\r\n l=a[d-s]\r\n if r==l and l==1:\r\n ans+=2\r\n if l==-1 and r==1:\r\n ans+=1\r\n if l==1 and r==-1:\r\n ans+=1\r\nprint(ans)\r\n", "\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_ints():\n return list(map(int, input().strip().split(' ')))\n\n\ndef solve():\n n, a = read_ints()\n a -= 1\n t = read_ints()\n i = 0\n count = 0\n while a-i >= 0 or a+i < n:\n if 0 <= a-i and a+i < n:\n if t[a-i] == t[a+i] == 1:\n count += 1 if i == 0 else 2\n elif 0 <= a-i:\n count += t[a-i]\n else:\n count += t[a+i]\n i += 1\n return count\n\n\nif __name__ == '__main__':\n print(solve())\n", "n, a = map(int, input().split())\ncriminals= list(map(int, input().split()))\na= a-1\nsum=0\nif criminals[a]:\n sum= sum+1\n\nfor i in range (1,n):\n if (a + i < n) or (a - i>=0):\n if(a + i < n) and (a - i >=0):\n if(criminals[a+i] and criminals[a-i]):\n sum= sum+2\n elif(a+i < n):\n if(criminals[a+i]):\n sum=sum+1\n elif(a-i >= 0):\n if(criminals[a-i]):\n sum=sum+1 \nprint (sum)\n\t \t\t\t\t \t\t\t\t \t\t \t\t\t \t \t\t \t", "n,q=map(int,input().split())\r\ncounter=0\r\nparsa=list(map(int,input().split()))\r\nfor i in range(n):\r\n if parsa[i]==1 and i!=q-1:\r\n if i<q-1:\r\n adad=(q-1)+(q-1-i)\r\n if adad<n and adad>=0:\r\n if parsa[adad]==1:\r\n counter+=1\r\n else:\r\n counter+=1\r\n else:\r\n adad=(q-1)-(i-(q-1))\r\n if adad<n and adad>=0:\r\n if parsa[adad]==1:\r\n counter+=1\r\n else:\r\n counter+=1\r\n elif parsa[i]==1 and i==q-1:\r\n counter+=1\r\nprint(counter)", "n, a = map(int, input().split())\r\ncriminals = list(map(int, input().split()))\r\n\r\ncatch_count = criminals[a - 1] # Limak's city\r\n\r\nfor distance in range(1, max(a, n - a) + 1):\r\n left_city = a - distance\r\n right_city = a + distance\r\n \r\n if 1 <= left_city <= n and 1 <= right_city <= n:\r\n if criminals[left_city - 1] == 1 and criminals[right_city - 1] == 1:\r\n catch_count += 2\r\n elif 1 <= left_city <= n:\r\n if criminals[left_city - 1] == 1:\r\n catch_count += 1\r\n elif 1 <= right_city <= n:\r\n if criminals[right_city - 1] == 1:\r\n catch_count += 1\r\n\r\nprint(catch_count)\r\n", "from sys import stdin, stdout # only need for big input\n\ndef read_int_from_line():\n return list(map(int, input().split()))\n\ndef solve():\n n, a = read_int_from_line()\n a -= 1\n t = read_int_from_line()\n count = t[a]\n\n for i in range(1, n):\n i1 = a - i\n i2 = a + i\n target = []\n if i1 >= 0 :\n target.append(i1)\n if i2 < n :\n target.append(i2)\n criminals = 0\n for city in target:\n criminals += t[city]\n\n if criminals == len(target):\n count += criminals\n \n print(count)\n\n\ndef main():\n solve()\n\n\nif __name__ == \"__main__\":\n main()", "c, p = map(int, input().split())\r\nva = max(p, c-p+1)\r\np -= 1\r\nd = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(va):\r\n if p-i < 0:\r\n le = 1\r\n vl = 0\r\n else:\r\n le = d[p-i]\r\n vl = le\r\n if p+i >= c:\r\n ri = 1\r\n vr = 0\r\n else:\r\n ri = d[p+i]\r\n vr = ri\r\n if le and ri:\r\n s += (vl+vr)\r\ns -= d[p]\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ni=inlt()\r\nj=inlt()\r\nme=i[1]-1\r\nans=0\r\nfor k in range(len(j)):\r\n if j[k]==1:\r\n if k==me:\r\n ans+=1\r\n j[k]=0\r\n elif k < me :\r\n if (me+abs(me-k) < i[0]) and (j[me+abs(me-k)]==1):\r\n ans+=2\r\n j[k]=0\r\n j[me+abs(me-k)]=0\r\n elif me+abs(me-k) >= i[0]:\r\n ans+=1\r\n j[k]=0\r\n else:\r\n if (me-abs(me-k)>=0) and (j[me-abs(me-k)]==1):\r\n ans+=2\r\n j[k]=0\r\n j[me+abs(me-k)]=0\r\n elif me-abs(me-k)<0:\r\n ans+=1\r\n j[k]=0\r\n \r\nprint(ans)\r\n", "n,a = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nif l[a-1]:\r\n c=1\r\nelse:\r\n c = 0\r\na-=1\r\nfor i in range(1,len(l)):\r\n if (a-i) in range(len(l)) and (a+i) in range(len(l)):\r\n if l[a-i] and l[a+i]:\r\n c+=2\r\n elif (a-i) in range(len(l)):\r\n if l[a - i]:\r\n c+=1\r\n elif (a+i) in range(len(l)):\r\n if l[a + i]:\r\n c+=1\r\nprint(c)", "read = lambda: map(int, input().split())\r\nn, a = read()\r\nt = list(read())\r\nans = 0\r\nfor d in range(n):\r\n i, j = a - d - 1, a + d - 1\r\n if i == j: ans += t[i]\r\n elif i >= 0 and j < n and t[i] == t[j]: ans += t[i] + t[j]\r\n elif i < 0 and j < n: ans += t[j]\r\n elif i >= 0 and j >= n: ans += t[i]\r\nprint(ans)", "import os\r\n\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor _ in range(test_count):\r\n n, a = invr()\r\n t = inlt()\r\n t.insert(0, -1)\r\n d = max(a - 1, n - a)\r\n ans = 0\r\n if t[a] == 1:\r\n ans += 1\r\n for i in range(1, d + 1, 1):\r\n x = y = 0\r\n if a - i > 0:\r\n x += 1\r\n if t[a - i] == 1:\r\n y += 1\r\n if a + i <= n:\r\n x += 1\r\n if t[a + i] == 1:\r\n y += 1\r\n \r\n if x == y:\r\n ans += x\r\n\r\n print(ans)\r\n", "\r\nn,a=map(int,input().split())\r\nls=list(map(int,input().split()))\r\n\r\ni=a-2\r\nj=a\r\nc=0\r\nflag=True\r\n\r\nif ls[a-1]==1:\r\n c+=1\r\n \r\nwhile flag :\r\n if i>=0 and j<n :\r\n if ls[i] ==1 and ls[j]==1 :\r\n c+=2\r\n \r\n elif i>=0 :\r\n if ls[i]==1: \r\n c+=1\r\n elif j<n :\r\n if ls[j]==1: \r\n c+=1\r\n else:\r\n flag=False\r\n i-=1\r\n j+=1\r\n\r\nprint(c)", "# Bear and Finding Criminals\ndef police(arr, ind):\n ans = 1 if arr[ind - 1] == 1 else 0\n left = ind - 1\n right = ind + 1\n while True:\n if (left - 1) < 0 and (right - 1) >= len(arr):\n break\n if (right - 1) >= len(arr) and arr[left - 1] == 1:\n ans += 1 \n elif (left - 1) < 0 and arr[right - 1] == 1:\n ans += 1\n elif arr[left - 1] == 1 and arr[right - 1] == 1:\n ans += 2\n left -= 1\n right += 1\n return ans\n\n\nn, ind = list(map(int, input().rstrip().split()))\nar = list(map(int, input().rstrip().split()))\nprint(police(ar, ind))", "def bear():\n N_A = input().split()\n N = int(N_A[0])\n A = int(N_A[1])\n criminals = list(map(int, input().split()))\n i, j = A-1, A-1\n res = 0\n while i >= 0 or j < len(criminals):\n if i == j:\n if criminals[i]:\n res += 1\n elif i < 0:\n if criminals[j]:\n res += 1\n elif j >= len(criminals):\n if criminals[i]:\n res += 1\n else:\n if criminals[i] == criminals[j] and criminals[i] == 1:\n res += 2\n i -= 1\n j += 1 \n print(res)\n\nbear()", "n, a = map(int, input().split())\r\nb = list(map(int, input().split()))\r\na = a-1\r\nc = []\r\nd = []\r\ne = []\r\ng = 0\r\nfor i in range(n):\r\n c.append(abs(i-a))\r\n#print(c)\r\nfor i in range(n):\r\n d.append([c[i],b[i]])\r\nd.sort()\r\nfor i in range(len(d)-1):\r\n if(d[i] == d[i+1]):\r\n d[i][1] = d[i][1]+d[i+1][1]\r\n d[i+1][1] = 0\r\n#print(d)\r\nfor i in range(len(d)):\r\n if d[i][0] in e:\r\n continue\r\n else:\r\n e.append(d[i][0])\r\n g += d[i][1]\r\n \r\n#print(e)\r\nprint(g)\r\n", "n,ind=map(int,input().split());a=list(map(int,input().split()));c=0;ind-=1;t=min(ind,n-ind-1)\r\nfor i in range(1,t+1):\r\n if a[ind-i]==1 and a[ind+i]==1:c+=2\r\nif a[ind]==1:c+=1\r\nc+=a[:ind-t].count(1);c+=a[ind+t+1::].count(1)\r\nprint(c)", "n , a = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\na -= 1\r\ni = a - 1\r\nj = a + 1\r\ncount = arr[a]\r\nwhile i >= 0 and j < n:\r\n if (arr[i] and arr[j]):\r\n count += 2\r\n else:\r\n pass\r\n i -= 1\r\n j += 1\r\nwhile i >= 0:\r\n if arr[i]:\r\n count += 1\r\n i -= 1\r\nwhile j < n:\r\n if arr[j]:\r\n count += 1\r\n j += 1\r\n\r\nprint(count)\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\ndistance = 0\r\nn, a = invr()\r\ncriminals = inlt()\r\ncatch = 0\r\nmax_dist = max(a - 1, n - a)\r\nfor i in range(max_dist + 1):\r\n tocatch = 0\r\n if i != 0 and a - 1 - i >= 0:\r\n if criminals[a - 1 - i] == 0:\r\n continue\r\n if criminals[a - 1 - i] == 1:\r\n tocatch += 1\r\n \r\n if a - 1 + i < n:\r\n if criminals[a - 1 + i] == 0:\r\n continue\r\n if criminals[a - 1 + i] == 1:\r\n tocatch += 1\r\n\r\n catch += tocatch\r\n\r\nprint(catch)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nf=c[:b-1:]\r\nf=f[::-1]\r\nv=c[b::]\r\nif c[b-1]==1:\r\n g=1\r\nelse:\r\n g=0\r\nfor i in range(min(len(f),len(v))):\r\n if f[i]==v[i]==1:\r\n g+=2\r\nif len(f)>len(v):\r\n f=f[len(v)::]\r\n g=g+sum(f)\r\nelif len(f)<len(v):\r\n v=v[len(f)::]\r\n g=g+sum(v) \r\nprint(g)", "n, a = map(int, input().split())\r\nArr = ['']+input().split()\r\n\r\nerr = [a]\r\ncount = 0\r\n\r\nif Arr[a]=='1':\r\n count+=1\r\n\r\nfor front in range(1,a):\r\n #print(2*a-front)\r\n if 2*a-front<=n:\r\n if Arr[front]=='1' and Arr[2*a-front]=='1':\r\n count+=2\r\n err+=[front]+[2*a-front]\r\n else:\r\n if Arr[front]=='1':\r\n count+=1\r\n\r\ntt = max(err)\r\nfor i in range(tt+1, n+1):\r\n if Arr[i]=='1':\r\n count+=1\r\n\r\nprint(count)", "n,a=[int(i) for i in input().split()]\r\narr=[int(i) for i in input().split()]\r\na-=1\r\n\r\ndist=0\r\nres=0\r\nwhile True:\r\n left=a-dist\r\n right=a+dist\r\n if left>=0 and right<n:\r\n res+=(2 if arr[right]&arr[left] else 0)\r\n res-=1 if arr[right]&arr[left] and right==left else 0\r\n elif left>=0:\r\n res+=arr[left]\r\n elif right<n:\r\n res+=arr[right]\r\n else:\r\n break\r\n dist+=1\r\n\r\nprint(res)", "import math\r\nm=1000000007\r\n\r\ndef fact(n):\r\n ans=1\r\n for i in range(1,n+1):\r\n ans=((ans%m)*(i%m))%m\r\n return ans\r\n\r\ndef power_2(n):\r\n ans=1\r\n for i in range(n):\r\n ans=((ans%m)*(2))%m\r\n return ans\r\n\r\nn,a=map(int,input().split())\r\nt=[int(i) for i in input().split()]\r\ncnt,i=0,0\r\nwhile((a-1-i)>=0 or (a-1+i)<n):\r\n if(i==0 and t[a-1]==1):\r\n cnt+=1\r\n elif((a-1-i)>=0 and (a-1+i)<n and t[a-1-i]==1 and t[a-1+i]==1):\r\n cnt+=2\r\n elif((a-1-i)>=0 and (a-1+i)>=n and t[a-1-i]==1):\r\n cnt+=1\r\n elif((a-1-i)<0 and (a-1+i)<n and t[a-1+i]==1):\r\n cnt+=1\r\n i+=1\r\nprint(cnt)", "n,a=map(int,input().split())\r\nt=list(map(int,input().split()))\r\ncriminal=0\r\ndef BCD(n,a,t):\r\n m=0\r\n global criminal\r\n if(t[a]==1):\r\n criminal+=1\r\n for i in range(1,len(t)):\r\n #print(\"criminal\"+str(criminal))\r\n left=0\r\n right=0\r\n if(a-i>=0):\r\n if(t[a-i]==1):\r\n left=1\r\n else:\r\n left=-1\r\n if(a+i<n):\r\n if(t[a+i]==1):\r\n right=1\r\n else:\r\n right=-1\r\n if(left==1 and right==1):\r\n criminal+=2\r\n elif(left==-1 and right==1):\r\n criminal+=1\r\n elif(left==1 and right==-1):\r\n criminal+=1\r\n return criminal\r\n \r\nprint(BCD(n,a-1,t))\r\n \r\n \r\n \r\n \r\n", "def numberThieves(a, n, k):\r\n\r\n i, j = k-1, k-1\r\n tot = 0\r\n while i>=0 and j<n:\r\n if a[i] == a[j] == 1:\r\n if i==j:\r\n tot+=1\r\n else:\r\n tot+=2\r\n i-=1\r\n j+=1\r\n\r\n while i>=0:\r\n if a[i] == 1:\r\n tot+=1\r\n i-=1\r\n \r\n while j<n:\r\n if a[j] == 1:\r\n tot+=1\r\n j+=1\r\n\r\n return tot\r\n\r\nli = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\nprint(numberThieves(arr, li[0], li[1]))", "n,k=map(int,input().split())\r\nl=list(map(int, input().split()))\r\nminn=k-2; maxx=k\r\nc=l[k-1]\r\nwhile minn!=-1 and maxx!=n:\r\n if l[minn]==1 and l[maxx]==1:\r\n c+=2\r\n minn-=1\r\n maxx+=1\r\nif minn==-1: c+=l[maxx:].count(1)\r\nelse: c+=l[:minn+1].count(1)\r\nprint(c)", "n, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nk = a - 1\r\nsuma = 0\r\nif arr[k] == 1:\r\n suma += 1\r\nx = k + 1\r\ny = k - 1\r\nwhile y >= 0 or x <= n-1:\r\n if y >= 0 and x <= n - 1:\r\n if arr[y] == arr[x] == 1:\r\n suma += 2\r\n elif y >= 0:\r\n if arr[y] == 1:\r\n suma += 1\r\n else:\r\n if arr[x] == 1:\r\n suma += 1\r\n y -=1\r\n x +=1\r\nprint(suma)", "n,a=map(int,input().split())\r\ncs = [*map(int,input().split())]\r\nd=1\r\nflag=1\r\nnum=0\r\nc=0\r\na=a-1\r\nr=cs[a]\r\nwhile flag:\r\n if a+d<n:\r\n num+=1\r\n c+=cs[a+d]\r\n if a-d>=0:\r\n num+=1\r\n c+=cs[a-d]\r\n if c==num:\r\n r+=c\r\n d=d+1\r\n num=c=0\r\n if a+d>=n and a-d<0: flag=0\r\nprint(r)", "def main():\r\n n, a = map(int, input().split())\r\n a -= 1\r\n potentials = list(map(int, input().split()))\r\n if potentials[a] == 1:\r\n count = 1\r\n else:\r\n count = 0\r\n\r\n i, j = a - 1, a + 1\r\n while True:\r\n if i >= 0 and j < n:\r\n if potentials[i] == 1 and potentials[j] == 1:\r\n count += 2\r\n elif i >= 0:\r\n count += potentials[i]\r\n elif j < n:\r\n count += potentials[j]\r\n else:\r\n break\r\n i -= 1\r\n j += 1\r\n\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# Bear and Finding Criminals\r\nn, a = list(map(int, input().split()))\r\ncities = list(map(int, input().split()))\r\na = a - 1\r\n\r\ndef prev_city_count(cities, a):\r\n if a >= 0:\r\n return cities[a]\r\n else:\r\n return None\r\ndef next_city_count(cities, a):\r\n if a < len(cities):\r\n return cities[a]\r\n else:\r\n return None\r\nc_count = 0\r\nfor i in range(0, n):\r\n if (i == 0):\r\n c_count += cities[a]\r\n else:\r\n if (prev_city_count(cities, a - i) == None or next_city_count(cities, a + i) == None):\r\n if (prev_city_count(cities, a - i) == 1 or next_city_count(cities, a + i) == 1):\r\n c_count += 1\r\n elif (prev_city_count(cities, a - i) + next_city_count(cities, a + i) == 2):\r\n c_count += 2\r\n\r\nprint(c_count)\r\n\r\n", "n, p = map(int,input().split())\r\np -= 1\r\nc = list(map(int,input().split()))\r\n \r\nres = 0\r\nfor i in range(n):\r\n if c[i]:\r\n x = 2 * p - i\r\n if x < 0 or x >= n or c[x]:\r\n res += 1\r\nprint(res)", "from sys import stdin, stdout\r\nn, a = map(int, stdin.readline().strip().split())\r\narray = list(map(int, stdin.readline().strip().split()))\r\na-=1\r\ncount = 0\r\nfor j in range(a+1):\r\n if array[j]==0:\r\n pass\r\n else:\r\n dist = abs(a-j)\r\n if (a+dist)<len(array):\r\n if array[a+dist]==1:\r\n count+=1\r\n else:\r\n pass\r\n else:\r\n count+=1\r\nfor j in range(a+1, len(array)):\r\n if array[j]==0:\r\n pass\r\n else:\r\n \r\n dist = abs(a-j)\r\n if (a-dist)>=0:\r\n if array[a-dist]==1:\r\n count+=1\r\n else:\r\n pass\r\n else:\r\n count+=1\r\nstdout.write(f\"{count}\\n\")", "import sys\r\n\r\ndef findNumberOfCriminals(n,a,arr):\r\n\tcriminalDict = {}\r\n\tfor i in range(n):\r\n\t\tcriminalDict[abs(i-a)] = criminalDict.get(abs(i-a),0) + arr[i]\r\n\tcriminal_count = 0\r\n\tfor k in criminalDict:\r\n\t\tif a-k>-1 and a+k<n:\r\n\t\t\tif k!=0:\r\n\t\t\t\tif criminalDict[k] == 2:\r\n\t\t\t\t\tcriminal_count += 2\r\n\t\t\t\telse:\r\n\t\t\t\t\tcriminal_count += 0\r\n\t\t\telse:\r\n\t\t\t\tcriminal_count += criminalDict[k]\r\n\t\telse:\r\n\t\t\tcriminal_count += criminalDict[k]\r\n\treturn criminal_count\r\n\r\ndef main():\r\n\tn,a = list(int(x) for x in sys.stdin.readline().strip().split())\r\n\tarr = list(int(x) for x in sys.stdin.readline().strip().split())\r\n\r\n\tprint(findNumberOfCriminals(n,a-1,arr))\r\n\r\nmain()", "def handle_input():\r\n n,a= tuple(map(int,input().split()))\r\n criminals = list(map(int, input().split()))\r\n return a,criminals\r\n\r\n\r\na,criminals = handle_input()\r\n\r\n\r\ni = j = a-1\r\ncounter = 0\r\nn = len(criminals)\r\nwhile i >= 0 or j <= n-1 :\r\n if i >= 0 and j <= n-1 :\r\n if criminals[i] == 1 and criminals[j] == 1 and i != j:\r\n counter +=2\r\n elif criminals[i] == 1 and criminals[j] == 1:\r\n counter +=1\r\n i-=1\r\n j+=1\r\n elif i >=0 :\r\n if criminals[i] == 1:\r\n counter+=1\r\n i-=1\r\n else:\r\n if criminals[j] == 1:\r\n counter+=1\r\n j+=1\r\n\r\nprint(counter)\r\n", "n , a = map(int, input().split())\r\na -= 1\r\nb = [1]*n + list(map(int,input().split()[:n])) + [1]*n\r\nprint( sum(b[n+a-abs(a-x)] * b[n+a+abs(a-x)] for x in range(n)) )", "n,a=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\na=a-1\r\nc=0\r\nif arr[a]==1:\r\n c=c+1\r\n\r\ni=1\r\nwhile(i<n):\r\n if a+i not in range(n) and a-i in range(n) and arr[a-i]==1:\r\n c=c+1\r\n i=i+1\r\n elif a-i not in range(n) and a+i in range(0,n) and arr[a+i]==1:\r\n c=c+1\r\n i=i+1\r\n elif (a-i in range(0,n) and a+i in range(0,n)) and (arr[a+i]==1 and arr[a-i]==1):\r\n c=c+2\r\n i=i+1\r\n else:\r\n i=i+1\r\nprint(c) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n_home = input()\r\nn = int(n_home.split()[0])-1\r\nhome = int(n_home.split()[1])-1\r\nplaces = input().split()\r\nplaces = list(map(int, places))\r\ncaptured = 0\r\nif places[home] == 1:\r\n captured += 1\r\ntravel = 1\r\nedge = min(home, n - home)\r\nif home == n - home: # house in the middle\r\n while edge >= travel:\r\n if places[home - travel] == places[home + travel] == 1:\r\n captured += 2\r\n travel += 1\r\nelif home > n - home: # house past the middle\r\n while edge >= travel:\r\n if places[home - travel] == places[home + travel] == 1:\r\n captured += 2\r\n travel += 1\r\n while travel != home + 1:\r\n if places[home - travel] == 1:\r\n captured += 1\r\n travel += 1\r\nelse: # house before middle\r\n while edge >= travel: \r\n if places[home - travel] == places[home + travel] == 1:\r\n captured += 2\r\n travel += 1\r\n while travel != n - home + 1:\r\n if places[home + travel] == 1:\r\n captured += 1\r\n travel += 1\r\nprint(captured)", "n, a = map(int, input().split())\na -= 1\narr = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n\tif a - i >= 0 and a + i < n:\n\t\tif arr[a - i] == 1 and arr[a + i] == 1:\n\t\t\tans += 2\n\telif a - i >= 0:\n\t\tif arr[a - i] == 1:\n\t\t\tans += 1\n\telif a + i < n:\n\t\tif arr[a + i] == 1:\n\t\t\tans += 1\nif arr[a] == 1:\n\tans -= 1\nprint(ans)\n\t \t\t\t\t \t \t\t \t\t\t\t \t \t\t \t \t", "n=tuple(map(int,input().split(' '))) \r\nx=tuple(map(int,input().split(' ')))\r\nd=n[1]-1\r\nflag=0\r\ns=0\r\nfor i in range(n[0]):\r\n if ((d-i)>=0) and ((d+i)<=n[0]-1):\r\n if x[(d-i)]==1 and x[d+i]==1:\r\n if i==0:\r\n s+=1\r\n else:\r\n s+=2\r\n elif (d-i)>=0:\r\n if x[d-i]==1:\r\n s+=1\r\n elif (d+i)<=(n[0]-1):\r\n if x[d+i]==1:\r\n s+=1\r\nprint(s)", "n,a=map(int, input().split())\r\nl=list(map(int,input().split()))\r\n#print(a,n)\r\nl.insert(0,0)\r\n#print(l)\r\nsums=sum(l)\r\nfor i in range(1,n+2,1):\r\n if((i<a) and (i<=n-a)):\r\n if(l[a+i]+l[a-i]==1):\r\n sums-=1\r\nprint(sums)", "n, a = list(map(lambda x: int(x), input().split()))\r\n\r\ncriminals = [None]\r\ncriminals.extend(list(map(lambda x: int(x), input().split())))\r\n\r\ncities_in_left = (a-1)\r\ncities_in_right = (n-a)\r\nif cities_in_left <= cities_in_right:\r\n direction = \"left\"\r\n end_loop = cities_in_left + 1\r\nelse:\r\n direction = \"right\"\r\n end_loop = cities_in_right + 1\r\n\r\ncaught_criminal = 0\r\nfor i in range(1, end_loop):\r\n if criminals[a-i] == 1 and criminals[a+i] == 1:\r\n caught_criminal += 2\r\n\r\nif criminals[a] == 1:\r\n caught_criminal += 1\r\n\r\nif direction == \"left\":\r\n start_loop = (a + cities_in_left) + 1\r\n end_loop = n + 1\r\nelse:\r\n start_loop = 1\r\n end_loop = abs((a-cities_in_right))\r\n\r\nfor i in range(start_loop, end_loop):\r\n if criminals[i] == 1:\r\n caught_criminal += 1\r\n\r\nprint(caught_criminal)\r\n\r\n\r\n", "n, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nc=0\r\nfor i in range(1,n):\r\n ind1 = (a-1) - i\r\n ind2 = (a-1) + i\r\n tc = 0\r\n if ind1 >=0 and ind2 <n:\r\n if arr[ind1] and arr[ind2]:\r\n tc+=2\r\n\r\n elif ind1 <0 and ind2 <n:\r\n if arr[ind2]:\r\n tc+=1\r\n\r\n elif ind1 <0 and ind2 >= n:\r\n pass\r\n\r\n elif ind1 >=0 and ind2 >= n:\r\n if arr[ind1]:\r\n tc+=1\r\n c += tc\r\n \r\nif arr[a-1]:\r\n c+=1\r\nprint(c)", "# Bear and Finding Criminals\nn, a = list(map(int, input().split(' ')))\ncities = list(map(int, input().split(' ')))\n\ncount = 0\ndistance = 1\na -= 1\n\nif cities[a]:\n count += 1\n\nwhile a + distance < n or a - distance >= 0:\n if a + distance < n and a - distance >= 0:\n if cities[a + distance] and cities[a - distance]:\n count += 2\n else: \n if a + distance < n:\n if cities[a + distance]:\n count += 1\n\n if a - distance >= 0:\n if cities[a - distance]:\n count += 1\n\n distance += 1\n\nprint(count)", "n,a = [int(x) for x in input().split()]\r\nt = [int(x) for x in input().split()]\r\na = a - 1\r\ni,j = a - 1, a + 1\r\ncriminals = 0\r\nif t[a] == 1:\r\n criminals = 1\r\nwhile(i > -1 and j < n ):\r\n if t[i] == 1 and t[j] == 1:\r\n criminals += 2 \r\n i -= 1\r\n j += 1 \r\nwhile i > -1:\r\n if t[i] == 1:\r\n criminals += 1\r\n i -= 1\r\nwhile j < n:\r\n if t[j] == 1:\r\n criminals += 1\r\n j += 1\r\nprint(criminals)", "cities,home = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n#arr.insert(0,5)\r\n#arr.insert(len(arr),7)\r\nleft,right = home-1,home-1\r\ncount = 0\r\nflag = 0\r\nwhile (left >= 0 and right <= cities - 1):\r\n flag += 1\r\n if arr[left] == 1 and arr[right] == 1:\r\n if left != right:\r\n count += 2 \r\n else:\r\n count += 1 \r\n left -= 1\r\n right += 1\r\n\r\n#print(left,right,flag) \r\n#print(count) \r\n\r\nwhile left >= 0:\r\n if arr[left] == 1:\r\n count += 1\r\n left -=1\r\n\r\nwhile right <= cities - 1:\r\n if arr[right] == 1:\r\n count += 1\r\n right += 1 \r\n\r\nprint(count) \r\n\r\n\r\n\r\n\"\"\"\r\nif left == 0:\r\n for i in range(cities - flag):\r\n if arr[right] == 1:\r\n count += 1\r\n print(count)\r\n quit()\r\n \r\n\r\nif right == cities - 1:\r\n for i in range(cities - flag):\r\n if arr[right] == 1:\r\n count += 1\r\n print(count)\r\n quit()\r\n\"\"\"\r\n", "cities, j = list(map(int, input().split(' ')))\nbcd = list(map(int, input().split(' ')))\nj -= 1\ni = 0\ncrim = 0\nwhile j+i<cities or j-i>=0:\n if j+i >= cities:\n a = 0.5\n else:\n a = bcd[j+i]\n \n if j-i < 0:\n b = 0.5\n else:\n b = bcd[j-i]\n \n if i==0:\n crim+=min(a,b)\n else:\n crim+=2*min(a,b)\n i+=1\n\nprint(int(crim))", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nle = a\r\nri = a\r\nres = 0\r\nwhile le >= 1 and ri <= n:\r\n if t[le - 1] == 1 and t[ri - 1] == 1:\r\n if le == ri:\r\n res += 1\r\n else:\r\n res += 2\r\n le -= 1\r\n ri += 1\r\nwhile le >= 1:\r\n if t[le - 1] == 1:\r\n res += 1\r\n le -= 1\r\nwhile ri <= n:\r\n if t[ri - 1] == 1:\r\n res += 1\r\n ri += 1\r\nprint(res)", "# If you win, you live. You cannot win unless you fight.\nfrom sys import stdin,setrecursionlimit\ninput=stdin.readline\nimport heapq\nimport string\nrd=lambda: map(lambda s: int(s), input().strip().split())\nri=lambda: int(input())\nrs=lambda :input().strip()\nfrom collections import defaultdict,deque,Counter\nfrom bisect import bisect_left as bl, bisect_right as br\nfrom random import randint\nfrom math import gcd, ceil, floor,log2,factorial,radians,sin,cos\nrandom = randint(1, 10 ** 9)\nmod=10**9+7\nclass myDict:\n def __init__(self,func):\n self.RANDOM = randint(0,1<<32)\n self.default=func\n self.dict={}\n def __getitem__(self,key):\n myKey=self.RANDOM^key\n if myKey not in self.dict:\n self.dict[myKey]=self.default()\n return self.dict[myKey]\n def __setitem__(self,key,item):\n myKey=self.RANDOM^key\n self.dict[myKey]=item\n def getKeys(self):\n return [self.RANDOM^i for i in self.dict]\n\nn,d=rd()\nd-=1\na=list(rd())\nans=0\nif a[d]==1:\n ans=1\nfor s in range(1,n):\n l=-1\n r=-1\n if d+s <n:\n r=a[d+s]\n if d-s>=0:\n l=a[d-s]\n if r==l and l==1:\n ans+=2\n if l==-1 and r==1:\n ans+=1\n if l==1 and r==-1:\n ans+=1\nprint(ans)\n\n \t \t\t\t\t\t \t\t\t\t \t\t\t \t \t", "n, k = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\n\r\na, b = k-2, k\r\ncnt = 0\r\nif lst[k-1] == 1: cnt += 1\r\nwhile a >= 0 and b <= n-1:\r\n\tif lst[a] + lst[b] == 2:\r\n\t\tcnt += 2\r\n\ta -= 1\r\n\tb += 1\r\nif a >= 0:\r\n\tcnt += sum(lst[:a+1])\r\ncnt += sum(lst[b:])\r\nprint(cnt)", "n, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nout = 0\r\na -= 1\r\nfor i in range(n):\r\n if i == 0:\r\n if arr[a] == 1:\r\n out += 1\r\n else:\r\n right = a + i\r\n left = a - i\r\n if right < n and left >= 0:\r\n if arr[right] == arr[left] == 1:\r\n out += 2\r\n elif right < n:\r\n if arr[right] == 1:\r\n out += 1\r\n elif left >= 0:\r\n if arr[left] == 1:\r\n out += 1\r\nprint(out)", "n, a = map(int, input().split())\r\ngcd = list(map(int, input().split()))\r\na = a-1\r\nl = a - 1\r\nr = a + 1\r\nif gcd[a] == 1:\r\n ctr = 1\r\nelse:\r\n ctr = 0\r\nwhile (l>=0 and r < n):\r\n if gcd[l] == 1 and gcd[r] == 1:\r\n ctr += 2\r\n l -= 1\r\n r += 1\r\nwhile l >= 0:\r\n if gcd[l] == 1:\r\n ctr += 1\r\n l -= 1\r\nwhile r < n:\r\n if gcd[r] == 1:\r\n ctr += 1\r\n r += 1\r\nprint(ctr)", "n,a=map(int,input().split())\ncriminals_locations = list(map(int,input().split()))\ntotal = criminals_locations[a-1]\ncriminals_locations[a-1] = 0\ni = a-2\nj = a\nwhile i >=0 and j <=n-1:\n if criminals_locations[i] and criminals_locations[j] :\n total += criminals_locations[i]+criminals_locations[j]\n criminals_locations[i] = 0\n criminals_locations[j] = 0\n i-=1\n j+=1\nprint(total+ sum(criminals_locations))", "n, a=[int(k) for k in input().split()]\r\nw=[int(k) for k in input().split()]\r\nres=0\r\nif w[a-1]==1:\r\n res+=1\r\nfor j in range(1, n):\r\n eta=0\r\n v=0\r\n if a-1-j>=0:\r\n if w[a-1-j]==1:\r\n eta+=1\r\n else:\r\n v+=1\r\n if a-1+j<=n-1:\r\n if w[a-1+j]==1:\r\n eta+=1\r\n else:\r\n v+=1\r\n if v==2:\r\n break\r\n if eta+v==2:\r\n res+=eta\r\nprint(res)", "n,m=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\nj=0\r\nm=m-1\r\nnd=0\r\nwhile (m-j)>=0 or (m+j)<n:\r\n a=None\r\n b=None\r\n if (m-j)>=0:\r\n a=lst[m-j]\r\n if (m+j)<n:\r\n b=lst[m+j]\r\n if (a==1 and b==1) and j==0:\r\n nd=nd+1\r\n elif a==1 and b==1:\r\n nd+=2\r\n elif (a==None and b==1) or(a==1 and b==None):\r\n nd+=1\r\n #print(a,b)\r\n j+=1\r\nprint(nd)\r\n", "n, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\na -= 1\r\ncounter = 0\r\n\r\nif arr[a]:\r\n counter += 1\r\n\r\nfor i in range(1, n):\r\n right = a + i\r\n left = a - i\r\n if left >= 0 or right < n:\r\n if left >= 0 and right < n:\r\n if arr[right] and arr[left]:\r\n counter += 2\r\n elif left >= 0:\r\n if arr[left]:\r\n counter += 1\r\n elif right < n:\r\n if arr[right]:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "n,a = map(int, input().split())\nA = list(map(int, input().split()))\na-=1\n\ncount = 0\n\nfor i in range(n):\n j = 2*a - i\n if j < 0 or j >= n or A[j] == A[i]:\n count += A[i]\n\nprint(count)\n", "n,a=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nx=min(a-1,n-a)\r\ns=t[a-1]\r\nfor i in range(1,x+1):\r\n if t[a-1+i]==1 and t[a-1-i]==1:\r\n s+=2\r\nif x==a-1 and a-1!=n-a:\r\n s+=t[a+x:].count(1)\r\nelif x==n-a and a-1!=n-a:\r\n s+=t[:a-x-1].count(1)\r\nprint(s)\r\n", "n,a = map(int,input().split())\na -=1\ncities = list(map(int,input().split()))\ncatched = cities[a]\nleft = a-1\nright = a+1\nwhile left > -1 and right < n :\n if cities[left] + cities[right] == 2 :\n catched +=2\n left -=1\n right +=1\nwhile left > -1 :\n catched += cities[left]\n left -=1\nwhile right <n :\n catched += cities[right]\n right+=1\nprint(catched)", "n,p = map(int,input().split())\r\na = list(map(int,input().split()))\r\nif (n==1 or p==1 or p==n):\r\n print(sum(a))\r\n \r\nelse:\r\n c = a[p-1]\r\n k = p\r\n for i in range(1,min(p-1,n-p)+1):\r\n if a[p-i-1] + a[p+i-1] == 2: \r\n c = c+2\r\n k = i\r\n print(c + sum(a[p+k:]) if p<=n//2 else c + sum(a[:p-k-1]))\r\n\r\n", "def main():\r\n n, a = map(int, input().split())\r\n a -= 1\r\n arr = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(n):\r\n if arr[i]:\r\n distance = a - i\r\n j = a + distance\r\n if (j < 0) or (j >= n) or (i == j) or (arr[i] == arr[j]):\r\n ans += 1\r\n print(ans)\r\n\r\n\r\n# for _ in range(int(input())):\r\n# main()\r\nmain()\r\n", "N= list(map(int,input().split()))\r\ncr= list(map(int,input().split()))\r\nCrim = 0\r\ntest=[N[0]-N[1],N[1]-1]\r\nstayindex = N[1] - 1\r\nif(cr[stayindex]==1):\r\n Crim+=1\r\nfor i in range(1,max(test)+1):\r\n if((stayindex+i) < N[0] and (stayindex-i)>=0):\r\n if(cr[(stayindex+i)] ==1 and cr[(stayindex-i)] ==1):\r\n Crim+=2\r\n elif((stayindex+i)>= N[0 and (stayindex-i)>=0]):\r\n if(cr[(stayindex-i)] == 1):\r\n Crim+=1\r\n elif ((stayindex+i) < N[0] and (stayindex - i) < 0):\r\n if (cr[(stayindex +i)]== 1):\r\n Crim+= 1\r\n\r\n\r\n\r\nprint(Crim)\r\n", "buff = input().split(\" \")\r\nn = int(buff[0])\r\na = int(buff[1])\r\nt = input().split(\" \")\r\nres = 0\r\nif n-a > a-1:\r\n for _ in range((n-a)-(a-1)):\r\n t.append(\"1\")\r\n for i in range(n-a+1):\r\n if t[a+i-1] == \"1\" and t[a-i-1] == \"1\":\r\n if i == 0 or (a+i-1 < 0 or a+i-1 >= n) or (a-i-1 < 0 or a-i-1 >= n):\r\n res += 1\r\n else:\r\n res += 2\r\nelse:\r\n for _ in range((a-1)-(n-a)):\r\n t.append(\"1\")\r\n for i in range(a):\r\n if t[a+i-1] == \"1\" and t[a-i-1] == \"1\":\r\n if i == 0 or (a+i-1 < 0 or a+i-1 >= n) or (a-i-1 < 0 or a-i-1 >= n):\r\n res+=1\r\n else:\r\n res+=2\r\nprint(res)", "n, a = map(int, input().split())\r\ncriminals = list(map(int, input().split()))\r\n\r\ncatch_count = criminals[a - 1] # Catch the criminal in Limak's city\r\n\r\nfor i in range(1, n):\r\n left_city = a - i\r\n right_city = a + i\r\n\r\n if left_city >= 1 and right_city <= n:\r\n # Check both left and right sides for criminals\r\n if criminals[left_city - 1] and criminals[right_city - 1]:\r\n catch_count += 2\r\n elif left_city >= 1:\r\n # Check only the left side for criminals\r\n if criminals[left_city - 1]:\r\n catch_count += 1\r\n elif right_city <= n:\r\n # Check only the right side for criminals\r\n if criminals[right_city - 1]:\r\n catch_count += 1\r\n\r\nprint(catch_count)\r\n", "num,x=input().split()\r\nnum=int(num)\r\nx=int(x)\r\nx-=1\r\nsum=0\r\nl=list(map(int,input().split()))\r\nif l[x] == 0:\r\n sum += 0\r\nelse:\r\n sum += 1\r\nfor i in range(1,num):\r\n\r\n if x+i<num and x-i>=0:\r\n if l[x+i]+l[x-i]==0:\r\n sum+=0\r\n elif l[x+i]+l[x-i]==1:\r\n sum += 0\r\n elif l[x+i]+l[x-i]==2:\r\n sum += 2\r\n if x+i>=num and x-i >=0:\r\n if l[x-i]==0:\r\n sum+=0\r\n elif l[x-i]==1:\r\n sum+=1\r\n if x+i<num and x-i<0:\r\n if l[x+i]==0:\r\n sum+=0\r\n elif l[x+i]==1:\r\n sum+=1\r\n if x+i >=num and x-i < 0:\r\n break\r\nprint(sum)\r\n", "n, index = map(int, input().split())\r\ncities = list(map(int, input().split()))\r\nindex = index - 1\r\nleft, right = index - 1, index + 1\r\n\r\ncount = 1 if cities[index] == 1 else 0\r\n\r\nwhile right < len(cities) or left >= 0:\r\n if left < 0 and right < len(cities):\r\n if cities[right] == 1:\r\n count, right = count + 1, right + 1\r\n continue\r\n \r\n\r\n if right >= len(cities) and left >= 0:\r\n if cities[left] == 1:\r\n count, left = count + 1, left - 1\r\n continue\r\n \r\n if cities[left] == 1 and cities[right] == 1:\r\n count = count + 2\r\n\r\n right, left = right + 1, left - 1\r\n\r\n\r\nprint(count)", "n, a = map(int, input().split())\na -= 1\nb = [1] * n + [*map(int, input().split())] + [1] * n\nprint(sum(b[n + a - abs(a - x)] * b[n + a + abs(a - x)] for x in range(n)))\n", "n, a = map(int,input().split())\r\nt = list(map(int,input().split()))\r\ndis = [0 for i in range(100)]\r\ncount = [0 for i in range(100)]\r\n\r\nfor i in range(n):\r\n dis[abs(a-1-i)] += 1\r\n if t[i]:\r\n count[abs(a-1-i)]+=1\r\nans = 0\r\nfor i in range(n):\r\n if dis[i]==count[i]:\r\n ans += count[i]\r\nprint(ans)\r\n", "n,a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nres = 0\r\nleftside = a-1\r\nrightside = n-a\r\nif leftside ==rightside:\r\n rest = []\r\nelif leftside>rightside:\r\n rest =arr[:a-rightside-1]\r\nelse:\r\n rest=arr[a+leftside:]\r\nmini = min(rightside,leftside)\r\nfor i in range(1,mini+1):\r\n val = arr[a+i-1]\r\n val2 = arr[a-i-1]\r\n if val2==val==1:\r\n res+= 2\r\nfor i in rest:\r\n if i==1:\r\n res+= 1\r\nif arr[a-1]==1:\r\n res+= 1\r\nprint(res)\r\n", "n,k=map(int,input().split())\narr=list(map(int,input().split()))\ni=k-1\nl=i\nh=i\nc=0\nwhile(l>=0 and h<n):\n if(l==i and h==i and arr[i]==1):\n c+=1\n else:\n if(arr[l]==1 and arr[h]==1):\n c+=2\n l-=1\n h+=1\n\nwhile(l>=0):\n if(arr[l]==1):\n c+=1\n l-=1\n\nwhile(h<n):\n if(arr[h]==1):\n c+=1\n h+=1\n\nprint(c)\n\n \n \n ", "def _input(): return map(int ,input().split())\r\n\r\nn, a= _input()\r\nlst = [0] + list(_input())\r\nres = 0\r\nif lst[a] == 1: res+=1\r\ni = 1\r\nwhile True:\r\n if a-i > 0:\r\n if lst[a-i] == 1:\r\n if a+i <= n:\r\n if lst[a+i] == 1: res+=2\r\n if a-i <= 0:\r\n if a+i <=n:\r\n if lst[a+i] == 1: res+=1\r\n if a+i>n:\r\n if a-i > 0:\r\n if lst[a-i] == 1: res+=1\r\n if a-i <= 0 and a+i > n : break\r\n i+=1\r\n \r\nprint(res)", "# your code goes here\r\n\r\nn, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\n\r\na -= 1\r\ncrims = 0\r\nif t[a] == 1:\r\n\tcrims += 1\r\n\r\ndown, up = a-1, a+1\r\n\r\nwhile down >= 0 or up < len(t):\r\n\tif down < 0 and t[up] == 1:\r\n\t\tcrims += 1\r\n\telif up >= len(t) and t[down] == 1:\r\n\t\tcrims += 1\r\n\telif down >=0 and up < len(t) and t[down] == 1 and t[up] == 1:\r\n\t\tcrims += 2\r\n\tdown -=1\r\n\tup +=1\r\nprint(crims)", "import sys\n\ndef main(k, robbers):\n smaller = min(k, len(robbers) - k - 1)\n\n s = 0\n for e, rob in enumerate(robbers):\n if e == k:\n s += rob\n elif abs(k - e) > smaller:\n s += rob\n \n for i in range(k):\n if abs(k - i) <= smaller:\n # Ambiguity.\n if robbers[i] + robbers[k + abs(i - k)] > 1:\n s += 2\n print(s)\n\nif __name__ == \"__main__\":\n cases = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n _, k = map(int, line.strip().split())\n cases = list(map(int, line.strip().split()))\n main(k - 1, cases)\n", "m,n=map(int,input().split())\r\nn=n-1\r\nl=list(map(int,input().split()))\r\nif m//2>n:\r\n k=n\r\n s=0\r\n for i in range(1,k+1):\r\n if l[n-i]==1 and l[n+i]==1:\r\n s=s+2\r\n \r\n \r\n for j in range(n+k+1,m):\r\n if l[j]==1:\r\n s=s+1\r\nelse:\r\n k=m-1-n\r\n s=0\r\n for i in range(1,k+1):\r\n if l[n-i]==1 and l[n+i]==1:\r\n s=s+2\r\n for j in range(n-k):\r\n if l[j]==1:\r\n s=s+1\r\nif l[n]==1:\r\n print(s+1)\r\nelse:\r\n print(s)\r\n\r\n \r\n ", "# Problem Statement:\r\n\"\"\"\r\nThere are n cities in Bearland, numbered 1 through n. Cities are arranged in one long row. The distance between cities i and j is equal to |i - j|.\r\n\r\nLimak is a police officer. He lives in a city a. His job is to catch criminals. It's hard because he doesn't know in which cities criminals are. Though, he knows that there is at most one criminal in each city.\r\n\r\nLimak is going to use a BCD (Bear Criminal Detector). The BCD will tell Limak how many criminals there are for every distance from a city a. After that, Limak can catch a criminal in each city for which he is sure that there must be a criminal.\r\n\r\nYou know in which cities criminals are. Count the number of criminals Limak will catch, after he uses the BCD.\r\n\"\"\"\r\n# Input:\r\n\"\"\"\r\nThe first line of the input contains two integers n and a (1 ≤ a ≤ n ≤ 100) — the number of cities and the index of city where Limak lives.\r\n\r\nThe second line contains n integers t1, t2, ..., tn (0 ≤ ti ≤ 1). There are ti criminals in the i-th city.\r\n\"\"\"\r\n# Output: Print the number of criminals Limak will catch.\r\n\r\ndef bcd(n: int, a: int, t: list) -> int:\r\n counter = 1 if t[a] == 1 else 0\r\n for i in range(1, n):\r\n right = a + i\r\n left = a - i\r\n if left >= 0 or right < n:\r\n if left >= 0 and right < n:\r\n if t[left] and t[right]: counter += 2\r\n elif left >= 0:\r\n if t[left]: counter += 1\r\n elif right < n:\r\n if t[right]: counter += 1\r\n\r\n return counter\r\n\r\n\r\nif __name__ == '__main__':\r\n line = input()\r\n n, a = line.split(' ')\r\n line = input()\r\n t = [int(x) for x in line.split(' ')]\r\n ans = bcd(int(n), int(a) - 1, t)\r\n print(ans)\r\n", "n,a = map(int,input().split())\narr = list(map(int,input().split()))\ni,j = a-2,a\nans = 1 if(arr[a-1]==1) else 0\nwhile(i>=0 and j<n):\n if(arr[i] == arr[j]):\n ans+=2*arr[i]\n i-=1\n j+=1\nwhile(i>=0):\n if(arr[i]==1):\n ans+=1\n i-=1\nwhile(j<n):\n if(arr[j]==1):\n ans+=1 \n j+=1\nprint(ans)", "n,a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\na -= 1\r\nans = 0\r\nfor i in range(n):\r\n if(arr[i] == 1):\r\n diff = a - i\r\n mirror = a + diff\r\n if(mirror < 0 or mirror > n - 1 or arr[mirror] == 1):\r\n ans += 1\r\nprint(ans)", "n, a = map(int, input().split())\ncities = list(map(int, input().split()))\noutput = sum(cities)\n\nfor i in range(a, len(cities)):\n if i-a+1 < a and cities[i] != cities[(a-1)-(i-a+1)]: output -= 1\n \nprint(output)", "def to_list(s):\r\n return list(map(lambda x: int(x), s.split(' ')))\r\n\r\ndef solve(a,k):\r\n count = 0\r\n if len(a) - k > k - 1:\r\n left = False\r\n right = True\r\n elif k - 1 > len(a) - k:\r\n left = True\r\n right = False\r\n else:\r\n left = False\r\n right = False\r\n \r\n min_dist = min(len(a)-k,k-1)\r\n if a[k-1] == 1:\r\n count += 1\r\n for i in range(1,min_dist+1):\r\n if (a[k-i-1] == 1) & (a[k+i-1] == 1):\r\n count += 2\r\n \r\n if left:\r\n for i in range(k-min_dist-1):\r\n if a[i] == 1:\r\n count += 1\r\n if right:\r\n for i in range(k+min_dist,len(a)):\r\n if a[i] == 1:\r\n count += 1\r\n return count\r\n\r\nn, k = to_list(input())\r\na = to_list(input())\r\nprint(solve(a,k))", "n, a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na -= 1\r\n\r\ncount = 0\r\nif t[a] == 1:\r\n count += 1\r\ni = 1\r\nwhile a-i >= 0 or a+i <= n-1:\r\n if a-i >= 0 and not a+i <= n-1:\r\n if t[a-i] == 1:\r\n count += 1\r\n elif not a-i >= 0 and a+i <= n-1:\r\n if t[a+i] == 1:\r\n count += 1\r\n\r\n elif t[a+i] and t[a-i] == 1:\r\n count += 2\r\n i += 1\r\n\r\nprint(count)\r\n", "n, a = list(map(int, input().split()))\r\ncities = list(map(int, input().split()))\r\ncount = 0\r\nmove = 1\r\n\r\nwhile (a-1) - move >= 0 and (a-1) + move <= n-1:\r\n if cities[(a-1) - move] == 1 and cities[(a-1) + move] == 1:\r\n count += 2\r\n move += 1\r\n\r\n#right\r\nfor i in range((a-1)+move, n):\r\n if cities[i] == 1:\r\n count += 1\r\n#left\r\nfor i in range((a-1)-move, -1, -1):\r\n if cities[i] == 1:\r\n count += 1\r\n\r\nif cities[a-1] == 1:\r\n count += 1\r\n\r\nprint(count)", "n, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\na -= 1\r\nfor i in range(n):\r\n if i == 0:\r\n count += arr[a]\r\n elif a + i < n and a - i > -1:\r\n if arr[a + i] == 1 and arr[a - i] == 1:\r\n count += 2\r\n elif a + i < n:\r\n count += arr[a + i]\r\n elif a - i > -1:\r\n count += arr[a - i]\r\nprint(count)\r\n\r\n", "cty,loc=map(int,input().split())\r\ncrim=list(map(int, input().split()))\r\ncoont=0\r\nif crim[loc-1]==1:\r\n coont+=1\r\nfor i in range(1000):\r\n \r\n\r\n if i==0:\r\n continue\r\n \r\n if loc-1-i>=0 and loc+i-1<cty:\r\n if crim[loc-1-i]==1 and crim[loc+i-1]==1:\r\n coont+=2\r\n \r\n elif loc-1-i>=0:\r\n if crim[loc-1-i]==1:\r\n coont+=1\r\n \r\n elif loc+i-1<cty and crim[loc+i-1]==1:\r\n coont+=1\r\n \r\nprint(coont)", "n,a = input().split()\r\nn = int(n)\r\na = int(a)-1\r\n\r\nd = input().split()\r\nd = [int(i) for i in d]\r\ncount = 0\r\n\r\nfor i in range(a+1):\r\n if(i==0):\r\n if(d[a]==1):\r\n count+=1\r\n else:\r\n r = a + i\r\n l = a - i\r\n if(r<n) and (l>=0):\r\n if(d[r]==1 and d[l]==1):\r\n count+=2\r\n else:\r\n if l<0:\r\n if d[r]==1:\r\n count+=1\r\n else:\r\n if(d[l]==1):\r\n count+=1\r\nfor i in range(2*a+1,n):\r\n if d[i]==1:\r\n count+=1\r\nprint(count)", "import math\r\nn,a=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nc=0\r\nif(b[a-1]==1):\r\n c+=1\r\nif(a<=math.ceil(n/2)):\r\n for i in range(1,a):\r\n if(b[a-1-i]==1 and b[a-1+i]==1):\r\n c+=2\r\n j=2*(a-1)+1\r\n c1=b[j:].count(1)\r\n print(c+c1)\r\nelse:\r\n for i in range(1,n-a+1):\r\n if (b[a - 1 - i] == 1 and b[a - 1 + i] == 1):\r\n c += 2\r\n j=2*a-2-n\r\n c1 = b[0:j+1].count(1)\r\n print(c + c1)", "n, a = map(int, input().split())\na -= 1\nt = [x == \"1\" for x in input().split()]\nans = t[a]\nfor i in range(1, max(a + 1, n - a + 1)):\n bools = []\n if a >= i:\n bools.append(t[a - i])\n if a + i < n:\n bools.append(t[a + i])\n ans += len(bools) * all(bools)\nprint(ans)\n", "# cook your dish here\r\nn,a= input().split()\r\nn=int(n)\r\na=int(a)\r\n\r\narr=[int(x) for x in input().split()]\r\n\r\ncount=0\r\np=a-1\r\npoint1=p-1\r\npoint2=p+1\r\nif arr[p]==1:\r\n count+=1\r\n \r\nfor i in range(0,len(arr)):\r\n if point1>=0 and point2<=n-1:\r\n if arr[point1]==1 and arr[point2]==1:\r\n count+=2\r\n point1-=1\r\n point2+=1\r\n elif point1<0 and point2<=n-1:\r\n if arr[point2]==1:\r\n count+=1\r\n point2+=1\r\n elif point1>=0 and point2>n-1:\r\n if arr[point1]==1:\r\n count+=1\r\n point1-=1\r\n else:\r\n break\r\nprint(count)\r\n ", "n, o = map(int, input().split(' '))\nbcn = list(map(int, input().split(' ')))\ntable = [0 for _ in range(max(n-o+1, o+1))]\npossible = [0 for _ in range(max(n-o+1, o+1))]\ncriminal = 0\n\nfor i in range(1, n+1):\n\tpossible[abs(i-o)] += 1\n\nfor i, x in enumerate(bcn, 1):\n\ttable[abs(o-i)] += x\n\nfor (x, y) in zip(table, possible):\n\tif x == y:\n\t\tcriminal += x\n\nprint(criminal)\n", "n,a = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nlst = [0]+lst\r\nans=0\r\n\r\nfor i in range(1, n+1):\r\n if lst[i]:\r\n d = i-a\r\n j = a-d\r\n \r\n if j<1 or j>n or lst[i]==lst[j]:\r\n ans+=1\r\n \r\nprint(ans)", "n,d= map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum = sum(a)\r\nd=d-1\r\n# print(d)\r\nfor i in range(n):\r\n# print(a[d-i]+a[d+i])\r\n if d-i>=0 and d+i<n:\r\n if a[d-i]+a[d+i]==1:\r\n sum-=1\r\n \r\nprint(sum)\r\n ", "n,a = map(int,input().split())\r\n\r\n\r\nvalues = [0]\r\nvalues.extend( list(map(int,input().split())))\r\n\r\nsum_= sum(values)\r\ndis = 1\r\nwhile dis < a and dis<= n-a:\r\n if values[a+dis] + values[a-dis]==1:\r\n sum_-=1\r\n \r\n dis+=1\r\n \r\nprint(sum_)", "n,m=list(map(int,input().split()))\r\ncr=list(map(int,input().split()))\r\nst,ed,ans=m-1,m-1,0\r\nwhile st>=0 and ed<=n-1 :\r\n if st>=0 and ed<=(n-1) :\r\n if cr[st] == cr[ed] == 1 and st!=ed :ans+=2\r\n elif cr[st] == cr[ed] == 1 and st==ed:ans+=1\r\n st-=1\r\n ed+=1\r\nif st<0 and ed<=(n-1):ans+=cr[ed:].count(1)\r\nelif ed>=(n-1) and st>=0:ans+=cr[:st+1].count(1)\r\nprint(ans)", "x = lambda: map(int, input().split())\r\na, b = x(); c = list(x()); i = j = b - 1; s = sum(c)\r\nwhile(i >= 0 and j < a):\r\n if c[i] + c[j] == 1:\r\n s -= 1\r\n i -= 1; j += 1\r\nprint(s)", "'''\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\nN , index = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nindex -=1\r\ncnt = 0\r\nif(arr[index]==1):\r\n\tcnt+=1\r\ni = 1\r\nwhile index-i>=0 and index+i<N:\r\n\tif(arr[index-i]==1 and arr[index+i]==1):\r\n\t\tcnt+=2\r\n\ti+=1\r\nwhile index-i>=0:\r\n\tif arr[index-i]==1:\r\n\t\tcnt+=1\r\n\ti+=1\r\nwhile index+i<N:\r\n\tif arr[index+i]==1:\r\n\t\tcnt+=1\r\n\ti+=1\r\nprint(cnt)", "# Wadea #\r\n\r\na,n = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nl,r = n-1,n-1\r\nans = 0\r\nif a == 1:\r\n if arr[0] == 1:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n while l >= 0 or r < a:\r\n if l == n-1 and r == n-1:\r\n if arr[l] == 1 and arr[r] == 1:\r\n ans += 1\r\n l -= 1\r\n r += 1\r\n elif l >= 0 and r < a:\r\n if arr[l] == 1 and arr[r] == 1:\r\n ans += 2\r\n l -= 1\r\n r += 1\r\n elif l >= 0:\r\n if arr[l] == 1:\r\n ans += 1\r\n l -= 1\r\n elif r < a:\r\n if arr[r] == 1:\r\n ans += 1\r\n r += 1\r\n if l == -1 and r >= a:\r\n break\r\n print(ans)\r\n ", "n,a=map(int,input().split())\r\ncriminals=list(map(int,input().split()))\r\nlist1=[]\r\nfor i in range(n):\r\n list1.append([i+1,abs(a-i-1),criminals[i]])\r\nlist2=[] \r\nfor i in range(n):\r\n if(list1[i][2]==0):\r\n dis=list1[i][1]\r\n for j in range(n):\r\n if(list1[j][1]==dis):\r\n if(list1[i] not in list2):\r\n list2.append(list1[i])\r\n if(list1[j] not in list2):\r\n list2.append(list1[j])\r\n \r\nprint(len(list1)-len(list2))", "# link: https://codeforces.com/contest/680/problem/B\r\nif __name__ == \"__main__\":\r\n n,a = list(map(int, input().split()))\r\n criminals = list(map(int, input().split()))\r\n if (a==1) or (a==n):\r\n c = 0\r\n for i in range(n):\r\n if criminals[i] == 1:\r\n c += 1\r\n print(c) \r\n else:\r\n a = a - 1\r\n m = min(a, (n-1-a))\r\n if abs(a-m) == 0:\r\n start = 0\r\n end = a + m\r\n c = 0\r\n s = end\r\n while start<=end:\r\n if criminals[start] == 1 and criminals[end] == 1: \r\n c = c + 2 \r\n start = start + 1\r\n end = end - 1\r\n if s+1<n: \r\n for i in range(s+1,n):\r\n if criminals[i] == 1:\r\n c += 1\r\n if criminals[a] == 1:\r\n print(c-1)\r\n else:\r\n print(c) \r\n\r\n elif (a+m) == n-1:\r\n start = abs(a-m)\r\n end = n-1\r\n c = 0\r\n e = start\r\n while start<=end:\r\n if criminals[start] == 1 and criminals[end] == 1:\r\n c = c + 2\r\n start = start + 1\r\n end = end - 1\r\n for i in range(0,e):\r\n if criminals[i] == 1:\r\n c += 1\r\n if criminals[a] == 1:\r\n print(c-1)\r\n else:\r\n print(c) \r\n", "n, a = [int(x) for x in input().split()]\ninp = [int(x) for x in input().split()]\n\nres = inp[a-1]\nleft = a - 2\nright = a\nwhile left >= 0 and right < len(inp):\n res += (inp[left] and inp[right]) * 2\n left -= 1\n right += 1\n\nwhile left >= 0:\n res += inp[left]\n left -= 1\n\nwhile right < len(inp):\n res += inp[right]\n right += 1\n\nprint(res)\n", "n,a = map(int,input().split())\r\ncities = [int(x) for x in input().split()]\r\ns = 0\r\nif cities[a - 1] == 1:\r\n s += 1\r\n\r\nright = cities[a:len(cities)]\r\nleft = cities[0:a - 1]\r\nleft.reverse()\r\n\r\ndiff = abs(len(right) - len(left))\r\nif len(right) > len(left):\r\n left += diff*[-1]\r\nelse:\r\n right += diff*[-1]\r\n\r\nfor l,r in zip(left,right):\r\n if l * r == 1:\r\n s += 2\r\n elif l * r == -1:\r\n s += 1\r\n\r\nprint(s)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, a = map(int,input().split())\r\nt = [0] + list(map(int, input().split()))\r\nans = t[a]\r\nfor i in range(1, n):\r\n u, v = 0, 0\r\n for j in [a - i, a + i]:\r\n if 0 < j <= n:\r\n u += 1\r\n v += t[j]\r\n if u == v:\r\n ans += u\r\nprint(ans)", "n, p = map(int, input().split())\r\na, res, p = list(map(int, input().split())), 0, p - 1\r\nfor x in range(p + 1, n):\r\n if a[x] == 1 and ((p << 1) < x or a[(p << 1) - x] == 1): res += 1\r\nfor x in range(p - 1, -1, -1):\r\n if a[x] == 1 and ((p << 1) - x >= n or a[(p << 1) - x] == 1): res += 1 \r\nprint(res + a[p])", "n,k=map(int,input().split())\r\nk-=1\r\nx=list(map(int,input().split()))\r\ny=[0]*n\r\nz=[0]*n\r\nfor i in range(n):\r\n if x[i]==1:\r\n y[abs(i-k)]+=1\r\n z[abs(i-k)]+=1\r\nc=0\r\nfor i in range(n):\r\n if z[i]==y[i]:\r\n c+=z[i]\r\nprint(c)", "cities_count, officer_city = map(int, input().split())\r\ncriminal_detector = list(map(int, input().split()))\r\nofficer_city -= 1\r\n\r\ncatched_criminal = int(criminal_detector[officer_city] == 1)\r\n\r\nfor i in range(1, cities_count):\r\n zone_cities_count = 0\r\n zone_criminal_count = 0\r\n if officer_city - i >= 0:\r\n zone_criminal_count += criminal_detector[officer_city - i]\r\n zone_cities_count += 1\r\n if officer_city + i < cities_count:\r\n zone_criminal_count += criminal_detector[officer_city + i]\r\n zone_cities_count += 1\r\n\r\n if zone_cities_count == zone_criminal_count:\r\n catched_criminal += zone_cities_count\r\n\r\nprint(catched_criminal)\r\n", "n, a = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ni = 1\r\na -= 1\r\ntot = lst[a]\r\n\r\nwhile a - i >= 0 and a + i < n:\r\n if lst[a - i] == 1 and lst[a + i] == 1:\r\n tot += 2\r\n i += 1\r\n\r\nif a - i < 0:\r\n while a + i < n:\r\n if lst[a + i] == 1:\r\n tot += 1\r\n i += 1\r\nelse:\r\n while a - i >= 0:\r\n if lst[a - i] == 1:\r\n tot += 1\r\n i += 1\r\n\r\nprint(tot)\r\n", "n,a = map(int, input().split())\r\na-=1\r\nnums = list(map(int, input().split()))\r\n\r\ncount = 0\r\ni=j=a\r\nwhile i>-1 and j<n:\r\n if nums[i] + nums[j] == 2 or (i==j and nums[i]==1):\r\n count += 2 if i!=j else 1\r\n i-=1\r\n j+=1\r\n\r\nwhile i>-1:\r\n count += nums[i]\r\n i-=1\r\n\r\nwhile j<n:\r\n count += nums[j]\r\n j+=1\r\n\r\nprint(count)", "'''input\r\n5 2\r\n0 0 0 1 0\r\n\r\n\r\n'''\r\n\r\ns = input()\r\ns = s.split()\r\nn = int(s[0])\r\nk = int(s[1])-1\r\n\r\narr = [int(x) for x in input().split()]\r\nbcd = {}\r\n\r\nfor i in range(n):\r\n\td = abs(i-k)\r\n\tif d in bcd:\r\n\t\tbcd[d][0] += 1\r\n\t\tbcd[d][1] += arr[i]\r\n\telse:\r\n\t\tbcd[d] = [1,arr[i]]\r\n\r\ncount = 0\r\nfor key in bcd:\r\n\tif bcd[key][0] == bcd[key][1]:\r\n\t\tcount += bcd[key][1]\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\t\t", "import sys\r\nimport math\r\nfrom typing import Callable\r\n\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, a = (int(i) for i in read().split())\r\n values: list[int] = [int(i) for i in read().split()]\r\n left: int = a - 1\r\n right: int = a - 1\r\n criminals_caught: int = 0\r\n while left >= 0 or right < len(values):\r\n if left < 0 and values[right]:\r\n criminals_caught += 1\r\n elif values[left] and right >= len(values):\r\n criminals_caught += 1\r\n elif values[left] and values[right]:\r\n criminals_caught += 2 if left != right else 1\r\n left -= 1\r\n right += 1\r\n\r\n print(criminals_caught)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,a=[int(x) for x in input().split()]\r\na-=1\r\nt=[int(x) for x in input().split()]\r\nans=sum(t)\r\nl=a-1\r\nr=a+1\r\nwhile l>=0 and r<n:\r\n ans-=(t[l]+t[r])%2\r\n l-=1\r\n r+=1\r\nprint(ans)", "n,a = map(int,input().split())\r\nt = list(map(int,input().split()))\r\naps = 0 \r\nif t[a-1] == 1:aps+=1\r\nfor d in range(1,max((n-a+1),a)):\r\n if a-d>0 and a+d<=n:\r\n if t[a-d-1]==t[a+d-1]==1:aps+=2\r\n elif a-d<=0:\r\n if t[a+d-1]==1:aps+=1\r\n elif a+d>n:\r\n if t[a-d-1]==1:aps+=1\r\nprint(aps)", "n,a = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na-=1\r\nres = t[a]\r\nl=a-1\r\nr=a+1\r\nwhile l>=0 and r<n:\r\n add = ((t[l]+t[r])//2)*2\r\n res += add\r\n l-=1\r\n r+=1\r\nif r<n: res += t[r:].count(1)\r\nif l>=0: res += t[:l+1].count(1)\r\nprint(res)", "n, a = map(int, input().split())\r\nt = list(map(int, input().strip().split()))\r\n\r\n\r\ncount = 0\r\n\r\nif t[a-1] == 1:\r\n count += 1\r\n\r\nfor j in range(1, len(t)):\r\n if a - j >= 1 and a + j <= len(t):\r\n if t[a-j-1] + t[a+j-1] == 2:\r\n count += 2\r\n elif t[a-j-1] + t[a+j-1] == 1:\r\n continue\r\n else:\r\n if a - j < 1 and a + j <= len(t) and t[a+j-1] == 1:\r\n count += 1\r\n elif a + j > len(t) and a - j >= 1 and t[a-j-1] == 1:\r\n count += 1\r\n \r\nprint(count)", "n, a = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 1 if arr[a-1] == 1 else 0\r\nl = arr[:a-1][::-1]\r\nr = arr[a:]\r\ni=-1\r\nfor i in range(min(len(l), len(r))):\r\n ans += 2 if (l[i] == r[i] and l[i] == 1) else 0\r\nif i+1<len(l):\r\n ans+=(sum(l[i+1:]))\r\nif i+1<len(r):\r\n ans+=(sum(r[i+1:]))\r\n pass\r\nprint(ans)", "import sys\nn,a = map(int,input().split())\narr = list(map(int,input().split()))\ni,j = a-1,a-1\nans = 0\nwhile i>=0 and j<=n-1:\n if i == j:\n ans = ans + (arr[i] and arr[j])\n else:\n ans = ans + 2*(arr[i] and arr[j])\n i-=1\n j+=1\nif i==-1 and j!=n:\n print(ans+arr[j:].count(1))\nelif i!=-1 and j==n:\n print(ans+arr[0:i+1].count(1))\nelif i==-1 and j==n:\n print(ans)\n\n'''\n20 17\n11011110101110110000\n'''\n", "a, b = input().split()\r\nn = input().split()\r\na = int(a) -1\r\nb = int(b) -1\r\nlis = []\r\nfor i in range(len(n)):\r\n element = int(n[i])\r\n if element == 1:\r\n lis.append(abs(b-i))\r\n n[i] = '0'\r\n\r\n\r\nlis.sort()\r\ncount = 0\r\nflag = 0\r\nfor i in range(len(lis)):\r\n if flag == 0:\r\n if b - lis[i] >= 0 and b + lis[i] < len(n):\r\n if lis.count(lis[i]) == 2:\r\n count += 2\r\n n[b - lis[i]] = '1'\r\n n[b + lis[i]] = '1'\r\n flag = 1\r\n elif lis[i] == 0:\r\n n[b] = '1'\r\n count += 1\r\n elif b - lis[i] >= 0 or b + lis[i] <= len(n):\r\n if b - lis[i] >= 0:\r\n count += 1\r\n n[b-lis[i]] = '1'\r\n else:\r\n count += 1\r\n n[b + lis[i]] = '1'\r\n else:\r\n flag =0\r\n\r\n# # # # # # # 6 3\r\n# 1 1 1 0 1 0\r\n# # 5 2\r\n# 0 0 0 1 0\r\nprint(count)", "n, a = [int(i) for i in input().split()]\r\nlst = [int(i) for i in input().split()]\r\n\r\na = a - 1\r\ncount = 0\r\nif lst[a] == 1: count += 1\r\n\r\nfor i in range(1, n):\r\n l = a - i; r = a + i\r\n \r\n if l >= 0 or r < n:\r\n if l >= 0 and r < n:\r\n if lst[l] == 1 and lst[r] == 1:\r\n count += 2\r\n elif r < n:\r\n if lst[r] == 1:\r\n count += 1\r\n elif l >= 0:\r\n if lst[l] == 1:\r\n count += 1\r\nprint(count)", "s=0\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif l[m-1]==1:s+=1\r\nfor x in range(1,n):\r\n\tif m-x-1>=0 and m-1+x<n:\r\n\t\tif l[m-1-x]==1 and l[m-1+x]==1:s+=2\r\n\telif (m-1+x<n and l[m-1+x]==1) or (m-1-x>=0 and l[m-1-x]==1):s+=1\r\nprint(s)", "n,a=map(int, input().split())\r\nt=input().split()\r\n\r\nc=0\r\nb=a-1\r\nif t[b]=='1':\r\n c+=1\r\nRl=t[:b]\r\nLl=t[b+1:]\r\n\r\n\r\nwhile Rl and Ll:\r\n if Rl[-1]==Ll[0] and Rl[-1]=='1':\r\n c+=2\r\n Rl.pop()\r\n Ll.pop(0)\r\nif Rl:\r\n c+=Rl.count('1')\r\nif Ll:\r\n c+=Ll.count('1')\r\nprint(c)\r\n", "cities, live = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ntotal = arr[live-1]\r\nl = live - 2\r\nr = live\r\nwhile l >= 0 or r < len(arr):\r\n if l < 0:\r\n total += arr[r]\r\n r += 1\r\n elif r >= len(arr):\r\n total += arr[l]\r\n l -= 1\r\n else:\r\n if arr[l] and arr[r]:\r\n total += 2\r\n l -= 1\r\n r += 1\r\nprint(total)", "import sys\r\ndef solve(L,a):\r\n i = a-2 ; j = a ; Count = 0\r\n if L[a-1]==1:Count=1\r\n while i>=0 and j<len(L):\r\n if L[i]==1 and L[j]==L[i]:\r\n Count+=2\r\n i-=1 ; j+=1\r\n if j==len(L):\r\n Count+=sum(L[:i+1:])\r\n else:\r\n Count+=sum(L[j::])\r\n return(Count)\r\nn,a = map(int,input().split(\" \"))\r\nL = list(map(int,sys.stdin.readline().split(\" \")))\r\nprint(solve(L,a))\r\n ", "arr1=list(map(int,input().split()))\r\n\r\ndef proB(arr,k):\r\n k=k-1\r\n ans=arr[k]\r\n temp1=arr[:k]\r\n temp1=temp1[::-1]\r\n temp2=arr[k+1:]\r\n i,j=0,0\r\n \r\n while(i<len(temp1) and j<len(temp2)):\r\n if(temp1[i]==1 and temp2[j]==1):\r\n ans+=2\r\n i+=1\r\n j+=1\r\n \r\n if(temp1[i:]==[]):\r\n ans+= temp2[j:].count(1)\r\n else:\r\n ans+= temp1[i:].count(1)\r\n return ans\r\n \r\n \r\nn,m=arr1[0],arr1[1]\r\nfor i in range(1):\r\n arr=list(map(int,input().split()))\r\n print(proB(arr,m))", "import sys\r\nimport math\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n\r\n\r\nn,m = map(int,(input().split()))\r\narr1 = [False]*(n)\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nfor i in range(0,len(a)):\r\n\tfor j in range(i+1,len(a)):\r\n\t\tif(abs(i-(m-1)) == abs(j-(m-1)) and a[i] != a[j] ):\r\n\t\t\tarr1[i] = arr1[j] = True \r\n \r\nanswer = 0\r\nfor i in range(n):\r\n\tif(a[i] == 1 and not arr1[i]):\r\n\t\tanswer += 1\r\n\r\nprint(answer)\r\n", "#\tAuthor\t: debugster\r\n#\tEmail\t: [email protected]\r\n#\tDate\t: 2020-06-03 18:14:37\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\nif os.environ.get(\"DEBUGSTER_PYTHON\"):\r\n\tsys.stdin = open('in.txt', 'r')\r\n\tsys.stdout = open('out.txt','w')\r\n\r\nn, a = get_int()\r\nc = get_array()\r\na -= 1\r\nans = 0\r\ni = a - 1\r\nj = a + 1\r\nwhile True:\r\n\tif i < 0 and j >= n:\r\n\t\tbreak\r\n\r\n\tif i >= 0 and j < n and c[i] == 1 and c[j]:\r\n\t\tans += 2\r\n\telif i >= 0 and j >= n and c[i] == 1:\r\n\t\tans += 1\r\n\telif i < 0 and j < n and c[j] == 1:\r\n\t\tans += 1\r\n\r\n\ti -= 1\r\n\tj += 1\r\n\r\nif c[a] == 1:\r\n\tans += 1\r\n\r\nprint(ans)", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn, a = gets(int)\nt = gets(int)\na -= 1\ns = t[a]\nfor i in range(1, n):\n p = 0 <= a - i < n\n q = 0 <= a + i < n\n if p and not q:\n s += t[a - i]\n elif q and not p:\n s += t[a + i]\n elif p and q:\n if t[a - i] and t[a + i]:\n s += 2\nprint(int(s))\n", "n , a = map(int , input().split())\r\narr = list(map(int , input().split()))\r\nans = sum(arr)\r\nl = r = a-1\r\nwhile l >= 0 and r < n :\r\n if arr[l] + arr[r] == 1 :\r\n ans -=1\r\n l -= 1\r\n r += 1\r\nprint(ans)", "n, a = map(int, input().split())\r\nt = [int(x) for x in input().split()]\r\na -= 1\r\ni = a - 1\r\nj = a + 1\r\ncriminals = 0 if t[a] == 0 else 1\r\nwhile i >= 0 or j <= n - 1:\r\n if i >= 0 and j <= n - 1:\r\n if t[i] == t[j] == 1:\r\n criminals += 2\r\n elif i >= 0:\r\n if t[i] == 1:\r\n criminals += 1\r\n else:\r\n if t[j] == 1:\r\n criminals += 1\r\n i -= 1\r\n j += 1\r\nprint(criminals)", "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 \n \nn, a = rl()\na -= 1\n\naa = rl()\n\nans = 0\n\nfor d in range(n):\n\n if d == 0 and aa[a] == 1:\n ans += 1\n continue\n\n criminals = 0\n maxou = 0\n if a + d < n:\n maxou += 1\n if a - d >= 0:\n maxou += 1\n if a + d < n and aa[a + d] == 1:\n criminals += 1\n if a - d >=0 and aa[a - d] == 1:\n criminals += 1\n if criminals == maxou:\n ans += maxou\n\nprint(ans)", "a = list(map(int,input().split(\" \")))\r\nb = list(map(int,input().split(\" \")))\r\n\r\nn = a[0]\r\nnode = a[1]\r\n6\r\nleftHalf = b[:node-1]\r\nleftHalf = leftHalf[::-1]\r\nrightHalf = b[node:]\r\n\r\n# print(leftHalf)\r\n# print(rightHalf)\r\n\r\nminned = min(len(rightHalf),len(leftHalf))\r\ncount = 0\r\n\r\nif b[node-1]==1:\r\n count+=1\r\n # print(\"heyy there\")\r\n\r\nfor i in range(minned):\r\n if leftHalf[i]+rightHalf[i]==2:\r\n # print(\"heyy here\")\r\n count+=2\r\n\r\nif len(rightHalf)<len(leftHalf):\r\n leftHalf = leftHalf[minned:]\r\n count = count + leftHalf.count(1)\r\nelse:\r\n rightHalf = rightHalf[minned:]\r\n count = count + rightHalf.count(1)\r\n\r\nprint(count)", "num, pos = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nans=sum(ls)\r\nmn=min(len(ls[:pos-1]),len(ls[pos:]))\r\nfor i in range(mn):\r\n if ls[pos-2-i]+ls[pos+i]==1:\r\n ans-=1\r\nprint(ans)\r\n" ]

[ "# direct access array\r\nn = int(input())\r\nA = tuple(map(int,input().split()))\r\nm = int(input())\r\nB = tuple(map(int,input().split()))\r\n\r\nD_array = [None] * 100001\r\nfor i in range(0, n):\r\n D_array[A[i]] = i + 1\r\n\r\nV, P = 0, 0\r\nfor i in B:\r\n V += D_array[i]\r\n P += n + 1 - D_array[i]\r\nprint(V, P) ", "arrayLength = int(input())\r\n# array = list(map(int, input().split()))\r\narray = [None] * 1000000\r\nk = 0\r\nfor i in (map(int, input().split())):\r\n array[i] = k+1\r\n k += 1\r\nqueryNum = int(input())\r\nqueries = list(map(int, input().split()))\r\nvasyaCount = 0\r\npetyaCount = 0\r\nfor query in queries:\r\n count = array[query]\r\n vasyaCount = vasyaCount + count\r\n petyaCount = petyaCount + arrayLength - count +1\r\nprint(vasyaCount, petyaCount)\r\n", "from hashlib import new\r\nimport sys\r\nimport threading\r\nfrom sys import stdin, stdout\r\nfrom itertools import accumulate\r\ninput = stdin.readline\r\nprint = stdout.write\r\nimport math\r\n\r\nif __name__ == \"__main__\":\r\n \r\n n = int(input().strip())\r\n\r\n arr = list(map(int, input().strip().split()))\r\n \r\n dict = {x:i for (i,x) in enumerate(arr)}\r\n\r\n front, reverse = 0, 0\r\n\r\n m = int(input().strip())\r\n\r\n queries = list(map(int, input().strip().split()))\r\n\r\n for i in range(m):\r\n pos = dict[queries[i]]\r\n\r\n front += pos + 1\r\n reverse += (n-pos)\r\n '''if pos == (n-pos):\r\n continue\r\n elif pos < (n-pos):\r\n front += 1\r\n else:\r\n reverse += 1'''\r\n\r\n print(f\"{front} {reverse}\\n\")", "'''\r\n\r\n\n\n24.06.2021\r\n\r\n\n\nCF 140 B\r\n\r\n\n\n'''\r\n\r\n\n\nn = int (input ())\r\n\nss = input ().split (' ')\r\n\na = [0]*n\n\r\nc = [0]*(n+1)\n\r\nfor i in range (0, n) :\r\n\n a [i] = int (ss [i])\r\n\n c [a [i]] = i + 1\n\n\r\n\r\nm = int (input ())\n\r\nss = input ().split (' ')\r\n\nk1, k2 = 0, 0\r\n\nfor i in range (0, m) :\r\n\n b = int (ss [i])\n\r\n k1 += c [b]\r\n\n k2 += n - c [b] + 1\r\n\r\n\n\nprint (k1, k2)\n\r\n#", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndict1 = {}\r\nfor i in range(len(arr)):\r\n dict1[arr[i]] = i\r\nq = int(input())\r\nquery = list(map(int,input().split()))\r\nsum1,sum2 = 0,0\r\nfor i in query:\r\n index = dict1[i]\r\n sum1 = sum1 + index +1\r\n sum2 = sum2 + n -index\r\nprint(sum1)\r\nprint(sum2)\r\n#3\r\n#3 1 2\r\n#3\r\n#1 2 3\r\n#\r\n#2\r\n#2 1\r\n#1\r\n#1", "n = int(input())\r\na = list(map(int,input().split()))\r\nq = int(input())\r\nres1 = 0\r\nres2 = 0\r\nmapp = {}\r\nfor i in range(len(a)) :\r\n mapp[a[i]] = i\r\nquery = list(map(int,input().split()))\r\nfor i in query :\r\n res1+=(mapp[i]+1)\r\n res2+=(n-mapp[i])\r\nprint(str(res1)+\" \"+str(res2))\r\n", "def Effective_Approach2():\r\n number_of_elements_in_array = int(input())\r\n array_input = input()\r\n array_input = array_input.split(' ')\r\n\r\n value_to_index_dict = {}\r\n index_in_array = 0\r\n for i in range(len(array_input)):\r\n array_input[i] = int(array_input[i])\r\n value_to_index_dict[array_input[i]] = index_in_array\r\n index_in_array += 1\r\n\r\n number_of_queries = int(input())\r\n queryString = input()\r\n queryString = queryString.split(' ')\r\n for i in range(len(queryString)):\r\n queryString[i] = int(queryString[i])\r\n\r\n vasyaApproach = 0\r\n petyaApproach = 0\r\n #print(queryString)\r\n for query in queryString:\r\n\r\n postion_in_main_array = value_to_index_dict[query]\r\n vasyaApproach += (postion_in_main_array + 1)\r\n petyaApproach += number_of_elements_in_array - postion_in_main_array\r\n\r\n print(\"{} {}\".format(vasyaApproach,petyaApproach))\r\n\r\nEffective_Approach2()", "n = input()\r\na = input().split(\" \")\r\n\r\nm = input()\r\nb = input().split(\" \")\r\n\r\n\r\nx = {}\r\nfor i in range(0, len(a)): \r\n x[a[i]] = i;\r\n \r\nVasyla = 0\r\nPetya = 0\r\n\r\nfor query in b:\r\n index = x[query]\r\n\r\n Vasyla += (len(a) - index)\r\n Petya += (index + 1)\r\n\r\nprint(str(Petya) + \" \" + str(Vasyla))\r\n\r\n\r\n", "n = int(input())\na = list(map(int,input().split()))\nm = int(input())\nb = list(map(int,input().split()))\n\nd = {}\nfor i in range(n):\n d[a[i]] = i\n\nv = 0\np = 0\nfor i in range(m):\n z = d.get(b[i])\n v += z+1\n p += n-z\nprint(v,p)", "\r\nn = int(input())\r\nl = input().split()\r\nm = int(input())\r\nlm = input().split()\r\nd = {}\r\nc = 1\r\na = 0\r\nv = 0\r\nfor i in l:\r\n d[i] = c\r\n c += 1\r\nfor j in lm:\r\n a += d[j]\r\n v += (n+1-d[j])\r\nprint(a, v)\r\n'''n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nm = int(input())\r\nb = list(map(int, input().split(\" \")))\r\n\r\nv = 0\r\np = 0\r\nfor i in b:\r\n for j in a:\r\n if (i == j):\r\n v = v+1\r\n break\r\n else:\r\n v = v+1\r\nfor i in b:\r\n for k in a[::-1]:\r\n if (i == k):\r\n p = p+1\r\n break\r\n else:\r\n p = p+1\r\nprint(v, p)'''\r\n", "n=int(input())\r\ns=input()\r\na=s.split(\" \")\r\na=[int(x) for x in a]\r\nm=int(input())\r\ns=input()\r\nb=s.split()\r\nb=[int(x) for x in b]\r\nd1={}\r\nd2={}\r\nfor i in range(n):\r\n d1[a[i]]=i+1\r\n d2[a[i]]=n-i\r\ns1=0\r\ns2=0\r\nfor i in range(m):\r\n s1+=d1[b[i]]\r\n s2+=d2[b[i]]\r\nprint(s1,s2)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n b[a[i]-1] = i\r\n\r\nm = int(input())\r\nq = [int(i) for i in input().split()]\r\n\r\nv, p = 0, 0\r\n\r\nfor query in q:\r\n v += b[query-1] + 1\r\n p += n - b[query-1]\r\n\r\nprint(v, p)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\nv, p = 0, 0\r\nh = {}\r\nfor i in range(n):\r\n h[arr[i]] = i\r\nfor i in range(m):\r\n temp = h[queries[i]]\r\n v += temp + 1\r\n p += n - temp\r\nprint(v, p)", "n=int(input())\r\nd={}\r\nl1=list(map(int, input().split()))\r\nfor i in range(n):\r\n d[l1[i]]=i\r\nm=int(input())\r\nl2=list(map(int, input().split()))\r\ncv=0\r\ncp=0\r\nfor i in range(m):\r\n x=d[l2[i]]\r\n cv+=(x+1)\r\n cp+=(n-x)\r\n\r\nprint(cv, cp)", "n = int(input())\r\nsozluk = {}\r\nsayac = 0\r\nsayi = 1\r\nfor i in input().split():\r\n sozluk[i] = sayi\r\n sayi += 1\r\nm = int(input())\r\nsorgu = list(map(int, input().split()))\r\nfor t in range(len(sorgu)):\r\n sayac += sozluk[str(sorgu[t])]\r\nprint(sayac, (n+1)*m-sayac)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nq = int(input())\r\nqa = list(map(int,input().split()))\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = [i + 1, n - i]\r\nv ,p =0,0\r\nfor i in range(q):\r\n v += d[qa[i]][0]\r\n p += d[qa[i]][1]\r\nprint(f\"{v} {p}\")", "n=int(input())\r\narr=list(map(int,input().split()))\r\nq=int(input())\r\nl1=list(map(int,input().split()))\r\ndict1={}\r\nfor i in range(0,n):\r\n\tdict1[arr[i]]=i\r\n#print(dict1)\r\ncnt1=0\r\ncnt2=0\r\nfor i in range(0,len(l1)):\r\n\tind=dict1[l1[i]]\r\n\tcnt1+=ind+1\r\n\tcnt2+=(n-ind)\r\nprint(cnt1,\" \",cnt2)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d[arr[i]]=i\r\n\r\nc1=0\r\nc2=0\r\nq=int(input())\r\nqrr=[int(x) for x in input().split()]\r\nfor i in qrr:\r\n a=d[i]+1\r\n b=n-d[i]\r\n c1+=a\r\n c2+=b\r\nprint(c1,c2)\r\n", "n=int(input())\r\nd={a:i+1 for i,a in enumerate(map(int,input().split(' ')))}\r\nm=int(input())\r\n\r\nv=0\r\np=0\r\nfor i in map(int,input().split(' ')):\r\n v+=d[i]\r\n p+=n-d[i]+1\r\nprint(v,p)\r\n\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i+1\r\nm=int(input())\r\nqs=[int(x) for x in input().split()]\r\nlt=rt=0\r\nfor q in qs:\r\n lt+=d[q]\r\n rt+=n+1-d[q]\r\nprint(lt,rt)\r\n \r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int, input().split(\" \")))\r\n m = int(input())\r\n res_vasya = {}\r\n res_petya = {}\r\n \r\n for i in range(n):\r\n res_vasya[a[i]] = i+1\r\n res_petya[a[i]] = n-i\r\n queries = list(map(int, input().split(\" \")))\r\n sum_vasya = 0\r\n sum_petya = 0\r\n for i in range(m):\r\n sum_vasya += res_vasya[queries[i]]\r\n sum_petya += res_petya[queries[i]]\r\n print(sum_vasya, sum_petya)", "N = int(input())\narr = list(map(int, input().split(' ')))\nm = int(input())\nqueries = list(map(int, input().split(' ')))\nnum_map = {}\nfor i,x in enumerate(arr):\n num_map[x] = i\nv = 0\np = 0\nfor q in queries:\n v+=num_map[q]+1\n p+=len(arr)-num_map[q]\nprint(str(v)+' '+str(p))", "from collections import defaultdict\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\n\r\nind = defaultdict(int)\r\nfor i, v in enumerate(a):\r\n ind[v] = i+1\r\nc1, c2 = 0, 0\r\nfor target in b:\r\n x= ind[target]\r\n y= n - ind[target] + 1\r\n c1 += x\r\n c2 += y\r\nprint(c1, c2)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\npositions = {}\r\n\r\nfor i in range(n):\r\n if not a[i] in positions:\r\n positions[a[i]] = (i + 1, n - i)\r\n positions[a[i]] = (min(positions[a[i]][0], i + 1),\r\n min(positions[a[i]][1], n - i))\r\n\r\nfrom_left = 0\r\nfrom_right = 0\r\nfor target in b:\r\n from_left += positions[target][0]\r\n from_right += positions[target][1]\r\n\r\nprint(from_left, from_right)\r\n", "import sys \r\nimport collections as cc\r\nimport bisect as bi \r\ninput = sys.stdin.readline\r\nI = lambda:list(map(int,input().split()))\r\n\r\nn, = I()\r\nar = I()\r\n\r\nm, = I()\r\nx,y = 0,0\r\nbr = I()\r\n\r\ntem = [0]*(n+1)\r\nfor i in range(n):\r\n tem[ar[i]] = i+1\r\n\r\n \r\nfor i in br:\r\n x += tem[i]\r\n\r\n y += n - tem[i] + 1\r\n\r\nprint(x,y)\r\n", "input()\narr = list(map(int, input().split()))\ninput()\nqueries = list(map(int, input().split()))\n\nleft, right = [0] * (len(arr) + 1), [0] * (len(arr) + 1)\n\nfor i in range(len(arr)):\n left[arr[i]] = i + 1\n right[arr[len(arr) - 1 - i]] = i + 1\n\nans = 0\n\nlans, rans = 0, 0\n\nfor v in queries:\n lans += left[v]\n rans += right[v]\n\nprint(lans, rans)\n", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\nq = int(input())\r\nqur = list(map(int, input().split(\" \")))\r\n\r\n\r\n\r\nres1, res2 = 0, 0\r\n\r\nd1 = {}\r\nd2 = {}\r\n\r\n\r\nfor i in range(n):\r\n d1[arr[i]] = i + 1\r\n d2[arr[i]] = n - i\r\n\r\n\r\nfor i in range(q):\r\n res1 += d1[qur[i]]\r\n res2 += d2[qur[i]]\r\n\r\nprint(f'{res1} {res2}')\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndict = {}\r\nfor i in range(len(arr)):\r\n dict[arr[i]] = i\r\n\r\nm = int(input())\r\nq = list(map(int,input().split()))\r\nv = 0\r\np = 0\r\nfor i in q:\r\n v += dict[i]+1\r\n p += len(arr)-dict[i]\r\nprint(v,p)", "import bisect\r\n\r\nn = int(input())\r\narray = list(map(int, input().split()))\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\n\r\n# Create a list of tuples (element, index) for array elements\r\nelement_index_pairs = [(array[i], i + 1) for i in range(n)]\r\n\r\n# Sort the element-index pairs based on element values\r\nelement_index_pairs.sort()\r\n\r\nvasya_comparisons = 0\r\npetya_comparisons = 0\r\n\r\nfor query in queries:\r\n # Find the index of the queried element using binary search\r\n index = bisect.bisect_left(element_index_pairs, (query, -1))\r\n index = element_index_pairs[index][1] - 1\r\n #print(index,element_index_pairs)\r\n # Calculate comparisons for Vasya's and Petya's approaches\r\n vasya_comparisons += index + 1\r\n petya_comparisons += n - index\r\n\r\nprint(vasya_comparisons, petya_comparisons)\r\n", "uzunluk = int(input())\r\nsayılar=list(input().split())\r\nsorgusayısı=int(input())\r\naranan=list(input().split())\r\ndic={}\r\nilk=0\r\nson=0\r\nfor i in range(len(sayılar)):\r\n dic[sayılar[i]]=i+1\r\nfor m in range(sorgusayısı):\r\n ilk=ilk+dic.get(aranan[m])\r\n son=son+uzunluk-dic.get(aranan[m])+1\r\nprint(str(ilk)+\" \"+str(son))", "t = int(input())\r\na = list(map(int , input().split()))\r\nm = int(input())\r\nb = list(map(int , input().split()))\r\ns1 = 0 \r\ns2 = 0\r\nx = [0]*(t+1)\r\nfor i in range(t):\r\n x[a[i]] = i + 1\r\nfor el in b:\r\n s1 += x[el]\r\n s2 += t - x[el]+1 \r\n\r\nprint(str(s1) + ' ' + str(s2))", "\r\nnumber_of_ele = int(input())\r\ndate = {\r\n 'counter' : -1\r\n}\r\ndef fun(i ):\r\n date['counter'] +=1\r\n date[f'{i}'] = date['counter']\r\n return int(i)\r\nlist(map(lambda i:fun(i), input().split()))\r\nnumber_of_q = int(input())\r\narr_of_q = list(map(int , input().split()))\r\nres = [ 0 , 0]\r\nfor i in range(0 , number_of_q) :\r\n x = date[f'{arr_of_q[i]}']\r\n res[0] += x+1\r\n res[1] += number_of_ele - x\r\nprint(f'{res[0]} {res[1]}')", "n=int(input())\r\na={}\r\ncount = 1\r\nfor i in input().split():\r\n a[i] = count\r\n count += 1\r\ns=int(input())\r\nc1=0\r\nc2=0\r\nfor i in input().split():\r\n c1+=a[i]\r\nc2=((n+1)*s)-c1\r\nprint(c1,'',c2)", "# 227B - Effective Approach\r\nif __name__ == '__main__' :\r\n size = int(input())\r\n lst_array = [int(x) for x in input().split()]\r\n lst = [0 for i in range(size+1)]\r\n query_size = int(input())\r\n lst_querries = [int(x) for x in input().split()]\r\n Vasya = 0\r\n Petya = 0\r\n for y in range(size) :\r\n lst[lst_array[y]] = y\r\n for query in lst_querries :\r\n index = lst[query]\r\n Vasya += index + 1\r\n Petya += size - index\r\n print(f'{Vasya} {Petya}')\r\n", "n=int(input())\r\na=map(int,input().split(\" \"))\r\nm=int(input())\r\nq=map(int,input().split(\" \"))\r\nd={}\r\nj=1\r\nfor i in a:\r\n d[i]=j\r\n j+=1\r\na=0\r\nb=0\r\nfor i in q:\r\n a+=d[i]\r\n b+=n-d[i]+1\r\nprint(a,b)", "n=int(input())\r\nl=tuple(map(int,input().strip().split()))\r\nm=int(input())\r\nl1=tuple(map(int,input().strip().split()))\r\nvasya,petya=0,0\r\nd={k:v for v,k in enumerate(l)}\r\nfor i in range(m):\r\n index=d[l1[i]]\r\n vasya+=index+1\r\n petya+=n-index\r\nprint(vasya,petya)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 6 00:49:41 2023\r\n\r\n@author: risha\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\n \r\npos = {}\r\nfor i in range(n):\r\n pos[a[i]] = i + 1\r\n \r\nvasya_comparisons = 0\r\npetya_comparisons = 0\r\nfor i in range(m):\r\n vasya_comparisons += pos[b[i]]\r\n petya_comparisons += n - pos[b[i]] + 1\r\n \r\nprint(vasya_comparisons, petya_comparisons)\r\n", "#https://codeforces.com/problemset/problem/227/B\r\n#abhay_codes\r\nn =int(input())\r\nl =list(map(int,input().split()))\r\nd=dict()\r\nfor i in range(n):\r\n d[l[i]]=i \r\nq =int(input())\r\nl1=list(map(int,input().split()))\r\nsm1=sm2=0\r\nfor a in l1:\r\n \r\n x=d[a]\r\n x1=x+1 \r\n x2=n-x \r\n sm1+=x1\r\n sm2+=x2\r\nprint(sm1,sm2)\r\n \r\n \r\n", "\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\nt = int(input())\r\nlstt = list(map(int,input().split()))\r\nv = 0\r\np = 0\r\nd = {}\r\n \r\nfor i in range(len(lst)):\r\n d[lst[i]] = i\r\nfor i in lstt:\r\n f = d[i]\r\n v+=f+1\r\n p+=n-f\r\nprint(v,p)", "n= int(input())\narr= input().split()\nl= [0] * n\nfor i in range (0,n):\n l[int(arr[i])-1]= i+1\nm= int(input())\n\nmarr= input().split()\nv=0\np=0\nfor i in marr:\n v= v+ l[int(i)-1]\n p= p+ n-l[int(i)-1] +1\nprint(str(v)+' '+str(p))", "n=int(input())\r\n\r\ndict={}\r\n\r\nq=1\r\n\r\nnumbers=[int(i) for i in input().split()]\r\n\r\nfor w in range(n):\r\n dict[numbers[w]]=q\r\n q+=1\r\n\r\nm=int(input())\r\n\r\nquestions=[int(i) for i in input().split()]\r\n\r\na=0\r\nb=0\r\n\r\nfor i in range(m):\r\n a+=dict[questions[i]]\r\n b+=n-dict[questions[i]]+1\r\n\r\nprint(a,b)", "def 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) // 2\r\n\r\n if arr[mid] == target:\r\n return mid\r\n elif arr[mid] < target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return -1\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nt = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nold_pos = {a[i]: i for i in range(n)}\r\nb = sorted(a)\r\nsum = 0\r\n\r\nfor i in range(t):\r\n k = binary_search(b, s[i])\r\n if k == -1:\r\n sum += n\r\n else:\r\n old_k = old_pos[b[k]]\r\n sum += old_k + 1\r\n\r\nprint(sum,end=\" \")\r\nprint((len(a)+1)*(t)-sum)", "n = int(input())\r\na = input().split()\r\nd = {a[i]:i for i in range(n)}\r\ninput()\r\nb = input().split()\r\n\r\ns1 = s2 = 0\r\n\r\nfor bi in b:\r\n s1 += d[bi] + 1\r\n s2 += n - d[bi]\r\n \r\nprint(s1, s2)", "import sys\r\nfrom math import sqrt,ceil,floor,gcd\r\nfrom collections import Counter\r\n\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef int_arr(): return list(map(int,input().split()))\r\ndef str_arr(): return list(map(str,input().split()))\r\ndef get_str(): return map(str,input().split())\r\ndef get_int(): return map(int,input().split())\r\ndef get_flo(): return map(float,input().split())\r\ndef lcm(a,b): return (a*b) // gcd(a,b)\r\n\r\nmod = 1000000007\r\n\r\ndef solve(n,arr,q,qarr):\r\n f = {}\r\n b = {}\r\n for i in range(n):\r\n f[arr[i]] = i+1\r\n b[arr[i]] = n-i\r\n\r\n ff,bb = 0,0\r\n for i in range(q):\r\n ff += f[qarr[i]]\r\n bb += b[qarr[i]]\r\n print(ff,bb)\r\n\r\n\r\nn = int(input())\r\narr = int_arr()\r\nq = int(input())\r\nqarr = int_arr()\r\nsolve(n,arr,q,qarr)", "n = int(input())\r\nl = input().split()\r\nm = int(input())\r\nlm = input().split()\r\nd = {}\r\nc = 1\r\np = 0\r\nv = 0\r\nfor i in l:\r\n d[i] = c\r\n c += 1\r\nfor j in lm:\r\n p += d[j]\r\n v += (n + 1 - d[j])\r\nprint(p, v)\r\n", "n=int(input())\r\nix=[0]*1000005\r\ne=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n ix[e[i]]=i\r\n\r\n\r\nm=int(input())\r\ncomp1=0\r\ncomp2=0\r\nq=list(map(int,input().split()))\r\nfor i in range (m):\r\n comp1+=int(ix[q[i]])+1\r\n comp2+=n-int(ix[q[i]])\r\n\r\nprint (comp1,comp2)", "#def search(q):\n#\tindx = array.index(q)\n#\tvas,pet = indx+1,n-indx\n#\treturn [vas,pet]\nn = int(input())\narray = input().split()\nindex_dict = {}\nfor i in range(len(array)):\n\tif not (index_dict.get(array[i])):\n\t\tindex_dict[array[i]] = i\n\t\t\nvasu_sum = 0\npetya_sum = 0\ncomps = int(input())\nq_s = input().split()\nfor i in q_s:\n\ta = index_dict[i]\n\tvasu_sum += a+1\n\tpetya_sum += n-a\nprint(vasu_sum, petya_sum)", "\r\nif __name__ == \"__main__\":\r\n a = int(input())\r\n a_r = [x for x in map(int,input().split())]\r\n b = int(input())\r\n b_r = [x for x in map(int,input().split())]\r\n\r\n a_m = dict()\r\n result_1 = 0\r\n result_2 = 0\r\n a_len = len(a_r)\r\n \r\n for i,z in enumerate(a_r) :\r\n a_m.update({z:i+1})\r\n \r\n \r\n for i in b_r:\r\n x = a_m.get(i)\r\n result_1 += x\r\n result_2 += a_len - x + 1\r\n\r\n print(f'{result_1} {result_2}')", "n=int(input())\r\narr=enumerate(map(int,input().split()))\r\nd={}\r\nfor i,v in arr:\r\n d[v]=i+1\r\n\r\nm=int(input())\r\nbrr=map(int,input().split())\r\na=0\r\nb=0\r\nfor i in brr:\r\n a+=d[i]\r\n b+=n+1-d[i]\r\nprint(a,'',b)", "## solution to be in o(n)+o(n)\r\nn=int(input())\r\ns=input()\r\na=[int(e) for e in s.split()]\r\nm=int(input())\r\ns=input()\r\nb=[int(e) for e in s.split()]\r\ncount1=0\r\ncount2=0\r\ncheck={}\r\nfor i in range(len(a)):\r\n local={a[i]:i}\r\n check.update(local)\r\nfor i in b :\r\n value=check[i]\r\n count1+=value+1\r\n count2+=n-value\r\ns=str(count1)+\" \"+str(count2)\r\nprint(s)", "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 c[a[i]]=[i+1,n-i]\r\n\r\nv,p=0,0\r\nfor num in b:\r\n v+=c[num][0]\r\n p+=c[num][1]\r\nprint(v,p)", "import sys\r\nprintf=sys.stdout.write\r\ndef intput(): return int(sys.stdin.readline())\r\ndef get_int(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_lis(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_liss(): return sys.stdin.readline().split()\r\ndef get_ints(): return sys.stdin.readline().split()\r\ndef get_str(): return sys.stdin.readline().strip()\r\nfrom collections import defaultdict\r\n# t=intput()\r\n# while t:\r\nn=intput()\r\nl=get_lis()\r\nm=intput()\r\nll=get_lis()\r\nans=[0]*(n+1)\r\nc=0\r\ncc=0\r\nfor i in range(n):\r\n ans[l[i]]=i\r\nfor i in range(m):\r\n c+=ans[ll[i]]+1\r\n cc+=n-ans[ll[i]]\r\nprintf(str(c))\r\nprintf(\" \")\r\nprintf(str(cc))\r\n # t-=1", "a=int(input())\r\nb={c:d+1 for d,c in enumerate (map(int,input().split()))}\r\ne=int(input())\r\nf=sum(b[i] for i in map(int,input().split()))\r\nprint(f,(a+1)*e-f)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans=[0]*(n+1)\r\nans2=[0]*(n+1)\r\nfor i,val in enumerate(a):\r\n ans[val]=i+1\r\n ans2[val]=n-i\r\n# print(ans,ans2)\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\nv,p=0,0\r\nfor i in b:\r\n v+=ans[i]\r\n p+=ans2[i]\r\nprint(v,p)", "n = int(input())\nvasya,peta = 0,0\nnums = list(map(int,input().split()))\nnums_pos = dict()\nfor i in range(n):\n nums_pos[nums[i]] = i\n_ = int(input())\nqueries = map(int,input().split())\nfor query in queries :\n vasya += nums_pos[query] +1\n peta += n - nums_pos[query]\nprint(vasya,peta)", "n = int(input())\r\narrDict = {e: i for i, e in enumerate(input().split())}\r\nm = int(input())\r\nq = input().split()\r\nr1, r2 = 0, 0\r\n\r\nfor x in q:\r\n i = arrDict.get(x, n)\r\n if i == n:\r\n r2 += n\r\n r1 += i + 1\r\n r2 += n - i\r\nprint(str(r1) + \" \" + str(r2))\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nm = int(input())\r\nqueries = list(map(int,input().split()))\r\n\r\npos_dict = {}\r\nfor i in range(n):\r\n pos_dict[nums[i]] = i+1\r\n\r\nvasya, petya = 0,0\r\nfor i in queries:\r\n vasya += pos_dict[i]\r\n petya += (n - pos_dict[i] + 1)\r\n\r\nprint(vasya, petya)", "n=int(input())\na=list(map(int, input().split()))\nm=int(input())\nq=map(int, input().split())\ndct = {}\nfor query in q:\n dct[query] = dct.get(query, 0) + 1\nv=p=0\nfor idx, el in enumerate(a):\n if el in dct:\n v += (idx + 1) * dct[el]\n p += (n-idx) * dct[el]\n\nprint(v, p)\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nn_query = int(input())\r\nquery = list(map(int, input().split()))\r\ntotal = (n+1)*n_query\r\nsum = 0\r\ntemp = []\r\nfor i in range(max(arr)+1):\r\n temp.append(0)\r\nfor x in query:\r\n temp[x] += 1\r\nfor i in range(len(arr)):\r\n sum += (i+1) * temp[arr[i]]\r\n\r\n\r\nprint(sum, total - sum)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nN = int(10**5)+1\r\npos1 = [0]*N\r\nfor i in range(n):\r\n pos1[a[i]] = i+1\r\nsum1 = 0\r\nsum2 = 0\r\nfor i in range(m):\r\n sum1+= pos1[b[i]]\r\n sum2 += n - pos1[b[i]]+1\r\nprint(sum1,sum2)", "n=int(input())\r\nl=input().split()\r\nq=int(input())\r\nql=input().split()\r\na,b=0,0\r\ndic={l[i]:i+1 for i in range(n)}\r\nfor j in ql:\r\n a+=dic[j]\r\n b+=n-dic[j]+1\r\nprint(a,b)", "def find_index(target, nums, l, r):\r\n if l > r:\r\n print(l, r)\r\n return -1\r\n middle = (l+r)//2\r\n if nums[middle] == target:\r\n return middle\r\n elif nums[middle] > target:\r\n return find_index(target, nums, l, middle-1)\r\n else:\r\n return find_index(target, nums, middle+1, r)\r\n\r\n\r\nn = int(input())\r\nnums = [0] * 10000000\r\ninputs = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n nums[inputs[i]] = i\r\nquery_n = int(input())\r\nqueries = [int(y) for y in input().split()]\r\n\r\n# vasya >> 1 >> n\r\n# petya >> n >> 1\r\nordered_nums = sorted(nums)\r\nvasya_comparisons, petya_comparisons = 0, 0\r\nfor query in queries:\r\n position = nums[query] + 1\r\n vasya_comparisons += (position)\r\n petya_comparisons += n-position+1\r\n\r\nprint(f\"{vasya_comparisons} {petya_comparisons}\" )", "v = 0\r\np = 0\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na = list(enumerate(a, start=1))\r\na.sort(key=lambda x : x[1])\r\nx = int(input())\r\nm = list(map(int, input().split()))\r\nfor b in m:\r\n l = 0\r\n r = n - 1\r\n while l != r:\r\n mid = (l + r) // 2\r\n if a[mid][1] >= b:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n v += a[l][0]\r\n p += n - a[l][0] + 1\r\nprint(v, p)", "n = int(input())\narr = [int(i) for i in input().split()]\nm = int(input())\nbrr = [int(i) for i in input().split()]\n\nvas = 0\npet = 0\n\ndi = {}\nfor i in range(n):\n di[arr[i]] = i\nfor j in range(m):\n if brr[j] in di :\n vas += di[brr[j]] +1\n pet += n - di[brr[j]]\n\nl = [vas, pet]\nprint(*l)", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\n\npos = {}\nfor i in range(n):\n pos[a[i]] = i + 1\n\nvasya_comparisons = 0\npetya_comparisons = 0\nfor i in range(m):\n vasya_comparisons += pos[b[i]]\n petya_comparisons += n - pos[b[i]] + 1\n\nprint(vasya_comparisons, petya_comparisons)\n\n", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\n#t=ii()\r\nfor _ in range(1):\r\n n=ii()\r\n a=li()\r\n m=ii()\r\n q=li()\r\n \r\n vas,pet={},{}\r\n \r\n for i in range(n):\r\n if vas.get(a[i],0)==0:\r\n vas[a[i]]=i+1\r\n \r\n for i in range(n):\r\n if pet.get(a[n-1-i],0)==0:\r\n pet[a[n-1-i]]=i+1\r\n \r\n va,pa=0,0\r\n \r\n for i in q:\r\n va += vas[i]\r\n pa += pet[i]\r\n \r\n print(va,pa)\r\n \r\n ", "n=int(input())\r\nar=list(map(int,input().split()))\r\nm=int(input())\r\nz=list(map(int,input().split()))\r\nleft=[0]*(n+10)\r\nright=[0]*(n+10)\r\nv=1\r\nfor x in range(n):\r\n left[ar[x]]=v\r\n v+=1\r\nv=1\r\nfor x in range(n-1,-1,-1):\r\n right[ar[x]]=v\r\n v+=1\r\nvas=pet=0\r\nfor x in range(m):\r\n vas+=left[z[x]]\r\n pet+=right[z[x]]\r\nprint(vas,pet)\r\n\r\n\r\n", "n = int(input())\r\nnum = dict(zip((list(map(int, input().split()))),range(1,n+1)))\r\ntotal1, total2 = 0, 0\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\nfor i in range(m):\r\n total1 += num[queries[i]]\r\n total2 += n-num[queries[i]]+1\r\nprint(\" \".join([str(total1), str(total2)]))", "n,array=int(input()),list(map(int,input().split(\" \")))\r\nm,queries=int(input()),list(map(int,input().split(\" \")))\r\na1,a2=0,0\r\narrayIndeices=[-1]*(n+1)\r\nfor i in range(len(array)):\r\n arrayIndeices[array[i]]=i\r\nfor i in queries:\r\n a1+=arrayIndeices[i]+1\r\n a2+=n-arrayIndeices[i]\r\nprint(f\"{a1} {a2}\")", "n=int(input())\r\nl=[0 for i in range(n)]\r\nt=list(map(int,input().split()))\r\nfor i in range(len(t)):\r\n l[t[i]-1]=i+1\r\n\r\nm=int(input())\r\nv,p=0,0\r\nk=list(map(int,input().split()))\r\nfor i in k:\r\n v+=l[i-1]\r\n p+=n-l[i-1]+1\r\nprint(v,p)", "n = int(input())\r\narray = list(map(int, input().strip().split()))\r\nm = int(input())\r\nqueries = list(map(int, input().strip().split()))\r\n\r\narray_dict = {a:i+1 for i, a in enumerate(array)}\r\nre_array_dict = {a:i+1 for i, a in enumerate(reversed(array))}\r\n\r\ncount_v = 0\r\nfor i, q in enumerate(queries):\r\n if q in array_dict.keys():\r\n count_v += array_dict[q]\r\n else:\r\n count_v += len(array_dict)\r\n\r\ncount_p = 0\r\nfor i, q in enumerate(queries):\r\n if q in re_array_dict.keys():\r\n count_p += re_array_dict[q]\r\n else:\r\n count_p += len(re_array_dict)\r\n\r\nprint(\"{} {}\".format(count_v, count_p))", "from collections import defaultdict\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\nq= list(map(int,input().split()))\r\nvas= 0 \r\npet=0\r\n\r\nhelp_dict = defaultdict(list)\r\nfor i in range (len(arr)):\r\n help_dict[arr[i]].append((i+1,n-i))\r\n\r\nfor ele in q : \r\n vas += help_dict[ele][0][0]\r\n pet += help_dict[ele][0][1]\r\n\r\nprint(vas,pet)\r\n ", "n= int(input())\r\nnl= list(map(int,input().split()))\r\n\r\nm= int(input())\r\nml=list(map(int,input().split()))\r\n\r\nd= {}\r\nfor x in ml:\r\n if x in d:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n\r\n\r\nst=0\r\nen=0\r\ni=0\r\nwhile len(d)>0:\r\n if nl[i] in d:\r\n y= d[nl[i]]\r\n st+=y*(i+1)\r\n en+=y*(n-i)\r\n \r\n d.pop(nl[i])\r\n \r\n \r\n i+=1\r\n\r\n\r\nprint(\"{} {}\".format(st,en))\r\n\r\n\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\nmarr = list(map(int,input().split()))\r\nx = 0\r\ny = 0\r\nd = {}\r\nz = 0\r\nfor i in arr:\r\n d[i] = z\r\n z+=1\r\n\r\nfor i in range(m):\r\n indx = d[marr[i]]\r\n x+=indx+1\r\n y+=n-indx\r\nprint(x,y)", "\r\nn=int(input())\r\nnlist = list(map(int,input().split()))\r\nm=int(input())\r\nmlist = list(map(int,input().split()))\r\n\r\nd={}\r\nfor i in range(n):\r\n d[nlist[i]] = i\r\n\r\nlr,rl=0,0\r\nfor i in range(m):\r\n lr+= d[mlist[i]] +1\r\n rl+= n - d[mlist[i]]\r\n\r\nprint(*[lr,rl])", "n = int(input())\r\na = list(map(int,input().split()))\r\nq = int(input())\r\nque = list(map(int,input().split()))\r\nl = [0]*(max(a)+1)\r\nr = [0]*(max(a)+1)\r\nfor i in range(n) :\r\n l[a[i]] = i\r\na = a[::-1]\r\nfor i in range(n) :\r\n r[a[i]] = i\r\nvas = 0\r\npet = 0\r\nfor i in que :\r\n vas += l[i]+1\r\n pet += r[i]+1\r\nprint(vas,pet)\r\n", "n = int(input())\r\nnum_lst = list(map(int,input().split(\" \")))\r\nq = int(input())\r\nqury_lst = list(map(int,input().split(\" \")))\r\nvasya=0\r\npetya =0\r\nlst=[0]*100001\r\nfor i,ele in enumerate(num_lst):\r\n lst[ele] = i+1 \r\nfor ele in qury_lst:\r\n vasya += lst[ele]\r\n petya += (n+1 -lst[ele])\r\n\r\nprint(vasya,petya)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nv,p=0,0\r\nvar=[0]*(n+1)\r\nc=1\r\nfor i in lst:\r\n var[i]=c\r\n c+=1\r\nl=int(input())\r\nq=list(map(int,input().split()))\r\nfor i in q:\r\n v+=var[i]\r\n p+=(n-var[i]+1)\r\nprint(v,p)", "n = int(input())\r\nelementsOfTheArray = input().split()\r\nm = int(input())\r\nqueries = input().split()\r\nvesya = {queries[i]: -1 for i in range(m)}\r\npetya = {queries[i]: -1 for i in range(m)}\r\nfor i in range(n):\r\n if elementsOfTheArray[i] in vesya:\r\n vesya[elementsOfTheArray[i]] = i + 1\r\n petya[elementsOfTheArray[i]] = n - i\r\n\r\nvesyaCount = 0\r\npetyaCount = 0\r\nfor i in range(m):\r\n vesyaCount += vesya[queries[i]]\r\n petyaCount += petya[queries[i]]\r\n\r\nresult = f\"{vesyaCount}\" + \" \" + f\"{petyaCount}\"\r\nprint(result)\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nq=int(input())\r\nl=list(map(int, input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[a[i]]=[i+1,n-i]\r\nsv=0\r\nsp=0\r\nfor i in l:\r\n sv+=d[i][0]\r\n sp+=d[i][1]\r\nprint(sv,sp)", "n=int(input())\r\nl=list(map(int, input().split()))\r\ns=int(input())\r\nq=list(map(int, input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i\r\nv=0\r\np=0\r\nfor i in range(s):\r\n x=d[q[i]]\r\n v+=(x+1)\r\n p+=(n-x)\r\n \r\nprint(v, p)", "n=int(input())\r\na={v:i+1 for i,v in enumerate(map(int,input().split()))}\r\nm=int(input())\r\ns=(sum(a[q] for q in map(int,input().split())))\r\n\r\nprint(s,(n+1)*m-s)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n m = int(input())\r\n queries = list(map(int, input().split()))\r\n idx = {}\r\n for i in range(n):\r\n idx[arr[i]] = i\r\n a, b = 0, 0\r\n for q in queries:\r\n a += idx[q] + 1\r\n b += n - idx[q]\r\n print(a, b)\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\nai = [int(x) for x in input().split()]\r\nm = int(input())\r\nbi = [int(x) for x in input().split()]\r\ndic = {}\r\npos = vasya = petya = 0\r\nfor a in ai:\r\n pos += 1\r\n dic[a] = pos\r\n\r\nfor b in bi:\r\n vasya += dic[b]\r\n petya += (len(ai) + 1) - dic[b]\r\n\r\nprint(vasya,petya)", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\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 input()\r\ndef O(r:list): return ' '.join(map(str, r))\r\n\r\ndef main():\r\n n = I()\r\n a = IA()\r\n m = I()\r\n q = IA()\r\n c = Counter(q)\r\n x=y=0\r\n for i, v in enumerate(a):\r\n if v in c:\r\n x+=(i+1)*c[a[i]]\r\n y+=(n-i)*c[a[i]]\r\n return O([x,y])\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n = int(input())\r\nindex1 = {}\r\na_list = list(map(int, input().split()))\r\n\r\nfor i, a in enumerate(a_list, 1):\r\n index1[a] = i\r\n\r\nm = int(input())\r\nb_list = list(map(int, input().split()))\r\n\r\nVasya = 0\r\nPetya = 0\r\n\r\nfor b in b_list:\r\n Vasya += index1[b]\r\n Petya += (n + 1 - index1[b])\r\n\r\nprint(Vasya, Petya)\r\n", "n, = map(int, input().split())\nA = list(map(int, input().split()))\nm, = map(int, input().split())\n\nd = dict()\ni0 = 0\n\ndef search(q):\n global i0\n\n if q in d:\n return d[q]\n\n for i in range(i0,n):\n ans = i+1, n-i\n d[A[i]] = ans\n\n if A[i] == q:\n i0 = i\n return ans\n \na,b=0,0\nfor q in map(int, input().split()):\n da,db = search(q)\n a+=da\n b+=db\n\nprint(a,b)\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nq = int(input())\r\nqs = list(map(int, input().split()))\r\nv = 0\r\np = 0\r\nvaluesV = [0 for i in range(n+1)]\r\nvaluesP = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n valuesV[arr[i]] = i + 1\r\nfor i in range(1, n+1):\r\n valuesP[arr[-i]] = i\r\nfor i in qs:\r\n v += valuesV[i]\r\n p += valuesP[i]\r\n\r\nprint(v, p)", "n = int(input())\r\ns = {a:i for i,a in enumerate(map(int,input().split()))}\r\nm = int(input())\r\nx = sum(s[i] for i in map(int,input().split()))\r\nprint(x+m,n*m-x)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nq=int(input())\r\nl1=list(map(int,input().split()))\r\nd={}\r\na=0\r\nb=0\r\nfor i in range(n):\r\n d[l[i]]=i\r\nfor i in l1:\r\n a+=d[i]+1\r\n b+=n-d[i]\r\nprint(a,b)", "n1=int(input())\r\nl=[int(i) for i in input().split()]\r\nn2=int(input())\r\ncompare=[int(i) for i in input().split()]\r\na,b=0,0\r\nd={}\r\nfor i in range(n1):\r\n d[l[i]]=i\r\nfor i in compare:\r\n temp=d[i]\r\n a+=temp+1\r\n b+=n1-temp\r\nprint(a,b)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 26 10:54:34 2021\r\n\r\n@author: Mo'men\r\n\"\"\"\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nsearches = list(map(int, input().split()))\r\naug_arr = dict()\r\nvasya = petya = 0\r\nfor i in range(n):\r\n aug_arr[arr[i]] = i\r\nfor search in searches: \r\n origin_index = aug_arr[search]\r\n if origin_index != None:\r\n vasya += (origin_index + 1)\r\n petya += (n - origin_index)\r\nprint(vasya, petya)", "l = int(input())\r\ntab = input().split(' ')\r\nd = { x: i for i,x in enumerate(tab)}\r\ninput()\r\nq = input().split(' ')\r\nlc = rc = 0\r\nfor n in q:\r\n val = d[n]\r\n lc += val + 1\r\n rc += l - val\r\nprint(lc,rc)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[m[i]]=i+1\r\nquer=int(input())\r\nv,p=0,0\r\nq=list(map(int,input().split()))\r\nfor i in range (quer):\r\n v += d[q[i]]\r\n p += n-d[q[i]]+1\r\nprint(v,p)", "def find(q,a,n):\r\n\ti = 1\r\n\t# print(a)\r\n\twhile a[i-1]!=q:\r\n\t\t# print(a[i-1])\r\n\t\ti += 1\r\n\treturn i\r\n\r\nn = int(input())\r\narr = input().split(' ')\r\nc = [int(i) for i in arr]\r\na = [0]+n*[0]\r\nfor i in range(n):\r\n\ta[c[i]] = i+1\r\nm = int(input())\r\nqrr = input().split(' ')\r\nq = [int(i) for i in qrr]\r\nvasya = 0\r\npetya = 0\r\nfor i in range(m):\r\n\ttem = a[q[i]]\r\n\tvasya += tem\r\n\tpetya += n-tem+1\r\nprint(vasya, petya)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[a[i]]=[i+1,n-i]\r\nx=y=0 \r\nfor i in range(m):\r\n x+=d[b[i]][0]\r\n y+=d[b[i]][1]\r\nprint(x,y) ", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ndict1={lst[i]:i+1 for i in range(n)}\r\nm=int(input())\r\nlstm=list(map(int,input().split()))\r\nd={}\r\nfor i in lstm:\r\n if(i not in d):\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nv=0\r\np=0\r\nfor i in d:\r\n if(i in dict1):\r\n v+=(dict1[i])*d[i]\r\n p+=(n-dict1[i]+1)*d[i]\r\nprint(v,p)", "n=int(input());a=[int(x) for x in input().split()];d={}\r\nfor i in range(n):\r\n d[a[i]] = i+1\r\nm=int(input());q=[int(x) for x in input().split()];vasya=0;patya=0\r\nfor i in range(m):\r\n vasya += d[q[i]];patya += (n - d[q[i]] + 1)\r\nprint(vasya,patya)", "n = int(input())\r\nprob = [int(x) for x in input().split()]\r\nindex = [0]*(n+1)\r\nfor i in range(n):\r\n index[prob[i]] = i+1\r\ntomato = int(input())\r\nqueries = [int(x) for x in input().split()]\r\na,b = 0,0\r\nfor query in queries:\r\n a = a + index[query]\r\n b = b + n - index[query] + 1\r\nprint(a,b)", "n = int(input())\r\n\r\nidx = [0]*(n+1)\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nm = int(input())\r\n\r\nquer = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n idx[arr[i]] = i+1\r\n\r\nvasya = 0\r\npetya = 0\r\nfor q in quer:\r\n vasya += idx[q]\r\n petya += n-idx[q]+1\r\n\r\nprint(vasya, petya)\r\n", "A = int(input())\r\nlist_a = list(map(int,input().split()))\r\nB = int(input())\r\nqueires = list(map(int,input().split()))\r\n\r\nindexs = [0]*1000000\r\n\r\nfor i in range(1,A+1):\r\n indexs[list_a[i-1]] = i\r\n\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in queires:\r\n count1 += indexs[i] \r\n count2 = count2 + A + 1 - indexs[i]\r\n \r\nprint(count1,count2)", "n = int(input())\nl = list(map(int, input().split()))\nm = int(input())\ns = list(map(int, input().split()))\ni = 0\nid = {}\nfor x in l:\n\tid[x] = i\n\ti += 1\nx = y = 0\nfor i in s:\n\ttm = id[i]\n\tx += tm + 1\n\ty += n - tm\nprint(x, y)", "n,a,m,b=int(input()),list(map(int,input().split())),int(input()),list(map(int,input().split()))\r\nv,p=0,0\r\ndict={x:y for x,y in zip(a,range(n))}\r\nfor x in b:\r\n v+=dict[x]+1\r\n p+=n-dict[x]\r\nprint(v,p)", "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, v, p = int(input()), 0, 0\n a = {0: 0 for _ in range(n)}\n {a.update({int(x) - 1: i}) for i, x in enumerate(input().split())}\n _ = int(input())\n b = [int(x) for x in input().split()]\n for i in b:\n v += a[i - 1] + 1\n p += n - a[i - 1]\n print(f\"{v} {p}\")\n\n\nif __name__ == \"__main__\":\n main()\n", "import sys\r\nn = int(input())\r\na = list(map(int, sys.stdin.readline().strip().split()))\r\nm = int(input())\r\nb = list(map(int, sys.stdin.readline().strip().split()))\r\nv = 0\r\np = 0\r\nindx = [0] * (n + 1)\r\nfor i in range(n):\r\n indx[a[i]] = i\r\nfor i in range(m):\r\n v += indx[b[i]] + 1\r\n p += n - indx[b[i]]\r\nprint(v, p)\r\n", "n = int(input())\na = {value: index for index, value in enumerate(map(int, input().split()))}\nm = int(input())\nq = list(map(int, input().split()))\nl, r = 0, 0\nfor q in q:\n l += a[q] + 1\n r += n - a[q]\nprint(l, r)", "t=int(input())\r\nl=list(map(int,input().split()))\r\ninput()\r\nq=list(map(int,input().split()))\r\nres1=0\r\nres2=0\r\nhash={}\r\nfor index,item in enumerate(l) :\r\n hash[item]=index+1\r\nfor i in q:\r\n res1+=hash[i]\r\n res2+=t-hash[i]+1\r\nprint(res1,res2)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nq=int(input())\r\nquerry=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[arr[i]]=i+1\r\nx,y=0,0\r\nfor i in range(q):\r\n x+=d[querry[i]]\r\n y+=n-d[querry[i]]+1\r\nprint(x,y)\r\n", "def Effective_Approach():\r\n total_elements = int(input())\r\n array = list(map(int,input().split()))\r\n total_queries = int(input())\r\n position = {}\r\n for num in range(total_elements):\r\n position[array[num]] = [num+1,total_elements-num]\r\n \r\n total_check_from_start = 0\r\n total_check_from_end = 0\r\n \r\n queries = list(map(int,input().split()))\r\n for q in range(total_queries):\r\n total_check_from_start += position[queries[q]][0]\r\n total_check_from_end += position[queries[q]][1]\r\n \r\n return [total_check_from_start,total_check_from_end] \r\n \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(*Effective_Approach())\r\n remained_test_cases -= 1 ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nqr=list(map(int,input().split()))\r\n\r\nd={}\r\nfor i in range(n):\r\n d[a[i]]=i+1\r\n \r\nvas=0\r\npet=0\r\n\r\nfor i in range(m):\r\n vas+=d[qr[i]]\r\n pet+=n-d[qr[i]]+1\r\n \r\nprint(vas,pet)\r\n", "n = int(input())\r\nelements = list(map(int,input().split()))\r\nm = (input())\r\nqueries = list(map(int,input().split()))\r\nelement_positions = {}\r\nfor i in range(len(elements)):\r\n element_positions[elements[i]]= i+1\r\nvasya_count =0\r\npetya_count =0\r\nfor element in queries:\r\n if element in element_positions:\r\n vasya_count+=element_positions[element]\r\nfor element in queries:\r\n if element in element_positions:\r\n petya_count+=((n+1)-(element_positions[element]))\r\nprint(f\"{vasya_count} {petya_count}\")\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nm = int(input())\r\nt = [int(i) for i in input().split()]\r\na = b = 0\r\nd = {l[i] : i + 1 for i in range(n)}\r\nfor i in t:\r\n\ta += d[i]\r\n\tb += n - d[i] + 1\r\nprint(a, b)", "n = int(input())\na = [int(x) for x in input().split()][:n]\nm = int(input())\nb = [int(x) for x in input().split()][:m]\ncnt_v, cnt_p = 0, 0\npos = {}\nfor i in range(n):\n pos[a[i]] = i\nfor i in b:\n cnt_v += pos[i] + 1\n cnt_p += n - pos[i]\nprint(cnt_v, cnt_p)\n \t\t\t \t\t \t\t\t \t\t\t\t \t\t\t\t \t \t\t", "# =========== IMPORTS ============#\r\nfrom collections import defaultdict\r\n\r\n# =========== GLOBAL =============#\r\n\r\n\r\n# =========== FUNCTIONS ========= #\r\n\r\n\r\nif __name__ == '__main__':\r\n indexing = defaultdict(int)\r\n\r\n n = int(input())\r\n arr = [int(i) for i in input().split()]\r\n for i in range(n):\r\n indexing[arr[i]] += i\r\n\r\n final_result = [0, 0]\r\n\r\n m = int(input())\r\n bi = [int(i) for i in input().split()]\r\n for b in bi:\r\n index = indexing[b]\r\n final_result[0] += index+1\r\n final_result[1] += n-index\r\n\r\n print(final_result[0], final_result[1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i\r\nans1,ans2=0,0\r\nfor i in q:\r\n ans1+=d[i]+1\r\n ans2+=n-d[i]\r\nprint(ans1,ans2)", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\nn = inp()\narr = list(invr())\nhash = {}\nfor i in range(n):\n hash[arr[i]] = i\n\nm = inp()\nvasya_comp = 0\npetya_comp = 0\nqueries = list(invr())\nfor i in range(m):\n q = queries[i]\n pos = hash[q]\n vasya_comp += hash[q] + 1\n petya_comp += n - hash[q]\nprint(vasya_comp, petya_comp)\n\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\nbrr=list(map(int,input().split()))\r\n\r\nvasya_approach = 0\r\npetya_approach = 0\r\n\r\npositions={}\r\n\r\nfor i in range(n):\r\n positions[arr[i]] = i+1\r\nfor i in range(m):\r\n position = positions[brr[i]]\r\n petya_approach += position\r\n vasya_approach += n -position+1\r\n \r\nprint(petya_approach,vasya_approach)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nlookup = [0] * n\r\nfor i in range(n):\r\n lookup[a[i] - 1] = i + 1\r\n\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nl, r = 0, 0\r\nfor i in range(m):\r\n l += lookup[b[i] - 1]\r\n r += n - lookup[b[i] - 1] + 1\r\n\r\nprint(f\"{l} {r}\")", "\r\n#DaRk DeveloPer\r\n\r\nimport sys\r\n\r\n# taking input as string\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\nmod = 10 ** 9 + 7;\r\nMod = 998244353;\r\nINF = float('inf')\r\n# ______________________________________________________________________________________________________\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom collections import defaultdict as dd\r\nfrom collections import OrderedDict as odict\r\nfrom collections import Counter as cc\r\nfrom collections import deque\r\nfrom itertools import groupby\r\n\r\nsys.setrecursionlimit(20 * 20 * 20 * 20 + 10) # this is must for dfs\r\nMAX = 10 ** 5\r\n\r\n\r\n# question link:-https://codeforces.com/problemset/problem/227/B\r\n\r\ndef solve():\r\n\r\n\r\n\tn=takein()\r\n\r\n\tarr=takeiar()\r\n\r\n\tdict_1={}\r\n\r\n\tfor i in range(n):\r\n\t\tdict_1[arr[i]]=i\r\n\t\t\r\n\r\n\tq=takein()\r\n\r\n\tqueries=takeiar()\r\n\r\n\tcount1=0\r\n\tcount2=0\r\n\tfor i in queries:\r\n\r\n\t\tind=dict_1[i]\r\n\r\n\t\tcount1+=ind+1\r\n\t\tcount2+=len(arr)-ind\r\n\r\n\tprint(count1,count2)\r\n\r\n\r\n\r\n \r\n\r\n\r\ndef main():\r\n global tt\r\n\r\n\r\n if not ONLINE_JUDGE:\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n t = 1\r\n #t = takein()\r\n # t = 1\r\n for tt in range(1, t + 1):\r\n solve()\r\n if not ONLINE_JUDGE:\r\n print(\"Time Elapsed :\", time.time() - start_time, \"seconds\")\r\n sys.stdout.close()\r\n\r\n\r\n# ---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#\r\ndef takein():\r\n return (int(sys.stdin.readline().rstrip(\"\\r\\n\")))\r\n\r\n\r\n# input the string\r\n\r\ndef takesr():\r\n return (sys.stdin.readline().rstrip(\"\\r\\n\"))\r\n\r\n\r\n# input int array\r\ndef takeiar():\r\n return (list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split())))\r\n\r\n\r\n# input string array\r\ndef takesar():\r\n return (list(map(str, sys.stdin.readline().rstrip(\"\\r\\n\").split())))\r\n\r\n\r\n# innut values for the diffrent variables\r\ndef takeivr():\r\n return (map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\n\r\n\r\ndef takesvr():\r\n return (map(str, sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\n\r\n\r\n# ------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#\r\n\r\n\r\ndef ispalindrome(s):\r\n return s == s[::-1]\r\n\r\n\r\ndef invert(bit_s):\r\n # convert binary string\r\n # into integer\r\n temp = int(bit_s, 2)\r\n\r\n # applying Ex-or operator\r\n # b/w 10 and 31\r\n inverse_s = temp ^ (2 ** (len(bit_s) + 1) - 1)\r\n\r\n # convert the integer result\r\n # into binary result and then\r\n # slicing of the '0b1'\r\n # binary indicator\r\n rslt = bin(inverse_s)[3:]\r\n\r\n return str(rslt)\r\n\r\n\r\ndef counter(a):\r\n q = [0] * max(a)\r\n for i in range(len(a)):\r\n q[a[i] - 1] = q[a[i] - 1] + 1\r\n return (q)\r\n\r\n\r\ndef counter_elements(a):\r\n q = dict()\r\n for i in range(len(a)):\r\n if a[i] not in q:\r\n q[a[i]] = 0\r\n q[a[i]] = q[a[i]] + 1\r\n return (q)\r\n\r\n\r\ndef string_counter(a):\r\n q = [0] * 26\r\n for i in range(len(a)):\r\n q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1\r\n return (q)\r\n\r\n\r\ndef factorial(n, m=1000000007):\r\n q = 1\r\n for i in range(n):\r\n q = (q * (i + 1)) % m\r\n return (q)\r\n\r\n\r\ndef factors(n):\r\n q = []\r\n for i in range(1, int(n ** 0.5) + 1):\r\n if n % i == 0: q.append(i); q.append(n // i)\r\n return (list(sorted(list(set(q)))))\r\n\r\n\r\ndef prime_factors(n):\r\n q = []\r\n while n % 2 == 0: q.append(2); n = n // 2\r\n for i in range(3, int(n ** 0.5) + 1, 2):\r\n while n % i == 0: q.append(i); n = n // i\r\n if n > 2: q.append(n)\r\n return (list(sorted(q)))\r\n\r\n\r\ndef transpose(a):\r\n n, m = len(a), len(a[0])\r\n b = [[0] * n for i in range(m)]\r\n for i in range(m):\r\n for j in range(n):\r\n b[i][j] = a[j][i]\r\n return (b)\r\n\r\n\r\ndef power_two(x):\r\n return (x and (not (x & (x - 1))))\r\n\r\n\r\ndef ceil(a, b):\r\n return -(-a // b)\r\n\r\n\r\ndef seive(n):\r\n a = [1]\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p ** 2, n + 1, p):\r\n prime[i] = False\r\n p = p + 1\r\n for p in range(2, n + 1):\r\n if prime[p]:\r\n a.append(p)\r\n return (a)\r\n\r\n\r\ndef isprime(n):\r\n if (n > 2 and not n % 2) or n == 1:\r\n return False\r\n\r\n\r\n for i in range(3, int(n ** 0.5 + 1), 2):\r\n if not n % i:\r\n return False\r\n\r\n return True\r\n\r\n# -----------------------------------------------------------------------#\r\nONLINE_JUDGE = __debug__\r\nif ONLINE_JUDGE:\r\n input = sys.stdin.readline\r\n\r\nmain()\r\n", "n = int(input())\narr = list(map(int,input().split()))\nm = int(input())\nquerys = list(map(int,input().split()))\nleft = 0 \nright= 0\nindecies = {}\nfor i in range( len(arr)) :\n indecies[arr[i]]= i+1\nfor q in querys :\n left += indecies[q]\n right += n+1-indecies[q]\nprint(left,right) \n\n", "n = int(input())\narr = list(map(int, input().split()))\nm = int(input())\nq = list(map(int, input().split()))\n\npetyas_count = 0\nvasyas_count = 0\n\nfrom collections import Counter\n\nc = Counter(q)\n\nfor i in range(n):\n if arr[i] in c:\n vasyas_count += c[arr[i]]*(i+1)\n petyas_count += c[arr[i]]*(n-i)\n\n\nprint(vasyas_count, petyas_count)\n", "import sys\r\nimport re\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef inir(s,extrat):\r\n if extrat:\r\n return(list(map(int,s[:len(s) - 1])))\r\n else:\r\n return(list(map(int,s)))\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Solution ---- ############\r\nn = inp()\r\nT = inlt()\r\nm = inp()\r\nQ = inlt()\r\nPQ_dic ={}\r\nVQ_dic ={}\r\nfor q in Q:\r\n if(q in PQ_dic):\r\n PQ_dic[q]=[PQ_dic[q][0],PQ_dic[q][1]+1]\r\n VQ_dic[q]=[VQ_dic[q][0],VQ_dic[q][1]+1]\r\n else:\r\n PQ_dic[q]= [0,1]\r\n VQ_dic[q]= [0,1]\r\n\r\nP = 0\r\nV = 0\r\n\r\nfor i in range(n-1,-1,-1):\r\n if T[i] in PQ_dic:\r\n PQ_dic[T[i]][0]=n-i\r\n \r\nfor i in range(n):\r\n if T[i] in VQ_dic:\r\n VQ_dic[T[i]][0]=i+1\r\n\r\nfor q in PQ_dic:\r\n P+=PQ_dic[q][0]*PQ_dic[q][1]\r\n V+=VQ_dic[q][0]*VQ_dic[q][1]\r\noutput = \"{} {}\".format(V,P)\r\nprint(output)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\ntemp = {}\r\nfor i in range(n):\r\n temp[a[i]] = i + 1\r\nans1 = 0\r\nans2 = 0\r\nfor i in b:\r\n ans1 += temp[i]\r\n ans2 += n - temp[i] + 1\r\nprint(ans1, ans2)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nab = []\r\nfor i in range(n):\r\n ab.append(0)\r\nfor i in b:\r\n ab[i-1] += 1\r\nv = 0\r\np = 0\r\nfor i in range(n):\r\n v += ab[a[i]-1]*(i+1)\r\n p += ab[a[i]-1]*(n-i)\r\nprint(v,p)", "n = int(input())\na = [0]*(n+1)\nk = 1\nfor i in input().split():\n a[int(i)] = k\n k += 1\nm = int(input())\nb = [int(x) for x in input().split()]\nvasya = 0\npetya = 0\nfor q in b:\n vasya += a[q]\n petya += (n+1 - a[q])\nprint(vasya, petya)", "# Har har mahadev\r\n# author : @ harsh kanani\r\n\r\nl=int(input())\r\ndic = dict()\r\ni=0\r\nfor x in (input().split()):\r\n dic[x] = i\r\n i+=1\r\nl2=int(input())\r\nv=p=0\r\nfor y in (input().split()):\r\n d=dic[y]\r\n v+=d+1\r\n p+= l-d\r\nprint(*[v,p])", "#problem: https://codeforces.com/problemset/problem/227/B\r\nn = int(input())\r\nvalues = list(map(int, input().split()))\r\nq = int(input())\r\nqueries = list(map(int, input().split()))\r\nind = {}\r\nfor i in range(len(values)):\r\n ind[values[i]] = i+1\r\nv, p = 0, 0\r\nfor i in queries:\r\n v += ind[i]\r\n p += n + 1 - ind[i]\r\nprint(v, p)", "arr = []\r\nres = {}\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\n\r\nfor query in queries:\r\n if query in res:\r\n res[query][2] += 1\r\n else:\r\n res[query] = [0, 0, 1]\r\n\r\nfor i, x in enumerate(arr):\r\n if x in res:\r\n res[x][0] = i + 1\r\n res[x][1] = n - i\r\n\r\nVasya = 0 \r\nPetya = 0\r\nfor r in res:\r\n record = res[r]\r\n Vasya += record[0] * record[2]\r\n Petya += record[1] * record[2]\r\n \r\n\r\nprint(Vasya, Petya)\r\n", "def sol(a, m):\r\n v = 0\r\n p = 0\r\n new_a = {}\r\n for i in range(len(a)):\r\n new_a[a[i]] = i+1\r\n\r\n for i in m:\r\n elem_pos = new_a[i]\r\n v += elem_pos\r\n p += len(a) - elem_pos +1\r\n\r\n return (v, p) \r\n\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n a = list(map(int, input().split()))\r\n n = input()\r\n m = list(map(int, input().split()))\r\n s = sol(a,m)\r\n print(s[0], s[1])", "def vasya(n,l,m,val_search):\n vasya = 0\n petya = 0\n hashMap = {}\n for i in range(1,n+1):\n hashMap[l[i-1]] = i\n\n for i in range(m):\n vasya += hashMap[val_search[i]]\n petya += (n-hashMap[val_search[i]]+1)\n\n return vasya,petya \n\nn = int(input())\nl = list(map(int,input().split()))\nm = int(input())\nval_search = list(map(int,input().split()))\nans = vasya(n,l,m,val_search)\nprint(ans[0],ans[1])", "n=int(input())\r\nd1={}\r\nd2={}\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n d1[l[i]]=i+1\r\n d2[l[i]]=n-i\r\nm=int(input())\r\nans1=0\r\nans2=0\r\nl1=list(map(int,input().split()))\r\nfor i in range(m):\r\n ans1+=d1[l1[i]]\r\n ans2+=d2[l1[i]]\r\nprint(ans1,ans2)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nq=int(input())\r\nmp={}\r\nfor i in range(n):\r\n # if i not in mp:\r\n mp[a[i]]=i+1\r\n\r\nqueries=list(map(int,input().split()))\r\nsum_v=0\r\nsum_p=0\r\nfor x in queries:\r\n b=mp[x]\r\n sum_v+=b\r\nprint(sum_v,(n+1)*q-sum_v)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d[arr[i]]=i\r\nm=int(input())\r\nq=[int(x) for x in input().split()]\r\ns1=0\r\ns2=0\r\nfor i in q:\r\n ind=d[i]\r\n s1+=ind+1\r\n s2+=(n-ind)\r\nprint(s1,s2)", "n = int(input()); a = [int(x) for x in input().split()]\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = i+1\r\nm = int(input()); q = [int(x) for x in input().split()]\r\nvasya = 0; patya = 0\r\n\r\nfor i in range(m):\r\n vasya += d[q[i]]\r\n patya += (n - d[q[i]] + 1)\r\nprint(vasya,patya)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ninput()\r\nll = [int(x) for x in input().split()]\r\nd1,d2 = {},{}\r\nfirst,second = 0,0\r\nfor i in range(n):\r\n d1[l[i]]=i+1\r\nfor i in range(n-1,-1,-1):\r\n d2[l[i]]=n-i\r\nfor i in ll:\r\n first+=d1[i]\r\n second+=d2[i]\r\nprint(first,second)", "n1=int(input())\r\narr1=list(map(int,input().split()))\r\nn2=int(input())\r\narr2=list(map(int,input().split()))\r\nd=[]\r\nd1=[]\r\nfor i in range(1,len(arr1)+1):\r\n\td.append(i)\r\ndict1=dict(zip(arr1,d))\r\nfor i in range(len(arr1),-1,-1) :\r\n d1.append(i)\r\nd1=d1[:-1]\r\ndict2=dict(zip(arr1,d1))\r\nres=list(map(dict1.get,arr2))\r\nres1=list(map(dict2.get,arr2))\r\nprint(sum(res),sum(res1))", "def main():\n n = int(input())\n num_list = list(map(int, str(input()).split()))\n m = int(input())\n to_find = list(map(int, str(input()).split()))\n vasya = petya = 0\n dict_of_indices = {}\n index = 0\n for num in num_list:\n dict_of_indices[num] = index\n index += 1\n for num in to_find:\n vasya += dict_of_indices[num] + 1\n petya += (n - dict_of_indices[num])\n print(vasya, petya)\n\n\nif __name__ == \"__main__\":\n main()", "n=int(input())\r\nnums=list(map(int, input().strip().split()))\r\nm=int(input())\r\ntargets=list(map(int, input().strip().split()))\r\na=0\r\nb=0\r\ndct={}\r\nfor i in range(n):\r\n dct[nums[i]]=i\r\nfor i in range(m):\r\n a+=dct[targets[i]]+1\r\n b+=n-dct[targets[i]]\r\nprint(a, b)", "n=int(input())\r\n\r\ndick={}\r\n\r\nthing=input().split()\r\n\r\nfor i in range(n):\r\n dick[int(thing[i])]=i+1\r\n\r\nm=int(input())\r\n\r\nvasya=0\r\npetya=0\r\n\r\nfor j in input().split():\r\n j=int(j)\r\n vasya+=dick[j]\r\n petya+=n-dick[j]+1\r\n \r\nprint(vasya,petya)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\ns1=s2=0\r\nb={}\r\nfor i in range(n):\r\n b[a[i]]=i+1\r\nfor i in range(m):\r\n k=b[q[i]]\r\n s1+=k\r\n s2+=n-k+1\r\nprint(s1,s2)\r\n \r\n", "n = int(input())\na = [int(x) for x in input().split()][:n]\nm = int(input())\nb = [int(x) for x in input().split()][:m]\nupdIdx = {}\nfor i in range(n): updIdx[a[i]] = i\nvasya, petya = 0, 0\nfor i in b:\n\tvasya += updIdx[i] + 1\n\tpetya += n - updIdx[i]\nprint(vasya, petya)\n \t \t \t \t\t \t\t \t \t\t \t\t\t \t", "n = int(input())\r\nl = [0] * n\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n\tl[a[i] - 1] = i\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nans1, ans2 = 0, 0\r\nfor i in b:\r\n\tans1 += l[i - 1] + 1\r\n\tans2 += n - l[i - 1]\r\nprint(ans1, ans2)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nvasya=0\r\npetya=0\r\nd={}\r\nfor i in range(0,n):\r\n d[a[i]]=i\r\nfor i in q:\r\n vasya=vasya+d[i]+1\r\n petya=petya+n-d[i]\r\nprint(vasya,petya)", "n = int(input())\r\narr = input().split()\r\n\r\nm = int(input())\r\nq = input().split()\r\n\r\nqueries = {arr[ind]: ind for ind in range(len(arr))}\r\n\r\nforw = back = 0\r\n\r\nfor i in q:\r\n ind = queries[i]\r\n \r\n forw += ind + 1\r\n back += n - ind\r\n\r\nprint(forw, back)", "import sys\r\nimport math\r\n\r\ndef solve(n, array, m, queries):\r\n array = sorted(zip(array, [i for i in range(1, len(array) + 1)]), key = lambda x : x[0]) # One-time sort of nlog(n), 1-indexed\r\n array, array_indices = zip(*array)\r\n\r\n # Num comparisons for each method\r\n V = 0\r\n P = 0\r\n\r\n memo = {}\r\n for query in queries:\r\n if query not in memo:\r\n l, r = 0, len(array) - 1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if array[mid] == query:\r\n memo[query] = array_indices[mid]\r\n break\r\n elif array[mid] < query:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n \r\n V += memo[query]\r\n P += len(array) - memo[query] + 1\r\n \r\n print(V, P)\r\n\r\nmemo = {}\r\nn = int(sys.stdin.readline().strip())\r\narray = [int(x) for x in sys.stdin.readline().strip().split()]\r\nm = int(sys.stdin.readline().strip())\r\nqueries = [int(x) for x in sys.stdin.readline().strip().split()]\r\nsolve(n, array, m, queries)", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\nm = int(input())\r\nl2 = list(map(int, input().split()))\r\n \r\n \r\nd = [0 for i in range(100001)]\r\n \r\nfor i in range(n) :\r\n d[l1[i]] = i\r\n \r\na = 0\r\nb = 0\r\n \r\nfor i in range(m):\r\n a += d[l2[i]]+1\r\n b += n-d[l2[i]]\r\n \r\nprint(a,b)", "def process():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n query = dict()\r\n \r\n for i, v in enumerate(arr):\r\n query[v] = (i + 1, n + 1 - (i + 1))\r\n \r\n m = int(input())\r\n queries = list(map(int, input().split()))\r\n \r\n x, y = 0, 0\r\n \r\n for q in queries:\r\n x += query[q][0]\r\n y += query[q][1]\r\n \r\n print(x, y)\r\n \r\nprocess()", "\n\t\n\ndef solution(a, b):\n\tstore = {_a: i for i, _a in enumerate(a)}\n\tvasya_count, petya_count = 0, 0\n\n\tfor _b in b:\n\t\tvasya_count += store.get(_b, len(a) - 1) + 1\n\t\tpetya_count += len(a) - store[_b] if _b in store else len(a)\n\n\treturn \" \".join(map(str, (vasya_count, petya_count)))\n\n\nif __name__ == \"__main__\":\n\t_ = input()\n\ta = list(map(int, input().rstrip().split(\" \")))\n\t_ = input()\n\tb = list(map(int, input().rstrip().split(\" \")))\n\n\tprint(solution(a, b))\n\n\n", "n = int(input())\r\narr = input().split()\r\ndic = {}\r\nfor i in range(0, len(arr)):\r\n arr[i] = int(arr[i])\r\n dic[arr[i]] = i + 1\r\n\r\ncount_left = 0\r\ncount_right = 0\r\nm = int(input())\r\nqueries = input().split()\r\nfor i in range(0, m):\r\n queries[i] = int(queries[i])\r\n count_left += dic[queries[i]]\r\n count_right += n - dic[queries[i]] + 1\r\n\r\nprint(count_left, count_right)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nidx_list = [0]*n\r\nfor i in range(n):\r\n idx_list[l[i]-1] = i\r\n\r\nm = int(input())\r\nk = list(map(int, input().split()))\r\n\r\na = 0\r\nb = 0\r\n\r\nfor i in range(m):\r\n x = 0\r\n idx = idx_list[k[i]-1]\r\n b += (n - idx)\r\n a += (idx+1)\r\n\r\nprint(a, b)", "input()\r\na=list(map(int,input().split()))\r\nvar=0\r\nvara=0\r\ninput()\r\nb=list(map(int,input().split()))\r\nvasya={}\r\npetya={}\r\nval=-1\r\nfor i in range(len(a)):\r\n vasya[a[i]]=i+1\r\n petya[a[val]]=i+1\r\n val=val-1\r\nfor i in b:\r\n var=var+vasya[i]\r\n vara=vara+petya[i]\r\nprint(var,vara)", "n=int(input())\r\na=input().split()\r\nindex=[0 for i in a];\r\nindex=index+[0]\r\nc=0\r\nfor i in a:\r\n index[int(i)]=c\r\n c=c+1\r\nm=int(input())\r\nb=input().split()\r\nc1,c2=0,0\r\n \r\nfor i in b:\r\n k=index[int(i)]\r\n c1=c1+k+1\r\n c2=c2+n-k\r\n \r\nprint(str(c1)+\" \"+str(c2))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\nv, p = 0, 0\r\nnew = [0] * (10 ** 5 + 3)\r\nfor i in range(n):\r\n new[arr[i]] = i\r\nfor i in range(m):\r\n temp = new[queries[i]]\r\n v += temp + 1\r\n p += n - temp\r\nprint(v, p)", "def effective_approach():\n n = int(input()) #len of list\n a = [int(i) for i in input().split()]\n input()#no need to get the number of queries we can get it from the len of the queries list\n \n #arrays to register each elements index in each's perspective\n v_method = [0]*len(a)\n p_method = [0]*len(a)\n\n #initialize counters\n v,p=0,0\n queries = [int(i) for i in input().split()]\n\n #register the amount of moves needed for each element\n for j in range(len(a)):\n v_method[a[j]-1] = j+1\n p_method[a[j]-1] = len(a)-j\n\n for i in queries:\n v+=v_method[i-1]\n p+=p_method[i-1]\n #print results\n print(v,p)\n\neffective_approach()", "number_of_testcases = 1 #int(input())\r\n\r\nfor _ in range(number_of_testcases):\r\n num_elements = int(input())\r\n array_elements = list(map(int, input().split()))\r\n \r\n num_queries = int(input())\r\n search_queries = list(map(int, input().split()))\r\n \r\n index_value1 = {}\r\n index_value2 = {}\r\n \r\n for i in range(len(array_elements)):\r\n index_value1[array_elements[i]] = [i+1]\r\n index_value2[array_elements[i]] = [num_elements - i]\r\n \r\n count_from_starting = 0\r\n count_from_end = 0 \r\n \r\n for i in range(num_queries):\r\n count_from_starting += index_value1[search_queries[i]][0]\r\n count_from_end += index_value2[search_queries[i]][0]\r\n \r\n \r\n print(count_from_starting, count_from_end)\r\n ", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\n_ = int(input())\r\nqueries = list(map(int, input().split(\" \")))\r\n\r\nindex = [0]*100010\r\nfor i in range(n):\r\n index[arr[i]] = i\r\n\r\nl, r = 0, 0\r\nfor query in queries:\r\n l += index[query]+1\r\n r += n - index[query]\r\n\r\nprint('{} {}'.format(l, r))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nqueries = {}\r\n\r\nfor i in b:\r\n if i in queries: queries[i] += 1\r\n else: queries[i] = 1\r\n\r\nvasya, petya = 0, 0\r\nfor i in range(n):\r\n if(a[i] in queries):\r\n vasya += queries[a[i]]*(i + 1)\r\n petya += queries[a[i]]*(n - i)\r\nprint(vasya, petya)", "nl = int(input())\r\nnlist = input().split()\r\nnlistindex = dict([(a,b) for a,b in zip(nlist, range(nl))])\r\nml = int(input())\r\nmlist = input().split()\r\n\r\nv, p = 0, 0\r\n\r\nfor i in mlist:\r\n index = nlistindex[i]\r\n v += int(index) + 1\r\n p += nl - int(index)\r\n\r\nprint(v, p)", "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 = [0] + list(map(int, input().split()))\r\nl, r = dict(), dict()\r\nfor i in range(1, n + 1):\r\n if not a[i] in l:\r\n l[a[i]] = i\r\nfor i in range(-1, -n - 1, -1):\r\n if not a[i] in r:\r\n r[a[i]] = -i\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nx, y = 0, 0\r\nfor i in b:\r\n x += l[i]\r\n y += r[i]\r\nprint(x, y)", "def solve():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n m = int(input())\r\n b = list(map(int,input().split()))\r\n ans = [0,0]\r\n f = dict()\r\n for i in range(n):\r\n f[a[i]] = i + 1\r\n for i in range(m):\r\n ans[0] += f[b[i]]\r\n ans[1] += n + 1 - f[b[i]]\r\n return ans\r\nprint(*solve())", "n=int(input())\nl=input().split()\nq=int(input())\nql=input().split()\na,b=0,0\ndic={l[i]:i+1 for i in range(n)}\nfor j in ql:\n a+=dic[j]\n b+=n-dic[j]+1\nprint(a,'',b)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\nd = {}\r\nfor index in range(len(arr)):\r\n num = arr[index]\r\n d[num] = index\r\na = 0\r\nb = 0\r\nfor target in queries:\r\n index = d[target]\r\n \r\n a += index+1\r\n b += n - index\r\nprint((\"%d %d\") % (a, b))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfi = {arr[i]:(i+1) for i in range(n)}\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\nv=0; p=0\r\n\r\nfor i in range(m):\r\n ind = fi[q[i]]\r\n v += ind\r\n p += (n-ind)+1\r\nprint(v, p)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n d[l[i]] = (i+1, n-i)\r\nm = int(input())\r\nsum1 = 0\r\nsum2 = 0\r\nx = list(map(int, input().split()))\r\nfor i in range(m):\r\n sum1 += d[x[i]][0]\r\n sum2 += d[x[i]][1]\r\nprint(sum1, sum2)", "# var = int(input())\n# #x = \"\".join(input().split())\n# x = input().split()\n# y = x[::-1]\n# input()\n# #search = list(map(int,input().split()))\n# search = input().split()\n# s1 = s2 = 0\n# for val in search:\n# s1 += x.index(val) + 1\n# s2 += y.index(val) + 1\n# print(s1,s2)\n\nvar = int(input())\nx = input().split()\nind = {i:l for l,i in enumerate(x)}\ninput()\nsearch = input().split()\ns1 = s2 = 0\nfor val in search:\n a = ind[val]\n s1 += a + 1\n s2 += var - a \nprint(s1,s2)", "'''input\r\n2\r\n2 1\r\n1\r\n1\r\n\r\n\r\n\r\n'''\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nq = int(input())\r\ntc = [int(x) for x in input().split()]\r\n\r\ndic = {}\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] not in dic:\r\n p1 = i + 1\r\n p2 = len(arr) - i\r\n dic[arr[i]] = [p1,p2]\r\n\r\n\r\np1 = 0\r\np2 = 0\r\n\r\nfor q in tc:\r\n p1 += dic[q][0]\r\n p2 += dic[q][1]\r\n\r\nprint(p1, p2)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nD1,D2 = {},{}\r\n\r\nfor i in range(n):\r\n D1[a[i]] = i \r\n\r\nfor j in range(n-1,-1,-1):\r\n D2[a[j]] = j \r\n\r\n\r\ns1,s2 = 0,0 \r\nfor j in range(m):\r\n s1+=(D1[b[j]]+1) \r\n\r\nfor j in range(m):\r\n s2+=(n - D2[b[j]])\r\n \r\nprint(s1,s2)\r\n ", "# 1: Effective Approach\r\n#\r\n\r\n# import time\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n# start=time.time()\r\nscore = []\r\nv=0\r\np=0\r\nind={}\r\nfor idx, ele in enumerate(a):\r\n ind[ele] = idx\r\nfor qry in b:\r\n temp = ind[qry]\r\n v+=(temp+1)\r\n p+=(n-temp)\r\n# end=time.time()\r\nprint(v,p) \r\n# print(\"Total time: \",end-start)", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nridx = {a[i]: i for i in range(n)}\nleft = right = 0\nfor q in map(int, input().split()):\n left += ridx[q] + 1\n right += n - ridx[q]\nprint(left, right)\n", "n = int(input())\r\nactual_list = list(map(int, input().split()))\r\nindex_list = [0 for i in range(n+1)]\r\nfor i in range(len(actual_list)):\r\n index_list[actual_list[i]] = i\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\nleft, right = 0, 0\r\nfor x in queries:\r\n left += (index_list[x]+1)\r\n right += (n-index_list[x])\r\nprint(left, right)\r\n", "# توكلت على الله\r\n\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\ndef solve():\r\n vasya = 0\r\n bita = 0\r\n dic = {}\r\n \r\n num = int(input())\r\n number = list(map(int,input().split()))\r\n m = int(input())\r\n quri = list(map(int,input().split()))\r\n for i in range(num) :\r\n dic[number[i]] = i+1\r\n for i in quri :\r\n vasya += dic[i]\r\n bita += num - dic[i] + 1\r\n print(vasya,bita)\r\n#for i in range(int(input())):\r\nsolve()", "n=int(input())\r\narr=input().split()\r\ndi={}\r\nfor i in range(n):\r\n di[arr[i]]=i+1\r\nvasya=0\r\npyta=0\r\nm=int(input())\r\ninp=input().split()\r\nfor i in inp:\r\n vasya+=di[i]\r\n pyta+=n+1-di[i]\r\nprint(vasya,pyta)", "import sys\r\nimport math\r\nfrom collections import Counter\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\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\nvasya = [0] * (n + 1)\r\nfor i in range(n) :\r\n vasya[a[i]] = i + 1\r\nc = sum(vasya[i] for i in b)\r\nprint(c, m * (n + 1) - c)\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\npos = [0]*(n+1)\r\nfor i in range(n):\r\n pos[a[i]] = i+1\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nstart, end = 0, 0\r\nfor querie in b:\r\n index = pos[querie]\r\n start += index\r\n end += n-index+1\r\nprint(start, end)", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\n\r\nm = int(input())\r\n\r\nbrr=[int(i) for i in input().split()]\r\n\r\ndic={}\r\n\r\nfor i in range(n):\r\n\tdic[arr[i]]=i+1 \r\n\r\nvasya,petya =0,0\r\n\r\nfor i in range(m):\r\n\r\n\tvasya+=dic[brr[i]]\r\n\tpetya+= n-dic[brr[i]]+1\r\n\r\nprint(vasya,petya)", "n = int(input())\r\nls = input().split()\r\ndict = {}\r\nfor idx, el in enumerate(ls):\r\n dict[el] = idx\r\n\r\ninput()\r\nc1, c2 = 0, 0\r\n\r\nfor query in input().split():\r\n idx = dict[query]\r\n c1 += idx + 1\r\n c2 += n - idx\r\n\r\nprint(c1, c2)", "n = int(input())\narr = list(map(int,input().split()))\nq = int(input())\nif q>1:\n queries = list(map(int, input().split()))\nelse:\n queries = list(map(int, input()))\nt1, t2 = 0,0\nd = {}\nfor i in range(n):\n d[arr[i]] = i\nfor query in queries:\n i = d[query]\n t1+=i+1\n t2+=n-i\nprint(t1,t2)", "n = int(input())\r\nls = [int(num) for num in input().split(\" \")]\r\nm = int(input())\r\n\r\nindexes = [None for _ in range(n)]\r\n\r\nfor i, num in enumerate(ls):\r\n indexes[num-1] = i\r\n\r\nqueries = [int(query) for query in input().split(\" \")]\r\n\r\nsums = [0, 0]\r\n\r\nfor query in queries:\r\n front_nc = indexes[query-1] + 1\r\n back_nc = n - indexes[query-1]\r\n\r\n sums[0] += front_nc\r\n sums[1] += back_nc\r\n\r\nprint(f\"{sums[0]} {sums[1]}\")", "lc = int(input())\r\nl = list(map(int,input().split()))\r\nqc= int(input())\r\nql = list(map(int,input().split()))\r\nm = {}\r\na = b = 0\r\nfor x in range(lc):\r\n m[l[x]] = x+1\r\nfor x in range(qc):\r\n a += m[ql[x]]\r\nfor x in range(qc):\r\n b += lc-m[ql[x]]+1\r\nprint(a,b)", "a = int(input())\r\nb = list(map(int , input().split()))\r\nc = int(input())\r\nd = list(map(int , input().split()))\r\ndic = {}\r\nfor i in range(a):\r\n dic[b[i]] = i + 1\r\nt1 = 0\r\nt2 = 0\r\nfor i in range(c):\r\n t1 += dic[d[i]]\r\n t2 += a - dic[d[i]] + 1\r\nprint(t1 , t2)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nidx = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n idx[arr[i]] = i+1\r\none = 0\r\ntwo = 0\r\nm = int(input())\r\nquery = list(map(int, input().split()))\r\nfor q in query:\r\n one += idx[q]\r\n two += n - idx[q] + 1\r\nprint(one, two )", "n = int(input())\r\nnums = input().split()\r\nq = int(input())\r\nqrs = input().split()\r\nbeg = {}\r\nend = {}\r\nfor index in range(n):\r\n beg[nums[index]] = index + 1\r\n end[nums[index]] = n-index\r\nv = 0\r\np = 0\r\nfor qr in qrs:\r\n v += beg[qr]\r\n p += end[qr]\r\nprint(v,p)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nm=int(input())\r\nb=[int(i) for i in input().split()]\r\nc1,c2=0,0\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i\r\nfor i in range(m):\r\n c1+=(d[b[i]]+1)\r\n c2+=(n-d[b[i]])\r\nprint(c1,c2)", "n=int(input());a=[int(x) for x in input().split()];d={}\r\nfor i in range(n):\r\n d[a[i]] = i+1\r\nm=int(input());q=[int(x) for x in input().split()];v=0;p=0\r\nfor i in range(m):\r\n v+=d[q[i]];p+=n-d[q[i]]+1\r\nprint(v,p)", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nd=[0 for i in range(n)]\r\nfor i in range(n):\r\n d[a[i]-1]=i+1\r\n\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\n\r\np=[0,0]\r\n\r\nfor i in range(m):\r\n p[0] += d[b[i]-1]-1+1\r\n p[1] += n-d[b[i]-1]+1\r\n\r\nprint(p[0],p[1])\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nq=int(input())\r\nbrr=list(map(int,input().split()))\r\na1,a2=0,0\r\ndic={}\r\nfor i in range(n):\r\n dic[arr[i]]=i \r\nfor i in range(q):\r\n a1+=dic[brr[i]]+1\r\n a2+=(n-dic[brr[i]])\r\n\r\n\r\nprint(a1,a2)\r\n\r\n", "from sys import stdin,stdout\r\n \r\nele = int(stdin.readline())\r\ndict = {b:a for a,b in enumerate(stdin.readline().strip().split(),start=1)}\r\nqueries = int(stdin.readline())\r\nqrlst = stdin.readline().strip().split()\r\nval1,val2 =0,0\r\nfor i in qrlst:\r\n x = dict[i]\r\n val1 += x\r\n val2 += ele - (x) +1\r\nres = str(val1)+\" \"+str(val2)\r\nstdout.write(res)", "\r\n\r\ni=int(input())\r\narray=list(map(int,input().split()))\r\nk=int(input())\r\nqueries=list(map(int,input().split()))\r\n\r\nd={}\r\nfor x in range(len(array)):\r\n d[array[x]]=x\r\n\r\nc1=0\r\nc2=0\r\nfor ele in queries:\r\n c1+=d[ele]+1\r\n c2+=i-d[ele]\r\nprint(c1,c2)\r\n\r\n\r\n\r\n ", "n = int(input()) \r\nl = [0] * (n +1)\r\nl2 = list(map(int , input().split()))\r\nfor i in range(n) : \r\n s = l2[i] \r\n l[s] = i + 1 \r\nquery = int(input()) \r\ncounter1 , counter2 = 0 , 0 \r\nq = list(map(int , input().split())) \r\nfor i in q : \r\n \r\n counter1 += l[i]\r\n counter2 += n - l[i] + 1\r\nprint(counter1 , counter2 )\r\n", "def solve():\n c1, c2 = 0, 0\n index = {a: i for i, a in enumerate(A)}\n for q in Q:\n c1 += index[q] + 1\n c2 += N - index[q]\n return f\"{c1} {c2}\"\n\nN = int(input())\nA = [int(x) for x in input().split()]\nM = int(input())\nQ = [int(x) for x in input().split()]\nprint(solve())", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/input.txt\"\r\n OUTPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(N, arr, M, find_arr):\r\n def bin_search(arr, find):\r\n lo, hi = 0, N-1\r\n\r\n while lo <= hi:\r\n mi = lo + hi >> 1\r\n\r\n if arr[mi][0] == find:\r\n return arr[mi][1]\r\n elif find < arr[mi][0]:\r\n hi = mi - 1\r\n else:\r\n lo = mi + 1\r\n\r\n return -1\r\n\r\n arr = [[v, i] for i, v in enumerate(arr)]\r\n arr.sort()\r\n\r\n v = p = 0\r\n\r\n for find in find_arr:\r\n idx = bin_search(arr, find)\r\n\r\n from_start = idx+1\r\n from_end = N-idx\r\n\r\n v += from_start\r\n p += from_end\r\n\r\n return \" \".join(map(str, [v, p]))\r\n\r\n\r\nN = read_int()\r\narr = read_numeric_list()\r\n\r\nM = read_int()\r\nfind_arr = read_numeric_list()\r\n\r\nprint(solve(N, arr, M, find_arr))\r\n", "def main():\n length = int(input())\n array = input().split()\n dict = {}\n counter = 0\n while counter != length:\n dict[int(array[counter])] = counter\n counter += 1\n vasya = 0\n petya = 0\n discard = input()\n arr_to_find = input().split()\n for elem in arr_to_find:\n vasya += dict[int(elem)] + 1\n petya += length - dict[int(elem)]\n print(vasya, petya)\nmain()\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nd = {}\r\ni = 0\r\nfor nm in a:\r\n d[nm] = i\r\n i += 1\r\nc1 = c2 = 0\r\nfor nm in b:\r\n x = d[nm]\r\n c1 += x+1\r\n c2 += n-x\r\nprint(c1,c2)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\n\r\nv,p=0,0\r\n\r\nindices=dict()\r\n\r\nfor i in range(n):\r\n indices.update({arr[i]:i})\r\n\r\nfor i in range(m):\r\n b=q[i]\r\n index=indices[b]\r\n v=v+index+1\r\n p=p+n-index\r\n \r\nprint(v,p)", "import sys\r\ndef main() :\r\n n = int(sys.stdin.readline())\r\n l=list(map(int,sys.stdin.readline().strip().split()))\r\n array = [0]*(n+1)\r\n for i in range(n):\r\n array[l[i]] = i+1\r\n m = int(sys.stdin.readline())\r\n query = list(map(int,sys.stdin.readline().strip().split()))\r\n v,p = 0,0\r\n for j in range(m) :\r\n v += array[query[j]]\r\n p += n-array[query[j]]+1\r\n print(v,p) \r\n\r\nmain()", "n=int(input())\r\narr =[int(i) for i in input().split()]\r\nm=int(input())\r\narrm=[int(i) for i in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d[i+1]=0\r\nfor i in range(n):\r\n d[arr[i]]=i+1\r\nc1=0\r\nc2=0\r\n\r\nfor i in range(m):\r\n c1+=(d[arrm[i]])\r\n c2+=(n - d[arrm[i]]) + 1\r\nprint(c1,c2)", "# Hash Map to the RESQUE :D\n\nn = int(input())\narray = list(map(int, input().split()))\nm = int(input())\nqueries = list(map(int, input().split()))\n\nhash_map = {}\ni = 0\nfor x in array:\n i += 1\n hash_map[x] = i\n\nv = 0\np = 0\n\nfor x in sorted(queries):\n v += hash_map[x]\n p += n - hash_map[x] + 1\n\n\nprint(v, p)\n", "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\nn = int(input())\r\ndct = {el: ind for ind, el in enumerate(read())}\r\nm = int(input())\r\nv = p = 0\r\nfor i in read():\r\n v += dct[i] + 1\r\n p += n - dct[i]\r\nprint(v, p)\r\n", "n = int(input())\r\na = [int(a) for a in input().split()]\r\nm = int(input())\r\nb = [int(b) for b in input().split()]\r\n\r\nc = [0]*(n+1)\r\n\r\nfor i in range(len(a)):\r\n c[a[i]] = i+1\r\n\r\n# print(c)\r\n\r\nans = 0\r\nfor i in range(len(b)):\r\n ans+=c[b[i]]\r\n\r\nprint(ans, (n+1)*m - ans)\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ndtn = {}\r\nfor i in range(n):\r\n\tdtn[a[i]] = i+1\r\n\r\nm = int(input())\r\nb = [int(j) for j in input().split()]\r\n\r\nv = 0\r\np = 0\r\nfor i in range(m):\r\n\tv += dtn[b[i]]\r\n\tp += n-dtn[b[i]] + 1\r\n\r\nprint(v, end = ' ')\r\nprint(p)", "\"\"\"\r\nOnce at a team training Vasya, Petya and Sasha got a problem on implementing linear search in an array.\r\n\r\nAccording to the boys, linear search works as follows. The array elements in a pre-selected order are in turn compared with the number that you need to find. Once you find the array element that is equal to the required one, the search ends. The efficiency of the algorithm is the number of performed comparisons. The fewer comparisons the linear search has made, the more effective it is.\r\n\r\nVasya believes that a linear search would work better if it sequentially iterates through the elements, starting with the 1-st one (in this problem we consider the elements of the array indexed from 1 to n) and ending with the n-th one. And Petya says that Vasya is wrong: the search will need less comparisons if it sequentially iterates the elements starting from the n-th and ending with the 1-st one. Sasha argues that the two approaches are equivalent.\r\n\r\nTo finally begin the task, the teammates decided to settle the debate and compare the two approaches on an example. For this, they took an array that is a permutation of integers from 1 to n, and generated m queries of the form: find element with value bi in the array. They want to calculate for both approaches how many comparisons in total the linear search will need to respond to all queries. If the first search needs fewer comparisons, then the winner of the dispute is Vasya. If the second one does, then the winner is Petya. If both approaches make the same number of comparisons, then Sasha's got the upper hand.\r\n\r\nBut the problem is, linear search is too slow. That's why the boys aren't going to find out who is right before the end of the training, unless you come in here. Help them to determine who will win the dispute.\r\n\r\nInput\r\nThe first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the array. The second line contains n distinct space-separated integers a1, a2, ..., an (1 ≤ ai ≤ n) — the elements of array.\r\n\r\nThe third line contains integer m (1 ≤ m ≤ 105) — the number of queries. The last line contains m space-separated integers b1, b2, ..., bm (1 ≤ bi ≤ n) — the search queries. Note that the queries can repeat.\r\n\r\nOutput\r\nPrint two integers, showing how many comparisons Vasya's approach needs and how many comparisons Petya's approach needs. Separate the numbers by spaces.\r\n\r\nPlease, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.\r\n\"\"\"\r\n\r\nn = int(input())\r\npositions = {int(num): i + 1 for i, num in enumerate(input().split())}\r\n_ = int(input())\r\ncomparisons = [0, 0]\r\nqueries = map(int, input().split())\r\n\r\nfor num in queries:\r\n pos = positions[num]\r\n comparisons = [comparisons[0] + pos, comparisons[1] + n + 1 - pos]\r\n\r\nprint(*comparisons)\r\n", "n = int(input())\r\nnum = input().split()\r\nnum = list(map(int,num))\r\nnfind = int(input())\r\nfind = input().split()\r\nindex = [0]*100001\r\nfor i in range(1,n+1):\r\n index[num[i-1]] = i\r\nfind = list(map(int,find))\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in find:\r\n count1 += index[i] \r\n count2 = count2 + n + 1 - index[i]\r\nprint(\" \".join([str(count1),str(count2)]))", "n=int(input())\r\nl=input().split()\r\nm=int(input())\r\nq=input().split()\r\nv,p=0,0\r\nd={l[i]:i+1 for i in range(n)}\r\nfor j in q:\r\n v+=d[j]\r\n p+=n-d[j]+1\r\nprint(v,p) ", "\nimport sys\n\nn = int(sys.stdin.readline().strip())\narr = [None] * (n + 1)\nfor i, x in enumerate(sys.stdin.readline().split()):\n arr[int(x)] = i + 1\n\nb = int(sys.stdin.readline().strip())\nqs = list( int(x) for x in sys.stdin.readline().split())\nv = 0\np = 0\n\n\n\nfor q in qs:\n v += arr[q]\n p += n + 1 - arr[q]\n\nprint(v, p)\n", "arrLen = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nqueryLen = int(input())\r\nqueries = list(map(int, input().split()))\r\n\r\noutput = [0,0]\r\nhashMap = {}\r\nfor i in range(arrLen):\r\n hashMap[array[i]] = i \r\n\r\nfor query in queries:\r\n\r\n indx = hashMap.get(query, -1)\r\n if indx == -1:\r\n output[0] += arrLen\r\n output[1] += arrLen\r\n else:\r\n output[0] += indx + 1\r\n output[1] += arrLen - indx \r\n\r\nprint(output[0], output[1])\r\n", "T=int(1e5+3)\r\nN=int(input())\r\narr=list(map(int,input().split()))\r\na=[0]*T\r\nfor i in range(len(arr)):\r\n a[arr[i]]=i+1\r\nm=int(input())\r\nbrr=list(map(int,input().split()))\r\nv=0\r\np=0\r\nfor i in range(m):\r\n x=a[brr[i]]\r\n v+=x\r\n p+=(N-x)+1\r\nprint(v,p)", "n=int(input())\r\nli=list(map(int,input().split()))\r\np=int(input())\r\nli1=list(map(int,input().split()))\r\ndic={}\r\nsum1=0\r\nsum2=0\r\nfor i in range(n):\r\n dic[li[i]]=[i+1,n-i]\r\nfor j in range(p):\r\n sum1+=dic[li1[j]][0]\r\n sum2+=dic[li1[j]][1]\r\n\r\nprint(sum1,sum2)\r\n\r\n\r\n", "def bsearch(arr,num):\r\n lena = len(arr)\r\n start=0\r\n end = lena-1\r\n ind=0\r\n found=0\r\n while(start<=end):\r\n mid=int((start+end)/2)\r\n if(arr[mid]==num):\r\n found=1\r\n ind = mid\r\n break\r\n elif(arr[mid]<num):\r\n start = mid+1\r\n elif(arr[mid]>num):\r\n end = mid-1\r\n if(found==1):\r\n return (ind)\r\n else:\r\n print(\"Not found\")\r\n return -1\r\nn = int(input())\r\nlist1 = [int(num) for num in input().split()]\r\nm = int(input())\r\nqueries=[int(num) for num in input().split()]\r\nlist2=[]\r\nv=0\r\np=0\r\nmax1=max(list1)\r\nfor i in range(0,max1+1):\r\n list2.append(0)\r\nfor j in range(0,len(list1)):\r\n num = list1[j]\r\n list2[num]=j\r\nfor k in range(0,len(queries)):\r\n ind = list2[queries[k]]\r\n v+=ind+1\r\n p+=len(list1)-ind\r\nprint(f\"{v} {p}\")\r\n \r\n ", "n = int(input())\r\nn_integers = {v: k for k, v in enumerate(map(int, input().split(' ')))}\r\nm = int(input())\r\nm_integers = map(int, input().split(' '))\r\nforward_count = 0\r\nbackward_count = 0\r\n\r\nfor i in m_integers:\r\n forward_count += n_integers.get(i) + 1\r\n backward_count += n - n_integers.get(i)\r\nprint(forward_count, backward_count)\r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nm=int(input())\r\nb=[int(i) for i in input().split()]\r\nd={}\r\nfor i in range(len(arr)):\r\n d[arr[i]]=i\r\nv=0\r\np=0\r\nfor i in b:\r\n v+=(d[i]+1)\r\n p+=(n-d[i])\r\nprint(str(v)+\" \"+str(p))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans=[0]*(n+1)\r\nans2=[0]*(n+1)\r\nfor i,val in enumerate(a):\r\n ans[val]=i+1\r\n ans2[val]=n-i\r\nnum=int(input())\r\nb=[int(x) for x in input().split()]\r\nscore=[0,0]\r\nfor i in b:\r\n score[0]+=ans[i]\r\n score[1]+=ans2[i]\r\nprint(score[0],score[1])", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nd = {num: i for i, num in enumerate(a)}\r\nfront, back = 0, 0\r\nfor num in b:\r\n front += d[num] + 1\r\n back += n - d[num]\r\nprint(front, back)", "from sys import stdin, setrecursionlimit\nfrom bisect import bisect_left, bisect_right\nfrom collections import deque\nfrom functools import lru_cache, reduce\nfrom heapq import heappush, heappop\nfrom math import sqrt, ceil, floor, log2\nimport io,os\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\ninput = stdin.readline\n\ndef main(z):\n n = int(input())\n arr = [str(x) for x in input().split()]\n k = int(input())\n find = [str(x) for x in input().split()]\n m = {}\n for i, x in enumerate(arr):\n m[x] = i + 1\n a = b = 0\n for x in find:\n a += m[x]\n b += n - m[x] + 1\n print(str(a) + ' ' + str(b))\nmain(0)", "num_elements = int(input())\r\nvals = [int(i) for i in input().split()]\r\nnum_queries = int(input())\r\nqueries = [int(i) for i in input().split()]\r\nnumComparesV = 0\r\nnumComparesP = 0\r\n\r\npositions = [i for i in range(0, num_elements + 1)]\r\n\r\nfor i in range(1, num_elements + 1):\r\n positions[vals[i-1]] = i\r\n\r\nfor i in queries:\r\n numComparesV += positions[i]\r\n numComparesP += num_elements - positions[i] + 1\r\n\r\nprint(\"{} {}\".format(numComparesV, numComparesP))\r\n", "n1=int(input())\r\nd={}\r\nl1=list(map(int,input().split()))\r\nfor i in range(0,n1):\r\n d[l1[i]]=i+1\r\nn2=int(input()) \r\nl2=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nfor i in l2:\r\n c1+=d[i]\r\n c2+=n1-d[i]+1\r\nprint(c1,c2)", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nm=int(input())\r\nq=list(map(int,input().split(\" \")))\r\np=0\r\nv=0\r\npos={}\r\nfor i in range(n):\r\n pos[l[i]]=i+1\r\nfor i in range(m):\r\n v+=pos[q[i]]\r\n p+=n - pos[q[i]] + 1;\r\n\r\nprint(v,p)\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\nqry=int(input())\r\nq=list(map(int,input().split()))\r\nv=[0]*(n)\r\np=[0]*(n)\r\nfor i in range(n):\r\n\tv[a[i]-1]=(n-i)\r\n\tp[a[i]-1]=i+1\r\nansp=0\r\nansv=0\r\nfor i in range(qry):\r\n\tansp+=p[q[i]-1]\r\n\tansv+=v[q[i]-1]\r\nprint(ansp,ansv)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nbrr = list(map(int, input().split()))\r\n\r\ncrr = [0 for i in range(n)]\r\nfor i in range(n):\r\n crr[arr[i]-1] = i+1\r\n\r\na = 0\r\nb = 0\r\nfor i in range(m):\r\n a += crr[brr[i]-1]\r\n b += n - (crr[brr[i]-1] - 1)\r\n \r\nprint(a, end=\" \")\r\nprint(b)", "n = int(input())\narr = list(map(int, input().split()))\ndic = {}\nfor i in range(n):\n dic[arr[i]] = i+1\n\nm = int(input())\nans1 = 0\nans2 = 0\nval = list(map(int, input().split()))\nfor k in val:\n index = dic.get(k, n)\n ans1 += index\n ans2 += n - index + 1\n\nprint(ans1, ans2)\n", "# cook your dish here\r\nn = int(input())\r\nk = list(map(int,input().split(' ')))\r\nq = int(input())\r\nqueries = list(map(int,input().split(' ')))\r\nd = {}\r\nfor i in range(n):\r\n d[k[i]] = d.get(k[i],i)\r\nstep1 = 0\r\nstep2 = 0\r\n\r\nfor i in queries:\r\n step1+=d[i]+1\r\n step2+=n-d[i]\r\nprint(step1,step2)", "n=int(input())\r\nlis=list(map(int,input().split()))\r\ndic={lis[i]:i+1 for i in range(n)}\r\nm=int(input())\r\nlis=list(map(int,input().split()))\r\na=0;b=0\r\nfor i in range(m):\r\n w=dic[lis[i]]\r\n a+=w\r\n b+=n-w+1\r\nprint(a,b)", "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 = int(input())\r\narr = list(map(int,input().strip().split()))\r\nm = int(input())\r\nq = list(map(int,input().strip().split()))\r\nv = {}\r\np = {}\r\ns = 0\r\nfor i in arr :\r\n s+= 1\r\n v[i] = s\r\n p[i] = n\r\n n -= 1\r\nsumv = sump = 0\r\nfor i in q:\r\n sumv += v[i]\r\n sump += p[i]\r\nprint(sumv,sump)", "import sys\r\nimport math\r\n#sys.stdin = open('input.txt','r')\r\n#sys.stdout = open('output.txt','w')\r\n\r\nn = int(input())\r\npos = {}\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n\tpos[arr[i]] = i+1\r\n\r\nq = int(input())\r\n\r\nq_a = [int(x) for x in input().split()]\r\n\r\np,v = 0,0\r\nfor i in range(q):\r\n\tp += pos[q_a[i]]\r\n\tv += n - pos[q_a[i]] + 1\r\n\r\nprint(p,v)", "a=int(input())\r\nm=list(map(int,input().split(\" \")))\r\nb=int(input())\r\nn=list(map(int,input().split(\" \")))\r\nc=0\r\nk=[-1]*(a+1)\r\n\r\nfor i in range(a):\r\n\tk[m[i]]=i\r\nsum1=0\r\nsum2=0\r\n#print(k)\r\nfor i in range(b):\r\n\tif(k[n[i]]!=-1):\r\n\t\tsum1=sum1+k[n[i]]+1\r\n\t\tsum2=sum2+(a-k[n[i]])\r\nprint(sum1,sum2)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk={}\r\nfor i in range(n):\r\n k[l[i]]=[i+1,n-i]\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\nfor i in l2:\r\n s1+=k[i][0]\r\n s2+=k[i][1]\r\nprint(s1,s2)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = int(input())\r\nq = list(map(int,input().split()))\r\nd = {}\r\ni = 1\r\nfor e in l:\r\n d[e] = i\r\n i += 1\r\nx,y = 0,0\r\nfor i in q:\r\n x += d[i]\r\n y += n-d[i] +1\r\nprint(x,y)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nvas=0\r\npet=0\r\ndic={}\r\ni=0\r\nwhile i< n :\r\n dic[a[i]]=i+1\r\n i+=1\r\n\r\nfor i in b :\r\n vas+=dic[i]\r\n pet+=n-dic[i]+1\r\n\r\nprint(vas,pet)", "n = int(input())\narr = list(map(int,input().split()))\nm = int(input())\nnumsToSearch = list(map(int,input().split()))\nscore_start = 0\nscore_end = 0\n\nsteps_start = {}\n\nindex = 1\nfor num in arr:\n steps_start[num]=index\n index+=1\n\nsteps_end ={}\n\nindex = 1\nfor num in arr[::-1]:\n steps_end[num]=index\n index+=1\n\nfor num in numsToSearch:\n score_start+=steps_start[num]\n score_end+= steps_end[num]\n\nprint(f\"{score_start} {score_end}\")\n \n \n", "from collections import defaultdict\r\n\r\n\r\ndef main():\r\n n = get_int()\r\n nums = get_list_int()\r\n q = get_int()\r\n queries = get_list_int()\r\n forward, backward = 0, 0\r\n indexes = defaultdict(list)\r\n\r\n for i, num in enumerate(nums):\r\n indexes[num].append(i)\r\n\r\n for query in queries:\r\n if query not in indexes:\r\n forward += n\r\n backward += n\r\n else:\r\n forward += indexes[query][0] + 1\r\n backward += n - indexes[query][-1]\r\n\r\n print(f\"{forward} {backward}\")\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\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nl = {}\r\nr = {}\r\nfor i, v in enumerate(a):\r\n if v not in l:\r\n l[v] = i\r\n r[v] = i\r\np = 0\r\nq = 0\r\nfor v in b:\r\n p += l[v] + 1\r\n q += n - r[v]\r\nprint(p, q)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nb=int(input())\r\nquer=list(map(int,input().split()))\r\npet=0\r\nvay=0\r\nval={}\r\nfor i in range(n):\r\n val[arr[i]]=[i+1,n-i]\r\nfor i in range(b):\r\n pet+=val[quer[i]][0]\r\n vay+=val[quer[i]][1]\r\nprint(pet,vay)\r\n", "n=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nt=int(input())\r\nl2=list(map(int,input().rstrip().split()))\r\nd={'V':0,'P':0}\r\nd2={}\r\nfor i in range(n):\r\n if lst[i] in d:\r\n d[lst[i]].append(i+1)\r\n else:\r\n d[lst[i]]=[i+1]\r\n\r\nfor i in l2:\r\n d['V']+=min(d[i])\r\n d['P']+=n-max(d[i]) +1 \r\n\r\nprint(d['V'],d['P'])", "n = int(input())\r\narr = list(map(int, input().split(' ')))\r\nm = int(input())\r\nqueries = list(map(int, input().split(' ')))\r\nfirstSearches = 0\r\nsecondSearches = 0\r\narrElements = {}\r\n\r\nfor i in range(0, len(arr)):\r\n if arr[i] not in arrElements:\r\n arrElements[arr[i]] = i\r\n\r\nfor query in queries:\r\n if query in arrElements:\r\n firstSearches += arrElements[query] + 1\r\n secondSearches += len(arr) - arrElements[query]\r\n\r\n\r\nprint(firstSearches, secondSearches)\r\n", "N = int(input())\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\nQ = int(input())\r\n\r\nB = [int(x) for x in input().split()]\r\n\r\n\r\nstart = dict()\r\nprev = dict()\r\namount_start = 0\r\namount_prev = 0\r\n\r\nfor i in range(len(A)):\r\n\r\n if A[i] not in start:\r\n start[A[i]] = i+1\r\n \r\n prev[A[i]] = len(A) - i\r\n \r\n\r\nfor num in B:\r\n\r\n amount_start += start[num]\r\n amount_prev += prev[num]\r\n\r\n\r\nprint(amount_start, amount_prev)\r\n", "\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nres1=0\r\nres2=0\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nres1 = 0\r\nres2 = 0\r\ncnt=[0]*(n+1)\r\nfor i in range(n):\r\n cnt[a[i]]=i\r\n\r\nfor e in b:\r\n u = cnt[e] \r\n res1 += u + 1 \r\n res2 += n - u \r\nprint(res1, res2)\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#, OCaml, 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=int(input())\r\narr =map(int , input().split())\r\ndic={}\r\nfor i ,v in enumerate(arr):\r\n dic[v]=i+1\r\nm=int(input())\r\nq =map(int , input().split())\r\na=0\r\nb=0\r\nfor i in q:\r\n a+=dic[i]\r\n b+=n-dic[i]+1\r\nprint(a,b)", "n = int(input())\r\nn_l = {v : i+1 for i, v in enumerate(input().split())}\r\nm = int(input())\r\nst, ed = 0, 0\r\n\r\nfor i in input().split():\r\n st += n_l[i]\r\n ed += n - n_l[i] + 1\r\n\r\nprint(st, ed)", "n = int(input())\r\nl = [int(_) for _ in input().split()]\r\nq = {l[_] : _ + 1 for _ in range(n)}\r\nm = int(input())\r\na = [int(_) for _ in input().split()]\r\nans1, ans2 = 0, 0\r\nfor _ in a:\r\n ans1 += q[_]\r\n ans2 += n - q[_] + 1\r\nprint(ans1, ans2)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nq=int(input())\r\nqueries=list(map(int,input().split()))\r\n\r\nvasya=0\r\npetya=0\r\n\r\nleft=[0 for i in range(100005)]\r\nright=[0 for i in range(100005)]\r\n\r\ntemp=lst[::-1]\r\n\r\nfor i in range(n):\r\n left[lst[i]]=i+1\r\n\r\nfor i in range(n):\r\n right[temp[i]]=i+1\r\n\r\nfor i in range(q):\r\n vasya+=left[queries[i]]\r\n petya+=right[queries[i]]\r\n \r\n\r\nprint(vasya,petya)\r\n", "# we know that element are unique, hence we can precompute results for multiple queries\n_ = input()\narr = list(map(int, input().split()))\n_ = int(input())\ncases = list(map(int, input().split()))\nvasya = {}\npetya = {}\nfor i, n in enumerate(arr):\n vasya[n] = i + 1\nfor i, n in enumerate(arr[::-1]):\n petya[n] = i + 1\na = 0\nb = 0\nfor e in cases:\n a += vasya[e]\n b += petya[e]\nprint(a, b)\n\n", "n=int(input())\r\na1= list(map(int,input().split()))\r\nm=int(input())\r\na2= list(map(int,input().split()))\r\nl=[0]*n \r\nfor i in range(n):\r\n\tl[a1[i]-1]=i\r\nv,p=0,0\r\nfor x in a2 :\r\n v+=l[x-1]+1\r\n p+= n-l[x-1] \r\nprint(v,p)\r\n", "n1=int(input())\r\nl1=list(map(int,input().split()))\r\nn2=int(input())\r\nl2=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\nd={}\r\nfor i in range(len(l1)):\r\n d[l1[i]]=i\r\nfor i in range(len(l2)):\r\n if l2[i] in d:\r\n s1+=d[l2[i]]+1\r\n s2+=n1-d[l2[i]]\r\nprint(s1,end=\" \")\r\nprint(s2)", "def solve():\r\n\r\n l = int(input())\r\n arr = list(map(int,input().split()))\r\n\r\n _ = int(input())\r\n search = list(map(int,input().split()))\r\n s1 = 0\r\n s2 = 0\r\n dict_search = {}\r\n\r\n for index, i in enumerate(arr):\r\n dict_search[i] = index\r\n\r\n for t in search:\r\n s1 += dict_search[t] + 1\r\n s2 += l - dict_search[t]\r\n\r\n\r\n return (f\"{s1} {s2}\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(solve())", "li = int(input())\r\nv = list(map(int, input().split()))\r\ndi = dict()\r\n\r\nfor i in range(li):\r\n di[v[i]] = i\r\n\r\nq = int(input())\r\nv = 0\r\np = 0\r\nqval = list(map(int, input().split()))\r\nfor j in range(q):\r\n val = qval[j]\r\n v += (di[val]+1)\r\n p += (li - di[val])\r\n\r\n\r\nprint(v, p)\r\n", "from collections import defaultdict, Counter\nimport itertools as it\nimport random as rand\n\nn = int(input())\na = list(map(int, input().split()))\nm = int(input())\nqs = list(map(int, input().split()))\ndist_a = {}\ndist_b = {}\n\nfor i in range(n):\n dist_a[a[i]]=i+1\n dist_b[a[i]]=n-i\n\nsa = 0\nsb = 0\nfor q in qs:\n sa += dist_a[q]\n sb += dist_b[q]\n\nprint(sa, sb)", "length=int(input())\r\nl=list(map(int,input().split()))\r\nc,c1=0,0\r\nd={}\r\nfor i in range(len(l)):\r\n d[l[i]]=i+1\r\np=int(input())\r\nl1=list(map(int,input().split()))\r\nfor a in l1:\r\n c+=d[a]\r\n c1+=length-d[a]+1\r\nprint(c,c1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\nquries = list(map(int,input().split()))\r\n\r\nlarr=[0 for i in range(n+1)]\r\nrarr=[0 for i in range(n+1)]\r\nfor i in range(n):\r\n larr[arr[i]]=i+1 \r\n rarr[arr[i]]=n-i\r\nc1=0\r\nc2=0\r\nfor i in quries:\r\n c1+=larr[i]\r\n c2+=rarr[i]\r\nprint(c1,c2)\r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nq = int(input())\r\nqueries = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n d[arr[i]] = (i + 1)\r\n\r\nnormalSearch = 0\r\nreverseSearch = 0\r\nfor query in queries:\r\n normalSearch += d[query]\r\n reverseSearch += n - d[query] + 1\r\nprint(normalSearch, reverseSearch)", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nb = list(map(int, input().split()))\r\n\r\nmy_list = list([0 for i in range(0, n)])\r\nfor i in range(0, n):\r\n\r\n my_list[a[i]-1] = i+1\r\n\r\nsum1 = 0\r\nsum2 = 0\r\nfor i in range(0, m):\r\n\r\n k = my_list[b[i]-1]\r\n sum1 += k\r\n sum2 += n - k + 1\r\n\r\nprint(sum1, sum2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nk = [0] * (n+1)\r\nfor i in range(n):\r\n k[a[i]] = i + 1\r\n\r\nc1 = 0\r\nc2 = 0\r\n\r\nfor elem in b:\r\n c1 += k[elem]\r\n c2 += (n - k[elem] + 1)\r\n \r\nprint(c1, c2)\r\n", "vasya = 0\r\npetya = 0\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\nqueries = list(map(int,input().split()))\r\nqueries.sort()\r\nprevious = 0\r\narr = list(enumerate(arr))\r\narr.sort(key=lambda x:x[1])\r\n\r\nfor i in queries:\r\n l,h=0,n-1\r\n if previous == i:\r\n vasya+=ind\r\n petya+=indrev\r\n else:\r\n while True:\r\n mid=(l+h)//2\r\n if arr[mid][1]>i:\r\n h=mid-1\r\n elif arr[mid][1]<i:\r\n l=mid+1\r\n else:\r\n ind = arr[mid][0]+1\r\n indrev= n-(ind-1)\r\n vasya+=ind\r\n petya+=indrev\r\n break\r\n previous = i\r\nprint(vasya,petya)", "length = int(input())\r\narray = list(map(int,input().split()))\r\nrepeat =int(input())\r\nqueries =list(map(int,input().split()))\r\npetya =0\r\ndict ={}\r\nfor i in range(len(array)):\r\n dict[array[i]] =i\r\n\r\nfor i in queries:\r\n petya += dict[i]+1\r\n\r\n\r\nprint(petya,int(repeat*(length+1))-petya)", "import collections\r\n\r\n_ = input()\r\narr = input().split(' ')\r\n_ = input()\r\nqueries = input().split(' ')\r\nvasya = 0\r\npetya = 0\r\nq_set = set(queries)\r\nc = 0\r\nq_map = collections.defaultdict(list)\r\nfor i, v in enumerate(arr):\r\n if v in q_set and v not in q_map:\r\n q_map[v] = [i + 1, len(arr) - i]\r\nfor q in queries:\r\n vasya += q_map[q][0]\r\n petya += q_map[q][1]\r\nprint(vasya, petya)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ncost = [None] * n\r\nfor i in range(n):\r\n cost[a[i] - 1] = i + 1\r\n\r\ninput()\r\nq = [int(i) for i in input().split()]\r\nx, y = 0, 0\r\nfor i in q:\r\n x += cost[i - 1]\r\n y += n - cost[i - 1] + 1\r\n\r\nprint(x, y)\r\n", "n, a = int(input()), (int(i) for i in input().split())\nm, b = int(input()), (int(i) for i in input().split())\nmp = {v: i for i, v in enumerate(a)}\nres = [0, 0]\nfor i in b:\n k = mp[i]\n res[0] += k + 1\n res[1] += n - k\nprint(*res)\n", "n,l,q,ql=int(input()),input().split(),int(input()),input().split()\r\na,b=0,0\r\ndic={l[i]:i+1 for i in range(n)}\r\nfor j in ql:\r\n a+=dic[j]\r\n b+=n-dic[j]+1\r\nprint(a,'',b)", "from collections import defaultdict as dft\r\n\r\nd=dft(int)\r\nv=0\r\np=0\r\n\r\na=int(input())\r\ns=input()\r\nl=s.split()\r\n\r\nfor i in range(a):\r\n\td[l[i]]=i+1\r\n\r\nb=int(input())\r\ns=input()\r\nl=s.split()\r\n\r\nfor i in range(b):\r\n\tv+=d[l[i]]\r\n\tp+=((a-d[l[i]])+1)\r\n\r\nprint(f\"{v} {p}\")", "\r\nn=int(input())\r\nd={a:i+1 for i,a in enumerate(map(int,input().split()))}\r\nm=int(input())\r\nx=sum(d[i] for i in map(int,input().split()))\r\nprint(x,(n+1)*m-x)\r\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(len(a)):\r\n d[a[i]]=[i,len(a)-i-1]\r\napp1=0\r\napp2=0\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n app1+=d[i][0]+1\r\n app2+=d[i][-1]+1\r\nprint(app1,app2)\r\n", "n = int(input())\narr = list(map(int, input().split(' ')))\nv2i = {}\nfor i, x in enumerate(arr):\n v2i[x] = i\nm = int(input())\nqueries = list(map(int, input().split(' ')))\nvasya, petya = 0, 0\nfor q in queries:\n vasya += v2i[q]+1\n petya += n-v2i[q]\nprint(vasya, petya)", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nindex = {}\r\nfor i, num in enumerate(array, start=1):\r\n index[num] = i\r\n\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\n\r\nVasya = 0\r\nPetya = 0\r\nfor query in queries:\r\n Vasya += index[query]\r\n Petya += (n + 1 - index[query])\r\n\r\nprint(Vasya, Petya)\r\n", "n = 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\nhashMap = {}\r\nfor i in range(n):\r\n hashMap[a[i]] = i+1\r\n\r\n\r\nvasya = petya = 0\r\nfor j in range(m):\r\n idx = hashMap[b[j]]\r\n vasya+= idx\r\n petya+= n - idx + 1\r\n \r\nprint(vasya,petya)", "# for i in range(int(input())):\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nque = int(input())\r\nlis = list(map(int,input().split()))\r\nc , c1 = 0 , 0\r\nf = {}\r\nb = {}\r\nfor i in range(n):\r\n f[s[i]] = i + 1\r\n b[s[i]] = n - i\r\nfor i in range(que):\r\n c += f[lis[i]]\r\n c1 += b[lis[i]]\r\nprint(c , c1)", "n = int(input())\r\nArr = list(map(int, input().split()))\r\npre_cal_Arr = {Arr[i]: i for i in range(n)}\r\n\r\n\r\nm = int(input())\r\nQuery = list(map(int, input().split()))\r\n\r\nvv = 0\r\npp = 0\r\n\r\nfor ires in Query:\r\n vv+=(pre_cal_Arr[ires]+1)\r\n pp+=(n-pre_cal_Arr[ires])\r\n\r\nprint(vv, pp)", "n = int(input())\r\narray = list(map(int, input().split()))\r\nm = int(input())\r\nquerries = list(map(int, input().split()))\r\nforward = {}\r\nfor i in range(n):\r\n forward[array[i]] = i + 1\r\nbackwards = {}\r\nfor i in range(1, n+1):\r\n backwards[array[-i]] = i\r\nfTotal = 0\r\nbTotal = 0\r\nfor i in range(m):\r\n fTotal += forward[querries[i]]\r\n bTotal += backwards[querries[i]]\r\nprint(fTotal, bTotal)", "n = int(input())\r\na = list(map(int,input().split(\" \"))) \r\nm = int(input())\r\nb = list(map(int,input().split(\" \"))) \r\n\r\narray = [None]*(n+1)\r\nfor i in range(n):\r\n array[a[i]]=i+1\r\ncomp =0\r\nfor bi in b:\r\n comp =comp +array[bi]\r\n \r\nprint(comp,m*(n+1)-comp)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [0]*(n+1)\r\nw = list(map(int, input().split()))\r\nfor i in range(n):\r\n d[w[i]] = i+1\r\ninput()\r\nx, y = 0, 0\r\nfor i in map(int, input().split()):\r\n x += d[i]\r\n y += n-d[i] + 1\r\n\r\nprint(x, y)\r\n", "from collections import Counter\nn = int(input()) # number of elements in the array.\nA = list(map(int, input().split()))\nm = int(input()) # number of queries.\n\nraw_vals=list(map(int,input().split()))\nvals = Counter(raw_vals)\n\nans = dict()\nfor i, a in enumerate(A):\n if a in vals.keys():\n ans[a] = (i+1, n - i)\n \nc1 = 0\nc2 = 0\nfor k, (a, b) in ans.items():\n c1 += a*vals[k]\n c2 += b*vals[k]\n\nprint(c1, c2)\n \n \n\n\n \n", "index = [0]*100001\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n index[a[i]] = i+1\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nvasya=petya=0\r\nfor i in range(m):\r\n vasya += index[b[i]]\r\n petya += (n+1-index[b[i]])\r\nprint(vasya,petya)\r\n", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\ndef binarys(L1,k):\r\n l=0\r\n r=n-1\r\n while(True):\r\n mid=(l+r)//2\r\n if L1[mid][1]==k:\r\n return L1[mid][0]\r\n elif L1[mid][1]>k:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\nL1=[[i,L[i]]for i in range(n)]\r\nL1.sort(key = lambda x:x[1])\r\nm=int(input())\r\nQ=list(map(int,input().split()))\r\n\r\na,b=0,0\r\n\r\n#print(L)\r\nfor i in Q:\r\n #print(binarys(L1,i))\r\n ind=binarys(L1,i)\r\n a+=ind+1\r\n b+=(n-ind)\r\n\r\nprint(a,b)\r\n\r\n \r\n\r\n#carpe diem \r\n#carpe diem", "# https://codeforces.com/contest/227/problem/B\r\nimport sys\r\n\r\nnums = {}\r\n\r\nn = int(sys.stdin.readline())\r\na = []\r\na_inp = sys.stdin.readline().split()\r\nfor i in range(len(a_inp)):\r\n tmp = int(a_inp[i])\r\n a.append(tmp)\r\n nums[tmp] = i\r\n\r\nm = int(sys.stdin.readline())\r\nb = [int(x) for x in sys.stdin.readline().split()]\r\n\r\nres_f = 0\r\nres_s = 0\r\n\r\nfor case in b:\r\n idx = nums[case]\r\n res_f += idx + 1\r\n res_s += n - idx\r\n\r\nprint(res_f, res_s)\r\n", "n=int(input());d={}\r\nfor i,j in enumerate(map(int,input().split())):\r\n\td[j]=i+1\r\nm=int(input());v,p=0,0\r\nfor i in map(int,input().split()):\r\n\tv+=d[i];p+=n-d[i]+1\r\nprint(v,p)", "n = int(input())\narr = list(map(int, input().split()))\nq = int(input())\nque = list(map(int, input().split()))\n\nnum_ind = {}\nfor i, elem in enumerate(arr):\n num_ind[elem] = i\n\nvasya, petya = 0,0\nfor query in que:\n vasya += num_ind[query] + 1\n petya += n - num_ind[query]\n\nprint(vasya, petya)\n", "n=int(input())\r\na,b,i={},{},1\r\nfor z in input().split():\r\n b[z]=i\r\n if not z in a: a[z]=i\r\n i+=1\r\nm=int(input())\r\nans1,ans2=0,0\r\nfor z in input().split():\r\n ans1+=a[z]\r\n ans2+=n-b[z]+1\r\nprint(ans1,ans2)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nq = list(map(int,input().split()))\r\ntem1=0\r\ntem2=0\r\nstack1={}\r\nstack2={}\r\nfor i in range(n):\r\n stack1[a[i]]=i+1\r\nfor j in range(n-1,-1,-1):\r\n stack2[a[j]]=n-j\r\n\r\n# print(stack1,stack2)\r\nfor i in range(m):\r\n target = q[i]\r\n if(target in stack1):\r\n tem1+=stack1[target]\r\n if(target in stack2):\r\n tem2+=stack2[target]\r\n\r\nprint(tem1,tem2)", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn = get(int)\na = gets(int)\nm = get(int)\nb = gets(int)\ns = {}\nfor i in range(n):\n s[a[i]] = i\np = 0\nq = 0\nfor i in b:\n p += s[i] + 1\n q += n - s[i]\nprint(p, q)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nan1=[10**5+1]*(n+1)\r\nan2=[-1]*(n+1)\r\nfor i in range(n):\r\n an1[a[i]]=min(an1[a[i]],i+1)\r\n an2[a[i]]=max(an2[a[i]],n-i)\r\ninput()\r\nl=0\r\nr=0\r\nfor i in list(map(int,input().split())):\r\n l+=an1[i]\r\n r+=an2[i]\r\nprint(l,r)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = int(input())\r\nh = list(map(int,input().split()))\r\n\r\nd={}\r\nfor i in range(len(l)):\r\n d[l[i]]=i\r\nans1=0\r\nans2=0\r\nfor i in h:\r\n ans1+=d[i]+1\r\n ans2+=n-d[i]\r\nprint(ans1,ans2)\r\n \r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nocc = {}\r\nfor i, j in enumerate(arr, start=1):\r\n if j not in occ:\r\n occ[j] = i\r\n \r\nv, p = 0, 0\r\nfor i in q:\r\n if i in occ:\r\n v += occ[i]\r\n p += n - occ[i] + 1\r\n\r\nprint(v, p)\r\n", "a=int(input())\r\nD={b:a for a,b in enumerate(input().split())}\r\nb=int(input())\r\ni=0\r\ni=sum(D[x] for x in input().split())\r\nprint(i+b,a*b-i)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n dict_arr = {}\r\n for i, e in enumerate(arr):\r\n dict_arr[e] = i + 1\r\n\r\n ni = int(input())\r\n result1 = 0\r\n result2 = 0\r\n ni = list(map(int, input().split()))\r\n for x in ni:\r\n \r\n result1 += dict_arr[x]\r\n result2 += n - dict_arr[x] + 1\r\n print(result1, result2)", "n = int(input())\nndic = {a:i+1 for i,a in enumerate(map(int,input().split()))}\nm = int(input())\nmlst = list(map(int,input().split()))\n\npcount =0\nvcount =0 \nfor i in mlst:\n pcount+=ndic[i]\n vcount+=n-ndic[i]+1\nprint(pcount,vcount)", "\r\nfrom collections import defaultdict\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n m = int(input())\r\n l2 = list(map(int,input().split()))\r\n c1 = 0\r\n c2 = 0\r\n m1 = {}\r\n for i in range(len(l)):\r\n m1[l[i]] = i\r\n q = defaultdict(int)\r\n for i in l2:\r\n if q[i] == 0:\r\n c = m1[i]\r\n q[i] = c+1\r\n else:\r\n c = q[i]-1\r\n c1 += c + 1\r\n c2 += n - c\r\n print(c1,c2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nlist = [int(i) for i in input().split()]\r\namount = int(input())\r\nsearch_list = [int(i) for i in input().split()]\r\nVasya, Petya = 0,0\r\nelements_pos = dict()\r\nfor pos in range(n):\r\n elements_pos[list[pos]] = pos\r\nfor i in search_list:\r\n Vasya += elements_pos[i] + 1\r\n Petya += n - elements_pos[i]\r\nprint(Vasya, Petya)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]*n\r\nfor i in range(n):\r\n b[a[i]-1]=i+1\r\nc=int(input())\r\nd=list(map(int,input().split()))\r\ne=0\r\nfor i in d:\r\n e+=b[i-1]\r\n\r\nprint(e,((n+1)*c)-e)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i+1\r\nc=0\r\np=0\r\nfor i in q:\r\n\r\n c+=d[i]\r\n p+=n-d[i]+1\r\nprint(c,p)\r\n \r\n", "l1l = int(input())\r\nd = {x: i for i, x in enumerate(input().split(' '))}\r\n\r\ninput()\r\nq = input().split(' ')\r\nv = 0\r\np = 0\r\n\r\n\r\nfor i in q:\r\n ind = d[i]\r\n v += ind+1\r\n p += (l1l - ind)\r\n\r\nprint(v, p)\r\n", "n=int(input()) #number of elements in array\r\narr=list(map(int,input().split())) #array to search\r\nm=int(input()) #number of queries\r\nqueries=list(map(int,input().split())) #values to search\r\n\r\nnums=[None]*n\r\nVasya=0\r\nPetya=0\r\n\r\nfor x in range(n):\r\n nums[arr[x]-1]=x\r\n\r\nfor x in range(m):\r\n Vasya=Vasya+nums[queries[x]-1]+1\r\n Petya=Petya+n-nums[queries[x]-1]\r\n\r\nprint(Vasya,\"\",Petya)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nranking = {n:i for i, n in enumerate(arr, start=1)}\r\n\r\nsearch = list(map(int, input().split()))\r\n\r\nvasya = 0\r\npetya = 0\r\n\r\nfor rank in search:\r\n vasya += ranking[rank]\r\n petya += num+1 - ranking[rank]\r\n\r\nprint(vasya, petya)\r\n\r\n\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\nd = {}\r\ncount = 1\r\nfor i in input().split():\r\n d[i] = count\r\n count += 1\r\nm = int(input())\r\nv, p = [0, 0]\r\nfor i in input().split():\r\n v += d[i]\r\n p += (n + 1 - d[i])\r\nprint(v, p)\r\n", "n = int(input()) \r\narr = list(map(int, input().split())) \r\nm = int(input()) \r\nqueries = list(map(int,input().split())) \r\n\r\nnum_idx = {} \r\nfor i,elem in enumerate(arr):\r\n num_idx[elem] = i \r\n\r\nboy1 = 0 \r\nboy2 = 0\r\nfor query in queries: \r\n boy1 += num_idx[query] + 1 \r\n boy2 += n - num_idx[query]\r\nprint(boy1,boy2)", "n=int(input())\r\na=[*map(int,input().split())]\r\nm=int(input())\r\nb=[*map(int,input().split())]\r\nd={}\r\nls=rs=0\r\nfor i in range(n):\r\n d[a[i]]=i\r\n \r\nfor i in range(m):\r\n l=d[b[i]]+1\r\n r=n-d[b[i]]\r\n ls+=l\r\n rs+=r\r\n\r\nprint(ls,rs)", "na = int(input())\r\na = dict(i[::-1] for i in enumerate(input().split(\" \")))\r\nnb = input()\r\nb = tuple(input().split(\" \"))\r\n\r\naIndComp = 0\r\nbIndComp = 0\r\n\r\nfor i in b:\r\n ind = a[i]\r\n aIndComp += ind + 1\r\n bIndComp += na - ind\r\n\r\nprint(aIndComp, bIndComp)\r\n", "n = int(input()); a = list(map(int, input().split())); m = int(input()); b = list(map(int, input().split()))\r\n\r\nvasya = 0\r\npetya = 0\r\nk = [0] * n\r\nfor j in range(0, len(a)):\r\n k[a[j]-1] = j+1\r\n\r\nfor i in b:\r\n vasya += k[i-1]\r\n petya += len(a) - k[i-1] + 1\r\n\r\n\r\nprint(vasya, petya)\r\n\r\n", "n = int(input())\r\nindex = [0]*100001\r\nnumbers = list(map(int, input().split()))\r\nfor i in range(1, n+1):\r\n a = numbers[i-1]\r\n index[a] = i\r\n\r\nm = int(input())\r\nVasya, Petya = 0, 0\r\nqueries = list(map(int, input().split()))\r\nfor _ in range(m):\r\n b = queries[_]\r\n Vasya += index[b]\r\n Petya += (n + 1 - index[b])\r\n\r\nprint(f\"{Vasya} {Petya}\")\r\n", "# Wadea #\r\n\r\na = int(input())\r\na1 = list(map(int,input().split()))\r\nb = int(input())\r\nb1 = list(map(int,input().split()))\r\ncounter1 = 0\r\ncounter2 = 0\r\nq1 = 1\r\nq2 = 0\r\nset1 = {}\r\nfor j in a1:\r\n set1[j] = q1\r\n q1 += 1\r\n\r\n\r\n\r\nfor i in b1:\r\n counter1 += set1[i]\r\n counter2 += a - set1[i] + 1\r\nprint(counter1,counter2)\r\n\r\n\r\n", "n= int(input())\r\ndict= {}\r\nfor i, j in enumerate(input().split()):\r\n dict[j]= i+1\r\n\r\ninput()\r\nvas, pat= 0, 0\r\nfor i in input().split():\r\n vas+= dict[i]\r\n pat+= n-dict[i]+1\r\n\r\nprint(vas, pat)", "n=int(input())\r\nl=input().split()\r\nq=int(input())\r\nql=input().split()\r\na,b=0,0\r\nd = {l[i]:i+1 for i in range(n)}\r\nfor j in ql:\r\n a += d[j]\r\n b += n-d[j]+1\r\nprint(a,b)\r\n", "n=int(input())\r\nl=list(input().split())\r\ninput();d=dict()\r\nfor i in range(len(l)):\r\n d[l[i]]=i+1;\r\na=0;b=0\r\nfor i in input().split():\r\n a+=d[i];b+=n-d[i]+1\r\nprint(a,b)", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\narray = list(map(int, stdin.readline().strip().split()))\r\nm = int(stdin.readline())\r\nqueries = list(map(int, stdin.readline().strip().split()))\r\nindex_dict = dict()\r\nfor j in range(len(array)):\r\n index_dict[array[j]] = j\r\nfirst = 0\r\nsecond = 0\r\nfor j in queries:\r\n first+=(index_dict[j]+1)\r\n second+=(n-index_dict[j])\r\nstdout.write(f\"{first} {second}\\n\")", "\r\n\"\"\"\r\n Jul 22, 2021\r\n written by zach - at 04:41 AM CST\r\n\r\n\"\"\"\r\n\r\nimport sys\r\ngetline = sys.stdin.readline\r\n\r\ndef read_int():\r\n return int(getline())\r\n\r\ndef read_ints():\r\n return list(map(int, getline().split()))\r\n\r\n\"\"\"\r\n Effective Approach - resolve\r\n \r\n keywords\r\n \"linear search\"\r\n array\r\n sequentially\r\n starting\r\n ending\r\n comparisons\r\n permutations\r\n \"want to calculate\"\r\n \"help them determine\"\r\n\r\n\"\"\"\r\n\r\nn = read_int()\r\na = read_ints()\r\nm = read_int()\r\nb = read_ints()\r\n\r\narr = [0 for i in range(int(10e5))]\r\n\r\nfor i in range(n):\r\n arr[a[i]] = i\r\n\r\nl, r = 0, 0\r\nfor q in b:\r\n l += arr[q] + 1\r\n r += n - arr[q]\r\n\r\nprint(l, r)\r\n", "n=int(input())\r\nl=list('0'*n)\r\nl2=list(map(int,input().split()))\r\nfor i in range(n):\r\n l[l2[i]-1]=i\r\nm=int(input())\r\nl3=list(map(int,input().split()))\r\nsv,sp=0,0\r\nfor i in range(m):\r\n sv+=l[l3[i]-1]+1\r\n sp+=n-l[l3[i]-1]\r\nprint(sv,sp)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nm=int(input())\r\nb=[int(x) for x in input().split()]\r\nl1=[]\r\nl2=[]\r\nfor i in range(1,len(a)+1):\r\n l1.append(i)\r\nfor i in range(len(a),-1,-1):\r\n l2.append(i)\r\nl2=l2[:-1]\r\nd1=dict(zip(a,l1))\r\nd2=dict(zip(a,l2))\r\nop=list(map(d1.get,b))\r\nop1=list(map(d2.get,b))\r\nprint(sum(op),sum(op1))", "\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n m = int(input())\r\n b = [int(i) for i in input().split(\" \")]\r\n hash = [0 for i in range(n + 10)]\r\n\r\n for i in range(n):\r\n hash[a[i]] = i + 1\r\n #print(hash)\r\n vasya = 0\r\n petya = 0\r\n for j in b:\r\n petya += n - hash[j] + 1\r\n vasya += hash[j]\r\n print(str(vasya) + \" \" + str(petya))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "a=int(input())\r\nD={b:a for a,b in enumerate(input().split())}\r\nb=int(input())\r\ni=0\r\nfor x in input().split():i+=D[x]\r\nprint(i+b,a*b-i)\r\n", "size = int(input())\nmain = list(map(int, input().split()))\ntwoDarr = [[0] for _ in range(size+1)]\n\ncounter = 1\n\nfor x in main:\n if twoDarr[x] == [0]:\n twoDarr[x][0] = counter\n else:\n twoDarr[x].append(counter)\n counter+=1\n\nqurries = int(input())\nlist_qur = list(map(int, input().split()))\n\npetya = 0\nvasya = 0\n\nfor y in list_qur:\n petya+= min(twoDarr[y])\n vasya+= size - max(twoDarr[y]) + 1\n\nprint(f'{petya} {vasya}')\n\n\n\n\n \t\t \t\t \t\t \t\t\t \t\t\t\t\t\t\t \t \t \t \t", "n = int(input())\r\narr = [(int(x) , i) for i , x in enumerate(input().split())]\r\narr.sort()\r\n\r\nm = int(input())\r\nquerries = [int(x) for x in input().split()]\r\n\r\none = 0\r\n\r\nfor e in querries:\r\n one += arr[e - 1][1]\r\n\r\nprint(one + m , m * n - one)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nqry = list(map(int, input().split()))\r\n\r\n\r\nd = {}\r\nfor i in range(n):\r\n d[arr[i]] = i+1\r\n\r\nvas = 0\r\npet = 0\r\nfor i in range(m):\r\n vas += d[qry[i]]\r\n pet += n-d[qry[i]]+1\r\nprint(vas, pet)", "n=int(input())\r\na,b={},{}\r\ni=1\r\nfor z in input().split():\r\n b[z]=i\r\n if not (z in a): a[z]=i\r\n i+=1\r\nm=int(input())\r\nans1,ans2=0,0\r\nfor z in input().split():\r\n ans1+=a[z]\r\n ans2+=n-b[z]+1\r\nprint(ans1,ans2)\r\n", "n = int(input())\r\nhash_map = {}\r\nfor i,_ in enumerate(map(int, input().split())):\r\n hash_map[_] = i + 1\r\nq = int(input())\r\nquery = list(map(int, input().split()))\r\n\r\nv,p = 0,0\r\n\r\nfor q in query:\r\n v += hash_map[q]\r\n p += (n - hash_map[q] + 1)\r\nprint(v,p)\r\n", "n = int(input())\r\ndic = {}\r\nl1 = list(map(int,input().split()))\r\nfor i in range(n):\r\n dic[l1[i]] = i+1\r\nn2 = int(input())\r\nl2 = list(map(int,input().split()))\r\ns1 = 0\r\ns2 = 0\r\nfor i in l2 :\r\n s1+=dic[i]\r\nfor i in l2 :\r\n s2+= (n-dic[i]+1) \r\nprint(f\"{s1} {s2}\")", "n = int(input()) #len of n_array\r\nn_array = {i:a for a,i in enumerate(map(int,input().split()))}\r\nm = int(input()) #len of m_array\r\nm_array = sum(n_array[i] for i in map(int,input().split()))\r\nprint(m_array+m,(n*m)-m_array)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef in_int():\r\n return(int(input()))\r\ndef in_list():\r\n return(list(map(int,input().split())))\r\ndef in_string():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef in_map():\r\n return(map(int,input().split()))\r\n \r\nn = in_int()\r\n\r\narr = in_list()\r\n\r\nm = in_int()\r\n\r\nqueries = in_list()\r\n\r\ntotal_left = 0\r\ntotal_right = 0\r\n\r\nleft_map = {}\r\nright_map = {}\r\nfor i, num in enumerate(arr):\r\n left_map[num] = min(left_map[num], i + 1) if num in left_map else i + 1\r\n right_map[num] = min(right_map[num], len(arr) - i) if num in right_map else len(arr) - i\r\n \r\n\r\nfor q in queries:\r\n total_left += left_map[q] if q in left_map else len(arr)\r\n total_right += right_map[q] if q in right_map else len(arr)\r\nprint(total_left, total_right)", "# Effective Approach\r\nn = int(input())\r\na = list(map(int,input().split(\" \")))\r\nm = int(input())\r\nb = list(map(int,input().split(\" \")))\r\ncount_first = 0\r\ncount_second = 0\r\ndic = {}\r\nfor i in range(n):\r\n dic[a[i]] = i+1\r\nfor i in b:\r\n count_first += dic[i]\r\n count_second += n - dic[i] + 1\r\nprint(count_first,count_second)", "n = int(input())\r\nl = [int(a) for a in input().split(\" \",n-1)]\r\nk = int(input())\r\nL = [int(a) for a in input().split(\" \",k-1)]\r\ns = \"\"\r\nl1 = [None]*n\r\nc,m = 0,0\r\nfor i in range(n):\r\n l1[l[i]-1]=i+1\r\nfor j in L:\r\n c = c+l1[j-1]\r\n m = m+n-l1[j-1]+1\r\n \r\n\r\ns = s+str(c)+\" \"+str(m)\r\nprint(s)\r\n ", "n= int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\nquer=list(map(int,input().split()))\r\na_dict={arr[i]:i+1 for i in range(n)}\r\nv,p=0,0\r\nfor j in quer:\r\n p+=(n-a_dict[j]+1)\r\n v+=a_dict[j]\r\nprint(v,p)\r\n", "t = int(input())\r\narr = list(map(int, input().split()))\r\nq = int(input())\r\nsearchq = list(map(int, input().split()))\r\nval = {}\r\nvas = 0\r\npet = 0\r\nfor i in range(t):\r\n val[arr[i]] = i\r\nfor que in searchq:\r\n if que in val:\r\n vas += val[que]+1\r\n pet += t-val[que]\r\nprint(vas,pet)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = int(input())\r\nnums = list(map(int, input().split()))\r\nindexes = [0 for _ in range(n)] # O(n)\r\nfor i in range(n): # O(n)\r\n indexes[arr[i]-1] = i\r\nsum1 = 0\r\nsum2 = 0\r\nfor i in nums: # O(m)\r\n sum1 += indexes[i-1]+1\r\n sum2 += n-indexes[i-1]\r\nprint(sum1, sum2)\r\n# Total O(n+m)", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = int(input())\r\nq = list(map(int, input().split()))\r\narr_ind = [i for i in range(n)]\r\nfor i in range(n):\r\n arr_ind[a[i]-1] = i + 1\r\nfirst = 0; second = 0\r\nfor i in range(t):\r\n ind = arr_ind[q[i]-1]\r\n first += ind\r\n second += n - ind + 1\r\nprint(first, second)", "def yzd_solution(n, m, steps):\r\n vasya = steps + m\r\n petya = n * m - steps\r\n return str(vasya) + \" \" + str(petya)\r\n\r\nn = int(input())\r\n\r\narr = {a:i for i, a in enumerate(map(int, input().split()))}\r\n\r\nm = int(input())\r\n\r\nsteps = sum(arr[i] for i in map(int, input().split()))\r\n\r\nprint(yzd_solution(n, m, steps))", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\nm = int(input())\r\nb = list(map(int,input().split(' ')))\r\n\r\nindex = {}\r\nfor i in range(n):\r\n index[a[i]] = i\r\n\r\nleft_to_right, right_to_left = 0, 0\r\nfor query in b:\r\n left_to_right += index.get(query) + 1\r\n right_to_left += n - index.get(query)\r\n \r\nprint(left_to_right, right_to_left, end=\" \")", "n = int(input())\narray = list(map(int, input().split()))\nm = int(input())\nqueries = list(map(int, input().split()))\n\nindDict = {}\nfor i in range(n):\n indDict[array[i]] = i\n\n\nvasaya = 0\npeyta = 0\nfor q in queries:\n ind = indDict[q]\n vasaya += (ind + 1)\n peyta += (n - ind)\n\nprint(vasaya, peyta)\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nmp1,mp2={},{}\r\nfor i in range(0,n):\r\n mp1[l1[i]]=i+1\r\n mp2[l1[i]]=n-i\r\n#print(mp1,mp2)\r\n\r\nsum1, sum2 = 0, 0\r\nfor i in range(len(l2)):\r\n sum1 += mp1[l2[i]]\r\n sum2 += mp2[l2[i]]\r\nprint(sum1, sum2)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\npositions = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n positions[a[i]] = i + 1\r\n\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\n\r\nVasya = 0\r\nPetya = 0\r\n\r\nfor query in queries:\r\n Vasya += positions[query]\r\n Petya += n - positions[query] + 1\r\n\r\nprint(Vasya, Petya)", "def main():\n # get input\n n = int(input())\n line = input()\n\n # make lookup table\n lookup = {}\n for i, val in enumerate(line.split(' ')):\n lookup[val] = i\n\n # handle queries\n m = int(input())\n line = input()\n v_score = 0; p_score = 0\n for q in line.split(' '):\n v_score += lookup[q] + 1\n p_score += n - lookup[q]\n\n print(f'{v_score} {p_score}')\n\nif __name__ == '__main__':\n main()\n\t\t\t \t \t \t\t\t \t \t\t\t\t \t \t \t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nd = {v: i + 1 for i,v in enumerate(a)}\r\n\r\nc1 = c2 = 0\r\n\r\nfor i in b:\r\n c1 += d[i]\r\n c2 += n - d[i] + 1\r\n\r\nprint(c1, c2)", "# import inbuilt standard input output\nfrom sys import stdin, stdout\n\ndef main():\n n_ints = int(stdin.readline())\n list_inds = [0,] * n_ints\n inputs_ = [int(z) for z in stdin.readline().split(\" \")]\n \n # Enter the ids\n for ind, item in enumerate(inputs_):\n list_inds[item-1] = ind + 1\n \n q_num = int(stdin.readline())\n queries = [int(x) for x in stdin.readline().split(\" \")]\n a_san = 0\n b_san = 0\n # print(list_inds)\n for query in queries:\n comparisons = list_inds[query-1]\n a_san += comparisons\n b_san += (n_ints +1 - comparisons)\n \n final_ = str(a_san) + \" \" + str(b_san) \n stdout.write(final_)\n\nif __name__ == \"__main__\":\n main()", "n = int(input())\r\nstore = {}\r\narray = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n store[array[i]] = i+1\r\nm = int(input())\r\nv = 0\r\np = 0\r\nquery = [int(x) for x in input().split()]\r\nfor i in range(m):\r\n x = query[i]\r\n v += store[x]\r\n p += n+1-store[x]\r\n \r\nprint(v,p)\r\n ", "n=int(input())\r\nw=[int(k) for k in input().split()]\r\nb=int(input())\r\nz=[int(k) for k in input().split()]\r\nq={}\r\nx, y=0, 0\r\nfor j in range(n):\r\n q[w[j]]=j\r\nfor j in range(b):\r\n x+=q[z[j]]+1\r\n y+=n-q[z[j]]\r\nprint(x, y)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\njk=0\r\nlj=0\r\ndic={}\r\ni=0\r\nwhile i< n :\r\n dic[a[i]]=i+1\r\n i+=1\r\n \r\nfor i in b :\r\n jk+=dic[i]\r\n lj+=n-dic[i]+1\r\n \r\nprint(jk,lj)", "total = int(input())\r\nlist = input().split()\r\ntotalQuery = int(input())\r\nindex_dict = {int(list[i]): i for i in range(total)}\r\nlistQuery = input().split()\r\ncountPetya = 0\r\ncountVasya = 0\r\n\r\nfor query in listQuery:\r\n index = index_dict[int(query)]\r\n countVasya += index + 1\r\n countPetya += total - index\r\n\r\nprint(countVasya, countPetya)", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\ns = list(map(int, input().split()))\n\npos = [-1] * (n+1)\nfirst = 0\nsecond = 0\n\nfor i in range(n):\n pos[a[i]] = i+1\n\nfor i in range(m):\n query = s[i]\n first += pos[query]\n second += n-pos[query]+1\n\nprint(first, second)\n\t\t \t \t \t \t\t \t\t \t \t\t\t \t\t\t\t", "n = int(input())\r\ninds = {v:i for i,v in enumerate(map(int, input().split()))}\r\nm = int(input())\r\ns = sum(inds[v] for v in map(int, input().split()))\r\nprint(s+m, n*m-s)", "len = int(input())\r\nnums = list (map(int ,input().split()))\r\n\r\nq_len = int(input())\r\nq_list = list (map(int ,input().split()))\r\n\r\nltr , rtl = 0,0\r\nmap = dict()\r\n\r\nfor i in range(len):\r\n map[nums[i]] = i+1\r\n\r\nfor i in range(q_len):\r\n ltr += map[q_list[i]]\r\n rtl += len - map[q_list[i]]+1\r\n\r\nprint(ltr, rtl)\r\n", "n=int(input())\r\na={}\r\nz1 = input().split(' ')\r\nfor i,val in enumerate(z1):\r\n a[int(val)]=i\r\nm=int(input())\r\nd={}\r\nz = input().split(' ')\r\nfor i,val in enumerate(z):\r\n if int(val) in d:\r\n d[int(val)]+=1\r\n else:\r\n d[int(val)]=1\r\nv=0;s=0;\r\nfor i in d:\r\n v+=(a[i]+1)*d[i]\r\n s+=((n-1-(a[i]))+1)*d[i]\r\nprint(v,s)", "items = int(input())\nqueryset = list(map(int, input().split()))\nsearch_items = int(input())\nsearches = list(map(int, input().split()))\n\ncount1 = 0\ncount2 = 0\nhash_map = {}\nfor i in range(items):\n hash_map[queryset[i]] = i + 1\n\nfor i in range(search_items):\n count1 += hash_map.get(searches[i], items)\n count2 += items - hash_map.get(searches[i], items) + 1\n\nprint(f\"{count1} {count2}\")\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nq=[0 for i in range(max(l)+1)]\r\nfor i in range(len(l)):\r\n q[l[i]]=i\r\n\r\n \r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nv,p=0,0\r\nfor i in b:\r\n index=q[i]\r\n v+=index+1\r\n p+=n-index\r\n \r\nprint(v,p)", "n = int(input())\r\nA = list(map(int,input().strip().split()))\r\nS = {j:i for i, j in enumerate(A,1)}\r\n\r\n\r\nb = int(input())\r\n\r\nv = sum( map(lambda x: S[int(x)],input().strip().split()))\r\np = b * (n+1) - v\r\n\r\nprint(v,p)\r\n \r\n", "D={}\r\na=int(input())\r\nA=input().split()\r\nfor i in range(a):\r\n try:D[A[i]]+=[i]\r\n except:D[A[i]]=[i]\r\ninput()\r\nm=n=0\r\nfor x in input().split():\r\n m+=D[x][0]+1\r\n n+=a-D[x][-1]\r\nprint(m,n)\r\n", "n = int(input())\r\nvec = [int(i) for i in input().split()]\r\narr = [0] * n\r\nfor i in range(n): arr[vec[i] - 1] = i\r\nm = int(input())\r\ns_1 = 0\r\ns_2 = 0\r\nfor i in input().split():\r\n s_1 += (arr[int(i) - 1]+1)\r\n s_2 += (n - arr[int(i) - 1])\r\nprint(s_1,s_2)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\nql=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n dic[l[i]]=i\r\ncv=0\r\ncp=0\r\nfor i in ql:\r\n index=dic[i]\r\n cv+=index+1\r\n cp+=n-index\r\nprint(cv,cp)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nans={}\r\nfor i in range(n):\r\n ans[a[i]]=i\r\nans1,ans2=0,0\r\nfor i in b:\r\n ans1+=ans[i]+1\r\n ans2+=n-ans[i]\r\nprint(ans1,ans2)\r\n", "n = int(input()); array = input().split()\r\nm = int(input()); queries = input().split()\r\n#dictionary is used to store indexes of elements in array\r\nV,P,positions = 0,0,{value: key for key,value in enumerate(array)}\r\n\r\nfor i in range(m):\r\n V += positions[queries[i]] + 1\r\n P += n - positions[queries[i]]\r\n \r\nprint(f'{V} {P}')\r\n", "k=int(input())\r\nl=[0]*(k+1)\r\nans=input().split()\r\nfor i in range(k):\r\n l[int(ans[i])]=i+1\r\nq=int(input())\r\nq1=map(int,input().split())\r\nsum=0\r\nsum2=0\r\nfor i in q1:\r\n sum+=l[i]\r\n sum2+=(k-l[i]+1)\r\nprint(sum,sum2)" ]

[ "import sys\nimport math\n\ndata = sys.stdin.read().split()\ndata_ptr = 0\n\ndef data_next():\n global data_ptr, data\n data_ptr += 1\n return data[data_ptr - 1]\n\nN = int(data_next())\npre = [0] + list(map(int, data[1::2]))\nnxt = [0] + list(map(int, data[2::2]))\nvis = [False] * (N + 1)\n\ndef find_last(u, nxt):\n while nxt[u] != 0:\n u = nxt[u]\n vis[u] = True\n return u\n\npre_last = -1\nfor i in range(1, N + 1):\n if not(vis[i]):\n vis[i] = True\n first = find_last(i, pre)\n last = find_last(i, nxt)\n if pre_last != -1:\n nxt[pre_last] = first\n pre[first] = pre_last\n pre_last = last\n\nfor i in range(1, N + 1):\n print(pre[i], nxt[i])\n", "if __name__=='__main__':\n\tn=int(input())\n\tdl=[[0,0]]\n\tend=0\n\tfor i in range(n):\n\t\tdl.append(list(map(int,input().split())))\n\tfor i in range(1,n+1):\n\t\tif not dl[i][0]:\n\t\t\tdl[end][1]=i\n\t\t\tdl[i][0]=end\n\t\t\tj=i\n\t\t\twhile(dl[j][1]):\n\t\t\t\t#print(dl[j])\n\t\t\t\t#j+=1\n\t\t\t\tj=dl[j][1]\n\t\t\tend=j\n\tfor node in dl[1:]:\n\t\tprint(*node)\n\t\t\n\t\t\t\n", "class CodeforcesTask847ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.cells = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.cells.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n lists = []\n for x in range(self.n):\n if not self.cells[x][0]:\n nc = [x + 1]\n curr = x\n while self.cells[curr][1]:\n curr = self.cells[curr][1] - 1\n nc.append(curr + 1)\n lists.append(nc)\n for x in range(len(lists) - 1):\n self.cells[lists[x][1] - 1][1] = lists[x + 1][0]\n self.cells[lists[x + 1][0] - 1][0] = lists[x][1]\n self.result = \"\\n\".join([\"{0} {1}\".format(*cell) for cell in self.cells])\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask847ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\n\nl, r = [0] * n, [0] * n\n\nfor i in range(n):\n l[i], r[i] = map(int, input().split())\n\narr = []\n\nused = [0] * n\n\nfor it in range(1000):\n a = -1\n for i in range(n):\n if (not used[i]) and l[i] == 0:\n a = i\n while a != -1:\n used[a] = 1\n arr.append(a)\n a = r[a] - 1\n\nl[arr[0]] = 0\nr[arr[-1]] = 0\n\nfor i in range(n - 1):\n l[arr[i + 1]] = arr[i] + 1\n r[arr[i]] = arr[i + 1] + 1\n\nfor i in range(n):\n print(l[i], r[i])\n", "if __name__ == '__main__':\n\tn=int(input())\n\tarr=[[0,0]]\n\tfor i in range(n):\n\t\tarr.append(list(map(int,input().split())))\n\t#d_link=[[0,0]]\n\tend=0\n\tfor i in range(1,n+1):\n\t\tif not arr[i][0]:\n\t\t\tarr[end][1]=i\n\t\t\tarr[i][0]=end\n\t\t\tj=i\n\t\t\twhile arr[j][1]:\n\t\t\t\tj=arr[j][1]\n\t\t\tend=j\n\n\tfor i in range(1,n+1):\n\t\tprint(*arr[i])", "n=int(input())\r\nmp=dict()\r\narr=list()\r\ncnct=[-1]*15\r\nfor i in range(1,n+1):\r\n x,y=[int(a) for a in input().split()]\r\n arr.append([x,y])\r\n mp[i]=[x,y]\r\ntog=list()\r\nfor i in range(1,n+1):\r\n fi,lst=-1,-1\r\n j=mp[i][0]\r\n if j==0:fi=i\r\n else:\r\n while 1:\r\n if mp[j][0]==0:break\r\n j=mp[j][0]\r\n fi=j\r\n j=mp[i][1]\r\n if j==0:lst=i\r\n else:\r\n while 1:\r\n if mp[j][1]==0:break\r\n j=mp[j][1]\r\n lst=j\r\n tmp=list()\r\n i=fi\r\n while i!=lst:tmp.append(i); i=mp[i][1]\r\n tmp.append(i)\r\n tog.append(tmp)\r\ncheck=dict()\r\ncheck[(tog[0][0],tog[0][-1])]=True\r\nprv=0\r\nfor i in range(1,len(tog)):\r\n if (tog[i][0],tog[i][-1]) in check:continue\r\n mp[tog[prv][-1]][1]=tog[i][0]\r\n mp[tog[i][0]][0]=tog[prv][-1]\r\n check[(tog[i][0],tog[i][-1])]=True\r\n prv=i\r\nfor i in mp:print(*mp[i])", "nodes = []\nstart_nodes = []\n\nfor i in range(int(input().strip())):\n left, right = input().strip().split()\n left = int(left)\n right = int(right)\n current = i + 1\n if left == 0:\n start_nodes.append([left, current, right])\n else:\n nodes.append([left, current, right])\n \nlists = []\n\nfor node in start_nodes:\n links = [node]\n while True:\n prevlen = len(links)\n for i in range(len(nodes)):\n if links[-1][-1] == nodes[i][1]:\n links.append(nodes[i])\n nextlen = len(links)\n \n if prevlen == nextlen:\n break\n lists.append(links)\n\nflattened = [node for ll in lists for node in ll]\n\nfor i in range(1, len(flattened)):\n if flattened[i][0] == 0:\n flattened[i][0] = flattened[i - 1][1]\n flattened[i - 1][2] = flattened[i][1]\n\nsorted_union = sorted(flattened, key = lambda x: x[1])\n\nfor node in sorted_union:\n print(node[0], node[2])\n\n\n", "from collections import defaultdict\r\nn = int(input())\r\nleft_child = [0 for i in range(n + 1)]\r\nright_child = [0 for i in range(n + 1)]\r\nvis = [0 for i in range(n + 1)]\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n left_child[i + 1] = l\r\n right_child[i + 1] = r\r\n\r\nleft,right= 1,1\r\nwhile True:\r\n if left == 0:\r\n break\r\n vis[left] = 1\r\n\r\n left = left_child[left]\r\n\r\nwhile True:\r\n if right == 0:\r\n break\r\n vis[right] = 1\r\n extend_node = right\r\n right = right_child[right]\r\n#print(right_child,left_child)\r\nfor i in range(1, n + 1):\r\n if not vis[i]:\r\n\r\n left,right= i,i\r\n while True:\r\n if left == 0:\r\n break\r\n vis[left] = 1\r\n connect_node = left\r\n left = left_child[left]\r\n \r\n \r\n right_child[extend_node] = connect_node\r\n left_child[connect_node] = extend_node\r\n while True:\r\n if right == 0:\r\n break\r\n vis[right] = 1\r\n extend_node = right\r\n right = right_child[right]\r\n\r\nfor i in range(n):\r\n print(left_child[i + 1], right_child[i + 1])\r\n", "k, n = 0, int(input())\r\nt = [list(map(int, input().split())) for j in range(n)]\r\nfor m, (l, r) in enumerate(t, 1):\r\n if not l:\r\n if k: t[k - 1][1], t[m - 1][0] = m, k\r\n k = m\r\n while r: k, r = r, t[r - 1][1]\r\nfor l, r in t: print(l, r)", "n = int(input())\r\n\r\nstarts = dict()\r\nends = dict()\r\n\r\nstart_points = set()\r\n\r\nfor i in range(n):\r\n st, en = map(int, input().split())\r\n if st == 0:\r\n start_points.add(i + 1)\r\n starts[i + 1] = st\r\n ends[i + 1] = en\r\n\r\nlists = []\r\n\r\nit = iter(start_points)\r\nx = next(it)\r\n\r\nwhile ends[x] != 0:\r\n x = ends[x]\r\n\r\nfor st in it:\r\n starts[st] = x\r\n ends[x] = st\r\n \r\n while ends[x] != 0:\r\n x = ends[x]\r\n\r\nfor i in range(1, n + 1):\r\n print(starts[i], ends[i], sep=' ')", "n = int(input())\r\nA = [list(map(int, input().split())) for i in range(n)]\r\nstart = []\r\nend = []\r\n\r\nfor i in range(n):\r\n if A[i][0] == 0:\r\n start.append(i)\r\n elif A[i][1] == 0:\r\n end.append(i)\r\n\r\n\r\nfor curr in range(len(start)):\r\n x = start[curr]\r\n #print(curr)\r\n while A[x][1] != 0:\r\n #print(x)\r\n x = A[x][1] - 1\r\n #print(x)\r\n if curr != len(start) - 1:\r\n A[x][1] = start[curr + 1] + 1\r\n A[A[x][1] - 1][0] = x + 1\r\n\r\nfor i in range(n):\r\n print(A[i][0], A[i][1])\r\n\r\n\r\n\r\n\r\n", "n = int(input().strip())\r\nl = [0] * (n + 1)\r\nr = [0] * (n + 1)\r\nq = []\r\nfor i in range(1, n + 1):\r\n l[i], r[i] = map(int, input().split())\r\n if not l[i]:\r\n q.append(i)\r\nmark = True\r\nne = None\r\nwhile q:\r\n now = q.pop(0)\r\n if not mark:\r\n l[now] = ne\r\n r[ne] = now\r\n mark = False\r\n ne = now\r\n while r[ne]:\r\n ne = r[ne]\r\nfor i in range(1, n + 1):\r\n print(l[i], r[i])", "n = int(input())\r\nL, R = [], []\r\nzL, zR = [], []\r\nA = []\r\nfor i in range(1, n+1):\r\n l, r = map(int, input().split())\r\n if l==0 and r==0:\r\n A.append(i)\r\n elif l == 0:\r\n zL.append(i)\r\n elif r == 0:\r\n zR.append(i)\r\n L.append(l)\r\n R.append(r)\r\nfor i in zL:\r\n A.append(i)\r\n while R[i-1] != 0:\r\n A.append(R[i-1])\r\n i = R[i-1]\r\nfor i in range(1, n+1):\r\n index = A.index(i)\r\n if index == 0:\r\n a = 0\r\n else:\r\n a = A[max(0, index-1)]\r\n if index == len(A)-1:\r\n b = 0\r\n else:\r\n b = A[min(len(A)-1, index+1)]\r\n print(a, b)", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(map(int,input().split())))\r\n\r\nk = 0\r\n\r\nfor x in enumerate(arr,1):\r\n i = x[0]\r\n l = x[1][0]\r\n r = x[1][1]\r\n\r\n if l == 0:\r\n if k != 0:\r\n arr[k-1][1] = i\r\n arr[i-1][0] = k\r\n k = i\r\n while r:\r\n k = r \r\n r = arr[r-1][1]\r\n else:\r\n continue\r\n\r\nfor x in arr:\r\n print(x[0],x[1])", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n arr.append([l,r])\r\n \r\nlts = []\r\nfor i in range(n):\r\n if arr[i][0] == 0:\r\n l = i\r\n j = i\r\n while arr[j][1] != 0:\r\n j = arr[j][1] - 1\r\n r = j\r\n lts.append([l,r])\r\n\r\nfor i in range(1, len(lts)):\r\n arr[lts[i-1][1]][1] = lts[i][0] + 1\r\n arr[lts[i][0]][0] = lts[i-1][1] + 1\r\n \r\nfor i in range(n):\r\n print(arr[i][0], arr[i][1])", "n = int(input())\r\nll = [list(map(int, input().split())) for _ in range(n)]\r\nll = [[0,0]] + ll\r\ntail = 0\r\nvisited = [False]*(n+1)\r\ncnt = 0\r\nwhile cnt < n:\r\n for i in range(1, n+1):\r\n if ll[i][0] == 0 and not visited[i]:\r\n head = i\r\n visited[head] = True\r\n cnt += 1\r\n break\r\n ll[tail][1] = head\r\n ll[head][0] = tail\r\n while ll[head][1] != 0:\r\n head = ll[head][1]\r\n visited[head] = True\r\n cnt += 1\r\n tail = head\r\nfor i in range(1, n+1):\r\n print(ll[i][0], ll[i][1])\r\n \r\n", "import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nn = int(input())\nleft = [-1 for _ in range(n + 1)]\nright = [-1 for _ in range(n + 1)]\ncannot = defaultdict(int)\n\nfor x in range(1, n + 1):\n\tl,r = map(int, input().split())\n\tleft[x] = l\n\tright[x] = r\n\nfor i in range(1, n + 1):\n\tif left[i] == 0:\n\t\tx = i\n\t\twhile right[x] != 0:\n\t\t\tx = right[x]\n\t\tcannot[i] = x \n\nfor i in range(1, n + 1):\n\tif left.count(0) == 1:\n\t\tbreak\n\tif left[i] == 0:\n\t\tfor j in range(1, n + 1):\n\t\t\tif right[j] == 0 and cannot[i] != j:\n\t\t\t\tleft[i] = j\n\t\t\t\tright[j] = i\n\t\t\t\tcannot.clear()\n\t\t\t\tfor i in range(1, n + 1):\n\t\t\t\t\tif left[i] == 0:\n\t\t\t\t\t\tx = i\n\t\t\t\t\t\twhile right[x] != 0:\n\t\t\t\t\t\t\tx = right[x]\n\t\t\t\t\t\tcannot[i] = x \n\t\t\t\tbreak\n\nfor i in range(1, n + 1):\n\tprint(left[i], right[i])\n\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nclass Node:\r\n value = 0\r\n left = None\r\n right = None\r\n def __repr__(self):\r\n return 'value:'+str(self.value)\r\n\r\nlib = defaultdict(Node)\r\nN = int(input())\r\nfor i in range(N):\r\n l,r = map(int, input().split())\r\n node = lib[i+1]\r\n node.value = i+1\r\n if l>0:\r\n node.left = lib[l]\r\n if r>0:\r\n node.right = lib[r]\r\n \r\nv = set()\r\nfor i in range(N):\r\n #print(lib[i+1])\r\n t = lib[i+1]\r\n while t.left:\r\n t = t.left\r\n v.add(t)\r\nv = list(v)\r\npre = None\r\nfor t in v:\r\n if pre and t.left==None:\r\n t.left = pre\r\n pre.right = t\r\n while t.right:\r\n t = t.right\r\n pre = t\r\n\r\nfor i in range(N):\r\n t = lib[i+1]\r\n l,r=t.left,t.right\r\n if l==None:\r\n l = 0\r\n else:\r\n l = l.value\r\n if r==None:\r\n r = 0\r\n else:\r\n r = r.value\r\n print(l,r)\r\n\r\n ", "n = int(input())\r\npr = [0] * n\r\nne = [0] * n\r\nfor i in range(n):\r\n pr[i], ne[i] = map(int, input().split())\r\n pr[i] -= 1\r\n ne[i] -= 1\r\nlists = []\r\nfor i in range(n):\r\n if pr[i] == -1:\r\n p = i\r\n while ne[p] != -1:\r\n p = ne[p]\r\n lists.append((i, p))\r\nfor i in range(1, len(lists)):\r\n ne[lists[i - 1][1]] = lists[i][0]\r\n pr[lists[i][0]] = lists[i - 1][1]\r\nfor i in range(n):\r\n print(pr[i] + 1, ne[i] + 1)# 1692181823.4526193" ]

[ "m,n=map(int,input().split())\r\nt=False\r\nwhile not t:\r\n for x in range(m):\r\n if n>=x+1:\r\n n-=x+1\r\n else:\r\n t=True\r\n break\r\nprint(n)", "s = list(map(int, input().split()))\r\nind = 0\r\nwhile(s[1] > 0):\r\n\tif(s[1] < ind+1):\r\n\t\tbreak\r\n\ts[1] -= ind+1\r\n\tind = (ind+1)%s[0]\r\nprint(s[1])", "import sys\r\n\r\nn, m = [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\nwhile m > 0:\r\n flag = False\r\n for i in range(1, n+1):\r\n if m < i:\r\n flag = True\r\n break\r\n m -= i\r\n\r\n if flag:\r\n break\r\n\r\nprint(m)", "n,m=map(int,input().split())\r\ns,k=0,0\r\nfor i in range(1,n+1):\r\n s+=i\r\nwhile m>s:\r\n m-=s\r\nfor i in range(1,n+1):\r\n if m>=i:\r\n m-=i\r\n else:\r\n break\r\nprint(m)\r\n ", "x,y=map(int,input().split())\r\nr=1\r\nwhile y>=r:\r\n y-=r\r\n r+=1\r\n if r==x+1: \r\n r=1\r\nprint(y)\r\n\r\n\r\n", "n,m = map(int,input().split())\r\ni=1\r\nwhile(i<=m):\r\n m-=i\r\n i+=1\r\n if i==n+1:\r\n i=1\r\nprint(m)", "N, M = map(int, input().split())\nS = int(N * (N + 1) / 2)\nImax = int((-1.0 + (1 + 8 * (M % S)) ** 0.5) / 2.0)\nresult = int(M % S - Imax * (Imax + 1) / 2)\nprint(result)\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\nm%=(n*(n+1)/2)\r\nfor i in range(1,n):\r\n if m<i:\r\n break\r\n m-=i\r\nprint(int(m))\r\n", "n, m=list(map(int, input().split()))\r\ns = (n + 1) * n/2\r\nm = m % s\r\nfor i in range(n):\r\n\tif m >= i:\r\n\t\tm -= i\r\n\telse:\r\n\t\tbreak\r\nprint(int(m))", "# cf 92A\r\n# n walruses sitting in a circle \r\n# Clockwise order \r\n# m chips\r\ni = 0\r\nn, m = map(int, input().split())\r\nwhile m > i : m, i = m -i - 1, (i + 1) % n \r\nprint(m)", "n,m=map(int,input().split())\r\nx=0\r\nflag=0\r\nwhile x<m:\r\n\tfor i in range(1,n+1):\r\n\t\tif x<m:\r\n\t\t\tx+=i\r\n\t\t\tif x>m:\r\n\t\t\t\tx-=i\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\tif flag==1:\r\n\t\tbreak\r\nprint(m-x)", "import math\r\narr = input().split()\r\nn = int(arr[0])\r\nc = int(arr[1])\r\n\r\nw = n*(n+1)/2\r\n#print(w)\r\nc %= w\r\n#print(c)\r\nm = int((-1 + math.sqrt(1 + 8*c))/2)\r\n#print(m)\r\nans = c - m*(m+1)/2\r\nprint(int(ans))", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd'''\r\n\r\nx=list(map(int,input().split()))\r\ni=1\r\nwhile(x[1]>=i):\r\n x[1]-=i\r\n if i==x[0]:\r\n i=1\r\n else:\r\n i+=1\r\nprint(x[1])", "n,m=map(int,input().split())\r\ni=0\r\nwhile 2>0:\r\n\tif m>=i:\r\n\t\tm-=i\r\n\tif i==n:\r\n\t\ti=0\r\n\ti+=1\r\n\tif m<i:\r\n\t\tbreak\r\nprint(m)\t", "n, m = map(int,input().split())\r\nm =m %(((n+1)*n)//2)\r\n\r\nfor i in range(1, n+1):\r\n if i>m:\r\n break\r\n m-=i\r\n \r\nprint(m)", "a,b=map(int,input().split())\r\ni=0\r\nwhile (b>=i):\r\n\tb-=i\r\n\ti+=1\r\n\ti%=a+1\r\nprint(b)", "from math import *\r\n\r\nn,m = map(int,input().split())\r\ni = 1\r\nwhile(m>=i):\r\n m-=i\r\n i = (i)%n+1\r\nprint(m)", "n,m=map(int,input().split())\r\ns=n*(n+1)//2\r\nif s==m:\r\n print(0)\r\nelif s>m:\r\n for i in range(1,n+1):\r\n if m>=i:\r\n m-=i\r\n else:\r\n break\r\n print(m)\r\nelse:\r\n m=m%s\r\n for i in range(1,n+1):\r\n if m>=i:\r\n m-=i\r\n else:\r\n break\r\n print(m)\r\n", "n , m = map(int,input().split())\r\nflag = True\r\nk = 1\r\nwhile flag:\r\n if k <= n:\r\n if k <= m:\r\n m-=k\r\n else:\r\n print(m)\r\n break\r\n k+=1\r\n else:\r\n k = 1\r\n", "n, m = map(int, input().split())\n\na = sum(i for i in range(1, n + 1))\n\nq, r = m // a, m % a\nfinal = 0\nif q != 0:\n m = r\n for i in range(1, n + 1):\n if m - i >= 0:\n m -= i\n else:\n final = m\n\n\nelse:\n for i in range(1, n + 1):\n if m - i >= 0:\n m -= i\n else:\n final = m\n\nprint(final)\n\n \n \n \n \n", "import sys\r\ninput = lambda:sys.stdin.readline()\r\n\r\nint_arr = lambda: list(map(int,input().split()))\r\nstr_arr = lambda: list(map(str,input().split()))\r\nget_str = lambda: map(str,input().split())\r\nget_int = lambda: map(int,input().split())\r\nget_flo = lambda: map(float,input().split())\r\n\r\nmod = 1000000007\r\n\r\ndef solve(n,m):\r\n i = 1\r\n while m >= i:\r\n m -= (i)\r\n i = i%n +1\r\n print(m)\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nn,m = get_int()\r\nsolve(n,m) \r\n", "def chip(n,m):\r\n i=0\r\n while(m>=i):\r\n m = m-i\r\n i = i+1\r\n if(i>n):\r\n i=1\r\n \r\n print(m)\r\nlist1 = [int(i) for i in input().split()]\r\n\r\nchip(list1[0],list1[1])", "\r\nn , m = map(int , input().split())\r\n\r\nr = m % ((n * (n + 1)) // 2)\r\n\r\nif r == 0:\r\n print(0)\r\nelse:\r\n for i in range(1 , n + 1):\r\n if i <= r:\r\n r -= i\r\n else:\r\n print(r)\r\n break", "if __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n m %= n * (n + 1) // 2\r\n for a in range(n):\r\n a += 1\r\n if m < a:\r\n print(m)\r\n break\r\n m -= a\r\n", "\r\ndatos = input().split()\r\nmorsas = int(datos[0])\r\nchips = int(datos[1])\r\n\r\nsuma_n_primeros = (morsas * (morsas+1)) // 2\r\n\r\nif chips > morsas:\r\n chips = chips % suma_n_primeros\r\n\r\nif chips != 0:\r\n faltaria = suma_n_primeros - chips\r\n chips_faltantes = morsas\r\n while faltaria > 0:\r\n faltaria = faltaria - chips_faltantes\r\n chips_faltantes = chips_faltantes-1\r\n print(abs(faltaria))\r\nelse:\r\n print(chips)\r\n ", "n,m=[int(x) for x in input().split()]\r\nl=(n*(n+1))//2\r\nd=m%l\r\nif d==0:\r\n print(0)\r\nelse:\r\n i=1\r\n while d>0:\r\n if i>d:\r\n break\r\n else:\r\n d-=i\r\n i+=1\r\n print(d) ", "arr=[0]*2\r\n\r\narr=list(map(int, input().split()))\r\n\r\nn=arr[0]\r\nm=arr[1]\r\n \r\nm %= int((n * (n + 1) / 2))\r\nfor i in range(1,n+1):\r\n\r\n if m < i:\r\n \r\n break\r\n \r\n m -= i\r\n\r\nprint(m)\r\n", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom re import I\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\nfrom os import path\r\nfrom heapq import *\r\n\r\ninput=sys.stdin.readline\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\n\r\n\r\n# if(path.exists('input.txt')):\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n\r\ndef myyy__answer():\r\n n,m=map(int,input().split())\r\n i=1\r\n while(m>=i):\r\n m-=i\r\n i=(i%n)+1\r\n # print(i,m)\r\n\r\n return m\r\n\r\n \r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for _ in range(int(input())):\r\n print(myyy__answer())", "walrus, chips = map(int, input().split())\n\nwhile(True):\n for i in range(walrus):\n if(i + 1 <= chips):\n chips -= (i + 1)\n else:\n print(chips)\n exit()", "n,m = map(int,input().split())\r\n\r\nm = m % (n*(n+1)//2)\r\n\r\nsum = 0\r\ni = 1\r\nwhile(sum+i <= m):\r\n sum = sum + i\r\n i += 1\r\n \r\nprint(m - sum)", "n,m = map(int,input().split())\nc = 1\nwhile True:\n c %= n+1\n if c>m: break\n m -= c\n c += 1\nprint(m)\n", "s=input().split()\na=int(s[1])\nwhile a>0 :\n for i in range(1,int(s[0])+1):\n if a-i<0 :\n print(a)\n a=a-i\n break\n else :\n if a-i==0:\n print(0)\n a=a-(i+1)\n break\n else:\n a=a-i\n if a<=0 :\n break", "n, m = map(int, input().split())\n\nchips = m\ni = 1\n\nwhile ( i <= n ):\n if ( i <= chips ):\n chips -= i\n else:\n break\n\n if ( i == n ):\n i = 0\n else:\n i += 1\n\nprint(chips)\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\n\r\ndef solve(n , m) :\r\n i = 1 \r\n\r\n while m > 0 :\r\n if m - i < 0 : return m\r\n m = m - i\r\n i += 1 \r\n if(i > n ) : i = 1\r\n\r\n return m \r\n\r\n\r\nprint(solve(n,m))", "numWalrus, numChips = list(map(int, input().split(' ')))\r\nwalruses = []\r\nfor i in range(numWalrus):\r\n walruses.append(i + 1)\r\ni = 0\r\nwhile True:\r\n element = walruses[i % numWalrus]\r\n if numChips - element >= 0:\r\n numChips -= element\r\n else:\r\n break\r\n i += 1\r\nprint(numChips)\r\n", "n,m=map(int,input().split())\r\ni=1\r\nwhile True:\r\n if(i>n):\r\n i=1\r\n if(m==0 or m<i):\r\n print(m)\r\n break\r\n else:\r\n m=m-i\r\n i=i+1", "n, m = map(int, input().split())\r\ni = 1\r\nwhile m >= i:\r\n m -= i\r\n if i+1 > n:\r\n i = 1\r\n else:\r\n i += 1\r\nprint(m)", "'''\r\nCreated on ١٣‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\nt = input().split()\r\nn = int(t[0])\r\nm = int(t[1])\r\ntotalN = (n / 2) * n + n / 2\r\n#print(totalN)\r\nrem = m - totalN * (m // totalN)\r\nfor i in range(1, n + 1):\r\n if rem >= i:\r\n rem -= i\r\n else:\r\n break\r\nprint(int(rem))\r\n", "\r\nL=input().split()\r\nm=int(L[1])\r\nn=int(L[0])\r\ni=1\r\nans=0\r\nwhile i<n+1:\r\n\tans+=i\r\n\t\r\n\tif ans<m:\r\n\t\ti+=1\r\n\tif ans==m:\r\n\t\tprint(0)\r\n\t\tbreak\r\n\telif i==n+1 and ans<m:\r\n\t\ti=1\r\n\telif ans>m:\r\n\t\tprint(m-prev)\r\n\t\tbreak\r\n\tprev=ans", "n, m = map(int, input().split())\r\ns = (1 + n) * n // 2\r\nt = m % s\r\nif t == 0:\r\n otv = 0\r\nelse:\r\n x = 0\r\n while t > 0:\r\n x = x + 1\r\n t = t - x\r\n if t == 0:\r\n otv = 0\r\n if t < 0:\r\n otv = x - abs(t)\r\nprint(otv)\r\n \r\n ", "n,m = map(int,input().split(\" \"))\r\nm %= n*(n+1)//2\r\nfor i in range(1,n+1):\r\n if(i>m):\r\n break\r\n m -= i\r\nprint(m)", "#for _ in range(int(input())):\r\nn,k=map(int,input().split())\r\n#n=int(input())\r\ns=(n*(n+1))//2\r\ns=k%s\r\ns1=0\r\nfor i in range(n):\r\n s1+=i+1\r\n if(s1>s):\r\n s1-=(i+1)\r\n print(s-s1)\r\n break\r\n", "n, m = map(int, input().split())\r\n\r\nnn = n*(n+1)/2\r\nnm = int(m % nn)\r\n\r\nfor i in range(1,n):\r\n if i > nm:\r\n break\r\n nm -= i\r\n\r\nprint(nm)", "n, m = map(int,input().split()); p = m//n; q = 0\r\nif m<=n:\r\n for i in range(1,m+1):\r\n if m-i>=0: m = m - i\r\n print(m)\r\n\r\nelse:\r\n for j in range(p):\r\n if q>0:break\r\n for i in range(1,n+1):\r\n if m-i>=0: m = m-i\r\n else: q+=1\r\n print(m)", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m=map(int,input().strip().split()[:2])\nk=1\nwhile k<=m:\n\tm-=k\n\tk+=1\n\tif k>n:\n\t\tk-=n\nprint(m)\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(i)\r\nt=sum(l)\r\nr=m%t\r\nc=r\r\nfor i in range(1,n+1):\r\n if i<=c:\r\n c-=i\r\n else:\r\n print(c)\r\n break", "n, m = map(int, input().split())\r\na = m\r\nval = \"False\"\r\nwhile(val != \"True\"):\r\n\tfor i in range(1,n+1):\r\n\t\tif(a>0):\r\n\t\t\ta = a - i\r\n\t\t\tif(a<0):\r\n\t\t\t\tprint(i+a)\r\n\t\t\t\tval = \"True\"\r\n\t\t\t\tbreak\r\n\t\t\tif(a==0):\r\n\t\t\t\tprint(a)\r\n\t\t\t\tval = \"True\"\r\n\t\t\t\tbreak\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nres = n * (n + 1) // 2\r\nm = m % res\r\n\r\nfor i in range(1, n+1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n print(m)\r\n break\r\nelse:\r\n print(m)", "#veera's code\r\nn, m = map(int, input().split())\r\ntemp = n * (n + 1) // 2\r\nfor i in range(100000000):\r\n if temp <= m:\r\n m -= temp\r\n elif temp > m:\r\n break\r\nif m == 0:\r\n print(0)\r\nelse:\r\n for i in range(1, n + 1):\r\n if m >= i:\r\n m -= i\r\n elif m < i:\r\n print(m)\r\n break", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nn,m=map(int,input().split())\r\ni=0\r\nwhile(m>=i):\r\n\tm-=i\r\n\ti+=1\r\n\tif(i>n):\r\n\t\ti=0\r\nprint(m)\t\r\n\r\n", "warluses, chips= input().split()\nwarluses=int(warluses)\nchips=int(chips)\nremaining_chips=chips\nstop=0\nwhile stop==0:\n for i in range(warluses):\n j=i+1\n if j<=remaining_chips:\n remaining_chips=remaining_chips-j\n else:\n stop = 1\nprint(remaining_chips)\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\ni=1\r\nwhile(m>=i):\r\n\tm=m-i\r\n\tif i<n:\r\n\t\ti+=1\r\n\telse:\r\n\t\ti=1\t\t\r\nprint(m)", "n,m=map(int,input().split())\r\nc=0\r\nwhile True :\r\n\tfor i in range(1,n+1):\r\n\t\tif m<i:\r\n\t\t\tc=1\r\n\t\t\tbreak\r\n\t\tm-=i\r\n\tif c==1:\r\n\t\tbreak\r\nprint(m)", "n, m = map(int, input().split())\r\n\r\nif n == 1:\r\n print(0)\r\nelse:\r\n while m >= n * (n + 1) // 2:\r\n m -= n * (n + 1) // 2\r\n cur = 1\r\n while m >= cur:\r\n m -= cur\r\n cur += 1\r\n print(m)\r\n ", "n,m=[int(x) for x in input().split()]\r\nsumm=((n)*(n+1))//2\r\nrem=m%(summ)\r\nfor i in range(1,n+1):\r\n\tif(rem>=i):\r\n\t\trem-=i\r\n\telse:\r\n\t\tbreak\r\nprint(rem)", "n, m = map(int, input().split())\nx = 1\nwhile m >= x:\n\tx, m= x+1 if x + 1 <= n else 1, m - x\nprint(m)\n", "nc=input().split()\r\nn=int(nc[0])\r\nc=int(nc[1])\r\nr=c%(n*(n+1)//2)\r\nx=int(((8*r+1)**(0.5)-1)//2)\r\nprint(r-int(0.5*x*(x+1)))", "#from sys import stdin,stdout\r\nn,m=map(int,input().split())\r\ns=int((n*(n+1))/2)\r\nr=m%s\r\nk=r\r\n#print(r)\r\ni=1\r\nwhile(True):\r\n if((r-i)<0):\r\n print(str(r))\r\n break\r\n else:\r\n r=r-i\r\n i=i+1\r\n \r\n", "a = input().split()\r\na = [int(x) for x in a]\r\nb = 1\r\nc = True\r\nwhile c:\r\n if b == a[0] + 1:\r\n b = 1\r\n a[1] -= b\r\n if a[1] < 0:\r\n a[1] += b\r\n c = False\r\n b += 1\r\nprint(a[1])", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\nsumma = 0\r\nfor i in range(n+1):\r\n summa += i\r\nfishki = m % summa #9 фишек\r\nq = 1\r\nwhile fishki>=q:\r\n fishki -= q\r\n q += 1\r\nprint(fishki)", "n,m=map(int,input().split())\r\nr=(n*(n+1))//2\r\nwhile(m>r):\r\n m-=r\r\nif(m==r):\r\n print(0)\r\nelse:\r\n for i in range(1,n+1):\r\n if(m>=i):\r\n m-=i\r\n else:\r\n print(m)\r\n break", "n, k = map(int, input().split())\nr = range(1, n+1)\nsum_r = sum(r)\n\nmod = k%sum_r\n\nfor num in r:\n if mod >= num:\n mod -= num\n else:\n print(mod)\n break\n\n", "n , k = map(int, input().split())\r\ni = 1\r\nwhile k>=i:\r\n k -= i\r\n i += 1\r\n if i == n+1:\r\n i = 1\r\nprint(k)", "\nw, k = list(map(int,input().split()))\n\ni = 0\nwhile i<=w:\n i+=1\n if k==0 or k<i:\n break\n if k >= i:\n k-=i\n if i==w and k>0:\n i = 0\n\nprint(k)\n\n", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\nc=m%sum(i for i in range(1,n+1))\r\nfor i in range(1,n):\r\n if c-i>=0:\r\n c-=i\r\n else:break\r\nprint(c)", "inp = list(map(int,input().split()))\r\nwal=inp[0]\r\nchip=inp[1]\r\nchip=chip%((wal*(wal+1))//2)\r\nnow=chip\r\nwhile(1):\r\n k=8*now+1\r\n m=int(pow(k,0.5))\r\n if(m*m==k):\r\n break\r\n else:\r\n now=now-1\r\nprint (chip-now)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nlist1 = []\r\nfor i in range(1,n+1):\r\n list1.append(i)\r\nb1 = False\r\nflag = 0\r\nwhile b1==False:\r\n for i in list1:\r\n if m<i:\r\n flag+=1\r\n break\r\n m-=i\r\n if m==0:\r\n flag+=1\r\n break\r\n if flag == 1:\r\n print(m)\r\n break\r\n \r\n ", "n,m=map(int,input().split())\r\na=0\r\nwhile True :\r\n\tfor i in range(1,n+1):\r\n\t\tif m<i:\r\n\t\t\ta=1\r\n\t\t\tbreak\r\n\t\tm-=i\r\n\tif a==1:\r\n\t\tbreak\r\nprint(m) \t\r\n", "[n, m] = input().split(\" \")\nn = int(n)\nm = int(m)\nremain = m\ncurrent = 1\nwhile remain >= current:\n remain -= current\n current = 1 if current + 1 > n else current + 1\n\nprint(remain)\n", "n,m=map(int,input().split())\r\nwhile 1:\r\n for i in range(1,n+1):\r\n if m<i:\r\n print(m)\r\n exit()\r\n m-=i", "n, m = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n if i+1<=m:\r\n m -= i+1\r\n i = (i+1) % n\r\n else:\r\n break\r\nprint(m)\r\n", "from sys import *\r\nfrom itertools import *\r\n\r\n\r\ndef binary_search(arr, start, end, x):\r\n if (end < start):\r\n # Element is not present in the array\r\n return -1\r\n else:\r\n mid = start + (end - start) // 2\r\n # If element is present at the middle\r\n if (arr[mid] == x):\r\n return mid\r\n elif arr[mid] < x and mid < len(arr)-1 and arr[mid + 1] > x:\r\n return mid\r\n # If element is smaller than mid\r\n elif (arr[mid] > x):\r\n return binary_search(arr, start, mid - 1, x)\r\n # Else the element greater than mid\r\n else:\r\n return binary_search(arr, mid + 1, end, x)\r\n\r\n\r\ndef inp():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\ndef arr_sum(n):\r\n return list(accumulate([i for i in range(n + 1)], lambda x, y: x + y))\r\n\r\n\r\ndef main():\r\n n, m = inp()\r\n mem, ans = arr_sum(n), 0\r\n while (True):\r\n ix = binary_search(mem, 0, n, m)\r\n m -= mem[ix]\r\n if ix != -1:\r\n break\r\n print(m)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\r\nm%=(n*(n+1))/2\r\nm=int(m)\r\nfor i in range(1,n+1):\r\n if m<i:\r\n print(m)\r\n break\r\n m-=i", "n,m = map(int, input().split())\r\n\r\nwhile m > 0:\r\n for i in range(1,n+1):\r\n m = m - i\r\n if(m==0):\r\n print(m)\r\n break\r\n elif(m<0):\r\n print(m+i)\r\n break", "n, m =map(int, input().split())\r\ng = 1\r\nwhile True:\r\n if m>=g:\r\n m-=g\r\n else:\r\n break\r\n g = g%n+1\r\nprint(m)\r\n", "import math\r\ndef findN (n) -> int:\r\n return math.floor((math.sqrt(8*n+1)-1)/2)\r\ndef arthSum (n) -> int:\r\n return int((n*(1+n))/2)\r\nn,m = map(int,input().split())\r\nwalrus,chips = arthSum(n),m\r\ntrip = chips//walrus; chips -= trip*walrus\r\nleft = arthSum(findN(chips))\r\nprint (chips - left)", "# coding: utf-8\nn, m = [int(i) for i in input().split()]\ncurrent = 1\nm = m%((1+n)*n//2)\nwhile True:\n if m>=current:\n m -= current\n current = current%n+1\n else:\n break\nprint(m)\n", "n,m = map(int,input().split())\r\nm %= (n*(n+1)/2)\r\nfor i in range(1,n+1):\r\n\tif(m<i):\r\n\t\tbreak\r\n\tm-=i\r\nprint(int(m))", "\nn, m = map(int, input().split())\n\nwhile m > n*(n+1)//2:\n m -= n*(n+1)//2\n\n\nfor i in range(1, n+1):\n if m >= i:\n m -= i\n else:\n print(m)\n break\n\n if m == 0:\n print(m)\n break\n\n\n\n\n", "l = list(map(int,input().split()))\r\nn = l[0]\r\nm = l[1]\r\nres = 0\r\nstart = 1\r\nstep = 1\r\nwhile True:\r\n if start == m:\r\n m = 0\r\n break\r\n elif start < m:\r\n m = m - start\r\n elif start > m:\r\n break\r\n start += 1\r\n if start > n:\r\n start = 1\r\n\r\nprint(m)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,k=map(int,input().split())\r\ni=1\r\nwhile k>=i:\r\n\tk-=i\r\n\tif i<n:\r\n\t\ti+=1\r\n\telse:\r\n\t\ti=1\r\nprint(k)\t\t\t\r\n", "s = input()\r\na = []\r\na = s.split()\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\t\r\ni = 1\r\nwhile i <= a[0]:\r\n\tif a[1] >= i:\r\n\t\ta[1] -= i\r\n\t\ti += 1\r\n\telse:\r\n\t\tbreak\r\n\tif i > a[0]:\r\n\t\ti = 1\r\n\t\t\r\nprint(a[1])", "# -*- coding: utf-8 -*-\n\nfrom math import sqrt\n\ndef solve():\n n, m = map(int, input().split())\n\n sum = n * (n + 1) // 2\n r = m % sum\n maxI = int((-1 + sqrt(1 + 8 * r)) / 2)\n print(r - maxI * (maxI + 1) // 2)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t \t \t\t \t \t\t\t \t \t\t\t \t \t", "n, m =map(int,input().strip().split())\n\nw=[a for a in range(1,n+1)]\n\ncounter=0\nwhile True:\n\t# print(counter)\n\tif m<w[counter]:\n\t\tprint(m)\n\t\tbreak\n\tm-=w[counter]\n\tcounter = (counter+1)%(n)", "a,b = map(int,input().split())\r\nsum = 0\r\ni = 0\r\nwhile True:\r\n i+=1\r\n if i-1 == a:i = 1\r\n sum+=i\r\n if sum == b:break\r\n elif sum > b:\r\n sum-=i\r\n break\r\nprint(b - sum)", "nm = list(map(int, input().split()))\r\ni = 1\r\nwhile i <= nm[1]:\r\n\tnm[1] -= i\r\n\ti += 1\r\n\tif i > nm[0]:\r\n\t\ti = 1\r\nprint(nm[1])", "n, m = map(int, input().split())\r\n\r\ni = 1\r\nwhile True:\r\n if (m - i) >= 0:\r\n m -= i\r\n else:\r\n break\r\n i += 1\r\n if i > n:\r\n i = 0\r\nprint(m)", "import sys\n\nn, m = map(int, input().split())\nwhile True:\n for i in range(n):\n if i + 1 <= m:\n m -= i + 1\n else:\n print(m)\n sys.exit()\n", "a, b = map(int, input().split())\r\ns = (a * (a + 1)) // 2\r\nn = b // s\r\nb = b - n * s\r\nx = 1\r\nss = 0\r\nk = 0\r\nfor i in range(1, b + 1):\r\n ss += x\r\n if ss > b:\r\n break\r\n k = ss\r\n x += 1\r\nprint(b - k)", "n, m = map(int, input().split())\n\nactive = True\n\n\nwhile active == True:\n for i in range(1, n + 1):\n if m - i > -1:\n m -= i\n else:\n print(m)\n active = False\n quit()", "n, m = list(map(int, input().split()))\r\n\r\ntot = (n * (n+1)) / 2\r\nif m > tot:\r\n m %= tot\r\n\r\nfor i in range(1, n+1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n break\r\n\r\nprint(int(m))", "a,b=map(int,input().split())\r\nc=1\r\nwhile b>=c:\r\n b-=c\r\n c+=1\r\n if c==a+1: \r\n c=1\r\nprint(b)\r\n\r\n\r\n", "n,chips=map(int,input().split())\r\nx=(n*(n+1))//2\r\n#print(x)\r\nif(chips>x):\r\n chips=chips%x\r\n\r\nfor i in range(1,n+1):\r\n if(i>chips):\r\n break\r\n else:\r\n chips-=i\r\nprint(chips)\r\n \r\n \r\n ", "n,m=map(int,input().split())\r\ntemp=n*(n+1)//2\r\nfor i in range(100000000):\r\n if temp<=m:\r\n m-=temp\r\n elif temp>m:\r\n break\r\nif m==0:\r\n print(0)\r\nelse:\r\n for i in range(1,n+1):\r\n if m>=i:\r\n m-=i\r\n elif m<i:\r\n print(m)\r\n break\r\n ", "n, m = map(int, input().split())\r\nx = 1\r\n\r\nwhile m >= x:\r\n m -= x\r\n x = (x + 1) % (n + 1)\r\n \r\nprint(m)", "n,m=map(int,input().split())\ni=1\nwhile True:\n if i%n==0:\n i=n\n elif i%n!=0:\n i=i%n\n if i>m:\n break\n else:\n m-=i\n i+=1\nprint(m)\n", "# LUOGU_RID: 101455605\nfrom collections import deque\r\nn, m = map(int, input().split())\r\nq = deque(range(1, n + 1))\r\nwhile q:\r\n if q[0] > m:\r\n exit(print(m))\r\n m -= q[0]\r\n q += q.popleft(),", "morj, fish = map(int, input().split())\r\nflag = True\r\nwhile flag:\r\n for i in range(1, morj+1):\r\n if fish < i:\r\n print(fish)\r\n flag = False\r\n break\r\n fish -= i\r\n", "m,p=map(int,input().split())\r\ni=0\r\nwhile p>i:\r\n p,i=p-i-1,(i+1)%m\r\nprint(p)", "n, m = tuple(map(int,input().split()))\n\ndef sum_of_n_digits(n):\n return n * (n + 1) // 2\n\none_circle_count = sum_of_n_digits(n)\nfull_circles = m // one_circle_count\n\ncoins = m - one_circle_count * full_circles\nneed_coins = 0\n\nwhile need_coins <= coins:\n coins -= need_coins\n need_coins += 1\n\nprint(coins)\n", "n, m = map(int, input().split())\r\n\r\nved = 0\r\n\r\n\r\nwhile m > 0:\r\n for k in range(1, n + 1):\r\n if m >= k:\r\n m = m - k\r\n else:\r\n ved = m\r\n m = 0\r\n break\r\n\r\nprint(ved)\r\n\r\n\r\n", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\na,b=map(int,input().split())\r\ni=1\r\nwhile(b>=i):\r\n b-=i\r\n i=(i%a)+1\r\nprint(b)\r\n", "n, m = map(int, input().split())\r\nloop = True\r\nwhile m > 0 and loop == True:\r\n for i in range(n):\r\n if m < i+1:\r\n loop = False\r\n break\r\n else: \r\n m -= i+1\r\nprint(m) ", "n,m=map(int,input().split());i=0\r\nwhile m>i:m-=-~i;i=-~i%n\r\nprint(m)", "N, Sum = map(int, input().split())\r\ni = 1\r\nwhile Sum >= 0:\r\n if Sum - i < 0:\r\n print(Sum)\r\n break\r\n Sum -= i\r\n if i >= N:\r\n i = 1\r\n else:\r\n i += 1", "def main():\r\n n, m = map(int, input().split())\r\n m = m % (n*(n+1)//2)\r\n for i in range(1, n+1):\r\n if (m < i):\r\n break\r\n m = m - i\r\n\r\n print(m)\r\n\r\n\r\nmain()\r\n", "n, m = map(int,input().split())\nc = 0\nwhile c == 0:\n for i in range(1,n+1):\n if m >= i :\n m -= i\n else:\n print(m)\n c += 1\n break", "n,m = map(int,input().split())\r\ni = 1\r\npas = 0\r\nwhile True:\r\n if m < i:\r\n pas += m\r\n break\r\n elif i == n:\r\n m -= i\r\n i = 1\r\n else:\r\n m-=i\r\n i+=1\r\n \r\nprint(pas if pas>=0 else 0)", "\r\ndef main():\r\n n, m = [int(v) for v in input().split()]\r\n s = 0\r\n d = n*(n+1)//2\r\n res = m%d\r\n s=0\r\n for i in range(n):\r\n if s+i>res:\r\n break\r\n s+=i\r\n print(res-s)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n pos = 1\r\n while m >= pos:\r\n m -= pos\r\n pos += 1\r\n if pos > n:\r\n pos = 1\r\n\r\n print(m)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = [int(i) for i in input().split()]\r\nm %= (n+1)*n//2\r\nans = 0\r\nfor i in range (n):\r\n if m - i - 1 < 0:\r\n ans = m\r\n else:\r\n m -= i+1\r\nprint (ans)", "n,m=map(int,input().split())\r\ni=1\r\nwhile True:\r\n if i<=m:\r\n m-=i\r\n elif i>m:\r\n print(m)\r\n break\r\n if i==n:\r\n i=0\r\n i+=1\r\n \r\n", "from re import I\r\n\r\n\r\nn,m=list(map(int,input().split()))\r\ns=0\r\nsum=n*(n+1)//2\r\na=m%sum\r\nif a==0:\r\n print(\"0\")\r\nelse:\r\n for i in range(1,n+1):\r\n s+=1\r\n a=a-s\r\n if a<i+1:\r\n print(a)\r\n break\r\n\r\n", "n, m = map(int, input().split())\r\nm %= (n+1)*n//2\r\nfor i in range(1, n+1):\r\n if m >= i: m -= i\r\nprint(m)\r\n", "from collections import defaultdict, Counter, deque\nfrom math import inf\nfrom functools import lru_cache\nfrom heapq import heappop, heappush, heapify\nfrom bisect import bisect_left, bisect_right\n \nimport sys\ninput=sys.stdin.readline\n#print=sys.stdout.write\n \nMod = 10**9 + 7\n \ndef solution(): \n\n n,m = map(int, input().split())\n i = 1\n while m:\n if m < i:\n break\n\n m -= i\n i += 1\n if i > n:\n i = 1\n print(m)\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n \n \n#import sys\n#import threading\n#sys.setrecursionlimit(10**6)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "m, n = map(int, input().split())\r\n\r\ncurr = 1\r\nwhile n >= curr:\r\n n -= curr\r\n curr += 1\r\n if curr == m+1:\r\n curr = 1\r\nprint(n)\r\n", "a, b = map(int, input().split())\r\nc = 0\r\nfor i in range(a+1):\r\n c+=i\r\nb = b%c\r\nfor i in range(a+1):\r\n if b < i:\r\n print(b)\r\n break\r\n b -= i", "n, m = [int(i) for i in input().split()]\r\nx=1\r\nwhile m>=x:\r\n m-=x\r\n x=(x+1)%(n+1)\r\nprint(m)", "def main():\n n,m = map(int,input().split())\n m = m%((n*(n+1))//2)\n for i in range(1,n+1):\n if m < i:\n print(m)\n break\n else:\n m -= i\nif __name__ == \"__main__\":\n main()\n", "n, m = map(int,input().split())\r\nc = int(m%(n*(n+1)*0.5))\r\nfor i in range(1,n+1):\r\n\tif i > c : break\r\n\tc-=i\r\nprint(c)", "# cf 92 A\n# clockwise: 3 2 1 n\nn, m = map(int, input().split())\n# n = walruses, m = chips\ni = 1\nwhile m >= i:\n m -= i\n i += 1\n if i > n:\n i = 1\nprint(m)\n", "n,c = map(int,input().split())\r\ni = 1\r\nwhile c >=i:\r\n c-= i\r\n i +=1\r\n if i == n+1:\r\n i = 1\r\nprint(c)", "n,m=map(int,input().split())\r\nx=m % (n*(n+1)//2)\r\nfor i in range(n):\r\n if x<i:\r\n break\r\n x=x-i\r\nprint(x) \r\n", "# A. Chips\n\nn, m = map(int, input().split())\nrnd = (1 + n) * n // 2\nif m > rnd:\n m %= rnd\nfor i in range (1, n+1):\n if m < i:\n break\n else:\n m -= i\nprint(m)\n", "import sys\nn, m = map(int, sys.stdin.readline().split())\nN = (n*(n+1))//2\nm = m%N\nfor i in range(1,n+1):\n if m >= i:\n m -= i\n else:\n print(m)\n break\n", "n, m = map(int,input().split())\r\ncounter = 1\r\nwhile m >= counter:\r\n m -= counter\r\n if counter == n:\r\n counter -= n\r\n counter += 1\r\nprint(m)", "n, m = map(int, input().split())\ns = (n * (n + 1)) // 2\nx = m % s\ni = 1\nwhile True:\n if x - i >= 0:\n x -= i\n i += 1\n else:\n break\nprint(x)\n", "n, m = list(map(int, input().split()))\r\ni = 0\r\nwhile True:\r\n if (m - i < 0):\r\n break\r\n m-=i\r\n if (i == n):\r\n i = 0\r\n i += 1\r\nprint(m)", "n, m = list(map(int, input().split()))\nx = n * (n + 1) // 2\nif m // x > 0:\n m %= x\ni = 1\nwhile m - i >= 0:\n m -= i\n i += 1\nprint(m)", "n, m = map(int, input().strip().split())\r\ni=0\r\nwhile True:\r\n i = i%(n+1)\r\n if m >= i:\r\n m = m - i\r\n else:\r\n break\r\n i = i+1\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\na = (n * (n+1)) // 2\r\nm = m - (a * (m // a))\r\nfor i in range(1, n+1):\r\n if m - i < 0:\r\n print(m)\r\n break\r\n if m - i == 0:\r\n print(0)\r\n break\r\n m = m - i", "n,c=[int(x) for x in input().split()]\r\ni=1\r\nwhile c>=i:\r\n if c<i:break\r\n c-=i\r\n i=i%n+1\r\nprint(c)", "n,m = map(int,input().split())\r\nans = 0\r\ng = 0\r\ncount = 0\r\ne = 0\r\nsum = 0\r\ni = 0\r\nfor i in range (1,n+1,1):\r\n ans +=i\r\nif m > ans :\r\n g = m // ans\r\no = m - g*ans\r\nfor u in range(1, o+1, 1):\r\n sum += u\r\n count += 1\r\n if sum > o :\r\n break\r\nfor v in range(1, count, 1):\r\n e += v\r\nif count == 1:\r\n i = 1\r\nif e == o or i == 1:\r\n print(0)\r\nelse:\r\n print(o - e)\r\n", "n,m=list(map(int ,input().split()))\r\nsample=list(range(1,n+1))\r\n# print(sample)\r\n# print(\"Original Value Of m is\",m)\r\nans_list=[]\r\nwhile m>=0:\r\n\tfor i in range(0,len(sample)):\r\n\t\tm-=sample[i]\r\n\t\t# print(m)\r\n\t\tans_list.append(m)\r\n\r\n# print(ans_list)\r\nif(0 in ans_list):\r\n\tprint(0)\r\nelse:\r\n\tfinal=[]\r\n\tfor j in range(0,len(ans_list)):\r\n\t\tif(ans_list[j]>0):\r\n\t\t\tfinal.append(ans_list[j])\r\n\tfinal.sort()\r\n\tprint(final[0])\r\n", "n, m = map(int, input().split())\n\ni = 1\nwhile True:\n if i > n:\n i = 1 \n if i > m:\n print(m)\n break\n m -= i\n i += 1\n", "import sys\ninput = sys.stdin.buffer.readline\n\nn, m = map(int, input().split())\ntotal = (n*(n+1))//2\nif total == m:\n print(0)\nelse:\n k = m % total\n for i in range(1, n+1):\n if k < i:\n break\n k-=i\n\n print(k)\n \n ", "X=list(map(int,input().split(\" \")))\r\ni=1\r\nwhile X[1]>=i:\r\n X[1]-=i\r\n i+=1\r\n if i>X[0]:\r\n i=1\r\nprint(str(X[1]))", "n,m=[int(x) for x in input().split(\" \")]\r\nflag=True\r\nwhile(m>0 and flag==True):\r\n\tfor i in range(1,n+1):\r\n\t\tif(m<i):\r\n\t\t\tflag=False\r\n\t\t\tbreak\r\n\t\tif(m>=i):\r\n\t\t\tm=m-i\r\n\t\t\t#print(m)\r\nprint(m)", "# noinspection PyShadowingNames\r\ndef ssum(n):\r\n\r\n return n * (n + 1) // 2\r\n\r\n\r\n# noinspection PyShadowingNames\r\ndef find_k(x, n):\r\n l = 1\r\n r = n - 1\r\n k = 0\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n y = ssum(n - mid)\r\n if y <= x:\r\n k = y\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return x - k if k else x\r\n\r\n\r\nn, m = map(int, input().split(' '))\r\nx = m % ssum(n)\r\n\r\nprint(find_k(x, n))\r\n", "n, m = map(int, input().split())\r\nm %= int(n*(n+1)/2)\r\nfor i in range(1,n+1):\r\n if m < i:\r\n break\r\n m -= i\r\nprint(m)", "n,m=map(int,input().split());i=1\r\nwhile m>0:\r\n if m-i >= 0:\r\n m-=i\r\n else:\r\n break\r\n i=(i%n)+1\r\nprint([0,m][m>0]) ", "n, m = map(int, input().split())\r\ni = 1\r\nwhile m >= 0:\r\n m, i = m - i, i + 1\r\n if i == n + 1: i = 1\r\nif i == 1: print(m + n)\r\nelse: print(m + i - 1)", "n, m = [int(s) for s in input().split(' ')]\r\ni = 1\r\nwhile m - i >= 0:\r\n m -= i\r\n i = (i % n) + 1\r\nprint(m)", "n,m = map(int,input().split())\r\ni=1\r\nwhile(m>=0):\r\n z=m\r\n m -= i \r\n i+=1\r\n if i>n:\r\n i=1\r\nprint(z)", "a, b = map(int, input().split())\r\ns = 0\r\nwhile 1:\r\n for i in range(1, a + 1):\r\n if b < i:\r\n print(b)\r\n exit()\r\n b -= i\r\n", "#!/usr/bin/env python3\n\ndef main():\n n, m = map(int, input().split())\n tot = (1+n)*n // 2\n res = m % tot\n i = 1\n\n while res >= i:\n res -= i\n i += 1\n\n print(res)\n\nif __name__ == \"__main__\":\n main()\n\n", "n,m = [int(x) for x in input().split()]\r\nsumm = n*(n+1)//2\r\nrem = m%summ\r\n\r\nfor i in range(1,n+1):\r\n if rem>=i:\r\n rem-=i\r\n elif rem<i or rem==0:\r\n break\r\n \r\nprint(rem)\r\n\r\n", "n, m = map(int, input().split())\n\noneCircle = sum(range(n+1))\nremain = m % oneCircle\n\nfor i in range(n+1):\n if sum(range(i+1)) > remain:\n ans = remain - sum(range(i))\n break\nprint(ans)", "# # RED CODER # #\r\nn, k = map(int, input().split())\r\nk %= (n*(n+1) // 2)\r\nfor i in range(n):\r\n if k < i:\r\n break\r\n else:\r\n k -= i\r\nprint(k)\r\n", "from math import ceil, floor, sqrt, log, gcd\r\ndef solve ():\r\n\tN,M = [int(X) for X in input().split()]\r\n\tA = [int(X)+1 for X in range (N)]\r\n\t# print (A)\r\n\ti = 0\r\n\twhile True:\r\n\t\t# print (M,i)\r\n\t\tif M < A[i]:\r\n\t\t\tbreak\r\n\t\tM -= A[i]\r\n\t\ti = (i + 1)%N\r\n\r\n\tprint (M)\r\nif __name__ == '__main__':\r\n\tT = 1\r\n\t# T = int (input())\r\n\tfor _ in range (T):\r\n\t\tsolve ()\r\n'''\r\n3\r\n4 11\r\n17 107\r\n3 8\r\n\r\n0\r\n2\r\n1\r\n'''", "n,m=[int(x) for x in input().split()]\r\nm%=(n+1)*n//2\r\nfor i in range(1,n+1):\r\n if i<=m:m-=i\r\n else:break\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\n\r\ni = 0\r\nwhile m >= (i + 1):\r\n m -= (i + 1)\r\n i = (i + 1) % n\r\n\r\nprint(m)", "n, m = map(int, input().split())\r\ncur = 1\r\nwhile True:\r\n if m < cur:\r\n break\r\n m -= cur\r\n cur += 1\r\n if cur > n:\r\n cur = 1\r\nprint(m)", "def answer():\r\n a = [int(x) for x in input().split()]\r\n n = a[0]\r\n k = a[1]\r\n i=1\r\n while k-i>=0:\r\n #print(k,i)\r\n k-=i\r\n i+=1\r\n if i==n+1:\r\n i=1\r\n print(k)\r\n\r\n\r\nanswer()", "a=input().split()\r\n\r\nman=int(a[0])\r\ntotal=int(a[1])\r\n\r\ns=0\r\n\r\nwhile True:\r\n for i in range(man):\r\n total=total-(i+1)\r\n if total<0:\r\n total=total+(i+1)\r\n s=1\r\n if s==1:\r\n print(total)\r\n break", "def main():\r\n\tn, m = map(int, input().split())\r\n\r\n\twalrus = 1\r\n\tchips = m\r\n\twhile True:\r\n\t\tif chips < walrus:\r\n\t\t\tbreak\r\n\t\tchips -= walrus\r\n\r\n\t\tif walrus == n:\r\n\t\t\twalrus = 1\r\n\t\telse:\r\n\t\t\twalrus += 1\r\n\r\n\tprint(chips)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "def solution():\r\n\tn,m=map(int,input().split())\r\n\tarr=[j for j in range(1,n+1)]\r\n\tidx=0\r\n\twhile arr[idx]<=m:\r\n\r\n\t\tm-=arr[idx]\r\n\t\tidx+=1\r\n\t\tif idx==len(arr):\r\n\t\t\tidx=0\r\n\tprint(m)\r\n\t\r\n\r\n\r\n\r\n\treturn\r\n\r\n\r\n# t=int(input())\r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n\r\n\t", "n,m=map(int,input().split())\r\n\r\nx=m\r\ni=1\r\n\r\nwhile(x>=i):\r\n x-=i\r\n i+=1\r\n if(i==n+1):\r\n i=1\r\nprint(x)\r\n", "a, b = map(int, input().split())\r\nflag = 0\r\nwhile (flag != 1):\r\n for i in range (1, a + 1):\r\n if (b > 0 and b >= i):\r\n b -= i\r\n else:\r\n flag = 1\r\nprint(b)", "n, m = list(map(int, input().split(' ')))\r\na = list(range(1, n + 1))\r\ni = 0\r\nwhile m >= a[i]:\r\n m -= a[i]\r\n i = (i + 1) % n\r\nprint(m)\r\n", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN,M=map(int,input().split())\r\ni=1\r\nsum=0\r\nX=1\r\nwhile i<=M:\r\n\tM=M-i\r\n\ti=(i+1)%N\r\n\tif i==0:\r\n\t\ti=N\r\nprint(M)\r\n", "#92A\r\n\r\nn,m = map(int,input().split())\r\n# print(n,m)\r\ni = 1\r\n\r\nwhile (m > 0):\r\n if i > n:\r\n i = 1\r\n else:\r\n if (m >= i):\r\n m-=i\r\n # print(m,i)\r\n if m == 0:\r\n print(m)\r\n break\r\n i+=1\r\n else:\r\n print(m)\r\n break ", "n,m=map(int,input().split())\r\na=[i for i in range(1,n+1)]\r\ni=0\r\ni=i%n\r\nwhile m>=a[i]:\r\n m-=a[i]\r\n i+=1\r\n i = i % n\r\nprint(m)", "from collections import Counter\r\ndef func():\r\n x,y=map(int,input().split())\r\n s=int(x*(x+1)/2)\r\n #print(s)\r\n if y%s==0:\r\n print(\"0\")\r\n return\r\n y=y%s\r\n #print(y)\r\n for i in range(1,x+1):\r\n if y>=i:\r\n y-=i\r\n else:\r\n print(y)\r\n return\r\n\r\nt=1\r\n#t=int(input())\r\nfor i in range(t):\r\n func()", "n, m = tuple(map(int, input().split()))\r\nwhile ( (n*(n + 1)) // 2 ) <= m:\r\n m -= ( (n*(n + 1)) // 2 )\r\ni = 1\r\nwhile m - i >= 0:\r\n m -= i\r\n i = i + 1\r\n if i > n:\r\n i = 1\r\nprint(m)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jan 18 14:19:55 2019\r\n\r\n@author: KIIT\r\n\"\"\"\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nif __name__ == '__main__':\r\n a = list(map(int, input().rstrip().split()))\r\n n,m=a[0],a[1]\r\n c,j=0,1\r\n while(m>=j):\r\n #print(j,m)\r\n m=m-j \r\n \r\n j=j+1\r\n #print(m)\r\n if(j>n):\r\n j=1\r\n print(m)", "n , k = map(int , input().split())\r\nrest = k % ((n* (n + 1) )// 2)\r\ni = 0 \r\nwhile i <= rest : \r\n rest -= i \r\n i+= 1\r\nprint(rest)", "n,m=map(int,input().split())\nt = 0\nwhile m>=0:\n for i in range(n+1):\n t = m\n m-=i\n if m<0:\n break\nprint(t)\n \t\t \t \t\t\t\t \t\t \t\t \t \t \t\t\t\t \t\t", "m,p=map(int,input().split())\r\ni=0\r\nwhile p>i:p,i=p-i-1,(i+1)%m\r\nprint(p)", "n,temp = map(int,input().split())\r\nwhile(temp!=0):\r\n for i in range(1,n+1):\r\n if(temp-i<0):\r\n print(temp)\r\n exit()\r\n temp-=i;\r\nprint(temp)\r\n\r\n", "n,m=map(int,input().split())\r\nsum=0\r\nfor i in range(1,n+1,1):\r\n sum+=i\r\ni=1\r\nm=m%sum;\r\nwhile(m>=i):\r\n m=m-i\r\n i+=1\r\n if(i>n):\r\n i=1\r\nprint(m)", "l = []\r\nsi,req=map(int,input().split())\r\nfor i in range(1,si+1):\r\n l.append(i)\r\nj = 0\r\ns = l[0]\r\nwhile( s <= req):\r\n req = req-s\r\n i = (i+1)%len(l)\r\n s = l[i]\r\nprint(req) \r\n \r\n \r\n ", "n,m=map(int,input().split())\r\ns=(n*(n+1))//2\r\nr=m%s\r\nc=0\r\ng=1\r\nwhile(c+g<=r):\r\n c+=g\r\n g+=1\r\nprint(r-c)\r\n", "x,t=map(int,input().split())\nk=0\nwhile True:\n for i in range(1,x+1):\n t-=i\n if(t<0):\n t+=i\n print(t)\n k+=1\n break\n if(k!=0): break\n\t\t \t \t\t\t \t\t \t \t \t\t \t \t\t \t\t", "import string\r\n[n,m] = list(map(int,input().split()))\r\nb = 0\r\nwhile n > 0:\r\n for i in range(n):\r\n if m >= (i + 1):\r\n m = m - (i + 1)\r\n else: b = 1\r\n if b == 1: break\r\n if b == 1: break\r\nprint(m)", "n,chips=list(map(int, input().split()))\r\nwalruses=[i for i in range(1, n+1)]\r\ncounter=0\r\nwhile walruses[counter]<=chips:\r\n chips-=walruses[counter]\r\n counter=(counter+1)%n\r\nprint(chips)", "# This is second problem \nwalruses,chips = input().split()\ncounter = 0\nwal = [0]*int(walruses)\npointer, remain, counter = 0, int(chips), 0\nfor i in range(1,int(walruses) + 1): \n counter = counter + 1\n wal[i-1] = counter\nif int(chips) > int(walruses): \n repeat = int(chips)//sum(wal)\n wal = wal*(repeat + 1) \nwhile True: \n if wal[pointer] < remain: \n remain = remain - wal[pointer]\n pointer = pointer + 1\n elif wal[pointer] == remain: \n remain = 0\n break\n else: \n break\nprint(remain)\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\n\r\nif m%(n*(n+1)//2)==0:\r\n print(\"0\")\r\nelse:\r\n m%=(n*(n+1)//2)\r\n for i in range(1,n+1):\r\n if m>=i:\r\n m-=i\r\n else:\r\n break\r\n print(m)", "n,c = map(int,input().split())\r\nrem = c%((n*(n+1))//2)\r\nif rem != 0:\r\n for i in range(1,n+1):\r\n if rem>i:\r\n rem -= i\r\n elif rem==i:\r\n rem = 0\r\n break\r\n else:\r\n break\r\nprint(rem)", "n,m=[int(v) for v in input().split()]\r\ns=n*(n+1)//2\r\nm%=s\r\nfor z in range(1,n+1):\r\n if (m-z)<0: break\r\n m-=z\r\nprint(m)", "n,m=map(int,input().split())\r\ns=sum(range(1,n+1))\r\nm%=s\r\nfor j in range(1,n+1):\r\n if (j>m):\r\n break\r\n else:\r\n m-=j \r\nprint(m)", "n, m = map(int, input().split())\n\narr = range(1, n+1)\nwhile True:\n for num in arr:\n if m >= num:\n m -= num\n else:\n print(m)\n break\n else:\n continue\n break\n", "import sys\nn, m = map(int, input().split())\nsum1 = 0\nfor i in range(1, n+1):\n sum1 = i + sum1\nwhile True:\n if m < sum1:\n for j in range(1, n+1):\n if j < m and j < n:\n m = m - j\n elif j == m:\n print(0)\n sys.exit(0)\n elif m < j and m != 0:\n print(m)\n sys.exit(0)\n elif m < j and m == 0:\n print(0)\n sys.exit(0)\n elif m == sum1:\n print(0)\n sys.exit(0)\n elif m > sum1:\n m = m - sum1\n\t \t \t\t\t\t\t\t \t \t \t \t\t \t\t \t", "import sys\n\nn, m = map(int, input().split())\ni = 1\nwhile m >= i:\n m -= i\n i = (i % n) + 1\nprint(m)\n", "r, s = map(int, input().split())\r\nk = 1\r\ntruth = True\r\nwhile truth == True:\r\n k=1\r\n while k <= r:\r\n if s-k < 0:\r\n truth = False\r\n break\r\n else:\r\n s-=k\r\n k+=1\r\nprint(s)\r\n", "n, s = map(int, input().split())\r\ns = s % ((n * (n + 1)) // 2)\r\nk = int(((1 + 8 * s) ** 0.5 - 1) / 2)\r\nprint(s - (k * (k + 1)) // 2)", "n,m=[int(x) for x in input().split(' ')]\nchips=(n*(n+1))//2\nrem=m%chips\nif rem:\n\tfor x in range(1,n+1):\n\t\tif rem>=x:\n\t\t\trem-=x\n\t\telse:\n\t\t\tbreak\nprint(rem)", "n, m = [int(i) for i in input().split()]\n\ndistribute_further = True\n\nwhile m >= 1 and distribute_further:\n\tfor i in range(1, n+1):\n\t\tif m >= i:\n\t\t\tm -= i\n\t\telse:\n\t\t\tdistribute_further = False\n\t\t\tbreak\n\nprint(m)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n if i + 1 > m:\r\n ans = m\r\n break\r\n m -= i + 1\r\n i += 1\r\n i %= n\r\nprint(ans)", "from math import floor\r\n\r\n\r\ndef array(arr, struc):\r\n return (list(map(struc, arr.split())))\r\n\r\n\r\ndef fullRound(x):\r\n return x * (x + 1) // 2\r\n\r\n\r\narr = array(input(), int)\r\n\r\nwalrus = arr[0]\r\nchips = arr[1]\r\n\r\nchips = chips % fullRound(walrus)\r\n\r\nlastWalrus = floor(-0.5 + ((8 * chips + 1)/4) ** 0.5)\r\n\r\nprint(chips - fullRound(lastWalrus))\r\n", "n, m = map(int, input().split())\r\n\r\ndef remaining_chips(n,m):\r\n i = 0\r\n while m > 0:\r\n i += 1\r\n if m >= i:\r\n m -= i\r\n if m == 0:\r\n return m\r\n else:\r\n return m\r\n if i == n:\r\n i = 0\r\n \r\nprint(remaining_chips(n, m))\r\n ", "# cook your dish here\r\nn,m = map(int, input().split())\r\nc = 1\r\nans = 0\r\nwhile True:\r\n while True:\r\n if m-c>=0:\r\n m = m - c\r\n c = c + 1\r\n else:\r\n print(m)\r\n ans = 1\r\n break\r\n if c>n:\r\n c = 1\r\n if ans==1:\r\n break", "import math\r\nn, k = map(int, input().split())\r\nbase1 = ((1 + n) * n) // 2\r\n\r\nif base1 > k:\r\n distant = (1 ** 2) - (4 * 1 * -(k * 2))\r\n ans = ((-1) + math.sqrt(distant)) // 2\r\n final = int(ans)\r\n base2 = ((1 + final) * final) // 2\r\n print(k - base2)\r\n\r\nif base1 < k:\r\n real = k // base1\r\n base2 = k - (base1 * real)\r\n distant = (1 ** 2) - (4 * 1 * - (base2 * 2))\r\n ans = ((-1) + math.sqrt(distant)) // 2\r\n final = int(ans)\r\n more = ((1 + final) * final) // 2\r\n print(k - (more + (base1 * real)))\r\n\r\nif base1 == k:\r\n print(0)\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-12 23:22:12\nLastEditTime: 2021-11-12 23:25:45\nDescription: Chips\nFilePath: CF92A.py\n'''\n\n\ndef func():\n n, m = map(int, input().strip().split())\n last = m % ((1 + n) * n // 2)\n for i in range(1, n + 1):\n if last < i:\n return last\n else:\n last -= i\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n ", "n, m = (int(x) for x in input().split())\r\ncur = 1\r\nwhile m >= cur:\r\n m -= cur\r\n cur += 1\r\n if cur == n + 1:\r\n cur = 1\r\nprint(m)", "n,m=input(\"\").split(\" \")\r\nn=int(n);m=int(m)\r\nm%=(n*(n+1)/2)\r\nfor i in range(1,n+1):\r\n if(m<i):\r\n break;\r\n m -= i\r\nprint(int(m))", "#92A\r\nn,m=map(int,input().split())\r\ni=1\r\np=m\r\nwhile True:\r\n flag=True\r\n for i in range(1,n+1):\r\n if p>=i:\r\n p-=i\r\n else:\r\n flag=False\r\n break\r\n if flag==False:\r\n break\r\nprint(p)\r\n", "def main():\n n, m = map(int, input().strip().split())\n m %= n * (n + 1) // 2\n for i in range(1, n + 1):\n if m >= i:\n m -= i\n else:\n return m\n\n\nprint(main())", "# (n, k) = list(map(int, input().split()))\r\n# s = list(map(int, input().split()))\r\n\r\n\r\n(n, m) = list(map(int, input().split()))\r\n\r\nsumm = (1 + n) * n // 2\r\nm %= summ\r\n\r\nfor i in range(1, n + 1):\r\n if i > m:\r\n break\r\n m -= i\r\nprint(m)", "n,m=[int(i) for i in input().split()]\r\ni = 0\r\nwhile m > i:\r\n\tm = m-i-1\r\n\ti = (i+1)%n\r\nprint(m)\r\n", "#A. Chips\r\nn,m = map(int,input().split())\r\nif m == n*(n+1)//2:\r\n print(0)\r\nelse:\r\n i = 1\r\n while m>=i:\r\n m -= i\r\n i += 1\r\n i%=(n+1)\r\n print(m)", "x,y = map(int,input().split())\r\nsum2 = 0\r\ni = 1\r\nwhile y - sum2 >= 0:\r\n\tif i == x+1:\r\n\t\ti = 1\r\n\tif y - sum2 < i:\r\n\t\tbreak\r\n\r\n\tsum2 = sum2 + i\r\n\ti = i + 1\r\nprint(y-sum2)", "def coinCount(n, m):\r\n m = m % (n * (n + 1) // 2)\r\n i = 1\r\n while m > 0:\r\n if m < i:\r\n return m\r\n m -= i\r\n i += 1\r\n return 0\r\n \r\nn, m = map(int, input().split())\r\nprint(coinCount(n, m))", "n,m=map(int,input().split())\r\ns=sum([i for i in range(1,n+1)])\r\nm=m%s\r\nfor i in range(1,n):\r\n if m>=i:\r\n m-=i\r\nprint(m)", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nfrom math import sqrt,ceil,floor\r\n\r\nn,m=map(int,input().split())\r\n\r\nt=(n*(n+1))//2\r\nres=m-t*(m//t)\r\n# print(res,m//t)\r\n# print(res)\r\n\r\nx=(int(sqrt(1+8*res)-1))//2\r\n# print(x)\r\nprint(res-((x*(x+1))//2))", "n, m = map(int, input().split())\nwalrus = n * (n + 1) / 2\nremainders = int(m - (m // walrus) * walrus)\nfor i in range(n + 1):\n\tif remainders - i >= 0:\n\t\tremainders = remainders - i\n\telse:\n\t\tprint(remainders)\n\t\tbreak\n", "n,m = map(int,input().split())\nk = 0\nwhile 1:\n t = 0\n for i in range(n):\n t = i+1\n m -= t\n if m>0:\n if m<=t and t<n:\n print(m)\n k=1\n break\n elif m<=t and t==n:\n pass\n elif m == 0:\n print(m)\n k=1\n break\n if k == 1:\n break\n \t \t \t\t\t\t \t \t \t\t \t\t \t", "def array(n,m):\r\n m%=(n * (n+1) // 2)\r\n for i in range(1,n+1):\r\n if (m < i):\r\n break\r\n m-=i\r\n print(m)\r\nn,m=map(int,input().split())\r\narray(n,m)", "n,m=map(int,input().split())\r\nm=m%(n*(n+1)//2)\r\nfor i in range(1,n+1):\r\n if m<i:\r\n break\r\n else:\r\n m-=i\r\nprint(m)", "n, m = map(int, input().split())\nt = 0\nwhile t < m:\n for i in range(1, n + 1):\n t += i\n if t == m:\n print(0)\n exit()\n elif t > m:\n print(m - t + i)\n exit()\n", "n,m=map(int,input().split())\r\ni=1\r\nwhile m>=i:\r\n\tm-=i\r\n\ti=(i%n)+1\r\nprint(m)", "n, m = map(int, input().split())\r\n\r\nl1 = []\r\nfor i in range(1, n+1):\r\n l1.append(i)\r\nn = len(l1)\r\ni = 0\r\nwhile(m >= l1[i]):\r\n m -= l1[i]\r\n i = (i+1) % n\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\nit_is_end = False\r\nwhile True:\r\n for i in range(1, n+1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n it_is_end = True\r\n break\r\n \r\n if it_is_end:\r\n break\r\nprint(m)", "n,m = map(int, input().split())\r\na = m%((n**2+n)//2)\r\nfor i in range(1,n+1):\r\n if i <= a:\r\n a-=i\r\n else:\r\n print(a)\r\n break\r\n", "import sys\n\ndef main():\n\n n, m = map(int, input().split())\n c = 0\n a = 1\n \n while True:\n if a > n:\n a = 1\n\n if c + a < m:\n c+=a\n elif c+a == m:\n return 0\n else:\n return m-c\n a+=1\n \nprint(main())", "n,m = map(int,input().split())\r\nx = 1\r\nwhile True:\r\n if m<x:\r\n break\r\n m-=x\r\n x+=1\r\n if x > n:\r\n x=1\r\nprint(m)", "n,m= map(int,input().split())\r\n\r\n#m = nombre chips\r\n#n = nombre animaux\r\n\r\nm = m%(n*(n+1)/2)\r\nfor i in range(n+1):\r\n if (m<i):\r\n break\r\n m-=i\r\nprint(int(m))\r\n", "n, m = map(int, input().split())\n\nallwalrus = n*(n+1)/2\n\nrem = int(m - (m//allwalrus)*allwalrus)\n\nfor i in range(n+1):\n if rem - i >= 0:\n rem = rem-i\n else:\n print(rem)\n break\n\n\t\t\t\t\t \t\t\t \t \t\t\t \t \t\t \t\t \t\t", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nn = a * (a + 1) // 2\r\nb -= b // n * n\r\nfor x in range(1, n + 1):\r\n if b < x:\r\n print(b)\r\n break\r\n else:\r\n b -= x", "n,p=map(int,input().split())\r\ni=1\r\nwhile(True):\r\n if(p<i or p==0):\r\n break\r\n p-=i\r\n i+=1\r\n if(i>n):\r\n i=1\r\nprint(p)\r\n", "n, m = map(int, input().split())\r\n\r\ncurr = 1\r\nwhile m >= curr:\r\n m -= curr\r\n \r\n if curr == n:\r\n curr = 0\r\n curr += 1\r\n\r\nprint(m)", "n,m=map(int,input().split())\nend = False\nwhile(end == False):\n for i in range(1,n+1):\n if(m-i < 0):\n print(m)\n end = True\n break\n else:\n m = m-i\n \t \t \t\t\t\t \t\t \t \t \t \t\t\t", "n,m=map(int,input().split())\r\nc=0\r\nwhile True :\r\n for i in range(1,n+1) :\r\n if m-i>=0 :\r\n m=m-i\r\n else :\r\n c=1\r\n break\r\n if c==1 :\r\n break\r\n \r\nprint(m)\r\n", "n,m = map(int,input().split())\r\nwhile(1):\r\n for i in range(1,n+1):\r\n if(m>=i):\r\n m-=i\r\n else:\r\n print(m)\r\n exit(0)", "n,m=map(int,input().split())\r\ni=0\r\nwhile m>i:m,i=m-i-1,(i+1)%n\r\nprint(m)", "n, m = map(int, input().split())\r\n\r\nm %= sum(range(1, n+1))\r\n\r\nfor i in range(n):\r\n if m < i:\r\n break\r\n m -= i \r\n\r\nprint(int(m))", "n,m=map(int,input().split())\r\nsumn=n*(n+1)//2\r\nif m>sumn:\r\n m%=sumn\r\nco=1\r\nwhile m>0:\r\n m-=co\r\n co+=1\r\n if m-co<0:\r\n break\r\nprint(m)", "def q92a():\n\tn, m = tuple([int(num) for num in input().split()])\n\tn_cycle = n * (n+1) // 2\n\tm = m % n_cycle\n\tfor i in range(n):\n\t\tif(m >= i):\n\t\t\tm -= i\n\t\telse:\n\t\t\tbreak\n\tprint(m)\n\nq92a()", "a,j = map(int,input().split());s=1\r\nwhile j>=s:\r\n j-=s\r\n s+=1\r\n if s==a+1: s=1\r\nprint(j)", "n, m = map(int, input().split())\r\ns_lap = (1 + n)*n // 2 \r\nm %= s_lap\r\n\r\ni = 1\r\nwhile m > 0:\r\n m -= i\r\n i += 1\r\n\r\nif m == 0:\r\n print(0)\r\nelse:\r\n m += i - 1\r\n print(m)\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\ni = 1\r\nwhile m - i >= 0:\r\n m = m - i\r\n i = i + 1\r\n if i > n:\r\n i = 1\r\n\r\nprint(m)", "n,m=map(int,input().split())\r\ncur=1\r\nwhile(True):\r\n if(m>=cur):\r\n m-=cur\r\n else:\r\n break\r\n cur+=1\r\n if(cur>n):cur-=n\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\nflag = True\r\nwhile flag:\r\n for walrus in range(1, n+1):\r\n if m - walrus >= 0:\r\n m -= walrus\r\n continue\r\n else:\r\n flag = False\r\n break\r\nprint(m)", "n, m = map(int, input().split())\n\nidx = 1\nsum = 0\n\nwhile True:\n if idx > n:\n idx = 1\n \n # print(sum, idx)\n \n if sum + idx == m:\n print(0)\n break\n elif sum + idx > m:\n print(m - sum)\n break\n\n sum += idx\n idx+=1\n\t \t\t \t\t\t \t \t \t \t \t\t\t\t", "\r\nn,m = map(int,input().split())\r\nsum = 0\r\nfor i in range(1,n+1):\r\n sum = sum + i\r\n\r\nif sum <= m:\r\n re = 0\r\n new = 0\r\n while re <= m:\r\n for i in range(1, n + 1):\r\n re = re + i\r\n if re == m:\r\n break\r\n elif re > m:\r\n new = i\r\n break\r\n\r\n result = re - new\r\n print(m - result)\r\n\r\nelse:\r\n count = 0\r\n a = 0\r\n for i in range(1,n+1):\r\n count = count + i\r\n if count <= m:\r\n continue\r\n else:\r\n a = i\r\n break\r\n total = count-a\r\n print(m-total)", "n, m=list(map(int, input().split()))\ns = (n + 1) * n/2\nm = m % s\nfor i in range(n):\n\tif m >= i:\n\t\tm -= i\n\telse:\n\t\tbreak\nprint(int(m))\n\t \t \t \t\t\t\t\t \t\t \t\t\t\t\t\t \t \t", "n, m = [int(x) for x in input().split()]\r\n\r\nm %= int(n*(n+1)/2)\r\nfor i in range(1,n):\r\n\tif m<i: break\r\n\tm -= i\r\nprint(m)", "#!/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\ndef test_case(case):\r\n n, m = inpints()\r\n\r\n s = (n * (n+1))//2\r\n\r\n m = m % s\r\n\r\n i = 1\r\n while m >= i:\r\n m = m - i\r\n i += 1\r\n return m\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b=map(int,input().split())\r\nb=b%((a*a+a)//2)\r\nfor i in range(a+1):\r\n b-=i\r\n if(b<i+1):\r\n print(b)\r\n exit()", "\r\nab= input().split()\r\na= int(ab[0])\r\nb= int(ab[1])\r\ntest=[]\r\nfor i in range(1,a+1):\r\n test.append(i)\r\n\r\nc= b//a\r\nc=c+1\r\ntest= test*c\r\nk=0\r\nwhile b-test[k]>=0:\r\n b=b-test[k]\r\n k=k+1\r\n\r\nprint(b)", "a = [int(i) for i in input().split()]\r\ns = a[1]\r\n\r\nt = True\r\n\r\nwhile t:\r\n for i in range(1, a[0] + 1):\r\n s -= i\r\n if s < 0:\r\n s += i\r\n t = False\r\n break\r\n\r\nprint(s)", "n,m = map(int,input().split())\nm %= (n * (n + 1) / 2)\ni=1\nif m<i:\n print(\"0\")\n\nelse:\n while(i<=n):\n #print(i)\n if m<i:\n break\n\n m = m-i\n i=i+1\n\n print(int(m))\n\n", "n,m=map(int,input().split(' '))\r\nc=n*(n+1)//2\r\nm%=c\r\nfor i in range(1,n+1):\r\n if(i*(i+1)//2 > m):\r\n m-=i*(i-1)//2\r\n print(m)\r\n break;", "n, m = map( int,input().split())\r\n\r\nT = 1\r\nwhile 1:\r\n for i in range(1, n+1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n T = 0\r\n print(m)\r\n break\r\n if T == 0:\r\n break", "n,m=[int(x) for x in input().split(\" \")]\r\nl=[i for i in range(1,n+1)]\r\na=0\r\nwhile m-l[a]>=0:\r\n m-=l[a]\r\n if a==n-1:\r\n a=0\r\n else: \r\n a+=1\r\nprint(m) \r\n \r\n \r\n ", "w,chips=input().split()\nrunning=True\nwhile running:\n for i in range(1,int(w)+1):\n if int(chips)>=i:\n chips=int(chips)-i\n else:\n running=False\n break\nprint(chips)\n \t\t\t\t\t \t\t \t\t \t\t \t \t \t\t \t", "n, m = map(int,\r\n input().split())\r\nc = n*(n+1)//2\r\nm%=c\r\nfor i in range(1,\r\n n+1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n break\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\nans = 0\r\nwhile m > 0:\r\n i = 1\r\n while m > 0 and i <= n:\r\n if m >= i:\r\n m -= i\r\n else:\r\n ans = m\r\n break\r\n i += 1\r\n if ans > 0:\r\n break\r\nprint(ans)\r\n ", "n,m=map(int,input().split())\r\nn1=1\r\nk=m\r\nwhile k>=n1 and k!=0:\r\n k=k-n1\r\n n1=n1+1\r\n if n1==n+1:\r\n n1=1\r\n\r\nprint(k)", "import math\r\ndef total(n):\r\n return (n*(n+1))//2\r\ndef root(m):\r\n return (-1 + math.sqrt(1 + 8*m))//2\r\n\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\nwhile(True):\r\n if(total(n) == m):\r\n print(0)\r\n break\r\n elif(total(n) > m):\r\n print(int(m - total(root(m))))\r\n break\r\n else:\r\n m = m - total(n)\r\n continue \r\n", "a, b = map(int, input().split())\r\nc = 0\r\nfor i in range(1, a+1):\r\n c += i\r\nd = b % c\r\nj = 1\r\nwhile d >= j:\r\n d -= j\r\n j += 1\r\nprint(d)", "i=1\nn,m=map(int,input().split())\nsum=(1+n)*n/2\nm=m%sum\nwhile i<=n:\n\n if m>=i:\n m=m-i\n i=i+1\nprint(int(m))\n\n\t \t\t\t \t\t\t \t \t \t \t \t \t\t\t", "[n, m] = map(lambda x: int(x), input().strip().split(maxsplit=2))\r\nans = 0\r\ni = 1\r\nwhile i < n + 1:\r\n r = m-i\r\n if r < 0:\r\n ans = m\r\n break\r\n elif r == 0:\r\n ans = r\r\n break\r\n m = m - i\r\n i += 1\r\n if i == n + 1 and m > 0:\r\n # print(\"reset\")\r\n i = 1\r\n\r\nprint(ans)", "# a,b = map(int,input().split())\r\n# alist = [i for i in range(1,a+1)]\r\n# c = sum(alist) % b\r\n# count = 0\r\n# while True:\r\n# c -= alist[count]\r\n# if c <= alist[count]+1:\r\n# break\r\n# count += 1\r\n# print(c)\r\n\r\nn, m = map(int, input().split())\r\n# m = m % sum(i for i in range(1, n + 1))\r\n\r\nalist = [i for i in range(1, n + 1)]\r\nm = m % sum(alist)\r\n\r\ni = 1\r\nwhile True:\r\n m -= i\r\n if m == 0:\r\n print(0)\r\n exit()\r\n elif m < 0:\r\n print(m + i)\r\n exit()\r\n i += 1", "a,b=map(int,input().split());k=0\r\nwhile(b>k):b=b-k-1;k=(k+1)%a\r\nprint(b)", "n,m = map(int,input().split())\r\n\r\nper = 1\r\nchips = m\r\nstop = False\r\n\r\nwhile stop == False:\r\n for i in range(1,n+1):\r\n if chips >= i:\r\n chips -= i\r\n else:\r\n stop = True\r\n \r\nprint(chips)", "n,m=map(int,input().split())\r\ns=(n*(n+1))//2\r\n# print(s)\r\nrem=m%s\r\n# print(rem)\r\nflag=0\r\ni=1\r\nwhile rem>0:\r\n\trem-=i\r\n\ti+=1\r\n\tif rem<i:\r\n\t\tprint(rem)\r\n\t\tflag=1\r\n\t\tbreak\r\nif rem==0 and flag==0:\r\n\tprint(0)", "n,m=map(int,input().split())\r\nsum=0\r\nfor i in range (1,n+1):sum+=i\r\nm=m%sum\r\nfor i in range (1,n+1):\r\n m-=i\r\n if m<0:\r\n m+=i\r\n break\r\nprint (m)", "# LUOGU_RID: 100544485\nn,m=map(int,input().split())\nk=0\ni=1\ns=0\nwhile k==0:\n i=i%(n+1)\n s+=i\n if s==m:\n print(0)\n break\n if m-s<(i+1)%(n+1):\n print(m-s)\n break\n i+=1", "n,m = map(int, input().split())\r\ncur = 1\r\nwhile m >= cur:\r\n m-= cur\r\n if cur == n: cur = 1\r\n else: cur+=1\r\nprint(m)", "\"\"\"\r\n4 11\r\n\r\n1 2 3 4 1\r\n\r\n3 8\r\n1 2 3 1\r\n\r\n\r\n\"\"\"\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(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, m = invr()\r\n\r\ni = 1\r\n\r\n# n = 4\r\n# m = 0\r\n# i = 2\r\n\r\nwhile(True):\r\n m = m - i # 0\r\n if m == 0:\r\n break\r\n if m < 0:\r\n m = m + i\r\n break\r\n if i == n:\r\n i = 1\r\n else:\r\n i += 1 # 1\r\n\r\nprint(m)", "n, m = map(int, input().split())\ncalculate = []\nfor i in range(1,n+1):\n calculate.append(i)\nlast = calculate[-1]\nindex_max = len(calculate)-1\nindex = 0\nwhile True:\n num = calculate[index]\n if m >= num:\n m -= num\n else:\n print(m)\n break\n if index == index_max:\n index = 0\n else:\n index += 1\n \t \t\t\t \t \t\t \t \t\t \t \t\t \t \t", "n,m=map(int,input().split())\r\nf=0\r\ni=1\r\nwhile(f!=1):\r\n if i<=m:\r\n m-=i\r\n else:\r\n f=1\r\n break\r\n if i==n:\r\n i=0\r\n i+=1\r\nprint(m)", "n,k=list(map(int,input().split()))\r\ni=0\r\nwhile k>=i+1:\r\n k-=i+1\r\n i=(i+1)%n\r\nprint(k)", "n, c = [int(x) for x in input().split()]\r\nwhile n*(n+1)/2 <= c:\r\n c -= n*(n+1)/2\r\nfor i in range(1+n):\r\n if c >= i:\r\n c -= i\r\nprint(int(c))", "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,m=read_ints()\n\tm%=((n+1)*n//2)\n\tfor i in range(n+1):\n\t\tif m<i:\n\t\t\tprint(m)\n\t\t\treturn\n\t\tm-=i\n\tprint(m)\n\nsolve()\n", "def calculate_remaining_chips(n, m):\r\n chips_given = 0\r\n walrus = 1\r\n\r\n while m >= walrus:\r\n chips_given += walrus\r\n m -= walrus\r\n walrus += 1\r\n if walrus > n:\r\n walrus = 1\r\n\r\n return m\r\n\r\n# Read the input values\r\nn, m = map(int, input().split())\r\n\r\n# Calculate the number of chips the presenter will end up with\r\nremaining_chips = calculate_remaining_chips(n, m)\r\n\r\n# Output the result\r\nprint(remaining_chips)\r\n", "n, m = map(int, input().split())\n\ni = 1\nres = 0\nwhile True:\n res += i\n i += 1\n \n if i == n+1: i = 1\n if i > (m-res): break\n\nprint(m-res)\n", "n,m = map(int, input().split())\r\n\r\nfullround = (n*(n+1))/2\r\nremainder = m % fullround\r\n\r\n# check if can give the chip\r\n# if can, then give\r\n# if cannot, then keep and stop giving\r\n\r\n# range(a): 0,1,2,3,4, ..., a-1\r\n# range(a,b): a,a+1,a+2, ..., b-1\r\n# range(a,b,c): a, a+c, a+2c, a+3c, .... ,a+nc < b\r\n\r\nfor i in range(1,n+1): # i is all the possible values in range\r\n if(remainder >= i):\r\n remainder = remainder - i\r\n else:\r\n break\r\n\r\nprint(int(remainder))", "a,b = (input().split())\na = int (a)\nb = int (b)\ni = 1\n\nwhile(b!=0):\n if(i<=b):\n b = b -i\n else:\n break\n \n if(i == a):\n i = 1\n else:\n i +=1\n\nprint (b)\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\nwalrus = [i for i in range(1,n+1)]\r\ni = 0\r\nwhile m - walrus[i] >= 0:\r\n m -= walrus[i]\r\n i += 1\r\n if i == n:\r\n i = 0\r\nprint(m)", "a,b = map(int, input().split())\r\nflag = True\r\nwhile True:\r\n for item in range(1, a+1):\r\n if b >= item:\r\n b -= item\r\n\r\n else:\r\n flag = False\r\n break\r\n \r\n \r\n if not flag:\r\n break\r\n \r\n \r\nprint(b)\r\n\r\n\r\n \r\n", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\ndef ans(n,m):\r\n lst = [i for i in range(1,n+1)]\r\n\r\n tot,ind = 0,-1\r\n val = 0\r\n while tot + val <= m:\r\n tot += val\r\n ind += 1\r\n ind = ind % n\r\n val = lst[ind]\r\n print(m - tot)\r\n\r\n\r\n\r\n\r\nn,m = get_int()\r\nans(n,m)\r\n", "n,m = map(int, input().split())\r\ni = 1\r\nwhile i <= n:\r\n m -= i\r\n if i == n:\r\n i = 1\r\n else:\r\n i += 1\r\n if m < i:\r\n print(m)\r\n break\r\n else:\r\n pass\r\n", "n , m = map(int,input().split())\r\nflag = 0\r\nwhile 1:\r\n\tfor i in range(1,n+1):\r\n\t\tif m<i:\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tm -= i\t\r\n\tif flag==1:\r\n\t\tbreak\t\t\r\nprint(m)\t\t", "n, m = [int(i) for i in input().split()]\r\nwhile True:\r\n for i in range(1, n+1):\r\n if m - i >= 0:\r\n m -= i\r\n else:\r\n print(m)\r\n exit(0)\r\n", "n,m=map(int,input().split())\r\ni=0\r\nwhile (i%n)+1<=m and m>0:\r\n\tm=m-(i%n)-1\t\t\r\n\ti=i+1\r\nprint(m)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nwhile True:\r\n chk = True\r\n for i in range(1, n + 1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n chk = False\r\n break\r\n if not chk:\r\n break\r\n\r\nprint(m)", "n,k=map(int,input().split())\r\ns=0\r\nl=[]\r\nfor i in range(1,n+2):\r\n l.append(s)\r\n s+=i\r\nk=k%l[-1]\r\nfor i in range(n+1):\r\n if l[i+1]>k:\r\n print(k-l[i])\r\n break", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nm = int(string[1])\r\n\r\nfor i in range(m):\r\n if m - (i%n+1) < 0:\r\n break\r\n m -= (i%n+1) \r\n\r\nprint(m)", "n, m = map(int, input().split())\ni = 1\nwhile m >= i:\n m -= i\n i += 1\n if i > n:\n i = 1\n # print(m, i)\nprint(m)", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\ndef count_chips(n: int, m: int) -> int:\r\n temp = n * (n + 1) // 2\r\n m %= temp\r\n\r\n for i in range(1, n + 1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n return m\r\n\r\ndef main() -> int:\r\n (n, m) = map(int, input().split())\r\n print(count_chips(n, m))\r\n\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "def func(n,m):\r\n while True:\r\n if m==0:\r\n break\r\n for i in range(1,n+1):\r\n if i<=m:\r\n m-=i\r\n else:\r\n return m\r\n return m\r\n\r\nn,m=map(int,input().split())\r\nm=func(n,m)\r\nprint(m)", "i=0\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nwhile i<=m:\r\n m=m-i\r\n i+=1\r\n if i>n:\r\n i=0\r\nprint(m)\r\n", "if __name__ == '__main__':\n numbers = input()\n n, m, i = int(numbers.split(' ')[0]), int(numbers.split(' ')[1]), 1\n \n while(i <= n and m >= i):\n m -= i\n i += 1\n if i > n:\n i = 1\n\n print(m)", "n,chips=map(int ,input().split())\r\ndemand=int((n*(n+1))/2)\r\nif(demand==chips):\r\n print(0)\r\nelif(demand>chips):\r\n for i in range(n):\r\n z1=int((i*(i+1))/2) \r\n z2=int(((i+1)*(i+2))/2)\r\n if(z1<=chips<z2):\r\n print(abs(z1-chips))\r\nelse:\r\n t=(chips-demand)\r\n if(t%demand==0):\r\n print(0)\r\n elif(t%demand!=0):\r\n p=int(t%demand) \r\n for i in range(n):\r\n z1=int((i*(i+1))/2) \r\n z2=int(((i+1)*(i+2))/2)\r\n if(z1<=p<z2):\r\n print(abs(z1-p))\r\n ", "n, m = map(int, input().split())\r\ncnt = 0\r\nwhile 0 < m:\r\n cnt += 1\r\n if cnt == n + 1:\r\n cnt = 1\r\n m -= cnt\r\nif m < 0:\r\n m += cnt\r\nprint(m)\r\n", "m, n = list(map(int, input().split()))\r\n\r\nf = True\r\nwhile f:\r\n for i in range(1, m+1):\r\n if i <= n:\r\n n -= i\r\n else:\r\n f = False\r\n break\r\nprint(n)\r\n", "def chips(n,m):\r\n remain = m \r\n walrus = n\r\n while remain >= 1 and walrus == n:\r\n for chips in range(1,n+1):\r\n if remain - chips >= 0:\r\n walrus = chips\r\n remain -= chips\r\n \r\n \r\n return remain\r\n \r\n \r\nn = str(input())\r\nx = n.split()\r\nprint(chips(int(x[0]),int(x[1])))", "inputs = tuple(map(lambda x: int(x), input().split()))\nn = inputs[0]\nm = inputs[1]\n\nif n == 0:\n print(m)\nelse:\n summery = (1 + n) * n / 2\n last = m % summery\n\n i = 1\n while last >= 0:\n last -= i\n i += 1\n\n last = int(last + i -1)\n\n print(last)\n\t\t\t\t\t \t\t \t\t\t \t\t \t \t\t \t\t \t \t", "n,m = map(int,input().split())\r\ns = (n * (n+1))//2\r\nans = m % (s)\r\nfor i in range(1,n+1):\r\n if ans < i:\r\n break\r\n if i <= ans:\r\n ans -= i\r\nprint(ans)", "n, m = map(int, input().split())\r\n# n(n+1)//2 \r\nm %= (n*(n+1)//2)\r\nfor i in range(1, n+1):\r\n if m < i:\r\n break\r\n m -= i\r\nprint(m)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jun 8 20:01:22 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\nc = m\r\nz = True\r\nt = True\r\nwhile z == True:\r\n for i in range(1, n + 1):\r\n if c >= i:\r\n c -= i\r\n else:\r\n t = False\r\n if t == False:\r\n z = False\r\nprint(c)", "n, m = map(int, input().split())\nwhile True:\n for i in range(1, n+1):\n if i > m:\n print(m)\n exit()\n else:\n m -= i\n", "i=1\r\nn,m=map(int,input().split())\r\nwhile m>=i:\r\n m-=i\r\n if i==n:\r\n i=1\r\n else:\r\n i+=1\r\nprint(m)", "def fishki(n, m):\r\n count = 1\r\n while m > 0:\r\n if m - count < 0:\r\n break\r\n m -= count\r\n count += 1\r\n if count > n:\r\n count = 1\r\n return m\r\n\r\n\r\nN, M = [int(i) for i in input().split()]\r\nprint(fishki(N, M))\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\ns=n*(n+1)\r\ns=int(s)/2\r\nx=int(m%s)\r\nif x==0:\r\n print(0)\r\nelif x<=55:\r\n for i in range(1,11):\r\n y=i\r\n if x>=y:\r\n x-=y\r\n elif x<y:\r\n print(x)\r\n break;\r\nelif x<=210:\r\n x-=55\r\n for i in range(11,21):\r\n y=i\r\n if x>=y:\r\n x-=y\r\n elif x<y:\r\n print(x)\r\n break;\r\nelif x<=465:\r\n x-=210\r\n for i in range(21,31):\r\n y=i\r\n if x>=y:\r\n x-=y\r\n elif x<y:\r\n print(x)\r\n break;\r\nelif x<=820:\r\n x-=465\r\n for i in range(31,41):\r\n y=i\r\n if x>=y:\r\n x-=y\r\n elif x<y:\r\n print(x)\r\n break;\r\nelif x<=1275:\r\n x-=820\r\n for i in range(41,51):\r\n y=i\r\n if x>=y:\r\n x-=y\r\n elif x<y:\r\n print(x)\r\n break;", "n,m=map(int,input().split())\r\nk=[i for i in range(1,n+1)]\r\ni=0\r\nwhile m>=k[i]:\r\n\tm-=k[i]\r\n\ti+=1\r\n\tif i==n:\r\n\t\ti=0\r\nprint(m)\r\n", "n,m=list(map(int,input().split()))\r\nx=n*(n+1)//2\r\nremainder=m%x\r\nsolutionOfRemainder=((8*remainder+1)**.5-1)//2\r\ny=solutionOfRemainder*(solutionOfRemainder+1)//2\r\nans=remainder-y\r\nprint(int(ans))\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, m = map(int, input().split())\r\na = 1\r\nwhile 1:\r\n\tif a == n + 1:\r\n\t\ta = 1\r\n\tif m - a < 0:\r\n\t\tbreak\r\n\tm -= a\r\n\ta += 1\r\nprint(m)\r\n", "def equ(c):\r\n x1=((-1+(1*1-4*c)**(0.5))/2)\r\n x2=((-1+(1*1-4*c)**(0.5))/2)\r\n if x1>0:\r\n return x1\r\n elif x2>0:\r\n return x2\r\nn,m=map(int,input().split())\r\nk=n*(n+1)/2\r\nm=m%k\r\nif m==0:\r\n print(\"0\")\r\nelse:\r\n q=-(m*2)\r\n p=(int(equ(q)))\r\n m=m-(p*(p+1))/2\r\n print(int(m))\r\n\r\n", "from itertools import cycle\n\nn, m = list(map(int, input().split()))\ncircle = cycle([i for i in range(1, n + 1)])\n\nfor i in circle:\n if i > m:\n break\n \n m -= i\n\nprint(m)\n\t \t\t \t\t\t\t \t\t\t \t \t", "n,m=map(int,input().split())\r\ni=1\r\nwhile(m>=i):\r\n m=m-i\r\n i=i%n+1\r\nprint(m)\r\n ", "import math\r\na, b = list(map(int, input().split()))\r\nb -= (2*b // (a * (a + 1))) * (a * (a + 1)) // 2\r\nx = (-1 + math.sqrt(1 + 4*2*b)) // 2\r\nprint(int(b - (x*(x + 1)) // 2))", "import math\r\nn , m = [int(x) for x in input().split()]\r\ns = (n * (n + 1))//2\r\nm = m % s\r\nx = int(math.sqrt(1 + 8 * m) - 1)\r\nx = x // 2\r\nans = m - (x * (x + 1))//2 \r\nprint(ans)", "n,m=map(int,input().split())\r\na=1\r\nwhile True:\r\n if m<a:\r\n break\r\n m-=a\r\n if a==n:\r\n a=1\r\n else:\r\n a+=1\r\nprint(m)", "\"\"\"\ninstagram : essipoortahmasb2018\ntelegram channel : essi_python\n\n\"\"\"\nn,m = map(int,input().split())\n# zigma n(n+1)/2\ns = n*(n+1)//2\nm%=s\nfor i in range(1,n+1):\n if m>=i:\n m-=i\n else:\n break\nprint(m) \n\n\n\n\n\n\n\n", "n,m=map(int,input().split())\r\n\r\ns=(n*(n+1))//2\r\nm%=s\r\n\r\ncur=1\r\n\r\nwhile m>=cur:\r\n m-=cur\r\n cur+=1\r\n\r\nprint(m)", "n, m = map(int, input().split())\r\nlst = [x for x in range(1, n+1)]\r\nk = 0\r\n\r\nwhile m - lst[k] >= 0:\r\n m -= lst[k]\r\n k += 1\r\n if k == len(lst):\r\n k = 0\r\nprint(m)\r\n", "n,m=list(map(int,input().split()))\r\nm%=(n*(n+1)/2)\r\nfor i in range(1,n+1):\r\n if m<i:\r\n break\r\n m=m-i\r\nprint(int(m))", "n, m=map(int, input().split())\r\ni=1\r\nwhile m:\r\n\tm-=i\r\n\tif i==n:\r\n\t\ti=0\r\n\telse:\r\n\t\ti+=1\r\n\tif i>m:\r\n\t\tbreak\r\nprint(m)", "n,m=map(int,input().split())\ni=0\nwhile m>i:m,i=m-i-1,(i+1)%n\nprint(m)\n \t \t\t \t\t\t \t \t\t \t \t \t \t", "a,b=map(int,input().split())\r\ns=(a)*(a+1)//2\r\nk=b%s\r\np=0\r\ni=0\r\nwhile (p+i)<=k :\r\n p+=i\r\n i+=1\r\nprint(k-p)\r\n", "a,b = map(int,input().split())\r\nn = a*(a+1)//2\r\nnn = b%n\r\ni = 0\r\nwhile nn>=i:\r\n nn-=i\r\n i+=1\r\nprint(nn)\r\n", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\nn, m = get_ints()\r\ni = 1\r\nwhile m >= i:\r\n m -= i\r\n i += 1\r\n if i > n:\r\n i = 1\r\nprint(m)", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int,wtf[0].split())\r\n A = [x for x in range(1,n+1)]\r\n As = sum(A)\r\n while m > As:\r\n m -= As\r\n for a in A:\r\n if m >= a:\r\n m-=a\r\n print(m)\r\n", "l=list(map(int,input().split()))\r\ni=1\r\nwhile l[1]>0:\r\n l[1]=l[1]-i\r\n \"print(i,l[1])\"\r\n if i==l[0]:\r\n i=0\r\n i=i+1\r\n'print(i,l[1])'\r\np=l[1]\r\nif p>=0:\r\n print(p)\r\nelif i==1:\r\n print(p+l[0])\r\nelse:\r\n print(p+i-1)", "n,m=map(int,input().split())\r\ni=1\r\nwhile i<=m:\r\n\tm-=i\r\n\ti+=1\r\n\tif i==n and m>=n:\r\n\t\ti=1\r\n\t\tif m>=n:\r\n\t\t\tm-=n\r\n\tif m==0:\r\n\t\tbreak\r\nif n==1:\r\n\tm=0\r\nprint(m)", "n, m = map(int, input().split())\r\n\r\ni = 1\r\nwhile m >= i:\r\n m -= i\r\n i = (i % n) + 1\r\n\r\nprint(m)\r\n", "a, b = map(int, input().split())\ns = (a * (a + 1)) // 2\nn = b // s\nb = b - n * s\nx = 1\nss = 0\nk = 0\nfor i in range(1, b + 1):\n ss += x\n if ss > b:\n break\n k = ss\n x += 1\nprint(b - k)\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\nbreaks = False\r\nwhile True:\r\n if breaks == True:\r\n break\r\n for x in range(1, n + 1):\r\n if m >= x:\r\n m -= x\r\n if m == 0:\r\n print(0)\r\n breaks = True\r\n break\r\n elif m < x:\r\n print(m)\r\n breaks = True\r\n break\r\n \r\n", "n,m=map(int,input().split());i=0\r\nwhile 1:\r\n if m<=i:exit(print(m))\r\n i+=1;m-=i;i%=n", "def main():\r\n n, m = map(int, input().split())\r\n valruses = [i for i in range(1, n + 1)]\r\n\r\n start = 0\r\n while True:\r\n if start == n:\r\n start = 0\r\n\r\n if m - valruses[start] >= 0:\r\n m -= valruses[start]\r\n else:\r\n print(m)\r\n exit()\r\n start += 1\r\n\r\n\r\nmain()", "n,m=map(int,input().split())\r\nflag=0\r\ni=1\r\nwhile i<=n:\r\n if m>=i:\r\n m=m-i\r\n else:\r\n break\r\n if i==n:\r\n i=1\r\n else:\r\n i=i+1\r\nprint(m)", "n,m= map(int,input().split())\r\nc=m\r\ni=0\r\nwhile i<c:\r\n\tc = c - i - 1\r\n\ti = (i+1)%n\r\n\r\n\t\r\nprint(c)", "info = input().split()\r\n\r\nwalrusnum = int(info[0])\r\nchipnum = int(info[1])\r\ndone = False\r\n\r\nwhile not done:\r\n for i in range(walrusnum):\r\n if chipnum < 0 or chipnum -(i + 1) < 0:\r\n done = True\r\n break\r\n chipnum -= i + 1\r\n\r\n\r\nprint(chipnum)\r\n", "n,m=map(int,input().split())\r\ni=1\r\nwhile i<=n:\r\n if m<i:\r\n break\r\n else:\r\n m=m-i\r\n i=i+1\r\n if i==n+1 and m>=1:\r\n i=1\r\nprint(m)", "a, b = map(int, input().split())\r\na += 1\r\ni = 1\r\nwhile b >= i:\r\n b -= i\r\n i = (i + 1) % a\r\nprint(b)\r\n", "import math\r\nn,m=map(int,input().split())\r\n\r\ni=1\r\ntmp=m\r\nsu=0\r\nwhile(tmp>=i):\r\n\tsu+=i\r\n\ttmp=tmp-i\r\n\ti+=1\r\n\tif(i==n+1):\r\n\t\ti=1\r\nprint(tmp)\r\n\r\n", "l = [int(i) for i in input().split()]\r\nn = l[0]\r\nc = l[1]\r\nk = 0\r\n# print(c)\r\n# print((k%n)+ 1)\r\nwhile c >= ((k%n)+ 1):\r\n\r\n\r\n c = c - (k % n) - 1\r\n # print(c)\r\n\r\n k += 1\r\nprint(c)", "n,m=map(int,input().split())\r\np=1\r\nwhile m>0:\r\n\tif p>n:\r\n\t\tp=1\r\n\tif m-p>=0:\r\n\t\tm-=p\r\n\telse:\r\n\t\tbreak\r\n\tp+=1\r\nprint(m)\r\n\t", "a,b = map(int,input().split())\r\nz = b %int(a*(a+1)/2)\r\nfor i in range(1,a+1):\r\n\tif z-i>=0:\r\n\t\tz = z-i\r\n\telse:\r\n\t\tprint(z)\r\n\t\tbreak", "n,m=map(int,input().split())\r\n\r\nx=(n*(n+1))//2\r\n\r\ny=m%x\r\n\r\nfor i in range(1,n+1):\r\n y-=i\r\n \r\n if y<0:\r\n print(i+y)\r\n break\r\n elif y==0:\r\n print(0)\r\n break\r\n else:\r\n continue\r\n", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\na = n*(n+1)//2\r\nb = m%a\r\nfor i in range(1, n+1):\r\n if b >= i:\r\n b -= i\r\n else:\r\n break\r\nprint(b)\r\n", "n, m = map(int, input().split())\r\na = [0] * (n + 1)\r\ns = 0\r\nfor i in range(n + 1):\r\n s = s + i\r\n a[i] = s\r\nt = m % a[-1]\r\nfor i in range(n + 1):\r\n if a[i] >= t:\r\n if a[i] == t:\r\n otv = 0\r\n else:\r\n otv = t - a[i-1]\r\n break\r\nprint(otv)\r\n\r\n ", "def t(n):\r\n return (n*(n+1))//2\r\nn,m = list(map(int,input().split()))\r\nr = m % t(n)\r\nk = int(((1+8*r)**(1/2) - 1)/2)\r\nprint(r - t(k))", "n,m = map(int,input().split())\r\nnum = m%((n*(n+1))//2)\r\nfor i in range(1,n+1):\r\n num -= i\r\n if num==0:\r\n print(0)\r\n break\r\n elif num<0:\r\n num += i\r\n print(num)\r\n break", "ns=input().split()\r\nn=int(ns[0])\r\ns=int(ns[1])\r\nx=1\r\nwhile s>=0:\r\n if x!=n:\r\n s=s-x\r\n x=x+1\r\n elif x==n:\r\n s=s-x\r\n x=1\r\nif x==1:\r\n print(n+s)\r\nelse:\r\n print(x-1+s)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef 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 Chips():\r\n n,m = invr()\r\n\r\n chipsForOneRound = (n*(n+1))//2\r\n numRounds = m//chipsForOneRound\r\n chipsForLastRound = m - (chipsForOneRound*numRounds)\r\n\r\n for walrusIndex in range(1,n+1):\r\n if walrusIndex > chipsForLastRound:\r\n break \r\n else:\r\n chipsForLastRound -= walrusIndex\r\n \r\n print(chipsForLastRound)\r\n return\r\n\r\n\r\nChips() ", "n,m=map(int,input().split())\r\ns=0\r\ni=1\r\nwhile(s<m):\r\n if(i<=n):\r\n s+=i\r\n i+=1\r\n else:\r\n i=1\r\nif(s>m):\r\n print(m-s+i-1)\r\nelse:\r\n print(m-s)", "def process():\r\n n, m = list(map(int, input().split()))\r\n \r\n n_sum = n * (n + 1) // 2\r\n m %= n_sum\r\n \r\n for i in range(1, n + 1):\r\n if m < i:\r\n print(m)\r\n return\r\n m -= i\r\n \r\nprocess()", "n=list(map(int,input().split()))\r\ns=0\r\nwhile(True):\r\n for i in range(1,n[0]+1):\r\n if(i<=n[1]):\r\n n[1]=n[1]-i\r\n else:\r\n print(n[1])\r\n s=s+1\r\n break\r\n if(s==1):\r\n break\r\n", "n, m = map(int, input().split())\npos = 1\nwhile m >= pos:\n m -= pos\n pos += 1\n if pos > n:\n pos = 1\nprint(m)\n", "from math import ceil\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n flag = True\r\n while flag:\r\n for i in range(1, n + 1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n flag = False\r\n break\r\n print(m)\r\n\r\n\r\nfor _ in range(1):\r\n solve()", "# for testCase in range(6):\nn ,m = map(int ,input().split())\nm %= (n*(n+1)//2)\nfor i in range(n):\n if i > m:\n break;\n m -= i\nprint(m)\n", "def preprocessing():\n n = 50\n chips = [0] * (n + 1)\n\n for i in range(n + 1):\n chips[i] = i * (i + 1) // 2\n\n return chips\n\n\ndef main():\n full_round_chips = [0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105, 120, 136, 153, 171, 190, 210, 231, 253,\n 276, 300, 325, 351, 378, 406, 435, 465, 496, 528, 561, 595, 630, 666, 703, 741, 780, 820, 861,\n 903, 946, 990, 1035, 1081, 1128, 1176, 1225, 1275]\n [n, m] = [int(_) for _ in input().split()]\n m %= full_round_chips[n]\n i = next(index for index in range(len(full_round_chips)) if full_round_chips[index] > m)\n print(m - full_round_chips[i - 1])\n\n\nif __name__ == '__main__':\n main()\n", "n,c=map(int,input().split())\r\ni=0\r\nwhile c>i:c,i=c-i-1,(i+1)%n\r\nprint(c)", "a,b=list(map(int,input().split()))\r\nc=int((a*(a+1))/2)\r\nd=int(b%c)\r\ne=1\r\nwhile d>=e:\r\n d-=e\r\n e+=1\r\n\r\nprint(d)\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nx=m\r\nc=0\r\nwhile(x>0):\r\n for i in range(1,n+1):\r\n x=x-i\r\n if(x<i+1 and i!=n):\r\n print(x)\r\n c=1\r\n break\r\n elif(i==n and x==0):\r\n print(0)\r\n c=1\r\n break\r\n if(c==1):\r\n break\r\n", "n,m=map(int,input().split(' '))\r\nwhile True:\r\n for i in range(1,n+1):\r\n if(i > m):\r\n print(m)\r\n exit();\r\n m-=i", "\r\nn,m=map(int,input().split())\r\nt=n*(n+1)/2\r\nm=int(m%t)\r\nif m>0:\r\n for i in range(1,n+1):\r\n if(m>=i):\r\n m-=i\r\n else:\r\n break\r\nprint(m)\r\n \r\n \r\n \r\n", "a,b=map(int,input().split())\r\nx=0\r\nwhile(1):\r\n i=1\r\n while(i<=a):\r\n if b==0 or b-i<0:\r\n x=1\r\n break\r\n else:\r\n b=b-i\r\n i=i+1\r\n if x==1:\r\n break\r\nprint(b) ", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\nn,m=map(int,input().split())\r\ne=(n*(n+1))//2\r\nm%=e\r\nfor i in range(1,n+1):\r\n if i<=m:m-=i\r\n else:\r\n print(m)\r\n break\r\nelse:print(0)\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "w, chips = map(int,input().split())\r\n\r\npos = 1\r\nwhile (chips - (pos%w,w)[not pos%w] ) >= 0:\r\n chips -= (pos%w,w)[not pos%w]\r\n pos += 1\r\nprint (chips)", "a=list(map(int,input().split()))\r\na[1]%=sum(range(a[0]+1))\r\nfor i in range(a[0]):\r\n if a[1]>=i:a[1]-=i\r\n else:break\r\nprint(a[1])\r\n", "n,m = map(int,input().split())\na = 1\nwhile m > 0:\n for i in range(1,n + 1):\n if m > i:\n m = m - i\n elif m == i:\n m = m - i\n print(m)\n a = 0\n break\n else:\n print(m)\n a = 0\n break\n if a == 0:\n break\n \t\t \t \t\t\t\t\t \t\t\t\t \t\t\t\t", "import math\r\n\r\nn, m = [int(s) for s in input().split(\" \")]\r\ntot = (n*(n+1))//2\r\ncur = m%tot\r\nfor i in range(1, n+1):\r\n if i>cur:\r\n break\r\n cur -= i\r\nprint(cur)\r\n", "def I(): return map(int, input().split())\r\n\r\n\r\nn, m = I()\r\nm = m % ((n*(n+1))//2)\r\n# for i in range(n):\r\n# if m >= i+1:\r\n# m -= i+1\r\n# else:\r\n# break\r\ni = 0\r\nwhile m >= i+1:\r\n i += 1\r\n m -= i\r\nprint(m)\r\n", "n,m=map(int,input().split())\r\ni=1\r\nwhile m>0:\r\n if i==n+1:\r\n i=1\r\n if m-i>=0:\r\n m-=i\r\n i+=1\r\n else:\r\n break\r\nprint(m)\r\n \r\n \r\n", "def chips(n,m):\r\n while(m>0):\r\n for i in range(1,n+1):\r\n if(m>=i):\r\n m=m-i\r\n else:\r\n return(m)\r\n return(m)\r\n\r\nn,m=list(map(int,input().split()))\r\nresult=chips(n,m)\r\nprint(result)", "a,b=map(int,input().split())\r\nx=int(1)\r\nwhile b>=x:\r\n b=b-x\r\n x=x+1\r\n if x==a+1:\r\n x=1\r\nprint(b)", "m,l = map(int, input().split())\r\n\r\ni = 1\r\nwhile((l-i)>=0):\r\n if i<m:\r\n l = l- i\r\n i+=1\r\n\r\n elif i==m:\r\n l = l- i\r\n \r\n i = 1\r\n # print(i)\r\nprint(l)", "n,m=map(int,input().split())\r\ni=1\r\nwhile m>=i:\r\n m-=i\r\n if i>=n:\r\n i=0\r\n i+=1\r\nprint(m)", "k, q = map(int, input().split())\r\nS = k*(k+1)//2\r\ncycles = q//S\r\nrem = q - cycles*S\r\ni = 1\r\nwhile rem >= i:\r\n rem -= i\r\n i += 1\r\nprint(rem)", "n , m = map(int,input().split())\r\nai = list(range(1,n+1))\r\nnum = sum(ai)\r\nnum = m % num\r\nfor i in range(n):\r\n if num < ai[i]:\r\n break\r\n num -= ai[i]\r\nprint(num)\r\n", "n, m = [int(x) for x in input().split()]\r\nleft = m % (int((n * (n + 1)) / 2))\r\ns = 0\r\ni = 1\r\nwhile s + i <= left:\r\n s += i\r\n i += 1\r\nprint(left - s)", "data=(input()).split()\nn=int(data[0])\nm=int(data[1])\nc=1\nw=[0]*n\nfor i in range(n):\n w[i]=c\n c=c+1\nv=1\nwhile m>0 and v==1:\n for i in range(n):\n if m>=w[i] and v==1:\n m=m-w[i]\n else:\n v=0\nprint (m)\n\n\n\t \t\t \t\t \t\t\t\t\t \t\t \t \t\t \t\t \t\t\t", "n, m = map(int, input().split())\r\nm %= (n * (n + 1) // 2)\r\ni = 1\r\nwhile m >= i:\r\n m -= i\r\n i += 1\r\nprint(m)\r\n", "n,m=map(int,input().split())\r\nrem=m\r\ncount=1\r\nwhile(rem>=count):\r\n rem=rem-count\r\n count=count+1\r\n if(count==n+1):\r\n count=1\r\nprint(rem)\r\n\r\n", "n,m=map(int,input().split())\r\ncount=0\r\ni=1\r\nwhile count!=1:\r\n if i>n:\r\n i=1\r\n if m<i:\r\n print(m)\r\n count=1\r\n break\r\n else:\r\n m=m-i\r\n i+=1\r\n", "n, m = map(int, input().split())\r\nm %= (n+1)*n//2\r\nstart = 1\r\nwhile m - start >= 0:\r\n m -= start\r\n start += 1\r\nprint(m)", "b=list(map(int,input().split()))\r\ni=1\r\nt=0\r\nwhile t<=b[1] :\r\n\tif i>b[0]:\r\n\t\ti=1\r\n\tif (t+i)>b[1]:\r\n\t\tbreak\r\n\tt=t+i\r\n\ti=i+1\r\n\r\nprint(b[1]-t)", "n,k=list(map(int,input().split()))\r\ni=0\r\nwhile k>=i+1:\r\n k-=i+1\r\n #print(\"chips remaining\",k)\r\n i=(i+1)%n\r\n #print(\"i is\",i)\r\nprint(k)", "import sys\r\n\r\ndef main():\r\n n, m = map(int, sys.stdin.read().strip().split())\r\n m %= (1 + n)*n//2\r\n for i in range(1, n+1):\r\n m -= i\r\n if not m: return 0\r\n elif m < 0: return m + i\r\n\r\nprint(main())\r\n", "n, m = [int(i) for i in input().split()]\r\nm %= n * (n + 1) // 2\r\ni = 1\r\nwhile m - i >= 0:\r\n m -= i\r\n i += 1\r\nprint(m)", "[n, m] = list(map(int, input().split(\" \")))\n\ni = 1\nwhile (i <= m):\n m -= i \n if (i == n): i = 0\n i += 1\n\nprint(m)\n", "n,m=list(map(int,input().split()))\r\ni=0\r\nwhile(m>i):\r\n m=m-i-1\r\n i=(i+1)%n\r\nprint(m)", "a,b=map(int,input().split())\nc=1\nwhile b>0:\n\tif b-c>=0:\n\t\tb-=c\n\telse:\n\t\tbreak\n\tc+=1\n\tif c==a+1:\n\t\tc=1\nprint(b)\n", "input1 = input().split()\r\nn =int(input1[0])\r\nm = int(input1[1])\r\n\r\nend = False\r\nwhile True:\r\n\tfor i in range(0,n):\r\n\t\tamount = (i+1)\r\n\t\tif m<amount:\r\n\t\t\tend =True\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tm -= amount\r\n\r\n\tif end==True:\r\n\t\tbreak\r\nprint(m) ", "n,m=[int(x) for x in input().split()]\r\nif m>n*(n+1)//2:\r\n m=m%(n*(n+1)//2)\r\ni=1 \r\nwhile m>0:\r\n if m-i>=0:\r\n m-=i \r\n i+=1 \r\n else:\r\n break\r\nprint(m)", "n , m = [int(x) for x in input().split()]\r\nm = m % int(n*(n+1)/2)\r\nfor i in range(1, n+1):\r\n if i > m:\r\n print(m)\r\n break\r\n else:\r\n m = m - i\r\n", "n,m=map(int,input().split())\r\ni=0\r\nwhile((m-i)>=0):\r\n for i in range(1,n+1):\r\n if m-i>=0:\r\n m=m-i\r\n else:\r\n break\r\n if(i==n):\r\n i=1\r\n break\r\nprint(m)\r\n \r\n \r\n ", "warlus,chips=map(int,input().split())\r\n\r\n#chips %= (chips*(chips+1)/2)\r\ni=1\r\nwhile True:\r\n if chips ==0:\r\n break\r\n if i==warlus+1:\r\n i=1\r\n if chips>=i:\r\n #print(chips, i , sep=' ')\r\n chips-=i\r\n else:\r\n break\r\n i+=1\r\n\r\nprint(chips)\r\n", "n,m=list(map(int,input().split()))\r\nm=m%((n+1)*n//2)\r\nfor i in range(1,n+1):\r\n\tm-=i\r\n\tif m<0:\r\n\t\tprint(m+i)\r\n\t\texit(0)\r\n\t\t\r\n\t\t", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,m=rinput()\r\n\r\ni=1\r\nwhile(m>=i):\r\n if(i==n):\r\n m-=i\r\n i=1\r\n else:\r\n m-=i\r\n i+=1\r\n\r\nprint(m)\r\n\r\n", "n,m=input().split()\nn=int(n)\nm=int(m)\ncnt=0\nwhile 1:\n for i in range(n):\n if m-i-1>=0:\n m=m-i-1\n else:\n cnt+=1\n break\n if cnt!=0:\n break\nprint(m)\n\t\t\t \t \t\t \t \t\t \t\t \t\t", "if __name__ == '__main__':\r\n n, m = str(input()).split()\r\n n = int(n)\r\n m = int(m)\r\n num = 0\r\n line = list()\r\n for i in range(n):\r\n num += (i+1)\r\n line.append(num)\r\n m %= num\r\n for i in range(n):\r\n if m < line[i]:\r\n if i > 0:\r\n m -= line[i - 1]\r\n break\r\n print(m)\r\n", "n,m=map(int,input().split())\r\nw=m%(n*(n+1)//2)\r\nl=int(((8*w+1)**.5-1)//2)\r\nprint(w-l*(l+1)//2)", "n,m=list(map(int,input('').split()))\r\n\r\nflag=True\r\nwhile(flag):\r\n \r\n for i in range(1,n+1):\r\n if (m>=i):\r\n m-=i\r\n else :\r\n flag=False\r\n break\r\n \r\nprint(m)", "n, m = map(int, input().split())\n\nindex = 1\nwhile True:\n if m >= index:\n m -= index\n else:\n print(m)\n break\n index = index % n + 1\n", "n, m = (int(i) for i in input().split(' '))\n\ns = sum(range(n + 1))\nm = m % s\nfor i in range(1, n + 1):\n if m - i < 0:\n if m != 0:\n print(m)\n break\n else:\n m -= i\nif m == 0:\n print('0')\n", "import sys\r\nimport math\r\nimport random\r\nfrom queue import PriorityQueue as PQ\r\nfrom bisect import bisect_left as BSL\r\nfrom bisect import bisect_right as BSR\r\nfrom collections import OrderedDict as OD\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nfrom decimal import Decimal as BIGFLOAT\r\n# mod = 998244353\r\n# mod = 1000000007\r\nmod = 998244353 \r\n# sys.setrecursionlimit(1000000)\r\ntry:\r\n sys.stdin = open(\"actext.txt\", \"r\")\r\n OPENFILE = 1\r\nexcept:\r\n pass\r\n \r\ndef get_ints():\r\n return map(int,input().split())\r\n \r\ndef palindrome(s):\r\n mid = len(s)//2\r\n for i in range(mid):\r\n if(s[i]!=s[len(s)-i-1]):\r\n return False\r\n return True\r\ndef check(i,n):\r\n if(0<=i<n):\r\n return True\r\n else:\r\n return False\r\n \r\n# --------------------------------------------------------------------------\r\nn,m = get_ints()\r\nsm = (n*(n+1))//2\r\nrem = m%sm\r\nfor i in range(1,n+1):\r\n if(rem>=i):\r\n rem-=i\r\nprint(rem)\r\n \r\n", "n, m = map(int, input().split())\n\ni = 1\nwhile m >= i:\n m -= i\n i = (i % n) + 1\n\nprint(m)\n", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\n\r\nn, m = map(int, input().split())\r\ni = 1\r\nwhile m>0:\r\n cc = i%n\r\n if cc==0:\r\n cc=n\r\n if m-cc<0:\r\n break\r\n m-=cc\r\n i+=1\r\nprint(m)", "n,m=map(int,input().split())\r\nx=1\r\nwhile x<=m:\r\n m-=x\r\n x+=1\r\n x%=n+1\r\nprint(m)", "wal, chip = input().split()\r\nwal = int(wal)\r\nchip = int(chip)\r\n\r\ni = 1\r\n\r\nwhile chip - i >= 0:\r\n chip -= i\r\n if i < wal:\r\n i += 1\r\n else:\r\n i = 1\r\nprint(chip)\r\n", "def main():\r\n n,m=[int(x) for x in input().split()]\r\n flag=1\r\n while flag:\r\n for i in range(1,n+1):\r\n if i<=m:\r\n m-=i\r\n else:\r\n flag=0\r\n break\r\n print(m)\r\n\r\nmain()", "n,m=map(int,input().split())\r\nt=m%(int(n*(n+1)/2))\r\n\r\n\r\nfor j in range (1,n+1):\r\n if t>=j:\r\n t=t-j\r\n else:\r\n print(t)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = input().split(\" \")\r\nn=int(a[0])\r\nm=int(a[1])\r\ni=1\r\n\r\nwhile m > i-1:\r\n m -= i\r\n if i < n:\r\n i += 1\r\n else:\r\n i = 1\r\n\r\nprint(m)\r\n", "n,m=map(int,input().split())\r\nm%=n*(n+1)//2\r\nx=next((x for x in range(n+1) if x*(x+1)>2*m),n+1)-1\r\nprint(m-x*(x+1)//2)", "lst = input().split()\nwalrus = int(lst[0])\nchips = int(lst[1])\nthis = True\nwhile this:\n for i in range(1, walrus + 1):\n chips -= i\n if chips == 0:\n this = False\n break\n if chips < 0:\n chips += i\n this = False\n break\nprint(chips)", "n,m = map(int,input().split())\r\n\r\ni = 1\r\n\r\nwhile m :\r\n if i > n :\r\n i = i % n\r\n if i <= m :\r\n m -= i\r\n else:\r\n break\r\n i +=1\r\n\r\nprint(m)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nc = m // (n * (n + 1) // 2) \r\nm -= c * n * (n + 1) // 2\r\ni = 1\r\n\r\nwhile m >= i :\r\n m -= i\r\n i += 1\r\n \r\nprint(m) ", "n,m=map(int,input().split())\r\ni=1\r\nwhile m:\r\n if m-i<0:\r\n print(m)\r\n exit(0)\r\n m-=i\r\n i+=1\r\n if i==(n+1):\r\n i=1\r\nprint(0)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n, m):\r\n while True:\r\n for i in range(1, n + 1):\r\n if m < i:\r\n return m\r\n else:\r\n m -= i\r\n return -1\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n ans = solve(n, m)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\nsumm = n * (n+1) / 2\r\nrem = int(m % summ)\r\n\r\nfor i in range(1, n+1):\r\n if rem - i < 0:\r\n break\r\n rem -= i\r\n\r\nprint(rem)\r\n", "n,m=map(int,input().split())\r\ni=1\r\nwhile m-i>=0:\r\n m-=i\r\n if i==n: i=0\r\n i+=1\r\nprint(m)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn,m=map(int,input().split())\r\ni=1\r\nwhile m>=i:\r\n\tm-=i\r\n\tif i<n:\r\n\t\ti+=1\r\n\telse:\r\n\t\ti=1\r\nprint(m)\t\t\r\n\t\t\t", "a,b=map(int,input().split())\r\ntot=0\r\nflag=0\r\ni=0\r\nwhile tot<=b:\r\n\tadd= (i%a)+1\r\n\ttot+=add\r\n\ti+=1\r\nprint(b+add-tot)\r\n\r\n\r\n\r\n\t\t\r\n", "n,m = map(int,input().split())\r\nsum_n = n*(n+1)/2\r\nm%=sum_n\r\nfor j in range(1,n+1):\r\n if m-j<0:\r\n print(int(m))\r\n break\r\n m-=j\r\n", "n,m = map(int, input().split())\r\n\r\ns = (n*(n+1))//2\r\n\r\nif s == m:\r\n \r\n print(0)\r\n \r\nelif s > m:\r\n \r\n ans = n\r\n \r\n while s > m:\r\n \r\n s -= ans\r\n \r\n ans -= 1\r\n \r\n print(m-s)\r\n \r\nelse:\r\n \r\n s,i,f = m % s,1,0\r\n \r\n while f < s:\r\n \r\n f += i\r\n \r\n i += 1\r\n \r\n if f == s:\r\n \r\n print(0)\r\n \r\n else:\r\n \r\n print(s - (f - i + 1))", "n,m=map(int,input().split(\" \"))\r\n\r\nsum=0\r\nfor i in range(1,n+1):\r\n sum+=i\r\n \r\nm=m%sum\r\nfor i in range(1,n+1):\r\n if(m<i):\r\n print(m)\r\n break\r\n m-=i", "from math import sqrt\r\n\r\nn,m = map(int,input().split())\r\ni = 1\r\nwhile i <= m :\r\n m-=i\r\n i+=1\r\n if i==n+1:\r\n i = 1\r\nprint(m)", "z=list(map(int,input().split()))\r\n\r\ntemp=0\r\nfor i in range(1,z[0]+1) :\r\n temp+=i\r\n\r\nif temp>z[1] :\r\n y=z[1]%temp\r\nelse :\r\n y=z[1]\r\n\r\nstatus=True\r\nwhile status :\r\n for i in range(1,z[0]+1) :\r\n if y-i>=0 :\r\n y-=i\r\n else :\r\n print(y)\r\n status=False\r\n break", "n,m = map(int,input().split())\r\ni=1\r\nwhile i<=n and m>=i:\r\n\tm=m-i\r\n\ti+=1\r\n\tif i==n+1:\r\n\t\ti=1\r\nprint(m)", "a,b=input().split()\r\na,b=int(a),int(b)\r\ni=1\r\nwhile b>=i:\r\n b-=i\r\n if i==a:\r\n i=1\r\n else:\r\n i+=1\r\nprint(b) \r\n ", "n , chips = map(int,input().split())\r\nFound = False\r\nplayer = 1\r\nwhile not Found:\r\n if chips<player:\r\n print(chips)\r\n Found = True\r\n else:\r\n chips -= player\r\n player += 1\r\n if player == n+1:\r\n player = 1", "num, chips = map(int,input().split())\r\nx = 1\r\nwhile(chips>0):\r\n if x != num:\r\n x = x%num\r\n if chips-x >= 0:\r\n chips -= x\r\n else:\r\n break\r\n x += 1\r\nprint(chips)", "n,m=map(int,input().split())\r\ni=1\r\nwhile m-i>=0:\r\n if i<=n:\r\n m-=i\r\n i+=1\r\n if i>n:\r\n i=1\r\n else:\r\n i=1\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\ntem = 0\r\ni = 1\r\nwhile 1:\r\n if i == n + 1: i = 1\r\n tem += i\r\n if tem > m:\r\n tem -= i\r\n break\r\n i -= -1\r\nprint(m - tem)", "n,m = map(int, input().split())\r\narr = list(range(1, n+1))\r\ns = sum(arr)\r\nremain = m%s\r\n\r\nfor i in arr:\r\n\tif i <= remain:\r\n\t\tremain -= i\r\n\telse:\r\n\t\tbreak\r\nprint(remain)\r\n\r\n\r\n", "input_num = [int(x) for x in input().split()]\npeople = input_num[0]\nchips = input_num[1]\n\ncurrent = 1\n\nwhile chips >= current:\n chips -= current\n if current < people:\n current += 1\n else:\n current = 1\n\nprint(str(chips))\n\n \t\t \t\t \t \t \t \t\t\t\t\t\t\t\t \t", "n, m = map(int, input().split())\nsum_n = (1 + n) * n // 2\nm %= sum_n\nfor i in range(1, n + 1):\n if m >= i:\n m -= i\n else:\n break\nprint(m)", "import sys\r\n\r\nn, m = (int(el) for el in input().split())\r\ns = ((1 + n) * n) // 2\r\nm %= s\r\nfor i in range(1, n + 1):\r\n if m - i >= 0:\r\n m -= i\r\n else:\r\n print(m)\r\n break\r\n ", "a = list(input().split(' '))\r\nn, m = int(a[0]), int(a[1])\r\nres = 0\r\ni = 1\r\nwhile m > 0:\r\n m -= i\r\n if (i == n):\r\n i = 1\r\n else:\r\n i += 1\r\n if m - i < 0:\r\n break\r\nprint(m)\r\n", "n,m=map(int,input().split())\r\nx=1\r\nwhile m>0:\r\n if m>=x:\r\n m-=x\r\n else:\r\n print(m)\r\n exit()\r\n x=(x+1)%(n+1)\r\nprint(m)\r\n\r\n", "s,c=input().split()\r\ns=int(s)\r\nc=int(c)\r\ni=0\r\nwhile(1):\r\n k=0\r\n for i in range(1,s+1):\r\n if(c>=i):\r\n c=c-i\r\n else:\r\n k=1\r\n if(k==1):\r\n break\r\nprint(c)\r\n", "n,m=map(int,input().split(\" \"))\r\ni=0\r\nwhile True:\r\n\tif m>=((i%n)+1):\r\n\t\tm=m-((i%n)+1)\r\n\telse:\r\n\t\tprint(m)\r\n\t\tbreak\r\n\ti+=1", "n,m = [int (x) for x in input().split()]\r\ni=1 \r\nwhile(i<=m):\r\n m=m-i\r\n if(i==n):\r\n i=1\r\n continue\r\n i=i+1 \r\nprint(m)", "inputs = input()\r\ninputsList = inputs.split()\r\nx = int(inputsList[0])\r\ny = int(inputsList[1])\r\n\r\ngiven = 0\r\noutput = 0\r\ncode = True\r\n\r\nwhile code:\r\n if given < y:\r\n for i in range(1, x + 1):\r\n if given < y:\r\n given += i\r\n if given > y:\r\n given -= i\r\n output = y - given\r\n code = False\r\n break\r\n else:\r\n output = y - given\r\n break\r\n else:\r\n break\r\n \r\n\r\nprint(output)\r\n \r\n \r\n", "n, m = input().split()\nn = int(n)\nm = int(m)\n\nsub = 1\ntotal = m\nwhile True:\n if sub <= n and sub <= total:\n total -= sub\n sub += 1\n if sub > n:\n sub = 1\n if sub > total:\n output = total\n break\n\nprint(output)", "n = input().split(' ')\r\nn1 = int(n[0])\r\nm = int(n[1])\r\ns = (1 + n1) * n1 / 2\r\nwhile m > s:\r\n m -= s\r\nfor i in range(1, n1 + 1):\r\n m -= i\r\n if m < i + 1:\r\n break\r\nprint(int(m))", "n,m=map(int,input(\"\").split())\r\ns=int((n*(n+1))/2)\r\nr=m%s\r\nk=r\r\n#print(r)\r\ni=1\r\nwhile(True):\r\n if((r-i<0)):\r\n print(str(r))\r\n break\r\n else:\r\n r=r-i\r\n i=i+1\r\n \r\n#from sys import stdin,stdout\r\n#n,m=map(int,input().split())\r\n#s=int((n*(n+1))/2)\r\n#r=m%s\r\n#k=r\r\n#print(r)\r\n#i=1\r\n#while(True):\r\n# if((r-i)<0):\r\n# print(str(r))\r\n# break\r\n# else:\r\n# r=r-i\r\n# i=i+1\r\n \r\n", "n,m=map(int,input().split())\r\nz=1\r\nwhile m>=z:\r\n m-=z\r\n if z==n:\r\n z=1\r\n else:\r\n z+=1\r\nprint(m)\r\n", "n,m = list(map(int,input().split())) #50,1e4\r\ncc = (n*(n+1))//2\r\nm = m%cc\r\ncl = [((i+1)*(i+2))//2 for i in range(n)]\r\nfor i in range(1,n+1):\r\n if m >= i:\r\n m -= i\r\n else:\r\n print(m)\r\n break\r\n", "def solve(t_id):\r\n n, m = map(int, input().split())\r\n s = n * (n + 1) // 2\r\n m %= s\r\n p = 1\r\n while m >= p:\r\n m -= p\r\n p += 1\r\n print(m)\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,m=map(int,input().split())\r\na=(n+n**2)//2\r\nj=m%a\r\n\r\nb=int((-1+(1+8*j)**.5)/(2))\r\n\r\nd=(b+b**2)//2\r\nprint(j-d)\r\n", "l=lambda :map(int,input().split())\r\nn,x=l()\r\ns=n*(n+1)//2\r\nx=x-(x//s)*s\r\nn=((1+8*x)**0.5-1)//2\r\nprint(int(x-n*(n+1)//2))", "a, b = list(map(int, input().split()))\r\nx = 0\r\nfor i in range(1, a+1):\r\n x += i\r\n\r\nb = b - (b//x * x)\r\nant = 0\r\nwhile b > 0:\r\n for i in range(1, a+1):\r\n if b-i < 0:\r\n ant = i\r\n break\r\n b -= i\r\n if ant != 0:\r\n break\r\n\r\nprint(b)", "n, m = map(int, input().split())\r\ni = 1; curr = 0\r\nwhile curr + i <= m:\r\n curr += i\r\n if i == n: i = 1\r\n else: i += 1\r\nprint(m - curr)", "n,m=map(int,input().split())\r\nc=1\r\nwhile c<=m:\r\n m-=c;c+=1\r\n if c==n+1:c=1\r\nprint(m)", "n,m=map(int,input().split())\r\nk=1\r\nwhile m:\r\n if k<=m:\r\n m-=k\r\n k%=n\r\n k+=1\r\n else: break\r\nprint(m)", "def g(x,y):\r\n if x==0 or y==0:\r\n return max(x,y)\r\n return min(x,y)\r\nn,m=list(map(int,input().split()))\r\ni=1\r\nwhile m>=g(i%n,n):\r\n m-=g(i%n,n)\r\n i+=1\r\nprint(m)", "n,m=map(int,input().split())\r\ns=n*(n+1)//2;o=m%s\r\nfor i in range(1,n+1):\r\n if o<i:print(o);break\r\n else:o-=i\r\n", "from itertools import count\r\nn, m = map(int, input().split())\r\n\r\ncnt = count(0) # one step behind from the loop ran\r\n\r\nwhile True:\r\n for i in range(1, n + 1):\r\n if m >= i:\r\n next(cnt)\r\n m -= i\r\n else:\r\n break\r\n if next(cnt) != n:\r\n break\r\n cnt = count(0)\r\n\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\ni = 1\r\nwhile i <= m:\r\n m -= i\r\n i = i + 1 if i != n else 1\r\nprint(m)", "n,m=[int(i) for i in input().split()]\r\ni=1\r\nwhile(True):\r\n if m<i:\r\n break\r\n else:\r\n m-=i\r\n i+=1\r\n if i==n+1:\r\n i=1\r\nprint(m)\r\n", "walruses, chips = map(int, input().split())\r\nstops_here = False\r\nwhile True:\r\n for i in range(1, walruses + 1):\r\n if chips < i:\r\n stops_here = True\r\n break\r\n if chips >= i:\r\n chips -= i\r\n if stops_here: \r\n break\r\nprint(chips)\r\n\r\n\r\n \r\n", "n, k = map(int, input().split())\r\nt = 0\r\nwhile k > 0 and t != 1:\r\n for i in range(n):\r\n if k >= i + 1:\r\n k -= (i + 1)\r\n else:\r\n t = 1\r\n break\r\nprint(k)", "while True:\r\n try:\r\n n,m=map(int,input().split())\r\n s=(n*(n+1))/2\r\n m%=s\r\n for i in range(1,n+1):\r\n if m<i:\r\n break\r\n m-=i\r\n print(int(m))\r\n except:\r\n break", "import math\r\n\r\na, b = map(int, input().split())\r\n\r\nb -= (2*b // (a * (a + 1))) * (a * (a + 1)) // 2\r\n\r\nc = (-1 + math.sqrt(1 + 4*2*b)) // 2\r\n\r\nprint(int(b - (c*(c + 1)) // 2))", "n, m = input().split()\r\nn, m = int(n), int(m)\r\ni = 1\r\nwhile True:\r\n if m >= i:\r\n # print(m, j)\r\n m -= i\r\n if i >= n:\r\n i = 1\r\n else:\r\n i += 1\r\n else:\r\n break\r\nprint(m)\r\n", "n, m = map(int , input().split())\r\n\r\ntotal_chips = sum(range(1, 1+n))\r\nremaining_chips = m % total_chips\r\nif remaining_chips == 0:\r\n print(0)\r\nelse:\r\n for i in range(1, 1+n):\r\n if remaining_chips < i:\r\n print(remaining_chips)\r\n break\r\n remaining_chips -= i", "def main():\r\n n,m = list(map(int, input().split()))\r\n while 1:\r\n flag = 1\r\n for i in range(1, n+1):\r\n if m >= i:\r\n m-=i\r\n else:\r\n flag = 0\r\n break\r\n if flag == 0:\r\n break\r\n print(m)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\ni=1\nwhile(m>=i):\n m-=i\n i+=1\n if(i>n):\n i=1\nprint(m)\n\n\n\n", "string = input()\nn = int(string[:string.find(\" \")])\nm = int(string[string.find(\" \"):])\n\nremaining = m\nturn = 1\n\nwhile (remaining >= turn):\n\tremaining -= turn\n\tturn += 1\n\tif (turn > n):\n\t\tturn = 1\n\nprint (remaining)", "n,m=[int(i) for i in input().split()]\r\nd=n*(n+1)//2\r\ndk=m//d\r\nc=m-dk*d\r\ni=1\r\nwhile c>=i:\r\n c=c-i\r\n i=i+1\r\nprint(c)\r\n", "n,m = map(int,input().split())\r\n\r\nm = m%(n*(n+1)//2)\r\n\r\nk = 1\r\n\r\nwhile k*(k+1)<=2*m:\r\n k+=1\r\n\r\nprint(m-k*(k-1)//2)", "s = input().split(\" \")\r\nn = int(s[0])\r\nm = int(s[1])\r\ns = (1 + n)*n//2\r\nm = m % s\r\ni = 1\r\nwhile(m >= i):\r\n m -= i\r\n i += 1\r\nprint(m)\r\n", "A,B = map(int, input().split())\r\ntemp = A * (A + 1) // 2\r\nfor i in range(100000000):\r\n if temp <= B:\r\n B -= temp\r\n elif temp > B:\r\n break\r\nif B == 0:\r\n print(0)\r\nelse:\r\n for i in range(1, A + 1):\r\n if B >= i:\r\n B -= i\r\n elif B < i:\r\n print(B)\r\n break", "n, m = [int(i) for i in input().split()]\r\n\r\nar = ((2 + (n - 1)) // 2) * n\r\n\r\nwhile True:\r\n i = 1\r\n while i <= n:\r\n if m - i > 0:\r\n m -= i\r\n elif m - i == 0:\r\n print(0)\r\n exit(0)\r\n else:\r\n print(m)\r\n exit(0)\r\n i += 1", "import math\r\n\r\nn, m = map(int, input().split())\r\n\r\nm -= (2*m // (n * (n + 1))) * (n * (n + 1)) // 2\r\n\r\nx = (-1 + math.sqrt(1 + 4*2*m)) // 2\r\n\r\nprint(int(m - (x*(x + 1)) // 2))", "n, m = map(int, input().split())\r\n\r\ncounter = 1\r\n\r\nwhile(True):\r\n \r\n if counter > n:\r\n counter = 1\r\n \r\n if m < counter or m == 0:\r\n break\r\n else:\r\n \r\n m -= counter\r\n counter += 1\r\n \r\nprint(m)", "n,m = map(int,input().split())\r\nk = m%(n*(n+1)//2)\r\nc = 1\r\nwhile k-c >= 0:\r\n\tk = k - c\r\n\tc+=1\r\nprint(k)", "n,m = map(int,input().split())\r\ns = int(n*(n+1)/2)\r\nm = m%s\r\n\r\nfor i in range(1,n):\r\n\tif(m<i):\r\n\t\tbreak\r\n\tm= m-i\r\nprint(m)", "n,m=map(int,input().split())\nkk=int((n+1)*n/2)\nif(m>=kk):\n a=m%kk\n for i in range(n):\n if(a-i<0):\n break\n a-=i\n print(a)\nelse:\n for i in range(n):\n if(m-i<0):\n break\n m-=i\n print(m)\n\n\t\t \t\t\t\t \t\t \t \t \t \t \t \t \t", "from math import sqrt,floor\r\nn,m = map(int, input().split())\r\nm %= n*(n+1)//2\r\nn_ = (floor(sqrt(1+8*m)) - 1)>>1\r\nprint(m-(n_*(n_+1)//2))", "n,m=map(int,input().split())\ns=(n*(n+1))//2\nm=m%s\nfor i in range(1,n+1):\n\tif i<=m:\n\t\tm-=i\n\telse:\n\t\tbreak\n\nprint(m)\n", "def solve(n, m):\n x = 0\n i = 1\n while x < m and x + i <= m:\n x += i\n i = (i + 1) % (n + 1)\n return m - x\n \n\n\ndef main():\n n, m = list(map(int, input().split()))\n print(solve(n, m))\n\n\nmain()\n", "n,m=map(int,input().split(\" \"))\r\nm=m%((n*(n+1))//2)\r\nfor i in range(1,n+1):\r\n if (m>= i):\r\n m-=i\r\n else: break\r\nprint(m)", "num=[int(num) for num in input().split()]\r\nw=num[0]\r\nc=num[1]\r\nx=((w*(w+1))/2)\r\nif (c%x==0):\r\n print(0)\r\nelif (c>x):\r\n c=int(c-((c//x)*x))\r\n index=1\r\n while (c>=index):\r\n c=c-index\r\n index+=1 \r\n if (c==0):\r\n print(0)\r\n break\r\n if (c!=0):\r\n print(c) \r\nelse:\r\n index=1\r\n while (c>=index):\r\n c=c-index\r\n index+=1 \r\n if (c==0):\r\n print(0)\r\n break\r\n if (c!=0):\r\n print(c) ", "s = input()\r\ns = s.split()\r\na = int(s[0])\r\nb = int(s[1])\r\nb %= (a+1)*a/2\r\nfor i in range(1,a+1):\r\n if b < i:\r\n print(int(b))\r\n exit(0)\r\n else:\r\n b -= i", "#loser707\r\nn,m=map(int,input().split())\r\ns=(n*(n+1))//2\r\nr=m%s\r\ni=1\r\nwhile i<=r:\r\n r=r-i\r\n i=i+1\r\nprint(r)", "n,m = map(int,input().split())\r\nc = 0 \r\nwhile m>0 :\r\n for i in range(1,n+1):\r\n \r\n if m-i >=0:\r\n m = m-i\r\n else:\r\n c = m\r\n m = 0\r\n break\r\nprint(c)", "\nwalruses, chips = list(map(int, input().split(\" \")))\n\nleft_chips = chips % (walruses * (walruses + 1) // 2)\nfor idx in range(1, walruses + 1):\n if idx > left_chips:\n break \n left_chips -= idx\n\nprint(left_chips)\n", "if __name__=='__main__':\r\n n,m = tuple(map(int,input().split()))\r\n i = 1\r\n while m>=i:\r\n m-=i\r\n i = (i+1)%(n+1)\r\n \r\n print(m)", "n, m = map(int,input().split())\r\nk = True\r\nwhile m > 0 and k == True:\r\n for i in range(1,n+1):\r\n if i <= m:\r\n m = m - i\r\n else:\r\n k = False\r\n break\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\na = m % (n*(n + 1)//2)\r\nfor i in range(1, n):\r\n if i <= a:\r\n a = a - i\r\nprint(a)", "walrus , chips = map(int,input().split())\r\nm=((walrus*(walrus+1))//2)\r\nchips = chips%m\r\nfor i in range(1,(walrus+1)):\r\n if chips<i:\r\n break\r\n chips-=i\r\nprint(chips)", "temp = input()\r\ntemp = temp.split(' ')\r\nn = int(temp[0])\r\nm = int(temp[1])\r\nb = True\r\nwhile(b):\r\n for i in range(1, n+1):\r\n if m-i > -1:\r\n m -= i\r\n else:\r\n b = False\r\n break\r\nprint(m)", "n,k=map(int,input().split())\r\ni=1\r\nwhile(k>=i):\r\n k=k-i\r\n i=(i%n)+1\r\nprint(k) ", "num, chips = map(int, input().split())\r\nlast = 0\r\ncurrent = 0\r\nflag = True\r\nwhile flag:\r\n for index, x in enumerate(range(1, num + 1)):\r\n current += x\r\n if current > chips:\r\n flag = False\r\n break\r\n else:\r\n last = current\r\nans = chips % last\r\nif ans >= 1 and index + 1 == 1:\r\n print(ans - 1)\r\nelse:\r\n print(ans)", "n, m = map(int, input().split())\r\ni = 0\r\nwhile m>i:\r\n\ti+=1\r\n\tm-=i\r\n\tif i==n:\r\n\t\ti = 0\r\nprint(m)\t\r\n", "# https://codeforces.com/problemset/problem/92/A\r\n\r\nn, m = map(int, input().split())\r\n\r\ni = 1\r\nwhile m >= i:\r\n m -= i\r\n i += 1\r\n if i > n:\r\n i = 1\r\n\r\nprint(m)", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nflag_1 = True\r\nflag_2 = True\r\nwhile flag_1:\r\n i = 1\r\n while i <= a and flag_2:\r\n if i > b:\r\n flag_1 = False\r\n flag_2 = False\r\n else:\r\n b -= i\r\n i += 1\r\nprint(b)", "(walruses, chips) = map(int, input().split(' '))\n\ni = 1\nwhile True:\n if i > walruses:\n i = 1\n\n if chips < i:\n print(chips)\n break\n elif chips == i:\n print(0)\n break\n\n chips -= i\n i += 1\n\n\n\n", "a, b = map(int, input().split())\r\nd = 1\r\nwhile b >= d:\r\n b -= d\r\n d += 1\r\n if d > a:\r\n d -= a\r\nprint(b)", "n,m = map(int,input().split())\r\nk = (n*(n+1))//2\r\nk = m%k\r\nfor i in range(1,n+1):\r\n if k-i < 0:\r\n break\r\n k-=i\r\nprint(k)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nfullcircle = (n*(n+1))/2\r\nremainder = m % fullcircle\r\n\r\n# check if I can give the guy \r\n# if can give, then give :D \r\n# if cannot give, then keep and stop giving\r\n\r\n# range(10):\r\n# range(a,b):\r\n# range(a,b,c): a, a+c, a+2c, a+3c, .... , a+nc < b \r\n\r\nfor i in range(1,n+1): # i is all the possible values in range \r\n if(remainder >= i): \r\n remainder = remainder - i \r\n else:\r\n break\r\n \r\nprint(int(remainder)) ", "'''\nAuthor : knight_byte\nFile : A_Chips.py\nCreated on : 2021-04-16 11:55:37\n'''\n\n\ndef main():\n n, m = map(int, input().split())\n i = 1\n while i <= m:\n m -= i\n i = (i) % n + 1\n print(m)\n\n\nif __name__ == '__main__':\n main()\n", "n,m = list(map(int,input().split()))\r\nr = m % ((n*(n+1))//2)\r\nk = int(((1+8*r)**(1/2) - 1)/2)\r\nprint(r - (k*(k+1))//2)", "n, m = map(int, input().split())\r\nN = n * (n+1) // 2\r\nm = m % N\r\nfor x in range(1, n+1):\r\n if m >= x:\r\n m -= x\r\nprint(m)", "x=list(map(int,input().split()))\nn=x[0]\nm=x[1]\nyo=m%((n*(n+1))//2)\nm=yo\n#print(m)\nflag=0\nfor i in range(1,n+1):\n\t#print(m,((i*(i+1))//2))\n\tif ((i*(i+1))//2) > m:\n\t\tans=m-(((i-1)*i)//2)\n\t\tflag=1\n\t\tbreak\nif flag==1:\n\tprint(ans)\t\t\nelse:\n\tprint(0)\t", "a = list(map(int,input().split()))\r\nn,m = a[0],a[1]\r\ni = 1\r\nwhile m >= i:\r\n m -= i\r\n i = i % n + 1\r\nprint (m)\r\n", "from math import floor\r\nn,m=map(int,input().split());k=n*(n+1)//2;l=floor(((8*(m%k)+1)**0.5-1)/2);print(m%k-l*(l+1)//2)", "n,m = map(int,input().split())\nflag = True\nwhile flag:\n for i in range(1,n+1,+1):\n if m >= i:\n m = m - i\n else:\n flag = False\n break\n\nprint(m)\n\n\t\t \t \t\t \t \t \t\t \t \t \t \t", "n, m = map(int, input().split())\r\nChips = 0\r\ni = 1\r\nwhile Chips + i <= m:\r\n Chips += i\r\n i += 1\r\n if i > n:\r\n i = 1\r\nprint(m - Chips)\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# خدایااااا شکرت", "import math\r\n\r\nn, m = map(int, input().split())\r\nm %= (n * (n + 1) // 2)\r\nx = int((math.sqrt(8 * m + 1) - 1) / 2)\r\nprint(m - x * (x + 1) // 2)\r\n", "temp = [int(x) for x in input().split()]\r\nn = temp[0]\r\nm = temp[1]\r\nm = m % (n*(n+1) // 2)\r\nx = int((-1 + (1 + 8 * m) ** (1/2)) // 2)\r\nprint(m - x * (x + 1) // 2)\r\n", "def f(n,m):\r\n\ti=1\r\n\twhile True:\r\n\t\tm-=i\r\n\t\tif m<0:\r\n\t\t\treturn int(m+i)\r\n\t\ti+=1\r\nn,m=map(int,(input().split()))\r\ns=n*(n+1)/2\r\nif m>s:\r\n\tm=m%s\r\nprint(f(n,m))", "n, m = map(int, input().split())\r\ntoBreak = False\r\nwhile m > 0:\r\n for i in range(1,n + 1):\r\n m -= i\r\n if m == 0:\r\n toBreak = True\r\n if m < 0:\r\n toBreak = True\r\n m += i\r\n break\r\n \r\n if toBreak:\r\n break\r\n \r\nprint(m)", "[n,m]=[int(i) for i in input().split()]\r\n\r\nc=m\r\n\r\nx=1\r\n\r\nwhile(True):\r\n\tif(c>=x):\r\n\t\tc-=x\r\n\telse:\r\n\t\tbreak\r\n\r\n\tx=(x+1)%(n+1)\r\n\tif(x==0):\r\n\t\tx+=1\r\n\r\nprint(c)", "import math\r\n\r\nN, M = map(int, input().split())\r\n\r\nM -= (2*M // (N * (N + 1))) * (N * (N + 1)) // 2\r\nx = (-1 + math.sqrt(1 + 4*2*M)) // 2\r\n\r\nprint(int(M - (x*(x + 1)) // 2))", "n,m=[int(x) for x in input().split()]\r\nm=m%(n*(n+1)//2)\r\ni=1\r\nwhile m>0: \r\n\tm-=i\r\n\ti+=1\r\nif m==0:\r\n\tprint(m)\r\nelse:\r\n\tprint(m+i-1)\r\n", "n, m = [int(x) for x in input().split()]\nq = 1\nwhile m >= q:\n\tm -= q\n\tq += 1\n\tif q == n + 1:\n\t\tq = 1\nprint(m)\n", "import math\r\ndef xx(a):\r\n return (math.sqrt((8*a)+1)-1)//2\r\ndef yy(n):\r\n return ((n+1)*n)//2\r\n\r\nn,m=map(int,input().split())\r\nb=m%yy(n)\r\nx=xx(b)\r\nprint(int(b-yy(x)))\r\n", "def solve(n, m):\r\n\r\n start = 1\r\n while m - start >= 0:\r\n m -= start\r\n start += 1\r\n if start == n+1:\r\n start = 1\r\n\r\n return m\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))\r\n", "n,m=map(int,input().split())\r\np=0\r\nwhile 1!=2:\r\n for i in range(1,n+1):\r\n if m>=i:\r\n m-=i\r\n else:\r\n p=1\r\n break\r\n if p==1:\r\n break\r\nprint(m)\r\n", "n,m=map(int,input().split())\r\nc=0\r\ns=0\r\nwhile(s<=m):\r\n c=c+1\r\n s=s+c\r\n if(c==n and s<=m):\r\n c=0\r\ns=s-c\r\nprint(m-s)", "n, m = map(int, input().split())\r\nremaining = m\r\nflag = 0\r\nwhile True:\r\n for i in range(1,n+1):\r\n if remaining < i:\r\n flag = 1\r\n break\r\n remaining -= i\r\n if flag:\r\n break\r\nprint(remaining)", "n, m = [int(x) for x in input().split(' ')]\n\ntotal = 0\ncircle = [x for x in range(1,n+1)]\ni = 0\nwhile (total+circle[i]<=m):\n if total + circle[i] <= m:\n total += circle[i]\n i = (i+1)%n\n\nprint(max(0, m-total))\n \t\t\t \t \t\t\t\t\t \t\t\t\t \t\t\t\t \t \t\t", "l=list(map(int,input().split()))\r\ns = l[0]*(l[0]+1)//2\r\nrem = l[1]%s\r\ns=1\r\nwhile(rem):\r\n d=rem\r\n rem = rem-s\r\n if(rem<0):\r\n print(d)\r\n break\r\n s=s+1\r\nelse:\r\n print(\"0\")", "# 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\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, m = In()\r\narr = [1]\r\nfor i in range(1, n):\r\n arr.append(arr[i-1]+(i+1))\r\nif m % arr[n-1] == 0:\r\n print(0)\r\nelse:\r\n x = m% arr[n-1]\r\n if x in arr:\r\n print(0)\r\n else:\r\n p = bisect_left(arr,x)\r\n print(x- arr[p-1])\r\n ", "#92A-Chips\r\nn,m=[int(x) for x in input().split(' ')]\r\ni=1\r\nwhile True:\r\n a=(i-1)%n+1\r\n if m >= a:\r\n m-=a\r\n else:\r\n break\r\n i+=1\r\nprint(m)\r\n", "a=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(a[0]):\r\n b.append(i+1)\r\n\r\ni=0\r\nwhile True:\r\n j=i%len(b)\r\n #print(j)\r\n if b[j]<=a[1]:\r\n a[1]=a[1]-b[j]\r\n else:\r\n print(a[1])\r\n break\r\n i=i+1", "n, m = map(int, input().split())\r\ntotal = n * (n + 1) // 2\r\nrem = m % total\r\ni = 1\r\nwhile rem - i >= 0:\r\n rem -= i\r\n i += 1\r\nprint(rem)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 27 23:06:52 2021\r\n\r\n@author: cheehong\r\n\"\"\"\r\n\r\nl=list(map(int, input().split()))\r\nn=l[0]\r\nm=l[1]\r\nk=1\r\nwhile m>=k:\r\n m=m-k\r\n if k==n:\r\n k=1\r\n else:\r\n k+=1\r\nprint(m)" ]

[ "n=str(input())\r\nm = n\r\nif n[0] == '-':\r\n if int(n[-2]) <= int(n[-1]):\r\n m=n[:-1]\r\n else:\r\n m=n[:-2]+n[-1]\r\n m=int(m)\r\nprint(m)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nx=str(n)\r\nif n<0:\r\n if (len(x)-1)<2:\r\n print(0)\r\n else:\r\n n1=(-1*n)%10\r\n n2=((-1*n)%100)//10\r\n if n1>n2:\r\n y=(-1*n)//10\r\n y=(-1*y)\r\n print(y)\r\n else:\r\n y=(-1*n)//100\r\n y=(y*10)+n1\r\n y=(-1*y)\r\n print(y)\r\nelse:\r\n print(n)", "n=int(input())\r\nif n<0:\r\n ld=(-1*n)%10\r\n a_ld=(-1*n)//10\r\n lbd= (a_ld)%10\r\n lbd_n=(a_ld)//10\r\n lbd_n=((lbd_n*10)+ld)\r\n ans1=a_ld*-1\r\n ans2=lbd_n*-1\r\n if ans1>ans2:\r\n print(ans1)\r\n else:\r\n print(ans2)\r\nelse:\r\n print(n)\r\n ", "def main() -> None :\r\n BANK_STATE:int = int(input())\r\n\r\n maximumBankState:int = -1\r\n LAST_DIGIT_REMOVED_STATE:int = int(str(BANK_STATE)[:-1])\r\n LAST_BEFORE_DIGIT_REMOVED_STATE:int = int(str(BANK_STATE)[:-2] + str(BANK_STATE)[-1])\r\n maximumBankState = max(BANK_STATE, LAST_DIGIT_REMOVED_STATE, LAST_BEFORE_DIGIT_REMOVED_STATE)\r\n \r\n print(maximumBankState)\r\n \r\nmain()", "#https://codeforces.com/problemset/problem/313/A\r\n\r\nn = input()\r\nif(int(n) > 0):\r\n answer = n\r\nelse:\r\n answer = n[:-2] + min(n[-1], n[-2])\r\nprint(int(answer))", "n=int(input())\r\nprint(max(n,-min((-n)//10,((-n)//100)*10+(-n)%10)))", "n=input()\r\nd=max(map(int,(n,n[:-1],n[:-2]+n[-1])))\r\nprint(d)", "n = input()\r\nif int(n) >= 0:\r\n print(n)\r\nelse:\r\n n = int(n[1:])\r\n print(-min(n//10, n//100*10 + n%10))", "balance = input()\r\nbalance_int = int(balance)\r\n\r\nif balance_int > 0:\r\n\r\n print(balance)\r\n\r\nelse:\r\n\r\n # check which digit (last or pre-last is the largest and remove it)\r\n\r\n if int(balance[-1]) > int(balance[-2]):\r\n\r\n output = balance[:-1]\r\n\r\n else:\r\n\r\n output = balance[:-2] + balance[-1]\r\n\r\n if output[1] == '0': print(0)\r\n else: print(output)", "num = input()\r\nneg = num[0] == \"-\"\r\nbigger = num[-2] > num[-1]\r\nif neg :\r\n if bigger :\r\n num = num[:-2] + num[-1]\r\n else :\r\n num = num[:-1]\r\n\r\nprint(int(num))", "str1 = input()\r\n\r\nif((int(str1))<0):\r\n s = int(str1[0:-1])\r\n s2 = str1[0:-2]\r\n s1 = int(s2+str1[-1])\r\n if(s<s1):\r\n print(s1)\r\n else:\r\n print(s)\r\nelse:\r\n print(str1)", "current_bill = input()\r\n\r\nnew_bill_1 = int(current_bill)\r\nnew_bill_2 = int(current_bill[:-1])\r\nnew_bill_3 = int(current_bill[:-2] + current_bill[-1])\r\n\r\nif new_bill_1 >= new_bill_2 and new_bill_1 >= new_bill_3:\r\n print(new_bill_1)\r\nelif new_bill_2 >= new_bill_3:\r\n print(new_bill_2)\r\nelse:\r\n print(new_bill_3)", "x = input()\r\nprint(max(int(x[:len(x)-1]), int(x[:len(x)-2] + x[len(x)-1]), int(x)))", "from math import ceil\r\nn = int(input())\r\n\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n st1 = int(n / 10)\r\n last = n % -10\r\n st2 = int(n / 100) * 10 + last\r\n # print(st1, st2)\r\n # print(last)\r\n # print(int(n / 100) * 10 + last)\r\n # print(n)\r\n print(max(st1, st2))", "n=int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n k=str(n)[:-1]\r\n m=str(n)[:-2]+str(n)[-1]\r\n \r\n if abs(int(k))>abs(int(m)):\r\n print(int(m))\r\n else:\r\n print(int(k))\r\n \r\n ", "# Main\r\nif __name__ == '__main__':\r\n n = int(input())\r\n if n > 0:\r\n print(n)\r\n else:\r\n n = -n\r\n if n % 10 > (n // 10) % 10:\r\n print(-(n // 10))\r\n else:\r\n print(-(n % 10 + (n // 100) * 10))\r\n# abc", "n = int(input())\r\nnum1 = n\r\nn = str(n)\r\nnum2 = int(n[:len(n)-1])\r\nnum3 = int(n[:-2] + n[-1:])\r\nans = max(max(num1,num2),num3)\r\nprint(ans)\r\n", "n=int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n u=abs(n)%10\r\n t=(abs(n)%100-u)//10\r\n if u>t:\r\n print(-(abs(n)//10))\r\n else:\r\n print(-(abs(n)//10+u-t))\r\n ", "n=input()\r\nif n[0]=='-':\r\n n=n[:-2]+min(n[-1],n[-2])\r\n if n=='-0':\r\n n='0'\r\n print(n)\r\nelse:\r\n print(n)", "n = int(input())\r\n\r\nif n>=0:\r\n print(n)\r\n\r\nelse:\r\n n = abs(n)\r\n x = n//10\r\n y = n//100\r\n z = n%10\r\n w = x%10\r\n a = y*10 + z\r\n b = y*10 + w\r\n \r\n if a == 0 or b == 0:\r\n print(0)\r\n elif a>=b:\r\n print(\"-\"+ str(b))\r\n else:\r\n print(\"-\"+str(a))", "def dumbilya(n):\r\n alist=[]\r\n x=str(n)\r\n for i in x:\r\n alist.append(i)\r\n if alist[0]!=\"-\":\r\n return n\r\n else:\r\n c=alist[len(alist)-1]\r\n d=alist[len(alist)-2]\r\n if c>d:\r\n alist.pop(len(alist)-1)\r\n elif d>c:\r\n alist.pop(len(alist)-2)\r\n else:\r\n alist.pop(len(alist)-1)\r\n return alist\r\nn=input()\r\nresult=dumbilya(n)\r\nif result==[\"-\",\"0\"]:\r\n print(0)\r\nelse:\r\n for res in result:\r\n print(res,end=\"\")\r\n", "n = int(input())\r\nif n<0:\r\n n = str(n)\r\n x = max(int(n[:-1]), int(n[:-2]+n[-1:]))\r\n print(x)\r\nelse:\r\n print(n)", "balance = input()\r\n\r\nbef_last = balance[0:len(balance) - 2] + balance[-1]\r\nlast = balance[0: len(balance) - 1]\r\n\r\nif int(balance) >= 0:\r\n print(balance)\r\nelif bef_last <= last:\r\n print(int(bef_last))\r\nelse:\r\n print(int(last))\r\n", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n *= -1\r\n last = n % 10\r\n prelast = (n//10) % 10\r\n n //= 100\r\n n *= 10\r\n print(0 - (n + min(last, prelast)))\r\n", "x=int(input())\r\nif x>=0:\r\n print(x)\r\nelse:\r\n x=abs(x)\r\n s=str(x)\r\n a=s[0:len(s)-1]\r\n b=s[0:len(s)-2]+s[-1]\r\n a=int(a)\r\n b=int(b)\r\n if a==0 or b==0:\r\n print(0)\r\n elif a>b:\r\n print(-b)\r\n else:\r\n print(-a)\r\n", "san = int(input())\r\nif san > 0:\r\n print(san)\r\nelse:\r\n str_san = str(san)\r\n resPos = str_san[-1]\r\n resPredPos = str_san[-2]\r\n if int(resPos)>int(resPredPos):\r\n print(int(str_san[:-1:]))\r\n else:\r\n result = str_san[:-2:]+str_san[-1]\r\n print(int(result))", "inp=str(input()).strip()\r\nif inp[0]=='-':\r\n num1=inp[1:len(inp)-1]\r\n num2=inp[1:len(inp)-2]+inp[-1]\r\n ans=min(num1,num2)\r\n if ans !=0 :\r\n print(-int(ans))\r\n else:\r\n print(ans)\r\nelse:\r\n print(inp)", "x=int(input())\r\nif x>=0:\r\n print(x)\r\nelse:\r\n x=int((-1)*x)\r\n l=str(x)\r\n m=max(l[len(l)-2:len(l)])\r\n p=l.rfind(m)\r\n if len(l)==2 and min(l)=='0':\r\n print(0)\r\n else:\r\n print('-',end='')\r\n print(int(l[0:p]+l[p+1:len(l)]))", "s = input()\nn = int(s)\n\nanswer = n if n >= 0 else -min(int(s[1:-1]), int(s[1:-2] + s[-1:]))\nprint(answer)", "def maximize_bank_account_balance(n):\r\n str_n = str(n)\r\n if n >= 0:\r\n return n\r\n without_last_digit = int(str_n[:-1])\r\n if int(str_n[:-2] + str_n[-1]) > without_last_digit:\r\n without_last_digit = int(str_n[:-2] + str_n[-1])\r\n return without_last_digit\r\nn = int(input())\r\nresult = maximize_bank_account_balance(n)\r\nprint(result)\r\n", "x = int(input())\r\nif x<0 :\r\n \r\n y = str(x)\r\n z = y[len(y)-1:]\r\n a = y[len(y)-2:len(y)-1]\r\n if int(z)>= int(a) :\r\n x = int(y[:len(y)-1])\r\n else :\r\n x = int(y[:len(y)-2]+y[len(y)-1])\r\n\r\nprint(x)\r\n\r\n \r\n", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n = n * -1\r\n if n % 10 > (n % 100) // 10:\r\n n = (n - n % 10) // 10\r\n else:\r\n n = (n - n % 100) // 10 + n % 10\r\n print(n * -1)\r\n ", "n = int(input())\r\n\r\nif n >= 0:\r\n # Non-negative balance, no need to remove digits\r\n print(n)\r\nelse:\r\n # Negative balance, try removing digits\r\n n = abs(n) # Work with positive balance\r\n last_digit_removed = n // 10 # Remove the last digit\r\n second_last_digit_removed = (n // 100) * 10 + n % 10 # Remove the second last digit\r\n print(-min(last_digit_removed, second_last_digit_removed))\r\n", "n=int(input())\r\nif n>0:\r\n print(n)\r\nelse:\r\n \r\n s=str(n)\r\n v1=int(s[len(s)-2])\r\n v2=int(s[len(s)-1])\r\n if v1>v2:\r\n ans=(s[0:len(s)-2]+str(v2))\r\n else:\r\n ans=(s[0:len(s)-2]+str(v1))\r\n if ans==\"-0\":\r\n ans=0\r\n print(ans)\r\n\r\n\r\n", "a = input()\r\nb = a[:-1]\r\nc = a[:-2] + a[-1:]\r\nprint(max(int(a), int(b), int(c)))", "n=int(input())\r\nif(n>=0):\r\n print(n)\r\nelse:\r\n s1=str(n)\r\n s=''\r\n if(s1[len(s1)-1]>s1[len(s1)-2]):\r\n for i in range(len(s1)-1):\r\n s=s+s1[i]\r\n else:\r\n for i in range(len(s1)-2):\r\n s=s+s1[i]\r\n s=s+s1[len(s1)-1]\r\n x=int(s)\r\n print(x)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 8 23:25:28 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\na = int(input())\r\nif a > 0:\r\n print(a)\r\nelse:\r\n if str(a)[-1] > str(a)[-2]:\r\n print(int(str(a)[:-1]))\r\n else:\r\n print(int(str(a)[:-2] + str(a)[-1]))", "n = int(input())\r\nif n > 0 :\r\n print (n)\r\nelif n < 0:\r\n n = abs (n)\r\n last = - (n // 10)\r\n plast = - ((n//100 * 10) + n % 10)\r\n print (max(last,plast))", "\r\nimport math as mth\r\nimport sys\r\n#input=sys.stdin.readline\r\n\r\n\r\n\r\ndef solve():\r\n \r\n n=str(input())\r\n if n[0]!=\"-\":\r\n print(n)\r\n return\r\n nn=int(n)\r\n #n,m=list(map(int,input().split()))\r\n #f=list(map(int,input().split()))\r\n m=n[:len(n)-2] + n[len(n)-1:]\r\n mm = n[:-1]\r\n if int(m)>int(mm):\r\n print(int(m))\r\n return\r\n print(int(mm))\r\n return\r\n\r\ndef main():\r\n #for _ in range(int(input())):\r\n solve()\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# Read the input value n\r\nn = int(input())\r\n\r\n# Convert n to a string to easily manipulate its digits\r\nn_str = str(n)\r\n\r\n# Initialize a variable to store the maximum balance\r\nmax_balance = n\r\n\r\n# Try two possibilities:\r\n# 1. Remove the last digit (rightmost) from n_str and convert it back to an integer\r\nn_minus_last = int(n_str[:-1])\r\nmax_balance = max(max_balance, n_minus_last)\r\n\r\n# 2. Remove the second to last digit from n_str (if it has at least 2 digits)\r\nif len(n_str) > 1:\r\n n_minus_second_last = int(n_str[:-2] + n_str[-1])\r\n max_balance = max(max_balance, n_minus_second_last)\r\n\r\n# Print the maximum balance\r\nprint(max_balance)", "n = input()\n\nif int(n) < 0:\n if len(n) > 2:\n x = min(n[-2:])\n o = n[:-2]+x\n print(0 if o == \"-0\" else o)\n \n\n\n\n elif len(n) < 2:\n print(0)\nelse:\n print(n)", "n=int(input())\r\nif n<0:\r\n if -1>=n>=-9:\r\n n=0\r\n elif n==10:\r\n n=0\r\n else:\r\n n=abs(n)\r\n prev=n//10%10\r\n last=n%10\r\n if last>prev or (prev==0 and last==0):\r\n n//=10\r\n else:\r\n n//=100\r\n n=n*10+last\r\n if n>0:\r\n n*=-1\r\nprint(n)", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n if n > 0:\n print(n)\n return\n n = str(n)\n print(int(n[:-1]) if n[-1] > n[-2] else int(n[:-2] + n[-1]))\n\n\nif __name__ == \"__main__\":\n main()\n", "n=list(input())\r\nif int(''.join(n))<0:\r\n if n[-2].isnumeric() and n[-1].isnumeric():\r\n if int(n[-1])>int(n[-2]):\r\n n.pop(-1)\r\n else:\r\n n.pop(-2)\r\nprint(int(''.join(n)))\r\n", "n=input()\r\ntemp1=n[:len(n)-1]\r\ntemp2=n[:len(n)-2]+n[len(n)-1]\r\n# print(n)\r\n# print(temp1)\r\n# print(temp2)\r\nprint(max(int(n),int(temp1),int(temp2)))", "balance=int(input())\r\nif(balance>=0):\r\n print(balance)\r\nelse:\r\n last_digit_deleted=int(str(balance)[:len(str(balance))-1:])\r\n second_last_digit_deleted=int(str(balance)[:len(str(balance))-2:]+str(balance)[len(str(balance))-1])\r\n print(max(last_digit_deleted,second_last_digit_deleted))", "x = int(input())\nif x >= 0:\n print(x)\nelse:\n y = -x\n y0 = x\n y1 = -(int(y/10))\n y2 =-((int((y/100)))*10+y%10)\n l = [y0,y1,y2]\n l1 = max(l)\n print(l1)", "n = input()\na = int(n)\nb = int(n[:-1])\nc = int(n[:-2] + n[-1])\nprint(max(a,b,c))\n", "n = input()\r\n\r\nprint(max(int(n), int(n[:-1]), int(n[:-2] + n[-1])))", "n1= input()\r\nif int(n1) >= 0:\r\n print(n1)\r\nelse:\r\n r1= int(n1[:-1])\r\n \r\n r2 = int(n1[:-2] + n1[-1])\r\n \r\n print(max(r1, r2))\r\n", "# https://codeforces.com/problemset/problem/313/A\r\n\r\nn = int(input())\r\n\r\nif n > 0:\r\n print(n)\r\n exit()\r\n\r\ns = str(n)\r\n\r\nif int(s[:-1]) > int((s[:-2] + s[len(s)-1:])):\r\n print(int(s[:-1]))\r\nelse:\r\n print(int((s[:-2] + s[len(s)-1:])))\r\n", "n = int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n nabs = abs(n)\r\n no_last = nabs//10\r\n no_lastone = nabs//100 * 10 + nabs%10\r\n print(- min(no_last,no_lastone))", "num = int(input())\r\nif num>=0:\r\n print(num)\r\nelse:\r\n x = -num//100\r\n print(-10*x-min((-num-100*x)%10, (-num-100*x)//10))", "bank = input()\r\nif bank[0] == \"-\":\r\n if bank[-1] >= bank[-2]:\r\n a = bank[0:-1]\r\n if a == \"-0\":\r\n print(0)\r\n else:\r\n print(a)\r\n else:\r\n b = bank[0:-2]+bank[-1]\r\n if b == \"-0\":\r\n print(0)\r\n else:\r\n print(b)\r\nelse:\r\n print(bank)", "# testcase = int(input())\n\n# while(testcase > 0):\n \n# testcase = testcase-1\n\n\nstring = input()\nif(int(string) < 0):\n stringfile = list(string)\n astringfile = list(string)\n stringfile.pop()\n astringfile.pop(len(stringfile)-1)\n a = ''.join(stringfile)\n b = ''.join(astringfile)\n if(int(a)>int(b)):\n if(int(a) == 0):\n print(0)\n else:\n print(a)\n else:\n if(int(b) == 0):\n print(0)\n else:\n print(b)\nelse:\n print(string)", "n=input()\r\nif (int(n)>0):\r\n print(n)\r\nelse:\r\n n1=int(str(n[:-1]))\r\n \r\n n2= int(str(n[:-2]+n[-1]))\r\n \r\n if (int(n1>n2)):\r\n print(n1)\r\n else:\r\n print(n2)\r\n ", "class BanckAccount:\r\n\r\n def __init__(self, schet):\r\n self.schet = schet\r\n\r\n def proverka(self):\r\n if int(self.schet) < 0:\r\n if int(self.schet[-1]) >= int(self.schet[-2]):\r\n self.schet = self.schet[:-1]\r\n else:\r\n self.schet = self.schet[:-2] + self.schet[-1]\r\n if self.schet == '-0':\r\n self.schet = self.schet[1:]\r\n print(self.schet)\r\n\r\nilya = BanckAccount(input())\r\nilya.proverka()", "a=input()\r\nif a[0]!='-':\r\n print(int(a))\r\nelse:\r\n b=[]\r\n for i in a:\r\n b.append(i)\r\n c=[]\r\n for j in a:\r\n c.append(j)\r\n del b[-1]\r\n del c[-2]\r\n d=''\r\n e=''\r\n for k in b:\r\n d+=k\r\n for l in c:\r\n e+=l\r\n if int(d)>int(e):\r\n print(int(d))\r\n else:\r\n print(int(e))", "n=int(input())\r\nif n>0:\r\n print(n)\r\nelif n<0:\r\n a=(str(n)[:len(str(n))-1])\r\n b=(str(n)[:len(str(n))-2]) + str(n)[len(str(n))-1:]\r\n if a>=b:\r\n print(int(b))\r\n elif b>a:\r\n print(int(a))", "v1=input()\r\nif int(v1)>0:\r\n print(v1)\r\nelse:\r\n w=int(v1[-1])\r\n w1=int(v1[-2])\r\n w2=min(w,w1)\r\n v2=list(v1)\r\n v2.pop()\r\n v2.pop()\r\n v2.append(str(w2))\r\n v4=\"\".join(v2)\r\n if v4==\"-0\":\r\n print(0)\r\n else:\r\n print(v4) ", "n = int(input())\r\nif n>0:\r\n print(n)\r\nelse:\r\n s = str(n)\r\n if int(s[:-1])>int(s[:-2]+s[-1]):\r\n print(int(s[:-1]))\r\n else:\r\n print(int(s[:-2]+s[-1]))\r\n", "n = int(input())\r\nst = str(n)\r\nm = int(st[:len(st)-1])\r\np = int(st[:len(st)-2]+st[len(st)-1:])\r\n\r\nprint(max(n,m,p))", "x=int(input())\r\nif x>=0:\r\n print(x)\r\nelse:\r\n\r\n s=str(x)\r\n x1=int(s[:-1])\r\n s=s[:-2]+s[-1]\r\n x2=int(s)\r\n if x2>x1:\r\n print(x2)\r\n else:\r\n print(x1)", "n=int(input())\r\nif n<0:\r\n num=-n\r\n n1=num//10\r\n n2=int(str(num)[0:-2]+str(num)[-1])\r\n if n1<n2:\r\n print(-n1)\r\n else:\r\n print(-n2)\r\nelse:\r\n print(n)", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\ns=input()\r\nif s[0]!='-':print(s)\r\nelse:\r\n print(max(int(s[:-1]),int(s[:-2]+s[-1])))\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>= 0:\r\n print(n)\r\nelse:\r\n s = str(n)\r\n print(max(int(s[:-1]), int(s[:-2] + s[-1])))", "x=input()\r\nif int(x)<0:\r\n if x[-1]>x[-2]:\r\n x=x[:-1]\r\n print(int(x))\r\n else:\r\n x=x[:-2]+x[-1]\r\n print(int(x))\r\nelse:\r\n print(int(x))\r\n", "def maximize_money(current_state):\r\n a = int(current_state[:-1])\r\n b = int(current_state[:len(current_state)-2] + current_state[-1])\r\n if a > b:\r\n return a\r\n else:\r\n return b\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n current_state = input()\r\n n = int(current_state)\r\n if n < 0:\r\n print(maximize_money(current_state))\r\n else:\r\n print(n)", "a = input()\r\nif a[0] == '-':\r\n if a[-1]>a[-2]:\r\n print(int(a[0:-1]))\r\n else:\r\n print(int(a[0:-2]+a[-1]))\r\nelse:\r\n print(int(a))\r\n", "n=input()\r\n\r\n# del last\r\nlast=n[:-1]\r\n# del second last\r\nsecond=n[:-2]+n[-1]\r\n\r\nprint(max(int(n), int(last), int(second)))\r\n", "n = int(input())\r\ns = str(n)\r\n\r\n\r\na = int(s[0:-1])\r\nz = s[0:-2]\r\nb = int(z + s[-1])\r\nprint(max(n,a,b))\r\n", "# https://codeforces.com/problemset/problem/313/A\r\ndebt = input(\"\")\r\n\r\nif int(debt) < 0:\r\n remove_last = debt[:len(debt)-1]\r\n remove_before_last = debt[:len(debt)-2] + debt[-1]\r\n\r\n if remove_before_last > remove_last:\r\n debt = remove_last\r\n else:\r\n debt = remove_before_last\r\n\r\nprint(int(debt))", "def Ilya_Bank_Account(num):\r\n if num >= 0 :\r\n return num\r\n last_digit = int(str(num)[:-1])\r\n digit_before_last = int(str(num)[:-2] + str(num)[-1])\r\n return max(last_digit , digit_before_last)\r\n\r\nif __name__ == \"__main__\" :\r\n num = int(input())\r\n print(Ilya_Bank_Account(num))", "def delete(string, index):\r\n st = list(string)\r\n del st[index]\r\n ss = ''\r\n for i in st:\r\n ss += i\r\n return ss\r\ns = input()\r\nif s[0] != '-': pass\r\nelse:\r\n if s[-1] > s[-2]: s = delete(s, -1)\r\n else: s = delete(s, -2)\r\nif s[0] == '-' and s[1] == '0': print(0)\r\nelse: print(s)", "import sys\r\nn = int(sys.stdin.readline())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n = list(str(n))\r\n x = n.copy()\r\n n.pop(-1)\r\n x.pop(-2)\r\n print(max(int(\"\".join(x)),int(\"\".join(n))))", "n = input()\r\nm = int(n)\r\nif m>=0:\r\n print(m)\r\nelse:\r\n a = int(n[:-1])\r\n b = int(n[:-2]+n[-1])\r\n print(a if int(a)>int(b) else b)\r\n", "n=int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n a=abs(n)\r\n b=a//10\r\n c=(a//100)*10+(a%10)\r\n if b>c:\r\n print(-1*c)\r\n else:\r\n print(-1*b)\r\n", "b=input()\r\nif int(b)>0:\r\n print(b)\r\nelse:\r\n if int(b[-1])>int(b[-2]):\r\n b=b[:-1]\r\n print(b)\r\n\r\n else:\r\n a=b[:-2]+b[-1]\r\n print(int(a))", "n=int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n a=str(n)\r\n b=a[0:len(a)-1]\r\n c=a[0:len(a)-2]+a[len(a)-1]\r\n x=int(b)\r\n y=int(c)\r\n if x>y:\r\n print(x)\r\n else:\r\n print(y)", "n = int(input())\r\n\r\n# Convert the number to a positive integer to process the digits\r\npositive_n = abs(n)\r\n\r\n# Calculate the possible account balances after removing the last digit\r\nbalance1 = positive_n // 10\r\n\r\n# Calculate the possible account balances after removing the second-to-last digit\r\nbalance2 = (positive_n // 100 * 10) + (positive_n % 10)\r\n\r\n# Choose the maximum of the calculated balances\r\nresult = max(n, -balance1, -balance2)\r\n\r\nprint(result)\r\n", "n = int(input())\r\n\r\nn_str = str(n)\r\n\r\n\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n last_digit_removed = int(n_str[:-1])\r\n second_last_digit_removed = int(n_str[:-2] + n_str[-1])\r\n print(max(last_digit_removed, second_last_digit_removed))\r\n", "n=int(input())\r\nif n<0:\r\n a=str(n)\r\n l=list(a)\r\n if l[-1]>l[-2]:\r\n l.pop(-1)\r\n if len(l)==2 and l[1]==0:\r\n l.pop(0)\r\n else:\r\n l.pop(-2)\r\n if len(l)==2 and l[1]==\"0\":\r\n l.pop(0)\r\n print(\"\".join(str(e) for e in l))\r\nelse:\r\n print(n)", "n=input()\r\nprint(max(map(int,(n,n[:-1],n[:-2]+n[-1]))))", "def m(n):\r\n if n >= 0:\r\n return n\r\n n = abs(n)\r\n l = n % 10\r\n q = (n // 10) % 10\r\n if l >= q:\r\n return -1 * (n // 10)\r\n else:\r\n return -1 * (n // 100 * 10 + l)\r\nn = int(input())\r\nprint(m(n))", "import sys\ninput = sys.stdin.readline\n\nbank = int(input())\n \nif bank > 0:\n print(bank)\nelse:\n bank *= -1\n print(min(bank//10, (bank//100 * 10) + bank%10) * -1)", "def solution(n:str) -> int:\r\n if int(n)>0:\r\n return n\r\n temp=int(n[:-2]+n[-1])\r\n n=int(n[:-1])\r\n return temp if temp>n else n\r\n\r\nprint(solution(input()))", "p = int(input())\nif p<0:\n l = str(p)\n n = int(l[:-1])\n m = -1000000000000\n if l[-2] != \"-\":\n m = int(l[0:-2]+l[-1])\n if n>m:\n p = n\n else:\n p = m\nprint(p)\n", "n = int(input())\r\nk = str(n)\r\nif n>=0:\r\n print(n)\r\nelse:\r\n print(max(int(k[:len(k)-1]),int(k[:len(k)-2]+k[len(k)-1])))", "a = int(input())\r\nc=0\r\ns=0\r\nx=0\r\nd=str(a)\r\nif a>0:\r\n print(a)\r\nelse:\r\n a=a-a-a\r\n if a%10>a//10%10: \r\n if a//10==0:\r\n print(0)\r\n else:\r\n print(-(a//10))\r\n else:\r\n if len(d)>=3:\r\n f=a\r\n print(-(a//100*10+f%10))\r\n else:\r\n print(-(a//10))", "n = int(input())\r\nif n >=0:\r\n print(n)\r\nelse:\r\n s = str(n)\r\n d = [int(s[:-1]),n,int(s[:-2] + s[-1])]\r\n print(max(d))\r\n", "n=int(input())\r\nif n>=0:\r\n\tprint(n)\r\nelif n<0:\r\n\tstring=str(n)\r\n\tstring2=str(n)\r\n\tsta=list(string)\r\n\tst2a=list(string2)\r\n\tdel sta[-1]\r\n\tdel st2a[-2]\r\n\tsn=int(''.join(sta))\r\n\tsn2=int(''.join(st2a))\r\n\tif sn>sn2:\r\n\t\tprint(sn)\r\n\telse:\r\n\t\tprint(sn2)", "string = input()\r\nif int(string) < 0:\r\n if int(string[len(string)-1]) > int(string[len(string)-2]):\r\n index = len(string)-1\r\n string = string[:index] + string[index:].replace(string[index], '', 1)\r\n else:\r\n index = len(string) - 2\r\n string = string[:index] + string[index:].replace(string[index], '', 1)\r\n if int(string) == 0:\r\n print(0)\r\n else:\r\n print(string)\r\nelse:\r\n print(string)\r\n", "n = input()\r\nif int(n) >= 0:\r\n print(n)\r\nelse:\r\n if len(n) == 2:\r\n print(n)\r\n elif int(n[-1]) >= int(n[-2]):\r\n print(int(n[:len(n)-1]))\r\n else:\r\n print(int(n[:len(n)-2] + n[len(n)-1:]))\r\n\r\n", "t=input()\r\nprint(t if int(t)>0 else max(int(t[:len(t)-1]),int(t[:len(t)-2]+t[-1])))", "num=int(input())\nif num<0:\n num1=int(str(num)[:-1])\n num2=int(str(num)[:-2]+str(num)[-1])\n if num1>num2:\n print(num1)\n else:\n print(num2)\nelse:\n print(num)\n", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n = str(n)\r\n if int(n[-1]) > int(n[-2]):\r\n print(int(n[:-1]))\r\n else:\r\n print(int(n[:-2] + n[-1]))\r\n", "n=(input())\r\nb=\"\"\r\nc=\"\"\r\nif int(n)>=0:\r\n print(n)\r\nelse:\r\n b=n[0:len(n)-1]\r\n c=n[0:len(n)-2]+n[len(n)-1]\r\n if int(b)<int(c) :\r\n print(int(c))\r\n else:\r\n print(int(b))", "n = int(input())\r\nif n < 0:\r\n n = -n\r\n n = -min(n // 10, n // 100 * 10 + n % 10)\r\nprint(n)\r\n", "n = input()\r\nif int(n) < 0:\r\n last = n[:len(n)-1]\r\n secondlast = n[:len(n)-2] + n[len(n)-1: ]\r\n if int(last) > int(secondlast):\r\n print(int(last))\r\n\r\n else:\r\n print(int(secondlast))\r\nelse:\r\n print(n)", "s=[x for x in input()]\r\nif s[0]=='-':\r\n if int(s[-1])>int(s[-2]):\r\n s.pop(-1)\r\n \r\n else:\r\n s.pop(-2)\r\nl=''\r\nfor i in s:\r\n l=l+i\r\n \r\nif int(l)==0:\r\n print(0)\r\nelse:\r\n print(l)\r\n", "a = input()\r\nif int(a) < 0:\r\n\tprint(max(int(a[:-1]),int(a[:-2]+a[-1])))\r\nelse:\r\n\tprint(a)", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n = list(str(n))\r\n n.pop(0)\r\n n = [int(i) for i in n]\r\n if n[len(n) - 1] > n[len(n) - 2]:\r\n n.pop(len(n) - 1)\r\n elif n[len(n) - 2] > n[len(n) - 1]:\r\n n.pop(len(n) - 2)\r\n else:\r\n n.pop(len(n) - 2)\r\n n.insert(0, '-')\r\n n = [str(i) for i in n]\r\n n = ''.join(n)\r\n if n == '-0':\r\n print(0)\r\n else:\r\n print(n)", "n = input()\r\nif(n[0] != '-'):\r\n print(n)\r\nelse:\r\n m = len(n)\r\n a = n[1:m-1]\r\n b = n[1:m-2] + n[m-1]\r\n print(-int(min(a,b)))", "bal=int(input())\r\nif bal>=0:\r\n print(bal)\r\nelse:\r\n balstr=str(bal)\r\n l=len(balstr)\r\n if(l>=3):\r\n e1=balstr[1:-1]\r\n e2=balstr[1:-2]+balstr[-1:]\r\n if int(e1)>int(e2) and e2==0:\r\n print(e2)\r\n elif int(e1)>int(e2) and e2!=0:\r\n print(-int(e2))\r\n else:\r\n print(-int(e1))\r\n else:\r\n print(0)\r\n\r\n", "s=input()\r\nif s[0]!='-':\r\n print(s)\r\nelse:\r\n c=max(s[-2],s[-1])\r\n v=min(s[-2],s[-1])\r\n if len(s)==3 and v=='0':\r\n print(0)\r\n elif c==s[-1]:\r\n print(s[:-1])\r\n else:\r\n s=s[:-2]+s[-1]\r\n print(s)", "n=input()\r\nif int(n)<0:\r\n if int(n[-1])>int(n[-2]):\r\n n=n[:-1]\r\n else:\r\n n=n[:-2]+n[-1]\r\n print(int(n))\r\nelse:\r\n print(n)", "n=int(input())\r\nk=\"\"\r\nif n>0:\r\n print(n)\r\nelse:\r\n s=str(n)\r\n s1=s[:]\r\n str1=s1[:len(s1)-1]\r\n str2=s1[:len(s1)-2]+s1[len(s1)-1]\r\n n1=int(str1)\r\n n2=int(str2)\r\n if n1<n2:\r\n print(n2)\r\n else:\r\n k=k+str(n1)\r\n print(k)\r\n ", "p=input()\r\nif p[0]==\"-\":\r\n if int(p[-1])<int(p[-2]):\r\n print(int(p[:-2]+p[-1]))\r\n else:\r\n print(int(p[:-1]))\r\nelse:\r\n print(int(p))", "balance = input()\r\nif int(balance) < 0:\r\n x1 = int(balance[:-1])\r\n x2 = int(balance[:-2] + balance[-1])\r\n if x1 > x2:\r\n balance = x1\r\n else:\r\n balance = x2\r\n\r\nprint(balance)", "n = int(input()) \r\n\r\n\r\nif n < 0:\r\n a = n / 10\r\n x = int(a)\r\n b = str(a)\r\n c = int(b[-1])\r\n y = int(int(n / 100) *10 ) - c\r\n\r\n\r\n \r\n \r\n\r\n print(max(x,y))\r\n \r\nelse:\r\n print(n)\r\n\r\n", "n = int(input())\r\nif n >=0:\r\n print(n)\r\nelse:\r\n x = str(n)\r\n x1 = int(x[:-1])\r\n x2 = int(x[:-2]+x[-1])\r\n print(max(x1,x2))", "n = int(input())\r\nif n < 0:\r\n n = abs(n)\r\n x = n % 10\r\n y = (n // 10) % 10\r\n print(0 - (n // 100 * 10 + min(x, y)))\r\nelse:\r\n print(n)", "st=input()\r\nn=int(st)\r\nif(n>=0):\r\n print(n);\r\nelse:\r\n num=n*-1\r\n st1=st[0:len(st)-1]\r\n num1=int(st1)\r\n st2=st[0:len(st)-2]+st[len(st)-1]\r\n num2=int(st2)\r\n if(num1<num2):\r\n print(num2)\r\n else:\r\n print(num1)\r\n ", "n=int(input())\r\nif n>0:\r\n print(n)\r\nelse:\r\n n=str(n)\r\n l_num_remove=int(n[:len(n)-1])\r\n num_before_l_remove=int(n[:len(n)-2]+n[len(n)-1])\r\n print(max(l_num_remove,num_before_l_remove))", "# Read the state of Ilya's bank account\r\nn = int(input())\r\n\r\n# If n is positive, the maximum state is n itself\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n # Convert n to positive to simplify calculations\r\n n = -n\r\n \r\n # Remove the last digit\r\n without_last_digit = n // 10\r\n \r\n # Remove the second to last digit\r\n without_second_last_digit = (n // 100) * 10 + n % 10\r\n \r\n # Choose the larger option\r\n print(-min(without_last_digit, without_second_last_digit))\r\n", "\nbank_bal = input()\nlen_bal = len(bank_bal)\n\n\nprint(max(int(bank_bal), int(bank_bal[:len_bal - 2] + bank_bal[len_bal - 1]), int(bank_bal[:len_bal - 1])))", "t=int(input())\r\nif t<0:print(max(-(-t//10),-(int(str(-t//100)+str(-t%10)))))\r\nelse:print(t)", "num = input()\nprint(max(map(int, (num, num[:-1], (num[:-2] + num[-1])))))\n\n", "state = str(input())\r\nlista = [num for num in state]\r\n\r\n# Cópias da lista inicial\r\nlista_penultimo = lista[:]\r\nlista_ultimo = lista[:]\r\n\r\nif '-' in lista:\r\n lista_penultimo.pop(-2)\r\n lista_ultimo.pop(-1)\r\n\r\n lista_penultimo = int(''.join(lista_penultimo))\r\n lista_ultimo = int(''.join(lista_ultimo))\r\n\r\n print(max(lista_penultimo, lista_ultimo))\r\n\r\nelse:\r\n print(state)", "n = int(input())\r\nn_str = str(n)\r\n\r\n# Remove the last digit and check if the remaining number is greater than or equal to the original number\r\nmax_account = int(n_str[:-1])\r\nif max_account >= n:\r\n n = max_account\r\n\r\n# Remove the digit before last and check if the remaining number is greater than or equal to the original number\r\nmax_account = int(n_str[:-2] + n_str[-1])\r\nif max_account >= n:\r\n n = max_account\r\n\r\nprint(n)\r\n", "# Read the state of Ilya's bank account\r\nn = int(input())\r\n\r\n# Find the maximum state by considering the different cases\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n str_n = str(n)\r\n without_last_digit = int(str_n[:-1])\r\n without_second_last_digit = int(str_n[:-2] + str_n[-1])\r\n print(max(without_last_digit, without_second_last_digit))\r\n", "balance = input('')\r\nif int(balance) < 0:\r\n if int(balance[-1]) > int(balance[-2]):\r\n balance = balance[:-1]\r\n else:\r\n balance = balance[:-2] + balance[-1:]\r\nprint(int(balance))\r\n", "n=int(input())\r\nn1=len(str(n))\r\na=str(n)[:n1-2]+str(n)[n1-1]\r\nb=str(n)[:n1-1]\r\nprint(max(n,int(a),int(b)))", "n = input()\r\nif n[0] == '-':\r\n a = int(n[-1])\r\n b = int(n[-2])\r\n n = n[:-2]\r\n if a<b:\r\n n = n+ str(a)\r\n else:\r\n n = n + str(b)\r\nprint(int(n))\r\n ", "def maximize_bank_account(n):\r\n # Convert the number to a string for easier manipulation\r\n n_str = str(n)\r\n # Check if the number is non-negative\r\n if n >= 0:\r\n # Return the original number\r\n return n\r\n else:\r\n # Try removing the last digit or the digit before last\r\n # and return the maximum of the two results\r\n return max(int(n_str[:-1]), int(n_str[:-2] + n_str[-1]))\r\n\r\n# Read the input\r\nn = int(input())\r\n\r\n# Calculate and print the maximum state of the bank account\r\nresult = maximize_bank_account(n)\r\nprint(result)\r\n", "n=int(input())\r\ns=str(abs(n))\r\nif n>=-9:\r\n print(n)\r\nelif len(s)==2:\r\n if int(s[0])>=int(s[1]):\r\n if s[1]=='0':\r\n print(0)\r\n else:\r\n print('-'+s[1])\r\n else:\r\n print('-'+s[0])\r\nelse:\r\n a=s[:len(s)-1]\r\n b=s[:len(s)-2]+s[-1]\r\n print('-'+str(min(int(a),int(b))))", "s = input()\r\n \r\nif int(s) > 0:\r\n print(s)\r\nelif int(s[:-1]) > int(s[:-2] + s[-1]):\r\n print(int(s[:-1]))\r\nelse:\r\n print(int(s[:-2] + s[-1]))", "x=input()\r\nprint(max(int(x[:len(x)-1]),int(x[:len(x)-2]+x[len(x)-1]),int(x)))", "n=int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n n=-n\r\n a=n%100\r\n n=n-a\r\n n=n//10\r\n if (a%10)<(a//10):\r\n n=n+(a%10)\r\n else:\r\n n=n+(a//10)\r\n n=-n\r\n print(n)\r\n", "n = input()\r\n\r\nif int(n) >= 0:\r\n \r\n print(n)\r\nelse:\r\n \r\n remove_last = int(n[:-1])\r\n \r\n remove_before_last = int(n[:-2] + n[-1])\r\n \r\n print(max(remove_last, remove_before_last))\r\n", "n = input()\r\nbe_last_digit = n[:-2] + n[-1]\r\nlast_digit = n[:-1]\r\nprint(max(int(n) , int(be_last_digit), int(last_digit)))", "n = int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n n=str(n)\r\n a=n[:len(n)-1]\r\n b=n[:len(n)-2]+n[-1]\r\n a=int(a)\r\n b=int(b)\r\n if a > b:\r\n print(a)\r\n else:\r\n print(b)", "chet = input()\r\nchet_int=int(chet)\r\nchet1 = list(chet)\r\nchet2 = list(chet)\r\nchet1.pop(-1)\r\nchet2.pop(-2)\r\n\r\nchet1 = ''.join(chet1)\r\nchet2 = ''.join(chet2)\r\nchet1_int = int(chet1)\r\nchet2_int = int(chet2)\r\n\r\nif (chet1_int < chet_int) or (chet2_int < chet_int):\r\n print(chet)\r\nelse: \r\n if chet2_int < chet1_int:\r\n print(chet1_int)\r\n else:\r\n print(chet2_int)", "num = input()\r\nif int(num) >= 0:\r\n print(num)\r\nif int(num) < 0:\r\n if num[-1] >= num[-2]:\r\n newnum = (int(num) + int(num[-1]))/10\r\n print(int(newnum))\r\n else:\r\n newnum = (int(num) + int(num[-2])*10)\r\n k = num [-1]\r\n newnum = (int(newnum) + int(k)) / 10\r\n newnum = int(newnum) - int(k)\r\n print(int(newnum))\r\n\r\n", "##t = int(input())\r\n##for i in range(t):\r\n## a = input()\r\n## a = a.lower()\r\n## if a == \"yes\":\r\n## print('YES')\r\n## else:\r\n## print('NO')\r\n## \r\n\r\nn = int(input())\r\nmx = n\r\nw = str(n)\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n q = int(w[:-1:])\r\n if mx < q:\r\n mx = q\r\n z = int(w[:-2:] + w[-1])\r\n if mx < z:\r\n mx = z\r\n print(mx)\r\n", "n = input()\r\nif int(n) >= 0:\r\n ans = n\r\nelse:\r\n x = min(n[-1],n[-2])\r\n ans = n[0:len(n)-2] + x\r\nprint(int(ans))", "n = input()\r\nn1 = int(n[0:-1])\r\nn2 = int(n[0:-2]+n[-1])\r\nprint(max(int(n), n1, n2))\r\n", "n=int(input())\r\nif n<0:\r\n print(-min((-n)//10,((-n)//100)*10+(-n)%10))\r\nelse:\r\n print(n)", "n = input()\r\nif int(n)>0:\r\n print(n)\r\nelse:\r\n a = n[:-2]+(min(n[-1], n[-2]))\r\n if a!='-0':\r\n print(a)\r\n else:\r\n print(a[-1])", "n=input()\r\npos=int(n)\r\nif(pos>0):\r\n print(n)\r\nelse:\r\n mut=[ i for i in n ]\r\n last=mut[len(n)-1]\r\n blast=mut[len(n)-2]\r\n # print(min())\r\n ans=mut\r\n ans.pop()\r\n ans.pop()\r\n if(int(blast)>=int(last)):\r\n ans=ans+[last]\r\n else:\r\n ans=ans+[blast]\r\n if(ans[1]=='0'):\r\n ans.pop(0)\r\n \r\n print(\"\".join(map(str,ans)))", "inputt = input()\nbal = int(inputt)\nprint(bal if bal > 0 else max(int(inputt[:len(inputt) - 1]), int(inputt[:len(inputt) - 2] + inputt[-1])))\n \t\t \t \t \t \t\t \t\t\t \t\t\t\t\t \t \t\n\t\t \t \t\t \t \t \t \t \t \t", "s = input()\r\nif s[0] == '-':\r\n print(max(int(s[0:-1]),int(s[0:-2]+s[-1])))\r\nelse: print(int(s))", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n1 = int(str(n)[:-1])\r\n n2 = int(str(n)[:-2] + str(n)[-1])\r\n print(max(n1, n2))", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n = abs(n)\r\n last_digit = n % 10\r\n n = n // 10\r\n second_last_digit = n % 10\r\n n = n // 10\r\n if last_digit > second_last_digit:\r\n n = n * 10 + second_last_digit\r\n else:\r\n n = n * 10 + last_digit\r\n print(-n)\r\n", "def check(n):\r\n if int(n) >= 0:\r\n return n\r\n \r\n f = int(n[:-1])\r\n g = int(n[:-2] + n[-1])\r\n\r\n return f if f > g else g\r\n\r\n\r\n\r\ndef main():\r\n n = input()\r\n\r\n print(check(n))\r\n\r\nmain()", "def cal(n):\r\n num_str = str(n)\r\n if n < 0:\r\n n_after_rem_last = int(num_str[:-1])\r\n else:\r\n n_after_rem_last = n\r\n n_after_rem_bef_last = int(num_str[:-2]+num_str[-1])\r\n return max(n_after_rem_last, n_after_rem_bef_last)\r\nn = int(input())\r\nprint(cal(n))", "n=int(input())\r\nk=str(n)\r\nif n>=0:\r\n print(n)\r\nelse:\r\n p=k[1:len(k)-1]\r\n q=k[1:len(k)-2]+k[len(k)-1]\r\n r=int(p)*-1\r\n s=int(q)*-1\r\n print(max(r,s))\r\n ", "a=input()\r\nif int(a)>0:\r\n print(a)\r\nelse:\r\n a=list(a)\r\n b=list(a)\r\n a.pop(-1)\r\n b.pop(len(b)-2)\r\n a=''.join(a)\r\n b=''.join(b)\r\n print(max(int(a),int(b)))", "chir=input()\r\nabc=int(chir)\r\nif abc >= 0 : print(chir)\r\nelif abc >= -9 : print(0)\r\nelse : print(max(int(chir[:-1]), int(chir[:-2]+chir[-1])))\r\n", "def thetwo(amount):\n firstnum = amount//10\n lastdigit = amount%10\n amount = amount//10\n secondnum = amount-(amount%10)+lastdigit\n if firstnum < secondnum:\n return firstnum\n else:\n return secondnum\n\namount = int(input())\n\nif amount>0:\n print(amount)\nelif amount<=0 and amount >=-10:\n print(0)\nelif amount<-11:\n t = -1*thetwo(amount*(-1))\n print(t)\n\n\n\n\n \n\n\n", "n=int(input())\r\nif n>0:\r\n print(n)\r\nelse:\r\n n=abs(n)\r\n n1=(n-(n%10))/10\r\n n2=(n-n%100)/10+n%10\r\n n=-min(n1,n2)\r\n n=int(n)\r\n print(n)", "n= int(input())\nif n>=0:\n print(n)\nelse:\n n = abs(n)\n p= int(n/10)\n q= (int(n/100))*10 + (n%10)\n print(max(-p,-q))\n \t \t \t \t \t\t\t \t\t\t\t \t \t \t \t", "a=str(input())\r\nk=a[:len(a)-1:]\r\nm=k[:len(k)-1:]\r\nl=m+a[-1::]\r\na=int(a)\r\nif a>0:\r\n print(a)\r\nelif a<=0 and a>=-10:\r\n print(0)\r\nelse:\r\n print(max(int(l),int(k)))\r\n", "# https://codeforces.com/problemset/problem/313/A\r\n\r\ndef main():\r\n n = int(input())\r\n s = str(n)\r\n a = int(s[:-1])\r\n b = int(s[:-2] + s[-1])\r\n print(max(n, a, b))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x = int(input())\r\n\r\nif x > 0:\r\n print(x)\r\nelse:\r\n x = abs(x)\r\n a = -(x // 10)\r\n b = -(x // 100)*10 - (x % 10)\r\n print(max(a, b))\r\n\r\n\r\n\r\n", "n=int(input())\r\nif n<0:\r\n n=-1*n\r\n x=int(n%10)\r\n n=int(n/10)\r\n y=int(n%10)\r\n n=int(n/10)\r\n if x>y:\r\n n=n*10+y\r\n else:\r\n n=n*10+x\r\n n=-1*n\r\nprint(n)", "s=input()\r\nif s[0]==\"-\":\r\n s1=abs(int(s[:-1]))\r\n s2=abs(int(s[:-2]+s[-1]))\r\n m=min(s1,s2)\r\n print(-1*m)\r\nelse:\r\n print(s)", "\nind = int(input())\nif ind >= 0:\n print(ind)\nelse:\n num = str(ind).lstrip(\"-\")\n digit_list = list(num)\n if digit_list[-1] > digit_list[-2]:\n digit_list.pop(-1)\n else:\n digit_list.pop(-2)\n digit_list.insert(0, \"-\")\n val =\"\".join(map(str, digit_list))\n print(int(val))", "import sys\r\n\r\ndef read_str() -> str:\r\n return sys.stdin.readline().strip()\r\ndef write(value):\r\n sys.stdout.write(str(value))\r\n sys.stdout.write('\\n')\r\n sys.stdout.flush()\r\n\r\nn = read_str()\r\nl = n[-1]\r\nbl = n[-2]\r\n\r\nif bl!=\"0\" and int(bl)>int(l): \r\n ans = n[:-2] + n[-1]\r\nelse: ans = n[:-1]\r\n\r\nwrite(n) if int(n)>=0 else write(int(ans))", "n = int(input())\r\nx = str(n)\r\na = len(x)\r\nb = x[0:a - 1]\r\nc = x[0:a - 2] + x[a - 1:]\r\nif n >= 0:\r\n print(n)\r\nelif -100 < n < 0 and int(c) == 0:\r\n print('0')\r\nelif b < c:\r\n print(b)\r\nelse:\r\n print(c)", "balance = input()\r\nresult = 0\r\nif '-' in balance:\r\n if balance[-2]>=balance[-1]:\r\n result = balance[:-2]+balance[-1:]\r\n if result=='-0':\r\n print(0)\r\n else:\r\n print(result)\r\n else:\r\n result = balance[:-1]\r\n if result == '-0':\r\n print(0)\r\n else:\r\n print(result)\r\nelse:\r\n print(balance)", "inp = input()\r\nll = inp[:-1]\r\nsl = inp[:-2]+inp[-1]\r\n\r\nprint(max(int(inp), int(ll), int(sl)))", "def main():\r\n n = int(input())\r\n if n >= 0:\r\n print(n)\r\n else:\r\n n = -n\r\n n = str(n)\r\n\r\n ans = n[:len(n)-2]\r\n if n[-1] > n[-2]:\r\n ans += n[-2]\r\n else:\r\n ans += n[-1]\r\n if ans == \"0\":\r\n print(0)\r\n else:\r\n print('-'+ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "b = int(input())\r\nif b<0:\r\n b=str(b)\r\n if b[-1]>b[-2]:\r\n a = int(b[:-1])\r\n print(a)\r\n else:\r\n a = int(b[:-2]+b[-1])\r\n print(a)\r\nelse:\r\n print(b)", "n = input()\r\nif n[0] != '-':\r\n print(n)\r\nelse:\r\n c = min(n[-1],n[-2])\r\n if c == '0' and len(n) == 3:\r\n print(0)\r\n else:\r\n print(n[:-2]+min(n[-1],n[-2]))", "n=int(input())\r\nif n>= 0:\r\n print(n)\r\nelse:\r\n n=str(n)\r\n last_digit_removed = int(n[:len(n)-1])\r\n digit_before_last_removed = int(n[:len(n)-2] + n[len(n)-1])\r\n print(max(last_digit_removed,digit_before_last_removed))", "n = int(input())\r\nprint (max(n, -(-n//10), -(-n//100*10+(-n%10))))\r\n", "def check(n):\r\n if(n>0):\r\n return n\r\n s=str(n)\r\n s2=s[1::]\r\n a1,a2=int(s2[-1]),int(s2[-2])\r\n if(a1>=a2):\r\n s3=''\r\n for i in range(len(s2)-1):\r\n s3+=s2[i]\r\n result=int(s3)\r\n result*=-1\r\n if(result>n):return result\r\n else:return n\r\n else:\r\n s4=''\r\n for i in range(len(s2)):\r\n if(i!=len(s2)-2):\r\n s4+=s2[i]\r\n result=int(s4)\r\n result*=-1\r\n if(result>n):return result\r\n else:return n\r\nn=int(input())\r\nprint(check(n))", "n = int(input())\nif n >= 0:\n print(n)\nelif len(str(n)) == 1:\n print(0)\nelse:\n k = int((str(n)[:-2] + str(n)[-1]))\n # print(int(str(n)[:-1]), k)\n print(max(int(str(n)[:-1]), k))", "n = int(input())\r\n\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n a = int(str(n)[:-1])\r\n b = int(str(n)[:-2] + str(n)[-1])\r\n print(max(a, b))", "a=input()\r\nif int(a)>0:\r\n print(a)\r\n exit()\r\nelse:\r\n x=[]\r\n x.extend(a)\r\n if len(x)==3 and x[-1]=='0':\r\n print(0)\r\n else :\r\n if int(x[-1])>int(x[-2]):\r\n del x[-1]\r\n else:\r\n del x[-2]\r\n print(*x,sep='')", "n = int(input())\r\nns = str(n)\r\nif n <= 0:\r\n l = len(ns)\r\n N = ns[0:l-2]\r\n n1 = int(ns[-1])\r\n n2 = int(ns[-2])\r\n s = N+str(min(n1,n2))\r\nelse:\r\n s = ns\r\nif s == '-0':\r\n print(0)\r\nelse:\r\n print(s)", "from math import *\r\na=int(input())\r\nb=int(a/10)\r\nc=int(a/100)*10-abs(a)%10\r\nif a>=0:\r\n print(a)\r\nelse:\r\n print((c,b)[b>c])", "user= int(input())\r\n\r\nif user>0:\r\n print(user)\r\n\r\nelse:\r\n user2=list(str(-(user)))\r\n user3=list(str(-(user)))\r\n\r\n del user2[len(user2)-1]\r\n\r\n str1=\"\"\r\n for i in user2:\r\n str1=str1+i\r\n \r\n num1=int(str1)\r\n del user3[len(user3)-2]\r\n str2=\"\"\r\n for i in user3:\r\n str2=str2+i\r\n num2=int(str2)\r\n\r\n if num2<=0 or num1<=0:\r\n print(0)\r\n else:\r\n if num2<num1:\r\n print(-num2)\r\n elif num2==num1:\r\n print(-num1)\r\n else:\r\n print(-num1)\r\n", "a = int(input())\r\nb = ''\r\n\r\nif a > 0:\r\n print(a)\r\nelse:\r\n b = str(a)\r\n if int(b[-1]) > int(b[-2]):\r\n b = b[:-1]\r\n else:\r\n b = b[:-2] + b[-1]\r\n\r\nif b == '-0':\r\n print(0)\r\nelse:\r\n print(b)", "#313A Ilya and Bank Account\r\nn=int(input())\r\nif n<0:\r\n s=str(n)\r\n s1=s[1:-1]\r\n s2=s[1:-2]+s[-1]\r\n if int(s1)<=int(s2):\r\n print(int(s1)*-1)\r\n else:\r\n print(int(s2)*-1)\r\nelse:\r\n print(n)", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n num = list(str(n))\r\n k1 = num.copy()\r\n del k1[-1]\r\n k2 = num.copy()\r\n del k2[-2]\r\n if (int(\"\".join(k1))) > (int(\"\".join(k2))):\r\n print(int(\"\".join(k1)))\r\n else:\r\n print((int(\"\".join(k2))))\r\n", "def remove_max_digit(number):\r\n last_d = number[-1]\r\n blast_d = number[-2]\r\n number = number[:-2]\r\n\r\n if last_d > blast_d:\r\n number += blast_d\r\n else:\r\n number += last_d\r\n\r\n return number\r\n\r\nbalance = input()\r\n\r\nif int(balance) < 0:\r\n balance = remove_max_digit(balance)\r\n\r\nprint(int(balance))", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelif n < 0:\r\n a = str(n)[:-1]\r\n b = str(n)[:-2] + str(n)[-1]\r\n x = int(a); y = int(b)\r\n if x > y:\r\n print(x)\r\n else:\r\n print(y)", "n=int(input())\nif n>=0:\n print(n)\nelse:\n n=-1*n\n print(-1*min(n//10,n//100*10+n%10))\n \t \t \t \t\t \t\t\t\t \t \t\t\t \t \t\t \t \t", "balance = int(input())\r\n\r\nlastBal = int(balance / 10)\r\npreLastBalance = int(int((balance / 100)) * 10 - (-balance % 10))\r\n\r\n#print((-balance % 10))\r\n\r\n#print(lastBal)\r\n#print(preLastBalance)\r\n\r\nif balance < 0:\r\n if lastBal > preLastBalance:\r\n print(lastBal)\r\n else:\r\n print(preLastBalance)\r\n\r\nelse:\r\n print(balance)", "n = str(input())\n\nif int(n) < 0:\n if int(n[:-1]) < int(n[:-2] + n[-1]):\n print(int(n[:-2] + n[-1]))\n else:\n print(int(n[:-1]))\nelse:\n print(n)", "n = int(input())\r\nm = abs(n)\r\n\r\nchoice_1 = n\r\nchoice_2 = int((m - m % 10) // 10)\r\nchoice_3 = int((m - m % 100) // 10 + m % 10)\r\n\r\nif n < 0:\r\n print(max(choice_1, -choice_2, -choice_3))\r\nelse:\r\n print(max(choice_1, choice_2, choice_3))\r\n", "n = input()\r\nif int(n) >= 0:\r\n print(n)\r\nelse:\r\n n = list(n)\r\n if n[-1] > n[-2]:\r\n del n[-1]\r\n first = \"\".join(n)\r\n print(int(first))\r\n else:\r\n del n[-2]\r\n second = \"\".join(n)\r\n print(int(second))", "num=int(input())\nif num>=0:\n print(num)\nelse:\n x=str(num)\n if len(x)==2:\n print(0)\n elif len(x)==3 and (x[-1]==\"0\" or x[-2]==\"0\"):\n print(0)\n else:\n y=min(int(x[-1]),int(x[-2]))\n print(x[:-2]+str(y))", "n = int(input())\r\nn_str = str(n)\r\n# Initialize a variable to store the maximum balance\r\nmax_balance = n\r\n# 1. Remove the last digit (rightmost) from n_str and convert it back to an integer\r\nn_minus_last = int(n_str[:-1])\r\nmax_balance = max(max_balance, n_minus_last)\r\nif len(n_str) > 1:\r\n n_minus_second_last = int(n_str[:-2] + n_str[-1])\r\n max_balance = max(max_balance, n_minus_second_last)\r\n# Print the maximum balance\r\nprint(max_balance)", "n = int(input())\r\n\r\nif (n >= 0): print(n)\r\nelse:\r\n numb = str(n)\r\n if (int(numb[-1]) > int(numb[-2])): numb = numb[:len(numb)-1]\r\n else: numb = numb[:len(numb)-2] + numb[-1]\r\n print(int(numb))", "n=int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n cadena=str(n)\r\n lon=len(cadena)\r\n post=cadena[lon-1]\r\n pre=cadena[lon-2]\r\n if int(post)>=int(pre):\r\n nuevacadena=cadena[:lon-1] \r\n else:\r\n nuevacadena=cadena[:lon-2] + cadena[lon-1:]\r\n print(int(nuevacadena))", "n = int(input())\r\nif n>=10:\r\n print(n)\r\nelse:\r\n a = int(str(n)[:-1])\r\n b = int(str(n)[:-2]+str(n)[-1])\r\n print(max(a, b))\r\n ", "s=input()\r\nprint(max(int(s),int(s[:-1]),int(s[:-2]+s[-1])))\r\n", "\r\nn = int(input())\r\nif n >= 0: print(n)\r\nelif n > -10: print(0)\r\nelse:\r\n s = str(n)\r\n if s[-1] < s[-2]: print(int(s[:-2] + s[-1]))\r\n else: print(int(s[:-1]))", "n = int(input())\r\nst = str(n)\r\ns = \"\"\r\ne = \"\"\r\n\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n c = st[-1]\r\n for i in range(len(st)):\r\n s += st[i] \r\n s = s[:-1] \r\n integer = int(s)\r\n\r\n d = st[-2]\r\n for i in range(len(st)):\r\n e += st[i] \r\n e = e[:-2] + e[-1] \r\n integer2 = int(e)\r\n\r\n max_number = max(integer, integer2)\r\n print(max_number)\r\n", "n = int(input())\r\n\r\nfirstMethod = int(str(n)[:-1])\r\nsecondMethod = int(str(n)[:-2]+str(n)[-1:])\r\nif n > firstMethod:\r\n print(n)\r\nelif firstMethod > secondMethod:\r\n print(firstMethod)\r\nelse:\r\n print(secondMethod)", "balance = input()\r\n\r\nbalance_1 = balance[:-1]\r\nbalance_2 = balance[:-2] + balance[-1]\r\n\r\nprint(max(int(balance), int(balance_1), int(balance_2)))", "s = input()\r\nprint(max(int(s), int(s[:-1]), int(s[:-2] + s[-1])))", "n = input()\r\n\r\nif n >= \"0\":\r\n print(int(n))\r\nelse:\r\n last_digit_removed = int(n[:-1])\r\n second_last_digit_removed = int(n[:-2] + n[-1])\r\n print(max(last_digit_removed, second_last_digit_removed))", "n = int(input())\r\nif n > 0:\r\n print(n)\r\nelse:\r\n n *= -1\r\n s = str(n)\r\n a = s[:-1]\r\n z = s[len(s)-1]\r\n b = s[0:len(s)-2] + z\r\n print(-1*min(int(a),int(b)))", "n=int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n n=str(n)\r\n m=int(n[:len(n)-1])\r\n k=int(n[:len(n)-2]+n[-1])\r\n if m>k:\r\n print(m)\r\n else:\r\n print(k)", "n = int(input())\r\n\r\nnegative = n < 0\r\n\r\nif negative:\r\n n = abs(n)\r\n\r\nfirst = n // 10\r\nunits = n % 10\r\nsecond = (n // 100) * 10 + units\r\n\r\nif negative:\r\n print(max([n*-1, first*-1, second*-1]))\r\nelse:\r\n print(max([n, first, second]))", "n= int(input())\r\nif n>=0:\r\n print(n)\r\nelse:\r\n s=str(n)\r\n print(max(int(str(n)[:-1]),int(str(n)[:-2]+str(n)[-1:])))", "t=int(input())\r\nif(t>=0):\r\n print(t)\r\n \r\nelse:\r\n t=str(t)\r\n balance1=int(t[:-1])\r\n balance2=int(t[:-2] + t[-1])\r\n print(max(int(t),balance1,balance2))\r\n \r\n ", "n = int(input())\r\nif n > 0:\r\n print(n)\r\nelse:\r\n print(max(-(abs(n) // 10), - ((abs(n) // 100) * 10 + abs(n) % 10)))", "def stdInput(type):\r\n if type == \"TC\": # test case count\r\n return int(input())\r\n if type == \"SI\": # spaced integers\r\n return [int(i) for i in input().split()]\r\n if type == \"SS\": # spaced strings\r\n return [i for i in input().split()]\r\n if type == \"TCSI\": # needs test case count, spaced integers\r\n fin = []\r\n for _ in range(stdInput(\"TC\")):\r\n x = [int(i) for i in input().split()]\r\n fin.append(x)\r\n return fin\r\n if type == \"TCSS\": # needs test case count, spaced strings, gives string of each line\r\n fin = []\r\n for _ in range(stdInput(\"TC\")):\r\n x = [i for i in input().split()]\r\n fin.append(x)\r\n return fin\r\n if type == \"S\": # single string\r\n return input()\r\n if type == \"I\": # single integer\r\n return int(input())\r\n\r\n\r\nN = stdInput(\"I\")\r\n\r\n\r\ndef i(n):\r\n return int(n)\r\n\r\n\r\ndef RIS(s, index):\r\n if index+1 < 0 or index+1 >= len(s):\r\n return s\r\n part1 = s[:index+1]\r\n part2 = s[index + 2:]\r\n return part1 + part2\r\n\r\n\r\ndef NRIS(s, index):\r\n if index < 0 or index >= len(s):\r\n return s\r\n part1 = s[:index]\r\n part2 = s[index + 1:]\r\n return part1 + part2\r\n\r\n\r\ndef best(og):\r\n og = str(og)\r\n best = int(og)\r\n for j in range(len(og)-3, len(og)):\r\n r = RIS(og, j)\r\n if i(r) > best:\r\n best = int(r)\r\n return best\r\n\r\n\r\nprint(best(N))\r\n", "n = int(input())\r\n\r\n# Convert the integer to a string to easily manipulate its digits\r\nn_str = str(n)\r\n\r\n# If the account balance is positive or zero, keep it as is\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n # Remove the last digit\r\n without_last = int(n_str[:-1])\r\n \r\n # Remove the second-to-last digit\r\n without_second_last = int(n_str[:-2] + n_str[-1])\r\n \r\n # Choose the maximum between the original balance, without the last digit, and without the second-to-last digit\r\n print(max(n, without_last, without_second_last))\r\n", "\r\nn = int(input())\r\nif n >= 0 or n%10 == n:\r\n print(n)\r\nelse:\r\n if n%100 == n:\r\n a = int(str(n)[:-1])\r\n b = str(n)[-1]\r\n if a > b:\r\n print(a)\r\n else:\r\n print(b)\r\n else:\r\n val1 = int(str(n)[:-1])\r\n val2 = int(str(n)[:-2] + str(n)[-1])\r\n if val1 > val2:\r\n print(val1)\r\n else:\r\n print(val2)", "# CP Template 0.2\r\n# Author: Mehrab (@to0th_less)\r\n\r\nimport sys\r\nfrom math import gcd, sqrt\r\nfrom itertools import combinations, permutations\r\n\r\n# Constants\r\nINF = float('inf')\r\nMOD = 1000000007\r\n\r\n# Faster Input Shortcut\r\ndef read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef read_ints():\r\n return map(int, sys.stdin.readline().split())\r\n\r\ndef read_int_list():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n# Faster Output Shortcut\r\ndef print_yes_no(condition):\r\n print('YES' if condition else 'NO')\r\n\r\ndef print_array(arr, sep=' '):\r\n print(sep.join(map(str, arr)))\r\n\r\n# Main Function\r\ndef solve():\r\n n = read_int()\r\n if n < 0:\r\n n = list(str(n))\r\n if len(n)>1:\r\n l1 = int(n[-1])\r\n l2 = int(n[-2])\r\n if l2 > l1:\r\n n.pop(-2)\r\n else:\r\n n.pop(-1)\r\n else:\r\n n.pop()\r\n\r\n ans = ''\r\n for i in n:\r\n ans += i \r\n \r\n n = int(ans)\r\n\r\n print(n)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "def main(n):\r\n if n >= 0:\r\n return n\r\n \r\n a = ((-n) // 100) * 10 + (-n - ((-n) // 10) * 10)\r\n b = (-n) // 10\r\n\r\n return max(-a, -b)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input()) \r\n\r\n print(main(n))", "n = input()\r\nprint(max(map(int, (n, n[:-1], n[:-2]+n[-1]))))", "n = int(input())\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n n = -n\r\n n = min(n // 10, n // 100 * 10 + n % 10)\r\n print(-n)# 1698238580.1603565", "s = input()\r\nif s[0] == '-':\r\n if len(s) == 3 and s[-1] == '0':\r\n print(0)\r\n else:\r\n if s[-1] < s[-2]:\r\n print(s[:-2:] + s[-1])\r\n else:\r\n print(s[:-1])\r\nelse:\r\n print(s)", "import sys\r\nfrom typing import *\r\n\r\nMOD = 10**9 + 7\r\nMAX_INT = float('inf')\r\nMIN_INT = -float('inf')\r\n\r\n\r\ndef read_int() -> int:\r\n return int(sys.stdin.readline().strip())\r\ndef read_list() -> List[int]:\r\n return list(map(int, sys.stdin.readline().split()))\r\ndef read_str() -> str:\r\n return sys.stdin.readline().strip()\r\ndef write(value):\r\n sys.stdout.write(str(value))\r\n sys.stdout.write('\\n')\r\n sys.stdout.flush()\r\ndef write_array(arr: List[int]):\r\n write(' '.join(map(str, arr)))\r\n\r\nn = read_str()\r\nl = n[-1]\r\nbl = n[-2]\r\n\r\nif bl!=\"0\" and int(bl)>int(l): \r\n ans = n[:-2] + n[-1]\r\nelse: ans = n[:-1]\r\n\r\nwrite(n) if int(n)>=0 else write(int(ans))", "s = input()\r\nif int(s) > 0:\r\n print(s)\r\nelse:\r\n a = s[:len(s) - 1]\r\n b = s[:len(s) - 2] + s[len(s) - 1:]\r\n if int(a) > int(b):\r\n print(int(a))\r\n else:\r\n print(int(b))", "n = int(input())\r\n\r\nif n > 0 or n == 0:\r\n print(n)\r\nelse:\r\n n = abs(n)\r\n without_last = n // 10\r\n without_penult = (n // 100 * 10) + n % 10\r\n print( min(n, without_last, without_penult) * -1 )", "# Hamza nachid Template\r\nimport sys\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef read_int():\r\n return int(input().strip())\r\n\r\n\r\ndef read_int_list():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef read_int_set():\r\n return set(map(int, input().split()))\r\n\r\n\r\ndef read_string():\r\n return input().strip()\r\n\r\n\r\nn=read_int()\r\nif n >=0:\r\n print(n)\r\nelse:\r\n s=str(n)[1:]\r\n n=len(s)\r\n s1=s[:n-1]\r\n s2=s[:n-2]+s[n-1]\r\n if (-int(s1))>(-int(s2)):\r\n print(-int(s1))\r\n else:\r\n print(-int(s2))\r\n", "s = input()\r\nif int(s) >= 0:\r\n print(s)\r\nelse:\r\n ans = s\r\n if int(s[len(s) - 1]) >= int(s[len(s) - 2]):\r\n ans = ans[:-1]\r\n else:\r\n ans = ans[:-2] + s[-1]\r\n if ans == \"-0\":\r\n ans = \"0\"\r\n print(ans)", "n = int(input())\r\nif n < 0:\r\n a = list(str(n))\r\n if int(a[-1]) > int(a[-2]):\r\n a.pop()\r\n print(*a, sep='')\r\n else:\r\n a.pop(-2)\r\n if len(a) == 2 and a[-1] == '0':\r\n print(0)\r\n else:\r\n print(*a, sep='')\r\nelse:\r\n print(n)", "#Coder_1_neel\r\nx = input()\r\n\r\nif int(x) < 0:\r\n s = x[:-1] \r\n t = x[:-2] + x[-1] \r\n\r\n s = int(s)\r\n t = int(t)\r\n\r\n print(max(int(x), s, t))\r\nelse:\r\n print(x)\r\n", "n = input()\r\na = n[:-1]\r\nb = n[:-2]+n[-1]\r\nprint(max(int(a),int(b),int(n)))", "money = input()\r\nif int(money) > 0:\r\n print(money)\r\nelse:\r\n if int(money) == -10 or int(money) == -20 or int(money) == -30 or int(money) == -40 or int(money) == -50 or int(money) == -60 or int(money) == -70 or int(money) == -80 or int(money) == -90:\r\n print(0)\r\n elif money[-1] >= money[-2]:\r\n print(money[:-1])\r\n elif money[-1] < money[-2]:\r\n print(money[:-2] + money[-1])", "n = (input())\r\nif int(n) > 0:\r\n print(n)\r\nelif int(n[:-2]+n[-1]) > int(n[:-1]):\r\n print(int(n[:-2]+n[-1]))\r\nelse:\r\n print(int(n[:-1]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Ilya_and_Bank_Account():\r\n def number_to_digitList(num):\r\n digits = []\r\n while num > 0 :\r\n digits.append(num % 10)\r\n num = num // 10 \r\n \r\n digits.reverse() #digits list initially will contain ones place number at index 0\r\n return digits\r\n\r\n\r\n n = inp()\r\n\r\n if n >= 0:\r\n print(n)\r\n else:\r\n digits_list = number_to_digitList(-n)\r\n\r\n \r\n if digits_list[len(digits_list)-1] > digits_list[len(digits_list)-2]:\r\n index = len(digits_list)-1 \r\n digits_list.pop(index)\r\n else:\r\n index = len(digits_list)-2\r\n digits_list.pop(index)\r\n \r\n string_num = ''.join(str(x) for x in digits_list)\r\n \r\n if string_num == '0':\r\n print(string_num)\r\n else:\r\n string_num = '-' + string_num\r\n print(string_num)\r\n \r\n return\r\n \r\n\r\nIlya_and_Bank_Account()", "gift = input()\r\nlistedgift = int(gift[0:-1])\r\nlistedgift2 = int(gift[0:len(gift)-2] + gift[len(gift)-1 ::])\r\nif int(gift) > 0:\r\n print(gift)\r\nelse:\r\n print(-min(abs(listedgift), abs(listedgift2)))", "n = input()\r\nif int(n)>= 0:\r\n print(n)\r\nelse:\r\n if int(n[len(n)-1]) >= int(n[len(n)-2]):\r\n print(n[:len(n)-1])\r\n else:\r\n new_n = n[:len(n)-2] + n[len(n)-1]\r\n if int(new_n) == 0:\r\n print(0)\r\n else:\r\n print(new_n)", "n = int(input())\r\nif n > 0 : print(n)\r\nelse : \r\n n *= -1\r\n if n <= 10 : print(0)\r\n else : \r\n x = n // 10\r\n y = n // 10 - (n//10)%10 + n % 10\r\n print(-min(x, y))\r\n ", "def main():\r\n n=input()\r\n if int(n)<-9:\r\n a=int(n[-1])\r\n b=int(n[-2])\r\n if b>a:\r\n n=n[:-2]+n[-1]\r\n else:\r\n n=n[:-1]\r\n elif int(n)<1:\r\n n='0'\r\n print(int(n))\r\nmain()", "a = input()\r\nif int(a) >= 0:\r\n print(a)\r\nelse:\r\n print(max(int(a[:-1]),int(a[:-2] + a[-1])))", "n = int(input())\r\n\r\nif abs(n) == n:\r\n print(n)\r\n\r\nelse:\r\n string = str(n)\r\n \r\n if string[-1] > string[-2]: # If last digit is greater than secnd to last digit \r\n string = string[:-1] # Last digit goes off\r\n else:\r\n string = string[:-2] + string[-1] # Remove second to the last (removed the last two digits and appended the last digit back)\r\n\r\n print(int(string))\r\n \r\n", "state_of_account = int(input())\r\nmax_balance = None\r\n\r\nif state_of_account >= 0:\r\n max_balance = state_of_account\r\n print(max_balance)\r\nelse:\r\n state_of_account = - state_of_account\r\n state_minus_last = state_of_account // 10\r\n state_minus_second_last = (state_of_account // 100) * 10 + state_of_account % 10\r\n max_balance = -state_minus_last if state_minus_last < state_minus_second_last else -state_minus_second_last\r\n print(max_balance)\r\n\r\n\r\n", "n=int(input())\r\nif(n>0):\r\n print(n)\r\nelse:\r\n n=-n\r\n k=n//10\r\n l=(n//100)*10+n%10\r\n if k<l:\r\n print(-k)\r\n else:\r\n print(-l)", "n=int(input())\r\nprint(max(n,int(n/10),int(n/100)*10+n%(10 if n>=0 else -10)))", "\r\nn=input()\r\nif int(n)>0:\r\n print(n)\r\nelse:\r\n if int(n[-1])>int(n[-2]):\r\n n=n[:-1]\r\n else:\r\n n=n[:-2]+n[-1]\r\n if n=='-0':\r\n print(0)\r\n else:\r\n print(n)", "n = int(input())\r\n\r\n# Convert n to string\r\nn_str = str(n)\r\n\r\nif n >= 0:\r\n print(n)\r\nelse:\r\n # Remove last digit and convert back to integer\r\n n1 = int(n_str[:-1])\r\n\r\n # Remove digit before the last and convert back to integer\r\n n2 = int(n_str[:-2] + n_str[-1])\r\n\r\n # Print the maximum value\r\n print(max(n1, n2))\r\n", "n = int(input())\r\nif n > 0:\r\n print(n)\r\nelif n < 0:\r\n n = abs(n)\r\n last = -(n // 10)\r\n prev = -(n // 100 * 10 + n % 10)\r\n print(max(last, prev))\r\n", "n = int(input())\r\nif n > 0:\r\n print(n)\r\nelse:\r\n n = -n\r\n if int(str(n)[-1]) > int(str(n)[-2]):\r\n n = int(str(n)[:-1])\r\n else:\r\n n = int(str(n)[:-2] + str(n)[-1])\r\n if n == 0:\r\n print(0)\r\n else:\r\n print(-n)" ]

[ "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def __str__(self):\r\n return f'teamName: \\'{self.teamName}\\', points: {self.points}, goalDiff: {self.goalDiff}, scoredGoals: {self.scoredGoals}'\r\n\r\n\r\ndef out(cont):\r\n for item in cont:\r\n print(item)\r\n\r\n\r\ndef findIndexByName(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nn, cont = int(input()), []\r\n\r\nfor i in range(n):\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\n'''\r\n 01234567890123456789 \r\nline = 'Barcelona-Real 15:10'\r\n'''\r\nfor i in range(n * (n - 1) // 2):\r\n line = input()\r\n dashInd = line.index('-')\r\n spaceInd = line.index(' ')\r\n colonInd = line.index(':')\r\n\r\n team1Name = line[:dashInd]\r\n team2Name = line[dashInd + 1:spaceInd]\r\n\r\n goal1 = int(line[spaceInd + 1: colonInd])\r\n goal2 = int(line[colonInd + 1:])\r\n\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # update goal diff\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n\r\n # update scored goals\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n\r\ncont.sort(key=lambda obj: (obj.points, obj.goalDiff, obj.scoredGoals), reverse=True)\r\ndel cont[n // 2:]\r\ncont.sort(key=lambda obj: obj.teamName)\r\n\r\n# out(cont)\r\nfor obj in cont:\r\n print(obj.teamName)\r\n", "p, n = {}, int(input())\r\nfor i in range(n): p[input()] = [0, 0, 0]\r\nfor i in range((n * (n - 1)) // 2):\r\n t = input().split()\r\n a, b = t[0].split('-')\r\n x, y = t[1].split(':')\r\n x, y = int(x), int(y)\r\n if x > y: p[a][0] += 3\r\n elif x < y: p[b][0] += 3\r\n else:\r\n p[a][0] += 1\r\n p[b][0] += 1\r\n p[a][1] += y\r\n p[b][1] += x\r\n p[a][2] += x\r\n p[b][2] += y\r\nfor c in p: p[c][1] = p[c][2] - p[c][1]\r\nr = sorted(p.items(), reverse = True, key = lambda x: x[1])\r\nprint('\\n'.join(sorted(r[i][0] for i in range(n // 2)))) ", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n\r\ndef findIndexByName(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nn = int(input())\r\ncont = []\r\nfor i in range(n):\r\n cont.append(Info(input(), 0, 0, 0))\r\nfor i in range(n * (n - 1) // 2):\r\n s = input()\r\n dashInd = s.index('-')\r\n spaceInd = s.index(' ')\r\n colonInd = s.index(':')\r\n team1Name = s[0:dashInd]\r\n team2Name = s[dashInd + 1:spaceInd]\r\n goal1 = int(s[spaceInd + 1:colonInd])\r\n goal2 = int(s[colonInd + 1:])\r\n team1Ind = findIndexByName(cont, team1Name)\r\n team2Ind = findIndexByName(cont, team2Name)\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1Ind].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Ind].points += 3\r\n else:\r\n cont[team1Ind].points += 1\r\n cont[team2Ind].points += 1\r\n # update goal difference\r\n cont[team1Ind].goalDiff += goal1 - goal2\r\n cont[team2Ind].goalDiff += goal2 - goal1\r\n # update scored goals\r\n cont[team1Ind].scoredGoals += goal1\r\ncont.sort(key=lambda item: (item.points, item.goalDiff, item.scoredGoals), reverse=True)\r\n\r\ndel cont[n // 2:]\r\n\r\ncont.sort(key=lambda item: item.teamName)\r\n\r\nfor item in cont:\r\n print(item.teamName)\r\n", "n=int(input())\r\nmeeskonnad=[[0,0,0,0,0,''] for x in range(n)]\r\nnimed=[]\r\nfor x in range(n):\r\n meeskonnad[x][5]=input()\r\n nimed.append(meeskonnad[x][5])\r\nfor x in range(n*(n-1)//2):\r\n s=input()\r\n r1=s[:s.find('-')]\r\n s=s[s.find('-')+1:]\r\n r2=s[:s.find(' ')]\r\n s=s[s.find(' '):]\r\n p1,p2=map(int,s.split(':'))\r\n if p1 > p2:\r\n meeskonnad[nimed.index(r1)][1]-=1\r\n meeskonnad[nimed.index(r1)][0]-=3\r\n elif p1 < p2:\r\n meeskonnad[nimed.index(r2)][1]-=1\r\n meeskonnad[nimed.index(r2)][0]-=3\r\n else:\r\n meeskonnad[nimed.index(r1)][0]-=1\r\n meeskonnad[nimed.index(r2)][0]-=1\r\n meeskonnad[nimed.index(r1)][2]-=p1-p2\r\n meeskonnad[nimed.index(r2)][2]-=p2-p1\r\n meeskonnad[nimed.index(r1)][3]-=p1\r\n meeskonnad[nimed.index(r2)][3]-=p2\r\n meeskonnad[nimed.index(r1)][4]+=1\r\n meeskonnad[nimed.index(r2)][4]+=1\r\nvastus=[]\r\ncnt=0\r\nfor x in (sorted(meeskonnad,key=lambda i: (i[0],i[1],i[2],i[3],i[4],i[5].upper()))):\r\n cnt+=1\r\n vastus.append(x[5])\r\n if(cnt*2>=n):\r\n break\r\nprint('\\n'.join(sorted(vastus)))\r\n", "dictionary, commands = {}, int(input())\r\nfor i in range(commands): \r\n dictionary[input()] = [0, 0, 0]\r\nfor i in range((commands * (commands - 1)) // 2):\r\n t = input().split()\r\n participant1, participant2 = t[0].split('-')\r\n score1, score2 = t[1].split(':')\r\n score1, score2 = int(score1), int(score2)\r\n if score1 > score2:\r\n dictionary[participant1][0] += 3\r\n elif score1 < score2:\r\n dictionary[participant2][0] += 3\r\n else:\r\n dictionary[participant1][0] += 1\r\n dictionary[participant2][0] += 1\r\n dictionary[participant1][1] += score2\r\n dictionary[participant2][1] += score1\r\n dictionary[participant1][2] += score1\r\n dictionary[participant2][2] += score2\r\nfor c in dictionary: dictionary[c][1] = dictionary[c][2] - dictionary[c][1]\r\nr = sorted(dictionary.items(), reverse=True, key=lambda x: x[1])\r\nprint('\\n'.join(sorted(r[i][0] for i in range(commands // 2))))\r\n", "n = int(input())\r\nteams_names = []\r\nt_points ={}\r\nfor i in range(n):\r\n teams_names.append(input())\r\n t_points[teams_names[i]] = [0,0,0]\r\nfor i in range((n*(n-1))//2):\r\n t,s = input().split()\r\n t1, t2 = t.split('-')\r\n s1, s2 = map(int,s.split(':'))\r\n t_points[t1][1] += s1 - s2\r\n t_points[t1][2] += s1\r\n t_points[t2][1] += s2 - s1 \r\n t_points[t2][2] += s2\r\n if s1>s2:\r\n t_points[t1][0] += 3\r\n elif s2>s1:\r\n t_points[t2][0] += 3\r\n else:\r\n t_points[t1][0] += 1\r\n t_points[t2][0] += 1\r\n\r\nsorted_t_points = sorted(sorted(t_points.items(), key=lambda x:(x[1][0], x[1][1], x[1][2]), reverse=True)[:n//2])\r\nfor i in range(n//2):\r\n print(sorted_t_points[i][0])", "class Info:\r\n def __init__(self, _teamName, _points, _goalDiff, _scoredGoals):\r\n self.teamName = _teamName\r\n self.points = _points\r\n self.goalDiff = _goalDiff\r\n self.scoredGoals = _scoredGoals\r\n\r\n def __str__(self):\r\n return f\"[teamName: '{self.teamName}', points: {self.points}, goalDiff: {self.goalDiff}, scoredGoals: {self.scoredGoals}]\"\r\n\r\ndef output(cont):\r\n for item in cont:\r\n print(item)\r\n\r\ndef findIndexByName(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nN = int(input())\r\ncont = []\r\nfor i in range(N):\r\n # newTeamName = input()\r\n # obj = Info(newTeamName,0,0,0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n'''\r\n 01234567890123456789\r\n'Barcelona-Real 15:10'\r\n'''\r\nfor i in range(N * (N - 1) // 2):\r\n line = input()\r\n dashInd = line.index('-')\r\n spaceInd = line.index(' ')\r\n colonInd = line.index(':')\r\n team1Name = line[:dashInd]\r\n team2Name = line[dashInd + 1:spaceInd]\r\n goal1 = int(line[spaceInd + 1:colonInd])\r\n goal2 = int(line[colonInd + 1:])\r\n team1Index = findIndexByName(cont,team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n\r\n #update point\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal2 > goal1:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n #update goalDiff\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n\r\n #update scored goals\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n\r\ncont.sort(key=lambda item:(item.points,item.goalDiff,item.scoredGoals),reverse=True)\r\ndel cont[N // 2:]\r\ncont.sort(key=lambda item:item.teamName)\r\nfor item in cont:\r\n print(item.teamName)\r\n\r\n\r\n\r\n", "class Info:\r\n def __init__(self, new_team_name, new_points, new_goal_diff, new_scored_goals):\r\n self.team_name = new_team_name\r\n self.points = new_points\r\n self.goal_diff = new_goal_diff\r\n self.scored_goals = new_scored_goals\r\n\r\n\r\ndef findIndexByName(cont, search_name):\r\n for i in range(len(cont)):\r\n if cont[i].team_name == search_name:\r\n return i\r\n return -1\r\n\r\n\r\nn = int(input())\r\ncont = list()\r\nfor i in range(n):\r\n '''\r\n tName = input()\r\n obj = Info(tName, 0, 0, 0)\r\n cont.append(obj)\r\n '''\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\nfor i in range(n * (n - 1) // 2):\r\n s = input()\r\n dash_index = s.index('-')\r\n space_index = s.index(' ')\r\n colon_index = s.index(':')\r\n team1_name = s[:dash_index]\r\n team2_name = s[dash_index + 1:space_index]\r\n goal1 = int(s[space_index + 1:colon_index])\r\n goal2 = int(s[colon_index + 1:])\r\n team1_index = findIndexByName(cont, team1_name)\r\n team2_index = findIndexByName(cont, team2_name)\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1_index].points += 3\r\n elif goal2 > goal1:\r\n cont[team2_index].points += 3\r\n else:\r\n cont[team1_index].points += 1\r\n cont[team2_index].points += 1\r\n # update goal difference\r\n cont[team1_index].goal_diff += goal1 - goal2\r\n cont[team2_index].goal_diff += goal2 - goal1\r\n # update scored goals\r\n cont[team1_index].scored_goals += goal1\r\n cont[team2_index].scored_goals += goal2\r\n\r\n# sort by points, then by goal_diff, and then by scored_goals(descending order)\r\ncont.sort(key=lambda item: (item.points, item.goal_diff, item.scored_goals), reverse=True)\r\n# delete second half of the list\r\ndel cont[n // 2:]\r\n# sort by team name lexicographically in ascending order\r\ncont.sort(key=lambda item: item.team_name)\r\n\r\nfor item in cont:\r\n print(item.team_name)\r\n\r\n'''\r\n 0123456789.........\r\ns= 'barcelona-real 15:10'\r\n\r\n4\r\nA\r\nB\r\nC\r\nD\r\nA-B 1:1\r\nA-C 2:2\r\nA-D 1:0\r\nB-C 1:0\r\nB-D 0:3\r\nC-D 0:3\r\n\r\nPoints goalDiff scoredGoals\r\nA => 1+1+3=5 A=> (1+2+1) - (1+2+0)= 4-3=1 A=> 4\r\nB => 1+3+0=4 B=> (1+1+0) - (1+0+3)= 2-4=-2 B=> 2\r\nC => 1+0+0=1 C=> (2+0+0) - (2+1+3)= 2-6=-4 C=> 2\r\nD => 0+3+3=6 D=> (0+3+3) - (1+0+0)= 6-1=5 D=> 6\r\n\r\nA, B, C, D => D, A, B, C => D, A =>A, D\r\n\r\ncont:\r\n 0 1\r\n|teamName: 'A' |teamname: 'B'|\r\n|point: 5 |point: 5 |\r\n|goalDiff: 1 |\r\n|scoredGoals: 4|\r\n\r\n'''\r\n", "def main():\r\n mystical_n = int(input())\r\n mystic_map = {}\r\n\r\n for _ in range(mystical_n):\r\n magical_name = input()\r\n mystic_map[magical_name] = {'name': magical_name, 'points': 0, 'difference': 0, 'scored': 0}\r\n\r\n for _ in range(mystical_n * (mystical_n - 1) // 2):\r\n match_info = input().split()\r\n player_x, player_y = \"\", \"\"\r\n dash_found = False\r\n for char in match_info[0]:\r\n if char == '-':\r\n dash_found = True\r\n elif dash_found:\r\n player_y += char\r\n else:\r\n player_x += char\r\n\r\n goals_x, goals_y = 0, 0\r\n colon_found = False\r\n for char in match_info[1]:\r\n if char == ':':\r\n colon_found = True\r\n elif colon_found:\r\n goals_y = 10 * goals_y + (ord(char) - ord('0'))\r\n else:\r\n goals_x = 10 * goals_x + (ord(char) - ord('0'))\r\n\r\n mystic_map[player_x]['scored'] += goals_x\r\n mystic_map[player_y]['scored'] += goals_y\r\n mystic_map[player_x]['difference'] += goals_x - goals_y\r\n mystic_map[player_y]['difference'] += goals_y - goals_x\r\n if goals_x > goals_y:\r\n mystic_map[player_x]['points'] += 3\r\n elif goals_x < goals_y:\r\n mystic_map[player_y]['points'] += 3\r\n else:\r\n mystic_map[player_x]['points'] += 1\r\n mystic_map[player_y]['points'] += 1\r\n\r\n magic_players = list(mystic_map.values())\r\n magic_players.sort(key=lambda x: (x['points'], x['difference'], x['scored']), reverse=True)\r\n mystical_result = [magic_players[p]['name'] for p in range(mystical_n // 2)]\r\n mystical_result.sort()\r\n for magical_name in mystical_result:\r\n print(magical_name)\r\n\r\n# Invoke the main function\r\nmain()\r\n", "class Info:\r\n # constructor self <-> this\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n # override toString()\r\n def __str__(self):\r\n template = '\\n*****************\\n'\r\n template += f'teamName: {self.teamName} \\n'\r\n template += f'points: {self.points} \\n'\r\n template += f'goalDiff: {self.goalDiff} \\n'\r\n template += f'scoredGoals: {self.scoredGoals} \\n'\r\n template += '*****************\\n'\r\n return template\r\n\r\n\r\n# end of class here . . .\r\n'''\r\n 0123456789\r\nline = 'abcdQefgQh'\r\n'''\r\n\r\n'''\r\ndef IndexOf(line: str, item) -> int:\r\n for i in range(len(line)):\r\n if line[i] == item:\r\n return i\r\n return -1\r\n'''\r\n\r\n\r\ndef output(cont: list):\r\n for it in cont:\r\n print(it)\r\n\r\n\r\ndef findIndexByName(cont: list, searchName: str) -> int:\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nn, cont = int(input()), []\r\nfor i in range(n):\r\n # obj = Info(input(), 0, 0, 0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\nfor i in range(n * (n - 1) // 2):\r\n line = input()\r\n dashIndex = line.index('-')\r\n spaceIndex = line.index(' ')\r\n\r\n team1Name = line[:dashIndex]\r\n team2Name = line[dashIndex + 1:spaceIndex]\r\n\r\n colonIndex = line.index(':')\r\n goal1 = int(line[spaceIndex + 1: colonIndex])\r\n goal2 = int(line[colonIndex + 1:])\r\n\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # update Goal Difference\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n\r\n # updte Scored Goals\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n# end of for loop\r\ncont.sort(key=lambda item: (item.points, item.goalDiff, item.scoredGoals), reverse=True)\r\ndel cont[n // 2:]\r\ncont.sort(key=lambda item: item.teamName)\r\n# output(cont)\r\nfor item in cont:\r\n print(item.teamName)\r\n", "'''Problem 19A - World Football Cup'''\r\nscore = {} # dict pentru a face totalurile pentru fiecare din jucatori\r\nn = int(input()) # citim nr de echipe\r\nfor i in range(n):\r\n team = input() # key = numele la echipe\r\n score[team] = [0,0,0] # numele la echipa = [puncte pentru fiecare match,\r\n # diferenta intre golurile marcate si primite,\r\n # toate golurile marcate ]\r\n# citim rezultatele meciurilor\r\nfor _ in range(n*(n-1)//2):\r\n data = input().split()\r\n teams = data[0].split('-') # teams = ['team_first', 'team_second']\r\n\r\n first_team = teams[0] # first team\r\n sec_team = teams[1] # second team\r\n\r\n scores = data[1].split(':')\r\n first_tscore = int(scores[0]) # score for first_team\r\n sec_tscore = int(scores[1]) # score for sec_team\r\n\r\n # in caz ca a doua echipa a chastigat\r\n if first_tscore < sec_tscore:\r\n score[sec_team][0] += 3 # 'sec_team_name' = [3,0,0]\r\n score[sec_team][1] += sec_tscore - first_tscore # 'sec_team_name' = [3,diferenta intre goluri,0]\r\n score[sec_team][2] += sec_tscore # 'sec_team_name' = [3,diferenta intre goluri,goluri marcate in meci]\r\n # la fel si pentru echipa 1 actualizam scorurile in dictionarul score\r\n score[first_team][1] += first_tscore - sec_tscore\r\n score[first_team][2] += first_tscore\r\n\r\n # in caz ca echipa 1 a biruit\r\n if first_tscore > sec_tscore:\r\n score[first_team][0] += 3\r\n score[first_team][1] += first_tscore - sec_tscore\r\n score[first_team][2] += first_tscore\r\n\r\n score[sec_team][1] += sec_tscore - first_tscore\r\n score[sec_team][2] += sec_tscore\r\n\r\n # in caz de egalitate\r\n elif first_tscore == sec_tscore:\r\n score[first_team][0] += 1\r\n score[first_team][1] += first_tscore - sec_tscore\r\n score[first_team][2] += first_tscore\r\n\r\n score[sec_team][0] += 1\r\n score[sec_team][1] += sec_tscore - first_tscore\r\n score[sec_team][2] += sec_tscore\r\n\r\n# print(score)\r\nres = [] # valorile din dictionar le salvam in lista res\r\n# team = key , # score = list of scores for each team\r\nfor team, score in score.items():\r\n res.append([score[0], score[1], score[2], team]) # : res = [[5, 1, 4, 'A'], [4, -2, 2, 'B'], [1, -4, 2, 'C'], [6, 5, 6, 'D']]\r\n\r\nres = sorted(res) # sortam lista , dupa condtitie\r\nres.reverse() # reversam lista , ca echipele cu cele mai mari scoruri sa fie primele\r\n\r\nnw = [] # lista pt echipele care sau calificat\r\nfor i in range(n//2):\r\n nw.append(res[i][3]) # adougam in lisa numele acestor echipe\r\n\r\nnw = sorted(nw)\r\nprint(*nw, sep='\\n') # afisam numele la echipe din rand nou\r\n", "from functools import cmp_to_key\r\n\r\n\r\nclass Team:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def __str__(self):\r\n return f\"TeamName: '{self.teamName}', points: {self.points}, \" + \\\r\n f\"goalDifference: {self.goalDiff}, scoredGoals: {self.scoredGoals}\"\r\n\r\n\r\ndef output(cont):\r\n for obj in cont:\r\n print(obj)\r\n\r\n\r\ndef indexOf(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\n# def compareByPointsThenByGoalDiffThenByScoredGoals(obj1, obj2):\r\n# point1 = obj1.Point\r\n# point2 = obj2.Point\r\n# goalDiff1 = obj1.GoalDiff\r\n# goalDiff2 = obj2.GoalDiff\r\n# scoredGoals1 = obj1.ScoredGoals\r\n# scoredGoals2 = obj2.ScoredGoals\r\n#\r\n# if point1 != point2:\r\n# return point1 - point2\r\n# if goalDiff1 != goalDiff2:\r\n# return goalDiff1 - goalDiff2\r\n#\r\n# return scoredGoals1 - scoredGoals2\r\n#\r\n#\r\n# def compareByName(obj1, obj2):\r\n# name1 = obj1.teamName\r\n# name2 = obj2.teamName\r\n# len1 = len(name1)\r\n# len2 = len(name2)\r\n# minimum_length = 0\r\n#\r\n# if len1 < len2:\r\n# minimum_length = len1\r\n# else:\r\n# minimum_length = len2\r\n#\r\n# for i in range():\r\n# if name1[i] != name2[i]:\r\n# return name2[i] - name1[i]\r\n#\r\n# return len2 - len1\r\n\r\n\r\nn, cont = int(input()), []\r\nfor i in range(n):\r\n newTeamName = input()\r\n obj = Team(newTeamName, 0, 0, 0)\r\n cont.append(obj)\r\n# output(cont)\r\nfor i in range(n * (n - 1) // 2):\r\n line = input()\r\n\r\n dashInd = line.find('-')\r\n spaceInd = line.find(' ')\r\n colonInd = line.find(':')\r\n\r\n team1Name = line[0: dashInd]\r\n team2Name = line[dashInd + 1: spaceInd]\r\n goal1 = int(line[spaceInd + 1: colonInd])\r\n goal2 = int(line[colonInd + 1:])\r\n team1Index = indexOf(cont, team1Name)\r\n team2Index = indexOf(cont, team2Name)\r\n\r\n # Update Points\r\n\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # Update Goal Difference\r\n\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n\r\n # Update Scored Goals\r\n\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n\r\n# cont.sort(key=cmp_to_key(compareByPointsThenByGoalDiffThenByScoredGoals))\r\ncont.sort(key=lambda obj: (obj.points, obj.goalDiff, obj.scoredGoals), reverse=True)\r\ndel cont[n // 2:]\r\ncont.sort(key=lambda obj: obj.teamName)\r\nfor item in cont:\r\n print(item.teamName)\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/19/A\n\"\"\"\nteams = int(input())\nnames = []\nfor i in range(teams):\n names.append(input())\nscores = []\nfor j in range(teams * (teams - 1) // 2):\n eq, sc = input().split()\n scores.append((eq.split(\"-\"), [int(x) for x in sc.split(\":\")]))\n\n#print(names)\n#print(scores)\n\n\nresultats = dict()\nfor n in names:\n resultats[n] = {\"points\": 0, \"scoredgoals\": 0, \"missedgoals\": 0}\n for ns, bs in scores:\n n1, n2 = ns\n b1, b2 = bs\n if n1 == n:\n resultats[n][\"scoredgoals\"] += b1\n resultats[n][\"missedgoals\"] += b2\n if b1 > b2:\n resultats[n][\"points\"] += 3\n elif b1 == b2:\n resultats[n][\"points\"] += 1\n if n2 == n:\n resultats[n][\"scoredgoals\"] += b2\n resultats[n][\"missedgoals\"] += b1\n if b2 > b1:\n resultats[n][\"points\"] += 3\n elif b1 == b2:\n resultats[n][\"points\"] += 1\n#print(resultats)\n\nranking = []\nfor n, r in resultats.items():\n p, bm, bp = r[\"points\"], r[\"scoredgoals\"], r[\"missedgoals\"]\n ranking.append((p, bm - bp, bm, n))\nranking = sorted(ranking, reverse=True)\n#print(ranking)\nnamelist = []\nfor i in range(teams // 2):\n namelist.append(ranking[i][3])\nnamelist = sorted(namelist)\n#print(namelist)\n\nfor i in range(teams // 2):\n print(namelist[i])\n", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def __str__(self):\r\n return f'[teamName: {self.teamName}, Points: {self.points}, ' \\\r\n f'GoalDiff: {self.goalDiff}, ScoredGoals: {self.scoredGoals}]'\r\n\r\n\r\ndef output(cont):\r\n for item in cont:\r\n print(item)\r\n\r\n\r\ndef findIndexByName(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nN = int(input())\r\ncont = list()\r\nfor i in range(N):\r\n cont.append(Info(input(), 0, 0, 0))\r\n# 01234567890123456789\r\n# Barcelona-Real 15:10\r\nfor i in range(N * (N - 1) // 2):\r\n line = input()\r\n dashIndex = line.index('-')\r\n spaceIndex = line.index(' ')\r\n colonIndex = line.index(':')\r\n team1Name = line[:dashIndex]\r\n team2Name = line[dashIndex + 1:spaceIndex]\r\n goal1 = int(line[spaceIndex + 1:colonIndex])\r\n goal2 = int(line[colonIndex + 1:])\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n\r\n # update points:\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n # update goalDiff:\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n # update scoredGoals:\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n\r\ncont.sort(key=lambda item: (item.points, item.goalDiff, item.scoredGoals), reverse=True)\r\ndel cont[N // 2:]\r\ncont.sort(key =lambda item: item.teamName)\r\n#output(cont)\r\nfor item in cont:\r\n print(item.teamName)\r\n", "class Info:\r\n def __init__(self, _teamName, _points, _goalDiff, _scoredGaols):\r\n self.teamName = _teamName\r\n self.points = _points\r\n self.goalDiff = _goalDiff\r\n self.scoredGoals = _scoredGaols\r\n\r\n def __str__(self):\r\n return f'\\n*************************\\n' \\\r\n f'teamName = {self.teamName} \\n' \\\r\n f'points = {self.points}\\n' \\\r\n f'goalDiff = {self.goalDiff}\\n' \\\r\n f'scoredGoals = {self.scoredGoals}\\n' \\\r\n f'****************************\\n'\r\n\r\n def __eq__(self, other):\r\n if other is Info and self.teamName == other.teamName and self.points == other.points \\\r\n and self.goalDiff == other.goalDiff and self.scoredGoals == other.scoredGoals:\r\n return True\r\n return False\r\n\r\n\r\ndef output(cont):\r\n for item in cont:\r\n print(item)\r\n\r\n\r\ndef indexOf(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\n# obj = Info(\"barcelona\", 5, 8, 15)\r\n# print(obj)\r\nn = int(input())\r\ncont = []\r\nfor i in range(n):\r\n # tName = input()\r\n # obj = Info(tName,0,0,0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\n# output(cont)\r\n''' 01234567890123456789\r\nline == \"Barcelona-Real 15:10\"\r\n'''\r\nfor i in range(n * (n - 1) // 2):\r\n line = input()\r\n dashIndex = line.index('-')\r\n spaceIndex = line.index(' ')\r\n colonIndex = line.index(':')\r\n team1Name = line[:dashIndex]\r\n team2Name = line[dashIndex + 1:spaceIndex]\r\n goal1 = int(line[spaceIndex + 1:colonIndex])\r\n goal2 = int(line[colonIndex + 1:])\r\n team1Ind = indexOf(cont, team1Name)\r\n team2Ind = indexOf(cont, team2Name)\r\n # update points\r\n\r\n if goal1 > goal2:\r\n cont[team1Ind].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Ind].points += 3\r\n else:\r\n cont[team1Ind].points += 1\r\n cont[team2Ind].points += 1\r\n\r\n # update GoalDiff\r\n cont[team1Ind].goalDiff += goal1 - goal2\r\n cont[team2Ind].goalDiff += goal2 - goal1\r\n # update scoredGoals\r\n cont[team1Ind].scoredGoals += goal1\r\n cont[team2Ind].scoredGoals += goal2\r\n\r\n# sort By points in Descending order then by goaldiff in descending order then by scoredgoals in descending order\r\n\r\ncont.sort(key=lambda item: (item.points, item.goalDiff, item.scoredGoals), reverse=True)\r\n\r\ndel cont[n // 2:]\r\n\r\n# sort by teamname in ascending order\r\n\r\ncont.sort(key=lambda item: item.teamName)\r\n\r\nfor item in cont:\r\n print(item.teamName)\r\n'''\r\n4\r\nA\r\nB\r\nC\r\nD\r\nA-B 1:1\r\nA-C 2:2\r\nA-D 1:0\r\nB-C 1:0\r\nB-D 0:3\r\nC-D 0:3\r\n\r\nPoints GoalDifference ScoredGoals\r\nA => 1+1+3=5 A => (1+2+1) - (1+2+0) = 4 - 3 = 1 A => 4\r\nB => 1+3+0=4 B => (1+1+0) - (1+0+3) = 2 - 4 = -2 B => 2\r\nC => 1+0+0=1 C => (2+0+0) - (2+1+3) = 2 - 6 = -4 C => 2\r\nD => 0+3+3=6 D => (0+3+3) - (1+0+0) = 6 - 1 = 5 D => 6\r\n\r\nD, A, B, C => D, A => A, D\r\n\r\n|TeamName: \"A\" |\r\n|Point: 5 |\r\n|GoalDiff: 1 |\r\n|ScoredGoals: 4|\r\n\r\n'''\r\n", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def printData(self):\r\n print('\\n***********************')\r\n print('teamName: {}'.format(self.teamName))\r\n print('points: {}'.format(self.points))\r\n print('goal difference: {}'.format(self.goalDiff))\r\n print('scored goals: {}'.format(self.scoredGoals))\r\n print('***********************')\r\n\r\n\r\ndef output(cont: list):\r\n for item in cont:\r\n item.printData()\r\n\r\n\r\ndef findIndexByName(cont: list, searchName: str) -> int:\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n\r\n return -1\r\n\r\n\r\ncont = []\r\nn = int(input())\r\nfor i in range(n):\r\n # teamName = input()\r\n # obj = Info(teamName, 0, 0, 0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\nfor i in range(n * (n - 1) // 2):\r\n s = input()\r\n dashInd = s.index('-')\r\n spaceInd = s.index(' ')\r\n colonInd = s.index(':')\r\n team1Name = s[0:dashInd]\r\n team2Name = s[dashInd + 1:spaceInd]\r\n goal1 = int(s[spaceInd + 1: colonInd])\r\n goal2 = int(s[colonInd + 1:])\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal2 > goal1:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # update goaldiff\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n\r\n # update scored goals\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n\r\n# output(cont)\r\ncont.sort(key=lambda item: (item.points, item.goalDiff, item.scoredGoals), reverse=True)\r\ndel cont[n // 2:]\r\ncont.sort(key=lambda item: item.teamName)\r\nfor item in cont:\r\n print(item.teamName)\r\n'''\r\n 0123456789.........\r\n \"barcelona-real 15:10\"\r\n4\r\nA\r\nB\r\nC\r\nD\r\nA-B 1:1\r\nA-C 2:2\r\nA-D 1:0\r\nB-C 1:0\r\nB-D 0:3\r\nC-D 0:3\r\n \r\n \r\nPoint\r\n'A' -> 1+1+3=5\r\n'B' -> 1+3+0=4 ..........\r\n'C' -> 1+0+0=1\r\n'D' -> 0+3+3=6\r\n\r\n'''\r\n", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\nteams = [input() for _ in range(n)]\r\nsc = dict()\r\ngo = dict()\r\nlo = dict()\r\n\r\nteams.reverse()\r\n\r\nfor _ in range(n*(n-1)//2):\r\n s = input().split()\r\n tm = s[0].split(\"-\")\r\n score = [int(x) for x in s[1].split(\":\")]\r\n if score[0] == score[1]:\r\n sc[tm[0]] = sc.get(tm[0], 0) + 1\r\n sc[tm[1]] = sc.get(tm[1], 0) + 1\r\n if score[0] > score[1]:\r\n sc[tm[0]] = sc.get(tm[0], 0) + 3\r\n sc[tm[1]] = sc.get(tm[1], 0) + 0\r\n if score[1] > score[0]:\r\n sc[tm[0]] = sc.get(tm[0], 0) + 0\r\n sc[tm[1]] = sc.get(tm[1], 0) + 3\r\n go[tm[0]] = go.get(tm[0], 0) + score[0]\r\n go[tm[1]] = go.get(tm[1], 0) + score[1]\r\n lo[tm[0]] = lo.get(tm[0], 0) + score[1]\r\n lo[tm[1]] = lo.get(tm[1], 0) + score[0]\r\n\r\ndef compare(a, b):\r\n if sc.get(a, 0) != sc.get(b, 0):\r\n return sc.get(a, 0) - sc.get(b, 0)\r\n if go.get(a, 0) - lo.get(a, 0) != go.get(b, 0) - lo.get(b, 0):\r\n return (go.get(a, 0) - lo.get(a, 0)) - (go.get(b, 0) - lo.get(b, 0))\r\n if go.get(a, 0) != go.get(b, 0):\r\n return go.get(a, 0) - go.get(b, 0)\r\n\r\nres = sorted(teams, key=cmp_to_key(compare))[n//2:n]\r\nfor s in sorted(res):\r\n print(s)", "#this function will update information about team after each match\r\ndef completeTeamInfo(team,scored,missed):\r\n team.scoredGoals += scored\r\n team.missedGoals += missed\r\n team.differenceScoredAndMissed += scored - missed\r\n #if the team scored more goals than missed, than it gains 3 points\r\n if scored > missed:\r\n team.points += 3\r\n #if they scored the same amount of goals as they missed, team gains one point\r\n elif scored == missed:\r\n team.points += 1\r\n#this function will sort the data according to required conditions\r\ndef arrangeTeams(totals):\r\n totals.sort(key=lambda team: (team.points, team.differenceScoredAndMissed, team.scoredGoals ), reverse=True)\r\ndef main():\r\n #make a class to store all necessary data\r\n class Team:\r\n scoredGoals = 0\r\n missedGoals = 0\r\n differenceScoredAndMissed = 0\r\n points = 0\r\n def __init__(self, name):\r\n self.name = name\r\n #get teams number\r\n teamsNr = int(input())\r\n totals = []\r\n #get team's names\r\n for _ in range(teamsNr):\r\n name = input()\r\n totals.append(Team(name))\r\n #for each match\r\n for _ in range(teamsNr*(teamsNr-1)//2):\r\n #get score and participant teams\r\n playingTeams,score = input().split()\r\n #because teams are given in A-C 2:2 form\r\n #we have to be more accurate in gathering data\r\n teamOne = playingTeams[:playingTeams.index('-')]\r\n teamTwo = playingTeams[playingTeams.index('-') + 1:]\r\n scoreTeamOne = int(score[:score.index(\":\")])\r\n scoreTeamTwo = int(score[score.index(':') + 1:])\r\n #for each match\r\n for team in totals:\r\n #look for team in totals and complete teams info\r\n if team.name == teamOne:\r\n completeTeamInfo(team,scoreTeamOne,scoreTeamTwo)\r\n if team.name == teamTwo:\r\n completeTeamInfo(team,scoreTeamTwo,scoreTeamOne)\r\n #arrange teams by the given conditions\r\n arrangeTeams(totals)\r\n winners = []\r\n #we are interested only top half of the list\r\n for i in range(teamsNr//2):\r\n winners.append(totals[i].name) \r\n #but arranged in alphabetical order\r\n winners.sort()\r\n #print results\r\n for winner in winners:\r\n print(winner)\r\nmain()", "score = {}\r\nn = int(input())\r\nfor i in range(n):\r\n team = input()\r\n score[team] = [0,0,0]\r\n\r\nfor i in range(n*(n-1)//2):\r\n s = input().split()\r\n teams = s[0].split('-')\r\n \r\n\t# get team names\r\n first = teams[0]\r\n second = teams[1]\r\n\t# get scores\r\n scores = s[1].split(':')\r\n first_score = int(scores[0])\r\n second_score = int(scores[1])\r\n \r\n\t# when team winned\r\n if first_score < second_score:\r\n score[second][0] += 3\r\n score[second][1] = score[second][1] + second_score - first_score\r\n score[second][2] += second_score\r\n \r\n score[first][1] = score[first][1] + first_score - second_score\r\n score[first][2] += first_score\r\n if first_score > second_score:\r\n score[first][0] += 3\r\n score[first][1] += first_score - second_score\r\n score[first][2] += first_score\r\n \r\n score[second][1] += second_score - first_score\r\n score[second][2] += second_score\r\n\t# when draw\r\n elif first_score == second_score:\r\n score[first][0] += 1\r\n score[first][1] += first_score - second_score\r\n score[first][2] += first_score\r\n \r\n score[second][0] += 1\r\n score[second][1] += second_score - first_score\r\n score[second][2] += second_score\r\n\r\n\r\nresults = []\r\n# list of teams with 3 criteria scores\r\nfor team, score in score.items():\r\n results.append([score[0], score[1], score[2], team])\r\n \r\n# sort results in ascending order \r\nresults = sorted(results)\r\nresults.reverse() \r\nnw = []\r\nfor i in range(n//2):\r\n nw.append(results[i][3])\r\n \r\nnw = sorted(nw)\r\n\r\nprint(*nw, sep='\\n')", "class Info:\r\n def __init__(self, _team_name, _points, _goal_diff, _scored_goals):\r\n self.TeamName = _team_name\r\n self.Points = _points\r\n self.GoalDiff = _goal_diff\r\n self.ScoredGoals = _scored_goals\r\n\r\n\r\n# end of class\r\n# our function here\r\ndef findIndexByTeamName(container, team_name):\r\n for ind, item in enumerate(container):\r\n if item.TeamName == team_name:\r\n return ind\r\n\r\n return -1\r\n\r\n\r\n# end of our functions here\r\n\r\nN = int(input())\r\ncont = list()\r\nfor i in range(N):\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\nfor i in range(N * (N - 1) // 2):\r\n s = input()\r\n dashIndex = s.index('-')\r\n spaceIndex = s.index(' ')\r\n colonIndex = s.index(':')\r\n Team1Name = s[0:dashIndex]\r\n Team2Name = s[dashIndex + 1:spaceIndex]\r\n Goal1 = int(s[spaceIndex + 1:colonIndex])\r\n Goal2 = int(s[colonIndex + 1:])\r\n Team1Index = findIndexByTeamName(cont, Team1Name)\r\n Team2Index = findIndexByTeamName(cont, Team2Name)\r\n\r\n # update points\r\n if Goal1 > Goal2:\r\n cont[Team1Index].Points += 3\r\n elif Goal1 < Goal2:\r\n cont[Team2Index].Points += 3\r\n else:\r\n cont[Team1Index].Points += 1\r\n cont[Team2Index].Points += 1\r\n\r\n # update goal difference\r\n cont[Team1Index].GoalDiff += (Goal1 - Goal2)\r\n cont[Team2Index].GoalDiff += (Goal2 - Goal1)\r\n\r\n # scored goals\r\n cont[Team1Index].ScoredGoals += Goal1\r\n cont[Team2Index].ScoredGoals += Goal2\r\n\r\n# Sorting by points then by goalDiff and then scored goals\r\ncont.sort(key=lambda item: (item.Points, item.GoalDiff, item.ScoredGoals), reverse=True)\r\n# remove second half of pour list\r\ndel cont[N // 2:]\r\n# sort by team name\r\ncont.sort(key=lambda item: item.TeamName)\r\n# output\r\nfor item in cont:\r\n print(item.TeamName)\r\n", "def addv(vcr,dcntvn,cn,gr,dp,cp):\r\n\tif cn not in dcntvn:\r\n\t\tdcntvn[cn]=len(vcr)\t\t\r\n\t\tvcr.append([0,0,0,cn])\r\n\tind=dcntvn[cn]\r\n\tvcr[ind][0]+=gr\r\n\tvcr[ind][1]+=dp\r\n\tvcr[ind][2]+=cp\r\n\r\ndef ggr(fcp,scp):\r\n\tif fcp>scp:\r\n\t\treturn 3\r\n\telif fcp==scp:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn 0\r\n\r\ndef gsp(vcr,dcntvn,s):\r\n\tfm=s.find('-')\r\n\tfcn=s[:fm]\r\n\tsm=s.find(' ',fm)\r\n\tscn=s[fm+1:sm]\r\n\tfm=s.find(':',sm)\r\n\tfcp=int(s[sm+1:fm])\r\n\tscp=int(s[fm+1:])\r\n\taddv(vcr,dcntvn,fcn,ggr(fcp,scp),fcp-scp,fcp)\r\n\taddv(vcr,dcntvn,scn,ggr(scp,fcp),scp-fcp,scp)\r\n\r\nn=int(input())\r\nvcr=[]\r\ndcntvn=dict()\r\nfor c in range(n):\r\n\tinput()\r\nfor c in range(n*(n-1)//2):\r\n\tgsp(vcr,dcntvn,input())\r\nvcr.sort(key=lambda x:(-x[0],-x[1],-x[2]))\r\nwns=vcr[:n//2]\r\nwns.sort(key=lambda x:x[3])\r\nfor c in wns:\r\n\tprint(c[3])\r\n", "n=int(input())\r\nteams_dic={}\r\nPoints,ScorMiss,Scor='points','scored-missed','scored goals'\r\nfor i in range(n):\r\n name=input()\r\n teams_dic[name]={Points:0,ScorMiss:0,Scor:0}\r\n\r\nnum_matches=n*(n-1)//2\r\n\r\nfor match in range(num_matches):\r\n names,score=input().split()\r\n team1,team2=names.split('-')\r\n score1,score2=list(map(int,score.split(':')))\r\n if score1>score2:\r\n teams_dic[team1][Points]+=3\r\n elif score1==score2:\r\n teams_dic[team1][Points]+=1\r\n teams_dic[team2][Points]+=1\r\n else:\r\n teams_dic[team2][Points]+=3\r\n teams_dic[team1][ScorMiss]+=score1-score2\r\n teams_dic[team2][ScorMiss]+=score2-score1\r\n teams_dic[team1][Scor]+=score1\r\n teams_dic[team2][Scor]+=score2\r\n\r\n\r\nrank_lst=sorted(teams_dic.keys(),key= lambda team:tuple(teams_dic[team].values()))\r\nqualified=rank_lst[-n//2:]\r\n\r\nqualified=sorted(qualified)\r\nfor team in qualified:\r\n print(team)\r\n\r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\nt = [[0,0,0,input()] for i in range(n)]\r\nx = {t[i][3]:i for i in range(n)}\r\nfor _ in range(n*(n-1)//2):\r\n g,h = input().split()\r\n a,b = g.split('-')\r\n a,b = x[a],x[b]\r\n c,d = map(int,h.split(':'))\r\n if c>d: t[a][0] += 3\r\n elif c<d: t[b][0] += 3\r\n else: t[a][0] += 1; t[b][0] += 1\r\n t[a][1] += c-d; t[b][1] += d-c\r\n t[a][2] += c; t[b][2] += c\r\nt.sort(reverse=True)\r\nr = sorted(t[i][3] for i in range(n//2))\r\nfor c in r: print(c)", "import sys\n\nclass Score:\n def __init__(self, name, points, scored, missed):\n self.name = name\n self.points = points\n self.scored = scored\n self.missed = missed\n\n def __repr__(self):\n return f\"<{self.name} points={self.points} scored={self.scored} missed={self.missed}>\"\n\nN = int(input().strip())\nteams = {}\nfor i in range(N):\n name = input().strip()\n teams[name] = Score(name=name, points=0, scored=0, missed=0)\n\nfor i in range((N * (N - 1)) // 2):\n toks = input().strip().split()\n assert len(toks) == 2\n names = toks[0].split(\"-\")\n nums = [int(x) for x in toks[1].split(\":\")]\n\n for j in range(2):\n teams[names[j]].scored += nums[j]\n teams[names[1 - j]].missed += nums[j]\n if nums[0] > nums[1]:\n teams[names[0]].points += 3\n elif nums[0] < nums[1]:\n teams[names[1]].points += 3\n else:\n teams[names[0]].points += 1\n teams[names[1]].points += 1\n\nteamsl = list(teams.values())\nteamsl.sort(key=lambda x: (x.points, x.scored - x.missed, x.scored),\n reverse=True)\nfor i in range(N):\n print(teamsl[i], file=sys.stderr)\nfor x in sorted([t.name for t in teamsl[:N//2]]):\n print(x)\n", "n = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n d[input()] = [0, 0, 0]\r\n \r\nfor i in range(n * (n - 1) // 2):\r\n\tt, s = input().split()\r\n\tt1, t2 = t.split('-')\r\n\ts1, s2 = [int(x) for x in s.split(':')]\r\n\ta = d[t1]\r\n\tb = d[t2]\r\n\ta[2] += s1\r\n\tb[2] += s2\r\n\ta[1] += s1 - s2\r\n\tb[1] += s2 - s1\r\n\tif s1 == s2:\r\n\t a[0] += 1\r\n\t b[0] += 1\r\n\telif s1 < s2:\r\n\t b[0] += 3\r\n\telse:\r\n\t a[0] += 3\r\nprint('\\n'.join(sorted(b for a, b in sorted((b, a) for a, b in d.items())[n // 2: ])))", "class Info:\r\n def __init__(self, _new_team_name, _new_points, _new_goal_diff, _new_scored_goals):\r\n self.team_name = _new_team_name\r\n self.points = _new_points\r\n self.goal_diff = _new_goal_diff\r\n self.scored_goals = _new_scored_goals\r\n\r\n\r\n# end of class here\r\n# function starts here\r\ndef findIndexByTeamName(container, search_team_name):\r\n for indx, item in enumerate(container):\r\n if item.team_name == search_team_name:\r\n return indx\r\n return -1\r\n\r\n\r\n# function ends here\r\n\r\n\r\nn, cont = int(input()), list()\r\nfor i in range(n):\r\n cont.append(Info(input(), 0, 0, 0))\r\n# 0123456789...\r\n# s='Barcelona-Real 15:10'\r\nfor i in range(n * (n - 1) // 2):\r\n s = input()\r\n dash_index = s.index('-')\r\n space_index = s.index(' ')\r\n colon_index = s.index(':')\r\n team1_name = s[0:dash_index]\r\n team2_name = s[dash_index + 1:space_index]\r\n goal1 = int(s[space_index + 1:colon_index])\r\n goal2 = int(s[colon_index + 1:])\r\n team1_index = findIndexByTeamName(cont, team1_name)\r\n team2_index = findIndexByTeamName(cont, team2_name)\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1_index].points += 3\r\n elif goal1 < goal2:\r\n cont[team2_index].points += 3\r\n else:\r\n cont[team1_index].points += 1\r\n cont[team2_index].points += 1\r\n # update goal difference\r\n cont[team1_index].goal_diff += (goal1 - goal2)\r\n cont[team2_index].goal_diff += (goal2 - goal1)\r\n # update scored goals\r\n cont[team1_index].scored_goals += goal1\r\n cont[team2_index].scored_goals += goal2\r\n\r\n# sort by points, then by goal_diff then by scored_goals in descending order\r\ncont.sort(key=lambda item: (item.points, item.goal_diff, item.scored_goals), reverse=True)\r\n# delete second half of list\r\ndel cont[n // 2:]\r\n# sort by team_name in ascending order alphabeticaly\r\ncont.sort(key=lambda item: item.team_name)\r\n\r\n# output only team names using foreach loop\r\nfor item in cont:\r\n print(item.team_name)\r\n", "n = int(input())\r\n \r\nclass Command:\r\n def __init__(self, name):\r\n self.name = name\r\n self.score = 0\r\n self.z = 0\r\n self.p = 0\r\n \r\n def get_r(self):\r\n return self.z - self.p\r\n \r\narr = {}\r\n \r\nfor i in range(n):\r\n name = input()\r\n arr[name] = Command(name)\r\n \r\nfor i in range((n * (n - 1)) // 2):\r\n string = input()\r\n \r\n first, second = string.split()\r\n name1, name2 = first.split('-')\r\n num1, num2 = second.split(\":\")\r\n \r\n num1, num2 = int(num1), int(num2)\r\n \r\n if num1 > num2:\r\n arr[name1].score += 3\r\n elif num1 < num2:\r\n arr[name2].score += 3\r\n else:\r\n arr[name1].score += 1\r\n arr[name2].score += 1\r\n \r\n arr[name1].z += num1\r\n arr[name1].p += num2\r\n \r\n arr[name2].z += num2\r\n arr[name2].p += num1\r\narr = list(arr.values())\r\n \r\nfor i in range(len(arr)):\r\n for j in range(len(arr) - 1):\r\n if arr[j].score < arr[j + 1].score:\r\n arr[j], arr[j + 1] = arr[j + 1], arr[j]\r\n elif arr[j].score == arr[j + 1].score:\r\n if arr[j].get_r() < arr[j + 1].get_r():\r\n arr[j], arr[j + 1] = arr[j + 1], arr[j]\r\n elif arr[j].get_r() == arr[j + 1].get_r():\r\n if arr[j].z < arr[j + 1].z:\r\n arr[j], arr[j + 1] = arr[j + 1], arr[j]\r\nans = []\r\nfor i in range(len(arr) // 2):\r\n ans.append(arr[i].name)\r\n \r\nans.sort()\r\nfor i in ans:\r\n print(i)", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoaredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoaredGoals = newScoaredGoals\r\n\r\n\r\n# our function here\r\n# find index of object in array/list by teamName\r\ndef indexOfByTeamName(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nN = int(input())\r\ncont = []\r\n\r\nfor i in range(N):\r\n # inpTeamName = input()\r\n # obj = Info(inpTeamName,0,0,0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n'''\r\n 0123456789.....\r\ns='Barcelona-Real 15:10'\r\n'''\r\nfor i in range(N * (N - 1) // 2):\r\n s = input()\r\n dashIndex = s.index('-')\r\n spaceIndex = s.index(' ')\r\n colonIndex = s.index(':')\r\n\r\n team1Name = s[0:dashIndex]\r\n team2Name = s[dashIndex + 1:spaceIndex]\r\n goal1 = int(s[spaceIndex + 1:colonIndex])\r\n goal2 = int(s[colonIndex + 1:])\r\n\r\n team1Index = indexOfByTeamName(cont, team1Name)\r\n team2Index = indexOfByTeamName(cont, team2Name)\r\n\r\n # update Points\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal2 > goal1:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # update goal difference\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n # update scored goals\r\n cont[team1Index].scoaredGoals += goal1\r\n cont[team2Index].scoaredGoals += goal2\r\n\r\n# sort by points, then by GoalDifference, then by scoredGoals in descending order\r\ncont.sort(key=lambda item: (item.points, item.goalDiff, item.scoaredGoals), reverse=True)\r\n# remove second half of list\r\ndel cont[N // 2:]\r\n# sort by teamName in ascending order\r\ncont.sort(key=lambda item: item.teamName)\r\n\r\n#outpun\r\nfor item in cont:\r\n print(item.teamName)\r\n", "n = int(input())\r\na = [[0, 0, 0, ''] for _ in range(n)]\r\nm = {}\r\nfor i in range(n):\r\n m[input()] = i\r\nfor i in range(n * (n - 1) // 2):\r\n s = input().split()\r\n s = s[0].split('-') + s[1].split(':')\r\n s[2] = int(s[2])\r\n s[3] = int(s[3])\r\n a[m[s[0]]][3] = s[0]\r\n a[m[s[1]]][3] = s[1]\r\n if s[2] > s[3]:\r\n a[m[s[0]]][0] += 3\r\n elif s[2] == s[3]:\r\n a[m[s[0]]][0] += 1\r\n a[m[s[1]]][0] += 1\r\n else:\r\n a[m[s[1]]][0] += 3\r\n a[m[s[0]]][1] += s[2] - s[3]\r\n a[m[s[0]]][2] += s[2]\r\n a[m[s[1]]][1] += s[3] - s[2]\r\n a[m[s[1]]][2] += s[3]\r\na.sort(key=lambda x: (x[0], x[1], x[2]), reverse=True)\r\nb = []\r\nfor i in range(n // 2):\r\n b.append(a[i][3])\r\nfor x in sorted(b):\r\n print(x)\r\n", "from operator import itemgetter\r\nn=int(input())\r\n_T=[]\r\nT=[]\r\nZ=[]\r\nfor i in range(n):\r\n q=input()\r\n _T.append(q)\r\n T.append([q,0,0,0])\r\nfor i in range(int(n*(n-1)/2)):\r\n c=list(map(str,input().split(\" \")))\r\n t1,t2=list(map(str,c[0].split(\"-\")))\r\n s1,s2=list(map(int,c[1].split(\":\")))\r\n i1=_T.index(t1)\r\n i2=_T.index(t2)\r\n if s1>s2:\r\n T[i1][1]+=3\r\n if s2>s1:\r\n T[i2][1]+=3\r\n if s2==s1:\r\n T[i1][1]+=1\r\n T[i2][1]+=1\r\n T[i1][2]+=s1-s2\r\n T[i2][2]+=s2-s1\r\n T[i1][3]+=s1\r\n T[i2][3]+=s2\r\nT.sort(key=itemgetter(1,2,3),reverse=True)\r\nfor t in T[:int(n/2)]:\r\n Z.append(t[0])\r\nZ.sort()\r\nprint(\"\\n\".join(Z))", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def __str__(self):\r\n pattern = '\\n*************************\\n'\r\n pattern += f'teamName: {self.teamName} \\n'\r\n pattern += f'points: {self.points} \\n'\r\n pattern += f'goalDiff: {self.goalDiff} \\n'\r\n pattern += f'scoredGoals: {self.scoredGoals} \\n'\r\n pattern += '*************************\\n'\r\n return pattern\r\n\r\n def __eq__(self, other):\r\n if isinstance(other, Info):\r\n return self.teamName == other.teamName and \\\r\n self.points == other.points and \\\r\n self.goalDiff == other.goalDiff and \\\r\n self.scoredGoals == other.scoredGoals\r\n return False\r\n\r\n\r\n# end of class here\r\n\r\ndef findIndexByName(cont: list, searchName: str) -> int:\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i;\r\n return -1\r\n\r\n\r\ndef output(cont):\r\n for item in cont:\r\n print(item)\r\n\r\n\r\nn, cont = int(input()), list()\r\n\r\nfor i in range(n):\r\n # tName = input()\r\n # obj = Info(tName, 0, 0, 0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\nfor i in range(n * (n - 1) // 2):\r\n line = input()\r\n slashInd = line.index('-')\r\n spaceInd = line.index(' ')\r\n colonInd = line.index(':')\r\n\r\n team1Name = line[0:slashInd]\r\n team2Name = line[slashInd + 1: spaceInd]\r\n goal1 = int(line[spaceInd + 1: colonInd])\r\n goal2 = int(line[colonInd + 1:])\r\n\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # update goaldiff\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n\r\n # update scoredGoals\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n# end of for loop here\r\n# sort by points, then by goalDiff, and then by scoredGoals in descending order\r\n\r\n# print('before')\r\n# output(cont)\r\ncont.sort(key=lambda item: (item.points, item.goalDiff, item.scoredGoals), reverse=True)\r\n# print('\\nafter')\r\n# output(cont)\r\ndel cont[n // 2:]\r\n# output(cont)\r\ncont.sort(key=lambda item: item.teamName)\r\n#output(cont)\r\nfor item in cont:\r\n print(item.teamName)\r\n\r\n'''\r\n 0123456789......\r\nline = 'barcelona-real 15:10'\r\n-------------------------\r\n4\r\nA\r\nB\r\nC\r\nD\r\nA-B 1:1\r\nA-C 2:2\r\nA-D 1:0\r\nB-C 1:0\r\nB-D 0:3\r\nC-D 0:3\r\n\r\n\r\n 0 1 \r\ncont = |teamName: 'A' |\r\n |points: \r\n'''\r\n", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def __str__(self):\r\n return f\"[teamName: '{self.teamName}', \" + \\\r\n f\"points: {self.points}, \" + \\\r\n f\"goalDiff: {self.goalDiff} \" + \\\r\n f\"scoredGoals: {self.scoredGoals}]\"\r\n\r\n\r\ndef output(cont):\r\n for item in cont:\r\n print(item)\r\n\r\n\r\ndef findIndexByName(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nN = int(input())\r\n\r\ncont = []\r\n\r\nfor i in range(N):\r\n # newTeamName = input()\r\n # obj = Info(newTeamName, 0, 0, 0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\nfor i in range(N * (N - 1) // 2):\r\n line = input()\r\n dashInd = line.index('-')\r\n spaceInd = line.index(' ')\r\n colonInd = line.index(':')\r\n team1Name = line[:dashInd]\r\n team2Name = line[dashInd + 1:spaceInd]\r\n goal1 = int(line[spaceInd + 1:colonInd])\r\n goal2 = int(line[colonInd + 1:])\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n # update Points\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal1 < goal2:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # Update GoalDiff\r\n cont[team1Index].goalDiff += (goal1 - goal2)\r\n cont[team2Index].goalDiff += (goal2 - goal1)\r\n # Update Scored Goals\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n\r\ncont.sort(key=lambda obj: (obj.points, obj.goalDiff, obj.scoredGoals), reverse=True)\r\n\r\ndel cont[N // 2 :]\r\ncont.sort(key = lambda obj : obj.teamName)\r\nfor item in cont:\r\n print(item.teamName)\r\n", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def __str__(self):\r\n temp = '\\n**************\\n'\r\n temp += f'teamName: {self.teamName} \\n'\r\n temp += f'points: {self.points} \\n'\r\n temp += f'goalDiff: {self.goalDiff} \\n'\r\n temp += f'scoredGoals: {self.scoredGoals} \\n'\r\n temp += '**************\\n'\r\n return temp\r\n\r\n\r\n# end of class\r\ndef findIndexByName(cont: list, searchName: str) -> int:\r\n ln = len(cont)\r\n for i in range(ln):\r\n if searchName == cont[i].teamName:\r\n return i\r\n return -1\r\n\r\n\r\ndef output(cont: list):\r\n for item in cont:\r\n print(item)\r\n\r\n\r\nn, cont = int(input()), []\r\nfor i in range(n):\r\n # obj = Info(input(), 0, 0, 0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\nfor i in range(n * (n - 1) // 2):\r\n line = input()\r\n dashInd = line.index('-')\r\n spaceInd = line.index(' ')\r\n colonInd = line.index(':')\r\n\r\n team1Name = line[:dashInd]\r\n team2Name = line[dashInd + 1:spaceInd]\r\n score1 = int(line[spaceInd + 1:colonInd])\r\n score2 = int(line[colonInd + 1:])\r\n team1Ind = findIndexByName(cont, team1Name)\r\n team2Ind = findIndexByName(cont, team2Name)\r\n # update points\r\n if score1 > score2:\r\n cont[team1Ind].points += 3\r\n elif score1 < score2:\r\n cont[team2Ind].points += 3\r\n else:\r\n cont[team1Ind].points += 1\r\n cont[team2Ind].points += 1\r\n\r\n # uptade goalDiff\r\n cont[team1Ind].goalDiff += score1 - score2\r\n cont[team2Ind].goalDiff += score2 - score1\r\n\r\n # update scoredGoals\r\n cont[team1Ind].scoredGoals += score1\r\n cont[team2Ind].scoredGoals += score2\r\n\r\ncont.sort(key=lambda it: (it.points, it.goalDiff, it.scoredGoals), reverse=True)\r\n\r\ndel cont[n//2:]\r\n\r\ncont.sort(key=lambda it: it.teamName)\r\n#output(cont)\r\nfor item in cont:\r\n print(item.teamName)\r\n\r\n\r\n'''\r\n 0123456789....\r\nline = 'barsa-real 15:10'\r\n-------------------------------\r\n4\r\nA\r\nB\r\nC\r\nD\r\nA-B 1:1\r\nA-C 2:2\r\nA-D 1:0\r\nB-C 1:0\r\nB-D 0:3\r\nC-D 0:3\r\n\r\npoints goalDiff scoredGoals\r\nA -> 1+1+3=5 A -> (1+2+1)-(1+2+0) = 4-3=1 A -> 4\r\nB -> 1+3+0=4 B -> (1+1+0)-(1+0+3) = 2-4=-2 B -> 2\r\nC -> 1+0+0=1 C -> (2+0+0)-(2+1+3) = 2-6=-4 C -> 2\r\nD -> 0+3+3=6 D -> (0+3+3)-(1+0+0) = 6-1=5 D -> 6\r\n\r\nA, B, C, D -> D, A, B, C -> D, A -> A, D\r\n 0\r\n| teamName: 'A' |\r\n| points: 5 |\r\n| goalDiff: 1 |\r\n| scoredGoals: 4|\r\n\r\n'''\r\n", "class Info:\r\n def __init__(self, newTeamName, newPoints, newGoalDiff, newScoredGoals):\r\n self.teamName = newTeamName\r\n self.points = newPoints\r\n self.goalDiff = newGoalDiff\r\n self.scoredGoals = newScoredGoals\r\n\r\n def __str__(self):\r\n return f\"[teamName: '{self.teamName}',points: {self.points},\" \\\r\n f\"goalDiff: {self.goalDiff},socreadGoals: {self.scoredGoals}]\"\r\n\r\n\r\n# obj = Info('Manchester', 10, 20, 30)\r\n# print(obj)\r\n\r\ndef output(cont):\r\n for item in cont:\r\n print(item)\r\n\r\n\r\ndef findIndexByName(cont, searchName):\r\n for i in range(len(cont)):\r\n if cont[i].teamName == searchName:\r\n return i\r\n return -1\r\n\r\n\r\nN = int(input())\r\ncont = []\r\nfor i in range(N):\r\n # newTeamName = input()\r\n # obj = Info(newTeamName, 0, 0, 0)\r\n # cont.append(obj)\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\n# output(cont)\r\n'''\r\n 01234567890123456789\r\nline = \"Barcelona-Real 15:10\"\r\n'''\r\nfor i in range(N * (N - 1) // 2):\r\n Line = input()\r\n dashInd = Line.index('-')\r\n spaceInd = Line.index(' ')\r\n colonInd = Line.index(':')\r\n team1Name = Line[:dashInd]\r\n team2Name = Line[dashInd + 1:spaceInd]\r\n goal1 = int(Line[spaceInd + 1:colonInd])\r\n goal2 = int(Line[colonInd + 1:])\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n # update points\r\n if goal1 > goal2:\r\n cont[team1Index].points += 3\r\n elif goal2 > goal1:\r\n cont[team2Index].points += 3\r\n else:\r\n cont[team1Index].points += 1\r\n cont[team2Index].points += 1\r\n\r\n # updateGoaldiff\r\n cont[team1Index].goalDiff += goal1 - goal2\r\n cont[team2Index].goalDiff += goal2 - goal1\r\n\r\n # updateScoredGoals\r\n cont[team1Index].scoredGoals += goal1\r\n cont[team2Index].scoredGoals += goal2\r\n\r\ncont.sort(key=lambda obj: (obj.points, obj.goalDiff, obj.scoredGoals), reverse=True)\r\ndel cont[N // 2:]\r\ncont.sort(key=lambda obj: obj.teamName)\r\n\r\nfor item in cont:\r\n print(item.teamName)\r\n#output(cont)\r\n", "#!/usr/bin/env python3\n\nfrom collections import defaultdict\n\ndef score(x, y):\n if x > y:\n return 3\n if x == y:\n return 1\n return 0\n\nn = int(input())\nplayers = [input() for _ in range(n)]\nmp = defaultdict(lambda:[0, 0, 0])\n\nfor _ in range(n*(n-1)//2):\n part1, part2 = input().split()\n p1, p2 = part1.split('-')\n g1, g2 = [int(x) for x in part2.split(':')]\n\n mp[p1][0] += score(g1, g2)\n mp[p1][1] += g1 - g2 \n mp[p1][2] += g1\n \n mp[p2][0] += score(g2, g1)\n mp[p2][1] += g2 - g1\n mp[p2][2] += g2\n \nprint(\"\\n\".join(sorted(map(\n lambda v:v[-1],\n list(reversed(sorted(\n v + [k]\n for k, v\n in mp.items()\n)))[:n//2]))))", "n = int(input())\nres = {input(): [0, 0, 0] for i in range(n)}\nfor i in range(n * (n - 1) // 2):\n teams, score = input().split()\n team1, team2 = teams.split(\"-\")\n sc1, sc2 = map(int, score.split(\":\"))\n if sc1 > sc2:\n res[team1][0] += 3\n elif sc2 > sc1:\n res[team2][0] += 3\n else:\n res[team1][0] += 1\n res[team2][0] += 1\n res[team1][1] += sc1 - sc2\n res[team2][1] += sc2 - sc1\n res[team1][2] += sc1\n res[team2][2] += sc2\ntable = sorted(((res[key], key) for key in res), reverse=True)\nprint(\"\\n\".join(sorted([row[1] for row in table[:n // 2]])))\n", "#19A - Football Cup\r\n# team <-> scores dictionary\r\nscore = {}\r\n#Number of teams:\r\nn = int(input())\r\n#For each team:\r\nfor i in range(n):\r\n #Get the names of the team:\r\n team = input()\r\n #The team's score added in the dictionary: 1st, 2nd and 3rd criteria\r\n score[team] = [0,0,0]\r\n#Now, we get info about the teams that played and the scores for each game: \r\nfor i in range(n*(n-1)//2):\r\n s = input().split()\r\n teams = s[0].split('-')\r\n \r\n #1st team\r\n first = teams[0]\r\n #2nd team\r\n second = teams[1]\r\n \r\n scores = s[1].split(':')\r\n #1st team's score:\r\n first_score = int(scores[0])\r\n #2nd team's score# score for a\r\n second_score = int(scores[1])\r\n \r\n#Now, we apply the 3 sorting criteria:\r\n if first_score < second_score:\r\n\r\n score[second][0] += 3\r\n \r\n score[second][1] = score[second][1] + second_score - first_score\r\n score[second][2] += second_score\r\n \r\n score[first][1] = score[first][1] + first_score - second_score\r\n score[first][2] += first_score\r\n \r\n if first_score > second_score:\r\n score[first][0] += 3\r\n score[first][1] += first_score - second_score\r\n score[first][2] += first_score\r\n \r\n score[second][1] += second_score - first_score\r\n score[second][2] += second_score\r\n \r\n elif first_score == second_score:\r\n score[first][0] += 1\r\n score[first][1] += first_score - second_score\r\n score[first][2] += first_score\r\n \r\n score[second][0] += 1\r\n score[second][1] += second_score - first_score\r\n score[second][2] += second_score\r\n \r\n# print(score)\r\nresults = []\r\n# team = key , # score = list of scores for each team\r\nfor team, score in score.items():\r\n results.append([score[0], score[1], score[2], team])\r\n \r\n#We sort results in ascending order: \r\nresults = sorted(results)\r\nresults.reverse()\r\n# print(res)\r\n \r\n#List of winners, after all the necessary criteria have been applied: \r\nnw = []\r\n#The first half of the top winners pass the knockout:\r\nfor i in range(n//2):\r\n nw.append(results[i][3])\r\n#We sort the winners in ascending order: \r\nnw = sorted(nw)\r\n#We print each winner as separate objects, in separate lines:\r\nprint(*nw, sep='\\n')", "n = int(input())\r\nteams = {}\r\n\r\nfor _ in range(n):\r\n teams[input()] = [0, 0, 0]\r\n\r\nfor _ in range((n * ( n - 1)) // 2):\r\n temp = input().split()\r\n teamA, teamB = map(str, temp[0].split('-'))\r\n scoreA, scoreB = map(int, temp[1].split(':'))\r\n\r\n if scoreA == scoreB:\r\n pointsA = pointsB = 1\r\n elif scoreA > scoreB:\r\n pointsA, pointsB = 3, 0\r\n else:\r\n pointsA, pointsB = 0, 3\r\n \r\n teams[teamA][2], teams[teamB][2] = teams[teamA][2] + pointsA, teams[teamB][2] + pointsB\r\n teams[teamA][1], teams[teamB][1] = teams[teamA][1] + scoreA, teams[teamB][1] + scoreB\r\n teams[teamA][0], teams[teamB][0] = teams[teamA][0] + scoreA - scoreB, teams[teamB][0] + scoreB - scoreA\r\n\r\ntable = sorted(teams.items(), key = lambda x : x[1][1], reverse=True)\r\ntable.sort(key = lambda x : x[1][0], reverse=True)\r\ntable.sort(key = lambda x : x[1][2], reverse=True)\r\n\r\nwinners = [table[k][0] for k in range(n // 2)]\r\nwinners.sort()\r\n\r\nfor x in winners:\r\n print(x)\r\n \r\n ", "import sys\n# from itertools import product\nimport logging\nlogging.root.setLevel(level=logging.INFO)\n\nteam_size = int(sys.stdin.readline())\nteams = {}\nfor _ in range(team_size):\n name = sys.stdin.readline().strip()\n teams[name] = {\n \"point\":0,\n \"delta\":0,\n \"score\":0\n }\ncontest_size = team_size*(team_size-1)//2\nlogging.info(teams)\nfor _ in range(contest_size):\n team, score = sys.stdin.readline().strip().split()\n team1,team2 = team.split(\"-\")\n score1, score2 = map(int,score.split(\":\"))\n logging.info(team1)\n logging.info(score1)\n logging.info(team2)\n logging.info(score2)\n teams[team1][\"score\"] += score1\n teams[team2][\"score\"] += score2\n teams[team1][\"delta\"] += score1 - score2\n teams[team2][\"delta\"] += score2 - score1\n teams[team1][\"point\"] += bool(score1 >= score2) + 2*bool(score1 > score2)\n teams[team2][\"point\"] += bool(score2 >= score1) + 2*bool(score2 > score1)\n\nlogging.info(teams)\nrank = sorted(teams.keys(),key = lambda x:(teams[x]['point'],teams[x]['delta'],teams[x]['score']),reverse=True)\nlogging.info(rank)\nknockout = rank[:team_size//2]\nknockout.sort()\nprint(\"\\n\".join(knockout))", "import re\n\nn = int(input())\ntimes = dict()\nfor i in range(n):\n times[input()] = [0,0,0]\n\nnumt = n*(n-1)//2\nfor j in range(numt):\n text = input()\n t1,t2,num1,num2 = re.split(' |-|:',text)\n num1,num2 = int(num1), int(num2)\n \n if num1 > num2:\n times[t1][0] += 3\n elif num1 < num2:\n times[t2][0] += 3\n else:\n times[t1][0] += 1\n times[t2][0] += 1\n \n times[t1][1] += num1 - num2\n times[t2][1] += num2 - num1\n times[t1][2] += num1\n times[t2][2] += num2\n\nprint('\\n'.join(sorted(b for a, b in sorted((b, a) for a, b in times.items())[n // 2: ])))\n\n\t \t \t \t\t\t\t \t \t \t\t \t \t \t", "# LUOGU_RID: 127228014\na=int(input());b={}\r\nfor i in range(a):b[input()]=[0,0,0]\r\nfor i in range(a*(a-1)//2):\r\n c=input().split();c[0]=c[0].split('-');c[1]=list(map(int,c[1].split(':')));b[c[0][0]][1]+=c[1][0]-c[1][1];b[c[0][0]][2]+=c[1][0];b[c[0][1]][1]+=c[1][1]-c[1][0];b[c[0][1]][2]+=c[1][1]\r\n if c[1][0]>c[1][1]:b[c[0][0]][0]+=3\r\n elif c[1][0]<c[1][1]:b[c[0][1]][0]+=3\r\n else:b[c[0][0]][0]+=1;b[c[0][1]][0]+=1\r\ndef r(i):return b[i]\r\nfor i in sorted(sorted(b,key=r,reverse=1)[:a//2]):print(i)", "# our class starts here\r\nclass Info:\r\n def __init__(self, _team_name, _points, _goal_diff, _scored_goals):\r\n self.TeamName = _team_name\r\n self.Points = _points\r\n self.GoalDiff = _goal_diff\r\n self.ScoredGoals = _scored_goals\r\n\r\n\r\n# our class ends here\r\n# our function here\r\n# find index of element in list of Info class by teamName\r\ndef findIndexByName(container, _team_name):\r\n for indx, item in enumerate(container):\r\n if item.TeamName == _team_name:\r\n return indx\r\n return -1\r\n\r\n\r\n# end our function\r\n\r\nn = int(input())\r\ncont = []\r\nfor i in range(n):\r\n cont.append(Info(input(), 0, 0, 0))\r\n\r\n# 0123456789....\r\n# 'Barcelona-Real 15:10'\r\nfor i in range(n * (n - 1) // 2):\r\n s = input()\r\n dashIndex = s.index('-')\r\n spaceIndex = s.index(' ')\r\n colonIndex = s.index(':')\r\n team1Name = s[0:dashIndex]\r\n team2Name = s[dashIndex + 1:spaceIndex]\r\n goal1 = int(s[spaceIndex + 1:colonIndex])\r\n goal2 = int(s[colonIndex + 1:])\r\n team1Index = findIndexByName(cont, team1Name)\r\n team2Index = findIndexByName(cont, team2Name)\r\n # Update Points\r\n if goal1 > goal2:\r\n cont[team1Index].Points += 3\r\n elif goal1 < goal2:\r\n cont[team2Index].Points += 3\r\n else:\r\n cont[team1Index].Points += 1\r\n cont[team2Index].Points += 1\r\n # Update goalDiff\r\n cont[team1Index].GoalDiff += (goal1 - goal2)\r\n cont[team2Index].GoalDiff += (goal2 - goal1)\r\n # Update scored Goals\r\n cont[team1Index].ScoredGoals += goal1\r\n cont[team2Index].ScoredGoals += goal2\r\n\r\n# sort by Points then by goal differecne then by scored goals in descending order\r\ncont.sort(key=lambda item: (item.Points, item.GoalDiff, item.ScoredGoals), reverse=True)\r\n## delete second half of list who ar play outs\r\ndel cont[n // 2:]\r\n# sort by team name in ascending order\r\ncont.sort(key=lambda item: item.TeamName)\r\n#output answer\r\nfor item in cont:\r\n print(item.TeamName)\r\n", "n = int(input())\r\nteams = {}\r\nfor _ in range(n):\r\n teams[input()] = [0, 0, 0]\r\nfor _ in range(n * (n - 1) // 2):\r\n line = input().split()\r\n a, b = line[0].split(\"-\")\r\n x, y = list(map(int, line[1].split(\":\")))\r\n if x > y:\r\n teams[a][0] += 3\r\n elif x < y:\r\n teams[b][0] += 3\r\n else:\r\n teams[a][0] += 1\r\n teams[b][0] += 1\r\n teams[a][1] += x - y\r\n teams[a][2] += x\r\n teams[b][1] += y - x\r\n teams[b][2] += y\r\nteamsList = []\r\nfor team in teams:\r\n teamsList.append([teams[team], team])\r\nteamsList.sort(reverse=True)\r\nans = []\r\nfor k in range(n // 2):\r\n ans.append(teamsList[k][1])\r\nans.sort()\r\nprint(\"\\n\".join(ans))", "n = int(input())\r\nteams = dict()\r\nfor i in range(n):\r\n teams[input()] = [0, 0, 0]\r\nfor i in range(n * (n - 1) // 2):\r\n team, score = input().split()\r\n t1, t2 = team.split('-')\r\n s1, s2 = [int(x) for x in score.split(':')]\r\n a = teams[t1]\r\n b = teams[t2]\r\n a[2] += s1\r\n b[2] += s2\r\n a[1] += s1 - s2\r\n b[1] += s2 - s1\r\n if s1 == s2:\r\n a[0] += 1\r\n b[0] += 1\r\n elif s1 < s2:\r\n b[0] += 3\r\n else:\r\n a[0] += 3\r\nprint('\\n'.join(sorted(b for a, b in sorted((b, a) for a, b in teams.items())[n // 2:])))\r\n", "d = {}\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n # idx 0: pts\r\n # idx 1: diff\r\n # idx 2: goals scored\r\n d[input()] = [0, 0, 0]\r\n\r\nfor _ in range(n*(n-1) // 2):\r\n pair, result = input().split()\r\n team1, team2 = pair.split('-')\r\n sc1, sc2 = map(int, result.split(':'))\r\n \r\n d[team1][1] += sc1 - sc2\r\n d[team1][2] += sc1\r\n d[team2][1] += sc2 - sc1\r\n d[team2][2] += sc2\r\n\r\n if sc1 == sc2:\r\n d[team1][0] += 1\r\n d[team2][0] += 1\r\n elif sc1 > sc2:\r\n d[team1][0] += 3\r\n else:\r\n d[team2][0] += 3\r\n\r\nres = sorted(d, key=d.get, reverse=True)[:n//2]\r\nprint(*sorted(res), sep='\\n')\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "\r\nn=int(input())\r\n\r\nm={}\r\n\r\nfor i in range(n):\r\n name = str(input())\r\n m[name] = [0,0,0,name]\r\n\r\nfor i in range(n*(n-1)//2):\r\n t,s=map(str,input().split())\r\n t = list(t.split(\"-\"))\r\n s = list(map(int,s.split(\":\")))\r\n\r\n if s[0]==s[1]:\r\n m[t[0]][0]+=1\r\n m[t[1]][0]+=1\r\n elif s[0]>s[1]:\r\n m[t[0]][0] += 3\r\n else:\r\n m[t[1]][0]+=3\r\n\r\n m[t[0]][1]+=(s[0]-s[1])\r\n m[t[1]][1]+=(s[1]-s[0])\r\n m[t[0]][2]+=s[0]\r\n m[t[1]][2]+=s[1]\r\n\r\nr=[m[key] for key in m]\r\nr.sort(key=lambda x:(-x[0],-x[1],-x[2]))\r\n\r\nres = []\r\nfor i in range(n//2):\r\n res.append(r[i][-1])\r\nres.sort()\r\n\r\nfor i in range(n//2):\r\n print(res[i])", "from audioop import reverse\r\nimport sys\r\nfrom unicodedata import name\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nnames = {}\r\nfor _ in range(N):\r\n names[input()] = [0,0,0,0]\r\n\r\nfor _ in range(N*(N-1)//2):\r\n line = input().split(' ')\r\n a,b = line[0].split('-')\r\n ac,bc = map(int, line[1].split(':'))\r\n\r\n if ac>bc:\r\n names[a][0]+=3\r\n names[b][0]-=1\r\n elif ac<bc:\r\n names[a][0]-=1\r\n names[b][0]+=3\r\n \r\n names[a][2]+=ac\r\n names[a][3]+=bc\r\n names[a][1]=names[a][2]-names[a][3]\r\n names[b][2]+=bc\r\n names[b][3]+=ac\r\n names[b][1]=names[b][2]-names[b][3]\r\n\r\n \r\nA = []\r\nfor k,v in names.items():\r\n A.append((v,k))\r\nA.sort(reverse=True)\r\n\r\nans = []\r\nfor i in range(N//2):\r\n ans.append(A[i][1])\r\nans.sort()\r\nfor a in ans:\r\n print(a)\r\n\r\n\r\n", "class heSo:\r\n\r\n def __init__(self) -> None:\r\n self.scoredGoals = 0;\r\n self.missedGoals = 0;\r\n self.points = 0;\r\n\r\nclass solve:\r\n \r\n def __init__(self) -> None:\r\n self.n = 0;\r\n self.team = dict();\r\n\r\n def vao(self) -> None:\r\n self.n = int(input());\r\n for _ in range(self.n):\r\n x = input();\r\n self.team[x] = heSo(); \r\n \r\n def tinhHeSo(self, team1, team2, tiSo) -> None:\r\n diem1, diem2 = map(int,tiSo.split(\":\"));\r\n self.team[team1].scoredGoals += diem1;\r\n self.team[team1].missedGoals += diem2;\r\n self.team[team2].scoredGoals += diem2;\r\n self.team[team2].missedGoals += diem1;\r\n if(diem1 > diem2): self.team[team1].points += 3;\r\n elif(diem1 < diem2): self.team[team2].points += 3;\r\n else:\r\n self.team[team1].points += 1;\r\n self.team[team2].points += 1;\r\n\r\n def comp(self, x):\r\n return x[1].points, x[1].scoredGoals - x[1].missedGoals, x[1].scoredGoals;\r\n\r\n def lam(self) -> None:\r\n for _ in range(self.n * (self.n - 1) // 2):\r\n s1, s2 = input().split(\" \");\r\n team1, team2 = s1.split(\"-\");\r\n self.tinhHeSo(team1, team2,s2);\r\n \"\"\" for i in self.team.items():\r\n print(i[0],\": \", i[1].scoredGoals, i[1].missedGoals, i[1].points, sep= \" \"); \"\"\"\r\n k = sorted(self.team.items(), key= self.comp, reverse= True);\r\n ketQua = [k[i][0] for i in range(self.n // 2)];\r\n ketQua.sort();\r\n for i in ketQua: print(i);\r\n \r\n def ra(self) -> None:\r\n pass;\r\n\r\n\r\ndef main():\r\n p = solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\nmain();\r\n", "n = int(input()) #input number of teams\r\n\r\n#input teams\r\n#using dictionary: team score, difference btw goals and fails, number of goals\r\nstandings = dict()\r\nfor i in range(n):\r\n standings[input()] = [0, 0, 0]\r\n\r\n#input scores and calculate the points\r\n#each team plays n-1 games. In general, there are n*(n-1) mod 2 games\r\nfor i in range(n * (n - 1) // 2):\r\n t, s = input().split() #input teams and the score of their meeting\r\n t1, t2 = t.split('-') #separe the teams\r\n s1, s2 = [int(x) for x in s.split(':')] #separe the score\r\n #make current standings\r\n a = standings[t1] #name team 1\r\n b = standings[t2] #name team 2\r\n a[2] += s1 # number of goals of team 1\r\n b[2] += s2 # number of goals of team 2\r\n a[1] += s1 - s2 #difference btw goals and fails of team 1\r\n b[1] += s2 - s1 #difference btw goals and fails of team 2\r\n if s1 == s2: #score of stand-off\r\n a[0] += 1\r\n b[0] += 1\r\n elif s1 < s2: #score if team 2 wins\r\n b[0] += 3\r\n else: #score if team 1 wins\r\n a[0] += 3\r\n#print result in a column in a sorted way\r\nprint('\\n'.join(sorted(b for a, b in sorted((b, a) for a, b in standings.items())[n // 2: ])))\r\n" ]

[ "from collections import defaultdict, deque\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef bfs(s):\r\n q = deque()\r\n q.append(s)\r\n dist = [-1] * n\r\n dist[s] = 0\r\n while q:\r\n i = q.popleft()\r\n di = dist[i]\r\n for j, c in G[i]:\r\n if dist[j] == -1:\r\n dist[j] = max(di, c)\r\n q.append(j)\r\n return dist\r\n\r\nn = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\nd = defaultdict(lambda : [])\r\nok = 1\r\nfor i in range(n):\r\n ai = a[i]\r\n for j in range(i + 1, n):\r\n if ai[j] ^ a[j][i]:\r\n ok = 0\r\n break\r\n d[ai[j]].append(i * n + j)\r\n if ai[i]:\r\n ok = 0\r\n if not ok:\r\n break\r\nif ok:\r\n root = [i for i in range(n)]\r\n rank = [1 for _ in range(n)]\r\n size = [1 for _ in range(n)]\r\n G = [[] for _ in range(n)]\r\n c = 1\r\n for i in sorted(d.keys()):\r\n for x in d[i]:\r\n u, v = x // n, x % n\r\n if not same(u, v):\r\n unite(u, v)\r\n auv = a[u][v]\r\n G[u].append((v, auv))\r\n G[v].append((u, auv))\r\n c += 1\r\n if not c ^ n:\r\n break\r\n if not c ^ n:\r\n break\r\n for i in range(n):\r\n dist = bfs(i)\r\n ai = a[i]\r\n for x, y in zip(dist, ai):\r\n if x < y:\r\n ok = 0\r\n break\r\n if not ok:\r\n break\r\nans = \"MAGIC\" if ok else \"NOT MAGIC\"\r\nprint(ans)" ]

[ "n = int(input())\nf = [y for y in map(int, input().split())]\n\nim_f = list(set(f))\nok = True\nfor y in im_f:\n index = y - 1\n ok &= f[index] == y\n\nif ok:\n m = len(im_f)\n ind = {}\n for i, y in enumerate(im_f):\n ind[y] = i + 1\n print(m)\n values = []\n for y in f:\n values.append(ind[y])\n print(' '.join(map(str, values)))\n print(' '.join(map(str, im_f)))\n\nelse:\n print(-1)\n\n\n\n", "from bisect import bisect_right\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted(set(a))\r\nm = len(b)\r\ng = [0] * n\r\nh = [0] * m\r\nst = set()\r\nfor i in range(n):\r\n g[i] = bisect_right(b, a[i])\r\nfor i in range(m):\r\n if a[b[i] - 1] != b[i]:\r\n print(-1)\r\n exit(0)\r\n h[i] = b[i]\r\nprint(m)\r\nprint(*g)\r\nprint(*h)", "a = int(input())\r\nb = list(map(int,input().split()))\r\ncount = 1\r\ns = set()\r\nd = list()\r\nf = dict()\r\nsuc = list()\r\nsucc = True\r\nfor i in b:\r\n if i in f:\r\n d.append(f[i])\r\n else:\r\n f[i] = count\r\n suc.append(i)\r\n d.append(count)\r\n count+=1\r\nfor i in range(len(suc)):\r\n if d[suc[i]-1] != i+1:\r\n print(-1)\r\n exit(0)\r\nprint(count-1)\r\nprint(*d)\r\nprint(*suc)", "import sys\r\nfrom collections import defaultdict\r\n\r\ndef debug(x, table):\r\n for name, val in table.items():\r\n if x is val:\r\n print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)\r\n return None\r\n\r\ndef solve():\r\n n = int(input())\r\n f = [int(i) for i in input().split()]\r\n inv = defaultdict(set)\r\n\r\n for i, y in enumerate(f, start=1):\r\n inv[y].add(i)\r\n\r\n # debug(inv, locals())\r\n m = len(inv)\r\n g = [0] * (n + 1)\r\n h = [0] * (m + 1)\r\n\r\n for i, x in enumerate(inv, start=1):\r\n if x not in inv[x]:\r\n print(-1)\r\n return\r\n\r\n for a in inv[x]:\r\n g[a] = i\r\n\r\n h[i] = x\r\n\r\n print(m)\r\n print(*g[1:])\r\n print(*h[1:])\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\nf = [-1] + list(map(int, input().split()))\ng = [-1]*(n+1)\nh = [-1]\nc = 1\nfor i in range(1, n+1):\n\tif(f[i] == i):\n\t\tg[i] = c\n\t\th += [i]\n\t\tc += 1\n\nhinv = {}\nm = len(h)-1\nfor i in range(1, m+1):\n\thinv[h[i]] = i\n\nfor i in range(1, n+1):\n\tif(g[i] == -1):\n\t\ttry:\n\t\t\tg[i] = hinv[f[i]]\n\t\texcept:\n\t\t\tprint(-1)\n\t\t\texit()\nprint(m)\nprint(*g[1:])\nprint(*h[1:])", "import sys\r\n\r\nn = int(input())\r\n\r\nf = [int(x) for x in input().split(' ')]\r\n\r\nimage = set()\r\n\r\nh = []\r\n\r\nfor i, x in enumerate(f):\r\n\tif x not in image:\r\n\t\timage.add(x)\r\n\t\th.append(x)\r\n\r\ninv_h = [None for _ in range(n+1)]\r\n\r\nfor i, x in enumerate(h, 1):\r\n\tinv_h[x] = i\r\n\r\nfor val in h:\r\n\tif f[val-1] != val:\r\n\t\tprint(-1)\r\n\t\tsys.exit()\r\n\r\nprint(len(h))\r\n\r\ng = [None for _ in range(n)]\r\n\r\nfor i in range(n):\r\n\tg[i] = inv_h[f[i]]\r\n\r\nfor x in g:\r\n\tprint(x, end=' ')\r\nprint('')\r\n\r\nfor x in h:\r\n\tprint(x, end=' ')\r\nprint('')\r\n\r\n\r\n\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nf = [0] + list(map(int, input().split()))\r\ns = set(f[1:])\r\nok = 1\r\nfor i in s:\r\n if f[i] ^ i:\r\n ok = 0\r\n break\r\nif not ok:\r\n ans = -1\r\n print(ans)\r\n exit()\r\nm = len(s)\r\nd = dict()\r\ng, h = [], []\r\nfor i in range(1, n + 1):\r\n if not f[i] in d:\r\n h.append(f[i])\r\n d[f[i]] = len(d) + 1\r\n g.append(d[f[i]])\r\nans = [\" \".join(map(str, g)), \" \".join(map(str, h))]\r\nprint(m)\r\nsys.stdout.write(\"\\n\".join(ans))", "n = int(input())\r\nline = list(map(int, input().split()))\r\nh = []\r\nsets = set()\r\nmm = dict()\r\nout = False\r\nfor i in range(len(line)):\r\n element = line[i]\r\n if line[element - 1] != element:\r\n print(-1)\r\n out = True\r\n break\r\n else:\r\n if element not in sets:\r\n h += [element]\r\n mm[element] = len(h) - 1\r\n sets.add(element)\r\nif not out:\r\n g = []\r\n for i in range(n):\r\n element = line[i]\r\n index = mm[element]\r\n g += [index + 1]\r\n if not out:\r\n print(len(h))\r\n print(\" \".join(map(str, g)))\r\n print(\" \".join(map(str, h)))\r\n ", "n = int(input())\r\nf = list(map(int,input().split()))\r\nh={}\r\ng=[]\r\nfor i in f:\r\n if f[i-1]!=i:\r\n print(-1)\r\n exit()\r\n elif i not in h:\r\n h[i]=len(g)\r\n g.append(i)\r\nprint(len(g))\r\nfor i in f:\r\n print(h[i]+1,end=' ')\r\nprint()\r\nprint(*g)\r\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\ndef LI(): return list(map(int, input().split()))\ndef II(): return int(input())\ndef LS(): return input().split()\ndef S(): return input()\n\n\ndef main():\n n = II()\n a = list(map(lambda x: x-1, LI()))\n g = [-1] * n\n h = list(set(a))\n l = len(h)\n d = {}\n for i in range(l):\n hi = h[i]\n g[hi] = i\n for i in range(n):\n if g[i] == -1:\n g[i] = g[a[i]]\n elif g[i] != g[a[i]]:\n return -1\n print(l)\n print(' '.join(map(lambda x: str(x+1), g)))\n return ' '.join(map(lambda x: str(x+1), h))\n\n\nprint(main())\n", "n = int(input())\r\nf = list(map(int, input().split()))\r\nh = list(set(f))\r\nif any(f[i - 1] != i for i in h):\r\n print(-1)\r\n exit()\r\nd = [0] * n\r\nfor i, j in enumerate(h, 1): d[j - 1] = i\r\ng = [d[f[i] - 1] for i in range(n)]\r\nprint(len(h), ' '.join(map(str, g + h)))", "n = int(input())\r\nf = list(map(int, input().split()))\r\nh = []\r\nind_h = [-1] * (n + 1)\r\ng = [0] * n\r\noccs = {}\r\nfor i in range(len(f)):\r\n if f[i] not in occs:\r\n occs[f[i]] = {i + 1}\r\n h.append(f[i])\r\n ind_h[f[i]] = len(h) - 1\r\n g[i] = len(h)\r\n else:\r\n g[i] = ind_h[f[i]] + 1\r\n occs[f[i]].add(i + 1)\r\nfor k in occs:\r\n if k not in occs[k]:\r\n print(-1)\r\n exit()\r\nprint(len(h))\r\nprint(*g)\r\nprint(*h)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = [0]*n\r\nb = []\r\nc = []\r\nptr = 1\r\nfor i in range(n):\r\n if(a[l[i]-1]==0):\r\n c.append(l[i])\r\n a[l[i] - 1]= ptr\r\n ptr+=1\r\n b.append(a[l[i] - 1])\r\nfor i in range(n):\r\n if(c[b[i]-1]!=l[i]):\r\n print(-1)\r\n exit(0)\r\nfor i in range(ptr-1):\r\n if(b[c[i]-1]-1!=i):\r\n print(-1)\r\n exit(0)\r\n\r\n\r\nprint(ptr-1)\r\nfor i in b: print(i,end = \" \")\r\nprint()\r\nfor i in c:print(i,end = \" \")", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip()\r\n\r\nwrite = lambda x: sys.stdout.write(x+\"\\n\"); writef = lambda x: print(\"{:.12f}\".format(x))\r\ndebug = lambda x: sys.stderr.write(x+\"\\n\")\r\nYES=\"Yes\"; NO=\"No\"; pans = lambda v: print(YES if v else NO)\r\nLI = lambda : list(map(int, input().split()))\r\n# sys.setrecursionlimit(3*10**5+10)\r\n\r\nn = int(input())\r\na = list(map(lambda i: int(i)-1, input().split()))\r\nvs = [0]*n\r\nfor v in a:\r\n vs[v] = 1\r\nng = 0\r\nm = sum(vs)\r\ns = sorted(set(a))\r\nassert m==len(s)\r\nindex = {}\r\nfor i,v in enumerate(s):\r\n index[v] = i\r\ng = [0]*n\r\nh = [0]*m\r\nfor v in range(n):\r\n if vs[v]:\r\n if a[v]!=v:\r\n print(-1)\r\n break\r\nelse:\r\n for i in range(n):\r\n g[i] = index[a[i]]\r\n for v,i in index.items():\r\n h[i] = v\r\n print(m)\r\n write(\" \".join(map(str, [v+1 for v in g])))\r\n write(\" \".join(map(str, [v+1 for v in h])))", "import sys\r\n\r\nn = int(input())\r\ns = input().split()\r\na = [int(i) for i in s]\r\na.insert(0,0)\r\n\r\nhash = [0 for i in range(n+1)]\r\ng = [0 for i in range(n+1)]\r\nh = [0 for i in range(n+1)]\r\nindex = 1\r\n\r\nfor i in range(1, n+1):\r\n\tif hash[a[i]] == 0:\r\n\t\tif index>n:\r\n\t\t\tprint(-1)\r\n\t\t\texit()\r\n\t\thash[a[i]]=index\r\n\t\tg[i] = index\r\n\t\th[index] = a[i]\r\n\t\tindex+=1\r\n\telse:\r\n\t\tg[i] = hash[a[i]]\r\n\t\t\r\nfor i in range(1,index):\r\n\tif g[h[i]]!=i:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\r\nprint(index-1)\r\nprint(' '.join([str(i) for i in g[1:n+1]]))\r\nprint(' '.join([str(i) for i in h[1:index]]))", "n = int(input())\nf = [None] + list(map(int, input().split(' ')))\ninvalid = False\n\ng = [None] + [0] * n\nh = [None]\nx_is_f_which = [None] + [0] * n\nm = 0\nvis = [None] + [False] * n\n\nfor i in range(1, n + 1):\n x = f[i]\n if f[x] != x:\n invalid = True\n break\n if not vis[x]:\n vis[x] = True\n m = m + 1\n h.append(x)\n x_is_f_which[x] = m\n\nif invalid:\n print('-1')\nelse:\n for i in range(1, n + 1):\n g[i] = x_is_f_which[f[i]]\n print(m)\n def print_list(l):\n print(' '.join(list(map(str, l[1:]))))\n print_list(g)\n print_list(h)\n\n", "n = int(input())\r\nf = [int(x) - 1 for x in input().split()]\r\np = [-1] * n\r\ng = [0] * n\r\nh = [0] * n\r\nm = 0\r\nfor i in range(n):\r\n if f[i] == i:\r\n p[i] = m\r\n h[m] = i + 1\r\n m += 1\r\n\r\nh = h[:m]\r\n\r\nfor i in range(n):\r\n if p[f[i]] == -1:\r\n print(-1)\r\n exit()\r\n g[i] = p[f[i]] + 1\r\n\r\nprint(m)\r\nprint(\" \".join([str(x) for x in g]))\r\nprint(\" \".join([str(x) for x in h]))", "n = int(input())\r\na = list(map(int, input().split()))\r\ni = 0\r\nh = dict()\r\ng = []\r\nfor x in a:\r\n cur = x\r\n if a[cur - 1] != cur:\r\n print(\"-1\")\r\n quit()\r\n if not h.__contains__(cur):\r\n h[cur] = len(g)\r\n g.append(cur)\r\nprint(len(g))\r\nfor x in a:\r\n print(h[x] + 1, end=\" \")\r\nprint()\r\nfor x in g:\r\n print(x, end=\" \")\r\n", "from collections import defaultdict\n\ndef solve(n, f):\n d = defaultdict(set)\n for i,fi in enumerate(f, 1):\n d[fi].add(i)\n m = len(d)\n g = [0]*n\n h = [0]*m\n for i,(fi,ys) in enumerate(d.items()):\n if fi not in ys:\n return -1, [], []\n h[i] = fi\n for j in ys:\n g[j-1] = i+1\n return m, g, h\n \n \nn = int(input())\nf = list(map(int,input().split()))\nres, g, h = solve(n, f)\nprint(res)\nif res > -1:\n print(' '.join(map(str, g)))\n print(' '.join(map(str, h)))\n", "# [https://codeforces.com/contest/765/submission/24679160]\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ni = 0\r\nh = {}\r\ng = []\r\nfor x in a:\r\n cur = x\r\n if a[cur - 1] != cur:\r\n print(-1)\r\n break\r\n if cur not in h:\r\n h[cur] = len(g)\r\n g.append(cur)\r\nelse:\r\n print(len(g))\r\n for x in a:\r\n print(h[x] + 1, end=\" \")\r\n print()\r\n for x in g:\r\n print(x, end=\" \")" ]

[ "# [https://codeforces.com/contest/629/submission/32426374]\r\nimport math\r\n\r\nn = int(input())\r\np = [0] * n\r\nfor i in range(n):\r\n (r, h) = map(int, input().split())\r\n p[i] = r**2 * h\r\nk = {v: j for j, v in enumerate(sorted(set(p)))}\r\nd = [0] * (len(k) + 1)\r\nfor v in p: \r\n j = k[v]\r\n i = j + 1\r\n q = 0\r\n while j > 0:\r\n q = max(d[j], q)\r\n j -= j & -j\r\n q += v\r\n while i < len(d):\r\n d[i] = max(d[i], q)\r\n i += i & -i\r\nprint(max(d) * math.pi)", "from sys import *\r\nt = list(map(int, stdin.read().split()))\r\np = [t[i + 1] * t[i] ** 2 for i in range(1, len(t), 2)]\r\nk = {v: j for j, v in enumerate(sorted(set(p)))}\r\nd = [0] * (len(k) + 1)\r\nfor v in p: \r\n j = k[v]\r\n i = j + 1\r\n q = 0\r\n while j > 0:\r\n q = max(d[j], q)\r\n j -= j & -j\r\n q += v\r\n while i < len(d):\r\n d[i] = max(d[i], q)\r\n i += i & -i\r\nprint(max(d) * 3.14159265)" ]

[ "n=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nc=0\r\nwhile(len(lst)!=0):\r\n p=lst[0]\r\n del lst[0]\r\n i=lst.index(p)\r\n c+=i\r\n del lst[i]\r\nprint(c)\r\n ", "n=int(input())\r\na=list(map(int, input().split()))\r\nans=0\r\nwhile len(a) > 0:\r\n x=a.pop(0)\r\n ind = a.index(x)\r\n ans += ind\r\n a.pop(ind)\r\n\r\nprint(ans)", "from collections import defaultdict as dc\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmp=dc(lambda:list())\r\nfor i in range(2*n):\r\n mp[arr[i]].append(i)\r\nans=0\r\nst=set()\r\nfor i in arr:\r\n if i in st:continue\r\n tmp=mp[i][1]\r\n ans+=tmp-mp[i][0]-1\r\n for j in mp:\r\n if j in st:continue\r\n if j==i:continue\r\n if mp[j][0]<tmp:mp[j][0]+=1\r\n if mp[j][1]<tmp:mp[j][1]+=1\r\n mp[i][1]=mp[i][0]+1\r\n st.add(i)\r\nprint(ans)", "n = int(input())\r\nlis=[*map(int,input().split())]\r\nans=i=j=0\r\nwhile lis:\r\n fin = lis[i+1:].index(lis[i])+i+1\r\n ans+=(fin-i-1)\r\n lis.pop(fin);\r\n i+=1\r\n if i==len(lis):\r\n break;\r\nprint(ans) ", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nwhile len(a)>0:\r\n if a[0]==a[1]:\r\n a=a[2:]\r\n continue\r\n p=0\r\n for i in range(1,len(a)):\r\n if a[i]==a[0]:\r\n p=i\r\n break\r\n a=a[1:p]+a[p+1:]\r\n ans+=p-1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\nc=0\r\nwhile(i<(2*n-1)):\r\n if a[i]==a[i+1]:\r\n i=i+2\r\n else:\r\n for j in range(i+1,2*n):\r\n if a[j]==a[i]:\r\n k=j\r\n break\r\n for j in range(k,i+1,-1):\r\n a[j],a[j-1]=a[j-1],a[j]\r\n c=c+1\r\n i=i+2\r\nprint(c)", "n = int(input())\n\npairs = [int(i) for i in input().split(\" \")]\n\nN=len(pairs)\nN//=2\nvisited = [False] * (N + 1) \n \nminimumSwaps = 0\n\nfor i in range(2 * N) : \n if (visited[pairs[i]] == False) : \n visited[pairs[i]] = True \n count = 0 \n for j in range( i + 1, 2 * N) : \n if (visited[pairs[j]] == False) : \n count += 1 \n elif (pairs[i] == pairs[j]) : \n minimumSwaps += count \nprint(minimumSwaps)\n \t\t\t \t\t\t \t \t\t \t \t \t\t\t", "n=int(input())\na=list(map(int,input().split()))\nn=n*2\nans=0\nfor i in range(n):\n if a[i]!=0:\n for j in range(i+1,n):\n if a[j]==0:\n continue\n elif a[j]!=a[i]:\n ans+=1\n else:\n a[i]=a[j]=0\n break\nprint(ans)\n\t \t\t\t\t \t\t \t\t \t\t \t \t\t", "j = int(input()) * 2\nl = list(map(int, input().split()))\nfor i in range(0, j, 2):\n if l[i] != l[i + 1]:\n break\nfor j in range(j, 1, -2):\n if l[j - 2] != l[j - 1]:\n break\nl, res = l[i:j], 0\nwhile l:\n i = l.index(l.pop())\n res += len(l) - i - 1\n del l[i]\nprint(res)", "n = int(input())\na = list(map(int, input().split()))\nsol=0\nfor i in range(2*n):\n for j in range(i+1, 2*n):\n if a[i]==a[j]:\n for k in range(j, i+1, -1):\n a[j], a[j-1] = a[j-1], a[j]\n j-=1\n sol+=1\n break\nprint(sol)\n", "n = int(input())\r\n\r\nlineup = [int(x) for x in input().split()]\r\n\r\nswaps = 0\r\n\r\nfor i in range(0, 2 * n, 2):\r\n if lineup[i] != lineup[i + 1]:\r\n j = i + 1 + lineup[i + 1:].index(lineup[i])\r\n lineup[i + 1:j + 1] = [lineup[j]] + lineup[i + 1:j]\r\n swaps += j - i - 1\r\n\r\nprint(swaps)\r\n", "input()\n\na=list(map(int,input().split()))\n\ncnt=0\n\nwhile a:\n\n i=a.index(a.pop(0))\n\n cnt+=i\n\n a.pop(i)\n\nprint(cnt)\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0\r\ni = 0\r\nwhile i < 2 * n:\r\n if a[i] != a[i + 1]:\r\n for j in range(i + 1, 2 * n):\r\n if a[i] == a[j]:\r\n a = a[:i + 1] + [a[j]] + a[i + 1:j] + a[j + 1:]\r\n count += (j - i - 1)\r\n else:\r\n i += 1\r\n i += 1\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split())) \r\nvis = [0]*(n+1) \r\nans =0\r\nfor i in range(len(a)):\r\n if vis[a[i]]==0:\r\n vis[a[i]]=1 \r\n count =0\r\n for j in range(i+1 , 2*n):\r\n if vis[a[j]]==0:\r\n count+=1 \r\n elif a[i]==a[j]:\r\n ans+=count \r\nprint(ans)", "input()\r\na = list(input().split())\r\nans = 0\r\nwhile len(a) > 0:\r\n b = a[1:].index(a[0]) + 1\r\n ans += b - 1\r\n a = a[1:b] + a[b + 1:]\r\nprint(ans)\r\n", "import itertools\r\nimport sys\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n people = list(input().split())\r\n interchanges = 0\r\n for i in range(2 * n):\r\n if people[i] != 0:\r\n # for j in range(i + 1, 2 * n):\r\n j = i + 1\r\n while j <= 2 * n:\r\n if people[i] == people[j]:\r\n people[j] = 0\r\n break\r\n if people[j] != 0:\r\n interchanges = interchanges + 1\r\n j = j + 1\r\n print(interchanges)\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nnum = 0\r\nwhile len(l) > 0:\r\n if l[0] == l[1]:\r\n l = l[2:]\r\n else:\r\n x = l[0]\r\n l = l[1:]\r\n s = l.index(x)\r\n num += s\r\n l.remove(l[s])\r\nprint(num)", "def add(i):\r\n global t\r\n i += 1\r\n while i <= n * 2:\r\n t[i] += 1\r\n i += i & -i\r\n\r\ndef qry(i):\r\n global t\r\n s = 0\r\n while i:\r\n s += t[i]\r\n i -= i & -i\r\n return s\r\n \r\nn = int(input())\r\na = list(map(int, input().strip().split(' ')))\r\nb = [0 for i in range(2 * n + 2)]\r\nt = b.copy()\r\nfor i in range(2 * n):\r\n b[a[i]] = i\r\ns = 0\r\nfor i in range(2 * n):\r\n if b[a[i]] > i:\r\n s += b[a[i]] - i - 1 - qry(b[a[i]]) + qry(i)\r\n add(b[a[i]])\r\n \r\nprint(s)", "# your code goes here\r\n\r\nn = input()\r\nn = int(n)\r\na = [int(i) for i in input().split()]\r\n#print(a)\r\nd = []\r\nl = []\r\nn = 2*n\r\nd = {i:-1 for i in a}\r\n#print(d)\r\n#print(a)\r\n\r\npoint = 0\r\ncount = 0\r\nfor i in range(0,n):\r\n l.append(a[i])\r\n if(d[a[i]] == -1):\r\n # print(str(a[i]) + ' not mapped earlier')\r\n d[a[i]] = 0\r\n elif(d[a[i]] == 0):\r\n d[a[i]] = 1\r\n j = l.index(a[i])\r\n l.pop()\r\n #print(l)\r\n l.insert(j+1,a[i])\r\n #print(str(a[i]) + str(l))\r\n count = count + (i-j-1)\r\n if(j == point):\r\n point = point+2\r\n \r\nprint(count) \r\n \r\n #print(i) \r\n\r\n", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\nc=0\r\nwhile len(a)>0:\r\n\tx=a[0]\r\n\ta.remove(x)\r\n\tc+=a.index(x)\r\n\ta.remove(x)\r\nprint(c)", "input()\r\na=input().split()\r\nans=0\r\nwhile len(a)>0:\r\n at=a[1:].index(a[0])+1\r\n ans+=at-1\r\n a=a[1:at]+a[at+1:]\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()));ans=0\r\nwhile len(arr)!=0:\r\n e=arr.pop(0)\r\n ans+=arr.index(e)\r\n arr.remove(e)\r\nprint(ans)\r\n \r\n\r\n \r\n", "# itne me hi thakk gaye?\nn = int(input())\narr = list(map(int, input().split()))\ncount = 0\nfor ii in range(2*n):\n\ti = arr[ii]\n\tx = arr.index(i)\n\ty = arr.index(i, x+1)\n\tarr1 = arr[:x+1]\n\tarr2 = []\n\tfor z in arr[x+1:]:\n\t\tif z != i:\n\t\t\tarr2.append(z)\n\tnewarr = arr1 + [i] + arr2\n\t# print(newarr)\n\tarr = newarr[::]\n\tcount += abs(x-y) - 1\nprint(count)", "from __future__ import print_function\r\nimport sys\r\nimport math\r\nimport os.path\r\nimport random\r\nfrom queue import deque\r\n\r\nsys.setrecursionlimit(10**9)\r\n\r\nn, = map(int, input().split())\r\na = deque(list(map(int, input().split())))\r\n\r\ns = 0\r\n\r\nfor _ in range(n):\r\n\tx = a.popleft()\r\n\tix = a.index(x)\r\n\ts += ix\r\n\ta.remove(x)\r\n\r\nprint(s)", "import math\r\nimport sys\r\nimport queue\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n res = 0\r\n s = {}\r\n for i in range(n):\r\n if a[i * 2 + 1] != a[i * 2]:\r\n ind = 0\r\n for j in range(i * 2 + 1, 2 * n):\r\n if a[j] == a[i * 2]:\r\n ind = j\r\n break\r\n for j in range(ind, i * 2 + 1, -1):\r\n res += 1\r\n a[j], a[j - 1] = a[j - 1], a[j]\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "\r\n\r\ndef up_map(a):\r\n mapp = dict()\r\n for i in range(len(a)):\r\n if a[i] not in mapp:\r\n mapp[a[i]] = []\r\n mapp[a[i]].append(i)\r\n return mapp\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n res = 0\r\n mapp = up_map(a)\r\n visit = set()\r\n for j in range(len(a)):\r\n curr = a[j]\r\n if curr not in visit:\r\n visit.add(curr)\r\n res += mapp[curr][1] - mapp[curr][0] - 1\r\n a.pop(mapp[curr][1])\r\n a = a[:j+1] + [curr] + a[j+1:]\r\n mapp = up_map(a)\r\n\r\n print(res)\r\n\r\nsolve()", "n = int(input())\ncouples = [* map(int, input().split())] \n\nswap = 0\nfor i in range(0, 2*n, 2):\n val = couples[i]\n if val != couples[i+1]:\n ind = couples.index(val, i+1)\n \n couples.insert(i+1, couples.pop(ind))\n # print(*couples)\n\n swap += ind - (i+1)\n # print(swap)\n\nprint(swap)\n", "n=int(input())\r\nn=n*2\r\nx=[int(i) for i in input().split()] \r\nswap=0 \r\nwhile 0 < n:\r\n temp=x[1:].index(x[0])\r\n swap=swap+temp\r\n x.remove(x[0])\r\n x.remove(x[temp])\r\n n=n-2\r\nprint(swap) \r\n ", "n = int(input())\nt = list(map(int, input().split()))\n\nsw = 0\n\nwhile t != []:\n\tpr = 1 + t[1:].index(t[0])\n\t#print(pr)\n\tsw += pr-1\n\t#print(t[1:pr], t[pr+1:])\n\tt = t[1:pr] + t[pr+1:]\n\t#print(t)\n\nprint(sw)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nm=[]\r\nfor i in range(2*n-1,-1,-1):\r\n if l[i] not in m:\r\n m.append(l[i])\r\n\r\nfor tt in range(0,n):\r\n i=m[tt]\r\n j=l.index(i)\r\n l.pop(j)\r\n k=l.index(i)\r\n l.insert(k,j)\r\n ans+=k-j\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nwhile len(l) != 0:\r\n ans += l.index(l[0], 1) - 1\r\n c = l.pop(0)\r\n l.remove(c)\r\nprint(ans)", "def process(A):\r\n n = len(A)\r\n curr = {}\r\n answer = 0\r\n for i in range(n):\r\n ai = A[i]\r\n if ai not in curr:\r\n curr[ai] = i\r\n else:\r\n i0 = curr[ai]\r\n answer+=(i-i0-1)\r\n curr.pop(ai)\r\n for x in curr:\r\n if i0 < curr[x]:\r\n curr[x]+=1\r\n return answer\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(0, n * 2, 2):\r\n for j in range(i + 1, n * 2):\r\n if a[j] == a[i]:\r\n k = j\r\n while k != i + 1:\r\n a[k - 1], a[k] = a[k], a[k - 1]\r\n ans += 1\r\n k -= 1\r\nprint(ans)", "n = int(input())\npeople = [int(i) for i in input().split()]\n\nswitches = 0\n\nfor i in range(0, 2*n, 2):\n person = people[i]\n other = people.index(person, i+1)\n people.insert(i+1, people[other])\n people.pop(other+1)\n \n switches += other - i - 1\n \nprint(switches)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = []\r\ncount = 0\r\nwhile len(A) != 0:\r\n first_elem = A[0]\r\n i = 1\r\n while i < len(A):\r\n if A[i] == first_elem:\r\n A.pop(i)\r\n A.pop(0)\r\n break\r\n else:\r\n count+=1\r\n i+=1\r\nprint(count)\r\n", "from collections import defaultdict\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n data = list(map(int, input().split()))\r\n right_pos = dict()\r\n\r\n for i, x in enumerate(data):\r\n right_pos[x] = i\r\n\r\n result = 0\r\n\r\n near = set()\r\n\r\n i = 0\r\n\r\n while i < 2 * n:\r\n x = data[i]\r\n if x in near:\r\n i += 1\r\n continue\r\n j = right_pos[x]\r\n if j - i == 1:\r\n near.add(x)\r\n i += 1\r\n continue\r\n while j - i > 1:\r\n result += 1\r\n right_pos[data[j - 1]] = max(right_pos[data[j - 1]], j)\r\n data[j], data[j-1] = data[j-1], data[j]\r\n j -= 1\r\n near.add(x)\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n\r\n\"\"\"\r\n8\r\n7 6 2 1 4 3 3 7 2 6 5 1 8 5 8 4\r\n\r\n\"\"\"\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nwhile len(a)>0:\r\n c=a.pop(0)\r\n i=a.index(c)\r\n ans+=i\r\n del a[i]\r\nprint(ans)", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\nc=list(map(int,input().split()))\r\nans=0\r\n\r\nfor i in range(n):\r\n # match the first person\r\n f=c.pop(0)\r\n g=c.index(f)\r\n c.pop(g)\r\n ans+=g\r\n\r\nprint(ans)", "n=int(input())\na=list(map(int,input().split()))\np=0\nwhile p+1<len(a) and a[p]==a[p+1]:\n p+=2\nc=0\nwhile p<len(a):\n if p+1<len(a):\n i=a.index(a[p],p+1)\n c+=i-p-1\n tmp=a.pop(i)\n a.insert(p,tmp)\n while p+1<len(a) and a[p]==a[p+1]:\n p+=2\nprint(c)", "n = int(input())\na = list(map(int,input().split()))\nc = 0\nwhile len(a) > 0:\n x = a[0]\n a.remove(x)\n c+=a.index(x)\n a.remove(x)\nprint(c)\n", "n=int(input())\r\nli=[*map(int,input().split())]\r\ncount=0\r\nwhile len(li)>0:\r\n\ta=li[0]\r\n\tli.remove(a)\r\n\tcount+=li.index(a)\r\n\tli.remove(a)\r\nprint(count)", "n = 2 * int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(1, len(a), 2):\r\n j = i\r\n while a[j] != a[i - 1]:\r\n j += 1\r\n while j != i:\r\n ans += 1\r\n a[j - 1], a[j] = a[j], a[j - 1]\r\n j -= 1\r\nprint(ans)\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=[1]*(2*n)\r\no=0\r\nfor i in range(2*n-1):\r\n if z[i]==1:\r\n b=a[i+1:].index(a[i])+i+1\r\n z[b]=0\r\n o+=sum(z[i+1:b])\r\nprint(o)", "l = int(input())\na = list(map(int,input().split()))\ncount = 0\ni = 0\nn = 2*l\nwhile (i<n-2):\n if (a[i]==a[i+1]):\n i += 2\n continue\n j = i+2\n while (j<n and a[j]!=a[i]):\n j += 1\n while (j>i+1):\n count += 1\n a[j-1],a[j] = a[j],a[j-1]\n j -= 1\n i += 2\nprint(count)\n", "#!/usr/bin/env python3\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n r = 0\n while a:\n c = a[0]\n del a[0]\n for i in range(len(a)):\n if c == a[i]:\n break\n del a[i]\n r += i\n print(r)\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nwhile arr!=[]:\r\n x = arr[0]\r\n cnt=0\r\n for i in range(1,len(arr)):\r\n if arr[i]==x:\r\n break\r\n else:\r\n cnt+=1\r\n ans+=cnt\r\n temp = []\r\n for i in range(len(arr)):\r\n if arr[i]!=x:\r\n temp.append(arr[i])\r\n arr = temp[::]\r\nprint(ans) ", "n=2*int(input())\r\na=list(map(int,input().split()))\r\nz=0\r\nfor i in range(0,n-1,2):\r\n if a[i]!=a[i+1]:\r\n for j in range(i+1,n):\r\n if a[j]==a[i]:\r\n z+=j-i-1\r\n a.pop(j)\r\n a.insert(i+1,a[i])\r\nprint(z)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\npos = 2*n - 2\nfor i in range(n):\n\tx = a[-1]\n\ta.pop(-1)\n\ty = a.index(x)\n\tans += pos - y\n\tpos -= 2\n\ta.pop(y)\nprint(ans)\n \t \t \t\t\t \t\t \t\t \t \t", "n = int(input())\r\na = input().split()\r\n\r\nfor i in range (0, n+n):\r\n\ta[i] = int(a[i])\r\n\t\r\nans = 0\r\n\r\nfor i in range (0, 2*n-1, 2):\r\n\tx = a[i]\r\n\tif a[i] == a[i+1]:\r\n\t\tcontinue\r\n\tidx = a.index(a[i], i+1)\r\n\tans += idx-i-1\r\n\tdel a[idx]\r\n\ta.insert(i+1, a[i])\r\n\t\r\nprint(ans)\r\n\r\n", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nma=0\r\nwhile(len(l)>0) :\r\n k=(l[1:].index(l[0]))+1\r\n ma+=k-1\r\n l=l[1:k]+l[k+1:]\r\nprint(ma)\r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nans = 0\r\nwhile i < len(l)-1:\r\n if l[i] == l[i+1]:\r\n i = i+1\r\n continue\r\n\r\n j = i+1\r\n ind = -1\r\n while j < len(l):\r\n if l[j] == l[i]:\r\n ind = j\r\n break\r\n\r\n j = j+1\r\n\r\n while ind > i+1:\r\n l[ind],l[ind-1] = l[ind-1],l[ind]\r\n ans += 1\r\n ind -= 1\r\n\r\n i += 1\r\n\r\nprint(ans)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nans=0\r\nwhile len(l)>0:\r\n a=l.pop(0)\r\n ans+=l.index(a)\r\n l.remove(a)\r\nprint(ans)", "n = int(input())\nline = input().split(\" \")\nfor i in range(len(line)):\n line[i] = int(line[i])\n\nans = 0\nwhile len(line) != 0:\n if line[0] == line[1]:\n line.pop(0)\n line.pop(0)\n else:\n first = line.pop(0)\n idx = line.index(first)\n ans += idx\n line.pop(idx)\n\nprint(ans)\n", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(2 * n):\n if a[i] == 0:\n continue\n for j in range(i + 1, 2 * n):\n if a[i] == a[j]:\n a[j] = 0\n break\n ans += (a[j] > 0)\nprint(ans)\n\n\t\t \t\t\t\t\t\t\t \t \t\t \t \t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\ni = 1\r\nj = 0\r\nans = 0\r\nwhile(i<2*n):\r\n if(a[i-1]!=a[i]):\r\n for j in range(i+1, 2*n):\r\n if a[i-1]==a[j]:\r\n ans += j-i\r\n a.pop(j)\r\n a.insert(i,a[i-1])\r\n i += 2\r\nprint(ans)", "n = int(input())\r\n\r\nxs = [int(x) for x in input().split()]\r\n\r\nseen = {}\r\n\r\nres = 0\r\n\r\nwhile xs:\r\n j = xs.index(xs[0], 1)\r\n res += j - 1\r\n xs = xs[1:j] + xs[j+1:]\r\n\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\na = list(map(int, input().split())) \r\nans = 0 \r\nwhile(len(a) > 0):\r\n i = a.pop(0) \r\n j = a.index(i) \r\n ans += j \r\n del a[j] \r\nprint(ans)", "n = int(input())\r\nT = list(map(int, input().split()))\r\nswaps = 0\r\nfor i in range(0, len(T), 2):\r\n for j in range(i + 1, len(T)):\r\n if T[i] == T[j]:\r\n index = j\r\n while T[i] != T[i + 1]:\r\n T[index], T[index - 1] = T[index - 1], T[index]\r\n index -= 1\r\n swaps += 1\r\nprint(swaps)", "# import io, os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nimport sys\r\ninput=sys.stdin.readline\r\n# sys.setrecursionlimit(300010)\r\nMOD = 1000000007\r\nMOD2 = 998244353\r\nii = lambda: int(input().strip('\\n'))\r\nsi = lambda: input().strip('\\n')\r\ndgl = lambda: list(map(int,input().strip('\\n')))\r\nf = lambda: map(int, input().strip('\\n').split())\r\nil = lambda: list(map(int, input().strip('\\n').split()))\r\nls = lambda: list(input().strip('\\n'))\r\nlet = 'abcdefghijklmnopqrstuvwxyz'\r\nn=ii()\r\nl=il()\r\nans=0\r\nwhile len(l)>0:\r\n x=l[0]\r\n l.pop(0)\r\n for j in range(len(l)):\r\n if x==l[j]:\r\n ans+=j\r\n l.pop(j)\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ni=0\r\nmoves = 0\r\nfor i in range(0,len(arr)-1,2):\r\n if arr[i]==arr[i+1]:\r\n # i+=2\r\n pass\r\n else:\r\n n_ind = arr[i+1:].index(arr[i])\r\n arr.pop(n_ind+i+1)\r\n arr.insert(i+1,arr[i])\r\n moves += n_ind\r\n # i+=2\r\n\r\nprint(moves)", "import sys\r\nimport math\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nans=0\r\ni=0\r\nwhile(i<2*n):\r\n\tcurr=0\r\n\tfor j in range(i+1,2*n):\r\n\t\tif(arr[j]==arr[i]):\r\n\t\t\tcurr=j\r\n\t\t\tbreak\r\n\twhile(curr>i+1):\r\n\t\tarr[curr]=arr[curr]+arr[curr-1]\r\n\t\tarr[curr-1]=arr[curr]-arr[curr-1]\r\n\t\tarr[curr]=arr[curr]-arr[curr-1]\r\n\t\tans+=1\r\n\t\tcurr-=1\r\n\ti+=2\r\n\r\nprint(ans)\r\n", "n= int(input())\nl = list(map(int,input().split()))\nk = [-1]*(2*n)\ncnt=0\nfor i in range(2*n):\n if(k[l[i]]==-1): k[l[i]]=i\n else:\n p = l[0:k[l[i]]+1]\n for j in range(k[l[i]]+1,i):\n if(l[j] in p): cnt;\n else: cnt+=1\nprint(cnt)", "n = int(input())\r\nline = [int(x) for x in input().split()]\r\nans = 0\r\nwhile len(line) > 0:\r\n a = line.pop(0)\r\n ans += line.index(a)\r\n line.remove(a)\r\nprint(ans)\r\n", "N=int(input())\r\na=[int(c) for c in input().split()]\r\npos=[-1]*(N+1)\r\npos2=[-1]*(N+1)\r\ncount=0\r\nout=0\r\nfor c in range(2*N):\r\n if pos[a[c]] != -1:\r\n count+=c-pos[a[c]]-1\r\n pos2[a[c]]=c\r\n else:\r\n pos[a[c]]=c\r\nfor c in range(1,N+1):\r\n found=[False]*(N+1)\r\n #print(pos[c]+1,pos2[c]-1)\r\n for d in range(pos[c]+1,pos2[c]):\r\n if found[a[d]]:\r\n out+=1\r\n else:\r\n found[a[d]]=True\r\nprint(out+(count//2))\r\n", "n = int(input())\r\nl = [-1] * n\r\nr = [-1] * n\r\na = list(map(int, input().split()))\r\nfor i in range(2 * n):\r\n x = a[i] - 1\r\n if l[x] == -1: l[x] = i\r\n r[x] = i\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i] < l[j] < r[j] < r[i]: ans += 2\r\nfor i in range(n):\r\n ans += r[i] - l[i] - 1\r\nprint(ans // 2)", "n = input()\r\nguests=[int(i) for i in input().split()]\r\nanswer=0\r\nwhile guests:\r\n i=guests.index(guests.pop(0))\r\n answer+=i\r\n del guests[i]\r\nprint(answer)# 1698055502.581749", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nans=0;\r\nwhile len(l)>0:\r\n\ta=l[0]\r\n\tl=l[1:]\r\n\tans+=l.index(a)\r\n\tl.remove(a)\r\nprint(ans)", "\r\ndef findMinimumAdjacentSwaps(a, n) : \r\n\r\n visited = [0]*(n+1) \r\n ans =0\r\n \r\n for i in range(2*n):\r\n if visited[a[i]]==0:\r\n visited[a[i]]=1 \r\n count =0\r\n for j in range(i+1 , 2*n):\r\n if visited[a[j]]==0:\r\n count+=1 \r\n elif a[i]==a[j]:\r\n ans+=count \r\n return ans\r\n\r\n\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split())) \r\nans = findMinimumAdjacentSwaps(a,n)\r\nprint(ans)\r\n\r\n", "_ = int(input())\nns = list(map(int, input().split()))\nseen = [False for _ in range(len(ns)//2 + 1)]\ncount = 0\nindex = 0\nwhile index != len(ns):\n e = ns[index]\n if seen[e]:\n while ns[index-1] != e:\n ns[index], ns[index-1] = ns[index-1], ns[index]\n seen[ns[index]] = False\n count += 1\n index -= 1\n #print(ns)\n seen[e] = True\n index += 1\nprint(count)\n", "import sys\r\n\r\nn = int(input())\r\nn *= 2\r\na = list(map (int, input().split()))\r\nres = 0\r\nfor i in range (0, n, 2):\r\n if a[i] != a[i+1]:\r\n t = a[i]\r\n for j in range (i+1, n):\r\n if a[j] == t:\r\n for k in range (j, i + 1, -1):\r\n a[k], a[k-1] = a[k-1], a[k]\r\n res += 1\r\n break\r\n \r\n#print (a) \r\nprint (res)", "input()\r\na=[*map(int,input().split())]\r\nc=0\r\nwhile a:\r\n i=a.index(a.pop(0));c+=i;del a[i]\r\nprint(c)", "R = lambda :list(map(int,input().split()))\r\nm = int(input())\r\nn = m*2\r\nl = R()\r\ns = 0\r\ni = 0\r\ntest = 0\r\n\r\nwhile(i<n):\r\n\tfor j in range(i+1,n) :\r\n\t\tif l[j] == l[i] :\r\n\t\t\tif (j-i-1) >0 :\r\n\t\t\t\ts += (j-i-1)\r\n\t\t\t\tl = l[0:i+1] + [l[i]] + l[i+1:j] + l[j+1:]\r\n\t\t\t\ti += 2\r\n\t\t\t\ttest = 1\r\n\t\t\telse :\r\n\t\t\t\ti += 2\r\n\t\t\t\ttest = 1\r\n\t\t\tbreak\r\n\tif test == 0 :\r\n\t\ti += 1\r\n\telse :\r\n\t\ttest = 0\r\n\r\n\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "input()\r\na=input().split()\r\ncnt=0\r\nwhile len(a)>0:\r\n k=a[1:].index(a[0])+1\r\n cnt+=k-1\r\n a=a[1:k]+a[k+1:]\r\nprint(cnt)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(0, 2 * n, 2):\n if a[i] != a[i + 1]:\n for j in range(i + 1, 2 * n, 1):\n if a[j] == a[i]:\n for k in range(j - 1, i, -1):\n tmp = a[k]\n a[k] = a[k + 1]\n a[k + 1] = tmp\n ans += 1\n break\n#print(a)\nprint(ans)\n\n \t \t \t\t\t\t\t\t\t\t\t \t\t\t\t \t\t\t \t\t", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\na = list(map(int, input().split()))\nswaps = 0\nfor i in range(0, 2*n, 2):\n if a[i] == a[i+1]:\n continue\n \n c = a[i]\n j = i + 2\n while c != a[j]:\n j += 1\n \n MIN = i+1\n while j > MIN:\n a[j], a[j-1] = a[j-1], a[j]\n j -= 1\n swaps += 1\n\nprint(swaps)\n" ]

[ "import sys\ninput = sys.stdin.readline\n\nclass DisjointSetUnion:\n def __init__(self, n):\n self.parent = list(range(n))\n self.size = [1] * n\n self.num_sets = n\n\n def find(self, a):\n acopy = a\n while a != self.parent[a]:\n a = self.parent[a]\n while acopy != a:\n self.parent[acopy], acopy = a, self.parent[acopy]\n return a\n\n def union(self, a, b):\n a, b = self.find(a), self.find(b)\n if a != b:\n if self.size[a] < self.size[b]:\n a, b = b, a\n\n self.num_sets -= 1\n self.parent[b] = a\n self.size[a] += self.size[b]\n\n def set_size(self, a):\n return self.size[self.find(a)]\n\n def __len__(self):\n return self.num_sets\n\ncyc = []\n\nn = int(input())\nf = [-1] * (2 * n)\nzz = [0] * (2 * n)\n\nUF = DisjointSetUnion(2 * n)\n\nbad = []\n\nfor _ in range(n):\n u, v = map(int, input().split())\n u -= 1; v -= 1\n\n f[u] = v\n\n if u == v:\n bad.append(u)\n \n if UF.find(u) != UF.find(v):\n UF.union(u, v)\n else:\n cyc.append(u)\n\nfor v in cyc:\n zz[UF.find(v)] = 1\n\nfor v in bad:\n zz[UF.find(v)] = 2\n\nout = 1\nMOD = 10 ** 9 + 7\nfor i in range(2 * n):\n if UF.find(i) == i:\n if zz[i] == 0:\n out *= UF.size[i]\n elif zz[i] == 1:\n out *= 2\n\n out %= MOD\nprint(out)\n\n\n\t \t\t\t \t \t\t\t\t\t \t \t" ]

[ "# Description of the problem can be found at http://codeforces.com/problemset/problem/625/B\r\n\r\nx = input()\r\ns = input()\r\n\r\nprint(x.count(s))", "a = str(input())\r\nb = str(input())\r\nprint(a.count(b))\r\n", "# this is from codeforces problem\r\n\r\nimport re\r\n\r\nstring = input().strip()\r\nsub = input().strip()\r\n\r\nregex = r'%s'%sub\r\nprint(len(re.findall(regex, string)))\r\n", "a=input()\r\nb=input()\r\nc=a.count(b)\r\nprint(c)\r\n\r\n", "\r\ndef match(i, ai, n_ai, pop):\r\n n_pop = len(pop)\r\n j = i\r\n x = 0\r\n while(j < n_ai and x < n_pop):\r\n if ai[j] == pop[x]:\r\n j+=1\r\n x+=1\r\n else:\r\n return False\r\n if x == n_pop:\r\n return True\r\n return False\r\n \r\n\r\n\r\ndef find(ai, pop):\r\n n_ai = len(ai)\r\n n_pop = len(pop)\r\n ans = 0\r\n i = 0\r\n while i< n_ai:\r\n if match(i, ai, n_ai, pop):\r\n i += n_pop\r\n ans+=1\r\n else:\r\n i+=1\r\n return ans\r\n\r\nai = input()\r\npop = input()\r\nprint(find(ai, pop))", "gogol = input()\npineapple = input()\n\nans = 0\nsl = len(gogol)\nspl = len(pineapple)\nl = spl\ni=0\nwhile i<sl:\n if gogol[i:i+l]==pineapple[0:spl+1]:\n ans+=1\n i+=l-1\n i+=1\nprint(ans)\n\t \t \t \t \t \t \t \t \t\t\t\t \t\t \t", "n=input()\r\nm=input()\r\nprint(n.count(m))", "s1=input()\r\ns2=input()\r\nl1=len(s1)\r\nc=0\r\ni=0\r\nl2=len(s2)\r\nwhile i<=len(s1)-len(s2):\r\n if s1[i:i+l2]==s2:\r\n i=i+l2\r\n c+=1\r\n continue\r\n i+=1\r\nprint(c)\r\n", "s=str(input())\r\nt=str(input())\r\nprint(s.count(t))", "s1=input()\r\ns2=input()\r\nper=s1.count(s2)\r\nprint(per)", "#!/usr/bin/env python3\r\nimport sys\r\nsys.setrecursionlimit(300000)\r\n\r\nMOD = 1000000007\r\n\r\ndef solve(s, t):\r\n n = len(s)\r\n m = len(t)\r\n i = 0\r\n ret = 0\r\n while i < n:\r\n if s[i:i + m] == t:\r\n ret += 1\r\n i = i + m\r\n else:\r\n i += 1\r\n print(ret)\r\n return ret\r\n\r\ndef main():\r\n def iterate_tokens():\r\n for line in sys.stdin:\r\n for word in line.split():\r\n yield word\r\n tokens = iterate_tokens()\r\n\r\n # process input2\r\n s = (next(tokens))\r\n t = (next(tokens))\r\n ret = solve(s, t)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b=input(),input();a=a.replace(b,b[:-1]+'#');print(a.count('#'))", "import math\nimport sys\nfrom collections import defaultdict\n#input = sys.stdin.readline\n\nUSE_FILE = False \n\ndef find_substring_indices(s, sub):\n start = 0\n while start < len(s):\n start = s.find(sub, start)\n if start == -1: break\n yield (start, start+len(sub) - 1)\n start += 1\n\ndef main():\n s1 = input()\n s2 = input()\n\n indices = list(find_substring_indices(s1, s2))\n if len(indices) == 0:\n return 0\n r = indices[0][1] \n res = 1\n i = 1\n while i < len(indices):\n if r >= indices[i][0]:\n i += 1\n continue\n else:\n r = indices[i][1]\n res += 1\n i += 1\n return res\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n print(main())\n", "s = input()\r\nt = input()\r\nres = 0\r\nlt = len(t)\r\nx = 0\r\nwhile 1:\r\n\tx = s.find(t, x)\r\n\tif x == -1:\r\n\t\tbreak\r\n\tres+= 1\r\n\tx+= lt\r\nprint(res)", "big_string = input()\r\nname = input()\r\nprint(big_string.count(name))", "ai_name = input()\r\nname = input()\r\nprint(ai_name.count(name))", "s=input()\na=input()\nm=len(a)\nn=len(s)\nc=0\ni=0\nwhile(i<=n-m):\n if(s[i:i+m]==a):\n c+=1\n i=i+m\n else:\n i+=1\nprint(c)\n \t \t\t\t \t \t \t\t\t \t\t\t\t \t", "s = input()\r\ns1 = input()\r\nans = 0\r\ni = 0\r\nwhile i <= len(s) - len(s1):\r\n if s[i:i + len(s1)] == s1:\r\n i += len(s1)\r\n ans += 1\r\n else:\r\n i += 1\r\nprint(ans)", "str1=\"\"\r\nstr2=\"\"\r\nstr1 = input()\r\nstr2=input()\r\nprint(str1.count(str2))", "stringstr1 = str(input())\nstringstr2 = str(input())\nprint(stringstr1.count(stringstr2))\n \t \t \t \t \t\t\t\t \t \t \t \t", "a = input()\r\nb = input()\r\nprint(a.count(b))", "s=input()\r\nx=input()\r\nprint(s.count(x))", "gogol = list(input())\r\npineapple = input()\r\nans = 0\r\nt = \"\"\r\nfor i in range(len(gogol)):\r\n t += gogol[i]\r\n if len(t) > len(pineapple):\r\n t = t[1:]\r\n if t == pineapple:\r\n gogol[i] = \"#\"\r\n ans += 1\r\n t = \"\"\r\nprint(ans)\r\n", "nameStr = input()\r\nsubString = input()\r\ncount = 0\r\nj = len(subString)\r\ni = 0\r\nwhile i < len(nameStr) - j + 1:\r\n if nameStr[i:i + j] == subString:\r\n count += 1\r\n i += j -1\r\n i += 1 \r\nprint(count)", "#using the python function but try using logic\r\n#the naive approach\r\ns=input()\r\na=input()\r\nprint(s.count(a)) ", "a = input()\r\nb = input()\r\nif b not in a:\r\n print(0)\r\nelse:\r\n ans = a.count(b)\r\n print(ans)", "s = input()\r\na = input()\r\ncnt = 0\r\ncnt = s.count(a)\r\nprint(cnt)", "def main():\n google, apple = input(), input()\n res, le = 0, len(apple)\n i = -le\n while True:\n i = google.find(apple, i + le)\n if i == -1:\n break\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "print(str(input()).count(str(input())))", "print(input().count(input()))\n\n\n\n# Made By Mostafa_Khaled", "a = input()\r\nb = input()\r\nans = i = 0\r\nwhile i < len(a):\r\n if a[i:i + len(b)] == b:\r\n ans += 1\r\n i += len(b)\r\n else:\r\n i += 1\r\nprint(ans)", "s=input() \r\nt=input() \r\nprint(s.count(t))", "src = input()\nrep = input()\n\nsrc=src.replace(rep,\"A\")\nprint(src.count(\"A\"))\n \t\t\t\t \t \t\t \t \t \t\t\t \t\t \t\t\t\t", "import sys\r\n\r\ns1 = sys.stdin.readline().strip()\r\ns2 = sys.stdin.readline().strip()\r\n\r\ndef KMPSearch(pat, txt):\r\n M = len(pat)\r\n N = len(txt)\r\n \r\n arr = []\r\n lps = [0]*M\r\n j = 0\r\n \r\n computeLPSArray(pat, M, lps)\r\n \r\n i = 0\r\n while i < N:\r\n if pat[j] == txt[i]:\r\n i += 1\r\n j += 1\r\n \r\n if j == M:\r\n arr.append(i-j)\r\n #print (\"Found pattern at index\", str(i-j))\r\n j = lps[j-1]\r\n \r\n elif i < N and pat[j] != txt[i]:\r\n if j != 0:\r\n j = lps[j-1]\r\n else:\r\n i += 1\r\n return arr\r\n \r\ndef computeLPSArray(pat, M, lps):\r\n len = 0\r\n lps[0]\r\n i = 1\r\n \r\n while i < M:\r\n if pat[i]== pat[len]:\r\n len += 1\r\n lps[i] = len\r\n i += 1\r\n else:\r\n if len != 0:\r\n len = lps[len-1]\r\n \r\n else:\r\n lps[i] = 0\r\n i += 1\r\n \r\nmatches = KMPSearch(s2, s1)\r\n\r\nif len(matches) == 0:\r\n print(0)\r\nelse:\r\n N = len(s1)\r\n M = len(s2)\r\n \r\n count = 0\r\n curr = matches[0]\r\n for i in range(1,len(matches)):\r\n if matches[i] < curr + M:\r\n count += 1\r\n else:\r\n curr = matches[i]\r\n print(len(matches) - count)", "gCountry = str(input())\niCountry = str(input())\n\nprint(gCountry.count(iCountry))\n\n\n \t\t \t\t \t \t\t\t \t \t\t\t \t", "s1=str(input())\nprint(s1.count(str(input())))", "p=input()\r\ng=input()\r\nprint(p.count(g))", "print (input (). count (input ()))", "print(input().count(input()))\n# Mon Jun 21 2021 19:37:16 GMT+0300 (Москва, стандартное время)\n", "def solve(g,p):\n\n\n count = 0\n\n i = 0\n\n while i < len(g):\n if g[i] == p[0]:\n\n if p in g[i:i+len(p)]:\n count += 1\n i = len(p) + i - 1\n i += 1\n\n\n print(count)\n\n\n\n\nif __name__ == '__main__':\n gogol = input()\n pine = input()\n\n\n solve(gogol,pine)", "s=input()\r\nt=input()\r\nk=s.count(t)\r\nprint(k)", "A = input()\nB = input()\nn, m = len(A), len(B)\nfound = False\nlast = 0\nans = 0\nfor i in range(n-m+1):\n for j in range(m):\n if A[i+j] != B[j]: break\n else:\n if not found:\n last = i\n found = True\n elif last + m <= i:\n ans += 1\n last = i\nprint(ans+1 if found else ans)\n", "#war of companies\n\ns = input()\nt = input()\nprint(s.count(t))\n \t \t\t \t \t \t \t\t\t\t \t \t\t", "a,b = input(), input()\r\nprint(a.count(b))", "a=input()\r\nb=input()\r\ncount=a.count(b)\r\nprint(count)\r\n", "google = input()\r\npinapple = input()\r\n\r\nif pinapple not in google:\r\n print(0)\r\n\r\nelse:\r\n amount = 0\r\n\r\n while pinapple in google:\r\n amount += 1\r\n google = google[google.index(pinapple) + len(pinapple):]\r\n print(amount)\r\n", "s=input()\r\nr=input()\r\n\r\nprint(s.count(r))", "a = input()\nb = input()\nblen = len(b)\n\namount = 0\ni = 0\nwhile i < len(a) - blen + 1:\n if a[i:i+blen] == b:\n amount += 1\n i += blen\n else:\n i += 1\n\nprint(amount)", "s=input()\r\ns1=input()\r\nprint(s.count(s1))\r\n", "str = input()\r\nsubstr = input()\r\nprint(str.count(substr))", "ai = input()\r\nphoneName = input()\r\n\r\nres = 0\r\n\r\nwhile phoneName in ai:\r\n ai = ai[ai.find(phoneName)+len(phoneName):]\r\n res += 1\r\n\r\nprint(res)\r\n", "g=input()\r\np=input()\r\ni=0\r\nc=0\r\nwhile i<=len(g)-len(p):\r\n if g[i:i+len(p)]==p:\r\n c+=1\r\n i+=len(p)\r\n else: \r\n i+=1\r\nprint(c)\r\n ", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(S, T):\r\n n = len(S)\r\n m = len(T)\r\n counts = [[] for i in range(n)]\r\n matches = [0 for i in range(n)]\r\n for i in range(n-m+1):\r\n works = True\r\n for j in range(m):\r\n if S[i+j] != T[j]:\r\n works = False\r\n break\r\n if works:\r\n matches[i] = 1\r\n for j in range(m):\r\n counts[i+j].append(i)\r\n answer = 0\r\n for i in range(n):\r\n if matches[i]==1:\r\n answer+=1\r\n for i2 in counts[i+m-1]:\r\n matches[i2] = 0\r\n print(answer)\r\n return\r\n\r\nS = input().decode().strip()\r\nT = input().decode().strip()\r\nprocess(S, T)", "s=input()\r\nss=input()\r\n\r\nans=s.count(ss)\r\n\r\nprint(ans)", "gogol = input()\r\npineapple = input()\r\nprint(gogol.count(pineapple))\r\n", "str1=str(input())\r\nsub_str=str(input())\r\nif(sub_str in str1):\r\n\tprint(str1.count(sub_str))\r\nelse:\r\n\tprint(\"0\")\r\n\r\n", "\n# Problem Link - https://codeforces.com/problemset/problem/625/B\n\ns = input()\ns1 = input()\n\ncount = 0\nif len(s1) > len(s):\n\tprint(0)\nelse:\n\ti = 0\n\twhile i < len(s):\n\t\tif s[i] == s1[0]:\n\t\t\tif s[i:i+len(s1)] == s1:\n\t\t\t\tcount += 1\n\t\t\t\ti = i +len(s1)\n\t\t\t\tcontinue\n\t\ti+= 1\n\n\tprint(count)\n\n", "s=input()\r\nr=input()\r\nprint(s.count(r))\r\n", "s=input()\r\nss=input()\r\nprint(s.count(ss))", "s=input()\r\np=input()\r\nc=0\r\na=-1\r\nfor i in range(len(s)-len(p)+1):\r\n if s[i:i+len(p)]==p:\r\n if a<i:\r\n c+=1\r\n a=i+len(p)-1\r\nprint(c)\r\n \r\n", "import sys\n\ns, subs = [_.strip() for _ in sys.stdin.readlines()]\n\ni = 0\nnum = 0\n\nwhile i < len(s):\n idx = s.find(subs, i)\n if idx == -1:\n break\n num += 1\n i = idx + len(subs)\n\nprint(num)", "\n#Codeforces 625B\ngogol = list(input())\npineapple = list(input())\nlg = len(gogol)\nlp = len(pineapple)\ncount = 0\nfor i in range(0, lg-lp+1):\n\tif gogol[i:i+lp] == pineapple:\n\t\tcount += 1\n\t\tgogol[i+lp-1] = '#'\n\nprint(count)", "def read():\r\n\treturn [int(i) for i in input().split(' ')]\r\n\r\n\r\nai = input()\r\npin = input()\r\nres = 0\r\nwhile ai.find(pin) != -1:\r\n\tq = ai.find(pin)\r\n\tres += 1\r\n\tai = ai[q + len(pin):]\r\n\r\nprint(res)\r\n", "n = input()\r\nm = input()\r\nc=0\r\nn = list(n)\r\nm = list(m)\r\nfor i in range(len(n)):\r\n if n[i:i+len(m)]==m:\r\n n[i+len(m)-1]=-1\r\n c+=1\r\n# print(n)\r\nprint(c)\r\n \r\n ", "s=str(input())\r\nd=str(input())\r\nif(len(d)>len(s)):\r\n print(0)\r\nelse:\r\n print(s.count(d))\r\n", "a = input()\r\nb = input()\r\nk =0\r\ncount =0\r\nwhile k<len(a):\r\n c = a[k:k+len(b)]\r\n if c == b:\r\n count+=1\r\n k+=len(b)-1\r\n k+=1\r\nprint(count)", "hay = input().strip()\nneedle = input().strip()\ndef sunday(hay,needle):\n l_needle,l_hay = len(needle),len(hay)\n if l_needle>l_hay:\n return 0\n needle_dic = {}\n for i,c in enumerate(reversed(needle)):\n if c not in needle_dic:\n needle_dic[c] = i+1\n idx = cnt = 0\n while idx+l_needle<=l_hay:\n next_idx = idx+l_needle\n subStr = hay[idx:next_idx]\n if subStr==needle:\n cnt+=1\n idx = next_idx\n elif next_idx<l_hay and hay[next_idx] in needle_dic:\n idx+=needle_dic[hay[next_idx]]\n else:\n idx = next_idx\n return cnt\nprint(sunday(hay,needle))\n \t \t\t\t \t \t\t \t\t \t\t \t\t \t\t\t\t\t", "print (input().count(input()))", "#War of the Corporations\ns = input()\nt = input()\nprint(s.count(t))\n\t\t \t\t \t \t\t \t \t \t \t\t \t \t\t", "g=input()\r\np=input()\r\nprint(g.count(p))", "# filename 625b.py\r\na = input();\r\nb = input();\r\nkqua = 0\r\ni = 0\r\nwhile i < len(a)-len(b)+1:\r\n ktra = True\r\n for j in range(0,len(b)):\r\n if a[i+j] != b[j]:\r\n ktra = False\r\n break\r\n if ktra:\r\n kqua = kqua + 1\r\n i = i + j + 1;\r\n else:\r\n i = i + 1\r\nprint(kqua)\r\n \r\n", "alert = \"eztask\"\nif 2 ** 2 != 2 ** 2:\n print(\"eztask\")\nelse:\n alert = \"hardtask\"\n google = input()\n apple = input()\n ans = google.count(apple)\n if alert == \"hardtask\":\n print(ans)\n", "hay = input().strip()\nneedle = input().strip()\nimport re\nprint(len(re.findall(needle,hay)))\n\t \t \t\t \t \t \t \t \t\t\t \t\t", "s = input().strip()\nt = input().strip()\nprint(s.count(t))\n \t\t \t \t \t\t \t \t \t \t", "g = input()\na = input()\nal = len(a)\np = g.find(a)\ns = p + al\nc = 0\nwhile p != -1:\n c += 1\n p = g.find(a, s)\n s = p + al\nprint(c)\n \t\t\t \t \t \t \t \t \t\t \t \t", "def minReplacingChar(s1, s2):\r\n return s1.count(s2)\r\n\r\nprint(minReplacingChar(input(), input()))", "str1, str2 = input(), input()\r\nprint(str1.count(str2))", "S=input()\r\nS1=input()\r\nprint(S.count(S1))\r\n", "s = input()\r\nt = input()\r\nans = s.count(t)\r\nprint(ans)", "g = input()\r\na = input()\r\nx = g.count(a)\r\nprint(x)", "def Z_function(string):\r\n Z = []\r\n for i in range(len(string)):\r\n if i == 0:\r\n Z.append(0)\r\n else:\r\n c = 0\r\n for j in range(i, len(string)):\r\n if string[j] != string[j-i]:\r\n break\r\n c+=1\r\n Z.append(c)\r\n return Z\r\n\r\ndef get_indexes(Z, l):\r\n I = []\r\n for i in range(len(Z)):\r\n if Z[i] == l and i-l-1 >= 0:\r\n I.append(i-l-1)\r\n return I\r\n\r\ndef count_min_changes(indexes, l):\r\n i = 0\r\n count = 0\r\n while i < len(indexes):\r\n fst_ind = i\r\n while i < len(indexes) and indexes[i]-indexes[fst_ind] < l:\r\n i+=1\r\n count+=1\r\n return count\r\n\r\ndef main():\r\n II = input()\r\n TEL = input()\r\n\r\n SumString = TEL+'$'+II\r\n\r\n Z = Z_function(SumString)\r\n\r\n indexes = get_indexes(Z, len(TEL))\r\n\r\n print(count_min_changes(indexes, len(TEL)))\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\ns2 = input()\r\nprint(s.count(s2))", "# this is from codeforces problem\r\n\r\nimport re\r\nprint(len(re.findall(string=input().strip(), pattern=r'%s'%input().strip())))\r\n", "ai = str(input().strip())\r\ntd = str(input().strip())\r\nprint(ai.count(td))", "s = input()\nt = input()\nls = len(s)\nlt = len(t)\nk = s[:lt-1]\ncnt = 0\n\nif lt == 1: \n print(s.count(t))\n exit()\n\nfor i in s[lt-1:]:\n if k[-lt+1:]+i == t: \n k += '#' \n cnt += 1\n else: \n k += i\n\nprint(cnt)\n \t\t \t\t\t \t\t\t \t\t \t", "ai_name = list(input())\r\nphone_name = list(input())\r\n\r\nans = 0\r\n\r\nfor ai_idx, ai_sym in enumerate(ai_name):\r\n if ai_name[ai_idx: ai_idx + len(phone_name)] == phone_name:\r\n ai_name[ai_idx + len(phone_name) - 1] = '#'\r\n ans += 1\r\n \r\n \r\nprint(ans)", "s = input()\nt = input()\nn = len(s)\nm = len(t)\nif m > n:\n print(0)\n exit()\n\ndef solve2():\n nx = [-1] * (m + 1)\n i = 0\n j = -1\n while i < m:\n while j >= 0 and t[i] != t[j]:\n j = nx[j]\n i += 1\n j += 1\n nx[i] = nx[j] if i < m and t[i] == t[j] else j\n\n cnt = 0\n i = j = 0\n while i < n:\n while j >= 0 and s[i] != t[j]:\n j = nx[j]\n i += 1\n j += 1\n if j == m:\n cnt += 1\n j = 0\n return cnt\n\ndef solve1():\n lps = [0] * m\n i = 1\n j = 0\n while i < m:\n if t[i] == t[j]:\n lps[i] = j + 1\n i += 1\n j += 1\n elif j > 0:\n j = lps[j - 1]\n else:\n i += 1\n\n # for i in range(1, m):\n # if t[i] == t[lps[i - 1]] and lps[i - 1] > 0:\n # lps[i - 1] = lps[lps[i - 1] - 1]\n\n\n cnt = 0\n i = j = 0\n while i < n:\n if s[i] == t[j]:\n i += 1\n j += 1\n if j >= m:\n cnt += 1\n # j = lps[j - 1]\n j = 0\n elif j > 0:\n j = lps[j - 1]\n else:\n i += 1\n return cnt\n\nprint(solve2())\n", "#i love python!~~~~~~~~~~~~~~~~~~~~~~~~\nprint(input().count(input()))\n \t \t \t \t\t \t\t \t\t \t\t\t \t \t \t", "AI = [x for x in input()]\nreserved = [x for x in input()]\n\nres_len = len(reserved)\ntest = []\n\nfor i in range(len(AI) + 1 - res_len):\n\t\ttest.append(AI[i:i + res_len])\n\ncount = 0\ni = 0\nwhile i < len(test):\n\tif test[i] == reserved:\n\t\tcount = count + 1\n\t\ti = i + res_len\n\telse:\n\t\ti = i + 1\n\nprint(count)\n", "print(input().count(input()))#2020-08-31 10:26:12.609", "import re\n\ns1 = input()\ns2 = input()\n\nr = re.findall(s2, s1);\n\nprint(len(r))\n# 1519341780921\n", "s = input()\r\nt = input()\r\np = s.count(t)\r\nprint(p)", "str1 = input()\r\nstr2 = input()\r\ncnt= str1.count(str2)\r\nprint(cnt)\r\n", "def main():\r\n string1, string2 = input(), input()\r\n\r\n print(string1.count(string2))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=input()\nb=input()\ns=a.count(b)\nprint(s)\n##################################################################################################################################################", "string1 = input()\r\nstring2 = input()\r\nprint(string1.count(string2))", "'''input\nsirisiri\nsir\n'''\nn, p = list(input()), list(input())\nc = 0\nfor i in range(len(p), len(n)+1):\n\tif n[i-len(p):i] == p:\n\t\tn[i-1] = \"#\"\n\t\tc += 1\nprint(c)", "s1 = input()\ns2 = input()\nn1 = len(s1)\nn2 = len(s2)\ndef check(i):\n for c in s2:\n try:\n if s1[i] != c:\n return False\n except IndexError:\n return False\n i += 1\n return True\nres = 0\ni = 0\nwhile i < n1:\n c = s1[i]\n if c == s2[0] and check(i):\n res += 1\n i += n2-1\n i += 1\nprint(res)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nw = input()[:-1]\r\ns = s.replace(w,'#')\r\nprint(s.count('#'))", "s = str(input())\r\nt = str(input())\r\nprint(s.count(t))", "name,substr = [input() for i in range(2)]\r\nprint(name.count(substr))", "readInts = lambda: map(int, input().split())\r\n\r\na=input()\r\nb=input()\r\nprint(a.count(b))\r\n\r\n\r\n", "print(input().count(input()))\r\n\r\n#wtf chutiya questiomn", "def main():\n g = input()\n a = input()\n\n result = 0\n while a in g:\n then = g.find(a) + len(a)\n g = g[then:]\n result += 1\n\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "s1 = input()\r\ns2 = input()\r\n\r\naux = s1.replace(s2, '#')\r\n\r\ncont = 0\r\nfor e in aux:\r\n\tif e == '#':\r\n\t\tcont += 1\r\nprint(cont)\r\n", "s1 = input()\ns2 = input()\nr = s1.count(s2)\nprint(r)\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", "# full logic before coding\r\n\r\n# test_cases = int(input())\r\n\r\n# for test_case in range(test_cases):\r\nprint(input().count(input()))", "a=input();\r\nb=input();\r\nk=a.count(b);\r\nprint(k);", "#!/usr/bin/python3.6\n# -*- coding: utf-8 -*-\n# @Time : 2020/12/21 4:02 PM\n# @Author : Songtao Li\nimport re\nif __name__ == \"__main__\":\n\n google = input()\n apple = input()\n pattern = re.compile(apple)\n res = pattern.findall(google)\n print(len(res))\n\n\n \t \t \t \t \t \t\t \t \t \t \t", "a,b = input().strip(), input().strip()\nprint(a.count(b))\n \t \t \t\t\t\t\t\t \t \t \t \t \t\t\t\t\t\t", "a= input()\r\nb= input()\r\n\r\nif b in a:\r\n print(a.count(b))\r\nelse:\r\n print(0)", "print(input().count(input()))\n#########################################################3\n \t \t\t \t \t\t\t\t\t\t\t\t\t\t\t\t \t\t \t\t\t", "s=input();\r\ns1= input();\r\nprint(s.count(s1))\r\n", "s1 = input()\r\ns2 = input()\r\nns1 = len(s1)\r\nns2 = len(s2)\r\ncount = 0\r\ni = 0\r\nwhile True:\r\n if s1[i:i+ns2] == s2:\r\n count += 1\r\n i += ns2\r\n elif i+ns2 >= ns1:\r\n break\r\n else:\r\n i += 1\r\nprint(count)", "s1=input()\r\ns2=input()\r\nif s2 not in s1:\r\n print(\"0\")\r\nelse:\r\n sl=s1.split(s2)\r\n print(len(sl)-1)", "s = input()\nt = input()\nn = len(s)\nm = len(t)\nl = 0\ni = 0\nj = m - 1\nwhile j < n:\n if s[i:j + 1] == t:\n l += 1\n i += m\n j += m\n else:\n i += 1\n j += 1\nprint(l)\n", "s = input()\r\nv = input()\r\nprint(s.count(v))", "father = input()\nchild = input()\nif child in father:\n result = father.count(child)\nelse:\n result = 0\nprint(result)\n\t\t\t \t \t\t \t \t \t \t \t\t\t \t\t \t", "i=input\nprint(i().count(i()))", "s=input()\r\na=input()\r\ne=s.count(a)\r\nprint(e)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n# File : B.py\r\n# Author : Bao To Hoai\r\n# Date : 09.11.2020 15:50:01 UTC+7\r\n# Last Modified Date: 09.11.2020 15:50:54 UTC+7\r\n# Last Modified By : Bao To Hoai\r\n\r\nprint(input().count(input()))\r\n", "import re\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nsearch = re.findall(s2, s1)\r\nprint(len(search))", "x=input()\r\ny=input()\r\nprint(x.count(y))", "s = input()\r\nt = input()\r\nprint(s.count(t))", "a, b, i, v = input(), input(), 0, 0\r\nwhile i + len(b) <= len(a):\r\n if a[i:i + len(b)] == b:\r\n i += len(b)\r\n v += 1\r\n else:\r\n i += 1\r\nprint(v)", "\r\ns1=input()\r\ns2=input()\r\n\r\ndef check(s1,s2):\r\n \r\n return s1.count(s2)\r\n\r\nprint(check(s1,s2)) ", "s = str(input().strip())\nt = str(input().strip())\nif t in s:\n\tprint(s.count(t))\nelse:\n\tprint(0)\n\t \t\t\t \t \t\t \t\t\t\t \t \t \t\t", "#code\ns = input()\nr = input()\nx = s.count(r)\nprint(x)\n\t\t\t \t\t\t \t\t\t \t\t \t\t\t \t\t \t", "import math\n\ns=str(input())\ns1=str(input())\nk=s.count(s1)\n\nprint(k)\n \t\t\t\t\t\t \t \t\t\t \t\t\t \t \t\t\t\t", "s,r=input(),input()\r\nprint(s.count(r))", "s = input()\r\ns = list(s)\r\nt = input()\r\nt = list(t)\r\nl = len(s)\r\nlt = len(t)\r\n\r\n\r\nres = 0\r\nfor i in range(l):\r\n #print(last)\r\n if i + lt <= l and t == s[i:i+lt]:\r\n s[i + lt - 1] = '#'\r\n res += 1\r\nprint(res)\r\n \r\n ", "x = input()\r\ny = input()\r\nprint(x.count(y))", "s1 = input()\r\ns2 = input()\r\nprint(s1.count(s2))", "gogol = input()\r\npineapple = input()\r\nif pineapple not in gogol:\r\n print(0)\r\n exit()\r\nk = gogol.count(pineapple)\r\n\r\nprint(k)\r\n", "\na = input()\nb = input()\nprint(a.count (b)) ", "p=input()\r\nq=input()\r\nprint(p.count(q))\r\n", "import sys\r\nn=input()\r\nm=input()\r\nsys.stdout.write(str(n.count(m)))", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nimport math\r\n\r\ns=str(input())\r\ns1=str(input())\r\nk=s.count(s1)\r\nprint(k)\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\n\ns1 = input()\ns2 = input()\n\nn1 = len(s1)\nn2 = len(s2)\n\nansw = 0\ni, j = 0, 0\nwhile i < n1-n2+1:\n j = 0\n\n subs = True\n while j < n2:\n if s2[j] != s1[i+j]:\n subs = False\n break\n j += 1\n\n if subs:\n answ += 1\n i += n2\n else:\n i += 1\n\nprint(answ)\n", "from math import log,floor\r\na=input()\r\nb=input()\r\nm=len(a)\r\nn=len(b)\r\nc=0\r\nded=0\r\nfor i in range(m-n+1):\r\n if not ded:\r\n if a[i:i+n]==b:\r\n c+=1\r\n ded=n\r\n ded=max(0,ded-1)\r\nprint(c)\r\n", "a=input()\nb=input()\na=str(a)\nb=str(b)\nprint(a.count(b))", "s = input()\nt = input()\nlen1 = len(s)\nlen2 = len(t)\nans = 0\nfor i in range(len1):\n isok = True\n for j in range(len2):\n if i + j >= len1 or s[i + j] != t[j]:\n isok = False\n break\n if isok:\n ans += 1\n s = s[:i + len2 - 1] + '#' + s[i + len2:]\nprint(ans)\n\n\t\t\t \t\t\t \t\t\t\t \t\t\t \t \t\t\t \t\t", "import sys\r\ndef subcadena():\r\n cadena=sys.stdin.readline().strip()\r\n busqueda=sys.stdin.readline().strip()\r\n print(cadena.count(busqueda))\r\nsubcadena() \r\n \r\n \r\n", "nameOfAI = input()\r\nnameOfPhone = input()\r\n\r\nprint(nameOfAI.count(nameOfPhone))", "import re\r\nstring = str(input())\r\nstring1 = str(input())\r\ncount = 0\r\nprint(len(re.findall(string1, string)))\r\n\r\n", "def solve(s1, s2):\r\n res = []\r\n res2 = []\r\n for x in s1:\r\n res.append(x)\r\n for y in s2:\r\n res2.append(y)\r\n n = len(s2)\r\n k = 0\r\n for i in range(len(s1)-n+1):\r\n if res[i:i+n]==res2:\r\n k += 1\r\n res[i+n-1]='#'\r\n return k\r\n \r\ns1 = input()\r\ns2 = input()\r\n\r\nprint(solve(s1, s2))", "a=input();b=input();print(a.count(b))", "s1 = input()\ns2 = input()\n\ni = 0\nc = 0\n\nwhile (i < len(s1)):\n\n if s1[i : i + len(s2)] == s2 :\n c +=1\n i += len(s2)\n\n else:\n i +=1\n\nprint(c)\n\n\n\n\n\t\t\t \t\t \t \t\t \t \t\t\t\t \t \t \t", "s1=input()\r\ns2=input()\r\ncount=s1.count(s2)\r\nprint(count)", "s=input()\r\nt=input()\r\nprint(s.count(t))", "a=input()\nb=input()\nc=a.count(b)\nprint(c)\n", "s1=str(input())\r\ns2=str(input())\r\nprint(s1.count(s2))", "import collections\r\nimport math\r\n\r\ndef is_prime(x): \r\n for i in range(2, math.ceil(math.sqrt(x))):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\nG = input()\r\nA = input()\r\nL = len(A)\r\nans, t = 0, -1\r\nfor i in range(len(G)):\r\n if G[i:i+L] == A and i > t:\r\n ans += 1\r\n t = i + L - 1 \r\n \r\n #print(i, t)\r\nprint(ans)", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nai_name = list(S())\r\nmp_name = list(S())\r\nmp_len = len(mp_name)\r\n\r\nans = 0\r\nfor i in range(len(ai_name)-mp_len+1):\r\n if ai_name[i:i+mp_len] == mp_name:\r\n ai_name[i+mp_len-1] = \"#\"\r\n ans += 1\r\n\r\nprint(ans)\r\n", "import re\r\na, b = input(), input()\r\nprint(len(re.findall(b, a)))\r\n", "a = input()\r\nb = input()\r\nans = 0\r\ni = 0\r\nwhile i < len(a):\r\n\tif a[i:i+len(b)] == b:\r\n\t\tans+=1\r\n\t\ti = i+len(b)-1\r\n\ti+=1\r\nprint(ans)\r\n", "import re\r\n\r\ngogol = input()\r\npineapple = input()\r\n\r\nres = len([i.start() for i in re.finditer(pineapple, gogol)])\r\nprint(res)", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\ns = input()\r\nt = input()\r\nprint(s.count(t))\r\n", "string_first = list(input())\r\nstring_second = list(input())\r\n\r\nanswer = 0\r\nlen_first_string = len(string_first)\r\nlen_second_string = len(string_second)\r\n\r\nfor i in range(0, len_first_string - len_second_string + 1):\r\n #print(string_first[i : i + len_second_string])\r\n if string_first[i : i + len_second_string] == string_second:\r\n string_first[i + len_second_string - 1] = '#'\r\n answer += 1\r\n\r\n#print(string_first)\r\nprint(answer)", "a = input();\r\nb = input();\r\n\r\ni = a.find(b);\r\nans = 0;\r\nwhile i >= 0:\r\n i = a.find(b, i + len(b))\r\n ans+=1;\r\n\r\nprint(ans)\r\n \r\n", "s = input()\r\ns2 = input()\r\n\r\njoined = s2 + '|' + s\r\n\r\ndef z_func(s):\r\n n = len(s)\r\n z = [0] * n\r\n l = 0\r\n r = 0\r\n for i in range(1, n):\r\n # print(i, s[:i+1], r-i+1,z[i-l],z)\r\n if i <= r:\r\n z[i] = min(r-i+1,z[i-l])\r\n \r\n while (i + z[i] < n) and s[z[i]] == s[i+z[i]]:\r\n z[i] += 1\r\n if i + z[i] - 1 > r:\r\n r = i + z[i] - 1\r\n l = i\r\n \r\n return z\r\n\r\nz = z_func(joined)\r\n\r\nidx = len(s2)+1\r\n\r\ntotal = 0\r\nwhile idx < len(joined):\r\n if z[idx] == len(s2):\r\n total += 1\r\n idx += len(s2)\r\n \r\n else:\r\n idx += 1\r\n \r\nprint(total)", "l = input(\"\")\ns = input(\"\")\nprint(l.count(s))", "s1=input()\r\ns2=input()\r\nc=0\r\ni=0\r\nwhile i<len(s1)-len(s2)+1:\r\n if s1[i]==s2[0]:\r\n if s1[i:i+len(s2)]==s2:\r\n c+=1\r\n i=i+len(s2)-1\r\n i+=1\r\nprint(c)\r\n", "s1=input()\r\ns2=input()\r\na=[]\r\ns=0\r\ncov=-1\r\nfor i in range(len(s1)):\r\n if s2 == s1[i:i+len(s2)]:\r\n if cov>=i:\r\n pass\r\n else:\r\n s+=1\r\n cov=i+len(s2)-1\r\nprint(s)\r\n\r\n \r\n \r\n \r\n \r\n", "s1 = input()\ns2 = input()\n\naux = s1.replace(s2, '#')\n\ncont = 0\nfor e in aux:\n\tif e == '#':\n\t\tcont += 1\nprint(cont)\n\n\t \t \t \t\t \t\t \t \t \t", "print(input().count(input())) # too simple :P", "a = input()\nb = input()\n\nans = 0\nwhile True:\n s = a.find(b)\n if s < 0:\n break\n ans += 1\n a = a[s+len(b):]\nprint(ans)\n", "original = str(input())\r\nsub = str(input())\r\ntotal = 0\r\nlast_index = 0\r\nwhile 1:\r\n if total == 0:\r\n cur_index = original.find(sub)\r\n else:\r\n cur_index = original.find(sub, last_index+len(sub))\r\n if (cur_index != -1):\r\n total = total + 1\r\n last_index = cur_index\r\n else:\r\n break\r\nprint(total)", "a, b = input(), input()\nans = 0\nindex = a.find (b, 0)\nwhile index != -1:\n ans = ans + 1\n index = a.find (b, index + len (b))\nprint (ans)\n", "a = input();\r\nb = input();\r\nc = b;\r\nc = b[0:len(b)-1]\r\nc+=\"#\"\r\nd = a.replace(b,c)\r\ncnt =0\r\nfor i in range(0,len(a)):\r\n cnt+=(a[i]!=d[i])\r\nprint(cnt);", "Gogol = input()\r\npineapple = input()\r\nprint(Gogol.count(pineapple))\r\n", "a = input()\r\nb = input()\r\n\r\nc=len(a)\r\nd=len(b)\r\na = a.replace(b, \"\")\r\nx = c - len(a)\r\nx = int(x /d)\r\nprint (x)", "n=input()\r\nn1=input()\r\nx=n.count(n1)\r\nprint(x)", "a=str(input())\r\nb=str(input())\r\nprint(a.count(b))", "\nai = input()\nphone = input()\n \ncount = ai.count(phone)\n \nprint(count)\n ", "ai = input()\r\np = input()\r\nc = 0\r\ni = 0\r\nwhile i < len(ai)-len(p)+1:\r\n if ai[i:i+len(p)] == p:\r\n c += 1\r\n i += len(p) - 1\r\n i += 1\r\nprint(c)", "nameofAI = input()\r\nnameofPhone = input()\r\n\r\nprint(nameofAI.count(nameofPhone))", "I=input\r\ns=I()\r\np=I()\r\nt=k=0\r\nwhile 1:\r\n\tt=s.find(p,t)\r\n\tif t<0:break\r\n\tk+=1;t+=len(p)\r\nprint(k)", "x = input()\r\ns = input()\r\n\r\nprint(x.count(s))", "if __name__ == '__main__':\n s = input()\n n = input()\n d = 0\n i = 0\n while i <= len(s) - len(n):\n k = s[i: i + len(n)]\n if k == n:\n d += 1\n i += len(n)\n else:\n i += 1\n print(d)\n\n\t \t\t \t\t \t \t \t \t\t\t\t\t \t", "s = input()\nt = input()\nn = len(s)\nm = len(t)\nif m > n:\n print(0)\n exit()\n\nlps = [0] * m\ni = 1\nj = 0\nwhile i < m:\n if t[i] == t[j]:\n lps[i] = j + 1\n i += 1\n j += 1\n elif j > 0:\n j = lps[j - 1]\n else:\n i += 1\n\ncnt = 0\ni = j = 0\nwhile i < n:\n if s[i] == t[j]:\n i += 1\n j += 1\n if j >= m:\n cnt += 1\n # j = lps[j - 1]\n j = 0\n elif j > 0:\n j = lps[j - 1]\n else:\n i += 1\n\nprint(cnt)", "def fun(s1,s2):\r\n n=len(s1)\r\n w=len(s2)\r\n if w>n:\r\n return 0\r\n count,j=0,0\r\n while(j<n-w+1):\r\n tempcount=0\r\n for k in range(w):\r\n if s1[k+j]==s2[k]:\r\n tempcount+=1\r\n else:\r\n break\r\n if tempcount==w:\r\n count+=1\r\n j+=w\r\n else:\r\n j+=1\r\n return count\r\n\r\ns1=input()\r\ns2=input()\r\nprint(fun(s1,s2))", "p=input()\r\ns=input()\r\nprint(p.count(s))", "a=input()\r\nb=input()\r\n\r\nprint(a.count(b))", "ai = input()\r\nphone = input()\r\nprint(ai.count(phone))\r\n", "import sys\r\n\r\nwrite = sys.stdout.write\r\n\r\ng = input()\r\np = input()\r\n\r\nprint(g.count(p))\r\n", "s = input()\r\nsub = input()\r\nc = s.count(sub)\r\nprint(c)\r\n", "g=str(input())\r\na=str(input())\r\nk=g.count(a)\r\nprint(k)", "s1=str(input())\r\ns2=str(input())\r\n\r\nans=s1.count(s2)\r\nprint(ans)", "s1 = input()\r\ns2 = input()\r\nn = len(s2)\r\nans = 0\r\ni = 0\r\nwhile i < len(s1) - n + 1:\r\n s3 = s1[i:i + n]\r\n if s2 == s3:\r\n ans += 1\r\n i += n - 1\r\n i += 1\r\nprint(ans)", "s = input()\r\np = input()\r\nprint(s.count(p))", "# your code goes here\r\ns1=input()\r\ns2=input()\r\nn1=len(s1)\r\nn2=len(s2)\r\nc=0\r\ni=0\r\nwhile i<=n1-n2+1:\r\n\tst=s1[i:i+n2]\r\n\tif st==s2:\r\n\t\tc+=1\r\n\t\ti=i+n2\r\n\telse:\r\n\t\ti+=1\r\nprint(c)", "n=input()\r\ns=input()\r\nprint(n.count(s))", "s1, s2 = input(), input()\r\nprint(s1.count(s2))", "g = input()\r\na = input()\r\nal = len(a)\r\np = g.find(a)\r\ns = p + al\r\nc = 0\r\nwhile p != -1:\r\n c += 1\r\n p = g.find(a, s)\r\n s = p + al\r\nprint(c)\r\n# while(g.find(a,s)):\r\n", "str=input()\r\na=input()\r\nprint(str.count(a))\r\n", "x = str(input())\r\ny = str(input())\r\nprint(x.count(y))", "s1 = str(input())\ns2 = str(input())\nprint(s1.count(s2))\n \t \t \t\t \t\t \t \t \t \t\t\t \t \t\t", "a = input()\r\nb = a.split(input())\r\nprint(len(b)-1)", "#hello\n#hello\n#hello\n#hello\n#hello\n#hello\n#hello\ns1 = input()\ns2 = input()\nprint(s1.count(s2))", "#!/usr/bin/env python3 \r\n\r\nai_name = input()\r\nphone_name = input()\r\n\r\nstart = 0\r\ncount = 0\r\nwhile True:\r\n start = ai_name.find(phone_name, start)\r\n if start == -1:\r\n break\r\n count += 1\r\n start += len(phone_name)\r\n\r\nprint(count)\r\n", "str = input() ;\r\nstrKey =input() ;\r\n\r\ncnt = str.count(strKey) ;\r\n\r\nprint(cnt)\r\n", "heap = input()\r\nneedle = input()\r\ni = 0\r\nc = 0\r\nwhile i + len(needle) <= len(heap):\r\n j = heap.find(needle, i)\r\n if j < 0:\r\n break\r\n c += 1\r\n i = j + len(needle)\r\nprint(c)", "nameAI = input()\r\nnamePhone = input()\r\n\r\nprint(nameAI.count(namePhone))", "s1 = str(input())\r\ns2 = str(input())\r\nvezes = s1.count(s2)\r\nprint(vezes)", "s1=input()\r\ns2=input()\r\nprint(s1.count(s2))", "n=input() #AI name\nm=input() #The name of the phone released by Pineapple 200 years ago\nprint(n.count(m))\n \t\t \t \t \t\t \t\t\t \t \t\t \t \t", "b = input()\r\na = input()\r\nprint(b.count(a))", "name = input()\nsub = input()\nsumm = 0\nback = 0\r\ni = len(sub)\nwhile i < len(name) + 1:\r\n if name[i - len(sub):i] == sub:\r\n summ += 1\r\n i += len(sub)\r\n else:\r\n i += 1\nprint(summ)", "def get_min_changes(string: str, substring: str) -> int:\n prev_idx = string.find(substring)\n idx = prev_idx + 1\n\n if prev_idx == -1:\n return 0\n\n changes = 0\n overlap = len(substring)\n\n while True:\n idx = string.find(substring, idx)\n if idx == -1:\n changes += 1\n break\n\n dist = idx - prev_idx\n if dist >= overlap:\n changes += 1\n overlap = len(substring)\n else:\n overlap -= dist\n\n prev_idx = idx\n idx += 1\n\n return changes\n\n\ndef main():\n name = input()\n subname = input()\n\n print(get_min_changes(name, subname))\n\n\nif __name__ == \"__main__\":\n main()\n", "a = input()\r\nprint(a.count(input()))\r\n", "s=input()\r\ns1=input()\r\ncount,i=0,0\r\nwhile i<((len(s)-len(s1))+1):\r\n if s[i:i+len(s1)]==s1:\r\n count+=1 \r\n i+=len(s1)\r\n else:\r\n i+=1\r\nprint(count)", "s = input()\r\nt = input()\r\nx = len(t) \r\n\r\ndef solve(s, t) :\r\n found = s.find(t)\r\n var = len(t) \r\n x = 0\r\n while found != -1 :\r\n x = x+1\r\n s = s[found + var:] \r\n found = s.find(t)\r\n return x\r\nprint(solve(s,t)) \r\n \r\n", "str = input()\nsubstr = input()\ncount = str.count(substr)\nprint(count)\n\t \t \t \t\t\t\t\t \t \t \t \t", "t, p, a, ans, last = str(input()), str(input()), [], 0, -1\r\nx = t.find(p)\r\nwhile x != -1:\r\n a.append(x)\r\n x = t.find(p, x + 1)\r\nif len(a) == 0:\r\n print(0)\r\nelse:\r\n last, ptr = a[0] + len(p) - 1, 1\r\n ans += 1\r\n while ptr < len(a):\r\n while ptr < len(a) and last >= a[ptr]:\r\n ptr += 1\r\n if ptr < len(a):\r\n last = a[ptr] + len(p) - 1\r\n ans += 1\r\n print(ans)", "s1=input() ; s2=input()\r\nans=idx=0\r\nwhile idx < len(s1):\r\n if s1[idx:idx+len(s2)]==s2:\r\n ans+=1 ; idx+=len(s2)-1\r\n idx+=1\r\nprint(ans)", "x = input()\ny = input()\ncount = x.count(y)\nprint(count)\n\n", "s=input()\r\nz=input()\r\nif z not in s:\r\n\tprint(0)\r\nelse:\r\n\tprint(s.count(z))", "if __name__ == '__main__':\n s1 = input()\n s2 = input()\n print(s1.count(s2))\n\n \t \t\t \t\t \t \t\t \t\t\t \t \t \t\t", "a=input()\r\nb=input()\r\nprint(a.count(b))", "g = list(input())\np = list(input())\n\nr = 0\nl = -1\n\nfor i in range(len(g)-len(p)+1):\n e = True\n for j in range(len(p)):\n if g[i+j]!=p[j]:\n e = False\n break\n if e:\n if i>l:\n r += 1\n l = i+len(p)-1\n\nprint(r)\n" ]

[ "n, m = [int(i) for i in input().split()]\r\ncurrent_floor = list(input())\r\n\r\nx, t, direction = 0, 0, 1\r\n\r\nfor i in range(n-1):\r\n floor = list(input())\r\n l, r = x, x\r\n wall = 0\r\n while True:\r\n t += 1\r\n if floor[x] == '.':\r\n break\r\n if (x + direction == m) or (x + direction < 0) or (current_floor[x+direction] == '#'):\r\n wall += 1\r\n direction = -direction\r\n if wall == 2:\r\n print(\"Never\")\r\n exit(0)\r\n elif current_floor[x+direction] == '+':\r\n wall = 0\r\n current_floor[x+direction] = '.'\r\n direction = -direction\r\n elif l <= x+direction and x+direction <= r:\r\n if direction == 1:\r\n t += r-x-1\r\n x = r\r\n else:\r\n t += x-l-1\r\n x = l\r\n else:\r\n x += direction\r\n r = max(r, x)\r\n l = min(l, x)\r\n current_floor, floor = floor, current_floor\r\nprint(t)\r\n" ]

[ "from sys import stdin, stdout\r\nfrom heapq import heapify,heappop,heappush,heappushpop\r\n \r\nn, m = map(int, stdin.readline().split())\r\n \r\nady = [[] for i in range(n)]\r\n \r\nfor i in range(m):\r\n u,v,w = map(int,stdin.readline().split())\r\n ady[u-1].append((v-1,2*w))\r\n ady[v-1].append((u-1,2*w))\r\n \r\nc_xcity = list(map(int,stdin.readline().split()))\r\npq = [(c_xcity[i],i) for i in range(n)]\r\nheapify(pq)\r\nwhile len(pq)>0:\r\n wu,u = heappop(pq)\r\n if c_xcity[u] != wu:\r\n continue\r\n for v,w in ady[u]:\r\n if c_xcity[v] > c_xcity[u] + w:\r\n #pq.remove((c_xcity[v],v))\r\n c_xcity[v] = c_xcity[u] + w\r\n heappush(pq,(c_xcity[v],v))\r\n \r\nstdout.write(' '.join(map(str,c_xcity)))" ]

[ "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\np=sorted(arr)\r\nans=0\r\nc=Counter()\r\nseen=set()\r\nfor a,b in zip(arr,p):\r\n c[a]+=1\r\n c[b]-=1\r\n if c[a]>0:\r\n seen.add(a)\r\n if c[a]==0 and a in seen:\r\n seen.remove(a)\r\n if c[b]>0:\r\n seen.add(b)\r\n if c[b]==0 and b in seen:\r\n seen.remove(b)\r\n if len(seen)==0:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\ncnt=0\r\nfor ai,bi in zip(a,sorted(a)):\r\n s+=bi-ai\r\n if s==0:\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\ns=0\r\nv=0\r\na=list(map(int,input().split()))\r\nfor i,j in zip(a,sorted(a)):\r\n s+=i-j\r\n v+=not s\r\nprint(v)\r\n", "import math\r\nimport sys\r\nimport queue\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n h = list(map(int, input().split()))\r\n\r\n p = sorted(h)\r\n res = 0\r\n\r\n f = {h[i]: 0 for i in range(n)}\r\n zeros = len(f.keys())\r\n\r\n for i in range(n):\r\n if h[i] == p[i]:\r\n pass\r\n else:\r\n if f[h[i]] == 0:\r\n zeros -= 1\r\n if f[p[i]] == 1:\r\n zeros += 1\r\n f[h[i]] += 1\r\n f[p[i]] -= 1\r\n\r\n if zeros == len(f.keys()):\r\n res += 1\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nc={}\r\nd={}\r\ne=0\r\nfor i in range(n):\r\n if a[i] not in c.keys():\r\n c[a[i]]=1\r\n else:\r\n c[a[i]]+=1\r\n if b[i] not in d.keys():\r\n d[b[i]]=1\r\n else:\r\n d[b[i]]+=1\r\n if c==d:\r\n e=e+1\r\n c={}\r\n d={}\r\nprint(e)", "from collections import defaultdict\r\ndic = defaultdict(list)\r\n\r\nn = int(input())\r\nli = list(map(int,input().split()))\r\nsortedLi = sorted(li)\r\nfor i in range(n):\r\n dic[sortedLi[i]].append(i)\r\n\r\ncommon = []\r\n\r\nfor idx in range(n):\r\n common.append(sorted((idx,dic[li[idx]][0])))\r\n dic[li[idx]].pop(0)\r\n\r\nans = 1\r\ncounted = False\r\ntempEdge = common[0][1]\r\nfor i in range(len(common)):\r\n if common[i][0] > tempEdge:\r\n ans+=1\r\n if common[i][1] > tempEdge:\r\n tempEdge = common[i][1]\r\n \r\nprint(ans)", "# Fast IO (only use in integer input) or take care about string\r\n\r\nimport os,io\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nh = list(map(int,input().split()))\r\nhWithIndex = []\r\nfor i in range(n):\r\n hWithIndex.append((i,h[i]))\r\nhWithIndex.sort(key = lambda x:x[1])\r\noriginalToSorted = [0] * n\r\nsortedToOriginal = [0] * n\r\nfor i in range(n):\r\n sortedToOriginal[i] = hWithIndex[i][0]\r\n originalToSorted[hWithIndex[i][0]] = i\r\ncurrentIndex = 0\r\ncurrentMax = 0\r\nblocks = 0\r\nwhile True:\r\n if currentIndex >= n:\r\n break\r\n blocks += 1\r\n updateMax = currentIndex\r\n updateIndex1 = currentIndex\r\n updateIndex2 = currentIndex\r\n while True:\r\n for i in range(updateIndex1,currentMax + 1):\r\n if updateMax < originalToSorted[i]:\r\n updateMax = originalToSorted[i]\r\n if updateMax == currentMax:\r\n break\r\n updateIndex1 = currentMax + 1\r\n currentMax = updateMax\r\n for i in range(updateIndex2,currentMax + 1):\r\n if updateMax < sortedToOriginal[i]:\r\n updateMax = sortedToOriginal[i]\r\n if updateMax == currentMax:\r\n break\r\n updateIndex2 = currentMax + 1\r\n currentMax = updateMax\r\n currentIndex = updateMax + 1\r\nprint(blocks)\r\n", "n=int(input())\r\nh=list(map(int,input().split()))\r\nans,mn,mx=0,[],[]\r\nfor i in range(n):\r\n mn.append(float(\"inf\"))\r\n mx.append(float(\"-inf\"))\r\nmn[-1],mx[0]=h[-1],h[0]\r\nfor i in range(n-2,-1,-1):\r\n mn[i]=min(h[i],mn[i+1])\r\nfor i in range(1,n):\r\n mx[i]=max(mx[i-1],h[i])\r\nfor i in range(n-1):\r\n if mx[i]<=mn[i+1]:\r\n ans+=1\r\nprint(ans+1)", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted(a)\r\nd = defaultdict(list)\r\nfor i in range(n - 1, -1, -1):\r\n d[b[i]].append(i)\r\nans = 0\r\ncmax = 0\r\nfor j in range(n):\r\n pos1 = d[a[j]].pop()\r\n cmax = max(cmax, pos1)\r\n # print(a[j],pos1,cmax)\r\n if j == cmax:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nq = sorted(w)\r\nd = {q[-1]: 0}\r\na = 0\r\nfor i in range(n-2, -1, -1):\r\n a += 1\r\n if q[i] != q[i+1]:\r\n d[q[i]] = a\r\n\r\na, c, x, b, x1 = -1, 0, 0, -1, w[-1]\r\nfor i in range(n-1, -1, -1):\r\n if a == -1:\r\n c += 1\r\n a = w[i]\r\n if a < x1:\r\n x1 = a\r\n x += b + 1\r\n b = 0\r\n elif a == x1:\r\n b += 1\r\n\r\n t = d[a] - x\r\n if t == 0:\r\n a = -1\r\n elif w[i] == a:\r\n b += 1\r\n elif w[i] > a:\r\n t -= 1\r\n if t == 0:\r\n a = -1\r\n x += 1\r\n elif w[i] < a:\r\n t += d[w[i]] - d[a] - b - 1\r\n a = x1 = w[i]\r\n x += b + 1\r\n b = 0\r\nprint(c)", "l=int(input())\n\nb=[int(i) for i in input().split(' ')]\na=sorted(b)\n\nsumm=0\nres=0\n\nfor i in range(l):\n summ += a[i]-b[i]\n\n if summ==0:\n res+=1\nprint(res)\n\n# dp=list()\n# for i in range(l):\n# dp.append(1)\n# maxx=0\n#\n# minn=0\n# prevMax=0\n# for i in range(1,l):\n#\n# if b[maxx]<=b[i]:\n# if b[maxx] < b[i]:\n# PreMax=maxx\n# maxx=i\n# dp[i]+=dp[i-1]\n# if b[i] == b[minn]:\n# minn=i\n#\n# else:\n# if b[i]>b[minn]:\n# if b[prevMax]<=b[i]:\n# dp[i]+=dp[prevMax]\n# else:\n# dp[i]=dp[prevMax]\n#\n#\n# continue\n# if b[i]< b[minn]:\n# minn = i\n# continue\n# if b[i]==b[minn]:\n# if b[i]==b[0]:\n# dp[i]+=dp[minn]\n# minn=i\n#\n#\n# print(dp)\n# print(dp[-1])\n \t \t\t \t \t \t\t\t \t\t \t\t\t\t\t\t", "# i'm from jasnah, don't ban me\r\nclass Base:\r\n def __init__(self, n: int, l: list[int]) -> None:\r\n self.n: int = n\r\n self.l: list[int] = l\r\n self.k: int = sorted(self.l)\r\n\r\n self.__ans: int = 0\r\n self.__x: int = 0\r\n\r\n def sort_to(self) -> int:\r\n i: int\r\n for i in range(self.n):\r\n self.__x += self.k[i] - self.l[i]\r\n if self.__x == 0:\r\n self.__ans += 1\r\n return self.__ans\r\n\r\nb = Base(\r\n n=int(input()),\r\n l=list(map(int, input().split()))\r\n)\r\nprint(b.sort_to())", "from sys import stdin,stdout\r\nfrom collections import defaultdict\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=list(zip(lst(),range(n)))\r\n a.sort();ans=mx=0\r\n for i in range(n):\r\n mx=max(a[i][1],mx)\r\n if mx==i:ans+=1\r\n print(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nh = list(map(int, input().split()))\r\ninf = pow(10, 9) + 1\r\nmi = [inf]\r\nfor i in h[1:][::-1]:\r\n mi.append(min(mi[-1], i))\r\nma = 0\r\nans = 0\r\nfor i, j in zip(h, mi[::-1]):\r\n ma = max(ma, i)\r\n if ma <= j:\r\n ans += 1\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nB = sorted(A)\r\n\r\nans=0\r\nlib = defaultdict(int)\r\nfor i in range(N):\r\n lib[A[i]]+=1\r\n if lib[A[i]]==0:\r\n del lib[A[i]]\r\n \r\n lib[B[i]]-=1\r\n if lib[B[i]]==0:\r\n del lib[B[i]]\r\n \r\n if len(lib)==0:\r\n ans+=1\r\n \r\nprint(ans)", "n, s, v = int(input()), 0, 0\na = list(map(int, input().split()))\nfor ai, bi in zip(a, sorted(a)):\n s += bi - ai\n v += not s\nprint(v)\n \t\t\t \t \t \t\t\t\t \t \t\t\t\t \t" ]

[ "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 \n# M = 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\ndef find(a,mod,n):\n rem = n - len(bin(a)[2:])\n ans = 0\n while rem:\n temp = min(rem,50)\n ans = (ans + 2**temp)%mod\n rem -= temp\n return ans\n\n\nn, k, m = li()\nf=[0 for i in range(k)] \ns=0\nfor v in range(n):\n tens = 10**v%k\n f=[ (sum( [f[(j+k-(x+1)*tens)%k] for x in range(9)] )+f[j])%m for j in range(k)]\n for x in range(9):\n f[(x+1)*tens%k]+=1\n if n-v-1==0:\n s+=(f[0]%m)\n else:\n s+=f[0]*((10**(n-v-2)*9))%m\n f[0]=0\nprint(s%m)" ]

[ "def solve():\r\n size = input()\r\n s = input()\r\n \r\n print('1' * ('1' in s) + '0' * s.count('0'))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(S):\r\n if S=='0':\r\n sys.stdout.write('0')\r\n return\r\n d = [0, 0]\r\n for c in S:\r\n d[int(c)]+=1\r\n answer = ['1']\r\n for i in range(d[0]):\r\n answer.append('0')\r\n answer = ''.join(answer)\r\n sys.stdout.write(answer)\r\n return\r\n\r\nn = int(input())\r\nS = input().decode()[:-2]\r\nprocess(S)", "n=int(input())\r\ns=input()\r\nwhile('01' in s or '11' in s):\r\n if('01' in s):\r\n s=s.replace('01','10')\r\n elif('11' in s):\r\n s=s.replace('11','1')\r\nprint(s) ", "input()\ns=input()\nprint(s[0]+'0'*s[1:].count('0'))\n\t \t\t \t\t \t\t \t \t\t \t\t\t \t", "n = int(input())\r\ns = input()\r\none = s.count('1')\r\nprint('0' if one == 0 else '1' + '0' * (n - one))", "n = int(input())\r\na = input()\r\nif a==\"0\":\r\n print(\"0\")\r\n quit()\r\na = a.replace(\"1\", \"\")\r\nprint(\"1\"+a)", "# val(s) == length(s)\n#1010111100000111001\n#1111111111000000000\n#1000000000\nn=int(input())\ns=input()\na=s.count('0')\nif s[0]!='0':\n print('1'+''.join('0'*a))\nelse:\n print(0)\n", "n, s = int(input()), input()\r\nif len(s) == 1: print(s)\r\nelse:\r\n dem = 0\r\n for x in s:\r\n if x == '0': dem += 1\r\n print('1' + '0' * dem)", "n, s = int(input()), input()\r\nif n == 1:\r\n print(s)\r\nelse:\r\n cnt0 = 0\r\n for i in range(n):\r\n if s[i] == '0':\r\n cnt0 += 1\r\n print(1, end='')\r\n for i in range(cnt0):\r\n print(0, end='')", "import math as mt\nimport sys, string\nfrom collections import Counter, defaultdict\ninput = sys.stdin.readline\n\n# input functions\nI = lambda : int(input())\nM = lambda : map(int, input().split())\nARR = lambda: list(map(int, input().split()))\n\ndef main():\n n = I()\n s = input()\n s = list(s)\n n = len(s) - 1\n c1, c0 = 0, 0\n for i in range(n):\n if s[i] == '1':\n c1 += 1\n elif s[i] == '0':\n c0 += 1\n if c1 > 0:\n ans = \"1\"\n for i in range(c0):\n ans += \"0\"\n print(ans)\n else:\n print(\"0\")\n\nmain()\n ", "input()\r\ns = input()\r\nn = 0\r\nif s==\"0\":\r\n print(s)\r\nelse:\r\n for i in s:\r\n if i==\"0\":\r\n n = n+1\r\n print (\"1\"+\"0\"*n)", "n = int(input())\r\ns = str(input())\r\nif '1' not in s:\r\n print('0')\r\n exit()\r\ncnt = 0\r\nfor c in s:\r\n if c =='0':\r\n cnt += 1\r\nans = '1'*1+'0'*cnt\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(input())\r\nif n==1 and l[0]==\"1\":\r\n print(\"1\")\r\nelif n==1 and l[0]==\"0\":\r\n print(\"0\")\r\nelif n==2 and (l[0]==\"1\" and l[1]==\"1\"):\r\n print(\"1\")\r\nelif n==2 and (l[0]==\"1\" and l[1]==\"0\"):\r\n print(\"10\")\r\nelse:\r\n z=\"1\"\r\n for i in range(l.count(\"0\")):\r\n z+=\"0\" \r\n print(z)", "n = input()\r\n\r\ns = input()\r\n\r\nones = 0\r\nzeros = 0\r\n\r\nfor i in s:\r\n\tif i == '1':\r\n\t\tones += 1\r\n\telse:\r\n\t\tzeros += 1\r\n\r\nans = \"\"\r\n\r\nif ones >= 1:\r\n\tans += \"1\"\r\n\r\nfor i in range(0, zeros):\r\n\tans += \"0\"\r\n\r\nprint(ans)\r\n", "k=int(input())\r\nn=input()\r\ns=\"\"\r\nfor i in n:\r\n s=s+i+\" \"\r\nn=list(map(int,s.split()))\r\nn.sort()\r\na=n[::-1]\r\nc1=0\r\nc2=0\r\nfor i in n:\r\n if i == 1:\r\n c1=c1+1\r\n else:\r\n c2=c2+1\r\nif c1==0:\r\n s=\"\"\r\n for i in range(0,c2):\r\n s=s+\"0\"\r\n print(s)\r\nelse:\r\n s=\"1\"\r\n for i in range(0,c2):\r\n s=s+\"0\"\r\n print(s)\r\n ", "length = input()\r\nbin_num = input()\r\n\r\nzero_count = sum([1 for i in bin_num if i == \"0\"])\r\n\r\nsmallest_bin = \"1\" + \"0\"*zero_count\r\n\r\nif length == \"1\" and bin_num == \"0\":\r\n print(\"0\")\r\nelse:\r\n print(smallest_bin)", "\r\nn=int(input())\r\ns=list(input())\r\na=s.count(\"0\")\r\nif(\"1\" not in s):\r\n\tprint(0)\r\nelse:\r\n\tprint(\"1\"+\"0\"*a)", "n = int(input())\r\ns = input()\r\nif s == \"0\":\r\n print(s)\r\nelse:\r\n print(\"1\"+\"0\"*s.count(\"0\"))\r\n", "n=int(input())\r\nx=list(input())\r\ni=1\r\nwhile i!=len(x):\r\n if x[i]=='1':\r\n del(x[i])\r\n else:\r\n i+=1\r\nfor i in x:\r\n print(i,end=\"\")", "n=int(input())\r\ns=input()\r\nif n==1 and s=='0':\r\n print('0')\r\n exit()\r\nprint('1'+'0'*s.count('0'))", "input()\r\ns=input()\r\nprint(s[0]+'0'*s[1:].count('0'))", "input()\ns = input()\nz = s.count('0')\no = s.count('1')\nprint(['0', '1' + z * '0'][o > 0])\n", "n = int(input())\r\nstr = input()\r\nn1 = str.count('1')\r\nn0 = n - n1\r\n\r\nif n1>=1:\r\n print(1,end='')\r\nfor j in range(n0):\r\n print(0,end='')\r\n\r\n", "a=int(input())\nb=input()\ncont=0\nif(a==1):\n print(b)\nelse:\n for k in range(0,a):\n if(b[k]==\"0\"):\n cont+=1\n print('1'+str(\"0\")*cont)", "n = int(input())\ns = input()\nif len(s) == 1:\n print(s)\nelse:\n print('1' + '0' * s.count('0'))", "input()\r\ns=input()\r\nprint(0 if(s=='0') else '1' + '0' * s.count('0'))\r\n\r\n", "n = int(input())\nx = map(int, list(input()))\nif n > 1:\n o = sum(x)\n a = '1' + '0' * (n - o)\n print(a)\nelse:\n print(list(x)[0])", "#\r\n#\r\ndef solution(n,a):\r\n if len(a)==1:\r\n return a\r\n else:\r\n l1=list(a)\r\n l1=[x for x in a if x!=\"1\"]\r\n c_out=\"1\"\r\n for x in l1:\r\n c_out+=x\r\n return c_out\r\n \r\ndef answer():\r\n n = int(input())\r\n a = input()\r\n print(solution(n,a))\r\nanswer()", "a=int(input())\r\nb=input()\r\nd='1'\r\none=0\r\nfor c in b:\r\n if(c=='1'):\r\n one=one+1\r\n else:\r\n d=d+'0'\r\nif(one>=1):\r\n print(d)\r\nelse:\r\n print('0')", "n = int(input())\r\nnum=input()\r\ncount = 0\r\nfor x in num:\r\n\tif x == '0':\r\n\t\tcount+=1\r\nif count == len(num):\r\n\tprint(num)\r\nelse:\r\n\tans = \"1\"\r\n\tfor i in range(0,count,1):\r\n\t\tans+=\"0\"\r\n\tprint(ans)", "input()\r\ns = input()\r\nif s.count('1') == 0:\r\n print(0)\r\nelse:\r\n print(bin(2 ** (s.count('0')))[2:])", "n = int(input())\ns = input()\nif s.count('1') == 0:\n print(0)\nelse:\n print('1' + '0' * s.count('0'))", "n = int(input())\r\ns1 = input()\r\nif s1.count('1') == 0:\r\n print(0)\r\nelse:\r\n print('1' + '0' * s1.count('0'))", "num = input()\nstring = input()\nnum_zero = string.count('0')\nnum_one = string.count('1')\nif num_one >= 1:\n print('1'+'0' * num_zero)\nelse:\n print('0' * num_zero)\n", "''' Count The Zeros! '''\r\n\r\nn = int(input())\r\ns = input()\r\n\r\ncnt = 0\r\n\r\nfor c in s:\r\n if c == '0':\r\n cnt+=1\r\n\r\nAns = \"\"\r\nif s[0] == '1':\r\n Ans += \"1\"\r\n\r\nfor i in range(cnt):\r\n Ans += \"0\"\r\n \r\nprint(Ans)", "a=int(input())\r\nb=input()\r\nif b!='0':\r\n print('1','0'*b.count('0'),sep='')\r\nelse:\r\n print(0)", "n = int(input())\ns = input()\nwhile '01' in s:\n s = s.replace('01', '10')\nwhile '11' in s:\n s = s.replace('11', '1')\nprint(s)\n", "n = int(input())\r\ns = list(input().strip())\r\nt = 0\r\nif s[0] == '0':\r\n print(0)\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] == '0':\r\n t+=1\r\n print(1,end='')\r\n for i in range(t):\r\n print(0,end='')", "n, s = input(), input()\nif s == '0':\n\tprint(s)\nelse:\n\tprint('1','0'*s.count('0'),sep='')\n", "n=int(input())\r\ns=input()\r\none, zero=0,0\r\nfor i in s:\r\n if i=='1':\r\n one+=1\r\nzero=n-one\r\nif one>0:\r\n one=1\r\n \r\n s='1'\r\n for i in range(zero):\r\n s+='0'\r\n print(s)\r\nelse:\r\n print(0) ", "n = int(input())\r\nstring = input()\r\nif string.count('1') == 0:\r\n print('0')\r\nelse:\r\n print('1' + string.count('0') * '0')", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n'''\r\n\r\nn=int(input())\r\ntmp=input()\r\nfor i in range(n):\r\n if \"01\" in tmp:\r\n tmp=tmp.replace(\"01\",\"10\")\r\n elif \"11\" in tmp:\r\n tmp=tmp.replace(\"11\",\"1\")\r\n else:\r\n break\r\nprint(tmp)\r\n", "x = int(input())\r\ns = input()\r\nwhile s.find(\"11\")>=0 or s.find(\"01\")>=0:\r\n s = s.replace(\"11\",\"1\")\r\n s = s.replace(\"01\",\"10\")\r\nprint(s)", "n = int(input())\r\na = input()\r\nif(a != '0'):\r\n print('1'+a.count('0')*'0')\r\nelse:\r\n print('0')\r\n", "a = int(input())\r\nb = str(input())\r\nprint('1' + '0'*b.count('0') if b.count('1') != 0 else '0'*b.count('0'))", "n=int(input())\r\ns=input()\r\np=0\r\nif n==1:\r\n\tprint(s)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif s[i]=='0':\r\n\t\t\tp+=1\r\n\tprint('1'+('0'*p))", "n=int(input())\ns=input()\nprint(\"1\"*min(1,s.count(\"1\"))+\"0\"*s.count(\"0\"))\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = input().rstrip()\r\n\r\ncnt = data.count('0')\r\nif '1' in data:\r\n print('1' + '0' * cnt)\r\nelse:\r\n print('0')", "n = input()\r\ns=input()\r\ncnt1=0\r\ncnt0=0\r\nfor i in range(len(s)):\r\n if (s[i]=='1'):\r\n cnt1+=1\r\n else:\r\n cnt0+=1\r\nif (cnt1==0):\r\n print('0')\r\nelse:\r\n print('1'+'0'*cnt0)\r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n", "import sys\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split()))\nM=lambda : map(int,input().split())\nn=int(input())\ns=input()\nif(s.count(\"1\")>0):\n print(\"1\"+\"0\"*(s.count(\"0\")))\nelse:\n print(\"0\")\n", "n = int(input())\nb = input()\n\n\nprint('1' + ''.join(i for i in b if i != '1') if b != '0' else '0')\n", "n=int(input())\r\nn1=input()\r\ns=n1.count(\"0\")\r\nif n1 == \"0\":\r\n\tprint(0)\r\nelse:\r\n\tprint(\"1\"+s*\"0\")", "n = input()\r\na = input(\" \")\r\nnumZero = a.count('0', 0)\r\nif '1' not in a:\r\n print(a)\r\nelse:\r\n print(\"1\", end=\"\")\r\n for x in range(0, numZero):\r\n print(\"0\", end=\"\")", "iuy=input()\r\ns=input()\r\n\r\none=0\r\nzero=0\r\nfor i in s:\r\n if i=='1':\r\n one+=1\r\n elif i=='0':\r\n zero+=1\r\nif(one>=1):\r\n em='1'\r\n\r\nelse:\r\n em=''\r\nfor j in range(1,(zero+1)):\r\n\r\n em+='0'\r\nprint(em)", "n = int(input())\r\nx = str(input())\r\nif len(x) > 1 and x[0] == \"1\":\r\n print(\"1\"+str(0)*x.count(\"0\"))\r\nelse:\r\n print(x)", "import sys\nimport math\nimport bisect\nimport itertools\n\nn = sys.stdin.readline()\ns = sys.stdin.readline().strip()\n\nif s == \"0\":\n\tprint(\"0\")\nelse:\n\tprint(\"1\" + \"0\"*s.count(\"0\"))\n", "n = int(input())\r\ns = list(map(int, list(input())))\r\nif s == [0]:\r\n print(0)\r\n exit()\r\nd = 0\r\nfor i in range(1, n):\r\n if s[i] == 0:\r\n d += 1\r\nprint('1' + '0' * d)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n S = wtf[1]\r\n ans = ''\r\n if S.count('1') > 0:\r\n ans += '1'\r\n ans += '0'*S.count('0')\r\n else:\r\n ans = '0'\r\n print(ans)\r\n", "n=int(input())\r\ns=input()\r\nc=\"1\"\r\nfor i in range(n):\r\n if \"1\" in s:\r\n if s[i]==\"0\":\r\n c=c+s[i]\r\n else:\r\n continue \r\n else:\r\n c=s\r\nprint(c)", "input()\r\nx=(input())\r\nif x.count('1')==0:\r\n print(0)\r\nelse:\r\n print('1'+'0'*x.count('0'))", "import sys\r\nimport math\r\n\r\nn=int(input())\r\nstra=str(input())\r\nif(stra.count(\"1\")==0):\r\n print(\"0\")\r\nelse:\r\n a=stra.index(\"1\")\r\n\r\n strb=stra[a:]\r\n zero=strb.count(\"0\")\r\n one=strb.count(\"1\")\r\n if(one==0):\r\n print(\"0\")\r\n else:\r\n print(\"1\", end=\"\")\r\n for i in range(zero):\r\n print(\"0\",end=\"\")", "a=int(input())\r\nb=int(input())\r\nb=str(b)\r\nb=list(b)\r\nk=b.count('0')\r\nif '1' in b:\r\n print('1'+k*'0')\r\nelse:\r\n print(0)\r\n", "int(input())\r\nb = input()\r\na = b.count('0')\r\ns = '1'\r\nif (len(b) > 1):\r\n for i in range(a):\r\n s += '0'\r\n print(s)\r\nelse:\r\n print(b)\r\n", "n = int(input())\r\ns = input()\r\n\r\na = s.count(\"1\")\r\nb = s.count(\"0\")\r\n\r\nif a!=0:\r\n\tprint(\"1\"+\"0\"*b)\r\nelse:\r\n\tprint(\"0\"*b)\r\n", "input()\r\na=input()\r\nprint(a[0]+'0'*a[1:].count('0'))\r\n", "n=input();x=input()\r\nif set(x)!={'0'}: print('1'+(x.count('0')*'0'))\r\nelse: print('0')", "n = input()\r\nk = input()\r\nt = k.count('0')\r\nif (k.count('1')>0):\r\n print(1, end = '')\r\nfor i in range(t):\r\n print(0, end = '')\r\n", "n = int(input())\r\ns = input()\r\nl = list(s)\r\nval = l.count(\"1\")\r\nzero = n - val\r\nif val == 0:\r\n print(s)\r\nelse:\r\n print(\"1\",end ='')\r\n for i in range(zero):\r\n print(\"0\", end = \"\")", "n=int(input())\r\ns=input()\r\ncnt0,cnt1=0,0\r\nfor i in s:\r\n if i=='0':\r\n cnt0+=1\r\n else:\r\n cnt1+=1\r\nif cnt1==0:\r\n print(s)\r\nelse:\r\n print('1'+'0'*cnt0)", "def sol(s):\r\n if(s.count('1')>0):\r\n print(1,end='')\r\n for i in range(s.count('0')):\r\n print(0,end='')\r\nn=int(input())\r\ns=input()\r\nsol(s)\r\n", "n=int(input())\r\ns=input()\r\nc=s.count(\"0\")\r\nif(\"1\" not in s):\r\n print(\"0\")\r\nelse:\r\n print(\"1\"+\"0\"*c)", "n=int(input())\r\na=input()\r\nif(a.count('1')):\r\n x='1'\r\nelse:\r\n x=''\r\nx=x+'0'*a.count('0')\r\nprint(x)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\nn=int(input())\r\ns=input()[:-1]\r\nif int(s,2)==0:\r\n print(s)\r\nelse:\r\n c=0\r\n for i in s:\r\n if i=='0':\r\n c+=1\r\n l=['1']+['0']*c\r\n print(''.join(l))", "n = int(input())\r\n\r\ndata = input()\r\n\r\nz = data.count('0')\r\no = data.count('1')\r\n\r\nif o != 0:\r\n if z != 0:\r\n print(\"1\" + \"0\" * z)\r\n else:\r\n print(1)\r\nelse:\r\n print(0)", "\r\nn = int(input())\r\nst = list(input())\r\nif not \"1\" in st:\r\n print(0)\r\n quit()\r\nprint(\"1\", end = \"\")\r\nfor i in st:\r\n if i == \"0\": \r\n print(i, end = \"\")\r\nprint()", "n = int(input())\r\ns = input()\r\ns = list(int(x) for x in s)\r\nfor i in range(n):\r\n if s[i] == 1:\r\n for j in range(i):\r\n s[i], s[j] = s[j], s[i]\r\n## for j in range(i, -1, -1):\r\n## s[i], s[j] = s[j], s[i]\r\n## print(s)\r\ni = 0\r\nwhile i < (len(s)-1):\r\n if s[i] == s[i+1] and s[i] == 1:\r\n del s[i]\r\n else:\r\n i += 1\r\nfor i in range(len(s)):\r\n print(s[i], end = '')\r\n", "n = int(input())\r\ns = input()\r\nc = s.count('1')\r\nret = min(1, c) * '1' + (len(s) - c) *'0' \r\nprint(ret)", "n=int(input())\r\ns=input()\r\nif s=='0':\r\n\tprint('0')\r\nelse:\r\n\tprint('1'+'0'*s.count('0'))\r\n", "n = int(input())\r\ns = input().strip()\r\nones = s.count('1')\r\nzeros = n - ones\r\n \r\nif ones == 1:\r\n print(s)\r\nelse:\r\n if ones:\r\n print(1, end='')\r\n print('0' * zeros)\r\n", "n = int(input())\r\na = list(input())\r\none = False\r\nt = 0\r\nfor i in a:\r\n if i == '0': t+=1\r\n elif not one: one = True\r\nif (not one):\r\n print(0)\r\nelse:\r\n print(10**t)\r\n", "s = input()\r\ns = input()\r\nprint(s if s == '0' else '1' + s.count('0') * '0')\r\n", "n = int(input())\r\nx = input()\r\n\r\nif len(x) == 1:\r\n print(x)\r\nelse:\r\n n = x.count(\"0\")\r\n print(\"1\" + \"0\"*n)", "def main():\r\n input()\r\n binary = input()\r\n print(\"1\" + str(binary.count(\"0\") * \"0\") if \"0\" != binary else 0)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nx=input().count('0')\r\nprint([0,'1'+x*'0'][x!=n])", "l=int(input());a=str(input())\r\na=sorted(a);b=a[len(a)-1];i=0\r\nwhile i<len(a)-1:\r\n if a[i]=='0':\r\n b+=a[i]\r\n i+=1\r\nprint(b)", "n=input()\r\ns=list(input())\r\nif \"1\" not in s:\r\n\tprint('0')\r\nelse:\r\n\ta=s.count('0')\r\n\tprint(1,end=\"\")\r\n\tprint('0'*a)", "n=int(input())\r\ns=input()\r\nzero=s.count('0')\r\none=s.count('1')\r\nif one>0:\r\n ns=\"1\"\r\n temp=\"\"\r\n temp=temp.zfill(zero)\r\n ns=ns+temp\r\n print(ns)\r\nelse:\r\n print('0')", "from itertools import repeat\n\nn = int(input())\ns = input()\n\nz = s.count('0')\n\nif s == '0':\n print(s)\nelse:\n print('1', *repeat('0', z), sep='')\n", "num = int(input())\r\ns = input()\r\n\r\nif \"1\" not in s:\r\n print(s)\r\nelse:\r\n\r\n ans = \"1\" + s.count(\"0\")*\"0\"\r\n\r\n print(ans)\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nz=0\r\nif s=='0':\r\n print(s)\r\n exit(0)\r\nfor x in s:\r\n if x=='0':\r\n z+=1\r\nprint('1'+'0'*z)", "n = int(input())\r\ns = input()\r\ncount1 = 0\r\nif(s=='0'):\r\n print(0)\r\nelse:\r\n for i in s:\r\n if(i=='0'):\r\n count1+=1\r\n print('1'+'0'*count1)", "input()\r\ns=input()\r\nk=s.count('0')\r\nif s==\"0\":print(0)\r\nelse:print(\"1\"+\"0\"*k)", "n = int(input())\ns = input()\nif s.count('1') > 0:\n print(1, s.count('0') * '0', sep='')\nelse:\n print(s.count('0') * '0')\n", "z = int(input())\r\na = input()\r\nfor i in range(z,0,-1):\r\n k = a.rfind('1')\r\n if k != -1 and a.count('1') > 1:\r\n a = a[:k]+a[k+1:]\r\nprint(a)\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nif n==1:\r\n\tprint(s)\r\nelse:\r\n\tx = s.count(\"0\")\r\n\tprint(\"1\"+(\"0\"*x))", "n = input()\r\ns = input().strip()\r\ncntOnes = 0\r\nfor c in s:\r\n if c == \"1\":\r\n cntOnes += 1\r\n\r\nif cntOnes > 0:\r\n print(1, end=\"\")\r\n cntZeros = len(s) - cntOnes\r\n for _ in range(cntZeros):\r\n print(0, end=\"\")\r\nelse:\r\n print(s)", "input()\r\na=input()\r\nif a.count('1')==0:print(a)\r\nelse:print('1'+'0'*a.count('0'))\r\n\r\n \r\n", "n = int(input())\r\ns = list(input())\r\n\r\nfor i in range(n-1,0,-1) :\r\n if s[i] == '1' and s[i-1] == '0' :\r\n s[i] = '0'\r\n s[i-1] = '1'\r\n elif s[i] == '1' and s[i-1] == '1' :\r\n n -= 1\r\n s[i] = '0'\r\nprint(\"\".join(s[:n]))\r\n\r\n", "q = int(input())\r\ns = input()\r\nc = 0\r\nif s.find(\"1\") == -1:\r\n print(0)\r\n exit()\r\nfor i in range(q):\r\n if s[i] == \"0\":\r\n c += 1\r\nw = \"1\"\r\nfor i in range(c):\r\n w += \"0\"\r\nprint(w)", "n=int(input())\r\ns=input()\r\nl=list(s)\r\nif(n==1 and l[0]=='0'):\r\n print(0)\r\nelse:\r\n a=[]\r\n y=l.count('0')\r\n a=['0']*y\r\n a.append('1')\r\n a.sort(reverse=True) \r\n s=''\r\n print(s.join(a))\r\n", "n=int(input())\r\ns1=sum([not int(x) for x in input()])\r\nprint('1'+'0'*s1 if n-s1!=0 else '0')\r\n", "n=int(input())\r\na=str(input())\r\ns=a.count(\"0\")\r\ns1=a.count(\"1\")\r\nif s1>0:\r\n\tprint(1,end=\"\")\r\nfor i in range(s):\t\t\t\t\t\t\r\n\tprint(0,end=\"\")", "n=int(input())\r\na=list(input())\r\nif a.count('1')==0:\r\n print('0')\r\nelse:\r\n print('1'+a.count('0')*'0')", "n=int(input())\r\ns=input()\r\nres = [int(x) for x in str(s)]\r\nc=list(set(res))\r\nif len(c)==1:\r\n if c[0]==0:\r\n print(s)\r\n else:\r\n print(1)\r\nelse:\r\n t=res.count(0)\r\n t1=[]\r\n t1.append(1)\r\n t2=[0]*t\r\n t3=t1+t2\r\n print(''.join(map(str, t3)))", "n=int(input())\r\ns=input()\r\nif \"0\" in s:\r\n if \"1\" in s:\r\n print(\"1\"+\"0\"*s.count(\"0\"))\r\n else:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")", "n=input()\r\nx=input()\r\nprint('1'+'0'*x.count('0') if x!='0' else 0)", "input(\"\")\r\nx = input(\"\")\r\nzeroes = x.count(\"0\")\r\nif \"1\" in x:\r\n print(\"1\" + (\"0\" * zeroes))\r\nelse:\r\n print(\"0\")\r\n", "n = int(input())\r\nl = input()\r\nzero = l.count(\"0\")\r\none = l.count(\"1\")\r\nif one>0:\r\n\tprint(\"1\"+zero*\"0\")\r\nelse:\r\n\tprint(zero*\"0\")\t\t\t", "n=int(input())\r\ns=input()\r\nprint(s[:1]+(s[1:].replace('1','')))", "\n\n_ = input()\nn = input()\n\nif n == '0':\n print(n)\nelse:\n print('1' + '0' * list(n).count('0'))\n", "import os\r\nimport sys\r\nimport math\r\n\r\ndef solve(n):\r\n if s[0] == '0':\r\n return 0\r\n i = 0\r\n counter = 0\r\n while i < len(s):\r\n if s[i] == '0':\r\n counter += 1\r\n i += 1\r\n return str('1' + '0' * counter)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n print(solve(n))\r\n", "n=int(input())\r\ns=input()\r\nif s==\"0\":\r\n\tprint(0)\r\nelse:\r\n\tc=s.count(\"0\")\r\n\ts2=\"1\"+\"0\"*c\r\n\tprint(s2)", "n=int(input())\r\nch=input()\r\nif \"1\" not in ch:\r\n print('0')\r\nelse:\r\n print('1'+'0'*ch.count('0'))", "def minimal(s):\r\n if len(s) == 1:\r\n return s\r\n count, t = 0, ''\r\n for elem in s:\r\n if elem == '0':\r\n count += 1\r\n t += '1'\r\n for i in range(count):\r\n t += '0'\r\n return t\r\n\r\n\r\nn = int(input())\r\nz = input()\r\nprint(minimal(z))\r\n", "n = input()\r\ns = input()\r\nn = int(n)\r\nprint('1'*min(s.count('1'), 1)+'0'*s.count('0'))", "n = int(input())\r\nx = list(input())\r\nif x == [\"0\"]:\r\n\tprint(0)\r\nelse:\r\n\tprint(10 ** x.count('0'))", "n = int(input())\r\nl = list(input())\r\nk=['1']\r\nif l[0]=='1':\r\n\tfor i in range(1,l.count('0')+1):\r\n\t\tk.append('0')\r\n\tprint(\"\".join(k))\r\nelse:\r\n\tprint('0')", "n = int(input())\r\nz = input().count('0')\r\no = n - z\r\nif o <= 1:\r\n print('1' * o + '0' * z)\r\nelse:\r\n print('1' + '0' * z)", "\nm = input()\nbinn = int(input())\ny = str(binn)\nz = y.count('0')\nif y.count('1') == 0:\n print('0')\nelse:\n print(bin(2**z)[2:])\n", "input()\r\nn = input()\r\nzero = n.count('0')\r\n\r\nif '1' in n:\r\n print('1', end='')\r\nprint('0' * zero)", "n = int(input())\r\ns = [i for i in input()]\r\nc_0 = s.count('0')\r\nc_1 = s.count('1')\r\nif c_1 > 0:\r\n print('1' + '0'*c_0)\r\nelse:\r\n print('0'*c_0)", "n = int(input())\r\ns = input()\r\ncnt = [0] * 2\r\ncnt[0] = s.count('0')\r\ncnt[1] = s.count('1')\r\ncnt[1] = 1 if cnt[1] >= 1 else 0\r\nprint('1' * cnt[1] + '0' * cnt[0])\r\n", "_, s = input(), input()\r\nprint ('1' * ('1' in s) + '0' * (s.count('0')))", "n=int(input());s=str(input());\r\nif n==1:print(s)\r\nelse:print('1'+'0'*list(s).count('0'))", "n=int(input())\r\ns=input()\r\nc0,c1=s.count('0'),s.count('1')\r\nif c1>=1:\r\n print('1'+c0*'0')\r\nelse:\r\n print(c0*'0')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\ncnt = [0] * 2\r\nfor i in s:\r\n cnt[int(i)] += 1\r\nans = \"1\" * (1 if cnt[1] else 0) + \"0\" * cnt[0]\r\nprint(ans)", "print('1'+'0'*input().count('0')if int(input())>1else input())", "input()\r\ns = input()\r\nprint('1'*int(s.count('1')>0)+'0'*s.count('0'))\r\n", "length = int(input())\r\ns = input()\r\nif s == '0':\r\n print(s)\r\nelse:\r\n print('1' + '0' * (length - s.count('1')))\r\n", "input()\r\nn=input()\r\no=n.count('1')\r\nif o==0:\r\n print(n)\r\n exit(0)\r\no=n.count('0')\r\nprint('1'+'0'*o)", "#Minimum Binary Number_976A\r\nx = int(input())\r\nk = input()\r\nwhile k.find(\"11\")>=00 or k.find(\"01\")>=0:\r\n k = k.replace(\"11\",\"1\")\r\n k = k.replace(\"01\",\"10\")\r\nprint(k)", "def solve(n, s):\n n1 = s.count('1')\n n0 = n - n1\n if n1:\n print('1' + '0'*s.count('0'))\n else:\n print('0')\n\n\ndef main():\n n = int(input())\n s = input()\n solve(n, s)\n\n\nmain()\n", "from collections import Counter\n\nn = int(input())\nc = Counter(input())\nprint(('1' if c['1'] else '')+('0'*c['0']))\n", "n=int(input())\r\ns=input()\r\nc0=0\r\nb=False\r\ni=0\r\nwhile i<n:\r\n if s[i]==\"0\":\r\n c0+=1\r\n else:\r\n b=True\r\n i+=1\r\nif b:\r\n print(\"1\",end=\"\")\r\nfor i in range(c0):\r\n print(\"0\",end=\"\") \r\n\r\n", "n=int(input())\r\nst =str(input())\r\nif n == 1:\r\n print(st)\r\nelse:\r\n\r\n if st[0]=='0':\r\n prezero=1\r\n else:\r\n prezero=0\r\n\r\n zeroc=0\r\n for x in st:\r\n if x == '0':\r\n zeroc += 1\r\n\r\n zeroc=zeroc-prezero\r\n\r\n answ='1'\r\n for i in range(0,zeroc):\r\n answ+='0'\r\n\r\n\r\n print(answ)\r\n", "import math\r\nimport string\r\n\r\nlen = int(input())\r\ns = str(input())\r\nflag = False\r\nif len == 1 and s == \"0\":\r\n print(\"0\")\r\nelse:\r\n s = s.replace(\"1\",\"\")\r\n s = \"1\"+s\r\n print(s)", "n=int(input())\r\ns=input()\r\nif n==1:\r\n print(s)\r\nelse:\r\n c=s.count('0')\r\n print('1'+'0'*c)\r\n", "n=int(input())\r\ns=input()\r\nif n==1:\r\n print(s)\r\nelse:\r\n print(\"1\",end=\"\")\r\n for i in range(s.count(\"0\")):\r\n print(\"0\",end=\"\")\r\n", "n = int(input())\r\ns = input() # The binary string\r\n\r\no = 0\r\nz = 0\r\n\r\nfor c in s:\r\n if(c==\"0\"):z+=1\r\n else:o+=1\r\n\r\nif(s==\"0\"):print(\"0\")\r\nelif(s==\"1\"):print(\"1\")\r\nelse:print(\"1\" + \"0\"*z)", "import sys\r\nn=int(input().strip())\r\ns=input().strip()\r\nc0,c1=s.count('0'),s.count('1')\r\nif c1==0:\r\n\tprint(\"0\")\r\nelse:\r\n\tprint(\"1\",end=\"\")\r\n\tfor i in range(c0): print(\"0\",end=\"\")\r\n\tprint()", "n = int(input())\r\ns = input()\r\n\r\nresult = \"\"\r\nfound_one = False\r\n\r\nfor c in s:\r\n if c == \"0\":\r\n result += \"0\"\r\n elif not found_one:\r\n result += \"1\"\r\n found_one = True\r\n\r\nprint(result)\r\n", "n = int(input())\ns = input()\nzero = s.count('0')\none = s.count('1')\nans = \"\"\nif zero == 0:\n print(1)\nelif zero !=0 and zero !=n:\n ans += '1'\n for i in range(zero):\n ans += '0'\n\n print(ans)\n \nelse:\n print('0')", "n = int(input())\r\nb = input()\r\nif b == \"0\":\r\n print(0)\r\nelse:\r\n z = b.count(\"0\")\r\n print(\"1\", end = \"\")\r\n for i in range(z):\r\n print(\"0\", end = \"\")", "IL = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\ns = input()\r\nprint(min(s.count('1'), 1) * '1' + s.count('0') * '0')", "n=int(input())\r\ns=input()\r\nli=[0]*2\r\nli[0]=s.count('0')\r\nif('1' in s):\r\n li[1]=1\r\nif(li[1]>=1):\r\n print(\"1\",end=\"\")\r\nfor i in range(li[0]):\r\n print(0,end=\"\")", "l = int(input())\r\ns = input();\r\nk = s.count('0')\r\nif s=='0':\r\n\tans=s\r\nelse:\r\n\tans = '1'+ k*'0';\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nif s==\"0\":\r\n print(0)\r\n# z=s.count(\"0\")\r\nelse:\r\n z = s.count(\"0\")\r\n print(10**z)\r\n", "n = int(input())\ns = input()\ncnt = s.count('0')\nif cnt == n:\n print(0)\nelse:\n print('1' + '0' * cnt)\n\t\t \t \t\t \t \t \t\t\t \t", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip().split()[1]\r\n return '1'*('1' in s) + '0'*s.count('0')\r\n\r\nprint(main())", "if __name__ == '__main__' :\r\n n = int(input())\r\n s = input()\r\n zeroes = 0\r\n for i in range(n) :\r\n if s[i] == '0' :\r\n zeroes = zeroes+1\r\n ones = n-zeroes\r\n if ones != 0 :\r\n print('1',end = '')\r\n else :\r\n pass\r\n for i in range(zeroes) :\r\n print('0', end = '')", "n = input()\r\nstring = str(input())\r\nzero = string.count('0')\r\nlis = '1' + '0'*zero\r\nif string == '0':\r\n print('0')\r\nelse:\r\n print(lis)", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN=int(input())\r\nL=list(input())\r\nif L.count('1')>0:\r\n\tprint(\"1\",end='')\r\nfor i in L:\r\n\tif i!='1':\r\n\t\tprint(i,end='')\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nzeros = s.count(\"0\")\r\nif n == 1:\r\n print(s)\r\nelse:\r\n print(\"1\" + \"0\" * zeros)\r\n", "N = int(input())\r\nstr = input()\r\nif str == '0':\r\n print(0)\r\nelse:\r\n print('1' + '0'*str.count('0'))", "n = int(input())\r\nl = list(input())\r\na=['1']\r\nif l[0]=='1':\r\n\tz=l.count('0')\r\n\ta.append('0'*z)\r\n\tprint(\"\".join(a))\r\nelse:\r\n\tprint('0')", "n=int(input())\r\ns=input()\r\nif s=='0':\r\n print(0)\r\nelse:\r\n print('1'+s.count('0')*'0')", "n=int(input())\r\ns=input()\r\n\r\nif len(s)==1:\r\n print(s)\r\n exit(0)\r\n\r\nprint('1',end='')\r\nfor i in range(n):\r\n if s[i]=='0':\r\n print('0',end='')\r\n", "exec('input();s=input()\\nif int(s)==0:\\n\\tprint(0)\\nelse:\\n\\tprint(\\'1{}\\'.format(\\'0\\'*s.count(\\'0\\')))')", "input()\r\ns = input()\r\n\r\nprint('0' if s == '0' else '1' + '0' * s.count('0'))", "input()\r\ns = input()\r\nprint(('1' + '0' * s.count('0'), s)[s == '0'])", "n = int(input())\r\ns = input()\r\nt = s[0]\r\nfor i in range(1, n):\r\n if s[i] == \"0\":\r\n t += s[i]\r\n\r\nprint(t)", "n = int(input())\r\ns = input()\r\nif '1' in s:\r\n print('1',end='')\r\nprint('0'*s.count('0'))\r\n", "n = int(input())\r\ns = input()\r\nflag=0 \r\nans=\"\"\r\nfor ele in s:\r\n if ele=='1' and flag==0:\r\n ans+=ele \r\n flag=1\r\n if ele=='0':\r\n ans+=ele \r\nprint(ans)", "n=int(input())\r\ns=input()\r\nif s=='0': print('0')\r\nelse:\r\n l=list(s)\r\n k='1'\r\n for j in range(l.count('0')):\r\n k+='0'\r\n print(k) ", "n=int(input())\r\nl=[char for char in input()]\r\n\r\nif l[0]==\"0\":\r\n print(0)\r\n exit(0)\r\n\r\ncount=l.count('0')\r\n\r\nprint(\"1\",end=\"\")\r\n\r\nfor x in range(count):\r\n print(\"0\",end=\"\")\r\nprint()", "from sys import stdin\nn=int(stdin.readline().strip())\ns=stdin.readline().strip()\nif s==\"0\":\n print(0)\nelse:\n s=s.count(\"0\")\n print(\"1\"+s*\"0\")\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\ns = input()\r\n\r\nif n == 1:\r\n print(s)\r\nelse:\r\n print(bin(2**s.count(\"0\"))[2:])\r\n", "n = map(int,input())\r\ns = input()\r\ncntof0 = 0\r\nfor i in s:\r\n if(i == '0'):cntof0 += 1\r\nif(s == '0'):print('0')\r\nelse:print('1' + '0' * cntof0)", "N=int(input())\r\nL=list(input())\r\nif L.count('1')>0:\r\n\tprint(\"1\",end='')\r\nfor i in L:\r\n\tif i!='1':\r\n\t\tprint(i,end='')\r\n ", "#!/usr/bin/env python3\n\n_ = input()\nstring = input()\n\nif string == '0':\n print(string)\nelse:\n numberOf0s = sum(1 for ch in string if ch == '0')\n print('1' + ('0' * numberOf0s))\n\n", "_ = int(input())\r\nbinary_number = input()\r\n\r\nif binary_number == '0':\r\n print('0')\r\nelse:\r\n count_0 = sum(1 for b in binary_number if b == '0')\r\n count_1 = sum(1 for b in binary_number if b == '1')\r\n print('1' + '0' * count_0)\r\n", "l = []\r\nt = []\r\nn = int(input())\r\nl = input()\r\nc = l.count('1')\r\nif c>=1:\r\n t.append('1')\r\nc = n - c\r\nfor i in range(c):\r\n t.append('0')\r\nprint(\"\".join(t))\r\n", "input()\r\ns = input()\r\nzeros = s.count('0')\r\nones = s.count('1')\r\nprint('1' * min(ones, 1) + '0' * zeros)", "n = int(input())\r\ns = input()\r\nprint(s if n == 1 else '1'+\"0\"*s.count(\"0\"))", "n = int(input())\r\nstr_list = list(map(int, list(input())))\r\n# print(str_list)\r\ncnt = [0, 0]\r\nfor i in range(n):\r\n cnt[str_list[i]] += 1\r\nans = \"\"\r\nif cnt[1] >= 1:\r\n ans = \"1\"\r\nwhile cnt[0] > 0:\r\n ans += \"0\"\r\n cnt[0] -= 1\r\nprint(ans)\r\n\r\n\r\n", "n=int(input())\r\ns=int(input())\r\na=str(s)\r\ncount_1=0\r\ncount_0=0\r\ncount_1=a.count('1')\r\ncount_0=a.count('0')\r\nif count_1==0:\r\n print(0)\r\nelse:\r\n print(\"1\"+count_0*\"0\")", "\r\ndef solve():\r\n n=int(input())\r\n s=input()\r\n m=s.count('0')\r\n if s[0]=='1':\r\n print('1',end='')\r\n while m:\r\n print('0',end='')\r\n m-=1\r\n\r\n\r\ndef main():\r\n t=1\r\n # t=int(input())\r\n while t>0:\r\n solve()\r\n t-=1\r\n\r\nmain()\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nif n == 1:\r\n print(s)\r\nelse:\r\n cnt = s.count(\"0\")\r\n print(\"1\", end=\"\")\r\n for i in range(cnt):\r\n print(\"0\", end=\"\")\r\n print(end=\"\\n\")\r\n", "n, s = int(input()), input()\r\nprint('1' + '0' * s.count('0') if '1' in s else '0')\r\n", "n=int(input())\r\ns=input()\r\ncount_0=s.count('0')\r\ncount_1=s.count('1')\r\nif count_1==0:\r\n print(0)\r\nelse:\r\n print(\"1\"+count_0*\"0\")", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(input())\r\n A.sort()\r\n while len(A) >= 2 and A[-2] == '1' and A[-1] == '1':\r\n A.pop()\r\n print(''.join(A[::-1]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "b=int(input(''))\r\na=input('')\r\nt=[1]\r\np=0\r\nz=0\r\nl=0\r\nqw=0\r\nfor i in range(len(a)):\r\n if(str(a[l])=='0'):\r\n z=z+1\r\n l=l+1\r\nif(z==len(a)):\r\n print(a)\r\nelse:\r\n for k in range(z):\r\n t.append(0)\r\n for j in range(len(t)):\r\n print(t[p],end='')\r\n p=p+1", "n=int(input())\ns=input()\nz=0\no=0\nfor c in s:\n if c==\"1\":\n o+=1\n else:\n z+=1\n \nt=\"\"\nfor i in range(z):\n t+=\"0\"\n \nif o==0:\n print(t)\nelse:\n t=\"1\"+t\n print(t) \n", "n = int(input())\r\nbinary = input()\r\n\r\nif binary == '0':\r\n print('0')\r\nelse:\r\n a = binary.count('0')\r\n print('1' + '0' * a)", "n=int(input())\r\na=input()\r\ncount1=0\r\nfor item in a:\r\n if(item=='1'):\r\n count1=count1+1\r\nif(count1>=1):\r\n print(1,end=\"\")\r\nfor i in range(0,len(a)-count1):\r\n print(0,end=\"\")", "# cf 976 A 800\nn = int(input())\ns = input()\nif s == \"0\":\n print(s)\nelse:\n n0 = s.count('0')\n print(\"1\" + \"0\" * n0)\n", "n = int(input())\r\ns = input()\r\no, z= 0, 0\r\nfor i in s:\r\n\to += (i == '1')\r\n\tz += (i == '0')\r\nif o >= 1:\r\n\tprint(1, end = \"\")\r\nfor i in range(z):\r\n\tprint(0,end=\"\")\r\n\r\n", "a=int(input())\r\nb=list(input())\r\nb.sort(reverse=True)\r\nb=''.join(b)\r\nif(b[0] is '1'):\r\n b=b.replace('1',' ')\r\n b=list(b)\r\n b[0]='1'\r\n b=''.join(b)\r\n b=b.replace(' ','')\r\nprint(b)\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nc = s.count('0')\r\nif('1' in s):\r\n ans = '1' + '0' * c \r\nelse:\r\n ans = '0'\r\nprint(ans)", "n = int(input()); s = input()\r\nwhile '11' in s: s = s.replace('11', '1')\r\ns = s.count('1')*'1' + s.count('0')*'0'\r\nwhile '11' in s: s = s.replace('11', '1')\r\nprint(s)\r\n", "n=int(input())\r\ns=input()\r\nif s[0]=='1':\r\n print('1',end='')\r\nfor t in s:\r\n if t=='0':\r\n print('0',end='')\r\n", "input()\r\ns = input()\r\nif(s[0] == '0'):\r\n print(0)\r\nelse:\r\n print(\"1\"+\"0\"*s.count('0'))", "n=int(input())\r\ns=input()\r\nt=s.count('0')\r\nif s.count('1')>=1:\r\n print(int('1'+'0'*t))\r\nelse:\r\n print(0)", "n = int(input())\r\na = input()\r\ncount_zero = 0\r\ncount_one = 0\r\nfor i in a:\r\n if i == '0':\r\n count_zero += 1\r\n else:\r\n count_one += 1\r\nif count_one > 0:\r\n print(1, end=\"\")\r\nfor i in range(count_zero):\r\n print(0, end=\"\")\r\nprint(\"\")", "def main():\n _, s = input(), input()\n print(s[0], s[1:].replace('1', ''), sep='')\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\ns = input()\nif(\"1\" in s):\n\tprint(\"1\" + \"0\" * s.count(\"0\"))\nelse:\n\tprint(0)\n", "n = int(input())\r\ns = input()\r\na = 0\r\nb = 0\r\nfor i in s:\r\n if i == '0':\r\n a += 1\r\n else:\r\n b += 1\r\nc = min(b, 1)\r\nfor i in range(c):\r\n print(1, end='')\r\nfor i in range(a):\r\n print(0, end='')", "n = int(input())\n\nbinString = input()\n\noneCount = 0\n\nzeroCount = 0\n\nfor bit in binString:\n if bit == '1': oneCount+=1\n else: zeroCount+=1\n\nres = ''\n\nif oneCount>0:\n res+= '1'\n\n for _ in range(zeroCount): res+= '0'\n\n print(res)\n\nelse: print('0')", "n=int(input())\r\ns=input()\r\nk=\"\"\r\nif \"1\" in s:\r\n k=\"1\"\r\nl=\"0\"*s.count(\"0\")\r\nprint(k+l)\r\n\r\n", "sze = int(input())\r\narr = list(input())\r\nans = \"\"\r\nfirst = False\r\nfor ch in arr:\r\n if(ch == '1' and first == False):\r\n ans += ch\r\n first = True\r\n elif(ch == '0'):\r\n ans += ch\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nprint('1'+s.count('0')*'0' if not s == '0' else s)\r\n", "n = int(input())\r\ns = input()\r\nprint(s[0]+'0'*(s[1:].count('0')))\r\n", "n=int(input())\r\ns=input()\r\nx='1'\r\nc=0\r\nfor i in s:\r\n if(i=='1'):\r\n c=c+1\r\n else:\r\n x=x+'0'\r\nif(c>=1):\r\n print(x)\r\nelse:\r\n print('0')\r\n", "from collections import OrderedDict\nd=\"\"\nt=int(input())\ns=str(input())\nf=\"\"\nfor i in range(0,len(s),1):\n if(s[i]=='1'):\n f+=s[i]\n else:\n d+=s[i]\nx=\"\".join(OrderedDict.fromkeys(f))\nprint(x+d)\n\n\t\t \t \t \t \t \t\t", "n = int(input())\r\ns = input()\r\nif(len(s) == 1):\r\n print(s)\r\nelse:\r\n c = 0\r\n for ch in s:\r\n if(ch == '1'):\r\n c += 1\r\n if(c != 0):\r\n print(\"1\"+\"0\"*(len(s) - c))\r\n else:\r\n print(s)\r\n", "input()\r\ny = input()\r\n\r\nn1 = y.count('1')\r\nn0 = y.count('0')\r\nif n1 > 0:\r\n print('1', end='')\r\nfor i in range(n0):\r\n print('0', end='')\r\n\r\n", "s=input()\r\ns=input()\r\nif len(s)==1:\r\n print(s)\r\nelse:\r\n print('1'+s.count('0')*'0')", "n=int(input())\r\ns=input()\r\ny=s.count('0')\r\nif s=='0':\r\n print('0')\r\nelse:\r\n print(10**y)\r\n", "n = int(input())\r\na = input()\r\n\r\nif \"1\" in a:\r\n aux = a.count(\"1\")\r\n a = list(a)\r\n for i in range(aux):\r\n a.remove(\"1\")\r\n\r\n a.insert(0, \"1\")\r\n b = ''.join(a) \r\n print(b)\r\nelse:\r\n print(a)", "n=int(input());s=input()\r\nif '1'in s:print('1'+'0'*s.count('0'))\r\nelse:print(0)", "n = int(input())\r\ns = input()\r\n\r\ncnt0 = 0\r\ncnt1 = 0\r\n\r\nfor i in range(len(s)):\r\n if(s[i]=='0'):\r\n cnt0 += 1\r\n else:\r\n cnt1 += 1\r\n\r\nans = \"\"\r\nif(cnt1 > 0):\r\n ans = ans + '1'\r\n\r\nfor i in range(cnt0):\r\n ans = ans + '0'\r\n\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nc1,c2 = s.count('0'),s.count('1')\r\nif c2:\r\n print(1,end= '')\r\nfor i in range(c1):\r\n print(0,end='')\r\n ", "len = int(input())\r\ns = input()\r\nif s == '0' :\r\n print(s)\r\nelse:\r\n print('1', end='')\r\n for i in range(len):\r\n if s[i] == '0':\r\n print('0', end='')\r\n", "n=int(input())\r\ns=input()\r\nadd=0\r\ntype=False\r\nfor i in s :\r\n\tif i=='1':\r\n\t\ttype=True\r\n\telse:\r\n\t\tadd+=1\r\nout=''\r\nif type:\r\n\tout+='1'\r\nout+='0'*add\r\nprint(out)\r\n\r\n\r\n", "a = int(input())\r\ns = input()\r\nzero = s.count('0')\r\nif s.count('1') >= 1:\r\n print('1'+(zero*'0'))\r\nelse:\r\n print(0)\r\n\r\n \r\n", "n=int(input())\r\ns=input()\r\nif s.count(\"1\")>0:\r\n print(\"1\"+(\"0\"*s.count(\"0\")))\r\nelse:\r\n print(\"0\"*s.count(\"0\"))", "a=input;a();p=a();k=p.count(\"0\");print(*[\"1\"+\"0\"*k] if \"1\" in p else [0])", "input()\r\nS = list(input())\r\nprint('1'+'0'*S.count('0') if S.count('1')!=0 else '0'*S.count('0'))", "n=int(input())\r\ns=input()\r\nif s.count('1')==0:\r\n print(s)\r\n exit(0)\r\nprint('1'+'0'*s.count('0'))", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\ns = input()\r\na = s.count(\"1\")\r\nb = s.count(\"0\")\r\nif a != 0:\r\n\ta = 1\r\nans = \"1\" * a + \"0\" * b\r\nprint(ans)\t\r\n", "n = int(input())\r\n\r\nm = input()\r\n\r\ns = list(m)\r\n\r\nif n==1:\r\n ans = s[0]\r\nelse:\r\n count = 0\r\n for i in range(0,n):\r\n if s[i]=='0':\r\n count = count + 1\r\n ans = '1'\r\n for i in range(0,count):\r\n ans = ans + '0'\r\n\r\nprint(ans)", "a=int(input())\r\nb=input()\r\nc=0\r\nif b. count('1')>=1:\r\n print(\"1\"+b.count('0')*\"0\")\r\nelse:\r\n print(\"0\")\r\n\r\n \r\n ", "# https://codeforces.com/problemset/problem/976/A\r\n\r\nn = int(input())\r\n\r\ns = input()\r\ntotal = 0\r\n\r\nif n == 1:\r\n print(s)\r\nelse:\r\n for i in s:\r\n if i == '0':\r\n total += 1\r\n\r\n print('1' + '0' * total)\r\n", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=input()\r\nif len(a)==1:\r\n print(a)\r\nelse:\r\n n=a.count(\"0\")\r\n print(\"1\" + \"0\"*n)", "n = input()\r\ns = input()\r\n\r\nz = s.count('0')\r\no = s.count('1')\r\n\r\nif o > 0:\r\n print('1', end='')\r\nprint('0' * z)\r\n", "n = int(input())\r\ns = input()\r\nn1 = s.count(\"1\")\r\nn0 = n - n1\r\nif n == 1:\r\n print(s)\r\nelse:\r\n print(\"1\" + n0 * \"0\")\r\n", "n=int(input())\r\ns=input()[:n]\r\nflag=0\r\nb=s.count(\"0\")\r\n\r\nif s.count(\"0\")==1 and len(s)==1:\r\n\tprint(\"0\")\r\n\r\nelif str(1) in s:\r\n flag=1\r\n print(flag,*[str(0) for a in range(b)],sep=\"\")\r\n", "n = int(input())\r\nstring = input()\r\n\r\nif string == '0':\r\n print('0')\r\nelse:\r\n string = list(string)\r\n print('1' + string.count('0')*'0')", "n=int(input())\r\nm=input()\r\nif \"1\" not in m:\r\n print(m)\r\nelse:\r\n count=m.count(\"0\")\r\n s=\"1\"\r\n s+=\"0\"*count\r\n print(s)", "n = int (input());\r\ns=input();\r\nb=[int(s[i]) for i in range(n)];\r\ncountZero=0;\r\ncountOne=0;\r\nfor i in range(n):\r\n if b[i]==0 and countOne>0:\r\n countZero+=1;\r\n elif b[i]==1:\r\n countOne+=1;\r\nif countOne==0:\r\n print(0);\r\nelse:\r\n print('1'+'0'*countZero);\r\n ", "N = int(input())\r\nS = input()\r\n\r\nzeros = 0\r\nones = 0\r\n\r\nfor i in S:\r\n if i == '0':\r\n zeros+=1\r\n else:\r\n ones+=1\r\n\r\nif ones == 0:\r\n print(0)\r\nelse:\r\n print(1,end='')\r\n for i in range(zeros):\r\n print(0,end='')\r\n \r\n", "a=input()\na=input()\nif int(a):\n print('1'+'0'*a.count('0'))\nelse:\n print(0)", "n = int(input())\r\na = input()\r\nif a.count('1') >= 1:\r\n print('1'+a.count('0')*'0')\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\ns = list(input())\r\n\r\nfor i in range(n):\r\n if s[i] == '1':\r\n for j in range(i+1, n):\r\n if s[j] == '1':\r\n s[j] = ''\r\n\r\nprint(''.join(s))", "n=input()\r\ns=input()\r\nprint('1'*int(bool(s.count(\"1\")))+\"0\"*s.count(\"0\"))", "n = int(input())\ns = [x for x in input()]\nif s.count('1') > 0:\n print('1', '0'*s.count('0'), sep='')\nelse:\n print('0')\n", "n = int(input())\r\nstring = input()\r\nstring = \"\".join(sorted(string))[::-1]\r\nfor i in range(string.count(\"1\")-1):\r\n string = string.replace(\"11\", \"1\")\r\nprint(string)", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n s = input()\n\n if n == 1:\n print(s)\n return\n\n cnt = 0 # s中0的个数\n for i in range(n): cnt += s[i] == '0'\n \n print(\"1\" + \"0\" * cnt)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t\t\t\t\t \t \t \t\t \t\t \t \t \t\t\t", "leng=int(input())\r\nx=input()\r\nzero=x.count(\"0\")\r\nif \"1\" in x:\r\n print(\"1\"+zero*\"0\")\r\nelse:\r\n print(0)", "n, s = int(input()), input()\r\nprint(s if s == '0' else '1' + '0' * s.count('0'))", "n=int(input())\r\ns=input()\r\na,b=s.count('1'),s.count('0')\r\nprint(['0','1'+'0'*b][a>0])", "def main():\n n = int(input())\n s = input()\n a = 0\n if s == '0':\n print(0)\n return\n print(1, end = '')\n for i in range(n):\n if s[i] == '0':\n a += 1\n for i in range(a):\n print(0, end = '')\nmain()", "#Bhargey Mehta (Junior)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open('input.txt', 'r')\r\nMOD = 998244353\r\nsys.setrecursionlimit(1000000)\r\n\r\nn = int(input())\r\ns = input()\r\nif s == '0': ans = '0'\r\nelse: ans = '1' + '0'*s.count('0')\r\nprint(ans)", "n = int(input())\r\ns = list(input())\r\nprint('1' + '0' * s.count('0')) if '1' in s else print('0' * s.count('0'))", "n=int(input())\r\ns=input()\r\ny=s.count('0')\r\nif n==1:\r\n print(s)\r\nelse:\r\n print('1'+y*'0')\r\n\r\n", "input()\r\na = list(input())\r\nprint('0'*a.count('0') if a.count('1') == 0 else '1'+'0'*a.count('0'))\r\n", "input()\r\ns=input()\r\nif s==\"0\":print(0)\r\nelse: print(\"1\"+s.replace(\"1\",\"\"))", "_ = int(input())\r\ns = input()\r\nprint(\"1\"+\"0\"*s.count(\"0\") if s != \"0\"else s)\r\n", "n=int(input())\r\ns=list(str(input()))\r\nsu=0\r\nif s[0]=='0':\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n if s[i]=='0':\r\n su+=1\r\n print('1'+'0'*su)\r\n", "n=int(input())\na=input()\nif('1' not in a):\n if(len(a)==1):\n print(a)\nelse:\n c=a.count('0')\n d='1'+('0'*c)\n print(d)\n", "n=int(input())\r\nst=str(input())\r\nk=st.count('0')\r\nif st.count('1')!=0:\r\n print('1',end=\"\")\r\nfor i in range(k):\r\n\tprint('0',end=\"\")", "n,l=int(input('')),list(input(''))\r\na=l.count('1')\r\nb=n-a\r\np=[]\r\nif a>0:\r\n p.append('1')\r\nfor i in range(b):\r\n p.append('0')\r\nprint(''.join(p))", "n = int(input())\r\ns = input()\r\nz = s.count('0')\r\nif z == n:\t\r\n\tprint(s)\r\nelse :\r\n\tprint(1, end = \"\")\r\n\tfor i in range(z):\r\n\t\tprint(0, end = \"\")", "input()\r\ns = input()\r\nprint(('1' if s.count('1') > 0 else '') + ('0' * s.count('0')))\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\ns=int(input())\r\ns=str(s)\r\na=0\r\nb=0\r\nfor i in range(n):\r\n if s[i]=='1':\r\n a+=1\r\n else:\r\n b+=1\r\nan=''\r\nc=''\r\nif a>0:\r\n an='1'\r\nif b>0:\r\n c='0'*b\r\nprint(an+c)", "\"\"\"Problem A - Minimum Binary Number.\n\nhttp://codeforces.com/contest/976/problem/a\n\nString can be called correct if it consists of characters \"0\" and \"1\" and\nthere are no redundant leading zeroes. Here are some examples: \"0\", \"10\",\n\"1001\".\n\nYou are given a correct string s.\n\nYou can perform two different operations on this string:\n\n1. swap any pair of adjacent characters (for example, \"101\" \"110\");\n\n2. replace \"11\" with \"1\" (for example, \"110\" \"10\").\n\nLet val(s) be such a number that s is its binary representation.\n\nCorrect string a is less than some other correct string b iff val(a) < val(b).\n\nYour task is to find the minimum correct string that you can obtain from the\ngiven one using the operations described above. You can use these operations\nany number of times in any order (or even use no operations at all).\n\nInput:\n\nThe first line contains integer number n (1 ≤ n ≤ 100) — the length of string\ns.\n\nThe second line contains the string s consisting of characters \"0\" and \"1\". It\nis guaranteed that the string s is correct.\n\nOutput:\n\nPrint one string — the minimum correct string that you can obtain from the\ngiven one.\n\n\"\"\"\nimport logging\n\n\nfmt = '%(levelname)s - %(name)s (line:%(lineno)s) - %(message)s'\nformatter = logging.Formatter(fmt)\n\nch = logging.StreamHandler()\nch.setLevel(logging.ERROR)\nch.setFormatter(formatter)\n\nlogger = logging.getLogger('minimum_binary_number')\nlogger.setLevel(logging.ERROR)\nlogger.addHandler(ch)\n\n\ndef solve(s):\n ss = ''.join(reversed(s))\n while ss.count('1') > 1:\n if '11' in ss:\n ss = ss.replace('11', '1')\n continue\n for i in range(len(ss)):\n if ss[i] == '1' and ss[i+1] == '0':\n ss = ss[:i] + '01' + ss[i+2:]\n break\n sss = ''.join([x for x in reversed(ss)]) \n return sss\n\n\ndef main():\n _ = int(input().strip())\n s = input().strip()\n \n result = solve(s)\n print(result)\n \n\nif __name__ == '__main__':\n main()\n", "import sys\r\n\r\nn = int(input())\r\ns = list(input())\r\ni = 1\r\nwhile i < len(s):\r\n if s[i] == '1':\r\n s.pop(i)\r\n else:\r\n i += 1\r\n\r\nprint(''.join(s))\r\n", "n=int(input())\r\ns=str(input())\r\nk=s.count(\"1\")\r\n#t=\"1\"*3\r\n#print(t)\r\nif k>=1:\r\n print(\"1\"*1+\"0\"*(n-k))\r\nelse:\r\n print(s)\r\n\r\n ", "n=int(input())\r\na=input()\r\nb=a.count('0')\r\nif a=='0':\r\n\tprint('0')\r\nelse:\r\n\tprint('1'+'0'*b)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\ns=str(input())\r\nprint(\"1\"*int(s.count(\"1\")!=0)+\"0\"*s.count(\"0\"))" ]

[ "from math import *\r\nt = input\r\nn = int(t())\r\na = sum(t()[-4] == 'h' for i in 'i' * n)\r\nprint(ceil(max(max(n - a, a) * 2 - 1, n) ** .5))\r\n", "# LUOGU_RID: 101738955\nfrom math import ceil\r\nn = int(input())\r\na = sum(input()[-4] == 'h' for _ in range(n))\r\nprint(ceil(max(max(n - a, a) * 2 - 1, n) ** .5))\r\n", "N = int(input())\r\ns = 0\r\nfor i in range(N):\r\n\tif (input().split()[1] == 'soft'):\r\n\t\ts += 1\r\nh = N - s\r\nif s > h:\r\n s, h = h, s \r\nn = 1\r\nwhile not (s <= (n * n) // 2 and h <= (n * n) // 2 + (n % 2)):\r\n\tn += 1\r\nprint(n)# 1697834199.5823593", "from math import sqrt, ceil, floor\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(0, n):\r\n a, b = input().split()\r\n if b == 'soft':\r\n cnt += 1\r\ncnt = max(cnt, n-cnt)\r\nfor i in range(0, 100):\r\n t = i*i\r\n a, b = int(ceil(t/2)), int(floor(t/2))\r\n if(a >= cnt and b >= n-cnt) or (b >= cnt and a >= n-cnt):\r\n print(i)\r\n break\r\n", "# coding: utf-8\r\n\r\nn = int(input())\r\nhard = soft = 0\r\n\r\nfor i in range(n):\r\n cheese = input().split()\r\n \r\n if cheese[1] == 'hard':\r\n hard += 1\r\n \r\n else:\r\n soft += 1\r\n \r\ni = 1\r\n\r\nwhile True:\r\n if (hard <= (i * i) // 2 and soft <= (i * i + 1) // 2) or (hard <= (i * i + 1) // 2 and soft <= (i * i) // 2):\r\n print(i)\r\n break\r\n \r\n i += 1", "N = int(input())\r\na = 0\r\nfor i in range(N):\r\n\tif (input().split()[1] == 'hard'):\r\n\t\ta += 1\r\n\r\nb = N - a\r\nif (a > b):\r\n\ta, b = b, a\r\n\t\r\nn = 1\r\nwhile not (a <= (n * n) // 2 and b <= (n * n) // 2 + (n % 2)):\r\n\tn += 1\r\n\r\nprint(n)" ]

[ "# LUOGU_RID: 102443681\nn = int(input())\r\nif n < 3:\r\n print(-1)\r\nelse:\r\n print(*range(n, 0, -1))", "def main_function():\r\n a = int(input())\r\n if a > 2:\r\n return \" \".join([str(a - i) for i in range(a)])\r\n return -1\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n", "n=int(input())\r\nif(n<=2):\r\n print('-1')\r\nelse:\r\n ans=[ ]\r\n while(n>0):\r\n ans.append(n)\r\n n-=1\r\n print(*ans)", "m = []\r\nn = int(input())\r\nfor i in range(1, n + 1):\r\n\tm.append(n + 1 - i)\r\na = list(m)\r\na.sort()\r\nfor i in range(n - 1):\r\n\tfor j in range(i, n - 1):\r\n\t\tif m[j] > m[j + 1]:\r\n\t\t\tm[j], m[j + 1] = m[j + 1], m[j]\r\nif m == a:\r\n\tprint(-1)\r\nelse:\r\n\ta.reverse()\r\n\tprint(* a, sep = \" \")", "X = int(input())\r\nif X <= 2:\r\n print(-1)\r\n exit()\r\nprint(*[i for i in range(X, 0, -1)])\r\n", "n = int(input())\r\nif (n < 3):\r\n print(-1)\r\nelse:\r\n for i in range (n, 0, -1):\r\n print(i, end = ' ')", "n = int(input())\r\nif(n <= 2):\r\n print(-1)\r\nelse:\r\n arr = list(range(1, n + 1))\r\n arr.reverse()\r\n arr = [str(i) for i in arr]\r\n print(\" \".join(arr))\r\n", "a=int(input())\nif a==1 or a==2:\n\tprint(-1)\nelse:\n\tprint(3,5,end=' ')\n\tfor i in range(a-2):\n\t\tprint(1,end=' ')\n", "n = int( input( ) )\r\nif n > 2 :\r\n for i in range( 2 , n + 1 ) :\r\n print( i , end = \" \" )\r\n print( 1 )\r\nelse :\r\n print( -1 )", "n = int(input())\na = list(map(str,list(range(n,0,-1))))\n\nif n <= 2:\n print (-1)\nelse:\n print (\" \".join(a))\n \n \n", "n=int(input())\r\nprint(*[[2,2]+[1]*(n-2),[-1]][n<3])", "n = int(input())\r\nif n <= 2:\r\n print(-1)\r\nelse:\r\n ans = [3, 2, 1] + [1] * (n - 3)\r\n print(*ans)", "n = int(input())\r\nli = [i for i in range(1, n + 1)][::-1]\r\nif n < 3:\r\n print(-1)\r\nelse:\r\n print(*li)", "\r\nn = int(input())\r\n\r\nif n <= 2 :\r\n print(-1)\r\n\r\nelse:\r\n for i in range(n , 0, -1):\r\n print(i , end = ' ')\r\n\r\n\r\n\r\n", "\r\n\r\n\r\nn=int(input())\r\n\r\nf=[]\r\nfor j in range(n):\r\n f.append(j+1)\r\n\r\n\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n print(*f[::-1])\r\n", "#!/usr/bin/env python3\n\ndef main():\n n = int(input())\n\n if n < 3:\n print('-1')\n return\n arr = [str(i) for i in range(n, 0, -1)]\n print(' '.join(arr))\n\nmain()\n", "n=int(input())\r\nif n<=2:\r\n\tprint(-1)\r\nelse:\r\n\ta=[]\r\n\tfor i in range(n, 0, -1):\r\n\t\ta.append(i)\r\n\tprint(*a)", "n=int(input())\r\nif n<3: print(-1)\r\nelse: print(' '.join(map(str,range(n,0,-1))))", "a=int(input(\"\"))\r\nif (a==1 or a==2):\r\n print(-1)\r\nelse:\r\n for g in range (a,0,-1):\r\n print(g)\r\n", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelse:\r\n print(*range(n,0,-1))", "n = int(input())\r\nif n == 1 or n == 2:\r\n print (-1)\r\nelse:\r\n arr = [i for i in range(1,n+1)]\r\n arr.reverse()\r\n for i in arr:\r\n print(i,end=' ')", "m = int(input())\r\nif m <= 2:\r\n print(-1)\r\nelse:\r\n print(\"2 \" * (m - 1) + \"1\")", "#code\r\nR=lambda:map(int, input().split())\r\n\r\nn, = R()\r\nprint(-1 if n <= 2 else \" \".join([str(i) for i in range(n, 0, -1)]))", "n=int(input())\r\nif(n==1 or n==2):\r\n\tprint(-1)\r\nelse:\r\n\tl=[i for i in range(1,n+1)]\r\n\tl.sort(reverse=True)\r\n\tprint(*l)", "N = int(input())\r\n\r\nif N < 3:\r\n print(-1)\r\nelse:\r\n for i in range(N, 0, -1):\r\n print(i,end=' ')", "a = int(input())\nd = 4\nif a == 1 or a == 2 :\n\tprint(-1)\nelse:\n\tfor i in range(a -1):\n\t\tprint(d ,end = \" \")\n\t\td += 1\n\tprint(1)\n", "n=int(input())\r\nk=[i for i in range(n,0,-1)]\r\nif n>2:\r\n print(*k)\r\nelse:\r\n print(\"-1\")", "a = int(input())\r\nif a < 3:\r\n print(-1)\r\nelse:\r\n print(a - 1, a, *[x for x in range(1, a - 1)])\r\n", "n=int(input())\r\nif(n>2):\r\n for i in range(2,n+1):\r\n print(i)\r\n print(1)\r\nelse:\r\n print(-1)", "#from dust i have come dust i will be\r\n\r\nn=int(input())\r\n\r\nif n<=2:\r\n print(-1)\r\n exit(0)\r\n\r\nprint(2,n,end=' ')\r\nfor i in range(1,n):\r\n if i!=2:\r\n print(i,end=' ')", "n=int(input())\r\nif n<3:print('-1')\r\nelse:\r\n\tk=[i for i in range(n,0,-1)]\r\n\tprint(*k)", "n = int(input())\r\nif n == 1 or n == 2:\r\n print('-1')\r\nelse:\r\n l = ['2']\r\n l += ['3']*(n-2)\r\n l += ['1']\r\n print(' '.join(l))", "n = int(input())\r\n\r\nif n > 2:\r\n while(n > 0):\r\n print(n, end =\" \")\r\n n-=1\r\n\r\nelse:\r\n print('-1')", "n=int(input())\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n print(\"2 \"*(n-1)+\"1\")", "n=int(input())\r\nif n<3:print(-1)\r\nelse:\r\n\tfor i in range(n,0,-1):print(i)", "n = int(input())\r\nif n<=2:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tprint(n-i,end = \" \")", "n = int(input())\r\nprint(-1) if n < 3 else print(*[x for x in range(n, 0, -1)])", "n=int(input())\nif n==1 or n==2:\n\tprint (-1)\nelse:\n\tans=[1]*n\n\tans[0]=10\n\tans[1]=9\n\tprint (*ans)", "n=eval(input())\r\na=\"\"\r\nif n==1 or n==2 :\r\n print (-1)\r\nelse:\r\n i=0\r\n j=100 \r\n while i<n :\r\n a+= str(j)\r\n a+=\" \"\r\n i+=1\r\n j-=1\r\n print (str(a))\r\n", "n = int(input())\r\nif n==1 or n==2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n print(n-i, end=' ')", "n = int(input())\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n l=[9]*(n-1)\r\n l.append(1)\r\n print(*l, sep= \" \")", "k = int(input())\r\n\r\ndef buggy_sort(arr, n):\r\n\tfor i in range(n - 1):\r\n\t\tfor j in range(i, n - 1):\r\n\t\t\tif arr[j] > arr[j + 1]:\r\n\t\t\t\tarr[j], arr[j + 1] = arr[j + 1], arr[j]\r\n\r\nif k < 3:\r\n\tprint(-1)\r\nelse:\r\n\ttemp = [i for i in range(2, k + 1)]\r\n\ttemp.append(1)\r\n\tfor t in temp:\r\n\t\tprint(t, end=' ')\r\n\r\n\t# buggy_sort(temp, k)\r\n\t# print(temp)", "t=int(input())\r\nif t<3:\r\n print(-1)\r\nelse:\r\n for i in range(t,1,-1):\r\n print(i,end=\" \")\r\n print(1)\r\n \r\n", "n = int(input())\r\nif n >= 3:\r\n print('3 2 1',end = ' ' )\r\n for i in range (n - 3):\r\n print((i + 1), end = ' ')\r\nelse:\r\n print('-1')\r\n", "n = int(input())\r\nb = []\r\nif n in [1,2]:\r\n print(-1)\r\nelse:\r\n for i in range(0,2):\r\n b.append(11)\r\n for i in range(0,n-2):\r\n b.append(1)\r\n print(*b)", "n = int(input())\r\nif n > 2:\r\n print(\" \".join(map(str,list(range(n,0,-1)))))\r\nelse:\r\n print(-1)\r\n", "n = int(input())\nif n <= 2:\n print(-1)\nelse:\n for i in range(n, 1, -1):\n print(i, end = ' ')\n print(1)\n\n\n", "from sys import stdin\nn=int(stdin.readline())\n\nif n==1 or n==2:\n print(\"-1\")\nelse:\n print(\"2 3 1\",end=\" \")\n for i in range(4,n+1):\n print(i,end=\" \")\n print()", "n=int(input())\r\nif n<3:print(-1)\r\nif n>2:print(*[i for i in range(2,n+1)],1)", "n = int(input())\r\nif n == 1 or n == 2:\r\n\tprint(-1)\r\nelse:\r\n\tprint(\"8\",\"18\",\"7\",end=\" \")\r\n\tfor i in range(n-3):\r\n\t\tprint(1,end=\" \")\r\n", "import sys\r\nimport math \r\nfrom collections import defaultdict \r\n\r\ndef read_line():\r\n\treturn sys.stdin.readline()[:-1]\r\n \r\ndef read_int():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef read_int_line():\r\n\treturn [int(v) for v in sys.stdin.readline().split()]\r\n\r\ndef fun(a,v):\r\n\tfor i,k in enumerate(a[::-1]):\r\n\t\tif v>=k:\r\n\t\t\treturn (k,8-i)\r\n\treturn -1\r\n\r\nn = read_int()\r\n\r\nif n<=2:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(1,n+1):\r\n\t\tprint(n+1-i,end = \" \")\r\n\tprint()", "n=int(input());k=[i for i in range(n,0,-1)]\r\nprint(*k) if n>2 else print(-1)", "n = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelse:\r\n a = [x for x in range(n, 0, -1)]\r\n print(*a)", "\nif __name__ == '__main__':\n\n n = int(input())\n\n if n > 2:\n arr = [it for it in range(n, 0, -1)]\n r = \"\"\n\n i = 0\n for it in arr:\n r += str(it)\n\n if i != len(arr)-1:\n r += \" \"\n i += 1\n\n print(r)\n else:\n print(-1)\n\n \t\t\t\t \t \t\t\t\t \t\t \t\t \t \t\t", "sz = int(input())\r\nif sz < 3:\r\n print (-1)\r\nelse:\r\n print(*reversed([x+1 for x in range(sz)]))", "n = int(input())\r\nif n <= 2:\r\n print(-1)\r\nelse:\r\n ans = []\r\n while n > 0:\r\n ans.append(n)\r\n n -= 1\r\n print(*ans)", "# a=[5,4,3,2,1]\r\n# for i in range(3):\r\n# \tfor j in range(3):\r\n# \t\tif a[i]>a[i+1]:\r\n# \t\t\ta[i],a[i+1]=a[i+1],a[i]\r\n# print(a)\r\nn=int(input())\r\nif n==1 or n==2:print(-1)\r\nelse:print(*[ x for x in range(n,0,-1)])", "n=int(input())\r\nif n==1 or n==2:\r\n print(\"-1\")\r\nelse:\r\n for i in range(n,0,-1):\r\n print(i,end=\" \")", "n=int(input())\r\n\r\nif n<3:\r\n print(-1)\r\nelse:\r\n print(\"3 2 1\",end=\"\")\r\n\r\nprint(\" 1\"*(n-3),end=\"\")", "n = int(input())\r\nif n < 3 :\r\n print(-1)\r\n exit()\r\nfor i in range(n, 0, -1):\r\n print(i, end = ' ')\r\n", "n = int(input())\nif n < 3:\n\tprint(-1)\nelse:\n\tprint(' '.join(list(map(str, range(n, 0, -1)))))\n", "n = int(input())\r\n\r\nif(n == 1 or n== 2):\r\n print(-1)\r\nelse:\r\n i = n\r\n while(i >= 1):\r\n print(i,end=\" \")\r\n i -=1\r\n\r\n", "n=int(input())\r\nif n>2:print(*list(range(n,0,-1)))\r\nelse:print(-1)\r\n", "def main():\n n = int(input())\n\n if n < 3:\n print(-1)\n else:\n print(' '.join([str(x) for x in range(n, 0, -1)]))\n\n\nif __name__ == '__main__':\n main()\n", "\r\nt=int(input())\r\nif t>2:\r\n\tfor i in range(t):\r\n\t\tprint(t-i,end=\" \")\r\nelse:\r\n\tprint(-1)", "n = int(input())\nif n < 3:\n print(-1)\nelse:\n while n > 0:\n print(n, end=\" \")\n n -= 1", "def s(a):\r\n k = len(a)\r\n for i in range(k-1):\r\n for j in range(i,k-1):\r\n if a[j] > a[j+1]:\r\n a[j],a[j+1] = a[j+1],a[j]\r\n return a\r\ndef main():\r\n n = int(input())\r\n if n <= 2:\r\n v = [-1]\r\n else:\r\n v = [int(i) for i in range(n,0,-1)]\r\n print(*v,sep = ' ')\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(100000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\nif n<=2:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(n,0,-1):\r\n\t\tprint(i,end=\" \")\r\n\r\n\t\r\n", "n=int(input())\nif n==1 or n==2:\n\tprint(-1)\nelse:\n\tfor i in range(n):\n\t\tprint(n-i, end=\" \")\n", "n = int(input())\r\nif n > 2: print(' '.join(str(i) for i in range(n, 0, -1)))\r\nelse: print(-1)", "n = int(input())\nres = [-1] if n < 3 else ([2, 2] + [1] * (n - 2))\nprint(*res)\n", "n = int(input())\r\nprint(*([-1],[3,2]+[1]*(n-2))[n>2])\r\n", "n = int(input())\r\n\r\nif n <= 2:\r\n print(-1)\r\nelse:\r\n x = [4, 3, 2]\r\n y = [1] * (n - 3)\r\n print(*(x + y))\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/246/A\r\n\r\nn = int(input())\r\n\r\nif n <= 2:\r\n print(-1)\r\nelse:\r\n print(\"2 \" * (n - 1) + \"1\")", "n = input()\r\nn = int(n)\r\nif n <= 2:\r\n print(-1)\r\nelif n <= 50:\r\n result = [i for i in range(n, 0, -1)]\r\n for el in result:\r\n print(el, end=' ')\r\nelse:\r\n print(-1)", "# a = [4,3,2,3,5,2,4,7,2]\n\n# for i in range(len(a)-1):\n# for j in range(i,len(a)-1):\n# if a[j] > a[j+1]:\n# a[j],a[j+1] = a[j+1],a[j]\n# print(a)\nn = int(input())\na = [4,3,2]\nif n in [1,2]:\n print(-1)\nelse:\n print(4,3,2,end=' ')\n for i in range(4,n+1):\n if i == n:\n print(i)\n else:\n print(i,end=' ')", "n = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelse:\r\n A = [(i + 1) % n + 1 for i in range(n)]\r\n for i in range(n):\r\n if i == n - 1:\r\n print(A[i])\r\n print()\r\n else:\r\n print(A[i], end = ' ')", "n = int(input())\r\nif n<3:\r\n print(-1)\r\nelse:\r\n print(*list(range(n,0,-1)))", "def counterExample(n):\r\n res = [i for i in range(1, n + 1)]\r\n return \" \".join(str(i) for i in reversed(res)) if n > 2 else -1\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(counterExample(n))", "n = int(input())\nif n < 3:\n print(-1)\nelse:\n print(2, 2, *([1] * (n-2)))\n", "import sys\n#my_file = sys.stdin\n#my_file = open(\"input.txt\", \"r\")\nn = int(input())\nif n > 2:\n lst = list(range(n-1,0,-1))\n lst.insert(0, n-1)\n for i in lst:\n print(i, end=\" \")\nelse:\n print(-1)", "n = int(input())\nif n > 2:\n print(*tuple(range(n+1)[:0:-1]))\nelse:\n print(-1)\n", "a=int(input())\r\nif a<=2:print(-1)\r\nelse:print(' '.join(list(map(str,range(1,a+1)))[::-1]))\r\n", "#July 4, 2014\r\nsa=int(input())\r\nstring=''\r\nif sa==1 or sa==2:\r\n print(\"-1\")\r\nelse:\r\n for x in range(sa, 0, -1):\r\n string+=str(x)\r\n string+=' '\r\n print(string.strip())\r\n", "n = int(input())\r\nprint(-1) if n <=2 else print(*[i for i in range(n, 0, -1)])", "n = int(input())\r\nif n <= 2:\r\n print(-1)\r\nelse:\r\n x = ''\r\n for i in range(n,0,-1):\r\n x += str(i) + ' '\r\n print(x[:-1])\r\n", "n = int(input()); print(*((-1,), range(n, 0, -1))[n > 2])", "if __name__ == '__main__':\r\n n = int(input())\r\n if n < 3:\r\n print(-1)\r\n else:\r\n print(' '.join(map(str, [3, 2, 1] + [i + 4 for i in range(n - 3)])))\r\n", "\r\ndef main():\r\n n = int(input())\r\n if n <= 2:\r\n v = [-1]\r\n else:\r\n v = [int(i) for i in range(n,0,-1)]\r\n print(*v,sep = ' ')\r\nif __name__ == '__main__':\r\n main()\r\n", "__autor__ = 'Esfandiar'\nn = int(input())\nif n < 3:print(-1);exit()\nprint(5,4,end=\" \")\nfor i in range(n-2):print(1,end=\" \")\n\n\n", "n = int(input())\nif n <= 2:\n\tprint(-1)\nelse:\n\tprint(' '.join(str(2 - x // (n - 1)) for x in range(n)))\n", "n=int(input())\r\nif(n<=2):\r\n\tprint(-1)\r\nelse:\r\n\tfor x in range(n,0,-1):\r\n\t\tprint(x,end=\" \")", "n = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelse:\r\n for i in range(2,n+1):\r\n print(i)\r\n print(1)", "n = int(input())\nres = \"\"\nif n<3:\n print(-1)\nelse:\n for u in range(-n,0):\n res = res + \"{} \".format(-u)\n print(res[:-1])\n\t\t \t\t\t\t \t \t\t \t \t\t\t \t \t", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelse:\r\n print(*[n - i for i in range(n)])\r\n", "a=int(input())\r\nif a<3:\r\n print(-1)\r\nelse:\r\n print(*range(a,0,-1))", "n = int(input())\n\nif n == 1 or n == 2:\n print(-1)\nelse:\n r = '2 2' + (n-2)*' 1'\n\n print(r)\n\t\t\t \t \t\t \t \t \t \t\t \t \t\t", "n = int(input())\n\nif (n <= 2):\n print(-1)\nelse:\n for i in range(n - 1, -1, -1):\n print(i + 1, end = ' ')", "n = int(input())\r\nprint(-1 if n < 3 else \" \".join(map(str, [x for x in range(n, 0, -1)])))", "n=int(input())\n\nif(n<=2):\n print(-1)\n\nelse:\n for i in range(n,1,-1):\n print(i,end=\" \")\n print(1)\n \n", "for u in range(1):\r\n n = int(input())\r\n if(n == 1 or n == 2):\r\n print(-1)\r\n \r\n else:\r\n x = [i for i in range(n, 0, -1)]\r\n #x = [int(i) for i in range(1, n+1, 2)]\r\n #x += [int(i) for i in range(2, n+1, 2)]\r\n \r\n print(*x)", "# It's all about what U BELIEVE\nimport sys\ninput = sys.stdin.readline\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\nMOD = \"1000000007\"\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n############################ SOLUTION IS COMING ###############################\nn = gint()\nif n <= 2:\n print(-1)\nelse:\n for i in range(n):\n print(n - i, end=\" \")\n", "n=int(input())\r\nif(n<3):\r\n print(-1)\r\nelse:\r\n a=list()\r\n for i in range(n-2):\r\n a.append(i+1)\r\n a.insert(0,n-1)\r\n a.insert(0,n)\r\n for i in a:\r\n print(i,end=' ')", "n = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelse:\r\n lst = list(range(1,n+1))\r\n a,b = lst.pop(),lst.pop()\r\n lst = [a,b] + lst\r\n print(*lst)" ]

[ "inp = input()\r\n\r\nif inp[0]==inp[0].lower() and inp[1:]==inp[1:].upper():\r\n print(inp.title())\r\n\r\nelif inp==inp.upper():\r\n print(inp.lower())\r\n\r\nelse:\r\n print(inp)", "a=str(input())\r\nif a==a.upper() or (a[:1]==a[:1].lower() and a[1:]==a[1:].upper()):\r\n s=\"\"\r\n for i in range(len(a)):\r\n if a[i]==a[i].lower():\r\n s+=a[i].upper()\r\n else:\r\n s+=a[i].lower()\r\n print(s)\r\nelse:\r\n print(a)", "s = input()\r\n\r\nif len(s) == 1:\r\n print(s.lower() if s.isupper() else s.upper())\r\n \r\nelif s[0].isupper() and s[1:].islower():\r\n print(s)\r\nelif s[0].islower() and s[1:].isupper():\r\n print(s.capitalize())\r\nelif s.isupper():\r\n print(s.lower())\r\nelse:\r\n print(s)", "s = input()\nc = True\nfor i in range (1, len(s)):\n if s[i].islower():\n c = False\nif c:\n for j in range(len(s)):\n if s[j].islower():\n u = s[j].upper()\n else:\n u = s[j].lower()\n print(u, end=\"\")\nelse:\n print(s)\n \t \t \t\t\t\t\t\t\t\t\t \t \t\t \t\t\t\t\t\t\t", "s = str(input())\r\nuppercase_test = 0\r\nx = 0\r\n\r\nfor i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n uppercase_test += 1\r\nfor i in range(1,len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n x +=1\r\n\r\nif (ord(s[0])>=97 and ord(s[0])<=122) and x== len(s)-1 :\r\n print(str(s[0]).upper()+str(s[1:]).lower())\r\nelif uppercase_test == len(s):\r\n print(str(s.lower()))\r\nelse:\r\n print(s)\r\n \r\n", "a = input()\ndef caps(a):\n f = True\n for i in range(1, len(a)):\n if a[i].islower() == 1:\n f = False\n if f == 1:\n a = a.swapcase()\n return a\n else:\n return a\nprint(caps(a))\n\n", "s = input()\r\nif len(s) == 1:\r\n s = s.swapcase()\r\nelse:\r\n if s[0].islower() and s[1:].isupper():\r\n s = s.swapcase()\r\n if s.isupper():\r\n s = s.lower()\r\nprint(s)\r\n", "s = input()\r\nS = []\r\nfor i in range(len(s)):\r\n S.append(s[i])\r\nx = 0\r\nif s[0] == s[0].upper():\r\n for i in range(1,len(s)):\r\n if s[i] == s[i].upper():\r\n pass\r\n else:\r\n x = 1\r\nelse:\r\n for i in range(1,len(s)):\r\n if s[i] == s[i].upper():\r\n pass\r\n else:\r\n x = 1\r\nif x == 1:\r\n print(s)\r\nelse:\r\n for i in range(len(s)):\r\n if S[i] == S[i].upper():\r\n S[i] = S[i].lower()\r\n else:\r\n S[i] = S[i].upper()\r\n s1 = ''\r\n for letter1 in S:\r\n s1 += letter1\r\n print(s1)\r\n", "ch = input()\r\ndef f(ch):\r\n if ch.isupper():\r\n return ch.lower()\r\n if (ch[0].islower() and ch[1:].isupper()) or (len(ch)==1 and ch.islower()):\r\n return ch[0].upper()+ch[1:].lower()\r\n else:return ch\r\n \r\nprint(f(ch))", "s=str(input())\r\ndef qns(word):\r\n if word.isupper() or word[1:].isupper() or len(word)==1:\r\n return word.swapcase()\r\n else:\r\n return word\r\nprint(qns(s))", "def check(s, n):\r\n for i in range(n, len(s)):\r\n if (s[i].islower()):\r\n return 0\r\n return 1\r\n\r\ns = input()\r\nif check(s, 0):\r\n res = s.lower()\r\nelif check(s, 1):\r\n res = s[0].upper() + s[1:].lower()\r\nelse:\r\n res = s\r\nprint(res)", "# h\n\nMy_word = input()\n\nif My_word.isupper() or (My_word[0].islower() and My_word[1:].isupper()) or (len(My_word)==1 and My_word.islower()):\n My_word = My_word.swapcase()\n\nprint(My_word)\n \t \t\t \t \t\t \t\t\t \t\t \t\t \t \t\t \t", "s=input()\r\nif s.isupper()==True:\r\n print(s.lower())\r\nelif (s[0].isupper()==False) and (s[1:].isupper()==True) or ((len(s)==1) and (s.isupper()==False)) :\r\n print(s[0].upper()+s[1:].lower())\r\nelse:\r\n print(s)\r\n", "word = input()\r\ncorrect_word = word\r\n\r\nif word == word.upper():\r\n correct_word = word.lower()\r\n\r\nif word == word[0].lower() + word[1:].upper():\r\n correct_word = word[0].upper() + word[1:].lower()\r\n\r\nprint(correct_word)", "s = input()\r\nup = s.upper()\r\nif up == s:\r\n print(s.lower())\r\nelif s[1:len(s)] == up[1:len(s)]:\r\n print(s.capitalize())\r\nelse:\r\n print(s)\r\n", "s = input()\r\nl = 0\r\n\r\nfor i in range(1, len(s)):\r\n if 65 <= ord(s[i]) <= 90:\r\n l += 1\r\n\r\nif l == len(s) - 1:\r\n for i in range(len(s)):\r\n if 65 <= ord(s[i]) <= 90:\r\n s = s[:i] + chr(97 + ord(s[i]) - 65) + s[i + 1:]\r\n elif 97 <= ord(s[i]) <= 122:\r\n s = s[:i] + chr(65 + ord(s[i]) - 97) + s[i + 1:]\r\n\r\nprint(s)\r\n", "x=input()\r\ns=x[1:]\r\na=s.upper()\r\nif(s==a):\r\n print(x.swapcase())\r\nelse:\r\n print(x)", "x = input()\r\ny = x.upper()\r\nif x == y:\r\n print(x.lower())\r\nelif x[1:] == y[1:]:\r\n print(x[0].upper() + x[1:].lower())\r\nelse:\r\n print(x)\r\n", "#CF_Problem:\t131A_Caps_Lock\r\n\r\ndef capsLock(s):\r\n\tif len(s) == 1 or s[1:].isupper():\r\n\t\treturn s.swapcase()\r\n\treturn s\r\n\r\n\r\ns = input()\r\nprint(capsLock(s))", "string=input()\nchar=list(string)\nuppercase=1\nfor i in range (1,len(string)):\n if str(char[i]).islower()==True:\n uppercase=0\nif uppercase==0:\n print(string)\nelse:\n print(string.swapcase())", "s = input()\r\nucount = 0\r\nlcount = 0\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n ucount += 1 \r\n else:\r\n lcount += 1\r\nif((ucount == len(s)-1) and (s[0].islower())):\r\n for i in range(len(s)):\r\n if i == 0:\r\n print(s[i].upper(),end=\"\")\r\n else:\r\n print(s[i].lower(),end=\"\")\r\nelif (ucount == len(s)):\r\n for i in range(len(s)):\r\n print(s[i].lower(),end=\"\")\r\nelse:\r\n print(s)\r\n ", "def caps_lock(string):\r\n new_string = []\r\n for c in string:\r\n if c.isupper():\r\n new_string.append(c.lower())\r\n else:\r\n new_string.append(c.upper())\r\n return \"\".join(new_string)\r\n\r\nstring = input()\r\nif all([x.isupper() for x in string]) or (all([x.isupper() for x in string[1::]]) and string[0].islower()):\r\n print(caps_lock(string))\r\nelse:\r\n print(string)", "p = str(input())\r\nupp = 0\r\nlow = 0\r\nfor i in p:\r\n if i.isupper():\r\n upp += 1\r\n else: \r\n low += 1\r\n\r\nif (p[0].islower() and upp == len(p)-1):\r\n for i in range(len(p)):\r\n if i == 0:\r\n print(p[i].upper(), end=\"\")\r\n else:\r\n print(p[i].lower(), end=\"\")\r\nelif upp == len(p):\r\n for i in range(len(p)):\r\n print(p[i].lower(),end=\"\")\r\nelse:\r\n print(p)", "\r\n\r\ndef main():\r\n\tin_string = input()\r\n\t\r\n\tfollows_rules = True\r\n\t\t\r\n\tfor character in in_string[1:]:\r\n\t\t\r\n\t\tif character != character.upper():\r\n\t\t\tfollows_rules = False\r\n\t\t\tbreak\r\n\t\t\r\n\tif follows_rules:\r\n\t\tfor character in in_string:\r\n\t\t\tif character != character.upper():\r\n\t\t\t\tprint(character.upper(), end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(character.lower(), end=\"\")\r\n\telse:\r\n\t\tprint(in_string)\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "s = input()\ns2 = s[1:]\nif s.isupper():\n print(s.lower())\nelif s2.isupper() or len(s) == 1:\n print(s[0].upper() + s2.lower())\nelse:\n print(s)", "word = input()\r\nresult = ''\r\nif len(word) == 1 and word.islower():\r\n result = word.upper()\r\nelif word.isupper() or (word[0].islower() and word[1:].isupper()):\r\n result = word.swapcase()\r\nelse:\r\n result = word\r\n\r\nprint(result)", "s=input()\r\nif s[1:].upper()==s[1:]:\r\n s=s.swapcase()\r\nprint(s)", "string = input()\r\n\r\ndef invert(s):\r\n if s.isupper():\r\n return s.lower()\r\n return s.upper()\r\n\r\nif len(string) == 1 or string[1:].isupper():\r\n print(invert(string[0]) + string[1:].lower())\r\nelse:\r\n print(string)", "s = str(input())\nx = s.upper()\nz = s[0].lower() + s[1:].upper()\nr = \"\"\nif len(s) == 1:\n r = s[0].lower()\nif s == x or s == z or s == r:\n a = list()\n for k in range(len(s)):\n if s[k].isupper():\n a.append(s[k].lower())\n else:\n a.append(s[k].upper())\n print(\"\".join(a))\nelse:\n print(s)", "str=input()\r\n#全都是大写\r\nif str==str.upper():\r\n print(str.lower())\r\n#第一个是小写\r\nelif str[0]==str[0].lower() and str[1:]==str[1:].upper():\r\n print(str[0].upper()+str[1:].lower())\r\nelse:\r\n print(str)", "x=input()\r\nf=False\r\nfor i in range(1,len(x)):\r\n if x[i].islower():\r\n f=True\r\nif f==True:\r\n print(x)\r\nelse:\r\n s=\"\"\r\n for i in x:\r\n if i.islower():\r\n s=s+i.upper()\r\n else:\r\n s=s+i.lower()\r\n print(s)\r\n", "st = input()\r\nn = len(st)\r\nflag = True\r\nfor i in range(1,n):\r\n if st[i].islower():\r\n flag = False\r\nif flag:\r\n for i in range(n):\r\n if st[i].islower():\r\n c = st[i].upper()\r\n else:\r\n c = st[i].lower()\r\n print(c, end='')\r\nelse:\r\n print(st)", "s = input()\r\nsnew = s.lower()\r\n\r\nk = snew[0].upper()\r\nif s[1:] == s[1:].upper() and s != s.upper():\r\n print(k + snew[1:]) #lol\r\nelif s == s.upper():\r\n print(snew)\r\nelse:\r\n print(s)", "a=str(input())\r\ns=0\r\noutput=str()\r\nfor i in range(1, len(a)):\r\n if a[i].isupper():\r\n continue\r\n else:\r\n print(a)\r\n break\r\nelse:\r\n for i in range(len(a)):\r\n if a[i].isupper():\r\n output+=a[i].lower()\r\n else:\r\n output+=a[i].upper()\r\n print(output)", "word = input()\r\nif(word == word.upper()):\r\n word = word.lower()\r\nelif(word[0] == word[0].lower() and word[1:] == word[1:].upper()):\r\n word = word.capitalize()\r\nprint(word)", "t = input()\r\nlst = list(t)\r\nif len(t) == 1:\r\n if t.isupper():\r\n print(t.lower())\r\n else:\r\n print(t.upper())\r\n \r\nelif len(t) > 1 and t.isupper():\r\n print(t.lower())\r\n\r\nelif lst[0].islower() and ''.join(lst[1:]).isupper():\r\n lst[1:] = [char.lower() for char in lst[1:]]\r\n lst[0] = lst[0].upper()\r\n a = ''.join(lst)\r\n print(a)\r\n \r\nelse:\r\n print(t)", "s = input()\r\nif s[0].islower() and all(i.isupper() for i in s[1:]):\r\n print(s[0].upper() + s[1:].lower())\r\nelif all(i.isupper() for i in s):\r\n print(s.lower())\r\nelse:\r\n print(s)", "a = input()\r\nb = a.upper()\r\nif a == b:\r\n print(a.lower())\r\nelif a[1:]==b[1:]:\r\n print(a[0].upper()+a[1:].lower())\r\nelse:\r\n print(a)", "word=input()\r\nif word==word.upper() or word==word[0].lower()+word[1:].upper():\r\n print (word.swapcase())\r\n \r\nelse:\r\n print (word)", "word=input()\n\nif word.isupper()==True:\n print(word.lower())\nelse:\n cnt=0\n for i in range(0,len(word),1):\n if word[i].isupper()==True:\n cnt+=1\n\n if cnt ==len(word)-1 and word[0].islower()==True:\n ans=\"\"\n ans+=word[0].upper()\n ans+=word[1:].lower()\n print(ans)\n else:\n print(word)\n\t \t \t \t \t \t \t \t \t \t\t\t", "s = input()\r\nanswer = s\r\nif len(s) == 1 or s[1:].isupper():\r\n answer = ''\r\n for c in s:\r\n answer += (c.upper() if c.islower() else c.lower())\r\nprint(answer)\r\n", "s = input()\nif (s[0].islower() and s[1:].isupper() or s.isupper() or len(s) == 1 and s.islower()):\n s = s.swapcase()\nprint(s)\n \t\t \t\t\t \t \t \t \t\t \t\t \t", "n=input();print([n,n.swapcase()][n[1:].upper()==n[1:]])", "s=input();print([s,s.swapcase()][s[1:]==s[1:].upper()])", "def main():\n x = input()\n upp = 0\n low = 0\n for i in x:\n if i.isupper():\n upp += 1\n else:\n low += 1\n\n if(x[0].islower() and upp == len(x)-1):\n for i in range(len(x)):\n if i==0:\n print(x[i].upper(),end='')\n else:\n print(x[i].lower(),end='')\n\n elif upp == len(x):\n for i in range(len(x)):\n print(x[i].lower(),end='')\n\n else:\n print(x)\n \n\nif __name__ == '__main__':\n main()\n", "a=input()\nb=[x for x in a]\nflag=0\n\nfor i in range(0, len(a)):\n if b[i].isupper():\n flag += 1\nif (flag==len(a)-1 and b[0].islower()==True) or flag==len(a):\n print(a.swapcase())\nelse:\n print(a)\n", "a=input()\r\nif a==a.upper():\r\n print(a.lower())\r\nelif a==a[0].lower()+a[1:].upper():\r\n print(a[0].upper()+a[1:].lower())\r\nelse:\r\n print(a)\r\n", "old_word = input()\r\nif old_word[1:] == old_word[1:].upper():\r\n new_word = \"\"\r\n for ch in old_word:\r\n if ch == ch.upper():\r\n new_word += ch.lower()\r\n else:\r\n new_word += ch.upper()\r\nelse:\r\n new_word = old_word\r\nprint(new_word)", "s = input()\r\nif s[1:] == s[1:].upper():\r\n new_s = ''\r\n for l in s:\r\n if l.upper() == l:\r\n new_s += l.lower()\r\n else:\r\n new_s += l.upper()\r\n print(new_s)\r\nelse:\r\n print(s)", "n=input()\r\nif len(n)==1:\r\n print(n.swapcase())\r\nelse:\r\n if n.isupper():\r\n print(n.lower())\r\n else:\r\n if n[1:].isupper():\r\n print(n.capitalize())\r\n else:\r\n print(n)", "a = input()\r\nif a.isupper():\r\n a = a.lower()\r\nelif a[0].islower() and a[1:].isupper():\r\n a = a[0].upper() + a[1:].lower()\r\nelif a.islower() and len(a)==1:\r\n a = a.upper()\r\nelse:\r\n a = a\r\nprint(a)", "s = input(); e = \"\"; l = len(s)\r\nif l == 1:\r\n print(s.upper() if s.islower() else s.lower())\r\nelif (s[0].islower() and s[1:].isupper()) or s.isupper():\r\n for i in range(l):\r\n e += s[i].lower() if s[i].isupper() else s[i].upper()\r\n print(e)\r\nelse:\r\n print(s)", "s=input()\r\nk=s.upper()\r\nif s==k:\r\n k=s.lower()\r\n print(k)\r\nelif len(s)==1:\r\n if s==s.lower():\r\n print(s.upper())\r\nelif s[0]==s[0].lower() and s[1:]==s[1:].upper():\r\n print(s[0].upper()+s[1:].lower())\r\nelse:\r\n print(s)", "n = str(input())\r\nif len(n) == 1 and n.islower() :print(n.capitalize())\r\nelif n.isupper() :print(n.lower()) \r\nelif n[1:].isupper() :print(n[0].capitalize()+n[1:].lower()) \r\nelse :print(n)\r\n", "x=input()\r\nif(len(x)==1 or x.isupper()==True or x[0:1].islower()==True and x[1:len(x)].isupper()==True):\r\n print(x.swapcase())\r\nelse:\r\n print(x)", "s = input()\r\n\r\ncheck =0\r\nnew_s=\"\"\r\nif (s[0]>='a' and s[0]<='z') or (s[0] >=\"A\" and s[0] <=\"Z\"):\r\n for i in range(1,len(s)):\r\n if s[i] >='a' and s[i]<='z':\r\n check = 1\r\n break\r\n \r\n else:\r\n continue\r\n \r\n\r\nif check == 0:\r\n for i in range(len(s)):\r\n if s[i] >='a' and s[i] <= 'z':\r\n new_s+=chr(ord(s[i])-32)\r\n else:\r\n new_s+=chr(ord(s[i])+32)\r\n\r\n print(new_s)\r\n\r\nelse:\r\n print(s)", "n=input()\nif len(n) == 1 or n.isupper() == True or n[0:1].islower() and n[1:len(n)].isupper():\n print(n.swapcase())\nelse: print(n)", "t=input()\r\nif (len(t)==1):\r\n t=t.swapcase()\r\nelif (t.isupper() or t[0].islower() and t[1:].isupper()):\r\n t=t.swapcase()\r\nprint(t)", "a = input()\r\nstring = f\"{a[0].upper()}{a[1:].lower()}\"\r\n\r\nislower = 0\r\nfor i in a:\r\n if i.islower(): islower += 1\r\n\r\nif islower == 0:\r\n print(a.lower())\r\nelif (islower == 1 and a[0].islower()):\r\n print(string)\r\nelse:\r\n print(a)", "st=input()\r\ncnt=0\r\nfor i in st:\r\n if ord(i)<97:\r\n cnt+=1\r\nif cnt==len(st) or ((cnt==len(st)-1) and ord(st[0])>=97):\r\n new_st=\"\"\r\n for i in st:\r\n if ord(i)<97:\r\n new_st+=i.lower()\r\n else:\r\n new_st+=i.upper()\r\n print(new_st)\r\nelse:\r\n print(st)", "#PROBLEM:A. cAPS lOCK\r\nm=input()\r\nif m== m.upper():\r\n m=m.lower()\r\nelif m[1:]==m[1:].upper():\r\n m=m.title()\r\nprint(m)", "word = input()\r\nif len(word) == 1 and word.lower() == word:\r\n word = word.upper()\r\nelif word.upper() == word:\r\n word = word.lower()\r\nelif word[0].lower()+word[1:].upper() == word:\r\n word = word[0].upper() + word[1:].lower()\r\nprint(word)\r\n", "n = input()\r\nif len(n) == 1 and n.isupper() == False: print(n.swapcase())\r\nelif n.isupper() == True: print(n.swapcase())\r\nelif n[0].isupper() == False and n[1:].isupper() == True: print(n.swapcase())\r\nelse: print(n)", "s = input()\naccident = True\nfor i in range(1, len(s)) :\n if s[i].islower() :\n accident = False\nans = \"\"\nif accident :\n for c in s :\n if c.islower() :\n ans += c.upper()\n else :\n ans += c.lower()\nelse :\n ans = s\nprint(ans)\n ", "word = input()\r\n\r\nif word.isupper() or (word[0].islower() and word[1:].isupper()) or (len(word)==1 and word.islower()):\r\n print(word.swapcase())\r\nelse:\r\n print(word)\r\n", "word = input()\r\nif len(word) ==1 and word[0].islower() :\r\n print(word.upper())\r\nelif len(word) ==1 and word[0].isupper() :\r\n print(word.lower()) \r\nelif word.isupper() or word[0].islower() and word[1:].isupper() :\r\n print(word.swapcase())\r\nelse :\r\n print(word) \r\n ", "a=input()\r\n \r\nif a[1:].upper()==a[1:]:\r\n a=a.swapcase()\r\n \r\nprint(a)", "a=input()\r\nk=0\r\nfor i in range(1,len(a)):\r\n if a[i].upper()==a[i]:\r\n k=k+1\r\nif k==(len(a)-1):\r\n a=a.swapcase()\r\nprint(a) \r\n ", "s = input()\r\nneed = True\r\nfor i in range(1, len(s)):\r\n if s[i].islower():\r\n need = False\r\nif need:\r\n for i in s:\r\n if i.islower():\r\n print(i.upper(), end=\"\")\r\n else:\r\n print(i.lower(), end=\"\")\r\nelse:\r\n print(s)# 1698238164.4157984", "a = list(input())\r\n \r\n \r\ndef byk1(a):\r\n \r\n for i in a[1:]:\r\n if i.istitle() == False:\r\n r = ''.join(a)\r\n return r\r\n \r\n g = []\r\n for i in a:\r\n if i.istitle() == False:\r\n b = i.upper()\r\n g.append(b)\r\n elif i.istitle() == True:\r\n b = i.lower()\r\n g.append(b)\r\n r = ''.join(g)\r\n \r\n return r\r\n \r\n \r\nprint(byk1(a))\r\n", "string = input()\ncheck = True\nfor i in range(1, len(string)):\n if string[i].islower():\n check = False\n break\n\nif check:\n for s in string:\n if s.islower():\n print(s.upper(), end=\"\")\n else:\n print(s.lower(), end=\"\")\n print(\"\")\nelse:\n print(string)", "s=input()\r\ns2=s[1:len(s)]\r\nif s2.isupper():\r\n print(s.swapcase())\r\nelif len(s)==1 :\r\n print(s.swapcase())\r\nelse:\r\n print(s)\r\n", "w = input()\r\nif w.isupper() or w.swapcase().istitle():\r\n print(w.swapcase())\r\nelse:\r\n print(w)", "def solve(s):\r\n if s == s.upper() or s[1:] == s[1:].upper() and ord(s[0]) in range(ord('a'), ord('z') + 1):\r\n s = s.swapcase()\r\n print(s)\r\n\r\n\r\n# TESTS = ['hELLO', 'HTTP', 'z', 'cAPS', 'Lock']\r\n# [solve(i) for i in TESTS]\r\nsolve(input())", "a = str(input())\r\nif a[0] == a[0].lower() and a[1:] == a[1:].upper():\r\n print(f\"{a[0].upper()}{a[1:].lower()}\")\r\nelif a == a.upper():\r\n print(a.lower())\r\nelse:\r\n print(a)", "n=input()\r\nk1=n.upper()\r\nk2=n[0]\r\nk3=n[1:]\r\nif len(n) == 1 and n.islower():\r\n print(n.upper())\r\nelif k1 == n:\r\n print(n.lower())\r\nelif k2.islower() and k3.isupper():\r\n print(k2.upper()+k3.lower())\r\nelse:\r\n print(n)\r\n", "word = input()\r\nif word.isupper():\r\n word = word.lower()\r\nelif word[1:].isupper() and word[0].islower():\r\n word = word[0].upper()+word[1:].lower()\r\nelif word.islower() and len(word)==1:\r\n word = word.upper()\r\nprint(word)", "n=str(input())\nb = n.swapcase()\nc=n[1:]\nprint([n, b][c.upper()==c])", "s = input()\r\nif s.upper() == s:\r\n print(s.lower())\r\nelif s[0].lower() + s[1:].upper() == s:\r\n print(s.swapcase())\r\nelse:\r\n print(s)\r\n#veerascode ", "alphabets = [chr(i) for i in range(ord('a'), ord('z')+1)]\r\nnew_word = str(input())\r\nword = \"\"\r\nln = len(new_word)\r\nif 90 < ord(new_word[0]) <= 122:\r\n count = 0\r\n p = 1\r\n while p < ln:\r\n i = 0\r\n while i < 26:\r\n if new_word[p] == alphabets[i]:\r\n count += 1\r\n i += 1\r\n p += 1\r\n if count > 0:\r\n word = new_word\r\n if count == 0:\r\n word += new_word[0].capitalize()\r\n word += new_word[1:ln].lower()\r\nif 65 <= ord(new_word[0]) <= 90:\r\n count = 0\r\n p = 1\r\n while p < ln:\r\n i = 0\r\n while i < 26:\r\n if new_word[p] == alphabets[i]:\r\n count += 1\r\n i += 1\r\n p += 1\r\n if count == 0:\r\n word = new_word.lower()\r\n if count > 0:\r\n word = new_word\r\nprint(word)\r\n", "n = input()\r\n\r\nif len(n) == 1:\r\n if n.islower():\r\n n = n.upper()\r\n else:\r\n n = n.lower()\r\n\r\nelif (n[0].islower() and n[1:].isupper()):\r\n n = n.capitalize()\r\n\r\nelif n.isupper():\r\n n = n.lower()\r\n\r\nprint(n)\r\n", "x = input()\nif x.isupper() or (x[0].islower()) and (x [1:].isupper()) or (len(x) == 1) and (x.islower):\n x = x.swapcase()\n\nprint(x)\n\t \t\t \t \t \t \t \t \t \t\t\t \t\t \t\t\t \t\t", "x = input()\r\nif (len(x) == 1 and x.islower()) or (x[0].islower() and x[1:].isupper()):\r\n print(x.capitalize())\r\n exit()\r\nif x.islower():\r\n x = x.upper()\r\nif x.isupper():\r\n x = x.lower()\r\n\r\n\r\nprint(x)", "n = input()\r\nans = n\r\nif n == n.upper():\r\n ans = n.lower()\r\nelif n[1:len(n)] == n[1:len(n)].upper():\r\n ans = n[0].upper() + n[1:len(n)].lower()\r\nprint(ans)", "x = input()\r\nif x.isupper():\r\n\tprint(x.lower())\r\nelif x[0].islower() and x[1:].isupper():\r\n\tprint(x[0].upper()+x[1:].lower())\r\nelif x[0].isupper() and x[1:].islower():\r\n\tprint(x[0].upper()+x[1:].lower())\r\nelif (len(x) == 1) and x.lower():\r\n\tprint(x.upper())\r\nelse:\r\n\tprint(x)", "s = input()\r\nans = s\r\nif len(s) == 1 or s[1:].isupper():\r\n ans = ''\r\n for c in s:\r\n ans += (c.upper() if c.islower() else c.lower())\r\nprint(ans)", "x=input()\r\nl=[]\r\ne=[]\r\np=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\nq=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\r\ns=0\r\nr=0\r\nfor i in range(len(x)):\r\n if x[0] in q :\r\n if i==0 and x[i] in q:\r\n l.append(p[q.index(x[0])])\r\n s+=1\r\n if i!=0 and x[i] in p:\r\n l.append(q[p.index(x[i])])\r\n s+=1\r\n \r\n \r\n if x[i] in p:\r\n e.append(q[p.index(x[i])])\r\n r+=1\r\n \r\nif s==len(x):\r\n print(''.join(l))\r\nif r==len(x):\r\n print(''.join(e))\r\nif s!=len(x) and r!=len(x):\r\n print(x)\r\n\r\n \r\n", "a = input()\r\nif len(a) == 1:\r\n if ord(a) >= 97:\r\n print(chr(ord(a) - 32))\r\n else:\r\n print(chr(ord(a) + 32))\r\nelse:\r\n check = 1\r\n for i in range(1 , len(a)):\r\n if ord(a[i]) < 65 or ord(a[i]) > 90:\r\n check = 0\r\n break\r\n if check == 1:\r\n for j in range(len(a)):\r\n if ord(a[j]) >= 97:\r\n print(chr(ord(a[j]) - 32) , end = \"\")\r\n else:\r\n print(chr(ord(a[j]) + 32) , end = \"\")\r\n if check == 0:\r\n print(a)", "name = input()\r\ndef change(l):\r\n if l.upper() == l:\r\n return(l.lower())\r\n else:\r\n return(l.upper())\r\n \r\nif len(name) == 1:\r\n print(change(name[0]))\r\n exit()\r\n\r\nind = True\r\nfor i in name[1:]:\r\n if i.upper() != i:\r\n ind = False\r\nres = [change(x) if ind else x for x in name ]\r\nprint(''.join(res))\r\n", "a=input()\r\na=str(a)\r\nb=[]\r\nj=0\r\nl=\"\"\r\nfor i in a[1:] :\r\n if(i.islower()==True):\r\n j=1\r\nif (j==0):\r\n for k in a:\r\n b.append(k.swapcase())\r\n for m in b:\r\n l+=m\r\n print(l)\r\n\r\nelse:\r\n print(a)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "x = str(input())\r\nu = 0\r\nl = 0\r\nfor i in x:\r\n if i.isupper():\r\n u += 1\r\n else: \r\n l += 1\r\n\r\nif (x[0].islower() and u == len(x)-1):\r\n for i in range(len(x)):\r\n if i == 0:\r\n print(x[i].upper(), end=\"\")\r\n else:\r\n print(x[i].lower(), end=\"\")\r\nelif u == len(x):\r\n for i in range(len(x)):\r\n print(x[i].lower(),end=\"\")\r\nelse:\r\n print(x)", "word = input()\r\nif word.upper() == word:\r\n print(word.lower())\r\nelif word[0].lower() == word[0] and word[0].upper() + word[1:] == word.upper():\r\n print(f\"{word[0].upper()}{word[1:].lower()}\")\r\nelse:\r\n print(word)", "value = input()\r\nif (value[0] == value[0].lower() and value[1:] == value[1:].upper()) or (value == value.upper()):\r\n print(value.swapcase())\r\nelse:\r\n print(value)", "i = input()\nif i.isupper() or (i[0].islower()) and (i[1:].isupper()) or (len(i)==1 and i.islower()):\n i = i.swapcase()\nprint(i)\n \t \t \t \t\t \t \t\t \t \t\t \t \t", "input_string = input()\r\nneeds_change = True\r\nfor i in range(1, len(input_string)):\r\n if input_string[i].islower():\r\n needs_change = False\r\n break\r\nif needs_change:\r\n input_string = input_string.swapcase()\r\nprint(input_string)", "strli=input()\r\nif strli.isupper():\r\n x=strli.lower()\r\n print(x)\r\nelif strli[0].islower() and strli[1:].isupper():\r\n x=list(strli.lower())\r\n x[0]=x[0].upper()\r\n out=\"\".join(x)\r\n print(out)\r\nelif len(strli)==1 and strli[0].islower():\r\n x=strli.upper()\r\n print(x)\r\nelse:\r\n print(strli)", "def cAPS_lOCK(word):\r\n if word.isupper() or (word[0].islower() and all(ch.isupper() for ch in word[1:])):\r\n return word.swapcase()\r\n else :\r\n return word\r\n\r\nif __name__ == \"__main__\":\r\n word = input()\r\n print(cAPS_lOCK(word))\r\n", "s = input()\r\nif s[0] == s[0].lower() and s[1::] == s[1::].upper():\r\n print(s[0].upper() + s[1::].lower())\r\nelif s == s.upper():\r\n print(s.lower())\r\nelse:\r\n print(s)", "# hi\n\nmy_word = input()\n\nif my_word.isupper() or (my_word[0].islower() and my_word[1:].isupper()) or (len(my_word)==1 and my_word.islower()):\n my_word = my_word.swapcase()\n\nprint(my_word)\n\t \t \t\t \t \t \t\t\t\t\t\t\t\t \t\t", "import math\r\ndef readint():\r\n return int(input())\r\n \r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\nword = input()\r\n\r\nif word == word.upper():\r\n print(word.lower())\r\nelse:\r\n if word[1:] == word[1:].upper():\r\n print(word[0].upper() + word[1:].lower())\r\n else: print(word)", "a = input()\r\nif a.isupper() or (a[0].islower() and a[1:].isupper()) or (len(a) == 1 and a.islower()):\r\n a = a.swapcase()\r\nprint(a) ", "s = input()\r\n\r\nif s.isupper():\r\n corrected_word = s.lower()\r\nelif s[0].islower() and s[1:].isupper():\r\n corrected_word = s[0].upper() + s[1:].lower()\r\nelif len(s) == 1:\r\n corrected_word = s.upper()\r\nelse:\r\n corrected_word = s\r\n\r\nprint(corrected_word)\r\n", "def modificar_palabra(p):\r\n palabra_inicio = palabra[0].upper()\r\n respuesta=\"\"\r\n for i in range(1,len(palabra)):\r\n respuesta += palabra[i].lower()\r\n respuesta = palabra_inicio + respuesta\r\n return respuesta\r\n\r\n\r\n\r\n\r\npalabra = input()\r\n\r\ntam = len(palabra) - 1\r\nnum_mayusculas = 0\r\nfor i in range(1,len(palabra)):\r\n if palabra[i].isupper():\r\n num_mayusculas += 1\r\n\r\nif palabra.isupper():\r\n palabra_min = palabra.lower()\r\n print(palabra_min)\r\nelif num_mayusculas == tam:\r\n modificar = modificar_palabra(palabra)\r\n print(modificar)\r\nelse:\r\n print(palabra)\r\n", "\r\nword = str(input())\r\n\r\nif word.upper() == word: print(word.lower())\r\nelif word[1:].upper() == word[1:]: print(word.title())\r\nelse: print(word)", "s=input()\r\na=s[1:]\r\nb=a.upper()\r\nif a!=b:\r\n print(s)\r\nelse:\r\n print(s.swapcase())", "a=input()\r\n\r\nif(a.upper()==a):\r\n print(a.swapcase())\r\nelif(a.capitalize().swapcase()==a):\r\n print(a.swapcase())\r\nelse:\r\n print(a)", "a = input()\r\n\r\nif len(a) == 1 and a.islower():\r\n print(a.capitalize())\r\nelif a[1:].isupper() or a.isupper():\r\n print(a.swapcase())\r\nelse:\r\n print(a)\r\n", "s = input().strip()\r\nif s.isupper():\r\n print(s.lower())\r\nelif(s[0].islower() and (not s[1:] or s[1:].isupper())):\r\n print(s.capitalize())\r\nelse:\r\n print(s)", "s = input()\r\nif(s.upper()==s):\r\n print(s.lower())\r\nelse:\r\n s1=s[1:]\r\n s2=s1.upper()\r\n if s1==s2:\r\n print(s[0:1].upper()+s1.lower())\r\n else:\r\n print(s)", "def isup(s):\r\n for i in s:\r\n if i>\"Z\":\r\n return 0\r\n return 1\r\na=input()\r\nif isup(a[1:]):\r\n b=\"\"\r\n for i in a:\r\n if i>\"Z\":\r\n b+=chr(ord(i)-32)\r\n else:\r\n b+=chr(ord(i)+32)\r\n a=b\r\nprint(a)\r\n", "n = input()\r\nmodified_string = \"\"\r\n\r\nare_all_uppercase = all(char.isupper() for char in n)\r\nexcept_first_letter = all(char.isupper() for char in n[1:])\r\n\r\nif are_all_uppercase or except_first_letter:\r\n for i in n:\r\n if i.isupper():\r\n modified_string += i.lower()\r\n else:\r\n modified_string += i.upper()\r\n \r\n print(modified_string)\r\nelse:\r\n print(n)\r\n", "word = input()\r\n\r\nif word.isupper() or word[1:].isupper() or len(word) == 1:\r\n print(word.swapcase())\r\nelse:\r\n print(word)\r\n\r\n", "a = input()\r\n\r\nif len(a)>1:\r\n\r\n if a.upper() == a:\r\n\r\n print(a.lower())\r\n elif a[1:].upper() == a[1:]:\r\n\r\n print(a.capitalize())\r\n else:\r\n print(a)\r\nelse:\r\n print(a.swapcase())\r\n", "s = input()\r\n\r\nif len(s) >= 2:\r\n result = s.lower() if s.isupper() else s[0].upper() + s[1:].lower() \\\r\n if s[0].islower() and s[1:].isupper() else s\r\nelse:\r\n result = s.lower() if s.isupper() else s.upper()\r\n\r\nprint(result)", "def detectcaps(a):\r\n a=a[1:]\r\n if a.upper()==a:\r\n return True\r\n else:return False\r\ndef swap_case(a):\r\n newa=\"\"\r\n for i in a:\r\n if i.lower()==i:\r\n newa+=i.upper()\r\n elif i.upper()==i:\r\n newa+=i.lower()\r\n return newa\r\na=input()\r\nif detectcaps(a):\r\n print(swap_case(a))\r\nelse:\r\n print(a)", "word = input()\r\nif word[1:].upper() == word[1:]:\r\n word = word.swapcase()\r\nprint(word)", "a = input()\r\nif a.upper() == a:\r\n print(a.lower())\r\nelif a[0] == a[0].lower() and a[1:].upper() == a[1:]:\r\n print(a[0].upper()+a[1:].lower())\r\nelse:\r\n print(a)", "x=input()\r\nif x[1:].upper()==x[1:]:\r\n x=x.swapcase()\r\nprint(x)\r\n ", "word=input()\r\nif word[1:].upper()==word[1:]:\r\n print(word.swapcase())\r\nelse: \r\n print(word)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ns=input()\r\nn=len(s)\r\nif n==1 and s.isupper():\r\n\tprint(s.lower())\r\nelif n==1 and s.islower():\r\n\tprint(s.upper())\r\nelif s.isupper():\r\n\tprint(s.lower())\r\nelif s[1:].isupper():\r\n\tprint(s[0].upper()+s[1:].lower())\r\nelse:\r\n\tprint(s)", "s = input()\r\nfor i in range(len(s)):\r\n if i != 0 and s[i].islower():\r\n print(s)\r\n exit()\r\n\r\nprint(s[0].upper() + s[1:].lower() if s[0].islower() else s.lower())\r\n", "n = input()\r\nif n[0] == n[0].lower() and n[1:] == n[1:].upper():\r\n print(n[0].upper()+n[1:].lower())\r\nelif n == n.upper():\r\n print(n.lower())\r\nelse:\r\n print(n)", "# from math import *\r\ndef solve(s):\r\n \r\n if (s[0].islower() and s[1:].isupper()) :\r\n return s.title()\r\n elif s.isupper():\r\n return s.lower()\r\n if len(s)==1 and s.islower():\r\n return s.upper()\r\n\r\n return s\r\ns=input()\r\nprint(solve(s))\r\n", "s = input()\r\nif len(s) == 1 and s.islower():\r\n print(s.upper())\r\nelif s.isupper():\r\n print(s.swapcase())\r\nelif s[1:].isupper() and s[0].islower():\r\n print(s.swapcase())\r\nelse:\r\n print(s)", "s = input()\r\nif s[0].islower() and (s[1:].isupper() or len(s) == 1):\r\n print(s.capitalize())\r\nelif s.isupper():\r\n print(s.lower())\r\nelse: print(s)", "string=input()\r\nif (string.isupper() or (string[0].islower() and (string[1:].isupper() or len(string)==1))):\r\n print(string.swapcase())\r\nelse:\r\n print(string)", "array = input()\r\nflag = True\r\nnew_string = \"\"\r\n\r\nfor i in range(1, len(array)):\r\n if array[i].islower():\r\n flag = False\r\n\r\nif flag:\r\n for ch in array:\r\n if ch.islower():\r\n new_string += ch.upper()\r\n else:\r\n new_string += ch.lower()\r\n print(new_string)\r\nelse:\r\n print(array)\r\n", "#counter_capital=0\r\n#counter_small=0\r\nword=input()\r\nlol=len(word)\r\nif len(word)==1:\r\n if word.islower():\r\n print(word.upper())\r\n else:\r\n print(word.lower())\r\nelif word[1::].isupper() or word.isupper():\r\n print(word.swapcase())\r\nelse:\r\n print(word)", "q = input()\r\nW = [\"Z\",\"Y\",\"X\",\"W\",\"V\",\"U\",\"T\",\"S\",\"R\",\"Q\",\"P\",\"O\",\"N\",\"M\",\"L\",\"K\",\"J\",\"I\",\"H\",\"G\",\"F\",\"E\",\"D\",\"C\",\"B\",\"A\"]\r\nw = [\"z\",\"y\",\"x\",\"w\",\"v\",\"u\",\"t\",\"s\",\"r\",\"q\",\"p\",\"o\",\"n\",\"m\",\"l\",\"k\",\"j\",\"i\",\"h\",\"g\",\"f\",\"e\",\"d\",\"c\",\"b\",\"a\"]\r\ne = 0\r\nfor i in range(len(q) - 1):\r\n if W.count(q[i + 1]) > 0:\r\n e += 1\r\nif e == len(q) - 1:\r\n if w.count(q[0]) > 0:\r\n print(W[w.index(q[0])], end=\"\")\r\n else:\r\n print(w[W.index(q[0])], end=\"\")\r\n for i in range(len(q) - 1):\r\n print(w[W.index(q[i + 1])], end=\"\")\r\nelse:\r\n print(q)", "s=input()\r\nif (s[1:].isupper() and len(s)>1) or (len(s)==1):\r\n s=s.swapcase()\r\nprint(s)", "\r\ns = input()\r\n\r\n\r\nmay = s.upper()\r\nminu = s.lower()\r\nans = s\r\n\r\nif(ans == may):\r\n ans = minu\r\n\r\nif(s[0].islower() and s[1:] == may[1:]):\r\n ans = s[0].upper() + s[1:].lower()\r\n\r\n\r\nprint(ans)\r\n", "s=input()\r\nif s[0].islower() and s[1::].isupper():\r\n s1=s[0].upper()\r\n for i in range(1,len(s)):\r\n if s[i].islower():\r\n s1+=s[i].upper()\r\n else:\r\n s1+=s[i].lower()\r\nelif len(s)==1:\r\n if s.isupper():\r\n s1=s.lower()\r\n else:\r\n s1=s.upper()\r\nelif s.isupper():\r\n s1=s.lower()\r\nelse:\r\n s1=s \r\nprint(s1)", "s=input()\r\na=True\r\nfor i in range(1,len(s)):\r\n if s[i].islower():\r\n a=False\r\nif a:\r\n for j in range(len(s)):\r\n if s[j].islower():\r\n u=s[j].upper()\r\n else:\r\n u=s[j].lower()\r\n print(u,end=\"\")\r\nelse:\r\n print(s)", "alphabet=[chr(x) for x in range(65,91)]\r\nword=input()\r\nn=len(word)\r\nsta=1\r\nfor i in range(1,n):\r\n if word[i] not in alphabet:\r\n sta=0\r\n break\r\nif sta==0:\r\n print(word)\r\nelse:\r\n if word[0] in alphabet:\r\n print(word.lower())\r\n else:\r\n print(word.title())", "n=input()\r\na=len(n)\r\nif a==1 and n.islower():\r\n print(n.upper())\r\nelif n.isupper():\r\n print(n.lower())\r\nelif n[0].islower and n[1::].isupper():\r\n print(n[0].upper()+n[1::].lower())\r\nelse:\r\n print(n)", "word = input()\nif word == word.upper():\n print(word.lower())\nelif word[0] == word[0].lower() and word[1:] == word[1:].upper():\n print(word[0].upper() + word[1:].lower())\nelif len(word) == 1 and word == word.lower():\n print(word.upper())\nelse:\n print(word)\n\n\t\t \t\t \t \t\t \t \t \t\t\t \t\t\t \t\t\t", "s = input()\r\nif (s.isupper()) or (len(s) == 1 and s.islower()) or (s[0].islower() and s[1:].isupper()):\r\n print(s.swapcase())\r\nelse:\r\n print(s)\r\n", "s=input()\r\nsub=s[1:]\r\nif sub.upper()==sub:\r\n if ord(s[0])>=97:\r\n s=s[0].upper()+sub.lower()\r\n else:\r\n s=s.lower()\r\n print(s)\r\nelse:\r\n print(s)\r\n", "s = input()\r\ns2 = s[0:1]\r\ns1 = s[1:]\r\nf=0\r\nif(s1.isupper() or len(s)==1):\r\n f=1\r\nif(f==0):\r\n print(s)\r\nelse:\r\n print(s.swapcase())\r\n\r\n", "string=input()\r\ndef isAllUpper(array):\r\n\treturn all(map(lambda x: x>='A' and x<='Z',array))\r\ndef isOnlyFirstSmall(array):\r\n\tif array[0]>='a' and array[0]<='z' and isAllUpper(array[1:]):\r\n\t\treturn True\r\n\treturn False\r\n\t\r\nif isOnlyFirstSmall(string) :\r\n\tprint (string[0].upper()+string[1:].lower())\r\nelif isAllUpper(list(string)):\r\n\tprint (string.lower())\r\nelse:\r\n\tprint (string)\r\n", "def check(x):\r\n if x.isupper():\r\n return True\r\n if x[0].islower() and x[1:].isupper():\r\n return True\r\n return False\r\n\r\n\r\ns = input()\r\nif len(s) == 1 and s.islower():\r\n print(s.upper())\r\nelif check(s):\r\n ans = \"\"\r\n for i in s:\r\n if i.isupper():\r\n ans += i.lower()\r\n else:\r\n ans += i.upper()\r\n print(ans)\r\nelse:\r\n print(s)\r\n", "word = input()\r\n\r\nif word == word.upper() or word[1:] == word[1:].upper() or len(word) == 1:\r\n fin = \"\"\r\n for i in word:\r\n if i == i.lower():\r\n fin += i.upper()\r\n else:\r\n fin += i.lower()\r\n\r\n print(fin)\r\nelse:\r\n\r\n print(word)\r\n", "# Read input\r\nn = input()\r\n\r\n# Check if the word should be converted\r\nif n[1:].upper() == n[1:]:\r\n result = n.swapcase()\r\nelse:\r\n result = n\r\n\r\n# Print the result\r\nprint(result)", "word = input()\r\nif word[1:] == word[1:].upper():\r\n if word[0].islower():\r\n print(word.capitalize())\r\n else:\r\n print(word.lower())\r\nelse:\r\n print(word)", "s = input()\r\n\r\nkeep = False\r\n\r\nfor e in s[1:]:\r\n if ord(e) >= ord(\"a\"):\r\n keep = True\r\n break\r\n\r\nif keep:\r\n print(s)\r\nelse:\r\n print(s.swapcase())\r\n ", "def check(s):\n for c in s:\n if c.islower():\n return False\n return True\n\ns = input()\nif not check(s[1:]):\n print(''.join(s))\nelse:\n s = list(s)\n for i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n else:\n s[i] = s[i].lower()\n print(''.join(s))\n\n", "word = input()\r\n\r\ncount = 0\r\nfor c in word:\r\n count += (c.isupper())\r\n\r\nif word[0].islower() and count == len(word)-1:\r\n print(word[0].upper() + word[1:].lower())\r\nelif count == len(word):\r\n print(word.lower())\r\nelse:\r\n print(word)", "text = input()\r\nif text.isupper() :\r\n print(text.lower())\r\nelif text[0:1].islower() and (text[1:].isupper() or len(text) == 1) : \r\n print(text.capitalize())\r\nelse : print(text)", "s=input() \r\nif s[1:]==s[1:].upper():\r\n print(s.swapcase()) \r\nelse:\r\n print(s)", "word = input()\r\nif len(word) == 1:\r\n word = word.swapcase()\r\nelif word[1:].isupper():\r\n word = word.swapcase()\r\nelse:\r\n word = word\r\nprint(word)", "x=input()\r\nupp=0\r\nlow=0\r\nfor i in x:\r\n if i.isupper():\r\n upp+=1\r\n else: \r\n low+=1\r\nif (x[0].islower() and upp==len(x)-1):\r\n for i in range(len(x)):\r\n if(i==0):\r\n print(x[i].upper(), end=\"\")\r\n else:\r\n print(x[i].lower(), end=\"\")\r\nelif(upp==len(x)):\r\n for i in range(len(x)):\r\n print(x[i].lower(),end=\"\")\r\nelse:\r\n print(x)", "s=input()\r\nif s[0].islower():\r\n f=True\r\n for i in s[1:]:\r\n if i.islower():\r\n f=False\r\n if f==False:\r\n print(s)\r\n else:\r\n print(s[0].upper() + s[1:].lower())\r\nelse:\r\n f=True\r\n for i in s[1:]:\r\n if i.islower():\r\n f=False\r\n if f==False:\r\n print(s)\r\n else:\r\n print(s.lower())\r\n ", "n=input()\r\nif (n[0].islower() and n[1:].isupper()):\r\n n=n.capitalize()\r\nelif n.isupper():\r\n n=n.lower()\r\nelif n.islower() and len(n)==1:\r\n n=n.upper()\r\nprint(n)", "import math\r\n#f = open(\"test.txt\")\r\n\r\ntxt = input()\r\n\r\nprint([txt, txt.swapcase()][txt[1:].upper() == txt[1:]])", "word = input()\n\nif word == word.upper():\n print(word.swapcase())\nelif word == word.capitalize().swapcase():\n print(word.swapcase())\nelse:\n print(word)\n", "word = input()\r\nif word[0].islower() and word[1:].isupper():\r\n print(word.title())\r\nelif word.isupper():\r\n print(word.lower())\r\nelif len(word) == 1 and word.islower():\r\n print(word.upper())\r\nelse:\r\n print(word)", "bruh=input()\r\nif len(bruh)==1 and bruh.isupper()==False:\r\n print(bruh.upper())\r\nelif bruh.isupper()==True:\r\n print(bruh.lower())\r\nelif bruh[0].isupper()==False and bruh[1:len(bruh)].isupper()==True:\r\n print(f'{bruh[0].upper()}{bruh[1:len(bruh)].lower()}')\r\nelse:\r\n print(bruh)", "x = str(input())\r\nupp = 0\r\nlow = 0\r\nfor i in x:\r\n if i.isupper():\r\n upp += 1\r\n else: \r\n low += 1\r\n\r\nif (x[0].islower() and upp == len(x)-1):\r\n for i in range(len(x)):\r\n if i == 0:\r\n print(x[i].upper(), end=\"\")\r\n else:\r\n print(x[i].lower(), end=\"\")\r\nelif upp == len(x):\r\n for i in range(len(x)):\r\n print(x[i].lower(),end=\"\")\r\nelse:\r\n print(x)", "s=input()\r\nup=s.upper()\r\nf=0\r\nz=0\r\nans=\"\"\r\nif s==up:\r\n z=1\r\n print(s.lower())\r\nelse:\r\n if s[0]==s[0].lower():\r\n for i in range(1,len(s)):\r\n if s[i]!=s[i].upper():\r\n f=1\r\n if f==0:\r\n ans+=s[0].upper()\r\n for i in range(1,len(s)):\r\n ans+=s[i].lower()\r\n z=1\r\n print(ans)\r\nif z==0:\r\n print(s)", "n=input()\r\nflag=True\r\narr=[]\r\nfor num in n:\r\n arr.append(num)\r\nfor i in range(1,len(arr)):\r\n if arr[i].islower():\r\n flag=False\r\nif flag==True:\r\n if arr[0].isupper():\r\n for i in range(0,len(arr)):\r\n arr[i]=arr[i].lower()\r\n else:\r\n arr[0]=arr[0].upper()\r\n for i in range (1,len(arr)):\r\n arr[i]=arr[i].lower()\r\nbrr=\"\"\r\nfor b in arr :\r\n brr=brr+b\r\nprint(brr)", "a=input()\r\nif len(a)==1:a=a.swapcase()\r\nelse:a=(a,a.swapcase())[a[1:].isupper()]\r\nprint(a)", "def main():\r\n s = input()\r\n if s[1:].upper() == s[1:]:\r\n if s[0].upper() == s[0]:\r\n s = s.lower()\r\n else:\r\n s = s[0].upper() + s[1:].lower()\r\n print(s)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# h\n\nh= input()\n\nif h.isupper() or (h[0].islower() and h[1:].isupper()) or (len(h)==1 and h.islower()):\n h= h.swapcase()\n\nprint(h)\n\t \t \t \t \t\t \t\t \t \t \t\t\t", "st=input()\r\ncount=0\r\nfor i in st:\r\n if i.islower():\r\n count+=1\r\nif count<=1 and st[0].islower():\r\n print(st.title())\r\nelif st.isupper():\r\n print(st.lower())\r\nelse:\r\n print(st)\r\n", "s=input()\r\nprint(s.swapcase() if s.upper()==s or (s[0].islower() and s[1:]==s[1:].upper()) else s)", "s=input()\r\ni=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nfor a in range((len(s)-1),-1,-1):\r\n if s[a] not in i:\r\n if a==0:\r\n print(s[0].upper()+s[1:].lower())\r\n else:\r\n print(s)\r\n break\r\n else:\r\n if a==0:\r\n print(s.lower())\r\n break", "w = str(input())\r\nif len(w) < 2 : t = w.swapcase();print(t)\r\nelif w.isupper() or (w[0].islower() and w[1:].isupper()):q = w.swapcase();print(q)\r\nelse:print(w)\r\n", "s = input()\r\nif len(s) == 1 or s[1:].upper() == s[1:]:\r\n s = s.swapcase()\r\nprint(s)\r\n", "a = input()\r\nif a[1:].upper() == a[1:]:\r\n print(a.swapcase())\r\nelse:\r\n print(a)\n# Sun Oct 29 2023 14:01:35 GMT+0300 (Moscow Standard Time)\n", "word = input()\n\nif word.isupper() == True:\n print(word.lower())\nelse:\n cnt = 0\n for i in range(0, len(word), 1):\n if word[i].isupper() == True:\n cnt += 1\n\n if cnt == len(word)-1 and word[0].islower() == True:\n ans = \"\"\n ans += word[0].upper()\n ans += word[1:].lower()\n print(ans)\n else:\n print(word)\n \n\t \t \t \t\t \t\t\t\t \t\t \t \t \t \t \t\t", "def solve(s: str) -> int:\r\n if s.upper() == s:\r\n return(s.lower())\r\n elif s[0].lower() + s[1:].upper() == s:\r\n return(s.swapcase())\r\n else:\r\n return(s)\r\n \r\ns = input()\r\nprint(solve(s))\r\n ", "s=input()\r\nif len(s)==1:\r\n if s.islower():\r\n a=s.upper()\r\n if s.isupper():\r\n a=s.lower()\r\n print(a)\r\nelif s.isupper():\r\n a=s.lower()\r\n print(a)\r\nelif s[0].islower() and s[1:].isupper():\r\n a=s[1:].lower()\r\n b=s[0].upper()\r\n print(b+a)\r\nelse:\r\n print(s)\r\n ", "\r\nimport math\r\n\r\n\r\n\r\nstrToChange = input()\r\n\r\nisNeedChange = True\r\nnewStr = strToChange\r\nfor idx in range(1, len(strToChange)):\r\n if strToChange[idx] != strToChange[idx].upper():\r\n isNeedChange = False\r\n break\r\nif strToChange[0] == strToChange[0].upper() and isNeedChange:\r\n newStr = strToChange.lower()\r\n isNeedChange = False\r\nif isNeedChange:\r\n newStr = strToChange[0].upper() + strToChange[1:len(strToChange)].lower()\r\nprint(newStr)\r\n", "word = input()\r\ndef check(word):\r\n if word[0].islower() and word[1:].isupper():\r\n return True\r\n else:\r\n return False\r\n\r\nif word.isupper() or check(word) or len(word) == 1:\r\n print(word.swapcase())\r\nelse:\r\n print(word)", "s = input()\r\nif len(s) == 1 and s.islower() is True:\r\n print(s.upper())\r\nelif s[0].islower() is True and s[1:].isupper() is True:\r\n print(s.title())\r\nelif s.isupper() is True:\r\n print(s.lower())\r\nelse:\r\n print(s)", "s=input()\r\nif s.upper() == s:\r\n print( s.lower())\r\nelif s.swapcase() == s.title() :\r\n print(s.title())\r\nelse:\r\n print(s)\r\n", "a=input()\r\nif a==a.upper():\r\n print(a.lower())\r\nelif a[0]==a[0].lower() and a[1:]==a[1:].upper():\r\n print(a[0].upper()+a[1:].lower())\r\nelse:\r\n print(a)\r\n ", "string = input()\r\n\r\nanswer = ''\r\nif len(string) == 1 or string[1:].isupper():\r\n for char in string:\r\n answer += (char.upper() if char.islower() else char.lower())\r\nelse:\r\n answer = string\r\nprint(answer)\r\n", "s = input()\r\ncaps_lock = True\r\nfor i in range(1,len(s)):\r\n if s[i] >= 'a' and s[i] <= 'z':\r\n caps_lock = False\r\n break\r\nif caps_lock:\r\n print(s.swapcase())\r\nelse:\r\n print(s)", "h=input()\n\nif h.isupper():\n print(h.lower())\nelse:\n u=0\n for i in range(0,len(h),1):\n if h[i].isupper():\n u+=1\n if u==len(h)-1 and h[0].islower():\n y=\"\"\n y+=h[0].upper()\n y+=h[1:].lower()\n print(y)\n else:\n print(h)\n#\n \t\t\t \t \t \t\t \t \t \t\t \t \t", "x = input()\r\n\r\nif x.isupper():\r\n print(x.lower())\r\nelif x[0].islower() and all(char.isupper() for char in x[1:]):\r\n print(x[0].upper() + x[1:].lower())\r\nelse:\r\n print(x)", "# Read the input word\r\nword = input()\r\n\r\n# Check if the word is a single lowercase letter\r\nif len(word) == 1 and word.islower():\r\n # If it's a single lowercase letter, capitalize it\r\n print(word.upper())\r\nelse:\r\n # Otherwise, apply the Caps Lock rule\r\n if word.isupper() or (word[0].islower() and word[1:].isupper()):\r\n # If the criteria are met, change the case of all letters\r\n print(word.swapcase())\r\n else:\r\n # If the criteria are not met, leave the word unchanged\r\n print(word)\r\n", "w = input()\r\nif len(w)==1 and w.islower:\r\n print(w.swapcase())\r\nelif w.isupper() or w[0].islower() and w[1::].isupper():\r\n print(w.swapcase())\r\nelse:\r\n print(w) ", "x= input()\r\ny=\"\"\r\nif x==x.upper():\r\n print(x.lower())\r\nelif x[0].lower()==x[0] and x[1:len(x)].upper()==x[1:len(x)]:\r\n y+=x[0].upper()\r\n y+=x[1:len(x)].lower()\r\n print(y)\r\nelse:\r\n print(x)", "s = str(input())\r\nupp = 0\r\nlow = 0\r\nfor i in s:\r\n if i.islower():\r\n low+=1\r\n else:\r\n upp+=1\r\nif s[0].islower() and upp == len(s)-1:\r\n for i in range(len(s)):\r\n if i==0:\r\n print(s[i].upper(),end=\"\")\r\n else:\r\n print(s[i].lower(),end=\"\")\r\nelif upp == len(s):\r\n for i in range(len(s)):\r\n print(s[i].lower(), end=\"\")\r\nelse:\r\n print(s)\r\n\r\n" ]

[ "from math import inf\r\n\r\ns,k= input().split()\r\nk=int(k)\r\ndict=[[0]*26 for i in range(26)]\r\nfor i in range(int(input())):\r\n\r\n\r\n x=input().split()\r\n # print(ord(x[0])-97,ord(x[1])-97)\r\n dict[ord(x[0])-97][ord(x[1])-97]=int(x[2])\r\ndp=[[[-inf]*26 for j in range(k+2)]for i in range(len(s))]\r\nm=-1\r\nfor i in range(26):\r\n if ord(s[0])-97==i:\r\n dp[0][0][i]=0\r\n else:\r\n dp[0][1][i]=0\r\nm=-1\r\nfor i in range(1,len(s)):\r\n for j in range(k+1):\r\n for p in range(26):\r\n if ord(s[i])-97==p:\r\n for xx in range(26):\r\n dp[i][j][p]=max(dp[i-1][j][xx]+dict[xx][p],dp[i][j][p])\r\n else:\r\n for xx in range(26):\r\n dp[i][j+1][p]=max(dp[i-1][j][xx]+dict[xx][p],dp[i][j+1][p])\r\n\r\nprint(max(map(max, dp[-1][:-1])))", "from math import inf\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\ns,k = input().split()\r\nn = len(s)\r\nk = int(k)\r\nch = [[0]*26 for _ in range(26)]\r\nfor _ in range(int(input())):\r\n a,b,c = input().split()\r\n ch[ord(a)-97][ord(b)-97] = int(c)\r\n\r\ndp = [[[-inf]*26 for _ in range(k+2)] for _ in range(n)]\r\ndp[0][0][ord(s[0])-97] = 0\r\nfor i in range(26):\r\n if ord(s[0])-97 != i:\r\n dp[0][1][i] = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(k+1):\r\n for m in range(26):\r\n for n in range(26):\r\n if ord(s[i+1])-97 != n:\r\n dp[i+1][j+1][n] = max(dp[i+1][j+1][n],dp[i][j][m]+ch[m][n])\r\n else:\r\n dp[i+1][j][n] = max(dp[i+1][j][n],dp[i][j][m]+ch[m][n])\r\n\r\nprint(max(map(max,dp[-1][:-1])))", "# from pprint import pprint\n\n\ndef flatten(l):\n return [item for sublist in l for item in sublist]\n\n\ndef toint(c):\n return ord(c)-ord('a')\n\n\n[s, k] = input().split()\nk = int(k)\n\nn = int(input())\nbonus = [[0]*26 for _ in range(26)]\nfor i in range(n):\n inp = input().split()\n x: int = toint(inp[0])\n y: int = toint(inp[1])\n w = int(inp[2])\n bonus[x][y] = w\nn = len(s)\n\nk = k+1\ndim2 = 26\ndim1 = n+1\nmin_filler = -200_000\nres = min_filler\nd = [[[min_filler]*26 for _ in range(k+1)] for x in range(n)]\n\nfor i in range(26):\n d[0][int(i != toint(s[0]))][i] = 0\n\nfor i in range(1, n):\n for j in range(k):\n for l in range(26):\n if j == 0 and l != toint(s[i]):\n continue\n for m in range(26):\n d[i][j][l] = max(d[i][j][l],\n d[i-1][j-(l != toint(s[i]))][m]+bonus[m][l])\n if i == n-1:\n res = max(res, d[i][j][l])\n\nprint(0 if res == min_filler else res)\n", "I,T,G=input,int,range;R,O=lambda:I().split(),lambda c:ord(c)-ord('a')\r\ns,k=R();m=len(s);k=T(k);n=T(I());d=[[0]*26 for _ in G(26)]\r\nfor _ in G(n):x,y,c=R();d[O(x)][O(y)]=T(c)\r\nf=[[0]*26 for _ in G(k+1)]\r\nfor i in G(m):\r\n f1=[[0]*26 for _ in G(k+1)]\r\n for j in G(k+1):\r\n for r in G(26):\r\n x=O(s[i])\r\n c=d[x][r] if i<m-1 else 0\r\n sub=f[j][x] if 0<=i-1 else 0#底\r\n v=sub+c\r\n if j>0:\r\n for x in G(26):\r\n c=d[x][r] if i<m-1 else 0\r\n sub=f[j-1][x] if 0<=i-1 else 0#底\r\n v=max(v,c+sub)\r\n f1[j][r]=v\r\n f1,f=f,f1\r\nprint(f[k][0])" ]

[ "n=int(input())\r\na=list(map(int, input().split()))\r\nm=min(2, n)\r\nk=m\r\nfor i in range(2,n):\r\n if a[i] == a[i-1] + a[i-2]:\r\n k += 1\r\n else:\r\n k = 2\r\n m=max(k,m)\r\nprint(m) ", "n = int(input())\r\nA = [*map(int, input().split())]\r\nk = x = min(n,2)\r\n\r\nfor i in range(n-2):\r\n k = k+1 if A[i]+A[i+1]==A[i+2] else 2\r\n x = max(k,x)\r\n\r\nprint(x)", "n=int(input())\r\nl=list(map(int,list(input().split())))\r\ncount=0\r\nmax=0\r\nfor i in range(len(l)-2):\r\n sum=l[i]+l[i+1]\r\n if sum==l[i+2]:\r\n count=count+1\r\n else:\r\n if count>max:\r\n max=count\r\n count=0\r\nif count>max:\r\n max=count\r\nif max==0 and len(l)>=2:\r\n print(2)\r\nelif max==0 and len(l)<2:\r\n print(1)\r\nelse:\r\n print(max+2)", "#بسم الله الرحمن الرحيم\r\nn = int(input())\r\nfib = [int(i) for i in input().split()]\r\narr = [0]\r\nout = 0\r\nif n>=2:\r\n for i in range(2,n):\r\n if fib[i]==fib[i-1]+fib[i-2]:\r\n out +=1\r\n if i==n-1:\r\n arr.append(out)\r\n else:\r\n arr.append(out)\r\n out =0\r\n print(max(arr)+2)\r\nelse:\r\n print(1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = 0\r\nc = 0\r\nfor i in range(2, n):\r\n if(a[i] == a[i - 1] + a[i - 2]):\r\n c += 1 \r\n else:\r\n s = max(s, c)\r\n c = 0\r\n \r\n\r\ns = max(s, c) \r\nif(s):\r\n print(s + 2)\r\nelse:\r\n print(min(n, 2))", "n = int(input())\r\narr = [int(k) for k in input().split()]\r\n\r\ndef fib_segment(arr):\r\n dp = [1] * len(arr)\r\n\r\n for i in range(1, len(dp)):\r\n if i == 1:\r\n dp[i] = 2\r\n else:\r\n if arr[i - 2] + arr[i - 1] == arr[i]:\r\n dp[i] = dp[i - 1] + 1\r\n else:\r\n dp[i] = 2\r\n\r\n return max(dp)\r\n\r\nprint(fib_segment(arr))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nmaxi=0\r\nif n==1:\r\n\tprint(1)\r\nelif n==2:\r\n\tprint(2)\r\nelse:\r\n\tcount=1\r\n\tfor i in range(2,n):\r\n\t\tfib=a[i-1]+a[i-2]\r\n\t\tif fib==a[i]:\r\n\t\t\tcount+=1\r\n\t\t\tmaxi=max(count,maxi)\r\n\t\telse:\r\n\t\t\tcount=1\r\n\t\t\tmaxi=max(count,maxi)\r\n\tprint(maxi+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = 0\r\nnum = 0\r\nfor i in range(2, len(a), 1):\r\n\tif a[i] == a[i - 1] + a[i - 2]:\r\n\t\tnum += 1\r\n\telse:\r\n\t\tnum = 0\r\n\r\n\tif num > res:\r\n\t\tres = num\r\n\r\nprint(min(res + 2, n))", "n=int(input());a=list(map(int,input().split()))\r\nc,res=0,0\r\nfor i in range(n):\r\n c=[2,c+1][i<2 or a[i]==a[i-1]+a[i-2]]\r\n res=max(res,c)\r\nprint(res)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nkeks = []\r\nk = 0\r\nfor i in range(2,n):\r\n if l[i-1]+l[i-2] == l[i]: k+=1\r\n else:\r\n keks.append(k)\r\n k = 0\r\n \r\nkeks.append(k)\r\nif n > 1:print(max(keks)+2)\r\nelse:print(1)\r\n ", "def solve():\r\n\tn = int(input())\r\n\tl = list(map(int, input().split()))\r\n\tif n <= 2:\r\n\t\tprint(n)\r\n\t\treturn\r\n\ti = 2\r\n\tans = 0\r\n\twhile i < n:\r\n\t\tcount = 2\r\n\t\twhile i<n and l[i] == l[i-1]+l[i-2]:\r\n\t\t\ti += 1\r\n\t\t\tcount += 1\r\n\t\tans = max(ans, count)\r\n\t\ti += 1\r\n\tprint(ans)\r\nsolve()", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nmaxi=2\r\nmax1=2\r\nfor i in range(2,n):\r\n \r\n if x[i-2]+x[i-1]==x[i]:\r\n max1=max1+1\r\n maxi=max(maxi,max1)\r\n else:\r\n \r\n max1=2\r\nif n<2:\r\n print(n)\r\nelse:\r\n print(maxi)", "import sys\nimport bisect\nimport heapq\nimport math\nfrom functools import lru_cache\nfrom collections import defaultdict,Counter\n\n\n#sys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nI = lambda: int(input())\nS = lambda: input()\nL = lambda: list(map(int, input().split()))\n###################################################\n\n\n\n\ndef solution(n, arr):\n a = [False]*n \n for idx in range(2, n):\n if arr[idx]==arr[idx-1]+arr[idx-2]:\n a[idx]=True\n res = 0\n curr=0\n for i in a:\n if i==True:\n curr+=1\n res = max(res,curr)\n else:\n curr=0\n print(res+2)\n\nif __name__=='__main__':\n n = I()\n arr = L()\n if n==1:\n print(1)\n elif n==2:\n print(2)\n else:\n solution(n, arr)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=0\r\ne=1\r\nc=2\r\nr=2\r\nif(len(a)==1):\r\n print(1)\r\n quit()\r\nif(len(a)==2):\r\n print(2)\r\n quit()\r\nwhile(s<len(a)):\r\n if(a[s]+a[e]==a[e+1]):\r\n s=e\r\n e+=1\r\n c+=1\r\n else:\r\n s+=1\r\n e+=1\r\n r=max(r,c)\r\n c=2\r\n if(e==len(a)-1):\r\n break\r\nprint(max(r,c))", "n = int(input())\r\nls = input().split(\" \")\r\nls = [int(i) for i in ls]\r\nif(n < 3):\r\n print(n)\r\nelse:\r\n end = 2\r\n st = 0\r\n maxval = 0\r\n while(end<n):\r\n if(ls[end] != ls[end-1] + ls[end-2]):\r\n st = end -1\r\n maxval = max(maxval , end-st+1)\r\n end+=1\r\n print(maxval)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\npointer =0\r\nlength = 0\r\nlast = 0\r\nfor i in range(2,n):\r\n if l[i] != l[i-1]+ l[i-2]:\r\n length = max(length,i-pointer)\r\n pointer = i - 1\r\n else:\r\n last = i\r\n\r\n\r\nif n ==1:\r\n print(1)\r\nelif n ==2:\r\n print(2)\r\nelse:\r\n print(max(length,last - pointer +1))\r\n\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmx, cnt = 0, 0\r\n\r\nfor i in range(2, n):\r\n if(a[i] == a[i-1] + a[i-2]):\r\n cnt += 1\r\n else:\r\n cnt = 0\r\n \r\n mx = max(mx, cnt)\r\n\r\nprint(mx+2 if (n > 1 ) else 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_seq_len = min(2, n)\r\nstart, curr = 2, 0\r\n\r\nfor i in range(2, n):\r\n good = a[i] == a[i-1] + a[i-2]\r\n \r\n if good:\r\n start = i if curr == 0 else start\r\n curr += 1 \r\n else:\r\n curr_seq_len = curr + min(start - 0, 2)\r\n max_seq_len = max(curr_seq_len, max_seq_len)\r\n curr = 0\r\n\r\nif curr != 0:\r\n curr_seq_len = curr + min(start - 0, 2)\r\n max_seq_len = max(curr_seq_len, max_seq_len)\r\n\r\nprint(max_seq_len)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nstart=0\r\ni=0\r\nans=[]\r\nif len(l)==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\n \r\nelse:\r\n while i<n-2:\r\n if l[i]+l[i+1]!=l[i+2]:\r\n i+=1\r\n start=i\r\n else:\r\n ans.append((i+2-start)+1)\r\n i+=1\r\n \r\n\r\n\r\n if len(ans)>0:\r\n print(max(ans))\r\n elif len(ans)==0 and len(l)==1:\r\n print(1)\r\n elif len(ans)==0 and len(l)>=2:\r\n print(2)\r\n elif len(ans)==0 and len(l)==0:\r\n print(0)\r\n", "n= int(input());a= list(map(int,input().split()))\r\nif n==1:print(1)\r\nelif (set(a))=={0}:print(n)\r\nelif len(set(a))==1:print(2)\r\nelse:\r\n l=[];c1=2;c2=[];c2.append(a[0]);c2.append(a[1])\r\n for i in a[2:]:\r\n if i ==sum(c2):c1+=1\r\n else:l.append(c1);c1=2\r\n c2.append(i)\r\n c2.pop(0)\r\n l.append(c1)\r\n print(max(l))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nif n==1:\r\n print(1)\r\nelse:\r\n cnt = i = ans = 2\r\n while(i<n):\r\n if(arr[i] == arr[i-1]+arr[i-2]):\r\n cnt += 1 \r\n else:\r\n cnt = 2\r\n ans = max(ans, cnt)\r\n i+=1\r\n print(ans)", "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()\ncur_sum = 2\nr = 2\nans = 2\nfor i in range(2, n):\n if not arr[r-1] + arr[r-2] == arr[r]:\n ans = max(ans, cur_sum)\n r+=1\n cur_sum = 2\n else:\n cur_sum += 1\n r += 1\nans = max(cur_sum, ans)\nif len(arr) < 2:\n print(1)\nelse:\n print(ans)\n\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncount = 2\r\nif n<=1:\r\n max_=1\r\nelif n>=2:\r\n max_=2\r\nfor i in range(2,n):\r\n if arr[i]==arr[i-1]+arr[i-2]:\r\n count+=1\r\n else:\r\n count = 2\r\n if max_<count:\r\n max_=count\r\n\r\nprint(max_)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=min(2,n)\r\ncur=2\r\n\r\nfor i in range(2,n):\r\n if arr[i-1]+arr[i-2]==arr[i]:\r\n cur+=1\r\n else:\r\n cur=2\r\n ans=max(cur,ans)\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nif n==1 or n==2:print(n)\r\nelse:\r\n c=m=2\r\n for i in range(2,n):\r\n if a[i]==a[i-1]+a[i-2]:\r\n c+=1\r\n else:\r\n if c>m:m=c\r\n c=2\r\n if c>m:m=c\r\n print(m)", "n = int(input())\nx = list(map(int,input().split()))\nk = 2\nl = []\nif n > 2:\n\tfor i in range(2,n):\n\t\tif x[i-1]+x[i-2] == x[i]:\n\t\t\tl.append(\"1\")\n\t\telse:\n\t\t\tl.append(\"0\")\n# print(l)\t\t\t\nb = \"\".join(l)\nb.strip()\nk = b.split(\"0\")\nc = []\nfor j in k:\n\tc.append(len(j))\n# print(c)\n# print(k)\n\nif n>2:\n \tprint(max(c)+2)\nelse:\n \tprint(n)\t", "n = int(input())\narr = list(map(int,input().split()))\nmaxLen = 0\ncurrLen = 2\nif(n <= 2) :\n print(n)\nelse :\n for i in range(2,len(arr)) :\n if(arr[i-1]+arr[i-2] == arr[i]) :\n currLen += 1\n else :\n maxLen = max(maxLen,currLen)\n currLen = 2\n maxLen = max(maxLen,currLen)\n print(maxLen)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = 0\r\nmylist = []\r\nif(n <= 2):\r\n print(n)\r\nelse:\r\n for i in range(2,n):\r\n if(a[i-2] + a[i-1] == a[i]):\r\n c += 1\r\n if(c == 1):\r\n f = i-2\r\n else:\r\n mylist.append(c)\r\n c = 0\r\n mylist.append(c)\r\n print(max(mylist)+2)", "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\narr = L()\r\nif n==1:\r\n print(1)\r\n exit()\r\n\r\nmaxlen = 2\r\nr = 2\r\nl =0\r\nwhile r<n:\r\n if arr[r] == arr[r-1]+arr[r-2]:\r\n maxlen = max(maxlen,r-l+1)\r\n r+=1\r\n else:\r\n l=r-1\r\n r+=1\r\n\r\nprint(maxlen)\r\n", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:\r\n print('1')\r\nelif n==2:\r\n print('2')\r\nelse:\r\n mini=2\r\n ans=0\r\n i=2\r\n j=2\r\n temp=0\r\n while i<n and j<n:\r\n if i==j and a[j]!=a[j-1]+a[j-2]:\r\n temp=0\r\n i+=1\r\n j+=1\r\n elif a[j]==a[j-1]+a[j-2]:\r\n\r\n temp+=1\r\n ans=max(ans,temp)\r\n j+=1\r\n else:\r\n i+=1\r\n \r\n print(ans+2)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=2\r\nc=2\r\nfor i in range(2,n):\r\n if l[i-2]+l[i-1]==l[i]:\r\n c+=1\r\n else:\r\n if c>ans:\r\n ans=c\r\n c=2\r\nif c>ans:\r\n ans=c\r\nif n==1:\r\n ans=1\r\nprint(ans)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nfirst=nums[0]\r\nif n<=2:\r\n print(n)\r\n exit()\r\n\r\n \r\nans=0\r\nl=0\r\ni=2\r\nwhile(i<n):\r\n count=2\r\n while(i<n and nums[i]==nums[i-1]+nums[i-2]):\r\n i+=1\r\n count+=1\r\n ans=max(ans,count)\r\n i+=1\r\n\r\nprint(ans) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nif n < 3:\r\n print(n)\r\nelse:\r\n c, d = 2, 2\r\n for i in range(2, n):\r\n if w[i] == w[i-1] + w[i-2]:\r\n c += 1\r\n if c > d:\r\n d = c\r\n else:\r\n c = 2\r\n if c > d:\r\n d = c\r\n print(d)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = -1\r\ncnt = 2\r\nfor i in range(n-2):\r\n if a[i] + a[i+1] == a[i+2]:\r\n cnt += 1\r\n else:\r\n if cnt > mx:\r\n mx = cnt\r\n cnt = 2\r\nif cnt > mx:\r\n mx = cnt\r\nif mx <= 2:\r\n print(1 if n == 1 else 2)\r\nelse:\r\n print(mx)", "n = int(input())\na = list(map(int, input().split()))\nif n <= 2:\n print(n)\n exit()\ni = 2\nl = 2\nans = 2\nwhile i < n:\n if a[i] == a[i-1] + a[i-2]:\n l += 1\n else :\n l = 2\n i += 1\n ans = max(l, ans)\nprint(ans)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif n<=2:\r\n\tprint(n)\r\n\texit()\r\na=a[::-1]\r\nans=float(\"-inf\")\r\nc=2\r\nfor i in range(n-2):\r\n\tif a[i]==(a[i+1]+a[i+2]):\r\n\t\tc+=1\r\n\telse:\r\n\t\tans=max(ans,c)\r\n\t\tc=2\r\nprint(max(ans,c))" ]

[ "n = int(input())\r\nhome = input()\r\nflights = []\r\nbe_in_home = 0\r\nnot_in_home = 0\r\nfor i in range(n):\r\n airport_from, airport_to = map(str, input().split('->'))\r\n flights.append([airport_from, airport_to])\r\n\r\n\r\nfor x in flights:\r\n if x[1] == home:\r\n be_in_home += 1\r\n else:\r\n not_in_home += 1\r\n\r\nif be_in_home != not_in_home:\r\n print('contest')\r\nelse:\r\n print('home')", "print(\"contest\" if int(input())%2 else \"home\")", "#Rohan Bojja \n#[email protected]\nfrom collections import defaultdict\n#######################################\nc=1\ncases=1\n\nwhile(c<=cases):\n\tn=int(input())\n\thome=input()\n\titen=defaultdict(list)\n\tfor i in range(0,n):\n\t\tcur=input().split(\"->\")\t\t\n\t\titen[cur[0]].append(cur[1])\n\tans=\"home\"\n\tcur=home\n\twhile(True):\n\t\t#print(cur,iten)\n\t\tif(cur in iten):\n\t\t\tif(cur!=home and home in iten[cur]):\n\t\t\t\tdel iten[cur][iten[cur].index(home)]\n\t\t\t\tcur=home\n\t\t\telif(cur!=home):\n\t\t\t\tans=\"contest\"\n\t\t\t\tbreak\n\t\t\telif(cur==home and len(iten[cur])>0):\n\t\t\t\tcur2=iten[cur][0]\n\t\t\t\titen[cur].pop(0)\n\t\t\t\tcur=cur2\n\t\t\telif(cur==home):\n\t\t\t\tbreak\n\t\telse:\n\t\t\tans=\"contest\"\n\t\t\tbreak\n\t\t#print(cur,iten)\n\tprint(ans)\t\n\tc=c+1\n", "n=int(input())\r\nl=list(input())\r\nz=[]\r\nfor i in range(n):\r\n x,y=map(str,input().split(\"->\"))\r\n z.append(x)\r\n z.append(y)\r\nz1=list(set(z))\r\nz2=[]\r\nfor i in range(len(z1)):\r\n z2.append(z.count(z1[i]))\r\nfor i in range(len(z2)):\r\n if z2[i]%2==1:\r\n print(\"contest\")\r\n break\r\nelse:\r\n print(\"home\")", "n=int(input())\r\nt=input()\r\ngya=[]\r\naya=[]\r\nfor k in range(n):\r\n p=input()\r\n if p[:3]==t:\r\n gya.append(p[-3:])\r\n elif p[-3:]==t:\r\n aya.append(p[:3])\r\n\r\ngya.sort()\r\naya.sort()\r\nif gya==aya:\r\n print('home')\r\nelse:\r\n print('contest')\r\n\r\n", "n = int(input())\r\nhome_airport = input()\r\n\r\ng = {}\r\nfor i in range(0, n):\r\n x = input()\r\n s = x.split('->')\r\n src = s[0]\r\n dest = s[1]\r\n if src in g:\r\n if dest in g[src]:\r\n g[src][dest] = g[src][dest] + 1\r\n else:\r\n g[src][dest] = 1\r\n else:\r\n g[src] = {dest: 1}\r\n\r\n# print(g)\r\n\r\nfor dest in g[home_airport]:\r\n if dest not in g:\r\n print(\"contest\")\r\n exit(0)\r\n if home_airport not in g[dest]:\r\n print(\"contest\")\r\n exit(0)\r\n elif g[home_airport][dest] != g[dest][home_airport]:\r\n print(\"contest\")\r\n exit(0)\r\n\r\nprint(\"home\")\r\n", "x=int(input())\r\ny=input()\r\np=list()\r\nk=list()\r\nfor i in range(x):\r\n a=input()\r\n p.append(a[5:])\r\n k.append(a[0:3])\r\nif p.count(y)>=k.count(y):print(\"home\")\r\nelse:print(\"contest\")\r\n ", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nif int(input())%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")\r\n", "n = int(input())\r\nhome_airport = input()\r\n\r\ncounter = {}\r\n\r\nfor _ in range(n):\r\n flight = input()\r\n\r\n dep = flight[:3]\r\n arr = flight[-3:]\r\n\r\n if dep == home_airport:\r\n round_trip = dep+arr\r\n else:\r\n round_trip = arr+dep\r\n\r\n if round_trip in counter:\r\n counter[round_trip] += 1\r\n else:\r\n counter[round_trip] = 1\r\n\r\n\r\nis_home = True\r\n\r\nfor val in counter.values():\r\n if val % 2 == 1:\r\n is_home = False\r\n break\r\n\r\nif not is_home:\r\n print('contest')\r\nelse:\r\n print('home')\r\n\r\n\r\n# print(counter)\r\n", "n = int(input())\nstr = input()\ncnt1=0\ncnt2=0\nfor i in range(n):\n s = input()\n if str==s[0:3]:\n cnt1+=1\n elif str==s[5:8]:\n cnt2+=1\nif cnt1==cnt2:\n print('home')\nelse:\n print('contest')\n", "#def read():\r\n# return [e for e in input()]\r\n\r\nnumber=int(input())\r\ncplace=input()\r\ntotal=[]\r\nfor i in range(number):\r\n x,y=input().split(\"->\")\r\n total.append(x)\r\n total.append(y)\r\nb=True\r\nfor e in total:\r\n if total.count(e)%2==1:\r\n b=False\r\nif b:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\nhome = input()\r\nd = {}\r\nl = []\r\nfor i in range(n):\r\n a, b = input().split('->')\r\n if a == home:\r\n if b in d:\r\n d[b] += 1\r\n else:\r\n d[b] = 1\r\n l.append(b)\r\n else:\r\n if a in d:\r\n d[a] -= 1\r\n else:\r\n d[a] = -1\r\n l.append(a)\r\n\r\nfor i in l:\r\n if d[i] != 0:\r\n print('contest')\r\n break\r\nelse:\r\n print('home')", "n, home = int(input()), input()\nres = 0\nfor _ in range(n):\n res += 1 - 2 * input().startswith(home)\nres = \"home\" if res == 0 else \"contest\"\nprint(res)\n", "#!/usr/bin/python3\nn = int(input())\nhome = input()\nschedule = []\nfor i in range(n):\n\tschedule.append(input())\n\n#for i in range(n):\n#\tprint(schedule[i])\nflag = 0\nvis = [0 for i in range(n)]\n\nfor i in range(n):\n\tif (flag==0 and (not vis[i]) and schedule[i][0:2] == home[0:2]):\n\t\t#print('if',i)\n\t\tflag = 1\n\t\tvis[i] = 1\n\t\tfor j in range(n):\n\t\t\tif ((not (i==j)) and (not vis[j]) and (schedule[i][5:7]==schedule[j][0:2])):\n\t\t\t\tflag = 0\n\t\t\t\tvis[j] = 1\n\t\t\t\tbreak\n\t\t#else :\n\t\t\t#print(j)\n\t\t\t#print(not (i==j))\n\t\t\t#print(not vis[j]) \n\t\t\t#print(schedule[i][5:7])\n\t\t\t#print(schedule[j][0:2])\n\t#else :\n\t\t#print(flag==0)\n\t\t#print(i)\n\t\t#print(not vis[i])\n\t\t#print(schedule[i][0:3])\n\t\t#print(home[0:3])\n\nif (flag) :\n\tprint(\"contest\")\nelse :\n\tprint(\"home\")\n", "n=int(input())\r\nhome=input().strip()\r\nl=[]\r\nfor x in range(n):\r\n a, b=map(str, input().split('->'))\r\n l.append((a, b))\r\nfound=False\r\nwhile True:\r\n if len(l)==0:break\r\n x=l[-1]\r\n l.pop()\r\n if (x[1], x[0]) in l:\r\n l.remove((x[1], x[0]))\r\n else:\r\n found=True\r\nif found:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")", "n=int(input())\r\nx=input()\r\nfor _ in range(n):input()\r\nif n%2:print('contest')\r\nelse:print('home')", "from collections import Counter\n\ndef solve(n, home, d):\n d = Counter(d)\n return 'contest' if d[home] % 2 == 1 else 'home'\n\n\ndef main():\n n = int(input())\n home = input()\n d = []\n for i in range(n):\n a, b = input().split('->')\n d.append(a)\n d.append(b)\n print(solve(n, home, d))\n\n\nmain()\n", "n=int(input())\r\nl=[]\r\ns=input()\r\nx,y=[],[]\r\nfor i in range(n):\r\n xx,yy=input().split('->')\r\n x.append(xx)\r\n y.append(yy)\r\nif(s in x and s in y):\r\n if(x.count(s)==y.count(s)):\r\n print(\"home\")\r\n else:\r\n print('contest')\r\nelse:\r\n print('contest')", "n = int(input())\r\nhome = input()\r\nfor i in range(0, n):\r\n flight = input()\r\n\r\nif n % 2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nx=int(input())\r\nh=input()\r\nc=0\r\nfor i in range(x):\r\n\tn=input()\r\n\tif n[0]+n[1]+n[2]==h:\r\n\t\tc+=1\r\n\telse:\r\n\t\tc-=1\r\n\r\nif(c==0):\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")\t\t\t\t\r\n", "from sys import stdin\r\n\r\nrd = stdin.readline\r\n\r\nn = int(rd())\r\n\r\nif n & 1: print(\"contest\")\r\nelse: print(\"home\")\r\n", "n = int(input())\r\ns = input()\r\ndepartures, arrivals = 0, 0\r\nfor _ in range(n):\r\n s1, s2 = input().split('->')\r\n if s1 == s:\r\n departures += 1\r\n if s2 == s:\r\n arrivals += 1\r\n \r\nif departures != arrivals:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")", "n = int(input())\r\nhome = input()\r\nk = 0\r\nfor i in range(n):\r\n temp = input()\r\nif n % 2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\nhome_airport = input()\r\nflights = []\r\nfor i in range(n):\r\n flight = input()\r\n departure, arrival = flight.split('->')\r\n flights.append((departure, arrival))\r\nif n % 2 == 0:\r\n print('home')\r\nelse:\r\n print('contest')", "def main():\n n_flights = int(input())\n home = input()\n flights_from_home = {}\n flights_to_home = {}\n\n for _ in range(n_flights):\n [depart, destination] = input().split('->')\n\n if depart == home:\n flights_from_home[destination] = flights_from_home.get(destination, 0) + 1\n else:\n flights_to_home[depart] = flights_to_home.get(depart, 0) + 1\n\n away = False\n\n for destination, times in flights_from_home.items():\n if destination not in flights_to_home or flights_to_home.get(destination) < times:\n away = True\n break\n\n print('contest' if away else 'home')\n\n\nif __name__ == '__main__':\n main()\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"OUTPUX.out\",\"w\")\r\nN=int(input())\r\nS=input()\r\nL=[]\r\ncount=0\r\nfor i in range(N):\r\n\tL.append(input().split('->'))\r\n\tif L[i][0]==S or L[i][1]==S:\r\n\t\tcount+=1\r\nif count%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")", "#\n# Joseph Matsushita\n# Problem A\n#\n \nn = int(input())\n\nhome = input()\nc = 0\n\nfor _ in range(n):\n town = str(input().split('-')[0])\n if town == home:\n c += 1\n else:\n c -= 1\n\nif c == 0:\n print(\"home\")\nelse:\n print(\"contest\")\n \t\t \t \t\t\t \t\t\t\t \t \t\t", "n = int(input())\r\n\r\nhome = input()\r\n\r\nflights = []\r\n\r\nfor i in range(n):\r\n\tinp = input()\r\n\tf = inp.split(\"->\")\r\n\tnew = []\r\n\tnew.append(f[0])\r\n\tnew.append(f[1])\r\n\tnew.append(True)\r\n\tflights.append(new)\r\n\r\ncontest = False\r\n\r\nif (n % 2 == 1):\r\n\tcontest = True\r\nelse:\r\n\t# Check if there are 0 flights from home\r\n\tfound = False\r\n\tfor f in flights:\r\n\t\tif f[0] == home:\r\n\t\t\tfound = True\r\n\t\t\tbreak\r\n\t\r\n\tif found == True:\r\n\t\t# Check if theres always pair\r\n\r\n\t\tcap = len(flights)\r\n\t\tfor i in range(cap):\r\n\t\t\t\r\n\t\t\tif flights[i][2] == True:\r\n\t\t\t\t# Search for its pair\r\n\t\t\t\tfound = False\r\n\t\t\t\tdest = flights[i][1]\r\n\t\t\t\tarr = flights[i][0]\r\n\t\t\t\t\r\n\t\t\t\tfor j in range(cap):\r\n\t\t\t\t\t\r\n\t\t\t\t\tif flights[j][0] == dest and flights[j][2] == True and flights[j][1] == arr:\r\n\t\t\t\t\t\tflights[j][2] = False\r\n\t\t\t\t\t\tflights[i][2] = False\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tfound = True\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif found == False:\r\n\t\t\t\t\tcontest = True\r\n\t\t\t\t\tbreak\r\n\r\nif contest == True:\r\n\tprint(\"contest\")\r\nelse:\r\n\tprint(\"home\")", "n=int(input())\r\nst=input()\r\nl=[]\r\nfor i in range(n):\r\n sr=input()\r\n l.append(sr)\r\n\r\nfor i in range(len(l)):\r\n ele=l[i]\r\n if ele[:3]==st:\r\n l[i]=\"*\"\r\n x=ele[5:]+\"->\"+ele[:3]\r\n if x not in l:\r\n print(\"contest\")\r\n break\r\n f=l.index(x)\r\n l[f]=\"*\"\r\nelse:\r\n print(\"home\")\r\n \r\n", "import sys,math\r\nfrom collections import deque\r\n#input = sys.stdin.buffer.readline\r\n\r\n\r\ndef solve():\t\r\n\treturn;\r\n\r\n\r\n# for _ in range(int(input())):\r\n# \tsolve()\r\n\r\n\r\nn = int(input())\r\nh = input()\r\n\r\ncnt=0\r\nfor i in range(n):\r\n\ts = input()\r\n\tif h==s[:3] or h==s[-3:]:\r\n\t\tcnt+=1\r\n\r\nif cnt%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")\r\n\r\n", "n=int(input())\r\nif n%2==0:\r\n print (\"home\")\r\nelse:\r\n print (\"contest\")\r\n", "n = int(input())\r\nhome = input()\r\ncount = 0\r\n\r\nwhile n > 0:\r\n a, b = map(str, input().split(\"->\"))\r\n if a == home or b == home:\r\n count += 1 \r\n n -= 1\r\n\r\nprint(\"contest\") if count % 2 != 0 else print(\"home\")", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nh=str(input())\r\np=0\r\nfor i in range(n):\r\n s=str(input())\r\n if s[0:3]==h:p+=1\r\n else:\r\n p-=1\r\nif p>0:print(\"contest\")\r\nelse:\r\n print(\"home\")", "n = int(input())\r\ns = input()\r\ngo=re=0\r\nfor i in range(n):\r\n a,b = input().split('->')\r\n if a==s:\r\n go+=1\r\n elif b==s:\r\n re+=1\r\nif go==re:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\nstart = input()\r\nret = 0\r\ngo = 0\r\n\r\nfor i in range(n):\r\n s = input().split(\"->\")\r\n if s[0] == start:\r\n go += 1\r\n elif s[1] == start:\r\n ret += 1\r\n\r\nif ret >= go:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n \r\n", "if int(input()) % 2 == 1:\n print('contest')\nelse:\n print('home')\n\t \t\t\t \t\t \t\t\t\t\t \t \t\t \t\t\t \t \t", "n = int(input())\nhome = input()\nrex = 0\nwhile n:\n n -= 1\n a, b = input().split('->')\n if a == home:\n rex += 1\n if b == home:\n rex += 1\nprint('contest' if rex % 2 else 'home')", "def main():\n print(('home', 'contest')[int(input()) & 1])\n\n\nif __name__ == '__main__':\n main()\n", "x=int(input())\r\nfor i in range(x+1):\r\n\ty=input()\r\nprint(['home','contest'][x%2])", "n = int(input())\r\nh = input()\r\nd_count = 0\r\nfor i in range(n):\r\n d, a = input().split('->')\r\n if d == h:\r\n d_count += 1\r\n elif a == h:\r\n d_count -= 1\r\nif d_count == 0:\r\n ans = 'home'\r\nelif d_count == 1:\r\n ans = 'contest'\r\nprint(ans)\r\n", "n = int(input())\r\nhome = input()\r\n\r\ns1 = list()\r\ns2 = list()\r\nfor i in range(n):\r\n s = input()\r\n if s[:3] == home:\r\n s1.append(s[5:])\r\n else:\r\n s2.append(s[:3])\r\n\r\nif len(s1)!=len(s2):\r\n print(\"contest\")\r\n exit(0)\r\ns1.sort()\r\ns2.sort()\r\nif s1==s2:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "# http://codeforces.com/contest/765/problem/A\n# http://codeforces.com/contest/765/problem/B\n# http://codeforces.com/contest/765/problem/C\n\ndef Neverending_competitions():\n n = int(input())\n home = input()\n for i in range(n):\n new = input()\n if n % 2 == 0:\n return \"home\"\n else:\n return \"contest\"\nprint(Neverending_competitions())", "from collections import defaultdict\r\n\r\nn = int(input())\r\ninput()\r\nd = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n x, y = input().split('->')\r\n d[x] += 1\r\n d[y] -= 1\r\n\r\nprint('home' if all(value==0 for value in d.values()) else 'contest')", "n = int(input())\r\nhome = input()\r\ncnt = 0\r\nfor i in range(n):\r\n a = input().split('->')\r\n cnt += (a[0] == home)\r\n cnt -= (a[1] == home)\r\nprint(('home', 'contest')[cnt])\r\n", "n=int(input())\r\ns=input()\r\ncnt=0\r\nfor i in range(0,n):\r\n s1=input()\r\n if s1[0]==s[0] and s1[1]==s[1] and s1[2]==s[2]:\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n\r\nif cnt==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "import re\r\nn=int(input())\r\nhome=input()\r\ncv=home\r\nl=[]\r\nfor x in range(n):\r\n l.extend(input().split('->'))\r\nfor x in range(n):\r\n for x in range(0,2*n-1,2):\r\n if re.match(cv,l[x]):\r\n cv=l[x+1]\r\n l[x]='0'\r\n l[x+1]='0'\r\n break;\r\nif re.match(cv,home):\r\n print('home')\r\nelse:\r\n print('contest')\r\n", "n=int(input())\r\nhome=input()\r\na=[];b=[];c=[]\r\nfor i in range(n):\r\n a+=[input().split('->')]\r\nfor i in range(n):\r\n b+=[a[i][1]]\r\n c+=[a[i][0]]\r\nx=c.count(home)\r\ny=b.count(home)\r\nif y==x:\r\n print('home')\r\nelse:\r\n print('contest')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x = int(input())\r\na = input()\r\nif x%2 == 0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")", "n = int(input().strip())\r\nhome = input().strip()\r\ns = set()\r\nfor i in range(n):\r\n a = input().strip()\r\n if a[:3] == home:\r\n b = a[5:8]\r\n else:\r\n b = a[:3]\r\n if b not in s:\r\n s.add(b)\r\n else:\r\n s.remove(b)\r\nprint(\"home\" if len(s) == 0 else \"contest\")\r\n", "a=int(input())\r\ntemp=input()\r\nfor i in range(a):\r\n str=input()\r\nprint([\"home\",\"contest\"][a%2])", "n = int(input().strip())\r\nl = 0\r\nk = input().strip()\r\nfor i in range(n):\r\n j = input().strip()\r\n if '->' + k in j:\r\n l += 1\r\n else:\r\n l -= 1\r\nif l == 0:\r\n print('home')\r\nelse:\r\n print('contest')", "n=int(input())\r\nprint('home' if n%2==0 else 'contest')", "n = int(input())\r\nhome = input()\r\nl, r = 0, 0\r\nfor _ in range(n):\r\n trav = input().split(\"->\")\r\n if trav[0] == home:\r\n l += 1\r\n if trav[-1] == home:\r\n r += 1\r\nif l == r:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "print('choonmtee s t'[1-int(input())%2::2])\r\n", "n=int(input())\r\ns=input()\r\nx=1\r\nfor i in range(n):\r\n x=input()\r\nif n%2==0:print('home')\r\nelse:print('contest')\r\n\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\ncnt1, cnt2 = 0, 0\r\nfor i in range(n):\r\n t = input()\r\n if s == t[:3]:\r\n cnt1 += 1\r\n elif s == t[5:8]:\r\n cnt2 += 1\r\nprint('home' if cnt1 == cnt2 else 'contest')\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nn = int(input())\r\nh = input()\r\nif n%2 == 0:\r\n print('home')\r\nelse:\r\n print('contest')\r\n\r\n", "n=int(input())\r\nprint(\"contest\" if n%2 else \"home\")", "#!/bin/python3\r\n\r\nimport sys\r\ndict = {}\r\nn = int(input())\r\nhome = input()\r\nfor i in range(n):\r\n line = input();\r\n dep = line[0:3]\r\n if dep != home:\r\n if dep in dict:\r\n dict[dep] -= 1\r\n else:\r\n dict[dep] = -1\r\n else:\r\n dep = line[5:]\r\n if dep in dict:\r\n dict[dep] += 1\r\n else:\r\n dict[dep] = 1\r\nfor key in dict:\r\n if dict[key] > 0:\r\n print(\"contest\")\r\n sys.exit()\r\nprint(\"home\")", "n = int(input())\r\nbase = input()\r\narr = []\r\nfor i in range(n):\r\n a , b = input().split('->')\r\n arr.append([a , b])\r\n\r\norder = [base]\r\n\r\nfor i in range(n):\r\n for x,j in arr:\r\n if x == order[-1]:\r\n order.append(j)\r\n arr.remove([x,j])\r\n\r\nif order[-1] == base: print(\"home\")\r\nelse: print(\"contest\")", "n = int(input())\r\nstart = input()\r\nempty_array = []\r\nfor i in range(n):\r\n flights = input()\r\n flights = flights.split('->')\r\n empty_array.append(flights)\r\n\r\n\r\ngoes_back = []\r\ngoes_to = []\r\n\r\nfor i in range(len(empty_array)):\r\n if (empty_array[i])[1] == start:\r\n goes_back.append((empty_array[i])[0])\r\n if (empty_array[i])[0] == start:\r\n goes_to.append((empty_array[i])[1])\r\n\r\nif len(goes_to) != len(goes_back):\r\n print('contest')\r\nelse:\r\n print('home')", "# 19:38\nn = int(input())\nhome = str(input())\naway = 0\ninto = 0\nfor i in range(n):\n\tflight = input().split('->')\n\tif flight[0] == home:\n\t\taway += 1\n\telse:\n\t\tinto += 1\nif away > into:\n\tprint('contest')\nelse:\n\tprint('home')", "n=int(input())\r\nh=input()\r\nc1,c2=0,0\r\nfor i in range(n):\r\n x,y=input().split('->')\r\n if x==h:\r\n c1=c1+1\r\n elif y==h:\r\n c2=c2+1\r\nif c1==c2:\r\n print('home')\r\nelse:\r\n print('contest')", "n=int(input())\r\nhome=input()\r\nls=[]\r\ncnt=0\r\nfor i in range(n):\r\n\tstr1=input()\r\n\tif str1.find(home)>=0:\r\n\t\tcnt+=1\r\nif cnt==n and cnt%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")\r\n", "n = int(input())\r\nh = input()\r\nfor i in range(n):\r\n l = input()\r\nprint([\"home\",\"contest\"][n%2])", "n=int(input())\r\nif n%2==0: print('home')\r\nelse: print('contest')", "n = int(input())\r\nh = input()\r\nf = ['']*n\r\nfor i in range(n):\r\n f[i] = input()\r\nprint('home' if n % 2 == 0 else 'contest')\r\n", "n = int(input())\nhome = input()\nflights = []\n\nfor i in range(n):\n f, t = input().split('->')\n if (t, f) in flights:\n flights.remove((t, f))\n else:\n flights.append((f, t))\n\nprint('home' if len(flights) == 0 else 'contest')\n", "n=int(input())\r\na=input()\r\nc=0\r\nfor i in range(n):\r\n b=input()\r\n if a in b:\r\n c+=1\r\nif c%2==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\nprint([\"contest\",\"home\"][n % 2 == 0])\r\n", "n = int(input())\r\nprint(\"home\" if n % 2 == 0 else \"contest\")\r\n", "print('contest'if int(input()) % 2 else'home')", "n=int(input())\nh=input()\nd=dict()\nfor x in range(0,n):\n j=input()\n jj=j.split(\"->\")\n k=jj[1]+\"->\"+jj[0]\n if k in d.keys():\n d[k] -= 1\n else:\n if j in d.keys():\n d[j] += 1\n else:\n d[j]=1\ne = list(filter(lambda x: x != 0, d.values()))\nprint(\"home\" if len(e) == 0 else \"contest\")\n", "n=int(input())\r\na={0:\"home\",1:\"contest\"}\r\nprint(a[n%2])", "n = int(input())\r\n\r\nhome = input()\r\n\r\nfligths = []\r\n\r\nfor i in range (n):\r\n x = input().split(\"->\")\r\n fligths.append(x[0])\r\n fligths.append(x[1])\r\n \r\n\r\nif (fligths.count(home) % 2 ):\r\n print (\"contest\")\r\nelse:\r\n print (\"home\")", "t = int(input())\r\n\r\nif t % 2 == 1:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")", "n = int(input())\r\nb = input()\r\nx1 = []\r\nx2 = []\r\nresult = 0\r\nfor i in range(0, n):\r\n text = input()\r\n x1.append(text.split(\"->\")[0])\r\n x2.append(text.split(\"->\")[1])\r\nx1.sort()\r\nx2.sort()\r\nif x1 == x2:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n=int(input())\r\nl=str(input())\r\nm=[]\r\ncount=0\r\nfor i in range(n):\r\n\ta=list(input())\r\n\tm.append(a)\r\n\tp=m[i][0:3]\r\n\th=\"\".join(p)\r\n\tx=m[i][5:9]\r\n\ts=\"\".join(x)\r\n\tif h==l:\r\n\t\tcount+=1\r\n\tif s==l:\r\n\t\tcount+=1\r\nif count%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")", "n=int(input())\r\nh=input()\r\nfor i in range (n):\r\n\tl=input()\r\nif(n%2==0):\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")", "n=int(input())\r\nhome=input()\r\ncur=0\r\nfor i in range(n):\r\n ticket=input()\r\n if home==ticket[:3]:\r\n cur+=1\r\nif (n-cur)>=cur:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "n = int(input())\nhome = input()\naux = 0\n\nwhile(n>0):\n\tida, volta = input().split('->')\n\tif(ida==home):\n\t\taux+=1\n\telif volta==home:\n\t\taux-=1\n\tn-=1 \n\t\nif aux!=0:\n\tprint('contest')\nelse:\n\tprint('home')\n\n \n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndepart = input().rstrip()\r\ndata = [input().rstrip() for _ in range(n)]\r\n\r\nprint(\"home\" if n % 2 == 0 else \"contest\")", "n=int(input())\r\nhome=input()\r\na=[]\r\nfor i in range(n):\r\n a+=[input().split('->')]\r\nif n%2==0:\r\n print('home')\r\nelse:\r\n print('contest')\r\n\r\n\r\n\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\na=str(input())\r\nh=0\r\nc=0\r\nfor i in range(n):\r\n\tx=str(input())\r\n\tif a==x[:3]:\r\n\t\th=h+1\r\n\tif a==x[5:]:\r\n\t\tc=c+1\t\r\nif h>c:\r\n\tprint(\"contest\")\r\nelse:\r\n\tprint(\"home\")", "n = int(input())\nh = input()\ng = 0\nb = 0\nfor i in range(0, n):\n s, e = input().split(\"->\")\n if s == h:\n g += 1\n if e == h:\n b += 1\nprint([\"home\", \"contest\"][g > b])\n", "num = eval(input())\r\nhome = input()\r\nstartPlace = []\r\narrivePlace = []\r\nfor i in range(num):\r\n line = list(input())\r\n startPlace.append(''.join(line[0:3]))\r\n arrivePlace.append(''.join(line[5:9]))\r\na = startPlace.count(home)\r\nb = arrivePlace.count(home)\r\nif a == b:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "list1=[]\nlist2=[]\ncount1=0\ncount2=0\nn=int(input())\nhome=input()\nfor i in range(0,n):\n s=input()\n names = s.split(\"->\")\n list1.append(names[0])\n list2.append(names[1])\nfor item in list1:\n if item==home:\n count1=count1+1\nfor item in list2:\n if item==home:\n count2=count2+1\nif(count1==count2):\n print(\"home\")\nelse:\n print(\"contest\")\n \t\t\t \t \t \t\t\t \t\t\t \t\t\t\t", "n = int(input())\r\nhome_airport = input()\r\nitinerary = [input() for i in range(n)]\r\n\r\nprint('home') if n % 2 == 0 else print('contest')\r\n", "n = int(input()); a = str(input())\r\nfor i in range(n): c,b = map(str,input().split(\"->\"))\r\nif n % 2 == 0: print(\"home\")\r\nelse: print(\"contest\")", "n=int(input())\r\ns=input()\r\nl=[]\r\nfor i in range(n):\r\n\tt=input()\r\n\tl.append(t[:3])\r\n\tl.append(t[5:])\r\nc=l.count(s)\r\nif c%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")\t", "n = int(input())\r\nprint((\"home\", \"contest\")[n%2])", "x=int(input())\r\nif x%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")", "print(\"home\") if int(input()) & 1 == 0 else print(\"contest\")", "n=int(input())\r\ns=input()\r\nc1=c2=0\r\nfor i in range(n):\r\n k=input().split('->')\r\n if k[0]==s:\r\n c1+=1\r\n elif k[1]==s:\r\n c2+=1\r\nif c1==c2 and c1==n//2 and n%2==0:\r\n print(\"home\")\r\nelse:print(\"contest\")\r\n ", "n = int(input())\r\n\r\nhometown = input()\r\nmatx = []\r\nfor i in range(n):\r\n matx.append(input())\r\n\r\nif n % 2 == 0:\r\n print('home')\r\nelse:\r\n print('contest')", "n = int(input())\r\ns = input()\r\nc = 0\r\nfor i in range(n):\r\n\tmass = input()\r\n\tmass = mass.split(\"->\")\r\n\tif s in mass:\r\n\t\tc+=1\r\nif(not (c % 2)):\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\") ", "from collections import defaultdict\r\ndef solve(h,l):\r\n c1,c2=0,0\r\n for i,j in l:\r\n if(i==h):\r\n c1+=1\r\n else:\r\n c2+=1\r\n if(c1==c2):\r\n return \"home\"\r\n else:\r\n return \"contest\"\r\nn = int(input())\r\nh = input()\r\nl = []\r\nfor i in range(n):\r\n l.append(input().split('->'))\r\nprint(solve(h,l))\r\n \r\n", "print('home' if int(input()) % 2 is 0 else 'contest')", "n = int(input())\r\nhome = input()\r\nflights = []\r\nf_h = 0 \r\nf_nh = 0\r\nfor i in range(n):\r\n lst = input().split(\"->\")\r\n if lst[0] == home:\r\n f_h += 1\r\n elif lst[-1] == home:\r\n f_nh += 1\r\n\r\nprint(\"home\" if f_h == f_nh else \"contest\")", "n=int(input())\r\ns=input()\r\nl=[]\r\nfor _ in range(n):\r\n l.append(input())\r\nres=\"home\"\r\nif(n%2!=0):\r\n res=\"contest\"\r\nprint(res)\r\n \r\n", "N, home = int(input()), input()\nprint('home' if [item for middle in [input().split('->') for i in range(N)] for item in middle].count(home) % 2 == 0 else 'contest')\n", "t=int(input())\r\ns=input()\r\nfor _ in range(t):\r\n k = input().split('->')\r\nif t&1:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn = I()\r\nhome = S()\r\nprint(\"contest\" if n%2 else \"home\")", "n=int(input())\r\nhome=input()\r\nd=[]\r\na=[]\r\nfor x in range(n):\r\n b=input()\r\n d.append(b[0:3])\r\n a.append(b[5:8])\r\np=home\r\nfor y in range(n):\r\n p=a[d.index(p)]\r\nif(p==home):\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\ns = input()\nflights = []\nfor i in range(n):\n flights.append(input())\nif n % 2 == 0:\n print(\"home\")\nelse:\n print(\"contest\")\n", "n = int(input())\r\nh = input()\r\ntl = [input() for _ in range(n)]\r\nprint('home' if n%2==0 else 'contest')\r\n", "n=int(input())\r\nh = input()\r\n\r\nm={}\r\nfor i in range(n):\r\n s,e = input().split(\"->\")\r\n if s not in m:\r\n m[s] = [e]\r\n else:\r\n m[s] += [e]\r\n\r\ncurD = h\r\nwhile curD in m:\r\n pre = curD\r\n curD = m[curD][-1]\r\n m[pre].pop()\r\n if m[pre] == []:\r\n del m[pre]\r\n\r\nif curD != h:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")\r\n ", "p=int(input())\r\ncomp=input()\r\nnever=[]\r\nwhile p>0:\r\n p1,p2=input().split(\"->\")\r\n never.append(p1)\r\n never.append(p2)\r\n p=p-1\r\nk=0\r\nfor i in never:\r\n if i ==comp:\r\n k=k+1\r\nif k%2==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n ", "n = int(input())\r\na = input()\r\nfor i in range(n):\r\n\tb = input().split(\"->\")\r\nif n%2==0:print(\"home\")\r\nelse:print(\"contest\")", "num = eval(input())\r\nhome = input()\r\nstartPlace = []\r\narrivePlace = []\r\nfor i in range(num):\r\n line = list(input())\r\n startPlace.append(''.join(line[0:3]))\r\n arrivePlace.append(''.join(line[5:9]))\r\nif num % 2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\nhome = input()\nc=0\nfor i in range (0,n):\n travel = input()\n frm =travel.split(\"->\")[0]\n to = travel.split(\"->\")[1]\n if(frm ==home or to==home):\n c+=1\n \nif (c%2==0):\n print(\"home\")\nelse:\n print (\"contest\")\n\n\n", "from collections import defaultdict\r\nn=int(input())\r\nh=str(input())\r\nd=defaultdict(int)\r\n\r\nfor i in range(n):\r\n arr,dep=input().split(\"->\")\r\n d[arr]=d[arr]-1\r\n d[dep]=d[dep]+1\r\n\r\nif d[h]==0:\r\n print('home')\r\nelse:\r\n print('contest')\r\n\r\n", "n = int(input())\r\nhome = input()\r\nhave = dict()\r\nfor _ in range(n):\r\n var = input()\r\n a = var[0:3]\r\n b = var[len(var)-3:]\r\n if a in have : \r\n have[a] += 1\r\n else :\r\n have[a] = 1\r\n if b in have :\r\n have[b] += 1\r\n else :\r\n have[b] = 1\r\nans = 1\r\nfor i,j in have.items() :\r\n if j&1 :\r\n ans = 0\r\nif ans :\r\n print(\"home\")\r\nelse :\r\n print(\"contest\")", "import sys\r\nfrom itertools import *\r\nfrom cmath import *\r\n\r\n# input = sys.stdin.readline\r\nfrom math import *\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input().strip())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\ndef iss(s):\r\n t = s[::-1]\r\n return t == s\r\n\r\n\r\nn = inp()\r\nhome = str(input())\r\ncurr = home\r\nflight = []\r\nfor _ in range(n):\r\n s = str(input())\r\n flight.append(s)\r\narr=[]\r\nfor i in range(n):\r\n tmp=flight[i][5:]+\"->\"+flight[i][:3]\r\n if tmp not in arr:\r\n arr.append(flight[i])\r\n else:\r\n arr.remove(tmp)\r\n\r\nprint(\"home\" if len(arr)==0 else \"contest\")", "tam = int(input())\r\nhome = input()\r\n\r\nfor i in range(tam):\r\n input()\r\n\r\nif tam % 2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "#here are literally dozens of snooker competitions held each year, and team\n#Jinotega tries to attend them all (for some reason they prefer name \"snookah\")!\n#When a competition takes place somewhere far from their hometown, Ivan, Artsem and\n#Konstantin take a flight to the contest and back.\n#\n#Jinotega's best friends, team Base have found a list of their itinerary receipts\n#with information about departure and arrival airports. Now they wonder, where is\n#Jinotega now: at home or at some competition far away? They know that:\n#\n#this list contains all Jinotega's flights in this year (in arbitrary order),\n#Jinotega has only flown from his hometown to a snooker contest and back,\n#after each competition Jinotega flies back home (though they may attend a\n#competition in one place several times),\n#and finally, at the beginning of the year Jinotega was at home.\n#Please help them to determine Jinotega's location!\n#\n#Input\n#In the first line of input there is a single integer n: the number of Jinotega's\n#flights (1 ≤ n ≤ 100). In the second line there is a string of 3 capital Latin\n#letters: the name of Jinotega's home airport. In the next n lines there is flight\n#information, one flight per line, in form \"XXX->YYY\", where \"XXX\" is the name of\n#departure airport \"YYY\" is the name of arrival airport. Exactly one of these\n#airports is Jinotega's home airport.\n#\n#It is guaranteed that flights information is consistent with the knowledge of\n#Jinotega's friends, which is described in the main part of the statement.\n#\n#Output\n#If Jinotega is now at home, print \"home\" (without quotes), otherwise print\n#\"contest\".\n\n# solution: keep a dictionary of places they fly to\n# key: airport code\n# when we read a flight, if it;s outgoing, increase the value by one\n# if it's ingoing, decrease by one\n# if value is zero, remove key value pair from dictionary\n# in the end, check if dictionary is empty\n# alternatively, don't remove, and check if all values are zero (cheaper?)\n\nnumber_of_flights = int(input())\n\noutput = 'contest' if number_of_flights%2 else 'home'\n\nfor _ in range(number_of_flights + 1):\n input()\n\nprint(output)\n", "n = int(input())\r\nhome = input()\r\nflights = [input().split('->') for _ in range(n)]\r\nreturn_home = 0\r\nfor flight in flights:\r\n if flight[0] == home:\r\n return_home += 1\r\n if flight[1] == home:\r\n return_home -= 1\r\nprint('home' if return_home == 0 else 'contest')", "n = int(input())\r\nst = str(input())\r\nl = [input().split('->') for i in range(n)]\r\nl1 = list(l[i][0] for i in range(len(l)))\r\nl2 = list(l[i][1] for i in range(len(l)))\r\nll=list(l1+l2)\r\nc=0\r\nfor i in ll:\r\n if st==i:\r\n c+=1\r\n\r\nif c==n and c%2==0:\r\n print('home')\r\nelse:\r\n print('contest')", "n = int(input())\nhome = input()\ncount = 0\nfor _ in range(n):\n\ts = input()\n\tcount += (-1 if s[0:3] == home else 1)\n\nprint(\"home\" if count == 0 else \"contest\")\n", "n = int(input())\r\nhome = input()\r\nplace = {}\r\nfor _ in range(n):\r\n s = input()\r\n if s[0:3] not in place:\r\n place[s[0:3]] = 1\r\n else:\r\n place[s[0:3]] += 1\r\n if s[5:8] not in place:\r\n place[s[5:8]] = 1\r\n else:\r\n place[s[5:8]] += 1\r\n\r\nif place[home] % 2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "__author__ = \"Ryabchun Vladimir\"\nflights = int(input())\nhome = input().strip()\nfor _ in range(flights):\n fl = input()\nif flights % 2 == 0:\n print(\"home\")\nelse:\n print(\"contest\")", "n=int(input())\r\nh=str(input())\r\nl=[]\r\ncount=0\r\nfor i in range(n):\r\n c=str(input())\r\n l.append(c)\r\nif len(l)%2==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\nh = str(input())\r\nto = 0\r\nfr = 0\r\nfor i in range(n):\r\n s, t = map(str, input().split('->'))\r\n if s == h:\r\n fr += 1\r\n else:\r\n to += 1\r\n\r\nif fr == to:\r\n print('home')\r\nelse:\r\n print('contest')\r\n", "n = int(input())\r\ns = input()\r\nfor _ in range(n):\r\n string = input()\r\nif n%2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "if __name__ == '__main__':\r\n n = int(input())\r\n print(('home', 'contest')[n % 2])\r\n", "print('hcoomnet e s t'[int(input())%2::2])", "n = int(input())\nhome = input()\none, two = 0, 0\nfor i in range(n):\n x = list(input().split('->'))\n if x[0] == home:\n one += 1\n elif x[1] == home:\n two += 1\nif one == two:\n print('home')\nelse:\n print('contest')\n", "n=int(input())\r\nhome=input()\r\nf={}\r\nfor i in range(n):\r\n l=list(input().split('->'))\r\n if l[0] in f:\r\n f[l[0]]+=1\r\n else:\r\n f[l[0]]=1\r\n if l[1] in f:\r\n f[l[1]]+=1\r\n else:\r\n f[l[1]]=1\r\nans=\"home\"\r\nfor i in f:\r\n if(f[i]%2==1 and i!=home):\r\n ans=\"contest\"\r\n break\r\nprint(ans)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-22 23:29:43\nLastEditTime: 2021-11-22 23:31:44\nDescription: Neverending competitions\nFilePath: CF765A.py\n'''\n\n\ndef func():\n n = int(input())\n home = input().strip()\n for _ in range(n):\n a, b = input().strip().split(\"->\")\n print(\"home\" if n % 2 == 0 else \"contest\")\n\n\nif __name__ == '__main__':\n func()\n", "print('home' if int(input())%2==0 else 'contest')", "t = int(input())\r\nhome = input()\r\noutbound = 0\r\ninbound = 0\r\nfor x in range(t):\r\n l1 = input().split(\"->\")\r\n if l1[0]==home:\r\n outbound+=1\r\n else:\r\n inbound+=1\r\nif inbound==outbound:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "\r\n\r\ndef main_function():\r\n n = int(input())\r\n home = input()\r\n flights = [input() for i in range(n)]\r\n if not n % 2:\r\n return \"home\"\r\n return \"contest\"\r\n\r\n\r\n\r\n\r\nprint(main_function())", "\r\nimport sys\r\n\r\nraw_data = list()\r\n\r\nfor line in sys.stdin:\r\n raw_data.append(line)\r\n\r\nnr = int(raw_data[0])\r\nhome = raw_data[1][0:3]\r\ndept = list()\r\ndest = list()\r\n\r\nfor idx in range(2, 2 + nr):\r\n dept.append(raw_data[idx][0:3])\r\n dest.append(raw_data[idx][5:8])\r\n\r\nnxt = home\r\ncnt = 0\r\n\r\nwhile cnt != nr:\r\n try:\r\n idx = dept.index(nxt)\r\n nxt = dest[idx]\r\n last = nxt\r\n except:\r\n break\r\n dept[idx] = ''\r\n cnt += 1\r\n\r\nif cnt == nr and last == home:\r\n print('home')\r\nelse:\r\n print('contest')\r\n", "n = int(input())\r\nhome = input()\r\na = []\r\nfor _ in range(n):\r\n a.append(input().split('->'))\r\nc1 = 0\r\nc2 = 0\r\nfor i in a:\r\n if i[0] == home:\r\n c1 += 1\r\n elif i[1] == home:\r\n c2 += 1\r\nif c1 > c2:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")", "# 900\r\nn = int(input())\r\nhl = input()\r\ncontest = 0\r\nfor _ in range(n):\r\n flight = input()\r\n x = flight.find(hl, 0, 3)\r\n if x == 0:\r\n contest -= 1\r\n else:\r\n contest += 1\r\nif contest == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n\r\n# _\r\n# _._ _..._ .-', _.._(`))\r\n# '-. ` ' /-._.-' ',/\r\n# ) \\ '.\r\n# / _ _ | \\\r\n# | a a / |\r\n# \\ .-. ;\r\n# '-('' ).-' ,' ;\r\n# '-; | .'\r\n# \\ \\ /\r\n# | 7 .__ _.-\\ \\\r\n# | | | ``/ /` /\r\n# /,_| | /,_/ /\r\n# /,_/ '`-'\r\n", "n=int(input())\r\nz=input()\r\na=\"\"\r\nfor i in range(n):\r\n c=input()\r\n a+=c\r\nif n%2==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "print(\"home\" if int(input()) % 2 == 0 else \"contest\")", "t=int(input())\r\ns=input()\r\ncnt1 = 0\r\ncnt2 = 0\r\n\r\nfor i in range(t):\r\n s1=input()\r\n p1=s1[:3]\r\n p2=s1[5:]\r\n\r\n if(p1==s):\r\n cnt1=cnt1+1\r\n else:\r\n cnt2= cnt2+1\r\n\r\nif(cnt1==cnt2):\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n\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\nhome = input()\r\ncnt=0\r\nx = []\r\n\r\nwhile n>0:\r\n s,t = input().split(\"->\")\r\n x.append(s)\r\n x.append(t)\r\n n-=1\r\n\r\nfor i in x:\r\n if i==home:\r\n cnt+=1\r\n\r\nif cnt%2==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "i = int(input())\r\ninput()\r\nfor _ in range(i): input()\r\n\r\nif i % 2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\n\r\nhome = str(input())\r\nflights = []\r\nfor i in range(n):\r\n flights.append(input())\r\n\r\nif(n%2 == 0):\r\n print('home')\r\nelse:\r\n print('contest')", "# https://codeforces.com/problemset/problem/765/A\n# 900\n\nn = int(input())\nh = input()\n\nfn = 0\ntn = 0\nfor _ in range(n):\n f, t = input().split(\"->\")\n\n if f == h:\n fn += 1\n elif t == h:\n tn += 1\n\nif fn == tn:\n print(\"home\")\nelse:\n print(\"contest\")", "n = int(input())\nif n & 1:\n\tprint(\"contest\")\n\texit()\nprint(\"home\")\n", "n = int(input())\r\ns = input()\r\nx, y = 0, 0\r\nfor i in range(n):\r\n w = input()\r\n a = w[:3]\r\n if a == s:\r\n x += 1\r\n else:\r\n y += 1\r\nif x == y:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\ns = input()\r\nfor t in range(n):\r\n s = input()\r\nif n % 2 == 0:\r\n print('home')\r\nelse:\r\n print('contest')", "n = int(input())\r\nht = input()\r\nt = 0\r\n#l = l.append(input())\r\n\r\nfor _ in range(n):\r\n l = input() \r\n if l[0:3] == ht:\r\n t-=1\r\n else:\r\n t+=1\r\n\r\nprint(['home','contest'][t < 0])", "a = int(input())\r\nif a%2:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")", "n=int(input())\r\ns=input()\r\nz,count=[],0\r\nfor _ in range(n):\r\n\tz.append(input().strip().split('->'))\r\nfor x in range(n):\r\n\tif z[x][0]==s or z[x][1]==s:count+=1\r\nif count%2==0:print('home')\r\nelse:print('contest')", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn = int(input())\r\ns = input()\r\nfor i in range(n):\r\n input()\r\nans = (n+1) % 2\r\nprint(\"home\" * ans + \"contest\" * (1-ans))\r\n", "n=int(input())\r\nh=input()\r\na=[]\r\nwhile n>0:\r\n s,t= input().split(\"->\")\r\n a.append(s)\r\n a.append(t)\r\n n-=1\r\nc=0\r\nfor i in a:\r\n if i==h:\r\n c+=1\r\nif c%2==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "import sys\r\ndef main():\r\n\tn=int(input())\r\n\tcnt = 0\r\n\tsrc=input().strip()\r\n\tfor i in range(n):\r\n\t\tnodes=input().strip().split('->')\r\n\t\tif nodes[0]==src or nodes[1]==src:\r\n\t\t\tcnt+=1;\r\n\tif cnt%2==0:\r\n\t\tprint('home')\r\n\telse:\r\n\t\tprint('contest')\r\nif __name__ == '__main__':\r\n\tmain()", "F = int(input())\r\n \r\nif(F%2 == 0): print(\"home\")\r\nelse: print(\"contest\")\r\n", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\ndef ri():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn = int(input())\nfor i in range(n+1):\n s = input()\n\nif n%2:\n print(\"contest\")\nelse:\n print(\"home\")\n", "# -*- coding: utf-8 -*-\r\nn = int(input())\r\nh = input()\r\nl = []\r\nv = 0\r\np = 0\r\nfor i in range(n):\r\n vc, pc = input().split('->')\r\n if vc == h: v += 1\r\n elif pc == h: p += 1\r\nif v==p: print(\"home\")\r\nelse: print(\"contest\")\r\n", "n = int(input())\nhome = input()\ncnt = 0\nfor i in range(n):\n\tx = input().split('->')\n\tcnt += x.count(home)\n\na = ['home', 'contest']\nprint(a[cnt%2])", "arr = []\r\nn = int(input())\r\nhome = input()\r\nfor i in range(n):\r\n arr.append(input().split('->'))\r\nif sorted([i[0] for i in arr]) == sorted([i[1] for i in arr]):\r\n print('home')\r\nelse:\r\n print('contest')", "num = int(input())\r\ninput()\r\nfor i in range(0,num,1):\r\n\tinput()\r\nif num % 2 == 1:\r\n\tprint('contest')\r\nelse:\r\n\tprint('home')", "n = int(input())\r\nhome = str(input())\r\nleft = 0\r\nright = 0\r\nfor i in range(n):\r\n s = str(input())\r\n start, dest = s.split('->')\r\n\r\n if(start == home):\r\n left += 1\r\n\r\n if(dest == home):\r\n right += 1\r\n\r\n\r\n# print(dest)\r\nif(left == right):\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "n = int(input())\r\nif n%2==0:print(\"home\")\r\nelse:print(\"contest\")", "if int(input())%2==0:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")", "n=int(input())\r\ns=input()\r\nfor _ in range (n) :\r\n\ts=input\r\nprint('contest' if n%2 else 'home')", "# print(\"Input n\")\nn = int(input())\n\nif n%2 == 0:\n print(\"home\")\nelse:\n print(\"contest\")\n", "n=int(input())\ns=input()\nfor _ in range (n) :\n\ts=input\nprint('contest' if n%2 else 'home')\n \t\t\t \t\t\t \t\t \t\t \t \t\t\t\t\t\t\t\t\t\t", "no_flights = int(input())\n\nhome = input()\n\nflights = [input().split(\"- >\") for i in range(no_flights)]\n\nif no_flights % 2 == 0 :\n print(\"home\")\nelse :\n print(\"contest\")\n", "c = int(input())\r\ns= str(input())\r\nt=''\r\nfor i in range(c):\r\n t=t+str(input())\r\n\r\nx= t.count(s)\r\nif x%2==0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\ns = input()\r\na = [input() for i in range(n)]\r\nif n % 2 == 0:\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "print([\"home\",\"contest\"][int(input())%2==1])", "a = int(input())\r\nfor i in range(a+1):\r\n input()\r\n\r\nif a%2 == 0:\r\n print('home')\r\nelse:\r\n print('contest')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nu = input().rstrip().decode()\r\ncnt = 0\r\nfor _ in range(n):\r\n x, y = input().rstrip().decode().split(\"->\")\r\n if x == u:\r\n cnt += 1\r\n if y == u:\r\n cnt -= 1\r\nans = \"home\" if not cnt else \"contest\"\r\nprint(ans)", "# cook your dish here\r\n\r\ndays = int(input())\r\nhome_address = input() \r\nroute = []\r\n\r\nfor each in range(days):\r\n route.append(list( map(str,input().split(\"->\"))))\r\n\r\nif(days%2==0):\r\n \r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n\r\n\r\n\r\n", "print('contest' if int(input()) & 1 else 'home')", "t = int(input())\r\ns = input()\r\nfor _ in range(t):\r\n input()\r\nprint('home'if t % 2 == 0 else 'contest')\r\n", "t= int(input())\r\na=input()\r\nbal=0\r\nfor _ in range(t):\r\n b=input().split('->')\r\n if(b[0]==a):\r\n bal+=1\r\n if(b[1]==a):\r\n bal-=1\r\nif(bal==0):\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\nf = input()\r\nh = [input() for i in range(n)]\r\nprint(['home','contest'][n%2])", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output1.out\",'w')\r\nn=int(input())\r\nh=input()\r\na=[input() for i in range(n)]\r\nflag=0\r\nx=0\r\nwhile x<len(a):\r\n\tp=a[x][-3:]+\"->\"+a[x][0:3]\r\n\tif p in a:\r\n\t\ta.remove(a[x])\r\n\t\ta.remove(p)\r\n\telse:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(\"contest\")\r\nelse:\r\n\tprint(\"home\")\t\t", "n = int(input())\r\ns = input()\r\nfor i in range(n):\r\n tmp = input()\r\nprint(\"home\") if n&1==0 else print(\"contest\")", "number = int(input())\r\nhome = input()\r\ntotal_out = 0\r\ntotal_in = 0\r\n\r\nfor _ in range(number):\r\n if input()[-3:] == home:\r\n total_in += 1\r\n else:\r\n total_out += 1\r\n \r\nprint(('contest', 'home')[total_in == total_out])", "n = int(input())\r\nha = str(input())\r\n\r\n\r\nfor _ in range(0,n):\r\n tl = str(input())\r\n\r\nif n % 2 == 0:\r\n print('home')\r\nelse:\r\n print('contest')", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n n = int(input())\r\n home = input()\r\n nout = 0\r\n nin = 0\r\n for i in range(n):\r\n s = input()\r\n src = s[0:3]\r\n dst = s[5:8]\r\n if src == home:\r\n nout += 1\r\n if dst == home:\r\n nin += 1\r\n if nout == nin:\r\n print('home')\r\n elif nout == nin + 1:\r\n print('contest')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\n\nh = input()\n\nd = 0\n\nfor i in range(n):\n\ta = input().split('->')\n\n\tif a[0] == h:\n\t\td += 1\n\n\tif a[1] == h:\n\t\td -= 1\n\nif d:\n\tprint(\"contest\")\nelse:\n\tprint(\"home\")", "n = int(input())\r\nhome = input()\r\nL = []\r\nfor i in range(n):\r\n L.append( input() )\r\n# print(home, L)\r\nif n%2 != 0:\r\n print(\"contest\")\r\nelse:\r\n print(\"home\")\r\n", "import math\r\nn=int(input())\r\nm=input();a=[]\r\nfor i in range(n):\r\n k,l=map(str,input().split('->'))\r\n a.append(l)\r\nif a.count(m)==math.ceil(n/2):print('home')\r\nelse:print('contest')", "l=[]\r\na=int(input())\r\nif a%2==1:print(\"contest\")\r\nelse:print(\"home\")", "n = int(input())\r\nhome = input()\r\ncoordinate = 0\r\nfor i in range(0,n):\r\n a = input()\r\n if (a[5]+a[6]+a[7]) == home:\r\n coordinate += 1\r\n else: \r\n coordinate -= 1\r\nif coordinate == 0:\r\n print('home')\r\nelse:\r\n print('contest')", "# n = int(input())\n# tn = [int(i) for i in input().split()]\n\n# def f(m):\n\n\n# m = 0\n# l = 0\n# r = n\n\n# while l < r:\n# m = (l + r)//2\n \n\nn = int(input())\nhome = input()\nleft = right = 0\n\nfor i in range(n):\n\tinp = input().split(\"->\")\n\tif inp[0] == home: left += 1\n\telif inp[1] == home: right += 1\n\nif left > right: print(\"contest\")\nelse: print(\"home\")", "n = int(input())\r\ntext = input()\r\nk = 0\r\nfor x in range(n):\r\n text1 = input()\r\n if text1[0:3] == text:\r\n k = k + 1\r\n else:\r\n k = k - 1\r\nif k == 0:\r\n print('home')\r\nelse:\r\n print('contest')\r\n", "#problem49\r\nn = int(input())\r\nh = input()\r\nfor i in range(n):\r\n l = input()\r\n\r\nif n%2 == 0:\r\n print('home')\r\nelse:\r\n print('contest') ", "n = int(input()) \r\ninput() \r\nfor i in range(n): \r\n input() \r\nprint('home' if n % 2 == 0 else 'contest')\r\n\r\n# ♥\r\n", "n = int(input())\r\nhome = input()\r\nflights = []\r\n\r\nfor i in range(n):\r\n flights += input().split('->')\r\n\r\nit = dict([i, 0] for i in set(flights)) \r\n\r\nfor i in flights:\r\n it[i] += 1\r\n\r\nflag = 0\r\nfor i in it:\r\n if it[i]%2 != 0:\r\n print('contest')\r\n flag = 1\r\n break\r\n \r\nif flag != 1:\r\n print('home')", "n = int(input())\r\ns = input()\r\nl = []\r\nfor i in range(n):\r\n\ta = input()\r\n\tl.append(a)\r\nif n%2!=0:\r\n\tprint(\"contest\")\r\nelse:print(\"home\")\t\t", "n = int(input())\r\nhome = input()\r\n\r\nberangkat = 0\r\ntujuan = 0\r\n\r\nfor i in range(n):\r\n inp = input().split('->')\r\n if (inp[0] == home):\r\n berangkat += 1\r\n if (inp[1] == home):\r\n tujuan += 1\r\n\r\nif (berangkat == tujuan):\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "a = int(input())\ninput()\nfor i in range(a):\n input()\nif a % 2 == 0:\n print(\"home\")\nelse:\n print(\"contest\")", "if int(input())%2==0: print('home')\r\nelse:\r\n print('contest')", "n = int(input())\r\na = input()\r\nq = []\r\nw = []\r\nfor i in range(n):\r\n\tb = input()\r\n\tl = b[:b.find('-')]\r\n\tr = b[b.find('>')+1:]\r\n\tq.append(l)\r\n\tw.append(r)\r\ne = q.count(a)\r\nt = w.count(a)\r\nif e == t:\r\n\tprint(\"home\")\r\nelse:\r\n\tprint(\"contest\")\r\n\r\n", "n = int (input())\r\nhome = str (input())\r\nL = []\r\ncount = 0\r\nfor i in range (n):\r\n g = str (input())\r\n L.append (g [0:3])\r\n L.append (g [5:8])\r\n#print (*L)\r\ncount = L.count (home)\r\n#print (count)\r\nif count % 2 == 0:\r\n print ('home')\r\nelse:\r\n print ('contest')", "a=int(input())\r\nb=input()\r\ns=0\r\nfor i in range(a):\r\n li=input().split(\"->\")\r\n if(li[0]==b):\r\n s+=1\r\n elif li[1]==b:\r\n s-=1\r\nif(s==0):\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")\r\n", "'''\nit is good if it is true.\nAnd if it is false,its bad\n'''\nimport sys\ntmp={}\nn=int(input())\nhome=input()\nfor i in range(n):\n s=input()\n if s[:3]==home:\n yy=s[:3]+s[5:]\n if tmp.get(yy,'?')=='?':\n tmp[yy]=1\n else:\n tmp[yy]+=1\n else:\n yy=s[5:]+s[:3]\n if tmp.get(yy,'?')=='?':\n tmp[yy]=-1\n else:\n tmp[yy]-=1\nfor i in tmp.values():\n if i!=0:\n print(\"contest\")\n sys.exit()\nprint(\"home\")\n", "list1=[]\r\nlist2=[]\r\ncount1=0\r\ncount2=0\r\nn=int(input())\r\nhome=input()\r\nfor i in range(0,n):\r\n s=input()\r\n names = s.split(\"->\")\r\n list1.append(names[0])\r\n list2.append(names[1])\r\nfor item in list1:\r\n if item==home:\r\n count1=count1+1\r\nfor item in list2:\r\n if item==home:\r\n count2=count2+1\r\nif(count1==count2):\r\n print(\"home\")\r\nelse:\r\n print(\"contest\")", "n = int(input())\r\nfor i in range(n+1):\r\n\tinput()\r\nprint(\"home\" if n%2==0 else \"contest\")" ]

[ "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n t = int(input())\r\n while t:\r\n run()\r\n t -= 1\r\n\r\n\r\ndef run():\r\n def check_condition_1():\r\n record = {}\r\n common, first, second = None, -1, -1\r\n found = False\r\n for i in range(3):\r\n for j in range(2):\r\n if segments[i][j] in record:\r\n if found:\r\n return False\r\n found = True\r\n common = segments[i][j]\r\n first, second = record[segments[i][j]], i\r\n else:\r\n record[segments[i][j]] = i\r\n if not found:\r\n return False\r\n\r\n segments[0], segments[first] = segments[first], segments[0]\r\n segments[1], segments[second] = segments[second], segments[1]\r\n if common != segments[0][0]:\r\n segments[0][0], segments[0][1] = segments[0][1], segments[0][0]\r\n if common != segments[1][0]:\r\n segments[1][0], segments[1][1] = segments[1][1], segments[1][0]\r\n\r\n nonlocal vector1, vector2, vector3, vector4\r\n vector1 = Vector2D(segments[0][0], segments[0][1])\r\n vector2 = Vector2D(segments[1][0], segments[1][1])\r\n vector3 = Vector2D(segments[0][0], segments[2][0])\r\n vector4 = Vector2D(segments[1][0], segments[2][1])\r\n if vector1.parallel(vector3):\r\n return vector2.parallel(vector4)\r\n else:\r\n vector3 = Vector2D(segments[0][0], segments[2][1])\r\n vector4 = Vector2D(segments[1][0], segments[2][0])\r\n return vector1.parallel(vector3) and vector2.parallel(vector4)\r\n\r\n def check_condition_2():\r\n return vector1.acute_or_perpendicular(vector2)\r\n\r\n def check_condition_3():\r\n return (0.2 <= vector1.dot_product(vector3) / vector1.distance_square() <= 0.8 and\r\n 0.2 <= vector2.dot_product(vector4) / vector2.distance_square() <= 0.8)\r\n\r\n segments = []\r\n for _i in range(3):\r\n temp = [int(x) for x in input().split()]\r\n segments.append([Point2D(temp[0], temp[1]), Point2D(temp[2], temp[3])])\r\n vector1, vector2, vector3, vector4 = None, None, None, None\r\n if check_condition_1() and check_condition_2() and check_condition_3():\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nclass Point2D:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\n def __eq__(self, other):\r\n return self.x == other.x and self.y == other.y\r\n\r\n def __ne__(self, other):\r\n return self.x != other.x or self.y != other.y\r\n\r\n def __hash__(self):\r\n return self.x + self.y * 31\r\n\r\n\r\nclass Vector2D:\r\n def __init__(self, p1, p2):\r\n self.x = p2.x - p1.x\r\n self.y = p2.y - p1.y\r\n\r\n def distance_square(self):\r\n return self.x ** 2 + self.y ** 2\r\n\r\n def __sub__(self, other):\r\n return Vector2D(self.x - other.x, self.y - other.y)\r\n\r\n def dot_product(self, other):\r\n return self.x * other.x + self.y * other.y\r\n\r\n def cross_product(self, other):\r\n return self.x * other.y - self.y * other.x\r\n\r\n def parallel(self, other):\r\n return self.cross_product(other) == 0\r\n\r\n def acute_or_perpendicular(self, other):\r\n return self.dot_product(other) >= 0 and not self.parallel(other)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "import sys; R = sys.stdin.readline\r\n\r\nfor _ in range(int(R())):\r\n dic = {}\r\n e = [[] for _ in range(6)]\r\n k = 0\r\n v = []\r\n for _ in range(3):\r\n x1,y1,x2,y2 = map(int,R().split())\r\n if (x1,y1) not in dic: dic[(x1,y1)] = k; v += (x1,y1),; k += 1\r\n if (x2,y2) not in dic: dic[(x2,y2)] = k; v += (x2,y2),; k += 1\r\n p,q = dic[(x1,y1)],dic[(x2,y2)]\r\n e[p] += q,; e[q] += p,\r\n if k!=5: print(\"NO\"); continue\r\n for i in range(5):\r\n if len(e[i])==2: a = i; break\r\n b,c = e[a][0],e[a][1]\r\n x1,y1 = v[a]; x2,y2 = v[b]; x3,y3 = v[c];\r\n B2,C2 = (x1-x2)**2+(y1-y2)**2,(x1-x3)**2+(y1-y3)**2\r\n if (x2-x3)**2+(y2-y3)**2>B2+C2: print(\"NO\"); continue\r\n d,e = sorted(set({0,1,2,3,4})-set({a,b,c}))\r\n x4,y4 = v[d]; x5,y5 = v[e]\r\n if (not (x1-x2)*y4+(x2-x4)*y1+(x4-x1)*y2) and (not (x1-x3)*y5+(x3-x5)*y1+(x5-x1)*y3) and \\\r\n B2<=((x1-x4)**2+(y1-y4)**2)*25<=16*B2 and B2<=((x2-x4)**2+(y2-y4)**2)*25<=16*B2 and \\\r\n C2<=((x1-x5)**2+(y1-y5)**2)*25<=16*C2 and C2<=((x3-x5)**2+(y3-y5)**2)*25<=16*C2:\r\n print(\"YES\"); continue\r\n if (not (x1-x2)*y5+(x2-x5)*y1+(x5-x1)*y2) and (not (x1-x3)*y4+(x3-x4)*y1+(x4-x1)*y3) and \\\r\n B2<=((x1-x5)**2+(y1-y5)**2)*25<=16*B2 and B2<=((x2-x5)**2+(y2-y5)**2)*25<=16*B2 and \\\r\n C2<=((x1-x4)**2+(y1-y4)**2)*25<=16*C2 and C2<=((x3-x4)**2+(y3-y4)**2)*25<=16*C2:\r\n print(\"YES\"); continue\r\n print(\"NO\")", "import random\r\nfrom math import sqrt as s\r\n \r\n \r\ndef dist(x1, y1, x2, y2):\r\n return s((x2 - x1) ** 2 + (y2 - y1) ** 2)\r\n \r\n \r\ndef is_dot_on_line(c1, c2, dot):\r\n A = c1[1] - c2[1]\r\n B = c2[0] - c1[0]\r\n C = c1[0] * c2[1] - c2[0] * c1[1]\r\n \r\n maxx, minx = max(c1[0], c2[0]), min(c1[0], c2[0])\r\n maxy, miny = max(c1[1], c2[1]), min(c1[1], c2[1])\r\n \r\n res = A * dot[0] + B * dot[1] + C\r\n \r\n if res == 0 and minx <= dot[0] <= maxx and miny <= dot[1] <= maxy:\r\n return True\r\n return False\r\n \r\n \r\ndef cosangle(x1, y1, x2, y2):\r\n return x1 * x2 + y1 * y2\r\n \r\n \r\ndef same(k11, k12, k21, k22, k31, k32):\r\n if k11 == k21 or k11 == k22 or k12 == k21 or k12 == k22:\r\n return 0, 1, 2\r\n if k11 == k31 or k11 == k32 or k12 == k31 or k12 == k32:\r\n return 0, 2, 1\r\n if k21 == k31 or k21 == k32 or k22 == k31 or k22 == k32:\r\n return 1, 2, 0\r\n return False\r\n \r\n \r\ndef is_a(c1, c2, c3, debug=-1):\r\n al = [c1, c2, c3]\r\n \r\n lines = same(*c1, *c2, *c3)\r\n if not lines:\r\n return False\r\n \r\n c1, c2, c3 = al[lines[0]], al[lines[1]], al[lines[2]]\r\n if c1[0] == c2[1]:\r\n c2[0], c2[1] = c2[1], c2[0]\r\n if c1[1] == c2[0]:\r\n c1[0], c1[1] = c1[1], c1[0]\r\n \r\n if not (is_dot_on_line(c1[0], c1[1], c3[0]) and is_dot_on_line(c2[0], c2[1], c3[1])):\r\n if not (is_dot_on_line(c1[0], c1[1], c3[1]) and is_dot_on_line(c2[0], c2[1], c3[0])):\r\n return False\r\n c3[0], c3[1] = c3[1], c3[0]\r\n \r\n cosa = cosangle(c1[0][0] - c1[1][0],\r\n c1[0][1] - c1[1][1],\r\n c2[0][0] - c2[1][0],\r\n c2[0][1] - c2[1][1])\r\n \r\n if cosa < 0:\r\n return False\r\n \r\n l1 = dist(*c1[0], *c3[0]), dist(*c1[1], *c3[0])\r\n l2 = dist(*c2[0], *c3[1]), dist(*c2[1], *c3[1])\r\n \r\n if min(l1) / max(l1) < 1/4 or min(l2) / max(l2) < 1/4:\r\n return False\r\n \r\n return True\r\n \r\n \r\nn = int(input())\r\nfor i in range(n):\r\n c1 = list(map(int, input().split()))\r\n c2 = list(map(int, input().split()))\r\n c3 = list(map(int, input().split()))\r\n if is_a([c1[:2], c1[2:]], [c2[:2], c2[2:]], [c3[:2], c3[2:]], debug=i):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nr = lambda: map(int,input().split())\r\ndef cross(a, b):\r\n return a[0] * b[1] - a[1] * b[0]\r\ndef dot(a, b):\r\n return a[0] * b[0] + a[1] * b[1]\r\ndef on_line(a, b):\r\n return dot(a, b) > 0 and cross(a, b) == 0 and abs(b[0]) <= abs(5 * a[0]) <= abs(4 * b[0]) and abs(b[1]) <= abs(5 * a[1]) <= abs(4 * b[1])\r\ndef is_A(a, b, c):\r\n a, b = set(a), set(b)\r\n if len(a & b) != 1:\r\n return False\r\n p1, = a & b\r\n p2, p3 = a ^ b\r\n v1 = (p2[0] - p1[0], p2[1] - p1[1])\r\n v2 = (p3[0] - p1[0], p3[1] - p1[1])\r\n if dot(v1, v2) < 0 or abs(cross(v1, v2)) == 0:\r\n return False\r\n v3 = (c[0][0] - p1[0], c[0][1] - p1[1])\r\n v4 = (c[1][0] - p1[0], c[1][1] - p1[1])\r\n return (on_line(v3, v1) and on_line(v4, v2)) or (on_line(v3, v2) and on_line(v4, v1))\r\nfor i in range(int(input())):\r\n xa1, ya1, xa2, ya2 = r()\r\n xb1, yb1, xb2, yb2 = r()\r\n xc1, yc1, xc2, yc2 = r()\r\n a, b, c = [(xa1, ya1), (xa2, ya2)], [(xb1, yb1), (xb2, yb2)], [(xc1, yc1), (xc2, yc2)]\r\n print (\"YES\" if is_A(a, b, c) or is_A(a, c, b) or is_A(b, c, a) else \"NO\")", "import sys\r\n\r\ndef contains(segment,point):\r\n return (min(segment[0][0],segment[1][0])<=point[0]<=max(segment[0][0],segment[1][0]) and\r\n min(segment[0][1],segment[1][1])<=point[1]<=max(segment[0][1],segment[1][1]));\r\n\r\ndef length(segment):\r\n return ((segment[0][0]-segment[1][0])**2+(segment[0][1]-segment[1][1])**2)**0.5;\r\n\r\n\r\nt=int(sys.stdin.readline());\r\n\r\nfor _ in range(t):\r\n points=set([]);\r\n segments=[];\r\n lines=[];\r\n roof=None;\r\n for i in range(3):\r\n segment=list(map(int,sys.stdin.readline().split()));\r\n lines.append([segment[1]-segment[3],segment[2]-segment[0],segment[0]*segment[3]-segment[1]*segment[2]]);\r\n p1=(segment[0],segment[1]);\r\n if p1 in points:\r\n roof=p1;\r\n else:\r\n points.add(p1);\r\n p2=(segment[2],segment[3]);\r\n if p2 in points:\r\n roof=p2;\r\n else:\r\n points.add(p2);\r\n segments.append([p1,p2]);\r\n\r\n #first condition\r\n if len(points)!=5 or roof==None:\r\n sys.stdout.write('NO\\n');\r\n continue;\r\n\r\n legs=[];\r\n for i in range(3):\r\n if roof in segments[i]:\r\n legs.append(i);\r\n\r\n if len(legs)!=2:\r\n sys.stdout.write('NO\\n');\r\n continue;\r\n\r\n connector=3-sum(legs);\r\n conns=[None,None];\r\n for i in range(2):\r\n if lines[legs[i]][0]*segments[connector][0][0]+lines[legs[i]][1]*segments[connector][0][1]+lines[legs[i]][2]==0:\r\n if contains(segments[legs[i]],segments[connector][0]):\r\n conns[i]=segments[connector][0];\r\n if lines[legs[i]][0]*segments[connector][1][0]+lines[legs[i]][1]*segments[connector][1][1]+lines[legs[i]][2]==0:\r\n if contains(segments[legs[i]],segments[connector][1]):\r\n conns[i]=segments[connector][1];\r\n\r\n if None in conns or conns[0]==conns[1]:\r\n sys.stdout.write('NO\\n');\r\n continue;\r\n\r\n #second condition\r\n endp=[];\r\n for i in range(2):\r\n if segments[legs[i]][0]==roof:\r\n endp.append(segments[legs[i]][1]);\r\n else:\r\n endp.append(segments[legs[i]][0]);\r\n\r\n if length(endp)<=abs(length(segments[legs[0]])-length(segments[legs[1]])) or length(endp)**2>length(segments[legs[0]])**2+length(segments[legs[1]])**2:\r\n sys.stdout.write('NO\\n');\r\n continue;\r\n\r\n #third condition\r\n if (min(length([conns[0],roof]),length([conns[0],endp[0]]))/max(length([conns[0],roof]),length([conns[0],endp[0]]))<0.25 or\r\n min(length([conns[1],roof]),length([conns[1],endp[1]]))/max(length([conns[1],roof]),length([conns[1],endp[1]]))<0.25):\r\n sys.stdout.write('NO\\n');\r\n continue;\r\n\r\n sys.stdout.write('YES\\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())\na = []\nfor _ in range(n):\n xy = list(map(int, input().split()))\n a.append(xy)\nmidpoint = {}\nfor i in range(n):\n for j in range(i + 1, n):\n x1, y1 = a[i][0], a[i][1]\n x2, y2 = a[j][0], a[j][1]\n dx = x2 + x1\n dy = y2 + y1\n midpoint[(dx / 2, dy / 2)] = midpoint.get((dx / 2, dy / 2), 0) + 1\nans = 0\nfor k, v in midpoint.items():\n #print(k, v, sep=' : ')\n ans += (v * (v - 1)) // 2\nprint(ans)\n\n#import matplotlib.pyplot as plt\n#import numpy as np\n#x, y = zip(*a)\n#plt.scatter(x, y)\n#plt.grid()\n#plt.show()\n", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nXY = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n XY.append((x, y))\r\n\r\nC = Counter()\r\nfor i in range(n-1):\r\n x0, y0 = XY[i]\r\n for j in range(i+1, n):\r\n x1, y1 = XY[j]\r\n xc = x0+x1\r\n yc = y0+y1\r\n C[(xc, yc)] += 1\r\nans = 0\r\nfor k, v in C.items():\r\n ans += v*(v-1)//2\r\nprint(ans)\r\n", "import sys\r\n#import random\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\nmod = 998244353\r\n\r\nn = ii()\r\na = []\r\n\r\nfor i in range (n) :\r\n x,y = il()\r\n\r\n a.append([x,y])\r\n\r\nd = {}\r\n\r\nfor i in range (n) :\r\n for j in range (i+1,n) :\r\n\r\n x1,y1 = a[i]\r\n x2,y2 = a[j]\r\n\r\n key = (x1+x2,y1+y2)\r\n\r\n d[key] = d.get(key,0) + 1\r\n\r\nans = 0\r\n\r\nfor i in d :\r\n ans += (d[i])*(d[i]-1)\r\n\r\nprint(ans//2)\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nxy = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n xy.append((x, y))\r\ncnt = defaultdict(lambda : 0)\r\nfor i in range(n):\r\n xi, yi = xy[i]\r\n for j in range(i + 1, n):\r\n xj, yj = xy[j]\r\n cnt[(xi + xj, yi + yj)] += 1\r\nans = 0\r\nfor i in cnt.values():\r\n ans += i * (i - 1) // 2\r\nprint(ans)", "from collections import Counter\n\n\nn = int(input())\n\nls = []\n\nfor i in range(n):\n a,b = map(int, input().split())\n ls.append((a,b))\n\n\ncounter = Counter()\nfor i in range(n):\n for j in range(i +1, n):\n medio =( (ls[i][0] + ls[j][ 0])/2, (ls[i][1] + ls[j][ 1])/2)\n counter[medio] += 1\nsum = 0\nfor c in counter:\n if counter[c] > 1:\n sum += counter[c] * (counter[c] -1 ) /2\n\nprint(int(sum))\n\n\n\t\t\t \t\t\t\t \t \t \t\t\t \t\t \t\t \t", "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nd=defaultdict(int)\nl=[]\nfor i in range(n):\n p=L()\n l.append(p)\nfor i in range(n-1):\n for j in range(i+1,n):\n d[(l[i][0]+l[j][0],l[i][1]+l[j][1])]+=1\nans=0\nfor i in d.keys():\n ans+=(d[i]*(d[i]-1))//2\nprint(ans)\n \n", "n=int(input())\r\nl=[]\r\nl1=[1]*(n**2)\r\nans=0\r\nfor i in range(n):\r\n x,y=input().split()\r\n x,y=[int(x),int(y)]\r\n l.append([x,y])\r\n\r\nfrom collections import Counter\r\ncount=Counter()\r\nfor i in range(len(l)):\r\n \r\n for j in range(i+1,len(l)):\r\n \r\n count[l[i][0]+l[j][0],l[j][1]+l[i][1]]+=1\r\nans = sum(i * (i - 1) // 2 for i in count.values())\r\nprint(ans)\r\n", "from collections import defaultdict as dd\r\n\r\n\r\nN = int(input())\r\n\r\nx = [0] * N\r\ny = [0] * N\r\n\r\nfor i in range(N):\r\n s = input().split()\r\n x[i] = int(s[0])\r\n y[i] = int(s[1])\r\n\r\ncnt = dd(lambda: 0)\r\n\r\nfor i in range(N):\r\n for j in range(i):\r\n cnt[f\"{x[i] + x[j]}-{y[i] + y[j]}\"] += 1\r\n\r\ntotal = 0\r\nfor value in cnt.values():\r\n total += (value * (value - 1)) / 2\r\n\r\nprint(int(total))", "p, d = [], {}\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n for a, b in p:\r\n u, v = a - x, b - y\r\n q = (u / v if v else int(2e9), u * u + v * v)\r\n d[q] = d.get(q, 0) + 1\r\n p.append((x, y))\r\nprint(sum(k * k - k for k in d.values()) // 4)\r\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\np = [tuple(read()) for i in range(n)]\r\nfrom collections import Counter\r\ncnt = Counter()\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n cnt[p[i][0] + p[j][0], p[i][1] + p[j][1]] += 1\r\nans = sum(i * (i - 1) // 2 for i in cnt.values())\r\nprint(ans)\r\n", "import sys\r\nimport math\r\n#sys.stdin = open('test.inp','r')\r\np, d = [], {}\r\ns = 0\r\nfor i in range(int(input())):\r\n\tx, y = map(int,input().split())\r\n\tfor a, b in p:\r\n\t\tq = (x + a, y + b)\r\n\t\tif q not in d: d[q] = 0\r\n\t\ts += d[q]\r\n\t\td[q] += 1\r\n\tp.append((x,y))\r\nprint(s)", "n = int(input())\nm = list(tuple(map(int,input().split())) for _ in range(n))\nmid = {}\npall = 0\nfor i in range(n):\n for j in range(i+1,n):\n if ((m[i][0]+m[j][0])/2, (m[i][1]+m[j][1])/2) in mid:\n pall += mid[((m[i][0]+m[j][0])/2, (m[i][1]+m[j][1])/2)]\n mid[((m[i][0]+m[j][0])/2, (m[i][1]+m[j][1])/2)] += 1\n else:\n mid[((m[i][0]+m[j][0])/2, (m[i][1]+m[j][1])/2)] = 1\nprint(pall)", "n = int( input())\n\nmidPoint = dict()\npoints = []\nfor i in range(n):\n x, y = input().split( )\n x = int(x)\n y = int(y)\n points.append((x, y))\n\nanswer = 0\n\nfor i in range(len(points)):\n for j in range(i+1, len(points)):\n mid = ( points[i][0] + points[j][0], points[i][1] + points[j][1])\n\n if midPoint.get(mid, 0) == 0:\n midPoint[mid] = 0 \n\n answer += midPoint[mid]\n midPoint[mid] += 1\n\nprint(int(answer))", "import sys\r\n\r\n\r\ndef read_input(input_path=None):\r\n if input_path is None:\r\n f = sys.stdin\r\n else:\r\n f = open(input_path, 'r')\r\n\r\n n = int(f.readline())\r\n points = list()\r\n for _ in range(n):\r\n x, y = map(int, f.readline().split())\r\n points.append((x, y))\r\n\r\n return n, points\r\n\r\n\r\ndef sol(n, points):\r\n res = 0\r\n mid_points = dict()\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n mid = (points[i][0] + points[j][0], points[i][1] + points[j][1])\r\n if mid not in mid_points:\r\n mid_points[mid] = 0\r\n res += mid_points[mid]\r\n mid_points[mid] += 1\r\n\r\n return [f\"{res}\"]\r\n\r\n\r\ndef solve(input_path=None):\r\n return sol(*read_input(input_path))\r\n\r\n\r\ndef main():\r\n for line in sol(*read_input()):\r\n print(f\"{line}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n" ]

[ "import os\r\nimport sys\r\nfrom math import floor, ceil\r\n\r\nif os.getenv('LOCALCFTEST'):\r\n sys.stdin = open('cfinput.txt')\r\nMOD = 998244353\r\n\r\n\r\ndef solve(s):\r\n s = list(map(int, s))\r\n n = len(s)\r\n dp = [[0] * 10 for _ in range(n)]\r\n dp[0] = [1] * 10\r\n flag = True\r\n for i in range(n - 1):\r\n t = (s[i] + s[i + 1]) / 2\r\n if s[i + 1] != ceil(t) and s[i + 1] != floor(t):\r\n flag = False\r\n for j in range(10):\r\n a, b = divmod(j + s[i + 1], 2)\r\n dp[i + 1][a] += dp[i][j]\r\n\r\n if b == 1:\r\n dp[i + 1][a + 1] += dp[i][j]\r\n # print(dp)\r\n\r\n print(sum(dp[-1]) - flag)\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n solve(s)\r\n", "from operator import itemgetter\r\nfrom typing import *\r\nfrom collections import deque, Counter, defaultdict\r\nfrom bisect import *\r\nimport heapq, math\r\nfrom functools import cmp_to_key, reduce\r\n\r\n# from sortedcontainers import SortedSet, SortedList\r\n\r\n\r\ndef main():\r\n s = list(map(int, input()))\r\n n = len(s)\r\n dp = [[0 for _ in range(10)] for _ in range(n)]\r\n for i in range(10):\r\n dp[0][i] = 1\r\n for i in range(1, n):\r\n for j in range(10):\r\n if (s[i] + j) % 2 == 1:\r\n dp[i][(s[i] + j - 1) // 2] += dp[i - 1][j]\r\n dp[i][(s[i] + j + 1) // 2] += dp[i - 1][j]\r\n else:\r\n dp[i][(s[i] + j) // 2] += dp[i - 1][j]\r\n print(sum(dp[n - 1]) - all((abs(x - y) < 2 for x, y in zip(s[:-1], s[1:]))))\r\n\r\n\r\nmain()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = list(map(int, input()[:-1]))\r\nl = len(n)\r\ndp = [[0] * 10 for _ in range(l)]\r\ndp[0] = [1] * 10\r\n\r\ndef owncheck(nums):\r\n n = len(nums)\r\n for i in range(0, n - 1):\r\n if abs(nums[i] - nums[i + 1]) > 1:\r\n return 0\r\n return -1\r\n\r\nfor i in range(1, l):\r\n for j in range(10):\r\n s = n[i] + j\r\n if s % 2:\r\n dp[i][s // 2] += dp[i - 1][j]\r\n dp[i][s // 2 + 1] += dp[i - 1][j]\r\n else:\r\n dp[i][s // 2] += dp[i - 1][j]\r\nprint(sum(dp[l - 1]) + owncheck(n))", "s = input()\r\nn = len(s)\r\narr = [int(c) for c in s]\r\ndp = [[1] * 10] + [[0] * 10 for _ in range(n - 1)]\r\n\r\nfor i in range(1, n):\r\n for j in range(10):\r\n tmp = j + arr[i]\r\n dp[i][tmp // 2] += dp[i - 1][j]\r\n if tmp % 2 != 0:\r\n dp[i][tmp // 2 + 1] += dp[i - 1][j]\r\n\r\nfor i in range(1, n):\r\n if abs(arr[i] - arr[i - 1]) > 1:\r\n print(sum(dp[-1]))\r\n break\r\nelse:\r\n print(sum(dp[-1]) - 1)", "s = input()\r\nl = len(s)\r\ncount = 0\r\n\r\ndp = [[0 for i in range(10)] for i in range(l+1)]\r\nfor i in range(10):\r\n dp[0][i] = 1\r\n\r\nfor i in range(l-1):\r\n for j in range(10):\r\n dp[i+1][(int(s[i+1])+j)//2] += dp[i][j]\r\n if (int(s[i+1])+j)%2!=0:\r\n dp[i+1][(int(s[i+1])+j)//2+1] += dp[i][j]\r\n\r\nok = 1\r\nfor i in range(l-1):\r\n if abs(int(s[i+1])-int(s[i]))>1:\r\n ok = 0\r\nprint(sum(dp[l-1])-ok)\r\n", "s=input()\r\nn=len(s)\r\ndp=[[0]*10 for i in range(n)]\r\ndp[0]=[1]*10\r\nfor i in range(1,n):\r\n\tfor j in range(10):\r\n\t\tx=j*2-int(s[i])\r\n\t\tif 0<=x+1<10:\r\n\t\t\tdp[i][j]+=dp[i-1][x+1]\r\n\t\tif 0<=x<10:\r\n\t\t\tdp[i][j]+=dp[i-1][x]\r\n\t\tif 0<=x-1<10:\r\n\t\t\tdp[i][j]+=dp[i-1][x-1]\r\nans=sum(dp[-1])\r\ns=list(map(int,list(s)))\r\nf=1\r\nfor i in range(1,n):\r\n\tx=(s[i]+s[i-1])//2\r\n\tif x!=s[i] and x+1!=s[i]:\r\n\t\tf=0\r\n\t\tbreak\r\nprint(ans-f)", "s = input()\r\nn = len(s)\r\ndp = [[0] * 10 for _ in range(n)]\r\n\r\nfor i, c in enumerate(s):\r\n c = int(c)\r\n for j in range(10):\r\n if i == 0:\r\n dp[i][j] = 1\r\n else:\r\n dp[i][(j + c) // 2] += dp[i - 1][j]\r\n if (j + c) & 1:\r\n dp[i][(j + c + 1) // 2] += dp[i - 1][j]\r\n\r\nt = 0\r\nfor i in range(n - 1):\r\n if abs(int(s[i]) - int(s[i + 1])) > 1: break\r\nelse:\r\n t = 1\r\nprint(sum(dp[-1]) - t)", "if __name__ == '__main__':\r\n s = input()\r\n dp = [1] * 10\r\n mk = 1\r\n for i in s[1:]:\r\n new_dp = [0] * 10\r\n for j in range(10):\r\n n = j + int(i)\r\n new_dp[n // 2] += dp[j]\r\n if n % 2 != 0:\r\n new_dp[n // 2 + 1] += dp[j]\r\n dp = new_dp\r\n for i in range(1, len(s)):\r\n if abs(int(s[i]) - int(s[i - 1])) > 1:\r\n mk = 0\r\n\r\n print(sum(dp) - mk)", "s=[int(c) for c in input()]\r\nok=1\r\nfor i in range(1,len(s)):\r\n if abs(s[i]-s[i-1])>1: ok=0; break\r\nw=[1]*10\r\nfor v in s[1:]:\r\n ww=w[:]\r\n w=[0]*10\r\n for d in range(10):\r\n q,r=divmod(v+d,2)\r\n w[q]+=ww[d]\r\n if r>0:\r\n w[q+1]+=ww[d]\r\n\r\nprint(sum(w)-ok) \r\n", "s=[int(c)for c in input()]\r\nh=1\r\nfor i in range(1,len(s)):\r\n if abs(s[i]-s[i-1])>1:h=0;break\r\nw=[1]*10\r\nfor v in s[1:]:\r\n t=w[:]\r\n w=[0]*10\r\n for d in range(10):\r\n q,r=divmod(v+d,2)\r\n w[q]+=t[d]\r\n if r>0:w[q+1]+=t[d]\r\nprint(sum(w)-h)", "if __name__ == '__main__':\r\n s=input()\r\n f=[1]*10\r\n flag=1\r\n for i in range(1,len(s)):\r\n tf=[0]*10\r\n for j in range(10):\r\n a= j+int(s[i])\r\n if a%2==0:\r\n tf[a//2]+=f[j]\r\n else:\r\n tf[(a+1)//2]+=f[j]\r\n tf[(a-1)//2]+=f[j] \r\n f=tf\r\n if abs(int(s[i])-int(s[i-1]))>1:\r\n flag=0\r\n \r\n print(sum(f)-flag)\r\n", "\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nfrom collections import defaultdict, Counter\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nimport math\r\n\r\ndef I():\r\n return(int(input()))\r\ndef lint():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n# Python program to print all\r\n# primes smaller than or equal to\r\n# n using Sieve of Eratosthenes\r\n\r\nimport heapq\r\n\r\ndef ask(a,b,c):\r\n print(f\"? {a} {b} {c}\")\r\n sys.stdout.flush()\r\n res=int(input())\r\n sys.stdout.flush()\r\n return res\r\n\r\ns = list(map(int,input().strip()))\r\nn = len(s)\r\n\r\ndp=[[0]*10 for _ in range(n)]\r\nfor i in range(10):\r\n dp[0][i]=1\r\n\r\nb=1\r\nfor i in range(1,n):\r\n \r\n for j in range(10):\r\n tmp=0\r\n if(j*2-s[i]>=0 and 2*j-s[i]<=9):\r\n\r\n tmp+=dp[i-1][j*2-s[i]]\r\n if(2*j-1>=0 and 2*j-1-s[i]>=0 and 2*j-1-s[i]<=9):\r\n \r\n tmp+=dp[i-1][2*j-1-s[i]]\r\n if(2*j+1-s[i]>=0 and 2*j+1-s[i]<=9): \r\n tmp+=dp[i-1][2*j+1-s[i]] \r\n dp[i][j]=tmp\r\n \r\n \r\n\r\nans=sum(dp[n-1])\r\nb=1\r\nfor i in range(1,n):\r\n\tx=(s[i]+s[i-1])//2\r\n\tif x!=s[i] and x+1!=s[i]:\r\n\t\tb=0\r\n\t\tbreak\r\n\r\nprint(ans-b)\r\n \r\n\r\n\r\n \r\n", "s=input()\r\nh=len(s)\r\ndp=[[0]*10 for _ in range(h)]\r\nfor i in range(10):\r\n dp[0][i]=1\r\nfor i in range(1,h):\r\n for j in range(10):\r\n t=int(s[i])+j\r\n if t%2:\r\n dp[i][t//2]+=dp[i-1][j]\r\n dp[i][t//2+1]+=dp[i-1][j]\r\n else:\r\n dp[i][t // 2] += dp[i - 1][j]\r\ndif=0 if h>1 else -1\r\nfor i in range(1,h):\r\n if abs(int(s[i])-int(s[i-1]))>1:break\r\nelse:\r\n dif=-1\r\nprint(sum(dp[h-1])+dif)\r\n", "# import sys\r\n# input=sys.stdin.readline\r\n\r\na=input()\r\ndp=[]\r\nfor i in range(len(a)):\r\n dp.append([0]*10)\r\nfor i in range(10):\r\n dp[0][i]=1\r\n \r\nfor i in range(len(a)-1):\r\n for j in range(10):\r\n if dp[i][j]!=0:\r\n c=(int(a[i+1])+j)//2\r\n d=(int(a[i+1])+j+1)//2\r\n if c!=d:\r\n dp[i+1][c]+=dp[i][j]\r\n dp[i+1][d]+=dp[i][j]\r\n else:\r\n dp[i+1][c]+=dp[i][j]\r\ns=0\r\nfor i in range(10):\r\n s+=dp[-1][i]\r\nt=0\r\nc=int(a[0])\r\nf=[a[0]]\r\nfor i in range(1,len(a)):\r\n d=(c+int(a[i]))//2\r\n e=(c+int(a[i])+1)//2\r\n if int(a[i])==d:\r\n f.append(a[i])\r\n c=d\r\n elif int(a[i])==e:\r\n f.append(a[i])\r\n c=e\r\n else:\r\n break\r\nif \"\".join(f)==a:\r\n t=1\r\nprint(s-t)", "s = str(input())\r\n\r\ndp = [1 for i in range(10)]\r\n\r\nfor i in range(1, len(s)):\r\n new_dp = [0 for i in range(10)]\r\n for j in range(10):\r\n for d in range(2 * j - 1, 2 * j + 2):\r\n to_add = d - int(s[i])\r\n if 0 <= to_add <= 9:\r\n new_dp[j] += dp[to_add]\r\n dp = new_dp * 1\r\n\r\nd = 0\r\nfor i in range(1, len(s)):\r\n if abs(int(s[i]) * 2 - (int(s[i - 1]) + int(s[i]))) > 1:\r\n break\r\nelse:\r\n d = -1\r\n\r\nprint(sum(dp) + d)\r\n", "from math import ceil\r\nimport os, sys\r\nfrom io import BytesIO, IOBase\r\nfrom array import array\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\nints = lambda: list(map(int, input().split()))\r\nInt = lambda: int(input())\r\n\r\n\r\ndef queryInteractive(a, b, c):\r\n print('? {} {} {}'.format(a, b, c))\r\n sys.stdout.flush()\r\n return int(input())\r\n\r\n\r\ndef answerInteractive(x1, x2):\r\n print('! {} {}'.format(x1, x2))\r\n sys.stdout.flush()\r\n\r\n\r\ninf = float('inf')\r\n\r\na = input()\r\na = [int(x) for x in a]\r\nn = len(a)\r\ndp = [[0] * n for _ in range(10)]\r\nfor i in range(10):\r\n dp[i][0] = 1\r\n\r\nfor j in range(1, n):\r\n for i in range(10):\r\n k = (i + a[j]) // 2\r\n dp[k][j] += dp[i][j - 1]\r\n if (i + a[j]) % 2 != 0:\r\n dp[k + 1][j] += dp[i][j - 1]\r\n\r\nflag = 1\r\nfor i in range(1, n):\r\n if (a[i - 1] + a[i]) // 2 != a[i] and ceil((a[i - 1] + a[i]) / 2) != a[i]:\r\n flag = 0\r\n break\r\nans = 0\r\nfor i in range(10):\r\n ans += dp[i][n - 1]\r\nans -= flag\r\nprint(ans)\r\n\r\n" ]

[ "R,C=map(int, input().split())\r\nm=[[str(j) for j in input()] for i in range(R)]\r\nrow=0\r\nfor i in range(R):\r\n if row == 1:\r\n break\r\n for j in range(C):\r\n if m[i][j] == \".\":\r\n m[i][j] = \"D\"\r\n elif m[i][j] == \"S\":\r\n if j > 0 and m[i][j-1] == \"W\":\r\n row=1\r\n break\r\n elif j < C-1 and m[i][j+1] == \"W\":\r\n row=1\r\n break\r\n elif i < R-1 and m[i+1][j] == \"W\":\r\n row=1\r\n break\r\n elif i > 0 and m[i-1][j] == \"W\":\r\n row=1\r\n break\r\nif row == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in m:\r\n print(\"\".join(i))", "\nr, c = map(int, input().split())\npasture = [list(input()) for _ in range(r)]\nprotectable = True\n\nfor i in range(r):\n for j in range(c):\n if pasture[i][j] == 'W':\n for x, y in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\n if any((x < 0, y < 0, x >= r, y >= c)):\n continue\n if pasture[x][y] == 'S':\n protectable = False\n if pasture[x][y] == '.':\n pasture[x][y] = 'D'\nif protectable:\n print('Yes')\n for i in range(r):\n print(''.join(pasture[i]))\nelse:\n print('No')\n \t \t\t \t\t\t\t \t\t\t\t\t\t", "n,m=map(int,input().split())\na=[input() for _ in range(n)]\nsheep_pos=list()\nmap=dict()\nfor i in range(n):\n for j in range(m):\n if a[i][j]=='S':\n map[(i,j)]='S'\n sheep_pos.append((i,j))\n elif a[i][j]=='W':\n map[(i,j)]='W'\n else:\n map[(i,j)]='.'\nfor i in sheep_pos:\n x,y=i\n poses=list()\n if x>0:poses.append((x-1,y))\n if x<n-1:poses.append((x+1,y))\n if y>0:poses.append((x,y-1))\n if y<m-1:poses.append((x,y+1))\n for j in poses:\n if map[j]=='W':\n print(\"No\")\n quit()\n if map[j]!='S':map[j]='D'\n\nprint('Yes')\nfor i in range(n):\n for j in range(m):\n print(map[(i,j)],end='')\n print()", "r,c=map(int,input().split())\r\nmat=[]\r\nflag=0\r\nfor i in range(r):\r\n k=[]\r\n s=input()\r\n for z in s:\r\n k.append(z)\r\n mat.append(k)\r\nfor i in range(r):\r\n for j in range(c):\r\n if(mat[i][j]==\"W\"):\r\n if(i-1>=0):\r\n if(mat[i-1][j]==\"S\"):\r\n flag=1\r\n break\r\n elif(mat[i-1][j]==\".\"):\r\n mat[i-1][j]=\"D\"\r\n if(i+1<r):\r\n if(mat[i+1][j]==\"S\"):\r\n flag=1\r\n break\r\n elif(mat[i+1][j]==\".\"):\r\n mat[i+1][j]=\"D\"\r\n if(j-1>=0):\r\n if(mat[i][j-1]==\"S\"):\r\n flag=1\r\n break\r\n elif(mat[i][j-1]==\".\"):\r\n mat[i][j-1]=\"D\"\r\n if(j+1<c):\r\n if(mat[i][j+1]==\"S\"):\r\n flag=1\r\n break\r\n elif(mat[i][j+1]==\".\"):\r\n mat[i][j+1]=\"D\"\r\nif(flag==1):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in mat:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()\r\n\r\n\r\n", "WOLF = \"W\"\nSHEEP = \"S\"\nDOG = \"D\"\nEMPTY = \".\"\n\nR, C = [int(x) for x in input().split()]\nfield = []\n\nhas_wolves = False\nis_imp = False\n\nfor row_i in range(R):\n row = input()\n if row.count(WOLF):\n has_wolves = True\n field.append(row)\n\nif not has_wolves:\n print(\"Yes\")\n for row_i in range(R):\n print(field[row_i])\nelse:\n for row_i in range(R):\n for col_i in range(C):\n if field[row_i][col_i] == SHEEP and \\\n (\n (row_i > 0 and field[row_i - 1][col_i] == WOLF) or \\\n (col_i > 0 and field[row_i][col_i - 1] == WOLF) or \\\n (row_i < R - 1 and field[row_i + 1][col_i] == WOLF) or \\\n (col_i < C - 1 and field[row_i][col_i + 1] == WOLF)\n ):\n is_imp = True\n break\n if field[row_i][col_i] == WOLF and \\\n (\n (row_i > 0 and field[row_i - 1][col_i] == SHEEP) or \\\n (col_i > 0 and field[row_i][col_i - 1] == SHEEP) or \\\n (row_i < R - 1 and field[row_i + 1][col_i] == SHEEP) or \\\n (col_i < C - 1 and field[row_i][col_i + 1] == SHEEP)\n ):\n is_imp = True\n break\n\n if is_imp:\n break\n\n if is_imp:\n print(\"No\")\n else:\n print(\"Yes\")\n for row_i in range(R):\n print(field[row_i].replace(EMPTY, DOG))\n \n", "r, c = map(int, input().split())\r\narray = []\r\nfor _ in range(r):\r\n s = input()\r\n temp = []\r\n for i in range(len(s)):\r\n temp.append(s[i])\r\n array.append(temp)\r\nflag = False\r\nfor i in range(r):\r\n for j in range(c):\r\n if array[i][j] == 'W':\r\n if i-1 >= 0 and array[i-1][j] == 'S':\r\n flag = True\r\n break\r\n if j-1 >= 0 and array[i][j-1] == 'S':\r\n flag = True\r\n break\r\n if i+1 < r and array[i+1][j] == 'S':\r\n flag = True\r\n break\r\n if j+1 < c and array[i][j+1] == 'S':\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in range(r):\r\n for j in range(c):\r\n if array[i][j]=='.':\r\n print(\"D\",end='')\r\n else:\r\n print(array[i][j],end='')\r\n print()", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom collections import *\r\nfrom decimal import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom io import BytesIO, IOBase\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value(): return tuple(map(int, input().split())) # multiple values\r\ndef arr(): return [int(i) for i in input().split()] # aay input\r\ndef sarr(): return [str(i) for i in input()] #aay from string\r\ndef starr(): return [str(x) for x in input().split()] #string aay\r\ndef inn(): return int(input()) # integer input\r\ndef svalue(): return tuple(map(str, input().split())) #multiple string values\r\ndef parr(): return [(value()) for i in range(n)] # aay of pairs\r\ndef Ceil(a,b): return a//b+int(a%b>0)\r\nalphabet=\"abcdefghijklmnopqrstuvwxyz\"\r\nmo = 1000000007\r\ninf=1e18\r\ndiv=998244353\r\n#print(\"Case #{}:\".format(_+1),end=\" \")\r\n#print(\"Case #\",z+1,\":\",sep=\"\",end=\" \")\r\n# ----------------------------CODE------------------------------#\r\nn,m=value()\r\na=[[str(x) for x in input()] for j in range(n)]\r\n# print(a)\r\nflag=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(a[i][j]=='S'):\r\n if(i-1>=0):\r\n if a[i-1][j]=='W': flag=1\r\n elif(a[i-1][j]=='.'): a[i-1][j]='D'\r\n\r\n if(i+1<n):\r\n if a[i+1][j]=='W': flag=1\r\n elif a[i+1][j]=='.': a[i+1][j]='D'\r\n\r\n if(j-1>=0):\r\n if a[i][j-1]=='W': flag=1\r\n elif(a[i][j-1]=='.'): a[i][j-1]='D'\r\n\r\n if(j+1<m):\r\n if a[i][j+1]=='W': flag=1\r\n elif(a[i][j+1]=='.'): a[i][j+1]='D'\r\n if(flag==1): break\r\n if(flag==1): break\r\n\r\nif flag==1: print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in range(n):\r\n print(*a[i],sep=\"\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\nimport math\r\nr,c=map(int,input().split())\r\nfarm=[]\r\nfor i in range(r):\r\n farm.append(input())\r\nans=True\r\nfor i in farm:\r\n if(\"SW\" in i):\r\n ans=False\r\n break\r\n elif(\"WS\"in i):\r\n ans=False\r\n break\r\nif(ans):\r\n for i in range(r-1):\r\n for j in range(c):\r\n if(farm[i][j]=='S' and farm[i+1][j]=='W'):\r\n ans=False\r\n break\r\n elif(farm[i][j]=='W' and farm[i+1][j]=='S'):\r\n ans=False\r\n break\r\n if(ans==False):\r\n break\r\nif(ans):\r\n print(\"Yes\")\r\n for i in farm:\r\n for j in i:\r\n if(j==\".\"):\r\n print(\"D\",end=\"\")\r\n else:\r\n print(j,end=\"\")\r\n print()\r\nelse:\r\n print(\"No\")\r\n \r\n\r\n", "import collections\r\n\r\nif __name__ == '__main__':\r\n r, c = list(map(int, input().strip().split()))\r\n grid = []\r\n for i in range(r):\r\n row = str(input())\r\n grid.append(list(row))\r\n que = collections.deque([])\r\n dirs = [[-1, 0], [1, 0], [0, -1], [0, 1]]\r\n suc = 1\r\n for i in range(r):\r\n for j in range(c):\r\n if grid[i][j] == \"S\":\r\n for k in range(4):\r\n ni, nj = i + dirs[k][0], j + dirs[k][1]\r\n if 0 <= ni < r and 0 <= nj < c and grid[ni][nj] == \"W\":\r\n suc = 0\r\n break\r\n que.append([i, j])\r\n if suc == 0:\r\n print(\"No\")\r\n else:\r\n while que:\r\n curx, cury = que.popleft()\r\n for i in range(4):\r\n nxtx, nxty = curx + dirs[i][0], cury + dirs[i][1]\r\n if 0 <= nxtx < r and 0 <= nxty < c and grid[nxtx][nxty] == \".\":\r\n que.append([nxtx, nxty])\r\n grid[nxtx][nxty] = \"D\"\r\n print(\"Yes\")\r\n for i in range(r):\r\n print(\"\".join(grid[i]))", "def main():\r\n n, m = map(int, input().split())\r\n l = [input() for _ in range(n)]\r\n r = any('SW' in s or 'WS' in s for s in [*l, *[''.join(t) for t in zip(*l)]])\r\n if r:\r\n print('No')\r\n else:\r\n print('Yes')\r\n for s in l:\r\n print(s.replace('.','D'))\r\n \r\nif __name__ == '__main__':\r\n main()", "def wolf(m):\n for i in range(len(m)):\n for j in range(len(m[i])):\n if m[i][j] == \"W\":\n if i > 0:\n # m[i-1][j] = \"A\"\n if m[i-1][j] == \"S\":return(False)\n if i < len(m)-1:\n # m[i+1][j] = \"A\"\n if m[i+1][j] == \"S\":return(False)\n if j > 0:\n # m[i][j-1] = \"A\"\n if m[i][j-1] == \"S\":return(False)\n if j < len(m[i])-1:\n # m[i][j+1] = \"A\"\n if m[i][j+1] == \"S\":return(False)\n elif m[i][j] != \"S\":\n m[i][j] = \"D\"\n return(True)\n\ny,x = map(int, input().split())\nm = []\nfor i in range(y):\n m.append(list(input()))\n\nif not wolf(m):\n print(\"No\")\nelse:\n print(\"Yes\")\n for i in m:\n print(*i,sep = '')\n \t\t \t\t \t \t\t\t \t\t \t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nr, c = map(int, input().split())\r\ns = []\r\nans = \"Yes\"\r\nfor i in range(r):\r\n s0 = list(input().rstrip())\r\n for j in range(c - 1):\r\n if s0[j] == \"S\" and s0[j + 1] == \"W\":\r\n ans = \"No\"\r\n elif s0[j] == \"W\" and s0[j + 1] == \"S\":\r\n ans = \"No\"\r\n for j in range(c):\r\n if s0[j] == \".\":\r\n s0[j] = \"D\"\r\n s.append(s0)\r\nfor i in range(r - 1):\r\n if ans == \"No\":\r\n break\r\n s0, s1 = s[i], s[i + 1]\r\n for j in range(c):\r\n if s0[j] == \"S\" and s1[j] == \"W\":\r\n ans = \"No\"\r\n elif s0[j] == \"W\" and s1[j] == \"S\":\r\n ans = \"No\"\r\nprint(ans)\r\nif ans == \"Yes\":\r\n ans = []\r\n for s0 in s:\r\n ans.append(\"\".join(s0))\r\n sys.stdout.write(\"\\n\".join(ans))", "import sys\r\n# from io import StringIO\r\n# sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())\r\n\r\nr, c = list(map(int, input().split()))\r\n\r\nm = []\r\n\r\nfor _ in range(r):\r\n m.append(list(input()))\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if m[i][j] == 'W':\r\n if i > 0:\r\n if m[i-1][j] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i-1][j] == '.':\r\n m[i-1][j] = 'D'\r\n if i < r - 1:\r\n if m[i+1][j] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i+1][j] == '.':\r\n m[i+1][j] = 'D'\r\n if j > 0:\r\n if m[i][j-1] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i][j-1] == '.':\r\n m[i][j-1] = 'D'\r\n if j < c - 1:\r\n if m[i][j+1] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i][j+1] == '.':\r\n m[i][j+1] = 'D'\r\n\r\nprint('Yes')\r\nfor row in m:\r\n print(''.join(row))", "R = lambda : map(int, input().split())\nn,m = R()\nmp = []\nfor _ in range(n):\n mp.append(list(input()))\n\ns = set()\n\n\nfor i in range(n):\n for j in range(m):\n if mp[i][j]=='S':\n if i>0:\n if mp[i-1][j]=='W':\n print(\"No\")\n exit()\n elif mp[i-1][j]==\".\":\n s.add((i-1,j))\n if i<n-1:\n if mp[i+1][j]=='W':\n print(\"No\")\n exit()\n elif mp[i+1][j]==\".\":\n s.add((i+1,j))\n if j>0:\n if mp[i][j-1]=='W':\n print(\"No\")\n exit()\n elif mp[i][j-1]==\".\":\n s.add((i,j-1))\n if j<m-1:\n if mp[i][j+1]=='W':\n print(\"No\")\n exit()\n elif mp[i][j+1]==\".\":\n s.add((i,j+1))\n\nprint(\"Yes\")\nfor i in range(n):\n for j in range(m):\n if (i,j) in s:\n mp[i][j]=\"D\"\n\nfor i in range(n):\n print(\"\".join(map(str,mp[i]))) \n", "n,m=map(int,input().split(' '))\r\na=[]\r\n\r\nfor ll in range(n):\r\n a.append(list(input()))\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='S':\r\n if i-1>=0 and a[i-1][j]=='.':\r\n a[i-1][j]='D'\r\n if i+1<n and a[i+1][j]=='.':\r\n a[i+1][j]='D'\r\n if j-1>=0 and a[i][j-1]=='.':\r\n a[i][j-1]='D'\r\n if j+1<m and a[i][j+1]=='.':\r\n a[i][j+1]='D'\r\n if i-1>=0 and a[i-1][j]=='W':\r\n print('No')\r\n exit()\r\n if i+1<n and a[i+1][j]=='W':\r\n print('No')\r\n exit()\r\n if j-1>=0 and a[i][j-1]=='W':\r\n print('No')\r\n exit()\r\n if j+1<m and a[i][j+1]=='W':\r\n print('No')\r\n exit()\r\n\r\nprint('Yes')\r\nfor i in range(n):\r\n for j in range(m):\r\n print(a[i][j],end='')\r\n print('')\r\n\r\n\r\n", "r, c = map(int, input().split())\nrows = []\nfor i in range(r):\n row = list(input())\n rows.append(row)\ndef check(i, j, rows):\n if 0 < i:\n if rows[i][j] == 'S' and rows[i - 1][j] == 'W':\n return 'NO'\n if rows[i][j] == 'S' and rows[i - 1][j] == '.':\n rows[i - 1][j] = 'D'\n if i < len(rows) - 1:\n if rows[i][j] == 'S' and rows[i + 1][j] == 'W':\n return 'NO'\n if rows[i][j] == 'S' and rows[i + 1][j] == '.':\n rows[i + 1][j] = 'D'\n if j > 0:\n if rows[i][j] == 'S' and rows[i][j - 1] == 'W':\n return 'NO'\n if rows[i][j] == 'S' and rows[i][j - 1] == '.':\n rows[i][j - 1] = 'D'\n if j < len(rows[0]) - 1:\n if rows[i][j] == 'S' and rows[i][j + 1] == 'W':\n return 'NO'\n if rows[i][j] == 'S' and rows[i][j + 1] == '.':\n rows[i][j + 1] = 'D'\n return ''\ndef run(rows):\n for i in range(len(rows)):\n for j in range(len(rows[0])):\n if check(i, j, rows) == 'NO':\n print('No')\n return\n print('Yes')\n for i in range(len(rows)):\n print(''.join(rows[i]))\nrun(rows)\n", "n,m = [int(x) for x in input().split()]\r\n\r\nmat = [] \r\n\r\nfor i in range(n):\r\n\tmat.append(input())\r\n\r\nok = True\r\n\r\ndx = [0,0,1,-1]\r\ndy = [1,-1,0,0]\r\n\r\nf = lambda x,y,c,d : x >= 0 and y >= 0 and x < c and y < d\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif mat[i][j] == 'S':\r\n\t\t\tfor k in range(4):\r\n\t\t\t\ttx = i + dx[k]\r\n\t\t\t\tty = j + dy[k]\r\n\t\t\t\tif f(tx,ty,n,m) == False: continue\r\n\t\t\t\tif mat[tx][ty] == 'W': ok = False\r\n\r\nif ok:\r\n\tprint(\"Yes\")\r\n\tfor i in range(n):\r\n\t\tmat[i] = mat[i].replace('.','D')\r\n\tfor x in mat: print(x)\r\nelse:\r\n\tprint(\"No\")\r\n\t\t\t\t\t\r\n\r\n\r\n", "r, c = map(int, input().split())\npasture = [list(input()) for i in range(r)]\nimpossible = False\n\n\ndef fill(tu):\n global impossible\n x, y = tu\n if any((x<0, y<0, x>=r, y>=c)):\n return\n if pasture[x][y] == 'S':\n impossible = True\n if pasture[x][y] == '.':\n pasture[x][y] = 'D'\n\n\nfor i in range(r):\n for j in range(c):\n if pasture[i][j] == 'W':\n for tu in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\n fill(tu)\n\nif impossible:\n print('No')\nelse:\n print('Yes')\n for i in range(r):\n print(''.join(pasture[i]))\n\n\n", "from collections import deque\r\nn,m=map(int,input().split())\r\ng=[]\r\n\r\n\r\nfor _ in range(n):\r\n temp=input()\r\n g.append(temp)\r\n\r\nflag=False\r\nfor row in g:\r\n if 'SW' in row or 'WS' in row:\r\n # print(\"row :\",row)\r\n flag=True\r\n break\r\nif not flag:\r\n for col in zip(*g):\r\n if 'SW' in \"\".join(col) or 'WS' in \"\".join(col):\r\n # print(\"col :\",\"\".join(col))\r\n flag=True\r\n break\r\n\r\nif not flag:\r\n print(\"YES\")\r\n for row in g:\r\n print(row.replace('.','D'))\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n\r\n", "import sys\r\n\r\nr,c= input().split()\r\nr,c= int(r),int(c)\r\n\r\nf= ['']*r\r\n\r\nfor x in range(r):\r\n f[x]= input().replace('.','D')\r\n if 'WS' in f[x] or 'SW' in f[x]:\r\n print('No')\r\n sys.exit(0)\r\n \r\n if x>0:\r\n for y in range(c):\r\n up= f[x][y] + f[x-1][y]\r\n if up in ['SW','WS']:\r\n print('No')\r\n sys.exit(0)\r\n \r\n \r\nprint('Yes')\r\nfor i in range(r):\r\n print(f[i])", "R, C = map(int,input().split())\n\ngrid = [None] * R\n\n\nfor i in range(R):\n grid[i] = list(input())\n\n\ndef is_save(i, j):\n if grid[i][j] != \"S\":\n return True\n\n is_save = 1\n neighbour = []\n\n if not (j == 0):\n neighbour.append((i, j-1))\n\n if not (j == C-1):\n neighbour.append((i, j+1))\n\n if not i == 0:\n neighbour.append((i-1,j))\n\n if not (i == R-1):\n neighbour.append((i+1,j))\n\n for (i,j) in neighbour:\n if grid[i][j] == \"W\":\n is_save = 0\n break\n elif grid[i][j] == \".\":\n grid[i][j] = \"D\"\n\n return is_save\n\n\nflag = 1\nfor i in range(R):\n for j in range(C):\n if not is_save(i, j):\n flag = 0\n break\n\n if not flag:\n break\n\nif flag:\n print(\"Yes\")\n for i in range(R):\n print(\"\".join(grid[i]))\nelse:\n print(\"No\")", "#!/usr/bin/env python3\n\nimport sys\n\n[R, C] = map(int, sys.stdin.readline().strip().split())\nfield = [sys.stdin.readline().strip() for _ in range(R)]\n\nfor line in field:\n\tif ('WS' in line) or ('SW' in line):\n\t\tprint ('No')\n\t\tsys.exit(0)\nfor l1, l2 in zip(field[1:], field[:-1]):\n\tfor c1, c2 in zip(l1, l2):\n\t\tif (c1 == 'W' and c2 == 'S') or (c1 == 'S' and c2 == 'W'):\n\t\t\tprint ('No')\n\t\t\tsys.exit(0)\n\nfor i in range(R):\n\tfield[i] = field[i].replace('.', 'D')\n\nprint ('Yes')\nfor line in field:\n\tprint (line)\n", "R,C=list(map(int, input().split(' ')))\na=[list(input()) for i in range(R)]\n\n\ndef sheep(a,R,C):\n flag=0\n for i in range(R):\n for j in range(C):\n if a[i][j]=='W' and ( (i>0 and a[i-1][j]=='S') or (i<R-1 and a[i+1][j]=='S') or (j>0 and a[i][j-1]=='S') or (j<C-1 and a[i][j+1]=='S') ):\n flag=-1\n return flag\n return flag\n\nflag=sheep(a,R,C)\n\nif flag==0:\n for i in range(R):\n for j in range(C):\n if a[i][j]=='.':\n a[i][j]='D'\n\nif flag==-1:\n print('No')\nelse:\n print('Yes')\n for i in range(R):\n print(''.join(a[i]))\n", "r,c = map(int, input().split())\r\n\r\ngrid = []\r\nfor _ in range(r):\r\n grid.append(list(input()))\r\n\r\nbroke = False\r\n \r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j] == \"S\":\r\n if i != 0:\r\n if grid[i-1][j] == \"W\":\r\n break\r\n elif grid[i-1][j] == \".\":\r\n grid[i-1][j] = \"D\"\r\n if i != r-1:\r\n if grid[i+1][j] == \"W\":\r\n break\r\n elif grid[i+1][j] == \".\":\r\n grid[i+1][j] = \"D\"\r\n if j!= 0:\r\n if grid[i][j-1] == \"W\":\r\n break\r\n elif grid[i][j-1] == \".\":\r\n grid[i][j-1] = \"D\"\r\n if j!= c-1:\r\n if grid[i][j+1] == \"W\":\r\n break\r\n elif grid[i][j+1] == \".\":\r\n grid[i][j+1] = \"D\"\r\n \r\n else:\r\n continue\r\n broke = True\r\n break\r\nelse:\r\n print(\"Yes\")\r\n for list1 in grid:\r\n for elem1 in list1:\r\n print(elem1, end = \"\")\r\n print()\r\n\r\nif broke:\r\n print(\"No\")", "r,c=map(int,input().split())\r\nl=[]\r\ndef empty(l,i):\r\n if 'W' in l[i]:\r\n a=l[i].index('W')\r\n while a>-1 and a<c:\r\n if i+1<r and (l[i+1][a]==\".\" or l[i+1][a]==\"D\"):\r\n l[i+1][a]=\"D\"\r\n elif i+1<r and (l[i+1][a]==\"S\"):\r\n return False\r\n if i-1>-1 and (l[i-1][a]==\".\" or l[i-1][a]==\"D\"):\r\n l[i-1][a]=\"D\"\r\n elif i-1>-1 and l[i-1][a]==\"S\" :\r\n return False\r\n if a+1<c and (l[i][a+1]==\".\" or l[i][a+1]==\"D\"):\r\n l[i][a+1]=\"D\"\r\n elif a+1<c and l[i][a+1]==\"S\":\r\n return False\r\n if a-1>-1 and (l[i][a-1]==\".\" or l[i][a-1]==\"D\"):\r\n l[i][a-1]=\"D\"\r\n elif a-1>-1 and l[i][a-1]==\"S\":\r\n return False\r\n if 'W' in l[i][a+1:]:\r\n a+=(l[i][a+1:].index('W')+1)\r\n else:\r\n a=-1\r\n return True\r\nfor i in range(r):\r\n l.append(list(input()))\r\nfor i in range(r):\r\n p=empty(l,i)\r\n if not p:\r\n print(\"No\")\r\n break\r\nif p:\r\n print(\"YES\")\r\n for i in range(r):\r\n print(\"\".join(l[i]))\r\n \r\n \r\n \r\n", "r, c = map(int, input().split())\nflag = False\naux = []\n\nfor i in range(r):\n string = list(input())\n aux.append(string)\n\ndx = [-1,0,1,0]\ndy = [0,-1,0,1]\n\nfor i in range(r):\n for j in range(c):\n if(aux[i][j] == \"S\"):\n for k in range(4):\n if(-1 < i + dx[k] < r and -1 < j + dy[k] < c):\n x = i + dx[k]\n y = j + dy[k]\n if(aux[x][y] == \".\"):\n aux[x][y] = \"D\"\n elif(aux[x][y] == \"W\"):\n flag = True\n break\nif(flag):\n print(\"No\")\nelse:\n print(\"Yes\")\n for i in aux:\n print(\"\".join(i))\n\t\t \t \t\t \t\t \t\t \t\t \t \t \t", "R,C=map(int,input().split())\na=list()\na=[input().replace('.','D') for i in range(R)]\nflag='Yes'\nfor i in range(R):\n for j in range(C):\n if a[i][j]=='S':\n if 'W' in (a[max(0,i-1)][j],a[i][max(j-1,0)],a[min(i+1,R-1)][j],a[i][min(j+1,C-1)]):\n flag='No'\n break\nprint(flag)\nif flag=='Yes':\n for i in a:\n print(i)\n \t \t \t\t \t \t \t \t\t \t\t\t \t\t", "def main():\n r, c = map(int, input().split())\n \n farm = []\n\n for i in range(r):\n line = input()\n farm.append(list(line))\n\n for i in range(r):\n for j in range(c):\n if farm[i][j] == \"S\":\n\n top = i - 1\n bottom = i + 1\n left = j - 1\n right = j + 1\n\n if top >= 0:\n if farm[top][j] == \"W\":\n print(\"NO\")\n return\n elif farm[top][j] != \"S\":\n farm[top][j] = \"D\"\n \n if left >= 0:\n if farm[i][left] == \"W\":\n print(\"NO\")\n return\n elif farm[i][left] != \"S\":\n farm[i][left] = \"D\"\n\n if bottom < r:\n if farm[bottom][j] == \"W\":\n print(\"NO\")\n return\n elif farm[bottom][j] != \"S\":\n farm[bottom][j] = \"D\"\n\n if right < c:\n if farm[i][right] == \"W\":\n print(\"NO\")\n return\n elif farm[i][right] != \"S\":\n farm[i][right] = \"D\"\n\n print(\"YES\")\n for i in range(r):\n line = \"\"\n for j in range(c):\n line += farm[i][j]\n print(line)\n\nmain()\n\t\t\t \t \t \t \t \t\t\t \t\t\t", "r,c = list(map(int,input().strip().split(' ')))\nmatr = []\n\nmatr.append(list('.'*(c+2)))\nfor _ in range(r):\n matr.append(['.']+list(input())+['.'])\nmatr.append(matr[0].copy())\n\nfor row in range(1,r+1):\n for col in range(1,c+1):\n if matr[row][col] == 'S':\n if matr[row-1][col] == 'W' or matr[row+1][col] == 'W' or matr[row][col-1] == 'W' or matr[row][col+1] == 'W':\n print('No')\n exit(0)\n elif matr[row][col] == '.':\n matr[row][col] = 'D'\n\nprint('Yes')\nfor row in range(1,r+1):\n print(''.join(matr[row][1:c+1]))", "# Miguel Arriaga y Karla Mondragón\n\nR, C = map(int, input().split())\n\npasture = []\nfor i in range(R):\n pasture.append(list(input()))\n\npossible = True\nfor i in range(R):\n for j in range(C):\n if pasture[i][j] == 'S':\n if i > 0 and pasture[i-1][j] == 'W':\n possible = False\n elif j > 0 and pasture[i][j-1] == 'W':\n possible = False\n elif i < R-1 and pasture[i+1][j] == 'W':\n possible = False\n elif j < C-1 and pasture[i][j+1] == 'W':\n possible = False\n\nif possible:\n print(\"Yes\")\n for i in range(R):\n for j in range(C):\n if pasture[i][j] == '.':\n print(\"D\", end=\"\")\n else:\n print(pasture[i][j], end=\"\")\n print()\nelse:\n print(\"No\")\n\n \t \t\t\t \t\t\t\t\t \t \t \t \t\t\t\t\t \t \t", "nn, mm = map(int, input().split())\r\na = [''] * nn\r\nfor i in range(nn):\r\n a[i] += (input().replace('.','D'))\r\n if 'WS' in a[i] or 'SW' in a[i]:\r\n print('NO')\r\n exit(0)\r\nb = [''] * mm\r\nfor i in range(mm):\r\n for j in range(nn):\r\n b[i] += a[j][i]\r\n if 'WS' in b[i] or 'SW' in b[i]:\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\nfor i in range(nn):\r\n print(a[i])\r\n", "r, c =map(int, input().split(' '))\r\n\r\nl=[]\r\nfor i in range(r):\r\n\tl.append(input())\r\n\r\nk=0\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tif(i!=0 and l[i][j]=='S'):\r\n\t\t\tif(l[i-1][j]!='W' and l[i-1][j]!='S'):\r\n\t\t\t\tl[i-1]=l[i-1][:j] +'D'+ l[i-1][j+1:]\r\n\r\n\t\t\tif(l[i-1][j]=='W'):\r\n\t\t\t\tk=1\r\n\r\n\r\n\t\tif(i!=r-1 and l[i][j]=='S'):\r\n\t\t\tif(l[i+1][j]!='W' and l[i+1][j]!='S'):\r\n\t\t\t\tl[i+1]=l[i+1][:j] +'D' + l[i+1][j+1:]\r\n\r\n\t\t\tif(l[i+1][j]=='W'):\r\n\t\t\t\tk=1\r\n\r\n\t\tif(j!=0 and l[i][j]=='S'):\r\n\t\t\tif(l[i][j-1]!='W' and l[i][j-1]!='S'):\r\n\t\t\t\tl[i]= l[i][:(j-1)] +'D' +l[i][j:]\r\n\r\n\t\t\tif(l[i][j-1]=='W'):\r\n\t\t\t\tk=1\r\n\r\n\r\n\r\n\t\tif(j!=c-1 \tand l[i][j]=='S'):\r\n\t\t\tif(l[i][j+1]!='W' and l[i][j+1]!='S'):\r\n\t\t\t\tl[i]=l[i][:(j+1)] +'D'+l[i][(j+2):]\r\n\r\n\t\t\tif(l[i][j+1]=='W'):\r\n\t\t\t\tk=1\r\n\r\n\r\nif(k==0):\r\n\tprint('YES')\r\n\tfor a in l:\r\n\t\tprint(a)\r\n\r\n\r\nelse:\r\n\tprint('NO')\r\n\r\n\r\n\r\n\r\n", "r,c = map(int,input().split())\r\n\r\nmatrix = [list(input()) for _ in range(r)]\r\n\r\noutput = True\r\n\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tif matrix[i][j] == 'S':\r\n\t\t\tif i > 0: \r\n\t\t\t\tif matrix[i-1][j] == '.':\r\n\t\t\t\t\tmatrix[i-1][j] = 'D'\r\n\t\t\t\telif matrix[i-1][j] == 'W':\r\n\t\t\t\t\toutput = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif i < r-1: \r\n\t\t\t\tif matrix[i+1][j] == '.':\r\n\t\t\t\t\tmatrix[i+1][j] = 'D'\r\n\t\t\t\telif matrix[i+1][j] == 'W':\r\n\t\t\t\t\toutput = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif j > 0: \r\n\t\t\t\tif matrix[i][j-1] == '.':\r\n\t\t\t\t\tmatrix[i][j-1] = 'D'\r\n\t\t\t\telif matrix[i][j-1] == 'W':\r\n\t\t\t\t\toutput = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif j < c-1: \r\n\t\t\t\tif matrix[i][j+1] == '.':\r\n\t\t\t\t\tmatrix[i][j+1] = 'D'\r\n\t\t\t\tif matrix[i][j+1] == 'W':\r\n\t\t\t\t\toutput = False\r\n\t\t\t\t\tbreak\r\n\r\nif output:\r\n\tprint('Yes')\r\n\tfor i in range(r):\r\n\t\tout = ''\r\n\t\tfor j in range(c):\r\n\t\t\tout += matrix[i][j]\r\n\t\tprint(out)\r\n\r\nelse:\r\n\tprint('No')", "r,c = (int(x) for x in input().split())\r\n\r\ng = []\r\nfor i in range(r):\r\n g.append(input())\r\n\r\n# res = True\r\n\r\ndef fn():\r\n # global res\r\n for rr in range(r):\r\n for cc in range(c):\r\n if g[rr][cc] != 'W':\r\n continue\r\n if cc > 0 and g[rr][cc-1] == 'S':\r\n # res = False\r\n return False\r\n if cc < c-1 and g[rr][cc+1] == 'S':\r\n return False\r\n if rr > 0 and g[rr-1][cc] == 'S':\r\n return False\r\n if rr < r-1 and g[rr+1][cc] == 'S':\r\n return False\r\n return True\r\n\r\nres = fn()\r\nif not res:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for row in g:\r\n print(row.replace('.', 'D'))\r\n", "def main():\r\n v, e = map(int, input().split())\r\n g = []\r\n for i in range(v):\r\n s = []\r\n for i in list(input()):\r\n if i == \".\":\r\n i = \"D\"\r\n s.append(i)\r\n g.append(\"\".join(s))\r\n if \"SW\" in g[0] or \"WS\" in g[0]:\r\n print(\"No\")\r\n return \r\n for i in range(1, v):\r\n if \"SW\" in g[i] or \"WS\" in g[i]:\r\n print(\"No\")\r\n return\r\n for j in range(e):\r\n if g[i][j] == \"W\" and g[i - 1][j] == \"S\" or g[i][j] == \"S\" and g[i - 1][j] == \"W\":\r\n print(\"No\")\r\n return\r\n print(\"Yes\")\r\n for i in g:\r\n print(i)\r\n \r\n\r\nmain()", "n,m=map(int,input().split())\r\nl=[[0]*m for i in range(n)]\r\nflag=1\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n l[i][j]=s[j]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='S':\r\n for xd,yd in ([1,0],[0,1],[-1,0],[0,-1]):\r\n a=i+xd\r\n b=j+yd\r\n if 0<=a<n and 0<=b<m:\r\n if l[a][b]=='.':\r\n l[a][b]='D'\r\n elif l[a][b]=='W':\r\n flag=0\r\n \r\nif flag==0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for i in l:\r\n for j in i:\r\n print(j,end='')\r\n print()\r\n", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(input()))\r\ndef inlts():\r\n return(list(map(int,input().split(\" \"))))\r\ndef insr():\r\n s = input()\r\n return(s)\r\n\r\nr,c = inlts()\r\ngrid = []\r\nfor _ in range(r):\r\n grid.append(inlt())\r\ndirs = [(0,1),(1,0),(-1,0),(0,-1)]\r\npossible = True\r\nfor i in range(r):\r\n for j in range(c):\r\n if not possible:\r\n break\r\n if grid[i][j] == \"S\":\r\n for d in dirs:\r\n ni = i + d[0]\r\n nj = j + d[1]\r\n if 0<=ni<r and 0<=nj<c:\r\n if grid[ni][nj] == \".\":\r\n grid[ni][nj] = \"D\"\r\n elif grid[ni][nj] == \"W\":\r\n possible = False\r\n break\r\nif possible:\r\n print(\"Yes\")\r\n for row in grid:\r\n print(\"\".join(row))\r\nelse:\r\n print(\"No\")\r\n", "def solution(linhas,n,ll):\n for l in range(len(linhas)):\n for j in range(len(linhas[l])):\n if linhas[l][j] == \"W\":\n if j > 0 and linhas[l][j - 1] == \"S\":\n print(\"NO\")\n return\n elif j < ll - 1 and linhas[l][j + 1] == \"S\":\n print(\"NO\")\n return\n elif l > 0 and linhas[l-1][j] == \"S\":\n print(\"NO\")\n return\n elif l < n - 1 and linhas[l+1][j] == \"S\":\n print(\"NO\")\n return\n print(\"YES\")\n for l in linhas:\n print(l)\n\nn, placebo = map(int, input().split())\nlinhas = []\nfor i in range(n):\n linhas.append(input().replace(\".\",\"D\"))\n\nsolution(linhas,n,placebo)", "n,m=map(int,input().split())\r\nz=[]\r\nflag=\"YES\"\r\nfor _ in range(n):\r\n\ts=list(input())\r\n\tfor i in range(m):\r\n\t\tif s[i]==\".\":\r\n\t\t\ts[i]=\"D\"\r\n\tz.append(\"\".join(s))\r\n\t# print(z[_])\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\ta,b,c,d=1,1,1,1\r\n\t\tif z[i][j]==\"W\":\r\n\t\t\tk=0\r\n\t\t\twhile a!=0 and b!=0 and c!=0 and d!=0:\r\n\t\t\t\tk+=1\r\n\t\t\t\tif a!=0 and j-k>=0:\r\n\t\t\t\t\tif z[i][j-k]==\"D\":\r\n\t\t\t\t\t\ta=0\r\n\t\t\t\t\telif z[i][j-k]==\"S\":\r\n\t\t\t\t\t\tflag=\"NO\"\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\ta=0\r\n\t\t\t\tif b!=0 and j+k<m:\r\n\t\t\t\t\tif z[i][j+k]==\"D\":\r\n\t\t\t\t\t\tb=0\r\n\t\t\t\t\telif z[i][j+k]==\"S\":\r\n\t\t\t\t\t\tflag=\"NO\"\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tb=0\r\n\t\t\t\tif c!=0 and i+k<n:\r\n\t\t\t\t\tif z[i+k][j]==\"D\":\r\n\t\t\t\t\t\tc=0\r\n\t\t\t\t\telif z[i+k][j]==\"S\":\r\n\t\t\t\t\t\tflag=\"NO\"\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tc=0\r\n\t\t\t\tif d!=0 and i-k>=0:\r\n\t\t\t\t\tif z[i-k][j]==\"D\":\r\n\t\t\t\t\t\td=0\r\n\t\t\t\t\telif z[i-k][j]==\"S\":\r\n\t\t\t\t\t\tflag=\"NO\"\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\td=0\r\n\t\tif flag==\"NO\":\r\n\t\t\tbreak\r\n\tif flag==\"NO\":\r\n\t\tbreak\r\nif flag==\"YES\":\r\n\tprint(flag)\r\n\tfor i in z:\r\n\t\tprint(i)\r\nelse:\r\n\tprint(flag)", "n,m=map(int, input().split())\r\nl=[list(input()) for i in range(n)]\r\n#print(l)\r\nf=1\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='S':\r\n if i-1>=0:\r\n if l[i-1][j]=='.':\r\n l[i-1][j]='D'\r\n elif l[i-1][j]=='W':\r\n f=0\r\n break\r\n if j-1>=0:\r\n if l[i][j-1]=='.':\r\n l[i][j-1]='D'\r\n elif l[i][j-1]=='W':\r\n f=0\r\n break\r\n if i+1<n:\r\n if l[i+1][j]=='.':\r\n l[i+1][j]='D'\r\n elif l[i+1][j]=='W':\r\n f=0\r\n break\r\n if j+1<m:\r\n if l[i][j+1]=='.':\r\n l[i][j+1]='D'\r\n elif l[i][j+1]=='W':\r\n f=0\r\n break\r\n if f==0:\r\n break\r\nif f:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(''.join(l[i]))\r\nelse:\r\n print(\"NO\")", "from math import *\r\nfrom collections import *\r\nn,m = map(int,input().split())\r\nflag = 0\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\n for i in range(m):\r\n if(a[-1][i]) == '.':\r\n a[-1][i] = 'D'\r\nfor i in range(n):\r\n for j in range(m):\r\n if(a[i][j] == 'S'):\r\n if i > 0:\r\n if(a[i-1][j] == 'W'):\r\n flag = 1\r\n if j > 0:\r\n if(a[i][j-1] == 'W'):\r\n flag = 1\r\n if i < n-1:\r\n if(a[i+1][j] == 'W'):\r\n flag = 1\r\n if j < m-1:\r\n if(a[i][j+1] == 'W'):\r\n flag = 1\r\n\r\nif flag == 1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in a:\r\n print(\"\".join(i))\r\n\r\n", "pairs= [int(s) for s in input().split(\" \")]\r\nR = int(pairs[0])\r\nC = int(pairs[1])\r\n\r\ndef convert(s):\r\n if s == '.':\r\n return 0\r\n elif s == 'S':\r\n return 1\r\n else:\r\n return 2\r\nlines =[]\r\nmatrix = []\r\nfor i in range(R):\r\n inpt= input()\r\n lines.append(inpt.replace('.', 'D'))\r\n matrix.append([convert(s) for s in list(inpt)])\r\n\r\ncan = True\r\nfor i in range(R):\r\n for j in range(C):\r\n if matrix[i][j]==1:\r\n if i > 0:\r\n if matrix[i-1][j]==2:\r\n can= False\r\n break\r\n if i < (R-1):\r\n if matrix[i+1][j]==2:\r\n can=False\r\n break\r\n if j > 0:\r\n if matrix[i][j-1]==2:\r\n can=False\r\n break\r\n if j < (C-1):\r\n if matrix[i][j+1]==2:\r\n can=False\r\n break\r\nif can == True:\r\n print(\"Yes\")\r\n for line in lines:\r\n print(line)\r\nelse:\r\n print(\"No\")", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\nm,n=ris()\r\ngrid=[list(rl()) for _ in range(m)]\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if grid[i][j]!='S':\r\n continue\r\n for di,dj in d4:\r\n ni,nj=i+di,j+dj\r\n if not (0<=ni<m and 0<=nj<n):\r\n continue\r\n if grid[ni][nj]=='W':\r\n print('NO')\r\n exit()\r\n if grid[ni][nj]!='.':\r\n continue\r\n grid[ni][nj]='D'\r\n \r\nprint('YES')\r\nfor row in grid:\r\n print(''.join(row))\r\n", "\r\ndef placeDogs(grid,r,c):\r\n for i in range(r):\r\n for j in range(c):\r\n if grid[i][j]==\"S\":\r\n for delta in [(0,1),(1,0),(-1,0),(0,-1)]:\r\n neighbi,neighbj=i+delta[0],j+delta[1]\r\n if 0<=neighbi<r and 0<=neighbj<c:\r\n if grid[neighbi][neighbj]==\"W\":\r\n return False\r\n elif grid[neighbi][neighbj]==\".\":\r\n grid[neighbi][neighbj]=\"D\"\r\n return True\r\nif __name__ == '__main__':\r\n #fptr = open(os.environ['OUTPUT_PATH'], 'w')\r\n r,c = map(int,input().split())\r\n grid=[]\r\n for _ in range(r):\r\n grid.append(list(input()))\r\n if placeDogs(grid,r,c):\r\n print(\"Yes\")\r\n for row in grid:\r\n print(''.join(row))\r\n else:\r\n print(\"No\")", "def sol():\r\n r,c=map(int,input().split())\r\n A=[[]]*r\r\n for i in range(r):\r\n A[i]=[p for p in input()]\r\n #print(A[i])\r\n ans=\"YES\"\r\n for i in range(r):\r\n for j in range(c):\r\n if(j<c-1 and A[i][j]=='S' and A[i][j+1]=='W'):\r\n print(\"NO\")\r\n return\r\n if(j>0 and A[i][j]=='S' and A[i][j-1]=='W'):\r\n print(\"NO\")\r\n return\r\n for i in range(c):\r\n for j in range(r):\r\n if(j<r-1 and A[j][i]=='S' and A[j+1][i]=='W'):\r\n print(\"NO\")\r\n return\r\n if(j>0 and A[j][i]=='S' and A[j-1][i]=='W'):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n for i in range(r):\r\n for j in range(c):\r\n if(A[i][j]=='.'):\r\n print(\"D\",end=\"\")\r\n else:\r\n print(A[i][j],end=\"\")\r\n print(\"\")\r\nif(__name__=='__main__'):\r\n sol()\r\n", "\r\nr, c = map(int, input().strip().split())\r\npasture = []\r\nfor x in range(r):\r\n pasture.append(list(input().strip()))\r\n\r\nexists = True\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if pasture[i][j] == 'S':\r\n if j != 0 and pasture[i][j - 1] == 'W':\r\n exists = False\r\n break\r\n if j != c - 1 and pasture[i][j + 1] == 'W':\r\n exists = False\r\n break\r\n if i != 0 and pasture[i - 1][j] == 'W':\r\n exists = False\r\n break\r\n if i != r - 1 and pasture[i + 1][j] == 'W':\r\n exists = False\r\n break\r\n\r\nif exists:\r\n print(\"Yes\")\r\n for i in range(r):\r\n for j in range(c):\r\n if pasture[i][j] == '.':\r\n print('D', end = '')\r\n else:\r\n print(pasture[i][j], end = '')\r\n print()\r\nelse:\r\n print(\"No\")", "r,c = map(int,input().split())\r\nl=[]\r\nf=1\r\nfor i in range(r):\r\n s=input()\r\n l.append(s)\r\n if('SW' in s or 'WS' in s):\r\n f=0\r\nif(f):\r\n for i in range(c):\r\n col=\"\"\r\n for j in range(r):\r\n col+=l[j][i]\r\n if('SW' in col or 'WS' in col):\r\n f=0\r\n break\r\n if(f==0):\r\n break\r\nif(f):\r\n print('Yes')\r\n for i in l:\r\n for j in i:\r\n if(j=='.'):\r\n print('D', end=\"\")\r\n else:\r\n print(j, end=\"\")\r\n print()\r\nelse:\r\n print('No')\r\n \r\n\r\n \r\n ", "r, c = map(int, input().split())\nm = [input() for _ in range(r)]\nans = False\nfor i in range(r):\n for j in range(c):\n if i + 1 < r and (m[i + 1][j] + m[i][j]) in (\"SW\", \"WS\"):\n print(\"NO\")\n exit(0)\n if j + 1 < c and (m[i][j + 1] + m[i][j]) in (\"SW\", \"WS\"):\n print(\"NO\")\n exit(0)\n\nprint(\"YES\")\nfor i in m:\n print(''.join(map(lambda x: x.replace(\".\", \"D\"), i)))\n", "def checksheep(r, c):\n global nrows, ncols, grid\n if r > 0:\n if grid[r-1][c] == 'S':\n return True\n if r < nrows-1:\n if grid[r+1][c] == 'S':\n return True\n if c > 0:\n if grid[r][c-1] == 'S':\n return True\n if c < ncols-1:\n if grid[r][c+1] == 'S':\n return True\n return False\n\n\nnrows, ncols = map(int, input().split())\ngrid = []\nwolves = []\nfor i in range(nrows):\n grid.append(input())\n for j in range(ncols):\n if grid[i][j] == 'W':\n wolves.append([i, j])\n\nfor wolf in wolves:\n if checksheep(wolf[0], wolf[1]):\n print('No')\n exit()\n\nprint('Yes')\nfor i in grid:\n for j in i:\n if j == '.':\n print('D', end='')\n else:\n print(j, end='')\n print()\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\nF = []\r\nfor i in range(n):\r\n F.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n if F[i][j] == '.':\r\n F[i][j] = 'D'\r\n if F[i][j] == 'S' and (i > 0 and F[i-1][j] == 'W' or i < n -1 and F[i+1][j] == 'W' or j > 0 and F[i][j-1] == 'W' or j < m - 1 and F[i][j+1] == 'W'):\r\n print('No')\r\n quit()\r\n\r\n\r\n\r\n\r\nprint('Yes')\r\nfor i in F:\r\n print(*i,sep='')", "def is_safe(field):\r\n \r\n for row in field:\r\n if 'SW' in row or 'WS' in row:\r\n return False\r\n\r\n field_r = list()\r\n\r\n for i in range(len(field[0])):\r\n field_r.append(''.join(row[i] for row in field))\r\n\r\n for col in field_r:\r\n if 'SW' in col or 'WS' in col:\r\n return False\r\n\r\n return True\r\n\r\nR, C = map(int, input().split())\r\n\r\nfield = list()\r\n\r\nfor _ in range(R):\r\n field.append(input())\r\n\r\nif is_safe(field):\r\n print('Yes')\r\n for row in field:\r\n print(row.replace('.', 'D'))\r\nelse:\r\n print('No')", "r,c=map(int,input().split())\r\np=[input().replace('.','D')for _ in[0]*r]\r\nif any(any('SW'in s or'WS'in s for s in x)for x in(p,(''.join(t)for t in zip(*p)))):print('No')\r\nelse:print('Yes');print(*p,sep='\\n')", "# Miguel\n# Iwalani\n# Tonatiuh\n\ndef dogs(matrix, board, empty, wolf_num):\n if wolf_num != 0:\n for i in range(len(empty)):\n matrix[empty[i][0]][empty[i][1]] = \"D\"\n\n print(\"Yes\")\n for i in range(board[0]):\n print(\"\".join(map(str, matrix[i])))\n return 0\n\ndef main():\n # Size of the board\n board = list(map(int, input().strip().split()))[:2]\n matrix = []\n # Cell assignments and first filter to see if there are wolves and sheep together\n empty = []\n wolf_num = 0\n wolfshiptogehther = False\n # column\n for i in range(board[0]):\n # row\n row = list(str(input()))\n matrix.append(row)\n for j in range(board[1]):\n elem = row[j]\n if j != 0 and elem != \".\":\n if row[j-1] != elem and row[j-1] != \".\":\n wolfshiptogehther = True\n break\n if i != 0 and elem != \".\":\n if matrix[i-1][j] != elem and matrix[i-1][j] != \".\":\n wolfshiptogehther = True\n break\n if elem == \".\":\n empty.append([i, j])\n elif elem == \"W\":\n wolf_num += 1\n if wolfshiptogehther == True:\n break\n\n if wolfshiptogehther == True:\n print(\"No\")\n else:\n dogs(matrix, board, empty, wolf_num)\n\nmain()\n\t\t\t\t \t \t \t\t\t \t \t\t\t \t\t \t", "pasture = [input() for _ in range(int(input().split()[0]))]\r\nfor row in pasture:\r\n if 'SW' in row or 'WS' in row:\r\n print('No')\r\n break\r\nelse:\r\n for column in map(''.join, zip(*pasture)):\r\n if 'SW' in column or 'WS' in column:\r\n print('No')\r\n break\r\n else:\r\n print('Yes')\r\n for row in pasture:\r\n print(row.replace('.', 'D'))", "def FillDogs(pasture,r,c):\r\n for i in range(r):\r\n for j in range(c):\r\n if pasture[i][j] == '.':\r\n pasture[i][j] = 'D'\r\n\r\ndef IsPossible(pasture,r,c):\r\n for i in range(r):\r\n for j in range(c-1):\r\n if pasture[i][j] == 'S' and pasture[i][j+1] == 'W':\r\n return False\r\n if pasture[i][j] == 'W' and pasture[i][j+1] == 'S':\r\n return False\r\n for i in range(c):\r\n for j in range(r-1):\r\n if pasture[j][i] == 'S' and pasture[j+1][i] == 'W':\r\n return False\r\n if pasture[j][i] == 'W' and pasture[j+1][i] == 'S':\r\n return False\r\n return True\r\n\r\ndef PrintPasture(pasture,r,c):\r\n pasture_new = []\r\n for i in pasture:\r\n new = ''\r\n for j in i:\r\n new += j\r\n pasture_new.append(new)\r\n\r\n for i in pasture_new:\r\n print (i)\r\n\r\ndef main():\r\n r,c = map(int,input().split())\r\n pasture = []\r\n for i in range(r):\r\n pasture.append(list(input()))\r\n\r\n FillDogs(pasture,r,c)\r\n\r\n if IsPossible(pasture,r,c):\r\n print ('Yes')\r\n PrintPasture(pasture,r,c)\r\n else:\r\n print ('No')\r\n\r\nmain()\r\n", "from collections import defaultdict, deque\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n##############################################################################\r\nr,c = list(map(int,input().split()))\r\na = [(\"D\"*(c+2))]\r\nfor i in range(r):\r\n temp = input()\r\n temp = \"D\"+temp+\"D\"\r\n a.append(temp.replace('.','D'))\r\na.append(\"D\"*(c+2))\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n if a[i][j] == 'W' and (a[i+1][j] == 'S' or a[i-1][j] == 'S' or a[i][j+1] == 'S' or a[i][j-1] == 'S'):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in range(1,r+1):\r\n print(a[i][1:c+1])\r\n", "num_de_linhas, num_de_colunas = map(int, input().split())\n\ncampo = []\nfor i in range(num_de_linhas):\n linha = list(input().strip())\n campo.append(linha) \n\nflag = False\nfor i in range(num_de_linhas):\n if(flag):\n break\n for j in range(num_de_colunas):\n if(campo[i][j] == \".\"):\n campo[i][j] = \"D\"\n continue\n if(campo[i][j] == \"S\"):\n if(((i - 1) >= 0) and (campo[i-1][j] == \"W\")):\n flag = True\n break\n if(((i + 1) < num_de_linhas) and (campo[i+1][j] == \"W\")):\n flag = True\n break\n if(((j - 1) >= 0) and (campo[i][j-1] == \"W\")):\n flag = True\n break\n if(((j + 1) < num_de_colunas) and (campo[i][j+1] == \"W\")):\n flag = True\n break\n\nif flag:\n print(\"No\")\nelse:\n print(\"Yes\")\n for linha in campo:\n print(\"\".join(linha))\n\t \t \t\t \t \t\t\t\t\t \t\t \t \t\t \t \t\t", "# Entrada\nl,c = [int(x) for x in input().split()]\n\ninp = l\n\npossible = True\n\nmatriz = []\nwolves = []\n\ni = 0\nwhile inp:\n seq = input()\n matriz.append(seq)\n\n for j in range(len(seq)):\n if seq[j] == \"W\":\n wolves.append((i,j)) #(lista,índice)\n\n i += 1\n inp -=1\n\n# Solution\nfor i in wolves:\n #Esquerda\n if i[1] != 0:\n if matriz[i[0]][i[1]-1] == \"S\":\n possible = False\n break\n\n #Direita\n if i[1] != len(matriz[i[0]])-1:\n if matriz[i[0]][i[1]+1] == \"S\":\n possible = False\n break\n\n #Cima\n if i[0] != 0:\n if matriz[i[0]-1][i[1]] == \"S\":\n possible = False\n break\n\n #Baixo\n if i[0] != len(matriz)-1:\n if matriz[i[0]+1][i[1]] == \"S\":\n possible = False\n break\n\n\n# Output\nif possible:\n print(\"Yes\")\n\n for i in range(len(matriz)):\n seq = \"\"\n for j in range(len(matriz[i])):\n if matriz[i][j] == \".\":\n seq+=\"D\"\n else:\n seq+=matriz[i][j]\n print(seq)\n\n\nelse:\n print(\"No\")\n\t\t \t\t \t \t \t \t \t \t\t\t \t\t \t \t \t", "primera_linea = input()\r\nr,c = primera_linea.split(' ')\r\nr = int(r)\r\nc = int(c)\r\n\r\narea = []\r\nfor i in range(r):\r\n fila = input()\r\n area.append(list(fila))\r\n\r\nrespuesta = 'Yes'\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if area[i][j] == '.':\r\n area[i][j] = 'D'\r\n if area[i][j] == 'S':\r\n if i > 0 and area[i-1][j] == 'W':\r\n respuesta = 'No'\r\n if i < r-1 and area[i+1][j] == 'W':\r\n respuesta = 'No'\r\n if j > 0 and area[i][j-1] == 'W':\r\n respuesta = 'No'\r\n if j < c-1 and area[i][j+1] == 'W':\r\n respuesta = 'No'\r\n\r\nprint(respuesta)\r\nif respuesta == 'Yes':\r\n for i in range(r):\r\n print(''.join(area[i]))", "import sys\r\ndir = [[1,0],[-1,0],[0,1],[0,-1]]\r\nfor val in sys.stdin:\r\n n,m=val.split()\r\n n,m=int(n),int(m)\r\n mp=[]\r\n for val in range(n):\r\n val=input()\r\n mp.append(val)\r\n ifeat = 0\r\n for i in range(n):\r\n if(ifeat==1):\r\n break\r\n for j in range(m):\r\n if(ifeat==1):\r\n break\r\n if(mp[i][j] == 'S'):\r\n for k in range(4):\r\n xx=i+dir[k][0]\r\n yy=j+dir[k][1]\r\n if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':\r\n if(mp[xx][yy]=='W'):\r\n ifeat=1\r\n break\r\n mp[xx]=mp[xx].replace(mp[xx][yy],'D')\r\n if ifeat==1:\r\n print('No')\r\n else:\r\n print(\"Yes\")\r\n for i in range(n):\r\n print(mp[i])", "########################################################################\r\n\"#######################################################################\"\r\n########################################################################\r\n\"Author = Fasih_ur_Rehman\"\r\n \r\n#| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#| <> <> <> <> <> <> <> <> <> ####\r\n\"_________ ____ _____ ___ __ __ \"\r\n#| \\ / \\/ / \\ |\\ \\ | \\ | \\ ####\r\n\"| ▓▓█████▓ /▓█████\\ ▓▓▓▓▓▓\\| | ███ | ██ | ██ ####\"\r\n#| ▓▓_____ ▓▓__| ▓▓ ██___\\██| | ▓▓▓ | ▓▓__| ▓▓ ####\r\n\"| ██ \\ ▓▓ ▓▓ \\██ \\ | ███ | ▓▓ ▓▓ ####\"\r\n#| ▓▓▓████▓ ████████ \\▓▓▓▓▓▓\\ | ▓▓▓ | ████████ ####\r\n\"| ██ ▓▓ | ▓▓ \\__| ██| | ███ | ▓▓ | ▓▓ ####\"\r\n#| ▓▓ ▓▓ | ▓▓ \\██ ██| | ▓▓▓ | ▓▓ | ▓▓ ####\r\n\"\\_██ ██ \\██ \\▓▓▓▓▓▓/ \\_███ \\_██ \\_██ ####\"\r\n\r\n#| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#| <> <> <> <> <> <> <> <> <> ####\r\n\r\n\"#######################################################################\" \r\n######################################################################## \r\n\"#######################################################################\" \r\na,b = map(int,input().split())\r\nx = [input() for i in range(a)]\r\nfor i in range(a):\r\n if \"WS\" in x[i] or \"SW\" in x[i]:\r\n print(\"NO\")\r\n exit()\r\n if i!=a-1:\r\n for j in range(b):\r\n if x[i][j]+x[i+1][j] in [\"WS\",\"SW\"]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in range(a):\r\n print(\"\".join(x[i].replace(\".\",\"D\")))", "z=lambda u:any(x in ''.join(y)for x in['WS','SW']for y in u)\r\nr,c=map(int,input().split())\r\na=[input().replace(\".\",\"D\")for _ in[0]*r]\r\nif z(a)or z([*zip(*a)]):print('No')\r\nelse:\r\n print('Yes')\r\n for x in a:print(x)", "R, C = map(int, input().split())\nr = []\nfor i in range(0, R):\n v = input().replace('.', 'D')\n v = 'X' + v + 'X'\n r.append(v)\nr = ['X' * (C + 1)] + r + ['X' * (C + 1)]\nIM = False\nfor i in range(1, R + 1):\n for j in range(1, C + 1):\n if r[i][j] == 'W':\n ud = r[i + 1][j] == 'S' or r[i - 1][j] == 'S'\n lr = r[i][j + 1] == 'S' or r[i][j - 1] == 'S'\n if lr or ud:\n IM = True\nif IM:\n print(\"No\")\nelse:\n print(\"Yes\")\n for i in range(1, R + 1):\n print(r[i][1:C + 1])\n", "[rows, cols] = [int(i) for i in input().split()]\r\n\r\npasture = []\r\n\r\ndef dfs_can_reach_sheep(i, j, visited, pasture):\r\n if i < 0 or j < 0 or i >= len(pasture) or j >= len(pasture[0]):\r\n return False\r\n \r\n if pasture[i][j] == 'S':\r\n return True\r\n\r\n if (i, j) in visited or pasture[i][j] == 'D':\r\n return False\r\n \r\n visited.add((i, j))\r\n \r\n return dfs_can_reach_sheep(i + 1, j, visited, pasture) \\\r\n or dfs_can_reach_sheep(i - 1, j, visited, pasture) \\\r\n or dfs_can_reach_sheep(i, j + 1, visited, pasture) \\\r\n or dfs_can_reach_sheep(i, j - 1, visited, pasture)\r\n\r\n# put a dog in every empty square\r\n\r\nfor _ in range(rows):\r\n row_string = input()\r\n row = []\r\n for char in row_string:\r\n if char == '.':\r\n row.append('D')\r\n else:\r\n row.append(char)\r\n pasture.append(row)\r\n\r\n\r\nvisited = set()\r\n\r\nds = [[0, 1], [1, 0], [-1, 0], [0, -1]]\r\n\r\ndef in_bounds(i, j, pasture):\r\n return i >= 0 and j >= 0 and i < len(pasture) and j < len(pasture[0])\r\n\r\nfor i in range(rows):\r\n for j in range(cols):\r\n if pasture[i][j] == 'W':\r\n for d in ds:\r\n new_i, new_j = i + d[0], j + d[1]\r\n if in_bounds(new_i, new_j, pasture):\r\n if pasture[new_i][new_j] == 'S':\r\n print('No')\r\n quit()\r\n # if pasture[i][j] == 'W':\r\n # if (i, j) in visited:\r\n # continue\r\n # if dfs_can_reach_sheep(i, j, visited, pasture):\r\n # print('No')\r\n # quit()\r\n\r\nprint('Yes')\r\nfor row in pasture:\r\n print(''.join(row))\r\n\r\n", "r, c = map(int, input().split())\r\na = [input() for _ in range(r)]\r\n\r\nfor i in range(r):\r\n\tif 'WS' in a[i] or 'SW' in a[i]:\r\n\t\tprint('No')\r\n\t\texit()\r\n\tif i != r - 1:\r\n\t\tfor j in range(c):\r\n\t\t\tif a[i][j] + a[i+1][j] in ['WS', 'SW']:\r\n\t\t\t\tprint('No')\r\n\t\t\t\texit()\r\nprint('Yes')\r\nfor i in range(r):\r\n print(''.join(a[i].replace('.', 'D')))", "r, c = [int(rc) for rc in input().split()] \r\na = []\r\n\r\nfor i in range(r):\r\n a.append(list(input()))\r\n\r\nres = \"YES\"\r\n\r\nfor i in range(r):\r\n for j in range(c-1):\r\n if a[i][j+1] == \"W\" and a[i][j] ==\"S\" or a[i][j] == \"W\" and a[i][j+1]==\"S\":\r\n res = \"NO\" \r\n break\r\n\r\nfor i in range(r-1):\r\n for j in range(c):\r\n if a[i+1][j] == \"W\" and a[i][j] ==\"S\" or a[i][j] == \"W\" and a[i+1][j]==\"S\":\r\n res = \"NO\" \r\n break\r\n\r\nprint(res)\r\nif res == \"YES\":\r\n for i in range(r):\r\n row = \"\"\r\n for j in a[i]:\r\n if j == \".\":\r\n row = row + \"D\"\r\n continue\r\n row = row + j\r\n print(row)\r\n", "import os\r\n\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n rows, cols = invr()\r\n ok = True\r\n answers = []\r\n matrix = []\r\n for i in range(rows):\r\n row = insr()\r\n matrix.append(list(row))\r\n for i in range(rows):\r\n for j in range(cols):\r\n if matrix[i][j] == \".\":\r\n matrix[i][j] = \"D\"\r\n elif matrix[i][j] == \"W\":\r\n if i > 0:\r\n if matrix[i - 1][j] == \"S\":\r\n ok = False\r\n break\r\n if i < rows - 1:\r\n if matrix[i + 1][j] == \"S\":\r\n ok = False\r\n break\r\n if j > 0:\r\n if matrix[i][j - 1] == \"S\":\r\n ok = False\r\n break\r\n if j < cols - 1:\r\n if matrix[i][j + 1] == \"S\":\r\n ok = False\r\n break\r\n if not ok:\r\n break\r\n if ok:\r\n print(\"Yes\")\r\n for row in matrix:\r\n print(\"\".join(row))\r\n else:\r\n print(\"No\")\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nleft right each coord\r\n'''\r\ndef euclid(x1, y1, x2, y2):\r\n return math.sqrt((x1-x2)**2 + (y1-y2)**2)\r\n\r\ndef solve():\r\n r, c = MII()\r\n grid = [[''] * c for _ in range(r)]\r\n directions = [[0,1],[1,0],[0,-1],[-1,0]]\r\n\r\n for x in range(r):\r\n row = I().strip()\r\n for y in range(c):\r\n grid[x][y] = row[y]\r\n\r\n possible = True\r\n # Scan and replace\r\n for x in range(r):\r\n for y in range(c):\r\n if grid[x][y] == 'S':\r\n for dx, dy in directions:\r\n dx += x\r\n dy += y\r\n if 0 <= dx and dx < r and 0 <= dy and dy < c:\r\n if grid[dx][dy] == 'W':\r\n possible = False\r\n elif grid[dx][dy] == '.':\r\n grid[dx][dy] = 'D'\r\n\r\n if not possible:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for row in grid:\r\n WNS(row)\r\n\r\nsolve()", "def solution():\n rows,columnns=map(int, input().split())\n area=[]\n for i in range(rows):\n row= list(input())\n area.append(row)\n\n for i in range(rows):\n for j in range(columnns):\n if area[i][j]==\"S\":\n if ((i<rows-1) and area[i+1][j]==\"W\"):\n print(\"No\", end=\"\")\n return\n elif ((i<rows-1) and area[i+1][j]==\".\"):\n area[i+1][j]=\"D\"\n if (i>0 and area[i-1][j]==\"W\"):\n print(\"No\", end=\"\")\n return\n elif ((i>0) and area[i-1][j]==\".\"):\n area[i-1][j]=\"D\"\n if ((j<columnns-1) and area[i][j+1]==\"W\"):\n print(\"No\", end=\"\")\n return\n elif ((j<columnns-1) and area[i][j+1]==\".\"):\n area[i][j+1]=\"D\"\n if ((j>0) and area[i][j-1]==\"W\"):\n print(\"No\", end=\"\")\n return\n elif ((j>0) and area[i][j-1]==\".\"):\n area[i][j-1]=\"D\"\n print(\"Yes\") \n for i in range(rows):\n for j in range(columnns):\n print(area[i][j], end=\"\")\n if i< rows-1:\n print()\n \nsolution()\n \t \t\t\t \t\t \t \t \t \t \t \t \t", "r,c=map(int,input().split())\r\na=['D'*(2+c)]\r\nfor i in range(r):\r\n\ta.append('D'+input().replace('.','D')+'D')\r\na.append('D'*(2+c))\r\nfor i in range(1,r+1):\r\n\tif 'SW' in a[i] or 'WS' in a[i]:\r\n\t\texit(print('NO'))\r\n\tfor t in range(1,c+1):\r\n\t\tif a[i][t]=='W':\r\n\t\t\tif a[i-1][t]=='S':exit(print('NO'))\r\n\t\t\tif a[i+1][t]=='S':exit(print('NO'))\r\nprint('YES')\r\nfor i in range(1,r+1):\r\n\tprint(a[i][1:c+1])", "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_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,m = get_list()\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(list(get_string().replace('.','D')))\r\n\r\nflag = True\r\nfor i in range(n):\r\n if not flag:\r\n break\r\n\r\n for j in range(m-1):\r\n if matrix[i][j] == 'S' and matrix[i][j+1] == 'W' or matrix[i][j] == 'W' and matrix[i][j+1] == 'S':\r\n flag = False\r\n break\r\nfor j in range(m):\r\n if not flag:\r\n break\r\n \r\n for i in range(n-1):\r\n if matrix[i][j] == 'S' and matrix[i+1][j] == 'W' or matrix[i][j] == 'W' and matrix[i+1][j] == 'S':\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\n for i in range(n):\r\n print(''.join(matrix[i]))\r\nelse:\r\n print(\"NO\")\r\n ", "\ndef wolf(x,y,m):\n for i in range(x):\n for j in range(y):\n if(m[i][j] == '.'):\n m[i][j] = 'D'\n elif(m[i][j] == 'W'):\n if(j > 0):\n if(m[i][j-1] == 'S'):\n print(\"NO\")\n exit(0)\n if(j < y - 1):\n if(m[i][j+1] == 'S'):\n print(\"NO\")\n exit(0)\n if(i < x - 1):\n if(m[i+1][j] == 'S'):\n print(\"NO\")\n exit(0)\n if(i > 0):\n if(m[i-1][j] == 'S'):\n print(\"NO\")\n exit(0)\n print(\"YES\") \n for r in m:\n print(''.join(r)) \nnm = input().split()\nn = list(map(int, nm))\nm = [None]*n[0]\nfor i in range(n[0]):\n arr = input()\n m[i] = list(arr)\nwolf(n[0],n[1],m)\n\t \t\t\t\t\t \t \t\t \t \t\t \t \t\t\t \t", "R,C = map(int,input().split())\r\ncells = []\r\nfor i in range(R):\r\n cell = input()\r\n if 'SW' in cell or 'WS' in cell:\r\n print ('NO')\r\n break\r\n cells.append(cell.replace('.','D'))\r\nelse:\r\n YN = True\r\n for i in range(C):\r\n if R == 1:\r\n break\r\n for j in range(R-1):\r\n if cells[j][i] + cells[j+1][i] == 'SW' or cells[j][i] + cells[j+1][i] == 'WS':\r\n YN = False\r\n break\r\n if YN:\r\n print ('Yes')\r\n for i in range(R):\r\n print (cells[i])\r\n else:\r\n print ('NO')\r\n", "dx = [1,0,-1,0];dy = [0,-1,0,1]\ndef check(y,x):\n if ls[y][x] != 'S':return True\n else:\n for i in range(0,4):\n tx = x + dx[i]\n ty = y + dy[i]\n try:\n if ls[ty][tx] == 'W':\n return False\n elif ls[ty][tx] == '.':\n ls[ty][tx] = 'D'\n except:pass\n return True\n\ndef output():\n for i in range(1, R + 1):\n s = ''\n for j in range(1, C + 1):\n s += ls[i][j]\n print(s)\n\nR,C = map(int,input().split())\nls = [0 for i in range(505)]\nflag = True\nfor i in range(1,R+1):\n ls[i] = [ls[i]] + list(input())\nfor i in range(1,R+1):\n for j in range(1,C+1):\n if not check(i,j):\n flag = False\n break\n else:continue\n break\nif flag == False: print('No')\nelse:\n print('Yes')\n output()\n \t\t \t\t \t\t \t \t\t\t\t \t\t \t", "n, m = map(int, input().split())\r\ng = [input() for _ in range(n)]\r\nmode = True\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'S':\r\n if i - 1 >= 0 and g[i - 1][j] == 'W':\r\n mode = 0\r\n if j - 1 >= 0 and g[i][j - 1] == 'W':\r\n mode = 0\r\n if i + 1 < n and g[i + 1][j] == 'W':\r\n mode = 0\r\n if j + 1 < m and g[i][j + 1] == 'W':\r\n mode = 0\r\nif mode:\r\n print(\"Yes\")\r\n print('\\n'.join(''.join('D' if v == '.' else v for v in row) for row in g))\r\nelse:\r\n print(\"No\")\r\n", "r, c = list(map(int,input().split()))\r\nmat=[[0]*c]*r\r\ndef protect(i, j):\r\n if(i - 1 >= 0):\r\n if mat[i-1][j]==\"W\":\r\n return False\r\n if(i + 1 < r):\r\n if mat[i+1][j]==\"W\":\r\n return False\r\n if(j - 1 >= 0):\r\n if mat[i][j-1]==\"W\":\r\n return False\r\n if(j + 1 < c):\r\n if mat[i][j+1]==\"W\":\r\n return False\r\n\r\ndef sheep():\r\n for i in range(r):\r\n t = input()\r\n mat[i] = [j for j in t] \r\n for i in range(r):\r\n for j in range(c):\r\n if mat[i][j]==\"S\":\r\n if(protect(i, j) == False):\r\n return False\r\n return True\r\n\r\nif (sheep() == True):\r\n print(\"Yes\")\r\n for i in range(r):\r\n for j in range(c):\r\n if mat[i][j]==\".\":\r\n print(\"D\", end='')\r\n else:\r\n print(mat[i][j], end='')\r\n print()\r\nelse:\r\n print(\"No\")", "#!/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\ndef protect(r,c):\n if rc[r][c] != 'W':\n return True\n for rr, cc in [[r-1, c], [r+1, c], [r, c-1], [r, c+1]] :\n if rr < 0 or rr >=R or cc < 0 or cc >= C:\n continue\n item = rc[rr][cc]\n if item == 'S':\n return False\n if item == 'D' or item == 'W':\n continue\n if item == '.':\n rc[rr][cc] = \"D\"\n continue\n return True\nR, C = rint()\n\nrc = []\n\nfor i in range(R):\n r = list(input())\n rc.append(r)\n\n\n\nfor r in range(R):\n for c in range(C):\n if protect(r, c) == False:\n print(\"No\")\n exit()\n\nprint(\"Yes\")\nfor r in range(R):\n print(''.join(rc[r]))\n\n", "n, m = map(int, input().split())\r\nF = [0] * (n + 2)\r\nF[0] = [0] * (m + 2)\r\nF[n + 1] = [0] * (m + 2)\r\nfor i in range(1, n + 1):\r\n F[i] = [0] + list(input()) + [0]\r\n\r\nans = True\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if F[i][j] == 'W':\r\n if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':\r\n ans = False\r\n if F[i - 1][j] == '.':\r\n F[i - 1][j] = 'D'\r\n if F[i][j + 1] == '.':\r\n F[i][j + 1] = 'D'\r\n if F[i + 1][j] == '.':\r\n F[i + 1][j] = 'D'\r\n if F[i][j - 1] == '.':\r\n F[i][j - 1] = 'D'\r\n\r\nif ans:\r\n print('Yes')\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n print(F[i][j], end = '')\r\n print()\r\nelse:\r\n print('No')", "row, col = map(int, input().split())\r\ncases = row\r\n\r\nmatrix = []\r\nwhile cases:\r\n cases -= 1\r\n s = list(input().replace(\".\", \"D\"))\r\n matrix.append(s)\r\n\r\ntraverse = [[matrix[i][j] for i in range(len(matrix))] for j in range(len(matrix[0]))]\r\n\r\nfor row in matrix:\r\n if \"SW\" in \"\".join(row) or \"WS\" in \"\".join(row):\r\n print(\"No\")\r\n exit()\r\nfor row in traverse:\r\n if \"SW\" in \"\".join(row) or \"WS\" in \"\".join(row):\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n\r\nfor row in matrix:\r\n print(\"\".join(row))\r\n\r\n", "\r\nr, c = map(int, input().split())\r\nl = []\r\nfor _ in range(r):\r\n\tl.append(list(input()))\r\ntarget = ['S', 'W']\r\nfor i in range(r):\r\n\tfor j in range(c - 1):\r\n\t\tif sorted([l[i][j], l[i] [j + 1]]) == target:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\n\r\nfor j in range(c):\r\n\tfor i in range(r - 1):\r\n\t\tif sorted([l[i][j], l[i + 1] [j]]) == target:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\n\r\nprint('YES')\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tif l[i][j] == '.':\r\n\t\t\tl[i][j] = 'D'\r\n\r\nfor i in range(r):\r\n\tprint(*l[i], sep = '')\r\n", "def iri(grafo,r,c):\r\n\tfor linha in range(r):\t\r\n\t\tfor coluna in range(c):\r\n\t\t\tif grafo[linha][coluna] == \".\":\r\n\t\t\t\tgrafo[linha][coluna] = \"D\"\r\n\t\t\tif grafo[linha][coluna] == \"S\":\r\n\t\t\t\tif (linha-1 >= 0 and linha-1 < r):\r\n\t\t\t\t\tif grafo[linha-1][coluna] == \"W\": return False\r\n\t\t\t\tif (linha+1 >= 0 and linha+1 < r):\r\n\t\t\t\t\tif grafo[linha+1][coluna] == \"W\": return False\r\n\t\t\t\tif (coluna-1 >= 0 and coluna-1 < c):\r\n\t\t\t\t\tif grafo[linha][coluna-1] == \"W\": return False\r\n\t\t\t\tif (coluna+1 >= 0 and coluna+1 < c):\r\n\t\t\t\t\tif grafo[linha][coluna+1] == \"W\": return False\r\n\t\t\t\r\n\treturn True\r\n\t\r\nr, c = [int(x) for x in input().split()]\r\ngrafo = []\r\nfor e in range(r):\r\n\tentrada = input()\r\n\tbiu = []\r\n\tfor l in entrada:\r\n\t\tbiu.append(l)\r\n\tgrafo.append(biu)\r\n\r\niri(grafo,r,c)\r\n\r\nif iri(grafo,r,c):\r\n\tprint(\"Yes\")\r\n\tfor e in grafo:\r\n\t\tfor j in e:\r\n\t\t\tprint(j, end=\"\")\r\n\t\tprint()\r\nelse:\r\n\tprint(\"No\")\t\r\n\r\n", "m,n = map(int,input().split()) \r\nfeild = []\r\nfor i in range(0,m):\r\n temp = input()\r\n feild.append(list(temp.replace(\".\",\"D\"))) \r\n\r\nvalue = True\r\n\r\nfor row in range(0,m):\r\n for col in range(0,n):\r\n value =True\r\n \r\n if(feild[row][col]==\"S\"):\r\n if(col-1>=0 ):\r\n if(feild[row][col-1]!=\"W\"):\r\n value = value and True\r\n else:\r\n value = False\r\n break\r\n \r\n if(col+1<=n-1 ):\r\n if(feild[row][col+1]!=\"W\"):\r\n value = value and True\r\n else:\r\n value = False\r\n break\r\n \r\n if(row-1>=0 ):\r\n if(feild[row-1][col]!=\"W\"):\r\n value = value and True\r\n else:\r\n value = False \r\n break\r\n \r\n if(row+1<=m-1):\r\n if(feild[row+1][col]!=\"W\"):\r\n value = value and True\r\n else:\r\n value = False \r\n break\r\n if not(value):\r\n break\r\n \r\n \r\nif not(value):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for row in range(0,m):\r\n for col in range(0,n):\r\n print(feild[row][col],end=\"\")\r\n print()\r\n ", "n,m = map(int,input().split())\r\nflag = False\r\nflag2 = False\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n if \"SW\" in s or \"WS\" in s:\r\n flag = True\r\n s = s.replace(\".\",\"D\")\r\n l.append(s)\r\nc = False\r\nfor i in range(m):\r\n new = []\r\n for j in l:\r\n new.append(j[i])\r\n for i in range(n-1):\r\n if (new[i] == \"S\" and new[i+1] == \"W\") or (new[i+1] == \"S\" and new[i] == \"W\"):\r\n flag2 = True\r\n c = True\r\n break\r\n if c:\r\n break\r\nif flag or flag2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(*l,sep = \"\\n\")\r\n \r\n \r\n", "from sys import stdin,stdout\r\nfrom collections import Counter,defaultdict, deque \r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n,m = II()\r\n \r\n arr = []\r\n for _ in range(n):\r\n arr.append(list(input()))\r\n \r\n visited = set() \r\n queue = deque()\r\n \r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == 'S':\r\n queue.append((i,j))\r\n visited.add((i,j))\r\n \r\n \r\n directions = [(1,0),(0,1),(-1,0),(0,-1)]\r\n def inbound(row,col):\r\n return 0<=row<n and 0<=col<m \r\n \r\n \r\n while queue: \r\n length = len(queue)\r\n \r\n for _ in range(length):\r\n x,y = queue.popleft() \r\n \r\n for i,j in directions: \r\n row = x + i \r\n col = y + j \r\n \r\n if inbound(row,col) and (row,col) not in visited :\r\n visited.add((row,col))\r\n if arr[row][col] == '.':\r\n arr[row][col] = 'D'\r\n elif arr[row][col] == 'W':\r\n print(\"No\")\r\n return \r\n \r\n print(\"Yes\")\r\n for row in arr:\r\n print(''.join(row))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\nsolve()\r\n", "n, k = map(int, input().split())\r\n\r\na = [[\".\" for _ in range(k)] for _ in range(n)]\r\n\r\ni, j, yy = 0, 0, 0\r\nfor q in range(n):\r\n t = input()\r\n for w in range(k):\r\n if t[w] != \".\":\r\n a[q][w] = t[w]\r\n \r\nwhile i != n and yy == 0:\r\n if a[i][j] == \"S\":\r\n ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n for p in range(4):\r\n e, r = ar[p]\r\n if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != \"W\" and a[i + e][j + r] != \"S\":\r\n a[i + e][j + r] = \"D\"\r\n else:\r\n if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == \"W\":\r\n yy = 1\r\n break\r\n if j == k - 1:\r\n i += 1\r\n j = 0\r\n else:\r\n j +=1\r\n else:\r\n if j == k - 1:\r\n i += 1\r\n j = 0\r\n else:\r\n j +=1\r\n \r\nif yy == 1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in a:\r\n print(\"\".join(i))\r\n \r\n", "def sheeple(R, C, pasture):\n\n for i in range(R):\n for j in range(C):\n\n if pasture[i][j] == 'S':\n for x, y in ((i+1, j), (i-1, j), (i, j+1), (i, j-1)):\n if x < 0 or x >= R or y < 0 or y >= C:\n continue\n if pasture[x][y] == 'W':\n return [\"No\"]\n elif pasture[x][y] == '.':\n pasture[x][y] = 'D'\n return [\"Yes\"] + [''.join(row) for row in pasture]\nR, C = map(int, input().split())\npasture = [list(input().strip()) for _ in range(R)]\n\nfor line in sheeple(R, C, pasture):\n print(line)\n", "n, m = map(int, input().split())\r\n\r\nmatrix = [input().replace(\".\", \"D\") for i in range(n)]\r\n\r\ndef solve():\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif matrix[i][j] == \"S\":\r\n\t\t\t\tif (matrix[max(0, i-1)][j] == \"W\" or matrix[min(i+1, n-1)][j] == \"W\"\r\n\t\t\t\tor matrix[i][max(0, j-1)] == \"W\" or matrix[i][min(j+1, m-1)] == \"W\"):\r\n\t\t\t\t\treturn False\r\n\t\t\t\t\t\r\n\treturn True\r\n\r\nif solve():\r\n\tprint(\"Yes\")\r\n\tprint(*matrix, sep=\"\\n\")\r\nelse:\r\n\tprint(\"No\")\r\n\r\n", "from sys import stdin\n\nr, c = [int(x) for x in stdin.readline().rstrip().split()]\n\ninput_rows = []\nfor i in range(0, r):\n line = stdin.readline().rstrip()\n input_rows.append(line)\n\nfound_wolf_conflict = False\nfor i in range(0, r):\n for j in range(0, c):\n ch = input_rows[i][j]\n if ch == 'S':\n if (i > 0 and input_rows[i - 1][j] == 'W') or \\\n (i < r - 1 and input_rows[i + 1][j] == 'W') or \\\n (j > 0 and input_rows[i][j - 1] == 'W') or \\\n (j < c - 1 and input_rows[i][j + 1] == 'W'):\n found_wolf_conflict = True\n\nif found_wolf_conflict:\n print('No')\nelse:\n print('Yes')\n for i in range(0, r):\n chars_list = list(input_rows[i])\n for j in range(0, c):\n if input_rows[i][j] == '.':\n chars_list[j] = 'D'\n print(''.join(chars_list))\n", "# cf 948 A 1000\nr, c = map(int, input().split())\nans = True\nM = []\nfor _ in range(r):\n s = input()\n if 'SW' in s or 'WS' in s:\n ans = False\n if len(M) > 0:\n for i in range(len(s)):\n if s[i] == 'W' and M[-1][i] == 'S':\n ans = False\n if s[i] == 'S' and M[-1][i] == 'W':\n ans = False\n M.append(s.replace('.', 'D'))\nprint(\"Yes\" if ans else \"No\")\nif ans:\n for m in M:\n print(m)\n \n", "r, c = tuple(map(int, input().split(' ')))\nrows = []\nfor i in range(r):\n rows.append(input())\n\n# horizontal\nfor row in rows:\n if 'SW' in row or 'WS' in row:\n print('No')\n exit()\n\n# vertical\nfor j in range(c):\n for i in range(1, r):\n adj = rows[i - 1][j] + rows[i][j]\n if adj == 'SW' or adj == 'WS':\n print('No')\n exit()\n\n# OK\nprint('Yes')\nfor row in rows:\n print(row.replace('.', 'D'))\n", "n = input().split()\n\nn[0] = int(n[0])\nn[1] = int(n[1])\n\narray = []\n\nsheep_position=[]\n\nfor i in range(int(n[0])):\n array.append(list(input()+\"0\"))\n if \"S\" in array[i]:\n for j in range(len(array[i])):\n if array[i][j] == \"S\":\n sheep_position.append([i,j])\n\narray.append(\"0\"*int(n[1]))\n\nv=True \n\nfor i in sheep_position:\n if array[i[0]][i[1]+1] == \".\":\n array[i[0]][i[1]+1] = \"D\"\n if array[i[0]+1][i[1]] == \".\":\n array[i[0]+1][i[1]] = \"D\"\n if array[i[0]-1][i[1]] == \".\":\n array[i[0]-1][i[1]] = \"D\"\n if array[i[0]][i[1]-1] == \".\":\n array[i[0]][i[1]-1] = \"D\"\n if array[i[0]][i[1]+1] == \"W\":\n v=False\n break \n if array[i[0]+1][i[1]] == \"W\":\n v=False\n break\n if array[i[0]-1][i[1]] == \"W\":\n v=False\n break\n if array[i[0]][i[1]-1] == \"W\":\n v=False\n break\n \nif v==False:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n for i in range(n[0]):\n print(*array[i][:-1], sep=\"\")\n\n", "\r\nR, C = map(int, input().split())\r\nfield = []\r\nfor i in range(R):\r\n line = input()\r\n f = []\r\n for ch in line:\r\n f.append(ch)\r\n field.append(f)\r\n\r\nlu = [[1, 0], [-1, 0], [0, 1], [0, -1]]\r\ndef main():\r\n for i in range(R):\r\n for j in range(C):\r\n item = field[i][j]\r\n if item == '.':\r\n field[i][j] = 'D'\r\n if item == 'S':\r\n for [di, dj] in lu:\r\n di += i; dj += j\r\n if di in range(R) and dj in range(C):\r\n if field[di][dj] == 'W':\r\n print('No')\r\n return\r\n\r\n print('Yes')\r\n for line in field:\r\n print(''.join(line))\r\n\r\nmain()\r\n", "from collections import defaultdict\r\ndef op():\r\n r,c=map(int,input().split())\r\n sx=[]\r\n mat=[]\r\n flg=0\r\n for i in range(r):\r\n s=input()\r\n s=s.replace('.','D')\r\n s=list(s)\r\n for j in range(c):\r\n if s[j]=='S':\r\n sx.append([i,j])\r\n mat.append(s)\r\n for i in range(r):\r\n for j in range(c):\r\n if mat[i][j]=='W':\r\n if [i-1,j] in sx or [i+1,j] in sx or [i,j+1] in sx or [i,j-1] in sx:\r\n print(\"No\")\r\n flg=1\r\n return\r\n if flg==0:\r\n print('Yes')\r\n for i in mat:\r\n print(''.join(i)) \r\nop()", "x,y=map(int,input().split())\r\nw=[]\r\nans='Yes'\r\nfor i in range (x):\r\n s=input()\r\n w.append(s.replace('.','D'))\r\nfor i in range (x):\r\n for j in range (y):\r\n if w[i][j]=='W':\r\n if i!=0:\r\n if w[i-1][j]=='S':\r\n ans='No'\r\n if i!=x-1:\r\n if w[i+1][j]=='S':\r\n ans='No'\r\n if j!=0:\r\n if w[i][j-1]=='S':\r\n ans='No'\r\n if j!=y-1:\r\n if w[i][j+1]=='S':\r\n ans='No'\r\nprint (ans)\r\nif ans=='Yes':\r\n print ('\\n'.join(w))\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n\ts = input()\r\n\tb = \"\"\r\n\tfor i in s:\r\n\t\tif i == \".\":\r\n\t\t\tb += \"D\"\r\n\t\telse:\r\n\t\t\tb += i\r\n\ta.append(b)\r\nfor i in range(n):\r\n\ts = a[i].find(\"S\")\r\n\tif i != 0 and s != -1:\r\n\t\tif a[i - 1][s] == \"W\":\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\n\tif i != n - 1 and s != -1:\r\n\t\tif a[i + 1][s] == \"W\":\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\n\tif \"SW\" in a[i] or \"WS\" in a[i]:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")\r\nprint(* a, sep = \"\\n\")", "def nope():\r\n print('NO')\r\n exit(0)\r\n\r\nr, c = [int(x) for x in input().split()]\r\n\r\ns = []\r\nfor i in range(r):\r\n s.append(input().lower())\r\n\r\nfor y in range(r):\r\n for x in range(c):\r\n if s[y][x] == 's':\r\n if y > 0 and s[y-1][x] == '.':\r\n s[y-1] = s[y-1][:x] + 'd' + s[y-1][(x+1):]\r\n if y > 0 and s[y-1][x] == 'w':\r\n nope()\r\n\r\n if y+1 < r and s[y+1][x] == '.':\r\n s[y + 1] = s[y + 1][:x] + 'd' + s[y + 1][(x+1):]\r\n if y+1 < r and s[y+1][x] == 'w':\r\n nope()\r\n\r\n if x > 0 and s[y][x-1] == '.':\r\n s[y] = s[y][:(x-1)] + 'd' + s[y][x:]\r\n if x > 0 and s[y][x-1] == 'w':\r\n nope()\r\n\r\n if (x+1 < c) and (s[y][x+1] == '.'):\r\n s[y] = s[y][:(x + 1)] + 'd' + s[y][(x + 2):]\r\n if (x+1 < c) and (s[y][x+1] == 'w'):\r\n nope()\r\n\r\nprint('YES')\r\nfor row in s:\r\n print(row.upper())", "def manh_dist(x1, y1, x2, y2):\r\n return abs(x1-x2)+abs(y1-y2)\r\n\r\n\r\nrows, cols = list(map(int, input().split()))\r\nmatrix = []\r\nno_wolf = False\r\ncan_protect = True\r\n\r\nfor i in range(rows):\r\n row = input()\r\n matrix.append(row)\r\n\r\n\r\nsheep_coord = []\r\nwolf_coord = []\r\ndog_matrix = []\r\n\r\nfor i in range(rows):\r\n new_row = ''\r\n for j in range(cols):\r\n if matrix[i][j] == 'S':\r\n sheep_coord.append((i, j))\r\n new_row += 'S'\r\n elif matrix[i][j] == 'W':\r\n wolf_coord.append((i, j))\r\n new_row += 'W'\r\n else:\r\n new_row += 'D'\r\n dog_matrix.append(new_row)\r\n\r\n\r\nif len(wolf_coord) == 0:\r\n no_wolf = True\r\n\r\nif not no_wolf:\r\n for sheep in sheep_coord:\r\n for wolf in wolf_coord:\r\n dist = manh_dist(*sheep, *wolf)\r\n if dist == 1:\r\n can_protect = False\r\n break\r\n\r\nif no_wolf or can_protect:\r\n print('Yes')\r\n for row in dog_matrix:\r\n print(row)\r\nelif not can_protect:\r\n print('No')\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if i + 1 < n and (a[i][j] + a[i+1][j]) in ('SW', 'WS'):\r\n print('No')\r\n exit(0)\r\n if j + 1 < m and (a[i][j] + a[i][j+1]) in ('SW', 'WS'):\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\nfor i in range(n):\r\n print(''.join(map(lambda x: x.replace('.', 'D'), a[i])))\r\n", "r,c=map(int,input().split())\nb=['.' for i in range(c+2)]\na=[]\na.append(b)\nfor i in range(r):\n inp=input()\n d=['.']\n for j in inp:\n d.append(j)\n d.append('.')\n a.append(d)\na.append(b)\n\nda=True\n\nfor i in range(1,r+1):\n for j in range(1,c+1):\n \n if a[i][j]=='S':\n \n if a[i-1][j]=='W' or a[i][j+1]=='W' or a[i+1][j]=='W' or a[i][j-1]=='W':\n da=False\n break\n else:\n if a[i-1][j]=='.':\n a[i-1][j]='D'\n if a[i][j+1]=='.':\n a[i][j+1]='D'\n if a[i+1][j]=='.':\n a[i+1][j]='D'\n if a[i][j-1]=='.':\n a[i][j-1]='D'\n\nif da:\n print('Yes')\n for i in range(1,r+1):\n print(''.join(a[i][1:-1]))\n\nelse:\n print('No')\n \n\n\t\t \t \t\t \t \t\t \t\t \t\t \t \t\t\t \t\t\t", "\r\ndef safe(i,j):\r\n if a[i][j+1] == \"W\":\r\n return(False)\r\n if a[i][j-1] == \"W\":\r\n return(False)\r\n if a[i+1][j] == \"W\":\r\n return(False)\r\n if a[i-1][j] == \"W\":\r\n return(False)\r\n return(True)\r\n\r\ndef dogplace(i, j):\r\n if a[i][j+1] != \"S\":\r\n a[i][j+1] = \"D\"\r\n if a[i][j-1] != \"S\":\r\n a[i][j-1] = \"D\"\r\n if a[i+1][j] != \"S\":\r\n a[i+1][j] = \"D\"\r\n if a[i-1][j] != \"S\":\r\n a[i-1][j] = \"D\"\r\n \r\n\r\nr,c = map(int, input().split())\r\na = []\r\na.append([\".\" for i in range(c+1)])\r\nfor i in range(r):\r\n t = input()\r\n a.append([\".\"])\r\n for j in range(len(t)):\r\n a[i+1].append(t[j])\r\n a[i+1].append(\".\")\r\na.append([\".\" for i in range(c+1)])\r\nno = False\r\n\r\nfor i in range(1, len(a)-1):\r\n for j in range(1, len(a[i])-1):\r\n if a[i][j] == \"S\":\r\n if safe(i, j):\r\n dogplace(i, j)\r\n else:\r\n no = True\r\n break\r\n if no:\r\n break\r\n\r\nif no:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in range(1, len(a)-1):\r\n s = \"\"\r\n for j in range(1, len(a[i])-1):\r\n s+=a[i][j]\r\n print(s)\r\n\r\n \r\n\r\n\r\n", "from sys import stdin, setrecursionlimit\r\n\r\n\r\ndef solve():\r\n r, c = (int(s) for s in stdin.readline().split())\r\n mas = [list(stdin.readline().rstrip('\\r\\n')) for _ in range(r)]\r\n\r\n for i in range(r):\r\n for j in range(c):\r\n if mas[i][j] == '.':\r\n mas[i][j] = 'D'\r\n\r\n ok = True\r\n\r\n for i in range(r):\r\n for j in range(c):\r\n if mas[i][j] == 'S':\r\n if i - 1 >= 0:\r\n ok &= mas[i - 1][j] != 'W'\r\n if j - 1 >= 0:\r\n ok &= mas[i][j - 1] != 'W'\r\n if i < r - 1:\r\n ok &= mas[i + 1][j] != 'W'\r\n if j < c - 1:\r\n ok &= mas[i][j + 1] != 'W'\r\n\r\n print('Yes' if ok else 'No')\r\n if ok:\r\n for row in mas:\r\n print(''.join(row))\r\n\r\nif __name__ == '__main__':\r\n solve()", "r,c=list(map(int,input().split()))\r\nl=[]\r\nl1=[]\r\nw=[]\r\nfor i in range(c+2):\r\n l1.append('.')\r\nl.append(l1)\r\nfor i in range(r):\r\n l.append(list(map(str,input())))\r\n l[-1].insert(0,'.')\r\n l[-1].append('.')\r\n for j in range(c+2):\r\n if l[-1][j]=='W':\r\n w.append([i+1,j])\r\nl.append(l1)\r\nif len(w)==0:\r\n pass\r\n\r\nelse:\r\n for i,j in w:\r\n if l[i+1][j]=='S' or l[i-1][j]=='S' or l[i][j+1]=='S' or l[i][j-1]=='S':\r\n print('no')\r\n exit()\r\n else:\r\n if l[i+1][j]=='.':\r\n l[i+1][j]='D'\r\n if l[i-1][j]=='.':\r\n l[i-1][j]='D'\r\n if l[i][j+1]=='.':\r\n l[i][j+1]='D'\r\n if l[i][j-1]=='.':\r\n l[i][j-1]='D'\r\nprint('yes')\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n print(l[i][j],end='')\r\n print()", "r, c = map(int, input().split())\ncells = [list(input()) for _ in range(r)]\n\nans = \"Yes\"\nfor i in range(r):\n for j in range(c):\n if cells[i][j] == '.':\n cells[i][j] = 'D'\nfor i in range(r - 1):\n for j in range(c):\n if cells[i][j] == 'S' and cells[i + 1][j] == 'W':\n ans = \"No\"\n if cells[i][j] == 'W' and cells[i + 1][j] == 'S':\n ans = \"No\"\nfor i in range(r):\n for j in range(c - 1):\n if cells[i][j] == 'S' and cells[i][j + 1] == 'W':\n ans = \"No\"\n if cells[i][j] == 'W' and cells[i][j + 1] == 'S':\n ans = \"No\"\nprint(ans)\nif ans == \"Yes\":\n for i in range(r):\n print(''.join(cells[i]))\n", "import re\r\nr,c=input().split()\r\ns='\\n'.join(input().replace('.','D')for _ in[0]*int(r))\r\nprint('No'if re.search('(?s)(S|W)(.{'+c+'})?(?!\\\\1)(S|W)',s)else'Yes\\n'+s)", "r,c = list(map(int,input().split()))\r\narr = []\r\nfor _ in range(r):\r\n arr.append(list(input()))\r\n\r\ndirc = [(1,0),(-1,0),(0,1),(0,-1)]\r\nimpo = False\r\nfor i in range(r):\r\n for j in range(c):\r\n if arr[i][j] == 'W':\r\n for dx,dy in dirc:\r\n if 0 <= i+dx < r and 0 <= j+dy < c:\r\n if arr[i+dx][j+dy] == '.':\r\n arr[i+dx][j+dy] = 'D'\r\n elif arr[i+dx][j+dy] == 'S':\r\n print('NO')\r\n impo = True\r\n break\r\n if impo:\r\n break\r\n if impo:\r\n break\r\nelse:\r\n print('YES')\r\n for i in range(r):\r\n print(''.join(arr[i]))\r\n ", "def check(pas, row, col, rl, cl):\n if row > 0:\n if pas[row-1][col] == 'W':\n print(\"NO\")\n exit()\n elif pas[row-1][col] == \".\":\n pas[row-1][col] = \"D\"\n if row != rl:\n if pas[row+1][col] == 'W':\n print(\"NO\")\n exit()\n elif pas[row+1][col] == \".\":\n pas[row+1][col] = \"D\"\n \n if col > 0:\n if pas[row][col-1] == 'W':\n print(\"NO\")\n exit()\n elif pas[row][col-1] == \".\":\n pas[row][col-1] = \"D\"\n if col != cl:\n if pas[row][col+1] == 'W':\n print(\"NO\")\n exit()\n elif pas[row][col+1] == \".\":\n pas[row][col+1] = \"D\"\n return pas\n \n\n\nif __name__ == \"__main__\":\n r, c = input().split()\n r = int(r)\n c = int (c)\n pas = []\n for i in range(r):\n x = input()\n pas.append(list(x))\n \n \n for row in range(r):\n for col in range(c):\n if pas[row][col] == \"S\":\n pas = check(pas, row, col, r-1, c-1)\n\n\nprint(\"YES\")\nfor x in pas:\n y = \"\".join(x)\n print(y)\n\n\n ", "a, b = map(int, input().split())\nm = []\nfor i in range(a):\n tmp = input()\n m.append(tmp)\nfor i in range(a):\n for j in range(b):\n if m[i][j] == 'W':\n if i+1<a:\n if m[i+1][j] == 'S':\n print(\"NO\")\n exit()\n if i-1>=0:\n if m[i-1][j] == 'S':\n print(\"NO\")\n exit()\n if j+1<b:\n if m[i][j+1] == 'S':\n print(\"NO\")\n exit()\n if j-1>=0:\n if m[i][j-1] == 'S':\n print(\"NO\")\n exit()\nprint(\"YES\")\nfor i in range(a):\n for j in range(b):\n if m[i][j] == '.':\n print(\"D\", end=\"\")\n else:\n print(m[i][j], end=\"\")\n print()\n\n", "l1 = [int(x) for x in input().split()]\r\nrows,columns = l1[0],l1[1]\r\nl1=[]\r\nfor x in range(rows):\r\n a = input()\r\n a = a.replace(\".\",\"D\")\r\n l1.append(list(a))\r\nruined=0\r\n#print(l1)\r\nfor x in range(rows):\r\n for y in range(columns):\r\n if l1[x][y]==\"W\":\r\n if x!=0 and l1[x-1][y]==\"S\":\r\n ruined = 1\r\n break\r\n if x!=rows-1 and l1[x+1][y]==\"S\":\r\n ruined = 1 \r\n break\r\n if y!=0 and l1[x][y-1]==\"S\":\r\n ruined = 1\r\n break\r\n if y!=columns-1 and l1[x][y+1]==\"S\":\r\n ruined = 1\r\n break\r\nif not ruined:\r\n print(\"Yes\")\r\n for x in l1:\r\n print(\"\".join(x))\r\nelse:\r\n print(\"No\") \r\n\r\n ", "rows, columns = list(map(int, input().split(' ')))\nboard=[]\nresp=\"Yes\"\n\nfor row in range(rows):\n board.append(list(input()))\n\nfor row in range(rows):\n for column in range(columns):\n if board[row][column]==\"W\":\n #0 1\n if row != 0:\n if board[row-1][column]==\"S\":\n resp=\"No\"\n break\n if row < rows-1:\n if board[row+1][column]==\"S\":\n resp=\"No\"\n break\n\n if column < columns-1:\n if board[row][column +1]==\"S\":\n resp=\"No\"\n break\n if column != 0:\n if board[row][column -1]==\"S\":\n resp=\"No\"\n break\nprint(resp)\nif resp == \"Yes\":\n for row in range(rows):\n for column in range(columns):\n if(board[row][column]=='.'):\n print(\"D\", end=\"\")\n else:\n print(board[row][column], end=\"\")\n print(\"\")\n \t \t\t \t \t\t \t \t\t\t\t\t \t\t \t \t \t", "r, c = map(int, input().split())\r\ns = []\r\nfor i in range(r):\r\n a = input().replace('.', 'D')\r\n s.append(a)\r\n\r\nk = 1\r\ny = ([''.join(x) for x in list(zip(*s))])\r\nfor x in s:\r\n if 'SW' in x or 'WS' in x:\r\n k = 0\r\n break\r\nelse:\r\n for x in y:\r\n if 'SW' in x or 'WS' in x:\r\n k = 0\r\n break\r\n\r\nif k:\r\n print('Yes')\r\n print('\\n'.join(s))\r\nelse:\r\n print('No')\r\n", "n, m = map(int, input().split())\r\ng = [input().replace('.', 'D') for _ in [0]*n]\r\nflag1 = any('SW' in x or 'WS' in x for x in g)\r\ngg = zip(*g)\r\nflag2 = any('SW' in x or 'WS' in x for x in (''.join(t) for t in gg))\r\nif flag1 or flag2:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n print('\\n'.join(g))\r\n ", "n,m=[int(i) for i in input().split()]\r\nmat=[]\r\nflag=0\r\nfor i in range(n):\r\n s=str(input())\r\n s=list(s)\r\n mat.append(s)\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if(mat[i][j]=='.'):\r\n mat[i][j]='D'\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if(mat[i][j]=='W'):\r\n if(i+1<n and mat[i+1][j]=='S'):\r\n flag=1\r\n if(j+1<m and mat[i][j+1]=='S'):\r\n flag=1\r\n if(j-1>=0 and mat[i][j-1]=='S'):\r\n flag=1\r\n if(i-1>=0 and mat[i-1][j]=='S'):\r\n flag=1\r\nif(flag==1):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for j in range(0,n):\r\n e=''\r\n for k in range(0,m):\r\n e=e+mat[j][k]\r\n print(e)", "r,c = map(int,input().split())\r\npasture = []\r\n\r\nfor row in range(r):\r\n p = input()\r\n pasture.append(p.replace('.','D'))\r\ndef check(pasture):\r\n for row in range(r):\r\n for col in range(c):\r\n if (pasture[row][col] == 'S'):\r\n if (row-1>-1 and pasture[row-1][col] == 'W'):\r\n return False\r\n elif (row+1 < r and pasture[row+1][col]=='W'):\r\n return False\r\n elif (col-1>-1 and pasture[row][col-1]=='W'):\r\n return False\r\n elif (col +1 < c and pasture[row][col+1] == 'W'):\r\n return False\r\n return True\r\nif (check(pasture)):\r\n print('Yes')\r\n for i in range(r):\r\n print(pasture[i])\r\nelse:\r\n print('NO')\r\n", "# A\r\n\r\nR, C = map(int, input().split())\r\nfield = []\r\nfor _ in range(R):\r\n field.append(list(input()))\r\n\r\n\r\ndef not_out_of_range(i, j):\r\n if i < 0 or i >= R or j < 0 or j >= C:\r\n return False\r\n else:\r\n return True\r\n\r\n\r\nadj = [[0, 1], [0, -1], [1, 0], [-1, 0]]\r\n\r\nfor i in range(R):\r\n for j in range(C):\r\n if field[i][j] == \"S\":\r\n for di, dj in adj:\r\n if not_out_of_range(i+di, j+dj):\r\n if field[i+di][j+dj] == \"W\":\r\n print(\"No\")\r\n quit()\r\n elif field[i+di][j+dj] == \".\":\r\n field[i+di][j+dj] = \"D\"\r\n\r\nprint(\"Yes\")\r\nfor i in range(R):\r\n print(\"\".join(field[i]))\r\n", "def main():\r\n n, m = list(map(int, input().split()))\r\n arr = [input() for _ in range(n)]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"S\":\r\n if i != 0 and arr[i - 1][j] == \"W\":\r\n print(\"No\")\r\n return\r\n elif i != n - 1 and arr[i + 1][j] == \"W\":\r\n print(\"No\")\r\n return\r\n elif j != 0 and arr[i][j - 1] == \"W\":\r\n print(\"No\")\r\n return\r\n elif j != m - 1 and arr[i][j + 1] == \"W\":\r\n print(\"No\")\r\n return\r\n\r\n print(\"Yes\")\r\n for element in arr:\r\n print_element = element.replace(\".\", \"D\")\r\n print(print_element)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "R, C = map(int, input().strip().split())\r\npas = list()\r\nfor i in range(R):\r\n pas.append(list(input().strip()))\r\nres = list(pas)\r\ndr = [-1,0,1,0]\r\ndc = [0,1,0,-1]\r\nfor i in range(R):\r\n for j in range(C):\r\n if res[i][j] == 'W':\r\n for k in range(4):\r\n i2 = i + dr[k]\r\n j2 = j + dc[k]\r\n if 0 <= i2 < R and 0 <= j2 < C:\r\n if res[i2][j2] == '.':\r\n res[i2][j2] = 'D'\r\n elif res[i2][j2] == 'S':\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\nfor i in range(R):\r\n print(''.join(map(str, res[i])))\r\n", "r, l = (int(x) for x in input().strip().split(' '))\na = []\na4 = list(\".\" * (l+2))\na.append(a4)\nfor i in range(r):\n a1 = \".\" + input() + \".\"\n a2 = list(a1)\n a.append(a2)\na.append(a4)\nr = r+2\nl = l+2\n\nflag = True\n\nfor i in range(1, r-1):\n for j in range(1, l-1):\n if a[i][j] == \"S\":\n if a[i-1][j] == \"W\" or a[i+1][j] == \"W\" or a[i][j-1] == \"W\" or a[i][j+1] == \"W\":\n flag = False\n\nif flag == True:\n print(\"Yes\")\n for i in range(1, r-1):\n for j in range(1, l-1):\n if a[i][j] == \".\":\n a[i][j] = \"D\"\n for i in range(1, r-1):\n a[i].pop(0)\n a[i].pop(l-2)\n print(\"\".join(a[i]))\nelse:\n print(\"No\")\n \t \t\t \t\t \t \t \t\t \t\t \t \t", "def check_if_wolf():\n if i > 0:\n if field[i - 1][j] == 'W':\n print('NO')\n exit()\n\n if j > 0:\n if field[i][j - 1] == 'W':\n print('NO')\n exit()\n\n if i + 1 < field_height:\n if field[i + 1][j] == 'W':\n print('NO')\n exit()\n\n if j + 1 < field_width:\n if field[i][j + 1] == 'W':\n print('NO')\n exit()\n\n\nfield_height, field_width = [int(x) for x in input().split()]\nfield = [[x for x in list(input())] for y in range(field_height)]\n\nfor i in range(0, field_height):\n for j in range(0, field_width):\n\n if field[i][j] == 'S':\n check_if_wolf()\n\n if field[i][j] == '.':\n field[i][j] = 'D'\n\nprint('YES')\nfor i in range(field_height):\n print(''.join(field[i]))\n\n", "def is_possible(R, C, m):\r\n for i in range(R):\r\n for j in range(C):\r\n if m[i][j] == 'W' and (j - 1 >= 0 and m[i][j - 1] == 'S' or j + 1 < C and m[i][j + 1] == 'S' or i - 1 >= 0 and m[i - 1][j] == 'S' or i + 1 < R and m[i + 1][j] == 'S'):\r\n return False\r\n return True\r\n\r\nR, C = map(int, input().split())\r\nm = []\r\nfor _ in range(R):\r\n m.append(input())\r\n\r\nif is_possible(R, C, m):\r\n print('Yes')\r\n for i in range(R):\r\n for j in range(C):\r\n if m[i][j] == '.':\r\n print('D', end='')\r\n else:\r\n print(m[i][j], end='')\r\n print()\r\nelse:\r\n print('No')", "r,c = map(int,input().split())\r\na = ['.' for i in range(r+2)]\r\na[0] = a[r+1] = '.'*(c+2)\r\nfor i in range(1,r+1):\r\n a[i] = a[i] + input() + '.'\r\nans = True\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n if (a[i][j]=='S') and (a[i+1][j]=='W' or a[i-1][j]=='W' or a[i][j+1]=='W' or a[i][j-1]=='W'):\r\n ans = False\r\nif ans:\r\n print('Yes')\r\n for i in range(1,r+1):\r\n for j in range(1,c+1):\r\n if a[i][j]!='.':\r\n print(a[i][j],end='')\r\n else:\r\n print('D',end='')\r\n print()\r\nelse:\r\n print('No')", "r,c=map(int,input().split())\r\nl=[]\r\nfor i in range(r):\r\n q=input()\r\n if \"SW\"in q or \"WS\"in q:exit(print(\"No\"))\r\n q=q.replace(\".\",\"D\")\r\n l+=[q]\r\nb=['']*c\r\nfor i in range(c):\r\n for j in range(r):\r\n b[i]+=l[j][i]\r\n if \"SW\" in b[i] or \"WS\" in b[i]:\r\n exit(print(\"NO\"))\r\nprint(\"YES\")\r\nfor i in range(r):\r\n print(l[i])", "# rectangle of r*c cells\r\n# empty, sheep, wolf or dog\r\n# sheep and dogs stay in place, wolves roam\r\ndef solve(r, c, p):\r\n\r\n for i in range(r):\r\n \r\n for j in range(c):\r\n \r\n if p[i][j] == \"S\":\r\n # left/right\r\n if j > 0 and j < c-1:\r\n if p[i][j+1] == \"W\" or p[i][j-1] == \"W\":\r\n return \"No\"\r\n else:\r\n if p[i][j+1] != \"S\":\r\n p[i][j+1] = \"D\"\r\n if p[i][j-1] != \"S\":\r\n p[i][j-1] = \"D\"\r\n elif j == c-1:\r\n if p[i][j-1] == \"W\":\r\n return \"No\"\r\n else:\r\n if p[i][j-1] != \"S\":\r\n p[i][j-1] = \"D\"\r\n elif j == 0:\r\n if p[i][j+1] == \"W\":\r\n return \"No\"\r\n else:\r\n if p[i][j+1] != \"S\":\r\n p[i][j+1] = \"D\"\r\n \r\n # up/down\r\n if i > 0 and i < r-1:\r\n if p[i+1][j] == \"W\" or p[i-1][j] == \"W\":\r\n return \"No\"\r\n else:\r\n if p[i+1][j] != \"S\":\r\n p[i+1][j] = \"D\"\r\n if p[i-1][j] != \"S\":\r\n p[i-1][j] = \"D\"\r\n elif i == r-1:\r\n if p[i-1][j] == \"W\":\r\n return \"No\"\r\n else:\r\n if p[i-1][j] != \"S\":\r\n p[i-1][j] = \"D\"\r\n elif i==0:\r\n if p[i+1][j] == \"W\":\r\n return \"No\"\r\n else:\r\n if p[i+1][j] != \"S\":\r\n p[i+1][j] = \"D\"\r\n \r\n return [\"Yes\", p] \r\n \r\n\r\nr, c = map(int, input().split(\" \"))\r\n\r\np = []\r\nfor _ in range(r):\r\n p.append(list(input()))\r\n \r\nans = solve(r, c, p)\r\nif isinstance(ans, str):\r\n print(ans)\r\nelse:\r\n print(ans[0])\r\n for line in p:\r\n print(''.join(line))\r\n\r\n\r\n", "n, m = [int(x) for x in input().split()]\r\n\r\nmat = []\r\nfor _ in range(n):\r\n mat.append(list(input()))\r\n\r\ndef adj(i, j):\r\n for i2, j2 in [(i+1, j), (i-1, j), (i, j-1), (i, j+1)]:\r\n if 0 <= i2 < n and 0 <= j2 < m:\r\n yield (i2, j2)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == 'S':\r\n for i2, j2 in adj(i, j):\r\n if mat[i2][j2] == 'W':\r\n print('No')\r\n exit(0)\r\n elif mat[i2][j2] == '.':\r\n mat[i2][j2] = 'D'\r\n\r\nprint(\"Yes\")\r\nfor i in range(n):\r\n print(\"\".join(mat[i]))\r\n", "field = [input() for _ in range(int(input().split()[0]))]\r\nif (\r\n any('SW' in row or 'WS' in row for row in field)\r\n or any('SW' in col or 'WS' in col for col in map(''.join, zip(*field)))\r\n):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for row in field:\r\n print(row.replace('.', 'D'))", "r, c = map(int, input().split())\r\nnum = [[1] * (c + 2)]\r\nfor i in range(r):\r\n s = input()\r\n ans = [1]\r\n for j in range(len(s)):\r\n if s[j] == '.':\r\n ans.append('D')\r\n else:\r\n ans.append(s[j])\r\n ans.append(1)\r\n num.append(ans)\r\nnum.append([1] * (c + 2))\r\nfl = True\r\nfor i in range(1, len(num) - 1):\r\n for j in range(1, len(num[i]) - 1):\r\n if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):\r\n fl = False\r\nif fl:\r\n print('Yes')\r\n for i in range(1, len(num) - 1):\r\n for j in range(1, len(num[i]) - 1):\r\n print(num[i][j], end='')\r\n print()\r\nelse:\r\n print('No')", "# Here I get the number of rows and cols that will\n# be input\nr, c = [int(rc) for rc in input().split()]\n\n# Creation of the field (map) \nfield = []\n\n# User input the field(map).\nfor i in range(r):\n field.append(list(input()))\n\n# In this loops, what is being checked is that on the left and right of the\n# sheeps, there is no wolf. If there is a wold next a sheeps, then all\n# the sheeps couldn´t be saved\nfor i in range(r):\n for j in range(c-1):\n if (field[i][j+1] == \"W\" and field[i][j] == \"S\") or (field[i][j] == \"W\" and field[i][j+1] == \"S\"):\n print(\"NO\")\n exit()\n\n# In this loops, what is being checked is if there is a wolf over or down\n# of a sheep, it there is the a wolf over or down a sheep, then\n# not all the sheeps were saved. \nfor i in range(r-1):\n for j in range(c):\n if (field[i+1][j] == \"W\" and field[i][j] == \"S\") or (field[i][j] == \"W\" and field[i+1][j] == \"S\"):\n print(\"NO\")\n exit()\n\n# If in none of the upper loop that program exited, then the result\n# is \"YES\", which means that all the sheeps can be saved.\nprint(\"YES\")\n\n# Next, since there is no limit on the number of dogs to insert,\n# it is inserted a dog all over the field, in the free spaces\n# so all the sheeps will be protected.\nfor i in range(r):\n row = \"\"\n for j in field[i]:\n if j == \".\":\n row = row + \"D\"\n else:\n row = row + j\n # each iteration the field is printed.\n print(row)\n \t\t\t \t \t\t\t \t \t\t \t\t\t\t \t\t \t", "a, b = map(int, input().split())\nflag = True\narr = []\nfor j in range(0, a):\n strs = list(input())\n arr.append(strs)\n \nfor j in range(0, a):\n for k in range(0, b):\n if arr[j][k] == '.':\n arr[j][k] = 'D'\n \nfor j in range(0, a):\n for k in range(0, b):\n if arr[j][k] == 'S':\n if j + 1 < a and arr[j][k] == 'S' and arr[j + 1][k] == 'W':\n flag = False\n if j - 1 >= 0 and arr[j][k] == 'S' and arr[j - 1][k] == 'W':\n flag = False\n if k - 1 >= 0 and arr[j][k] == 'S' and arr[j][k - 1] == 'W':\n flag = False\n if k + 1 < b and arr[j][k] == 'S' and arr[j][k + 1] == 'W':\n flag = False\n \nif flag == True:\n print(\"Yes\")\n for j in range(0, a):\n for k in range(0, b):\n print(arr[j][k], end='')\n print('')\nelse:\n print(\"No\")\n \t \t\t \t\t\t\t\t \t\t \t \t \t\t\t \t \t", "dim = list(map(int, input().split()))\r\nscheme = []\r\nfor i in range(dim[0]):\r\n row = list(input())\r\n scheme.append(row)\r\nsafe = True\r\nfor i in range(dim[0]):\r\n for j in range(dim[1]):\r\n if scheme[i][j] == \"S\":\r\n if j != 0:\r\n if scheme[i][j-1] == \".\":\r\n scheme[i][j-1] = \"D\"\r\n elif scheme[i][j-1] == \"W\":\r\n safe = False\r\n break\r\n \r\n if j!=dim[1]-1:\r\n if scheme[i][j+1] == \".\":\r\n scheme[i][j+1] = \"D\"\r\n elif scheme[i][j+1] == \"W\":\r\n safe = False\r\n break\r\n \r\n if i != 0:\r\n if scheme[i-1][j] == \".\":\r\n scheme[i-1][j] = \"D\"\r\n elif scheme[i-1][j] == \"W\":\r\n safe = False\r\n break\r\n \r\n if i != dim[0]-1:\r\n if scheme[i+1][j] == \".\":\r\n scheme[i+1][j] = \"D\"\r\n elif scheme[i+1][j] == \"W\":\r\n safe = False\r\n break\r\n if not safe:\r\n break\r\nif safe:\r\n print(\"Yes\")\r\n for i in range(dim[0]):\r\n print(\"\".join(scheme[i]))\r\nelse:\r\n print(\"No\")\r\n \r\n\r\n", "r,c=input().split(\" \")\r\nr=int(r)\r\nc=int(c)\r\nl=[]\r\nj=0\r\nimport string\r\nfor i in range(r):\r\n s=input()\r\n l.append(s)\r\nfor i in range(len(l)) :\r\n if l[i].find(\"WS\")!= -1 or l[i].find(\"SW\")!= -1:\r\n print(\"NO\")\r\n exit()\r\n elif l[i].find(\"W\")!= -1:\r\n y=l[i].find(\"W\")\r\n if i-1>=0:\r\n if l[i-1][y]==\"S\":\r\n print(\"NO\")\r\n exit()\r\n if i+1<=r-1:\r\n if l[i+1][y]==\"S\":\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor t in l:\r\n print(t.replace(\".\",\"D\"))\r\n", "import sys\r\nimport math\r\n\r\ndef read_in():\r\n lines = sys.stdin.readlines()\r\n for i in range(len(lines)):\r\n lines[i] = lines[i].replace('\\n','')\r\n return lines\r\n\r\ndef main():\r\n lines = read_in()\r\n dim = lines[0]\r\n dim_array = dim.split(\" \")\r\n L = int(dim_array[0])\r\n H = int(dim_array[1])\r\n \r\n is_protectable = True\r\n\r\n output_grid = \"\"\r\n test_grid = []\r\n\r\n test_grid.append(\"T\"*(H+2))\r\n\r\n for i in range(0,L):\r\n line = lines[i+1]\r\n\r\n test_grid.append(\"T\"+line+\"T\")\r\n\r\n for j in range(0,H):\r\n char = line[j]\r\n if char == 'W':\r\n output_grid += 'W'\r\n elif char == '.':\r\n output_grid += 'D'\r\n elif char == 'S':\r\n output_grid += 'S'\r\n \r\n if i < L -1 : \r\n output_grid += '\\n'\r\n\r\n test_grid.append(\"T\"*(H+2))\r\n\r\n for i in range(1,L+1):\r\n for j in range(1,H+1):\r\n if test_grid[i][j] == \"S\" and (test_grid[i-1][j] == \"W\" or test_grid[i+1][j] == \"W\" or test_grid[i][j-1] == \"W\" or test_grid[i][j+1] == \"W\"):\r\n print(\"No\")\r\n exit()\r\n\r\n print(\"Yes\")\r\n print(output_grid)\r\n\r\nif __name__ == '__main__':\r\n main()", "def main():\r\n\tdx = [-1, 1, 0, 0]\r\n\tdy = [0, 0, -1, 1]\r\n\tn, m = map(int, input().split())\r\n\tar = [input().replace('.', 'D') for _ in range(n)]\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif ar[i][j] == 'W':\r\n\t\t\t\tfor k in range(4):\r\n\t\t\t\t\tx = i + dx[k]\r\n\t\t\t\t\ty = j + dy[k]\r\n\t\t\t\t\tif x >= 0 and x < n and y >= 0 and y < m and ar[x][y] == 'S':\r\n\t\t\t\t\t\tprint('No')\r\n\t\t\t\t\t\treturn\r\n\tprint('Yes')\r\n\tprint(*ar, sep='\\n')\r\n\r\nmain()", "r, c = map(int, input().split())\r\na = ['.' * (c + 2)]\r\nans = 'Yes'\r\nfor x in range(r):\r\n a.append('.' + input() + '.')\r\na.append('.' * (c+2))\r\nfor i in range(1, r + 1):\r\n for j in range(1, c + 1 ):\r\n if a[i][j] == 'S':\r\n if a[i - 1][j] == 'W':\r\n ans = 'No'\r\n break\r\n if a[i + 1][j] == 'W':\r\n ans = 'No'\r\n break\r\n if a[i][j - 1] == 'W':\r\n ans = 'No'\r\n break\r\n if a[i][j + 1] == 'W':\r\n ans = 'No'\r\n break\r\n \r\nprint(ans)\r\nif ans == 'Yes':\r\n for x in range(1, r + 1):\r\n c = a[x][1:-1].replace('.','D')\r\n print(c)\r\n", "import string\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n pasture = [list(input()) for k in range([int(i) for i in input().split(\" \")][0])]\r\n for i in range(len(pasture)):\r\n for j in range(len(pasture[i])):\r\n if pasture[i][j] == \"S\":\r\n if j + 1 < len(pasture[i]):\r\n if pasture[i][j + 1] == \"W\":\r\n return \"No\"\r\n elif pasture[i][j + 1] == \".\":\r\n pasture[i][j + 1] = \"D\"\r\n if j - 1 >= 0:\r\n if pasture[i][j - 1] == \"W\":\r\n return \"No\"\r\n elif pasture[i][j - 1] == \".\":\r\n pasture[i][j - 1] = \"D\"\r\n if i - 1 >= 0:\r\n if pasture[i - 1][j] == \"W\":\r\n return \"No\"\r\n elif pasture[i - 1][j] == \".\":\r\n pasture[i - 1][j] = \"D\"\r\n if i + 1 < len(pasture):\r\n if pasture[i + 1][j] == \"W\":\r\n return \"No\"\r\n elif pasture[i + 1][j] == \".\":\r\n pasture[i + 1][j] = \"D\"\r\n return \"Yes\" + \"\\n\" + \"\\n\".join([\"\".join(i) for i in pasture])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "import sys\r\n\r\nfield = []\r\n\r\ndef isSafe(i, j):\r\n return (\r\n (i == 0 or i > 0 and field[i - 1][j] != 'W') and\r\n (i < len(field) - 1 and field[i + 1][j] != 'W' or i == len(field) - 1) and\r\n (j == 0 or j > 0 and field[i][j - 1] != 'W') and\r\n (j == len(field[i]) - 1 or field[i][j + 1] != 'W')\r\n )\r\n\r\nsys.stdin.readline()\r\n\r\nfor line in sys.stdin:\r\n field.append(list(line.strip()))\r\n\r\nfor i in range(0, len(field)):\r\n for j in range(0, len(field[i])):\r\n if field[i][j] == 'S' and not(isSafe(i, j)):\r\n print('No')\r\n sys.exit()\r\n\r\nprint('Yes')\r\nfor line in field:\r\n print(''.join(line).replace('.', 'D'))\r\n", "N = 510\r\ninf = 1000000\r\n\r\ns = [['.' for j in range(N)] for i in range(N)]\r\n\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(1, n+1):\r\n line = input()\r\n for j in range(1, m+1):\r\n s[i][j] = line[j-1]\r\n\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n if s[i][j] == 'S' and (s[i][j+1] == 'W' or s[i][j-1] == 'W' or s[i+1][j] == 'W' or s[i-1][j] == 'W'):\r\n print(\"No\")\r\n exit()\r\n\r\n if s[i][j] == 'S':\r\n if s[i][j-1] == '.':\r\n s[i][j-1] = 'D'\r\n if s[i][j+1] == '.':\r\n s[i][j+1] = 'D'\r\n if s[i-1][j] == '.':\r\n s[i-1][j] = 'D'\r\n if s[i+1][j] == '.':\r\n s[i+1][j] = 'D'\r\n\r\nprint(\"Yes\")\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n print(s[i][j], end='')\r\n print()\r\n", "# Reading input values\nr, c = map(int, input().split())\npasture = []\nfor i in range(r):\n row = input().strip()\n pasture.append(row)\n\n# Checking if sheep can be protected\ncan_protect = True\nfor i in range(r):\n for j in range(c):\n if pasture[i][j] == \"S\":\n # Checking adjacent cells\n if i > 0 and pasture[i-1][j] == \"W\":\n can_protect = False\n if i < r-1 and pasture[i+1][j] == \"W\":\n can_protect = False\n if j > 0 and pasture[i][j-1] == \"W\":\n can_protect = False\n if j < c-1 and pasture[i][j+1] == \"W\":\n can_protect = False\n\n# Printing the result\nif can_protect:\n print(\"Yes\")\n for i in range(r):\n row = \"\"\n for j in range(c):\n if pasture[i][j] == \".\":\n row += \"D\"\n else:\n row += pasture[i][j]\n print(row)\nelse:\n print(\"No\")\n\n\n \t\t \t\t\t \t\t \t \t \t \t \t", "import sys\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor _ in range(n):\r\n\tarr.append(list(input().replace('.','D')))\r\nbrr=['S','W']\r\nfor i in range(n):\r\n\tfor j in range(m-1):\r\n\t\tif sorted([arr[i][j],arr[i][j+1]])==brr:\r\n\t\t\tprint(\"No\")\r\n\t\t\tsys.exit()\r\nfor i in range(m):\r\n\tfor j in range(n-1):\r\n\t\tif sorted([arr[j][i],arr[j+1][i]])==brr:\r\n\t\t\tprint(\"No\")\r\n\t\t\tsys.exit()\r\n\r\nprint(\"Yes\")\r\nfor i in range(n):\r\n\tprint(*arr[i],sep='')", "r,c=map(int,input().split())\r\nl=[]\r\nf=0\r\nfor i in range(r):\r\n k=list(input())\r\n l.append(k)\r\ndx=[-1,0,1,0]\r\ndy=[0,-1,0,1]\r\nfor i in range(r):\r\n for j in range(c):\r\n if l[i][j]==\"S\":\r\n for k in range(4):\r\n if -1<i+dx[k]<r and -1<j+dy[k]<c:\r\n x=i+dx[k]\r\n y=j+dy[k]\r\n if l[x][y]==\".\":\r\n l[x][y]=\"D\"\r\n elif l[x][y]==\"W\":\r\n f=1\r\n break\r\nif f==1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in l:\r\n print(\"\".join(i))\r\n \r\n ", "r,c=map(int,input().split())\r\na=[input().replace('.','D')for _ in[0]*r]\r\nprint('No'if any('SW'in s or'WS'in s for s in\r\na+[''.join(t)for t in zip(*a)])else'Yes\\n'+'\\n'.join(a))", "r, c = list(map(int, input().split(\" \")))\r\n\r\ndef get_neighbors(grid, row, col):\r\n neighbors = []\r\n if row - 1 >= 0:\r\n neighbors.append(grid[row-1][col])\r\n if row + 1 < len(grid):\r\n neighbors.append(grid[row+1][col])\r\n if col - 1 >= 0:\r\n neighbors.append(grid[row][col-1])\r\n if col + 1 < len(grid[0]):\r\n neighbors.append(grid[row][col+1])\r\n\r\n return neighbors\r\n\r\n\r\n\r\ngrid = []\r\nfor i in range(r):\r\n grid.append([c for c in input()])\r\n\r\nfor row in range(len(grid)):\r\n for col in range(len(grid[i])):\r\n if grid[row][col] == \"S\":\r\n for neighbor in get_neighbors(grid, row, col):\r\n if neighbor == \"W\":\r\n print(\"NO\")\r\n exit()\r\n elif grid[row][col] == \".\":\r\n grid[row][col] = \"D\"\r\n\r\nprint(\"YES\")\r\nfor row in grid:\r\n print(\"\".join(row))", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\n\r\ndef solve():\r\n n, m = get_ints()\r\n grid = []\r\n for _ in range(n):\r\n grid.append(list(get_string()))\r\n \r\n inbound = lambda r, c: 0<=r<n and 0<=c<m\r\n directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]\r\n for row in range(n):\r\n for col in range(m):\r\n if grid[row][col] == 'S':\r\n for i, j in directions:\r\n if inbound(row + i, col + j):\r\n if grid[row + i][col + j] == 'W':\r\n print(\"No\")\r\n return\r\n if grid[row + i][col + j] == '.':\r\n grid[row + i][col + j] = 'D'\r\n print(\"Yes\")\r\n for row in range(n):\r\n print(\"\".join(grid[row]))\r\n \r\nif __name__ == \"__main__\":\r\n solve()", "r,c=map(int, input().split())\r\nt=[]\r\nl=[]\r\nf=0\r\nfor i in range(r):\r\n s=input()\r\n t.append(s)\r\nfor i in range(r):\r\n if f==1:\r\n break\r\n ans=''\r\n for j in range(c):\r\n if t[i][j]=='W':\r\n if t[max(0,i-1)][j]=='S' or t[min(r-1,i+1)][j]=='S' or t[i][min(j+1,c-1)]=='S' or t[i][max(j-1,0)]=='S':\r\n f=1\r\n break\r\n ans+=t[i][j]\r\n elif t[i][j]=='.':\r\n ans+='D'\r\n else:\r\n ans+=t[i][j]\r\n l.append(ans)\r\nif (f):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in l:\r\n print(i)\r\n\r\n\r\n", "r,c = map(int, input().split())\r\n\r\nfarm = []\r\n\r\nfor i in range (r):\r\n farm.append(input())\r\n\r\nmarker = 0 \r\nfor i in range (r):\r\n for j in range (c):\r\n \r\n if farm[i][j] == \"W\":\r\n \r\n if (j<(c-1) and farm[i][j+1] == \"S\"):\r\n print (\"No\")\r\n marker = 1\r\n break\r\n \r\n if (j>0 and farm [i][j-1] == \"S\"):\r\n print (\"No\")\r\n marker = 1 \r\n break\r\n \r\n if (i>0 and farm [i-1][j] == \"S\"):\r\n print (\"No\")\r\n marker = 1 \r\n break\r\n \r\n if (i<(r-1) and farm[i+1][j] == \"S\"):\r\n print (\"No\")\r\n marker = 1 \r\n break\r\n \r\n if marker == 1:\r\n break\r\n \r\n \r\nif marker == 0:\r\n print (\"Yes\")\r\n for i in farm:\r\n print (i.replace(\".\",\"D\"))", "R, C = map(int, input().split())\r\nT = [[] for i in range(R)]\r\nfor i in range(R):\r\n a = list(input())\r\n T[i] = a\r\n\r\nfor i in range(R):\r\n for j in range(C):\r\n if T[i][j] == \"S\":\r\n for dx, dy in [(0, 1), (1, 0), (-1, 0), (0, -1)]:\r\n nx, ny = i + dx, j + dy\r\n if not (0 <= nx < R and 0 <= ny < C):\r\n continue\r\n elif T[nx][ny] == \"W\":\r\n print(\"No\")\r\n exit()\r\n elif T[nx][ny] == \".\":\r\n T[nx][ny] = \"D\"\r\n\r\nprint(\"Yes\")\r\nfor i in range(R):\r\n print(\"\".join(T[i]))", "from dataclasses import replace\n\n\nr, c = list(map(int, input().split()))\npasture = []\nfor i in range(r):\n pasture.append(input())\n\nfor i in range(r):\n for j in range(c):\n if (pasture[i][j] == 'S'):\n if ((i > 0 and (pasture[i-1][j] == 'W')) or (j > 0 and (pasture[i][j-1] == 'W')) or (i < (r-1) and (pasture[i+1][j] == 'W')) or (j < (c-1) and (pasture[i][j+1] == 'W'))):\n print(\"No\")\n exit()\n\nresult = []\nfor i in range(r):\n result.append(pasture[i].replace(\".\", \"D\"))\n\nprint(\"Yes\")\nfor res in result:\n print(res)", "n,m=map(int,input().split())\r\na=[[*input()] for _ in[0]*n]\r\nans='Yes'\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='.':a[i][j]='D';continue\r\n if a[i][j]=='S':\r\n if i>0 and a[i-1][j]=='W':ans='No';break\r\n if i<n-1 and a[i+1][j]=='W':ans='No';break\r\n if j>0 and a[i][j-1]=='W':ans='No';break\r\n if j<m-1 and a[i][j+1]=='W':ans='No';break\r\nprint(ans)\r\nif ans=='Yes':\r\n for i in range(n):print(''.join(a[i]))", "r,c=map(int,input().split())\r\ns='\\n'.join(input().replace('.','D')for _ in[0]*r)\r\nprint('No'if(set(zip(s,s[1:]))|set(zip(s,s[c+1:])))&{('S','W'),('W','S')}else'Yes\\n'+s)", "r, c = map(int, input().split())\r\n \r\narr = []\r\nfor _ in range(r):\r\n arr.append(list(input()))\r\n \r\nstatus = False\r\nfor x in range(r):\r\n for y in range(c):\r\n if arr[x][y] == \".\":\r\n arr[x][y] = \"D\"\r\n continue\r\n \r\n if arr[x][y] == \"S\":\r\n if (x - 1) >= 0 and arr[x-1][y] == \"W\":\r\n status = True\r\n if (x + 1) < r and arr[x+1][y] == \"W\":\r\n status = True\r\n if (y - 1) >= 0 and arr[x][y-1] == \"W\":\r\n status = True\r\n if (y + 1) < c and arr[x][y+1] == \"W\":\r\n status = True\r\n\r\nif status:\r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")\r\n for row in arr:\r\n print(\"\".join(row))\r\n\r\n\r\n", "inp = list(map(int,input().strip().split()))[:2]\n\nrows = inp[0]\ncolumns = inp[1]\n\nmatriz = []\n\nresp = 'Yes'\n\nfor i in range(rows):\n linha = input()\n linh = []\n\n for letra in linha:\n linh.append(letra)\n\n matriz.append(linh)\n\nfor i in range(0,rows):\n for j in range(0,columns):\n if (matriz[i][j]=='S' and ((j < columns-1 and matriz[i][j+1]=='W') or (j > 0 and matriz[i][j-1] == 'W') or (i < rows-1 and matriz[i+1][j] == 'W') or (i>0 and matriz[i-1][j]=='W'))):\n resp = \"No\"\n break\n elif(matriz[i][j]=='S'):\n if(j > 0 and matriz[i][j-1]=='.'):\n matriz[i][j-1]='D'\n if(j < columns-1 and matriz[i][j+1]=='.'):\n matriz[i][j+1]='D'\n if(i>0 and matriz[i-1][j]=='.'):\n matriz[i-1][j]='D'\n if(i < rows-1 and matriz[i+1][j]=='.'):\n matriz[i+1][j]='D'\n\nprint(resp)\n\nif (resp == \"Yes\"):\n for i in range(0,rows):\n string=\"\"\n for j in range(0,columns):\n string+=matriz[i][j]\n print(string)\n\t \t \t\t \t \t \t\t\t\t\t\t\t\t\t \t \t\t", "def protectSheep(i, j, s):\r\n if(i -1 > -1):\r\n if(m[i-1][j] == 'W'):\r\n return True\r\n if(j -1 > -1):\r\n if(m[i][j-1] == 'W'):\r\n return True\r\n if(i +1 < r):\r\n if(m[i+1][j] == 'W'):\r\n return True\r\n if(j +1 < c):\r\n if(m[i][j+1] == 'W'):\r\n return True\r\n return s\r\n\r\ndef arrayToString(s):\r\n result = ''\r\n for k in s:\r\n if(k == '.'):\r\n result += 'D'\r\n \r\n else:\r\n result += k\r\n return result\r\n\r\nr, c = map(int, input().split())\r\nm = []\r\nfor i in range(r):\r\n inp = list(input())\r\n m.append(inp)\r\n\r\nstop = False\r\nfor i in range(r):\r\n for j in range(c):\r\n if(m[i][j] == 'S'):\r\n stop = protectSheep(i, j, stop)\r\n \r\n if(stop):\r\n break\r\n if(stop):\r\n break\r\n\r\nif(stop):\r\n print('No')\r\nelse:\r\n print('YES')\r\n for i in range(r):\r\n print(arrayToString(m[i]))", "import sys\nimport itertools as it\n\nr,c = map(int,sys.stdin.readline().split())\nm = list()\nfor _ in range(r):\n m.append(list(sys.stdin.readline().strip()))\n\nres = True\nfor i in range(r):\n for j in range(c):\n if m[i][j] == 'S':\n if i > 0:\n if m[i-1][j] == '.':\n m[i-1][j] = 'D'\n elif m[i-1][j] == 'W':\n res = False\n break\n\n if i < r-1:\n if m[i+1][j] == '.':\n m[i+1][j] = 'D'\n elif m[i+1][j] == 'W':\n res = False\n break\n\n if j > 0:\n if m[i][j-1] == '.':\n m[i][j-1] = 'D'\n elif m[i][j-1] == 'W':\n res = False\n break\n if j < c-1:\n if m[i][j+1] == '.':\n m[i][j+1] = 'D'\n elif m[i][j+1] == 'W':\n res = False\n break\n\nif res:\n print('Yes')\n for i in range(r):\n print(\"\".join(m[i]))\nelse:\n print('No')\n", "[n, m] = [int(a) for a in input().split(' ')]\npasture = []\nflag = True\nfor i in range(n):\n row = input()\n if row.find('SW') != -1 or row.find('WS') != -1:\n flag = False\n break\n pasture.append(list(row))\n\nif flag:\n for i in range(n-1):\n for j in range(m):\n if (pasture[i][j] == 'S' and pasture[i+1][j] == 'W') or \\\n (pasture[i][j] == 'W' and pasture[i+1][j] == 'S'):\n flag = False\n break\n\nif flag:\n print('Yes')\n for i in range(n):\n print(''.join(pasture[i][j] for j in range(m)).replace('.', 'D'))\nelse:\n print('No')\n", "import sys\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nr, c = list(map(int, input().split()))\r\nm = []\r\n\r\nfor _ in range(r):\r\n m.append(list(input()))\r\n \r\nfor i in range(r):\r\n for j in range(c):\r\n if m[i][j] == 'W':\r\n if i > 0:\r\n if m[i-1][j] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i-1][j] == '.':\r\n m[i-1][j] = 'D'\r\n if i < r - 1:\r\n if m[i+1][j] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i+1][j] == '.':\r\n m[i+1][j] = 'D'\r\n if j > 0:\r\n if m[i][j-1] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i][j-1] == '.':\r\n m[i][j-1] = 'D'\r\n if j < c - 1:\r\n if m[i][j+1] == 'S':\r\n print('No')\r\n sys.exit()\r\n elif m[i][j+1] == '.':\r\n m[i][j+1] = 'D'\r\n \r\nprint('Yes')\r\nfor row in m:\r\n print(''.join(row))", "R,C=map(int,input().split())\r\npasture=[list(input()) for i in range(R)]\r\nfor i in range(R):\r\n for j in range(C-1):\r\n if (pasture[i][j]==\"S\" and pasture[i][j+1]==\"W\") or (pasture[i][j]==\"W\" and pasture[i][j+1]==\"S\"):\r\n print(\"No\")\r\n exit()\r\nfor i in range(R-1):\r\n for j in range(C):\r\n if (pasture[i][j]==\"S\" and pasture[i+1][j]==\"W\") or (pasture[i][j]==\"W\" and pasture[i+1][j]==\"S\"):\r\n print(\"No\")\r\n exit()\r\nfor i in range(R):\r\n for j in range(C):\r\n if pasture[i][j]==\".\":\r\n pasture[i][j]=\"D\"\r\nprint(\"Yes\")\r\nfor i in range(R):\r\n print(\"\".join(pasture[i]))", "def solve(d):\n dx = [1, -1, 0, 0]\n dy = [0, 0, 1, -1]\n res = 1\n for i in range(1, r+1):\n for j in range(1, c+1):\n if (d[i][j] == 'S'):\n for k in range(4):\n if (d[i + dx[k]][j + dy[k]] == 'W'):\n res = 0\n return res, d\n\n for i in range(1, r+1):\n for j in range(1, c+1):\n if (d[i][j] == 'S'):\n for k in range(4):\n if (d[i + dx[k]][j + dy[k]] == '.'):\n d[i + dx[k]][j + dy[k]] = 'D'\n return res, d\n\n\n\nif __name__ == \"__main__\":\n r, c = map(int, input().split())\n d = [['.' for j in range(c+2)] for i in range(r+2)]\n for i in range(1, r+1):\n s = input()\n for j in range(1, c+1):\n d[i][j] = s[j-1]\n res, d = solve(d)\n if (res):\n print('Yes')\n for i in range(1, r+1):\n for j in range(1, c+1):\n print(d[i][j], end=\"\")\n print()\n else: print('No')\n", "flag = 0\r\nR, C = map(int, input().strip().split())\r\nfield = []\r\nfor i in range(R + 2):\r\n field.append(['D'] * (C + 2))\r\nfor i in range(R):\r\n row = input().strip()\r\n row = list(row)\r\n for j in range(C):\r\n if row[j] == '.':\r\n field[i + 1][j + 1] = 'D'\r\n else:\r\n field[i + 1][j + 1] = row[j]\r\n#print(field)\r\nnewfield = []\r\nfor i in range(R):\r\n newfield.append(['D'] * (C))\r\nfor i in range(R):\r\n for j in range(C):\r\n newfield[i][j] = field[i + 1][j + 1]\r\n#print(newfield)\r\nfor i in range(R + 1):\r\n for j in range(C + 1):\r\n if field[i][j] == 'S' and (field[i][j + 1] == 'W' or field[i + 1][j] == 'W' or \\\r\n field[i][j - 1] == 'W' or field[i - 1][j] == 'W'):\r\n flag = 1\r\nif flag == 1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for i in range(R):\r\n b = ''.join(newfield[i])\r\n print(b)\r\n", "r, c = [int(s) for s in input().split(' ')]\r\nrows = [input() for row in range(r)]\r\nans = True\r\nfor row in range(r):\r\n for col in range(c):\r\n if rows[row][col] == 'S' and 'W' in [rows[max(0, row - 1)][col], rows[min(r - 1, row + 1)][col], rows[row][max(0, col - 1)], rows[row][min(c - 1, col + 1)]]:\r\n ans = False\r\nif ans:\r\n print('Yes')\r\n for row in rows:\r\n print(''.join(row.replace('.', 'D')))\r\nelse:\r\n print('No')\r\n", "############################ CUSTOMS ######################\n\nREADY_FOR_SUBMIT = True\n\ndef cust_print(stuff):\n if not READY_FOR_SUBMIT:\n print(stuff)\n else:\n pass\n\n\n############################ SOLUTION ######################\n\n# --- Global vars --- #\noutput = []\n\n\n# --- Algorithm --- #\ndef f(r, c, p):\n global output\n \n for row_i in range(r):\n new_row = \"\"\n for col_i in range(c):\n a = p[row_i][col_i]\n\n if a == \"S\":\n if \"W\" in checker(row_i, col_i, p):\n output = []\n output.append(\"NO\")\n return\n else:\n new_row += \"S\"\n elif a == \".\":\n new_row += \"D\"\n elif a == \"W\":\n if \"S\" in checker(row_i, col_i, p):\n output = []\n output.append(\"NO\")\n return\n else:\n new_row += \"W\"\n\n output.append(new_row)\n\n output.insert(0, \"YES\")\n\ndef checker(row, col, p):\n r = []\n\n try:\n r.append(p[row][col+1]) # forward\n except IndexError:\n pass\n\n try:\n r.append(p[row + 1][col]) # down\n except IndexError:\n pass\n\n return r\n\n\n\n\n# --- Run --- #\n\n# input and computation\nR_C = list(map(int, input().split()))\n\np = []\nfor _ in range(R_C[0]):\n l = input()\n p.append(l)\n\ncust_print(f\"\\n---- Call {1} ----\\n\")\nf(R_C[0], R_C[1], p)\n\n\n# output\ncust_print(\"\\n---- Final output ----\\n\")\nprint(\"\\n\".join(output))", "#948_A\n#4 4\n#..S.\n#..S.\n#....\n#WWWW\n\nn, m = map(int, input().split())\ng = [input().replace('.', 'D') for _ in [0] * n]\nflag1 = any('SW' in x or 'WS' in x for x in g)\ngg = zip(*g)\nflag2 = any('SW' in x or 'WS' in x for x in (''.join(t) for t in gg))\n#print(*gg)\nif (flag1 or flag2):\n print(\"No\")\nelse:\n print(\"YES\")\n print('\\n'.join(g))\n\n#print(flag1)\n", "import sys\r\nr,c= map(int,input().split())\r\nX = []\r\nfor i in range(r):\r\n temp = input()\r\n if \"SW\" in temp or \"WS\" in temp:\r\n print(\"NO\")\r\n sys.exit()\r\n X.append(temp.replace('.','D'))\r\nprev = \"\"\r\nfor i in range(r):\r\n for j in range(c):\r\n if X[i][j] == 'W':\r\n if i > 0:\r\n if X[i - 1][j] == 'S':\r\n print('NO')\r\n sys.exit()\r\n if i < r - 1:\r\n if X[i + 1][j] == 'S':\r\n print('NO')\r\n sys.exit()\r\n \r\nprint(\"YES\")\r\nfor i in X:\r\n print(i)", "a,b=map(int,input().split())\r\narray=[]\r\nfor i in range(a):\r\n array.append(input().strip(\"/n\"))\r\n\r\nfor i in range(a):\r\n for j in range(b-1):\r\n if set([array[i][j],array[i][j+1]])==set([\"S\",\"W\"]):\r\n print(\"No\")\r\n exit(0)\r\nfor i in range(a-1):\r\n for j in range(b):\r\n if set([array[i][j],array[i+1][j]])==set([\"S\",\"W\"]):\r\n print(\"No\")\r\n exit(0)\r\n\r\nprint(\"Yes\")\r\nl=[]\r\nfor i in range(a):\r\n for j in range(b):\r\n if array[i][j]==\".\":\r\n l.append(\"D\")\r\n else:\r\n l.append(array[i][j])\r\n if b-j==1:\r\n l.append(\"\\n\")\r\nprint(*l,end=\"\",sep='')", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nR, C = map(int, inp().split())\r\nls = set()\r\nlw = set()\r\ndone = 0\r\narr = []\r\n\r\nfor _ in range(R):\r\n s = inp().strip()\r\n arr.append(s)\r\n r = 0\r\n ts = set()\r\n tw = set()\r\n for i, c in enumerate(s):\r\n if c == \"S\":\r\n if r == 2 or i in lw:\r\n done = 1\r\n print(\"No\")\r\n break\r\n\r\n r = 1\r\n ts.add(i)\r\n\r\n elif c == \"W\":\r\n if r == 1 or i in ls:\r\n done = 1\r\n print(\"No\")\r\n break\r\n\r\n r = 2\r\n tw.add(i)\r\n else:\r\n r = 0\r\n\r\n if done:\r\n break\r\n\r\n ls = set(ts)\r\n lw = set(tw)\r\n\r\n\r\nif not done:\r\n print(\"Yes\")\r\n print(*[c.replace(\".\", \"D\") for c in arr], sep=\"\\n\")\r\n\r\n\r\n\r\n", "R, C = [int(c) for c in input().split(\" \")]\r\n\r\nshells = []\r\nfor i in range(R):\r\n shells.append([c for c in input()])\r\n\r\ndef check(i, j):\r\n if i>0 and shells[i-1][j] == \"S\":\r\n return False\r\n elif i<R-1 and shells[i+1][j] == \"S\":\r\n return False\r\n elif j>0 and shells[i][j-1] == \"S\":\r\n return False\r\n elif j<C-1 and shells[i][j+1] == \"S\":\r\n return False\r\n else:\r\n return True\r\n\r\ndef nearchange(i, j):\r\n if i>0 and shells[i-1][j] == \".\":\r\n shells[i-1][j] = \"D\"\r\n if i<R-1 and shells[i+1][j] == \".\":\r\n shells[i+1][j] = \"D\"\r\n if j>0 and shells[i][j-1] == \".\":\r\n shells[i][j-1] = \"D\"\r\n if j<C-1 and shells[i][j+1] == \".\":\r\n shells[i][j+1] = \"D\"\r\n\r\nfor i in range(R):\r\n for j in range(C):\r\n if shells[i][j] == \"W\":\r\n if not check(i, j):\r\n print(\"No\")\r\n exit()\r\n else:\r\n nearchange(i, j)\r\n\r\nprint(\"Yes\")\r\nfor i in range(R):\r\n for j in range(C):\r\n print(shells[i][j], end = \"\")\r\n print(\"\")\r\n", "n,m=map(int,input().split())\r\ns=[]\r\nb=int(0)\r\nfor i in range(n):\r\n s.append(input().replace('.','D'))\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] is 'S':\r\n if i>0 and s[i-1][j] is 'W':\r\n b=1\r\n if i<n-1 and s[i+1][j] is 'W':\r\n b=1\r\n if j>0 and s[i][j-1] is 'W':\r\n b=1\r\n if j<m-1 and s[i][j+1] is 'W':\r\n b=1\r\n if b is 1:\r\n break\r\n if b is 1:\r\n break\r\nif b is 1:\r\n print('No')\r\n exit()\r\nprint('Yes')\r\nfor i in range(n):\r\n print(\"\".join(s[i]))", "n, m = list(map(int, input().split()))\nis_possible = True\nboard = []\n\nfor _ in range(n):\n line = input()\n if 'SW' in line or 'WS' in line:\n is_possible = False\n break\n if len(board) > 0:\n for i in range(len(line)):\n if line[i] == 'W' and board[-1][i] == 'S':\n is_possible = False\n if line[i] == 'S' and board[-1][i] == 'W':\n is_possible = False\n board.append(line.replace('.', 'D'))\n\nif is_possible:\n print('Yes')\n\n for row in board:\n print(row)\nelse:\n print('No')\n\t\t \t\t \t\t\t\t\t \t \t \t \t\t \t\t", "r,c=map(int,input().split())\r\nglobal s\r\ns=[list(input()) for i in range(r)]\r\ndi=[-1,0,0,1]\r\ndj=[0,-1,1,0]\r\nisAdj=False\r\nfor i in range(r):\r\n for j in range(c):\r\n if s[i][j]=='S':\r\n for k in range(4):\r\n if (i+di[k] >= 0 and i+di[k] < r) and (j+dj[k] >= 0 and j+dj[k] < c):\r\n if s[i+di[k]][j+dj[k]] == 'W':\r\n isAdj=True\r\n if s[i+di[k]][j+dj[k]] == '.':\r\n s[i+di[k]][j+dj[k]]='D'\r\nfor i in range(r):\r\n for j in range(c):\r\n if s[i][j]=='W':\r\n for k in range(4):\r\n if (i+di[k] >= 0 and i+di[k] < r) and (j+dj[k] >= 0 and j+dj[k] < c):\r\n if s[i+di[k]][j+dj[k]] == 'S':\r\n isAdj=True\r\nif isAdj: print('No')\r\nelse:\r\n print('Yes')\r\n for i in range(r):\r\n for j in range(c):\r\n print(s[i][j],end=\"\")\r\n print()", "R, C = map(int, input().split())\r\na = [input() for i in range(R)]\r\nfor i in range(R):\r\n for j in range(C):\r\n if a[i][j] == 'W':\r\n for x in range(-1, 2):\r\n for y in range(-1, 2):\r\n if abs(y) + abs(x) == 1:\r\n if 0 <= i + x < R:\r\n if a[i+x][j] == 'S':\r\n print('No')\r\n quit()\r\n if 0 <= j + y < C:\r\n if a[i][j+y] == 'S':\r\n print('No')\r\n quit()\r\nprint('Yes')\r\nfor i in range(len(a)):\r\n s = []\r\n for j in a[i]:\r\n s.append(j)\r\n a[i] = s\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == '.':\r\n a[i][j] = 'D'\r\nfor i in a:\r\n s = ''\r\n for j in i:\r\n s += j\r\n print(s)\r\n", "r, c = map(int, input().split())\n \nrows = []\n \nfor i in range(r):\n row = list(input())\n rows.append(row)\n \nstatus = False\n \nfor i in range(r):\n for j in range(c):\n if rows[i][j] == \".\":\n rows[i][j] = \"D\"\n continue\n \n if rows[i][j] == \"S\":\n if (i - 1) >= 0 and rows[i-1][j] == \"W\":\n status = True\n if (i + 1) < r and rows[i+1][j] == \"W\":\n status = True\n if (j - 1) >= 0 and rows[i][j-1] == \"W\":\n status = True\n if (j + 1) < c and rows[i][j+1] == \"W\":\n status = True\n \nif status:\n print (\"NO\")\nelse:\n print (\"YES\")\n for row in rows:\n print (\"\".join(row))\n\t \t\t \t\t \t\t \t \t \t\t \t\t\t \t", "r, c = map(int, input().split())\r\ngrid = []\r\nfor i in range(r):\r\n grid.append(input())\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j] == 'S':\r\n no_way_to_escape = i != 0 and grid[i - 1][j] == 'W'\r\n no_way_to_escape |= j != c - 1 and grid[i][j + 1] == 'W'\r\n no_way_to_escape |= j != 0 and grid[i][j - 1] == 'W'\r\n no_way_to_escape |= i != r - 1 and grid[i + 1][j] == 'W'\r\n if(no_way_to_escape):\r\n print('No')\r\n exit()\r\nprint('Yes')\r\nfor i in grid:\r\n for j in i:\r\n print(j if j != '.' else 'D', end = '')\r\n print()\r\n", "r,c=list(map(int,input().split()))\r\na=[]\r\nf,arr=0,[]\r\nfor i in range(r):\r\n arr.append(input())\r\nfor i in range(len(arr)):\r\n b=[]\r\n for j in range(len(arr[i])):\r\n b.append(arr[i][j])\r\n a.append(b)\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if a[i][j]=='S':\r\n if i-1>=0 and a[i-1][j]=='.':\r\n a[i-1][j]='D'\r\n elif i-1>=0 and a[i-1][j]=='W':\r\n f=1 \r\n break\r\n if i+1<r and a[i+1][j]=='.':\r\n a[i+1][j]='D'\r\n elif i+1<r and a[i+1][j]=='W':\r\n f=1 \r\n break\r\n if j-1>=0 and a[i][j-1]=='.':\r\n a[i][j-1]='D'\r\n elif j-1>=0 and a[i][j-1]=='W':\r\n f=1 \r\n break\r\n if j+1<c and a[i][j+1]=='.':\r\n a[i][j+1]='D'\r\n elif j+1<c and a[i][j+1]=='W':\r\n f=1 \r\n break\r\n \r\nif f==1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for i in range(r):\r\n print(''.join(a[i]))\r\n \r\n ", "x,y=map(int,input().split())\r\nlol=[]\r\nf=0\r\nfor _ in range(x):\r\n a=input()\r\n a=a.replace(\".\",\"D\")\r\n #print(a)\r\n for i in range(1,y):\r\n if (a[i]==\"S\" and a[i-1]==\"W\") or (a[i-1]==\"S\" and a[i]==\"W\"):\r\n f=1\r\n break\r\n if f==1:\r\n break\r\n lol.append(a)\r\nif not f and len(lol)>1:\r\n for i in range(x):\r\n for j in range(y):\r\n if i==0:\r\n yo=[lol[i][j],lol[i+1][j]]\r\n elif i==x-1:\r\n yo=[lol[i][j],lol[i-1][j]]\r\n else: \r\n yo=[lol[i][j],lol[i-1][j],lol[i+1][j]]\r\n if \"W\" in yo and \"S\" in yo and lol[i][j]!=\"D\":\r\n f=1\r\n #print(yo,i,j,lol[i],lol[i-1],lol[i+1])\r\n break\r\n \r\n if f:\r\n break\r\n \r\nif f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in lol:\r\n print(i)", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 10.03.2018 20:50 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef dogs(lst, x, y, R, C):\r\n if x-1 >= 0 and lst[x-1][y] == \".\": lst[x-1][y]=\"D\"\r\n elif x-1 >= 0 and lst[x-1][y] == \"W\":return -1\r\n if x+1 < C and lst[x+1][y] == \".\":lst[x+1][y]=\"D\"\r\n elif x+1 < C and lst[x+1][y] == \"W\":return -1\r\n if y-1 >= 0 and lst[x][y-1] == \".\":lst[x][y-1]=\"D\"\r\n elif y-1 >= 0 and lst[x][y-1] == \"W\":return -1\r\n if y+1 < R and lst[x][y+1] == \".\":lst[x][y+1]=\"D\"\r\n elif y+1 < R and lst[x][y+1] == \"W\":return -1\r\n return lst\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n R, C = map(int, input().split())\r\n l = []\r\n for i in range(R):\r\n l.append(list(input()))\r\n ovc = []\r\n for i in range(R):\r\n for j in range(C):\r\n if l[i][j] == \"S\": ovc.append([i,j])\r\n for i, j in ovc:\r\n l = dogs(l, i, j, C, R)\r\n if l == -1:\r\n print(\"No\")\r\n break\r\n else:\r\n print(\"Yes\")\r\n for i in range(R):\r\n print(\"\".join(l[i]))\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "# LUOGU_RID: 101738818\nn, m = map(int, input().split())\r\ng = [input().replace('.', 'D') for _ in range(n)]\r\nif any('SW' in x or 'WS' in x for x in g) or any('SW' in x or 'WS' in x for x in (''.join(t) for t in zip(*g))):\r\n print('No')\r\nelse:\r\n print('Yes', *g, sep='\\n')\r\n", "row,col=map(int,input().split());l=[input().replace('.','D') for i in range(row)];f=1\r\nfor i in range(row):\r\n for j in range(col):\r\n if i>0 and {l[i][j],l[i-1][j]}=={'S','W'}:f=0\r\n if j>0 and {l[i][j],l[i][j-1]}=={'S','W'}:f=0\r\nif f==0:print(\"No\")\r\nelse:print(\"Yes\");print('\\n'.join(l))", "lin, col = [int(x) for x in input().split()]\r\n\r\npasto = []\r\nfor i in range(0, lin):\r\n pala = list(input())\r\n pasto.append(pala)\r\n\r\npossivel = True\r\n\r\nfor i in range(0, lin):\r\n for j in range(0, col):\r\n if pasto[i][j] == 'W':\r\n if i > 0:\r\n if pasto[i-1][j] == 'S':\r\n possivel = False\r\n break\r\n if i < lin-1:\r\n if pasto[i+1][j] == 'S':\r\n possivel = False\r\n break\r\n if j > 0:\r\n if pasto[i][j-1] == 'S':\r\n possivel = False\r\n break\r\n if j < col - 1:\r\n if pasto[i][j+1] == 'S':\r\n possivel = False\r\n break\r\n elif pasto[i][j] == '.':\r\n pasto[i][j] = 'D'\r\nif possivel == True:\r\n print('Yes')\r\n for i in range(0, lin):\r\n for j in range(0, col):\r\n print(pasto[i][j], end = '')\r\n print()\r\nelse:\r\n print('No')", "\nr, c = list(map(int, input().split()))\nmatrix = []\n\nfor i in range(r):\n matrix.append(list(input()))\n\nis_safe = True\nfor i in range(r):\n for j in range(c):\n if i+1 < r and (matrix[i][j] == \"W\" and matrix[i+1][j] == \"S\" or matrix[i][j] == \"S\" and matrix[i+1][j] == \"W\"):\n is_safe = False\n if j+1 < c and (matrix[i][j] == \"W\" and matrix[i][j+1] == \"S\" or matrix[i][j] == \"S\" and matrix[i][j+1] == \"W\"):\n is_safe = False\n\nfor i in range(r):\n for j in range(c):\n if matrix[i][j] == \"W\":\n if i-1 >= 0 and matrix[i-1][j] == \".\":\n matrix[i-1][j] = \"D\"\n if i+1 < r and matrix[i+1][j] == \".\":\n matrix[i+1][j] = \"D\"\n if j-1 >= 0 and matrix[i][j-1] == \".\":\n matrix[i][j-1] = \"D\"\n if j+1 < c and matrix[i][j+1] == \".\":\n matrix[i][j+1] = \"D\"\n\nif is_safe:\n print(\"Yes\")\n for l in matrix:\n print(''.join(l))\nelse:\n print(\"No\")\n\n \t\t\t \t\t \t \t \t \t", "r, c = map(int, input().split(\" \"))\r\n\r\ngrid = []\r\nfor row in range(r):\r\n grid.append([])\r\n\r\nfor row in grid:\r\n x = input()\r\n for z in x:\r\n row.append(z)\r\n \r\nresp = \"YES\"\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j] == \"S\":\r\n if 0 < i:\r\n if grid[i - 1][j] == \"W\":\r\n resp = \"NO\"\r\n break\r\n if 0 < j:\r\n if grid[i][j - 1] == \"W\":\r\n resp = \"NO\"\r\n break\r\n if i < r - 1:\r\n if grid[i + 1][j] == \"W\":\r\n resp = \"NO\"\r\n break\r\n if j < c - 1:\r\n if grid[i][j + 1] == \"W\":\r\n resp = \"NO\"\r\n break\r\n\r\nif resp == \"NO\":\r\n print(resp)\r\nelse:\r\n print(resp)\r\n for i in range(r):\r\n line = \"\"\r\n for j in range(c):\r\n if grid[i][j] == \".\":\r\n line += \"D\"\r\n else:\r\n line += grid[i][j]\r\n print(line)", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nfrom collections import defaultdict\n\ndef dfs(n,dx):\n vis[n]=1\n dis[n]=dx\n for i in adj[n]:\n if(vis[i]==0):\n dfs(i,dx+1)\n \n\nr,c=M()\nl=[]\nx=[]\nfor i in range(r):\n s=input().strip()\n s=list(s)\n for j in range(c):\n if(s[j]=='.'):\n s[j]='D'\n if(s[j]=='W'):\n x.append((i,j))\n l.append(s)\nfor i in range(len(x)):\n if(x[i][0]-1>=0):\n if(l[x[i][0]-1][x[i][1]]=='S'):\n print(\"No\")\n exit()\n if(x[i][0]+1<r):\n if(l[x[i][0]+1][x[i][1]]=='S'):\n print(\"No\")\n exit()\n if(x[i][1]-1>=0):\n if(l[x[i][0]][x[i][1]-1]=='S'):\n print(\"No\")\n exit()\n \n if(x[i][1]+1<c):\n if(l[x[i][0]][x[i][1]+1]=='S'):\n print(\"No\")\n exit()\n\nprint(\"Yes\")\nfor i in range(len(l)):\n for j in l[i]:\n print(j,end=\"\")\n print()\n \n\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\ndef solve(r, c, mat):\n for i in range(r):\n row = mat[i]\n for j in range(c):\n if row[j] == \".\":\n row[j] = \"D\"\n \n for i in range(r):\n row = mat[i]\n for j in range(c):\n if row[j] == \"W\":\n for di, dj in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\n if 0 <= di < r and 0 <= dj < c and mat[di][dj] == \"S\":\n return False\n return True\n\n\nr, c = map(int, input().split())\nmat = []\n\nfor _ in range(r):\n mat.append(list(input().rstrip()))\n\nif solve(r,c, mat):\n print(\"Yes\")\n for r in mat:\n print(\"\".join(r))\nelse:\n print(\"No\")", "R,C=map(int,input().split())\narray=[]\nfor i in range(R):\n\tarray.append(input().strip(\"\\n\"))\n\t\nfor i in range(R):\n\tfor j in range(C-1):\n\t\tif set([array[i][j],array[i][j+1]])==set([\"S\",\"W\"]):\n\t\t\tprint(\"No\")\n\t\t\texit()\nfor i in range(R-1):\n\tfor j in range(C):\n\t\tif set([array[i][j],array[i+1][j]])==set([\"S\",\"W\"]):\n\t\t\tprint(\"No\")\n\t\t\texit()\n\nprint(\"Yes\")\nfor i in range(R):\n\tline = \"\"\n\tfor j in range(C):\n\t\tif array[i][j]==\".\":\n\t\t\tline+=\"D\"\n\t\telse:\n\t\t\tline+=array[i][j]\n\tprint(line)", "r, c = map(int,input().split())\naux = False\nlista = []\n\nfor e in range(r):\n contex = input()\n lista.append(contex)\n\nfor i in range(r):\n for j in range(c):\n if(lista[i][j] == \"W\" and i+1 < r ):\n if(lista[i+1][j] == \"S\"):\n aux = True\n break\n if(lista[i][j] == \"W\" and j+1 < c):\n if(lista[i][j+1] == \"S\"):\n aux = True\n break\n if(lista[i][j] == \"W\" and i > 0):\n if(lista[i-1][j] == \"S\"):\n aux = True\n break\n if(lista[i][j] == \"W\" and j > 0):\n if(lista[i][j-1] == \"S\"):\n aux = True\n break\n if(aux): break\n\nif(aux):\n print(\"No\")\nelse:\n print(\"Yes\")\n for s in lista:\n e = list(s)\n i = 0\n while(i < c):\n if(e[i] == \".\"):\n e[i] = \"D\"\n i += 1\n print(\"\".join(e))\n \t\t\t\t\t \t\t\t\t\t \t\t\t \t\t \t \t", "def check(i, w):\r\n if i > 0 and l[i - 1][w] == \"W\":\r\n return False\r\n if i < r - 1 and l[i + 1][w] == \"W\":\r\n return False\r\n if w > 0 and l[i][w - 1] == \"W\":\r\n return False\r\n if w < c - 1 and l[i][w + 1] == \"W\":\r\n return False\r\n return True\r\n\r\ndef protect(l):\r\n for i in range(0, r):\r\n for w in range(0, c):\r\n if l[i][w] == \"S\":\r\n if not check(i, w):\r\n print(\"No\")\r\n return\r\n for i in range(0, r):\r\n for w in range(0, c):\r\n if l[i][w] == \".\":\r\n l[i][w] = \"D\"\r\n print(\"Yes\")\r\n for i in range(0, r):\r\n print(\"\".join(l[i]))\r\n\r\nr, c = map(int, input().split())\r\nl = []\r\nfor i in range(0, r):\r\n s = input()\r\n s = list(s)\r\n l.append(s)\r\nprotect(l)", "n,m = list(map(int,input().split()))\r\nmat = []\r\nfor i in range(n):\r\n x = list(map(str,input()))\r\n mat.append(x)\r\n\r\n# Direction vectors\r\ndr = [-1,1,0,0]\r\ndc = [0,0,1,-1]\r\nf = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n # print(mat[i][j])\r\n if mat[i][j]=='S':\r\n for k in range(4):\r\n if i+dr[k]>=n or j+dc[k]>=m:\r\n continue\r\n if i+dr[k]<0 or j+dc[k]<0:\r\n continue\r\n if mat[i+dr[k]][j+dc[k]]=='W':\r\n f = 1\r\n break\r\n elif mat[i+dr[k]][j+dc[k]]=='.':\r\n mat[i+dr[k]][j+dc[k]]='D'\r\n if f==1:\r\n break\r\n if f==1:\r\n break\r\nif f==0:\r\n print(\"Yes\")\r\n for i in mat:\r\n for j in i:\r\n print(j,end='')\r\n print()\r\nelse:\r\n print(\"No\")", "r, c = map(int, input().split())\nmat = []\nfor i in range(r):\n mat.append(list(input()))\nfor i in range(r):\n for j in range(c):\n if mat[i][j] == \"S\":\n if i > 0:\n if mat[i - 1][j] == \"W\":\n print(\"No\")\n exit()\n elif mat[i - 1][j] == \".\":\n mat[i - 1][j] = \"D\"\n if i < r-1:\n if mat[i + 1][j] == \"W\":\n print(\"No\")\n exit()\n elif mat[i + 1][j] == \".\":\n mat[i + 1][j] = \"D\"\n if j > 0:\n if mat[i][j-1] == \"W\":\n print(\"No\")\n exit()\n elif mat[i][j - 1] == \".\":\n mat[i][j - 1] = \"D\"\n if j < c - 1:\n if mat[i][j+1] == \"W\":\n print(\"No\")\n exit()\n elif mat[i][j+1] == \".\":\n mat[i][j + 1] = \"D\"\nprint(\"Yes\")\nfor x in mat:\n print(\"\".join(x))", "r, c = input().split()\r\nr, c = int(r), int(c)\r\n\r\nmatrix = []\r\nfor i in range(r):\r\n matrix.append(list(input()))\r\n\r\npossible = 'YES'\r\nfor i in range(r):\r\n for j in range(c):\r\n if matrix[i][j] == 'W':\r\n if j+1 < c and matrix[i][j + 1] == 'S':\r\n possible = 'NO'\r\n if j-1 >= 0 and matrix[i][j - 1] == 'S':\r\n possible = 'NO'\r\n if i+1 < r and matrix[i + 1][j] == 'S':\r\n possible = 'NO'\r\n if i-1 >= 0 and matrix[i - 1][j] == 'S':\r\n possible = 'NO'\r\n\r\nif possible == 'NO':\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(r):\r\n row = \"\"\r\n for j in range(c):\r\n if matrix[i][j] == '.':\r\n if j + 1 < c and matrix[i][j + 1] == 'W':\r\n matrix[i][j] = 'D'\r\n if j - 1 >= 0 and matrix[i][j - 1] == 'W':\r\n matrix[i][j] = 'D'\r\n if i + 1 < r and matrix[i + 1][j] == 'W':\r\n matrix[i][j] = 'D'\r\n if i - 1 >= 0 and matrix[i - 1][j] == 'W':\r\n matrix[i][j] = 'D'\r\n row += matrix[i][j]\r\n print(row)\r\n\r\n\r\n\r\n", "R,C = map(int, input().split())\n\naux = []\nfor i in range(R):\n st = input()\n st = st.replace('.','D')\n aux.append(st)\n\n\nimp = False\nfor i in range(R):\n if aux[i].__contains__('SW'):\n imp = True\n break\n \n if aux[i].__contains__('WS'):\n imp = True\n break\n \naux2 = [list(el) for el in zip(*aux)]\naux2 = [\"\".join(el) for el in aux2]\n\nfor i in range(C):\n if aux2[i].__contains__('SW'):\n imp = True\n break\n \n if aux2[i].__contains__('WS'):\n imp = True\n break\n \nif not imp:\n print(\"Yes\")\n for i in range(R):\n print(aux[i])\nelse:\n print(\"No\")\n \t\t \t \t\t \t \t \t\t \t\t\t\t", "rows, columns = list(map(int, input().split()))\npasto = []\n\nfor _ in range(rows):\n pasto.append(list(input()))\n\n\nfor row in range(len(pasto)):\n for col in range(len(pasto[row])):\n valido = True\n if pasto[row][col] == 'W':\n row_min = row == 0\n row_max = row == len(pasto)-1\n col_min = col == 0\n col_max = col == len(pasto[row])-1\n\n if not row_min:\n if pasto[row-1][col] == 'S':\n valido = False\n if pasto[row-1][col] == '.':\n pasto[row-1][col] = 'D'\n if not row_max:\n if pasto[row+1][col] == 'S':\n valido = False\n if pasto[row+1][col] == '.':\n pasto[row+1][col] = 'D'\n if not col_min:\n if pasto[row][col-1] == 'S':\n valido = False\n if pasto[row][col-1] == '.':\n pasto[row][col-1] = 'D'\n if not col_max:\n if pasto[row][col+1] == 'S':\n valido = False\n if pasto[row][col+1] == '.':\n pasto[row][col+1] = 'D'\n\n if not valido:\n break\n if not valido:\n break\n\nif not valido:\n print(\"No\")\nelse:\n print(\"Yes\")\n for row in pasto:\n print(\"\".join(row))\n\n\n\n\n \t\t\t \t\t \t \t\t \t \t\t \t\t\t \t \t\t", "r,c= list(map(int,input().split()))\r\nl = [ input() for i in range(r)]\r\nfor i in range(r):\r\n for j in range(c-1):\r\n if((l[i][j]=='S' and l[i][j+1]=='W') or (l[i][j]=='W' and l[i][j+1]=='S') ):\r\n print('No')\r\n exit()\r\n\r\n\r\nfor j in range(c):\r\n for i in range(r-1):\r\n if((l[i][j]=='S' and l[i+1][j]=='W') or (l[i][j]=='W' and l[i+1][j]=='S') ):\r\n print('No')\r\n exit()\r\nprint('Yes')\r\nfor i in range(r):\r\n for j in range(c):\r\n if(l[i][j]=='.'):\r\n print('D',end='')\r\n else:\r\n print(l[i][j],end='')\r\n print('')\r\n\r\n\r\n \r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\ng = [list(input()) for i in range(n)]\r\ndx, dy = [0, 1, 0, -1], [1, 0, -1, 0]\r\n\r\n\r\ndef placeDog(x, y):\r\n global g\r\n # 检查四个方向\r\n for d in range(4):\r\n nx, ny = x + dx[d], y + dy[d]\r\n if not 0 <= nx < n or not 0 <= ny < m:\r\n continue\r\n if g[nx][ny] == 'W':\r\n return False\r\n if g[nx][ny] == '.':\r\n g[nx][ny] = 'D'\r\n return True\r\n\r\n\r\ndef solve():\r\n for x in range(n):\r\n for y in range(m):\r\n if g[x][y] != 'S':\r\n continue\r\n if not placeDog(x, y):\r\n return False\r\n return True\r\n\r\n\r\nif solve():\r\n print(\"Yes\")\r\n for row in g:\r\n print(\"\".join(row), end=\"\\n\")\r\nelse:\r\n print(\"No\")\r\n", "n,m = map(int, input().split())\r\n\r\narr = [input().replace('.', 'D') for _ in [0]*n];\r\nflag1 = any('SW'in x or 'WS' in x for x in arr)\r\narrRotated = zip(*arr);\r\nflag2 = any('SW'in x or 'WS' in x for x in (''.join(t) for t in arrRotated))\r\nif flag1 or flag2:\r\n print(\"No\");\r\nelse:\r\n print(\"Yes\");\r\n print('\\n'.join(arr));", "a,b = map(int,input().split())\r\nsList = [''] * a\r\nfor i in range(a):\r\n sList[i] += input().replace('.','D')\r\n if ('WS' in sList[i]) or ('SW' in sList[i]):\r\n print('NO')\r\n break\r\nelse:\r\n kList = [''] * b\r\n for i in range(b):\r\n for j in range(a):\r\n kList[i] += sList[j][i]\r\n if ('WS' in kList[i]) or ('SW' in kList[i]):\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n for i in range(a):\r\n print(sList[i])\r\n", "r, c = map(int, input().split())\r\ns = []\r\nfor i in range(r):\r\n a = input().replace('.', 'D')\r\n s.append(a)\r\n\r\nk = 1\r\narr = ([''.join(x) for x in list(zip(*s))])\r\n\r\nfor char in s:\r\n \r\n if 'SW' in char or 'WS' in char:\r\n k = 0\r\n break\r\n \r\nelse:\r\n for char in arr:\r\n if 'SW' in char or 'WS' in char:\r\n k = 0\r\n break\r\n\r\nif k:\r\n print('Yes')\r\n print('\\n'.join(s))\r\n \r\nelse:\r\n print('No')\r\n", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:19/03/2020\r\n'''\r\nfrom math import ceil,sqrt,log\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\n\r\ndef main():\r\n # for _ in range(ii()):\r\n \r\n r,c=mi()\r\n a=[]\r\n for i in range(r):\r\n a.append(list(si()))\r\n f=0\r\n for i in range(r):\r\n for j in range(c):\r\n if(a[i][j]=='S'):\r\n if(i>0):\r\n if(a[i-1][j]=='.'):\r\n a[i-1][j]='D'\r\n if(a[i-1][j]=='W'):\r\n f=1\r\n if(j>0):\r\n if(a[i][j-1]=='.'):\r\n a[i][j-1]='D'\r\n if(a[i][j-1]=='W'):\r\n f=1\r\n if(i<r-1):\r\n if(a[i+1][j]=='.'):\r\n a[i+1][j]='D'\r\n if(a[i+1][j]=='W'):\r\n f=1\r\n if(j<c-1):\r\n if(a[i][j+1]=='.'):\r\n a[i][j+1]='D'\r\n if(a[i][j+1]=='W'):\r\n f=1\r\n if(f):\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(r):\r\n for j in range(c):\r\n print(a[i][j],end=\"\")\r\n print()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ ==\"__main__\":\r\n main()", "def floodfill(grid, i, j, visited):\t# -> bool\r\n\tif (i, j) in visited:\r\n\t\treturn True\r\n\r\n\tvisited.add((i, j))\r\n\r\n\tif is_Wolf_adjacent(i, j):\r\n\t\treturn False\r\n\r\n\telse:\r\n\t\tw = x = y = z = True\r\n\r\n\t\tif is_in_grid(i+1, j):\r\n\t\t\tif grid[i+1][j] == 'S': w = floodfill(grid, i+1, j, visited)\r\n\t\t\telse: grid[i+1][j] = 'D'\r\n\r\n\t\tif is_in_grid(i-1, j):\r\n\t\t\tif grid[i-1][j] == 'S': x = floodfill(grid, i-1, j, visited)\r\n\t\t\telse: grid[i-1][j] = 'D'\r\n\r\n\t\tif is_in_grid(i, j+1):\r\n\t\t\tif grid[i][j+1] == 'S': y = floodfill(grid, i, j+1, visited)\r\n\t\t\telse: grid[i][j+1] = 'D'\r\n\r\n\t\tif is_in_grid(i, j-1):\r\n\t\t\tif grid[i][j-1] == 'S': z = floodfill(grid, i, j-1, visited)\r\n\t\t\telse: grid[i][j-1] = 'D'\r\n\r\n\treturn w and x and y and z\r\n\r\n\r\ndef is_protectable(grid):\t\t# -> bool\r\n\tvisited = set()\r\n\r\n\tfor i in range(r):\r\n\t\tfor j in range(c):\r\n\t\t\tif grid[i][j] == 'S' and (i, j) not in visited:\r\n\t\t\t\tz = floodfill(grid, i, j, visited)\r\n\t\t\t\tif not z:\r\n\t\t\t\t\treturn False\r\n\treturn True\r\n\r\n\r\n\r\ndef is_in_grid(i, j):\r\n\treturn i >= 0 and i < r and j >= 0 and j < c\r\n\r\n\r\ndef is_Wolf_adjacent(i, j):\r\n\treturn (i-1) >= 0 and grid[i-1][j] == 'W' or \\\r\n\t\t (i+1) < r and grid[i+1][j] == 'W' or \\\r\n\t\t (j-1) >= 0 and grid[i][j-1] == 'W' or \\\r\n\t\t (j+1) < c and grid[i][j+1] == 'W'\r\n\t\r\n\r\nif __name__ == '__main__':\r\n\tglobal r \r\n\tglobal c\r\n\tr, c = tuple(map(int, input().split()))\r\n\tgrid = []\r\n\tfor i in range(r):\r\n\t\tx = list(input())\r\n\t\tgrid.append(x)\r\n\r\n\tres = is_protectable(grid)\r\n\td = {True:'Yes', False:'No'}\r\n\t\r\n\tprint(d[res])\r\n\tif res:\r\n\t\tfor i in range(r):\r\n\t\t\tprint(''.join(map(str, grid[i])))\r\n", "n, m = map(int, input().split(' '))\r\ns = []\r\nfor i in range(n):\r\n s.append(list(input()))\r\nok = True\r\ndx = [0, 1, 0, -1]\r\ndy = [1, 0, -1, 0]\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == 'S':\r\n for k in range(4):\r\n x = i + dx[k]\r\n y = j + dy[k]\r\n if x >= 0 and x < n and y >= 0 and y < m:\r\n if s[x][y] == 'W':\r\n ok = False\r\n elif s[x][y] == '.':\r\n s[x][y] = 'D'\r\nif ok:\r\n print('Yes')\r\n for i in range(n):\r\n print(''.join(s[i]))\r\nelse:\r\n print('No')", "# rows, cols = map(int, input().split())\r\n\r\n# box = []\r\n# for row in range(rows):\r\n# input_row = input()\r\n# res = \"\"\r\n# for i in range(cols):\r\n# if input_row[i] == \".\":\r\n# res += \"D\"\r\n# else:\r\n# res += input_row[i]\r\n\r\n# print(res)\r\n# read input\r\nr, c = map(int, input().split())\r\npasture = [input() for _ in range(r)]\r\n\r\n# iterate over each sheep cell and place a dog in each neighboring cell\r\nfor i in range(r):\r\n for j in range(c):\r\n if pasture[i][j] == 'S':\r\n if i > 0:\r\n if pasture[i-1][j] == '.':\r\n pasture[i-1] = pasture[i-1][:j] + 'D' + pasture[i-1][j+1:]\r\n elif pasture[i-1][j] == 'W':\r\n print(\"No\")\r\n exit()\r\n if i < r-1:\r\n if pasture[i+1][j] == '.':\r\n pasture[i+1] = pasture[i+1][:j] + 'D' + pasture[i+1][j+1:]\r\n elif pasture[i+1][j] == 'W':\r\n print(\"No\")\r\n exit()\r\n if j > 0:\r\n if pasture[i][j-1] == '.':\r\n pasture[i] = pasture[i][:j-1] + 'D' + pasture[i][j:]\r\n elif pasture[i][j-1] == 'W':\r\n print(\"No\")\r\n exit()\r\n if j < c-1:\r\n if pasture[i][j+1] == '.':\r\n pasture[i] = pasture[i][:j+1] + 'D' + pasture[i][j+2:]\r\n elif pasture[i][j+1] == 'W':\r\n print(\"No\")\r\n exit()\r\n\r\n# print the pasture with dogs placed\r\nprint(\"Yes\")\r\nfor row in pasture:\r\n print(row)", "import sys\r\nsys.setrecursionlimit(200000)\r\nimport math\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\nfrom functools import lru_cache\r\nimport heapq \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\nrow,col=inlt()\r\ngrid=[]\r\nfor i in range(row):\r\n grid.append(insr())\r\ndirections=[(-1,0),(1,0),(0,1),(0,-1)]\r\ndef isValid(nr,nc):\r\n if (nr <0 or nr >= row or nc<0 or nc>=col) or grid[nr][nc]==\"S\":\r\n return True\r\n if grid[nr][nc]==\"W\":\r\n return False\r\n grid[nr][nc]=\"D\"\r\n return True\r\nfor i in range(row):\r\n for j in range(col):\r\n if grid[i][j]==\"S\":\r\n x=True\r\n for r,c in directions:\r\n x=x and isValid(i+r,j+c)\r\n if x==False:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in range(row):\r\n print(\"\".join(grid[i]))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n ", "r, c = map(int, input().split())\nans = []\n\nfor i in range(r):\n string = list(input().strip())\n ans.append(string)\n\nflag = False\n\nfor i in range(r):\n for j in range(c):\n\n if ans[i][j] == \"S\":\n if i - 1 >= 0 and ans[i-1][j] == \"W\": flag = True\n if i + 1 < r and ans[i+1][j] == \"W\": flag = True\n if j - 1 >= 0 and ans[i][j-1] == \"W\": flag = True\n if j + 1 < c and ans[i][j+1] == \"W\": flag = True\n\n elif ans[i][j] == \".\": ans[i][j] = \"D\"\n\n\nif flag:\n print(\"NO\")\nelse:\n print(\"YES\")\n for row in ans: print(*row, sep=\"\")\n\t \t\t\t\t\t \t\t\t\t \t \t\t\t\t\t \t\t\t \t\t\t", "r, c = map(int, input().split())\r\ns = []\r\nfor i in range(r):\r\n a = input().replace('.', 'D')\r\n s.append(a)\r\n\r\n\r\nans = 'Yes'\r\ny = ([''.join(x) for x in list(zip(*s))])\r\nfor x in s:\r\n if 'SW' in x or 'WS' in x:\r\n ans = 'No'\r\n\r\nfor x in y:\r\n if 'SW' in x or 'WS' in x:\r\n ans = 'No'\r\nif ans == 'Yes':\r\n print(ans)\r\n print('\\n'.join(s))\r\nelse:\r\n print(ans)", "# 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\nr, c = iis()\r\ngrid = [list(inp()) for _ in range(r)]\r\n\r\n\r\ndef checkAlive():\r\n for i in range(r):\r\n for j in range(c):\r\n if grid[i][j] == 'S':\r\n neighbours = []\r\n if i > 0:\r\n neighbours.append(grid[i - 1][j])\r\n if j > 0:\r\n neighbours.append(grid[i][j - 1])\r\n if i < r - 1:\r\n neighbours.append(grid[i + 1][j])\r\n if j < c - 1:\r\n neighbours.append(grid[i][j + 1])\r\n if \"W\" in neighbours:\r\n return False\r\n return True\r\n\r\n\r\nres = checkAlive()\r\nif not res:\r\n print(\"No\")\r\nelse:\r\n print(\"YES\")\r\n for row in grid:\r\n for el in row:\r\n print(el if el != \".\" else \"D\", end=\"\")\r\n print()\r\n", "r, c = str(input()).split()\nr = int(r)\nc = int(c)\nflag = True\npasto = [None] * r\nfor j in range(r):\n pasto[j] = [None] * c\n entr = str(input())\n entrada = [char for char in entr]\n for g in range(len(entrada)):\n pasto[j][g] = entrada[g]\nfor k in range(len(pasto)):\n for l in range(len(pasto[k])):\n if pasto[k][l] == \"S\":\n if (k + 1 < r):\n if(pasto[k+1][l] == \"W\"):\n flag = False\n elif(pasto[k+1][l] == \".\"):\n pasto[k+1][l] = \"D\"\n if (k-1 > -1):\n if(pasto[k-1][l] == \"W\"):\n flag = False\n elif(pasto[k-1][l] == \".\"):\n pasto[k-1][l] = \"D\"\n if(l-1 > -1):\n if(pasto[k][l-1] == \"W\"):\n flag = False\n elif(pasto[k][l-1] == \".\"):\n pasto[k][l-1] = \"D\"\n if(l+1 < c):\n if(pasto[k][l+1] == \"W\"):\n flag = False\n elif(pasto[k][l+1] == \".\"):\n pasto[k][l+1] = \"D\"\n \n \nif flag:\n print(\"Yes\")\n for u in range(len(pasto)):\n saida = \"\"\n for w in range(len(pasto[u])):\n saida += pasto[u][w]\n print(saida)\n \nelse:\n print(\"No\")\n\t\t \t \t \t \t \t\t \t\t \t\t \t \t\t\t", "r,c=map(int,input().split())\na=[input().replace('.','D')for _ in[0]*r]\nprint('No'if any(any('SW'in s or'WS'in s for s in x)for x\nin(a,(''.join(t)for t in zip(*a))))else'\\n'.join(['Yes']+a))", "import sys\r\n\r\ns = input().split()\r\nr,c = map(int, s)\r\nf = ['']*r\r\nfor x in range(r):\r\n f[x] = input().replace('.', 'D')\r\n if 'WS' in f[x] or 'SW' in f[x]:\r\n print('No')\r\n sys.exit(0)\r\n if x > 0:\r\n for y in range(c):\r\n up = f[x][y]+f[x-1][y]\r\n if up in ['SW', 'WS']:\r\n print('No')\r\n sys.exit(0)\r\nprint('Yes')\r\nfor x in range(r):\r\n print(f[x])", "def protect_sheep_action(l, i, j):\n\tactual = l[i][j]\n\tif actual == 'W':\n\t\treturn False\n\telif actual == '.':\n\t\tl[i][j] = 'D' \n\n\treturn True\n\ndef protect_sheep(l, i, j, n, m):\n\tif i > 0:\n\t\tif not protect_sheep_action(l, i-1, j):\n\t\t\treturn False\n\t\n\tif i < n-1:\n\t\tif not protect_sheep_action(l, i+1, j):\n\t\t\treturn False\n\n\tif j > 0:\n\t\tif not protect_sheep_action(l, i, j-1):\n\t\t\treturn False\n\n\tif j < m-1:\n\t\tif not protect_sheep_action(l, i, j+1):\n\t\t\treturn False\n\n\treturn True\n\t\t\nn, m = map(int, input().split())\n\nl = []\nfor i in range(n):\n\tl.append([c for c in input()])\n\nres = True\nfor i in range(n):\n\tif not res:\n\t\tbreak\n\tfor j in range(m):\n\t\tif not res:\n\t\t\tbreak\n\t\tif l[i][j] == 'S':\n\t\t\tres = protect_sheep(l, i, j, n, m)\n\nif res:\n\tprint(\"YES\")\n\tfor i in l:\n\t\tprint(''.join(i))\nelse:\n\tprint(\"NO\")\n\t \t\t\t\t \t\t \t \t\t\t \t \t \t\t\t\t", "import sys\n\ndef main():\n x,y = list(map(int, input().split()))\n arr = [\"\" for i in range(x)]\n for i in range(x):\n arr[i] = input()\n\n for i in range(x):\n for j in range(y): \n if arr[i][j] == \"W\":\n if i > 0 and arr[i-1][j] == \"S\":\n return arr, False\n if i < x-1 and arr[i+1][j] == \"S\":\n return arr, False\n if j > 0 and arr[i][j-1] == \"S\":\n return arr, False\n if j < y-1 and arr[i][j+1] == \"S\":\n return arr, False\n return arr, True\n\n\nfield, b= main()\nif b:\n print(\"Yes\")\n for row in field:\n print(row.replace(\".\",\"D\"))\nelse:\n print(\"No\")", "def A():\r\n R,C = map(int, input().split())\r\n pasture = []\r\n for _ in range(R):\r\n line = input().replace('.','D')\r\n if 'WS' in line or 'SW' in line:\r\n return False\r\n pasture.append(line)\r\n\r\n #Check columns\r\n for i in range(C):\r\n column = ''.join([l[i] for l in pasture])\r\n if 'WS' in column or 'SW' in column:\r\n return False\r\n\r\n #Here it is ok\r\n return '\\n'.join(pasture)\r\n\r\nres = A()\r\nif res:\r\n print('Yes')\r\n print(res)\r\nelse:\r\n print('No')", "from itertools import zip_longest\nR, C = map(int, input().split())\na = *map(lambda x: x.replace(\".\", \"D\", x.count(\".\")),\n (input() for i in range(R))),\nfor i, j in zip_longest(a, a[1:], fillvalue=\".\" * C):\n for x in zip_longest(i, i[1:], j, j[1:], fillvalue='.'):\n if [*\"SW\"] in (sorted((x[0], x[1])), sorted((x[2], x[3])), sorted((x[0], x[2])), sorted((x[1], x[3]))):\n print(\"NO\")\n exit()\nprint(\"YES\", *a, sep='\\n')", "r, c = map(int, input().split())\r\na = list()\r\ncount = 0\r\nfor i in range(r):\r\n\ta.append(input())\r\nfor i in range(r):\r\n\tcount+=a[i].count('W')\r\nif count==0:\r\n\tprint(\"Yes\")\r\n\tfor i in range(r):\r\n\t\tprint(a[i].replace('.','D'))\r\n\texit(0)\r\nfor i in range(r):\r\n\tif \"WS\" in a[i] or \"SW\" in a[i]:\r\n\t\tprint(\"No\")\r\n\t\texit(0)\r\nfor i in range(1, r):\r\n\tfor j in range(c):\r\n\t\tif a[i-1][j]!=a[i][j] and a[i-1][j] in [\"W\", \"S\"] and a[i][j] in [\"W\", \"S\"]:\r\n\t\t\tprint(\"No\")\r\n\t\t\texit(0)\r\nprint(\"Yes\")\r\nfor i in range(r):\r\n\tprint(a[i].replace('.','D'))", "import math\r\n\r\nr,c=map(int,input().split())\r\nf=[list(\"0\"*(c+2))]\r\n\r\nfor i in range(r):\r\n f.append(list(\"0\"+str(input())+\"0\"))\r\nf.append(list(\"0\"*(c+2)))\r\nflag=True\r\n\r\nfor y in range(1,r+1):\r\n for x in range(1,c+1):\r\n if f[y][x]==\"S\":\r\n \r\n if f[y-1][x]==\"W\":\r\n flag=False\r\n break\r\n if f[y+1][x]==\"W\":\r\n flag=False\r\n break\r\n if f[y][x-1]==\"W\":\r\n flag=False\r\n break\r\n if f[y][x+1]==\"W\":\r\n flag=False\r\n break\r\n \r\n \r\nif flag:\r\n print(\"Yes\")\r\n for i in range(1,r+1):\r\n t=f[i]\r\n for j in range(1,len(t)-1):\r\n if t[j]==\".\":\r\n print(\"D\",end=\"\")\r\n else:\r\n print(t[j],end=\"\")\r\n print()\r\nelse:\r\n print(\"No\")", "r, c = map(int, input().split())\r\na = [0] * r\r\nfor i in range(r):\r\n s = input()\r\n a[i] = []\r\n a[i] += s\r\ncan = True\r\nfor i in range(r):\r\n for j in range(c):\r\n if a[i][j] == 'S':\r\n if i > 0:\r\n if a[i - 1][j] == '.':\r\n a[i - 1][j] = 'D'\r\n elif a[i - 1][j] == 'W':\r\n can = False\r\n if i < r - 1:\r\n if a[i + 1][j] == '.':\r\n a[i + 1][j] = 'D'\r\n elif a[i + 1][j] == 'W':\r\n can = False\r\n if j > 0:\r\n if a[i][j - 1] == '.':\r\n a[i][j - 1] = 'D'\r\n elif a[i][j - 1] == 'W':\r\n can = False\r\n if j < c - 1:\r\n if a[i][j + 1] == '.':\r\n a[i][j + 1] = 'D'\r\n elif a[i][j + 1] == 'W':\r\n can = False\r\nif can:\r\n print(\"Yes\")\r\n for i in range(r):\r\n print(*a[i], sep='')\r\nelse:\r\n print(\"No\")", "from sys import stdin\r\n\r\nrd = stdin.readline\r\n\r\nr, c = map(int, rd().split())\r\nindexsh = []\r\nindexw = []\r\nstringmap = []\r\n\r\nfor _ in range(r):\r\n \r\n s = rd().strip()\r\n s = s.replace('.', 'D')\r\n\r\n if 'SW' in s or 'WS' in s:\r\n print(\"No\")\r\n break\r\n\r\n for i in range(c):\r\n if s[i] == 'S':\r\n indexsh.append((_, i))\r\n\r\n if (_ - 1, i) in indexw:\r\n \r\n print(\"No\")\r\n exit()\r\n \r\n elif s[i] == 'W':\r\n indexw.append((_, i))\r\n\r\n if (_ - 1, i) in indexsh:\r\n \r\n print(\"No\")\r\n exit()\r\n\r\n stringmap.append(s)\r\n\r\nelse:\r\n print(\"Yes\")\r\n for i in stringmap:\r\n print(i)\r\n \r\n \r\n \r\n", "r, c = map(int, input().split())\r\ng = [input() for _ in range(r)]\r\ngood = True\r\nfor i in range(r):\r\n for j in range(c):\r\n if i > 0 and {g[i][j], g[i-1][j]} == {'S','W'}:\r\n good = False\r\n if j > 0 and {g[i][j], g[i][j-1]} == {'S', 'W'}:\r\n good = False\r\nif good:\r\n print(\"Yes\")\r\n print('\\n'.join(''.join('D' if v == '.' else v for v in row) for row in g))\r\nelse:\r\n print(\"No\")", "r, c = map(int, input().split())\r\nl=[]\r\n\r\nisPossible = True\r\nfor i in range(r):\r\n s = input()\r\n m = list(map(str, s))\r\n l.append(m)\r\nfor i in range(r):\r\n for j in range(c):\r\n if(i+1!=r and l[i+1][j]!='W'):\r\n if(l[i+1][j]=='.'):\r\n l[i+1][j]='D'\r\n elif(i+1!=r and l[i][j]=='S' and l[i+1][j]=='W'):\r\n\r\n # print(i, j)\r\n isPossible = False\r\n break\r\n\r\n if(i-1>=0 and l[i-1][j]!='W'):\r\n if(l[i-1][j]=='.'):\r\n l[i-1][j]='D'\r\n elif(i-1>=0 and l[i][j]=='S' and l[i-1][j]=='W'):\r\n # print(i, j)\r\n isPossible = False\r\n break\r\n\r\n if(j+1!=c and l[i][j+1]!='W'):\r\n if(l[i][j+1]=='.'):\r\n l[i][j+1]='D'\r\n elif(j+1!=c and l[i][j]=='S' and l[i][j+1]=='W'):\r\n # print(i, j)\r\n isPossible = False\r\n break\r\n \r\n if(j-1>=0 and l[i][j-1]!='W'):\r\n if(l[i][j-1]=='.'):\r\n l[i][j-1]='D'\r\n elif(j-1>=0 and l[i][j]=='S' and l[i][j-1]=='W'):\r\n # print(i, j)\r\n isPossible = False\r\n break\r\n\r\n\r\n if(isPossible==False):\r\n break\r\nif(isPossible==False):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in l:\r\n print(\"\".join(i))", "from collections import deque\r\n\r\n\r\ndef neighbours(r, c, R, C):\r\n for rows, cols in( (r-1, c), (r, c-1), (r+1, c), (r, c+1)):\r\n if 0 <= rows < R and 0 <= cols < C:\r\n yield rows, cols\r\n\r\ndef protect_the_sheep(matrix, R, C):\r\n \"\"\"\r\n Note: Wolves can't move diagonally\r\n Sheeps and dog stay in place\r\n no wolf can enter a cell with a dog\r\n Approach: Find where all the sheep are there\r\n\r\n We need not minimize the number? -- HMMM That makes it a little simple\r\n\r\n Basic Cases: If the wolf is next to the sheep then you cannot save it.\r\n So we need to know neighbours of the sheep\r\n :param matrix:\r\n :param r:\r\n :param c:\r\n :return:\r\n \"\"\"\r\n q = deque()\r\n for i, row in enumerate(matrix):\r\n for c, val in enumerate(row):\r\n if val == 'W':\r\n q.append((i, c))\r\n #print(\"The wolf locations are:\", q)\r\n\r\n while q:\r\n i, j = q.popleft()\r\n for nei in neighbours(i, j, R, C):\r\n #print(\"The neighbours are:\", nei)\r\n nr, nc = nei\r\n if matrix[nr][nc] == 'S':\r\n print('No')\r\n exit()\r\n elif matrix[nr][nc] == '.':\r\n matrix[nr][nc] = 'D'\r\n\r\n print('Yes')\r\n for row in matrix:\r\n print(''.join(row))\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n r, c = map(int, input().split())\r\n i = 0\r\n matrix = []\r\n while i < r:\r\n rows = [c for c in input()]\r\n matrix.append(rows)\r\n i += 1\r\n #print(matrix)\r\n protect_the_sheep(matrix, r, c)", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\nr,c = ilele()\r\nA = []\r\nfor i in range(r):\r\n S = [*input()]\r\n for i in range(c):\r\n if S[i] == '.':\r\n S[i] = 'D'\r\n A.append(S)\r\nd1 = [1,0,0,-1]\r\nd2 = [0,-1,1,0]\r\nfor i in range(r):\r\n for j in range(c):\r\n if A[i][j] == 'S':\r\n for k in range(4):\r\n x1 = i + d1[k]\r\n y1 = j + d2[k]\r\n if 0 <= x1 < r and 0<= y1 < c:\r\n if A[x1][y1] == 'W':\r\n Yy(0)\r\n exit(0)\r\nYy(1)\r\nfor i in A:\r\n print(\"\".join(i))\r\n ", "R, C = map(int, input().split())\nr = []\nfor i in range(R):\n r.append(input().replace('.', 'D'))\n for j in range(C):\n if r[i][j] == 'W' and 'S' in [r[i][max(0, j - 1)],r[i][min(C - 1, j + 1)],r[i - 1][j]] or r[i][j] == 'S' and r[i - 1][j] == 'W':\n print('No')\n exit()\nprint('Yes')\nprint('\\n'.join(r))\n", "R, C = map(int, input().split())\r\nr = []\r\nf = 0\r\nfor i in range(R):\r\n r.append(input())\r\n for j in range(C):\r\n if r[i][j] == 'W':\r\n if j and r[i][j - 1] == 'S':\r\n f = 1\r\n break\r\n if j + 1 < C and r[i][j + 1] == 'S':\r\n f = 1\r\n break\r\n if f:\r\n break\r\nif not f:\r\n for i in range(C):\r\n for j in range(R):\r\n if r[j][i] == 'W':\r\n if j and r[j - 1][i] == 'S':\r\n f = 1\r\n break\r\n if j + 1 < R and r[j + 1][i] == 'S':\r\n f = 1\r\n break\r\n if f:\r\n break\r\nif f:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for i in range(R):\r\n print(r[i].replace('.','D'))\r\n\r\n", "r,c = list(map(int,input().split()))\r\n\r\ngrid = []\r\n\r\nfor i in range(r):\r\n grid.append([x for x in input()])\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j] == \".\" : grid[i][j] = \"D\"\r\n\r\nans = \"Yes\"\r\n\r\ndef valid(i,j):\r\n return i >=0 and j >=0 and i < r and j < c\r\n\r\nmasks = [(1,0),(-1,0),(0,1),(0,-1)]\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n if grid[i][j] != \"W\" : continue\r\n for a,b in masks:\r\n if valid(i+a,j+b) and grid[i+a][j+b]==\"S\": ans = \"No\"\r\n\r\nprint(ans)\r\nif ans == \"Yes\":\r\n for x in grid:\r\n print(\"\".join(x))\r\n", "r, c = map(int, input().split())\r\na = [list(input() + \".\") for i in range(r)]\r\na.append(['.'] * (c + 1))\r\nx = True\r\nfor i in range(r):\r\n for j in range(c):\r\n if a[i][j] == 'S':\r\n if a[i][j + 1] == \"W\" or a[i][j - 1] == \"W\" or a[i + 1][j] == \"W\" or a[i - 1][j] == \"W\":\r\n x = False\r\n else:\r\n if a[i][j + 1] == \".\":\r\n a[i][j + 1] = \"D\"\r\n if a[i][j - 1] == \".\":\r\n a[i][j - 1] = \"D\"\r\n if a[i + 1][j] == \".\":\r\n a[i + 1][j] = \"D\"\r\n if a[i - 1][j] == \".\":\r\n a[i - 1][j] = \"D\"\r\nif x:\r\n print(\"Yes\")\r\n for i in range(r):\r\n for j in range(c):\r\n print(a[i][j], end=\"\")\r\n print()\r\nelse:\r\n print(\"No\")", "r, c = map(int, input().split())\r\nans = \"\"\r\npasture = []\r\nflag = 0\r\nfor _ in range(r):\r\n row = list(str(input()))\r\n pasture.append(row)\r\nfor i in range (r):\r\n for j in range(c):\r\n if(pasture[i][j] == \"S\"):\r\n if(i>0):\r\n if(pasture[i-1][j] == \"W\"):\r\n flag = 1\r\n break\r\n elif(pasture[i-1][j] == \".\"):\r\n pasture[i-1][j] = \"D\"\r\n if(i<r-1):\r\n if(pasture[i+1][j] == \"W\"):\r\n flag = 1\r\n break\r\n elif(pasture[i+1][j] == \".\"):\r\n pasture[i+1][j] = \"D\"\r\n if(j>0):\r\n if(pasture[i][j-1] == \"W\"):\r\n flag = 1\r\n break\r\n elif(pasture[i][j-1] == \".\"):\r\n pasture[i][j-1] = \"D\"\r\n if(j<c-1):\r\n if(pasture[i][j+1] == \"W\"):\r\n flag = 1\r\n break\r\n elif(pasture[i][j+1] == \".\"):\r\n pasture[i][j+1] = \"D\"\r\n\r\n# print(pasture)\r\nif flag == 0:\r\n print(\"YES\")\r\n for i in range(r):\r\n print(\"\".join(pasture[i]))\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout, setrecursionlimit\r\nimport threading\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, recursion_limit, stack_size):\r\n setrecursionlimit(recursion_limit)\r\n threading.stack_size(stack_size)\r\n return None\r\n \r\nclass SOLVE:\r\n dirx = [1, 0, -1, 0]\r\n diry = [0, 1, 0, -1]\r\n r = c = None\r\n \r\n def dfs(self, u, node, vis):\r\n x, y = u\r\n vis[x][y] = True\r\n for i in range(4):\r\n tmpx = x + self.dirx[i]\r\n tmpy = y + self.diry[i]\r\n if 0<=tmpx<self.r and 0<=tmpy<self.c and not vis[tmpx][tmpy]:\r\n if node[tmpx][tmpy] == 'S':\r\n return 1\r\n elif node[tmpx][tmpy] != 'D':\r\n self.dfs((tmpx, tmpy), node, vis)\r\n return 0\r\n \r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n ans = ['Yes', '\\n']\r\n \r\n self.r, self.c = [int(x) for x in R().split()]\r\n \r\n node = []\r\n for i in range(self.r):\r\n node.append(R())\r\n node[i] = node[i].replace('.', 'D')\r\n ans += node[i]\r\n\r\n wolf = []\r\n for i in range(self.r):\r\n for j in range(self.c):\r\n if node[i][j] == 'W':\r\n wolf.append((i, j))\r\n \r\n vis = [[False for j in range(self.c)] for i in range(self.r)]\r\n for i in range(len(wolf)):\r\n if self.dfs(wolf[i], node, vis):\r\n W('No\\n')\r\n return 0\r\n \r\n W(''.join(ans))\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\nTail_Recursion_Optimization(10**7, 2**24)\r\nthreading.Thread(target=main).start()", "def main():\n R, C = map(int, input().split())\n RC = tuple(input() for _ in [0] * R)\n\n cells = ['#' * (C + 2) for _ in [0] * (R + 2)]\n for i, j in enumerate(RC):\n cells[i+1] = '#' + j + '#'\n\n for i in range(1, R + 1):\n for j in range(1, C + 1):\n if cells[i][j] == 'S':\n if any((cells[i][j-1] == 'W', \\\n cells[i][j+1] == 'W', \\\n cells[i-1][j] == 'W', \\\n cells[i+1][j] == 'W')):\n print('No')\n return\n print('Yes')\n for s in RC:\n print(s.replace('.', 'D'))\n\nmain()\n", "def check_safety(matrix, x, y):\r\n return all([matrix[y][max(0, x - 1)] != 'W', matrix[y][min(len(matrix[y]) - 1, x + 1)] != 'W',\r\n matrix[max(0, y - 1)][x] != 'W', matrix[min(len(matrix) - 1, y + 1)][x] != 'W'])\r\n\r\n\r\ndef main():\r\n r, c = map(int, input().split())\r\n matrix = []\r\n for _ in range(r):\r\n matrix.append(input())\r\n\r\n for y in range(len(matrix)):\r\n for x in range(len(matrix[y])):\r\n if matrix[y][x] == 'S':\r\n if not check_safety(matrix, x, y):\r\n print('No')\r\n return\r\n\r\n matrix = list(map(lambda x: x.replace('.', 'D'), matrix))\r\n print('Yes')\r\n for row in matrix:\r\n print(row)\r\n\r\n\r\nmain()\r\n", "r, c = map(int, input().split())\n\nmatrix = [input() for xxx in range(r)]\nnatrix = [list(zz) for zz in matrix]\na = 0\nfor x in range(r):\n for y in range(c):\n if matrix[x][y] == 'S':\n if y < c - 1:\n if matrix[x][y + 1] == 'W':\n print('No')\n a = 1\n break\n if y >= 1:\n if matrix[x][y - 1] == 'W':\n print('No')\n a = 1\n break\n if x >= 1:\n if matrix[x - 1][y] == 'W':\n print('No')\n a = 1\n break\n if x < r - 1:\n if matrix[x + 1][y] == 'W':\n print('No')\n a = 1\n break\n elif matrix[x][y] != 'W':\n natrix[x][y] = 'D'\n if a:\n break\nelse:\n print('Yes')\n for x in natrix:\n print(''.join(x))\n", "r,c=map(int,input().split())\r\narr=[]\r\nflag=0\r\nfor i in range(r):\r\n s=input()\r\n if \"SW\" in s or \"WS\" in s:flag=1\r\n if i!=0:\r\n for x,y in zip(arr[-1],s):\r\n if x==\"W\" and y==\"S\" or x==\"S\" and y==\"W\" :flag=1\r\n arr.append(s)\r\nif flag:print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in arr:\r\n for j in i:\r\n if j==\".\":print(\"D\",end=\"\")\r\n else:print(j,end=\"\")\r\n print()", "rc = input()\nrc = rc.split(\" \")\n\nr = int(rc[0])\nc = int(rc[1])\n\ndef ISWW(n,i,j):\n if i-1 >= 0 and n[i-1][j] == \"S\":\n return True\n if j+1 < c and n[i][j+1] == \"S\":\n return True\n if i+1 < r and n[i+1][j] == \"S\":\n return True\n if j-1 >= 0 and n[i][j-1] == \"S\":\n return True\n return False\ndef Protect_Sheep(n):\n for i in range(0,r):\n for j in range(0,c):\n if n[i][j] == \"W\":\n if ISWW(n,i,j) == True:\n print(\"No\")\n return \n else:\n if i-1 >= 0 and n[i-1][j] == \".\":\n n[i-1][j] = \"D\"\n if j+1 < c and n[i][j+1] == \".\":\n n[i][j+1] = \"D\"\n if i+1 < r and n[i+1][j] == \".\":\n n[i+1][j] = \"D\"\n if j-1 >= 0 and n[i][j-1] == \".\":\n n[i][j-1] = \"D\"\n print(\"Yes\")\n for i in range(0,r):\n for j in range(0,c):\n print(n[i][j], end = \"\")\n print(\"\")\n return\n\nn = []\nfor i in range(0,r):\n q = input(\"\")\n n.append(list(q))\n\nProtect_Sheep(n)", "# Protect Sheep\r\nr,c = list(map(int, input().split()))\r\narr = [\"D\"*(c+2)]\r\nfor i in range(r):\r\n temp = input()\r\n temp = \"D\"+temp+\"D\"\r\n arr.append(temp.replace(\".\", \"D\"))\r\narr.append(\"D\"*(c+2))\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n if arr[i][j] == \"S\":\r\n if arr[i+1][j] == \"W\" or arr[i-1][j] == \"W\" or arr[i][j+1] == \"W\" or arr[i][j-1] == \"W\":\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in range(1,r+1):\r\n print(arr[i][1:c+1])", "r, c = map(int,input().split())\r\nli = [list(input()) for i in range(r)]\r\nrow, column = 0, 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if li[i][j] == \"S\":\r\n if i > 0 and li[i-1][j]==\"W\":\r\n print(\"No\")\r\n exit(0)\r\n else:\r\n if i > 0 and li[i-1][j] != \"S\" :\r\n li[i-1][j] = \"D\"\r\n\r\n if i < r-1 and li[i+1][j]==\"W\":\r\n print(\"No\")\r\n exit(0)\r\n else:\r\n if i < r-1 and li[i + 1][j] != \"S\":\r\n li[i+1][j] = \"D\"\r\n\r\n if j > 0 and li[i][j-1]==\"W\":\r\n print(\"No\")\r\n exit(0)\r\n else:\r\n if j > 0 and li[i][j-1] != \"S\":\r\n li[i][j-1] = \"D\"\r\n\r\n if j < c-1 and li[i][j+1]==\"W\":\r\n print(\"No\")\r\n exit(0)\r\n else:\r\n if j < c-1 and li[i][j+1] != \"S\":\r\n li[i][j+1] = \"D\"\r\n\r\n\r\nprint(\"Yes\")\r\nfor i in li:\r\n print(\"\".join(i))\r\n\r\n", "i, j = input().split()\ni = int(i)\nj = int(j)\n\ngrid = [input() for _ in range(i)]\ncan_protect = True\n\nfor x in range(i):\n if \"SW\" in grid[x] or \"WS\" in grid[x]:\n print(\"No\")\n exit()\n\n if x != i - 1:\n for y in range(j):\n al = f\"{grid[x][y]}{grid[x + 1][y]}\"\n if \"SW\" in al or \"WS\" in al:\n print(\"No\")\n exit()\n\nprint(\"Yes\")\n# If there are multiple solutions, you may print any of them. You don't have to minimize the number of dogs.\n# Substitui tudo por cachorro\nfor x in range(i):\n print(\"\".join(grid[x].replace(\".\", \"D\")))\n\n\n# 6 6\n# ..S...\n# ..S.W.\n# .S....\n# ..W...\n# ...W..\n# ......\n\n \t\t \t \t \t \t \t \t \t \t", "R,C=map(int,input().split())\nr = 'Yes'\nentry=''\nfor i in range(R):\n string = input()\n if 'SW' in string or 'WS' in string:\n r='No'\n entry+=string\n\nif 'W' in entry and r!='No':\n for i in range(R*C):\n if entry[i]=='S':\n if i+C < len(entry):\n if entry[i+C]=='W':\n r = 'No'\n break\n if i-C >= 0:\n if entry[i-C]=='W':\n r = 'No'\n break\nif r =='No':\n print('No')\nelse:\n print('Yes')\n newEntry = entry.replace('.', 'D')\n [print(newEntry[i:i+C]) for i in range(0, len(newEntry), C)]\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\nl = [['r' for i in range(m + 2)]]\r\nfor i in range(n):\r\n l.append('r' + input() + 'r')\r\nl.append(['r' for i in range(m + 2)])\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if l[i][j] == 'W' and (\r\n l[i + 1][j] == 'S' or\r\n l[i - 1][j] == 'S' or\r\n l[i][j + 1] == 'S' or\r\n l[i][j - 1] == 'S'\r\n ):\r\n print('NO')\r\n exit(0)\r\nprint('Yes')\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if l[i][j] == '.':\r\n print('D', end='')\r\n else:\r\n print(l[i][j], end='')\r\n print()\r\n", "dr = [0,0,-1,1]\r\ndc = [-1,1,0,0]\r\nmaxx = 501\r\nclass Cell:\r\n def __init__(self,r,c):\r\n self.c = c\r\n self.r = r\r\nif __name__ == '__main__':\r\n matrix = [] * maxx\r\n flag = True\r\n m, n = map(int, input().split())\r\n for i in range(m):\r\n tmp = list(input())\r\n matrix.append(tmp)\r\n for i in range(m):\r\n for j in range(n):\r\n if matrix[i][j] == 'S':\r\n for h in range(4):\r\n v = Cell(i + dr[h], j + dc[h])\r\n if v.r in range(0,m) and v.c in range(0,n):\r\n if matrix[v.r][v.c] == 'W':\r\n flag = False\r\n break\r\n else:\r\n if matrix[v.r][v.c] == '.':\r\n matrix[v.r][v.c] = 'D'\r\n if flag:\r\n print('Yes')\r\n for i in range(m):\r\n for j in range(n):\r\n print(matrix[i][j], end='')\r\n print()\r\n else:\r\n print('No')\r\n \r\n \r\n ", "r,c = list(map(int,input().split()))\nmp = []\nfor i in range(r):\n mp.append(input().replace('.','D'))\n \ndx = (1,-1,0,0)\ndy = (0,0,1,-1)\n \nfor i in range(r):\n for j in range(c):\n if (mp[i][j] != 'W'): continue\n for k in range(4):\n x = i + dx[k]\n y = j + dy[k]\n if x >= 0 and x < r and y >= 0 and y < c and mp[x][y] == 'S':\n print(\"No\");\n exit(0)\n \nprint(\"Yes\")\nprint(\"\\n\".join(mp))\n \t \t\t\t\t\t \t \t \t\t\t\t\t \t \t\t\t\t \t", "r,c=list(map(int,input().split()))\r\na=[]\r\nfor i in range(r):\r\n a.append(list(input()))\r\nans=\"Yes\"\r\nfor i in range(r):\r\n for j in range(c-1):\r\n if a[i][j]=='S' and a[i][j+1]=='W' or a[i][j]=='W' and a[i][j+1]=='S':\r\n ans=\"No\"\r\n break\r\nfor i in range(r-1):\r\n for j in range(c):\r\n if a[i][j]=='S' and a[i+1][j]=='W' or a[i][j]=='W' and a[i+1][j]=='S':\r\n ans=\"No\"\r\n break\r\nprint(ans)\r\nif ans==\"Yes\":\r\n for i in range(r):\r\n z=\"\"\r\n for p in a[i]:\r\n if p=='.':\r\n z+='D'\r\n else:\r\n z+=p\r\n print(z)\r\n\r\n\r\n \r\n", "a,b = map(int, input().split())\r\nanslist = [\" \"*(b+2)]\r\nfor i in range (a):\r\n\tanslist.append(\" \"+ input() + \" \")\r\nanslist.append(\" \"*(b+2))\r\nflag = 0 \r\nfor k in range (1,a+1) :\r\n\tp = anslist[k]\r\n\tq = anslist[k+1]\r\n\tr = anslist[k-1]\r\n\tfor j in range (1, b+1):\r\n\t\tif (p[j] == \"S\" and p[j-1] == \"W\") or (p[j] == \"S\" and p[j+1] == \"W\") or (p[j] == \"S\" and q[j] == \"W\") or (p[j] == \"S\" and r[j] == \"W\"):\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\tif flag == 1 :\r\n\t\tbreak\r\nif flag == 0 :\r\n\tprint(\"Yes\")\r\n\tfor i in range (1, a+1):\r\n\t\tanslist[i] = anslist[i].replace('.', 'D')\r\n\t\tprint (anslist[i][1:b+1])\r\nelse :\r\n\tprint (\"No\")", "r, c = map(int, input().split())\npasture = []\npasture.append(list('.' * (c + 2)))\nfor i in range(r):\n pasture.append(['.'] + list(input()) + ['.'])\npasture.append(list('.' * (c + 2)))\n\nadj = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n\nfor i in range(1, r + 1):\n for j in range(1, c + 1):\n if pasture[i][j] == 'S':\n if any(pasture[i + a][j + b] == 'W' for a,b in adj):\n print('No')\n exit()\n for a,b in adj:\n if pasture[i + a][j + b] == '.':\n pasture[i + a][j + b] = 'D'\n\nprint('Yes')\nprint('\\n'.join(''.join(row[1:-1]) for row in pasture[1:-1]))\n", "r, c = map(int, input().split())\r\nmatrix = []\r\nfor i in range(r):\r\n row = list(input())\r\n matrix.append(row)\r\nflag = False\r\nfor i in range(r):\r\n for j in range(c):\r\n if matrix[i][j] == \".\":\r\n matrix[i][j] = \"D\"\r\n continue\r\n if matrix[i][j] == \"S\":\r\n if (i - 1) >= 0 and matrix[i-1][j] == \"W\":\r\n flag = True\r\n if (i + 1) < r and matrix[i+1][j] == \"W\":\r\n flag = True\r\n if (j - 1) >= 0 and matrix[i][j-1] == \"W\":\r\n flag = True\r\n if (j + 1) < c and matrix[i][j+1] == \"W\":\r\n flag = True\r\nif flag: \r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")\r\n for row in matrix:\r\n print (\"\".join(row))", "from sys import stdin\nfrom collections import deque,Counter,defaultdict,OrderedDict\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport time\nimport random\nimport bisect\n\n\nr,c = map(int,input().split())\ngrid = []\nfor i in range(r):\n s = list(input())\n for x in range(len(s)):\n if s[x] == '.':\n s[x] = 'D'\n grid.append(s)\nfor i in range(0,r):\n for j in range(0,c):\n wolf = False\n if grid[i][j] == 'S':\n if j+1<c:\n if grid[i][j+1] == 'W':\n wolf = True\n if i+1<r:\n if grid[i+1][j] == 'W':\n wolf = True\n if j-1>=0:\n if grid[i][j-1] == 'W':\n wolf = True\n if i-1>=0:\n if grid[i-1][j] == 'W':\n wolf = True\n if wolf == True:\n print(\"No\")\n sys.exit()\nprint('Yes')\nfor i in grid:\n print(''.join(i))\n", "rows,cols=list(map(int,input().split()))\r\ns=[]\r\ndef can(r,c):\r\n return r>=0 and c>=0 and r<rows and c<cols\r\nfor i in range(rows):\r\n row=input()\r\n s.append(list(row))\r\n # print(grid)\r\nflag=False\r\nfor i in range(rows):\r\n for j in range(cols):\r\n if(s[i][j]=='S' and ((can(i,j+1) and s[i][j+1]=='W') or (can(i,j-1) and s[i][j-1]=='W' )or (can(i+1,j) and s[i+1][j]=='W') or (can(i-1,j) and s[i-1][j]=='W'))):\r\n flag=True\r\n break\r\n \r\n if flag:\r\n break\r\nif flag:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for i in range(rows):\r\n print(\"\".join(s[i]).replace('.','D'))\r\n\r\n", "n, m = list(map(int, input().split()))\r\n\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(input()))\r\n\r\ndirection = [[1, 0], [0, 1], [-1, 0], [0, -1]]\r\ncheck = True\r\nfor r in range(n):\r\n for c in range(m):\r\n if grid[r][c] != \".\":\r\n for x, y in direction:\r\n i, j = r + x, c + y\r\n if -1 < i < n and -1 < j < m and ((grid[r][c] == \"S\" and grid[i][j] == \"W\") or (grid[r][c] == \"W\" and grid[i][j] == \"S\")):\r\n check = False\r\n\r\n else:\r\n grid[r][c] = \"D\"\r\n \r\n\r\n\r\nif check:\r\n print(\"Yes\")\r\n for i in range(n):\r\n print(\"\".join(grid[i]))\r\nelse:\r\n print(\"NO\")", "t=1\r\nwhile t:\r\n t-=1\r\n no=False;\r\n r,c=map(int,input().split())\r\n m=[[i for i in input()] for _ in range(r)]\r\n for i in range(r):\r\n for j in range(c):\r\n if m[i][j]=='.':\r\n m[i][j]='D'\r\n for i in range(r):\r\n for j in range(c):\r\n if m[i][j]=='S':\r\n if i>0 and m[i-1][j]=='W' or i<r-1 and m[i+1][j]=='W' or j>0 and m[i][j-1]=='W' or j<c-1 and m[i][j+1]=='W':\r\n no=True\r\n if no:\r\n print('No')\r\n break\r\n print('Yes')\r\n for i in range(r):\r\n for j in range(c):\r\n print(m[i][j],end='')\r\n print()\r\n", "n, m = map(int, input().split())\r\ns = [list(input()) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == 'S':\r\n if i > 0:\r\n if s[i-1][j] == 'W':\r\n print(\"No\")\r\n exit(0)\r\n if s[i-1][j] != 'S':\r\n s[i-1][j] = 'D'\r\n if j > 0:\r\n if s[i][j-1] == 'W':\r\n print(\"No\")\r\n exit(0)\r\n if s[i][j-1] != 'S':\r\n s[i][j-1] = 'D'\r\n if i < n - 1:\r\n if s[i+1][j] == 'W':\r\n print(\"No\")\r\n exit(0)\r\n if s[i+1][j] != 'S':\r\n s[i+1][j] = 'D'\r\n if j < m - 1:\r\n if s[i][j+1] == 'W':\r\n print(\"No\")\r\n exit(0)\r\n if s[i][j+1] != 'S':\r\n s[i][j+1] = 'D'\r\nprint(\"Yes\")\r\nfor row in s:\r\n print(\"\".join(row))# 1698253546.4280646", "deslocamento = (\n ( 0, -1),\n ( 0, 1),\n ( 1, 0),\n (-1, 0)\n)\n\n\ndef possivel(novoi, novoj, r, c):\n return 0 <= novoi < r and 0 <= novoj < c\n\n\ndef solve(mapa, r, c):\n for i in range(r):\n for j in range(c):\n if mapa[i][j] == \"W\":\n for di, dj in deslocamento:\n novoi = i + di\n novoj = j + dj\n if possivel(novoi, novoj, r, c):\n if mapa[novoi][novoj] == \"S\":\n return False\n elif mapa[novoi][novoj] == \".\":\n mapa[novoi][novoj] = \"D\"\n return True\n\n\ndef main():\n r, c = [int(x) for x in input().split()]\n\n mapa = [[s for s in input()] for _ in range(r)]\n\n possivel = solve(mapa, r, c)\n\n if possivel:\n print(\"Yes\")\n for linha in mapa:\n print(*linha, sep=\"\")\n else:\n print(\"No\")\n\nif __name__ == '__main__':\n main()", "rc = list(map(int,input().split()))\r\nr = rc[0]\r\nc = rc[1]\r\n\r\npasture = []\r\nfor i in range(r):\r\n pasture.append(list(input()))\r\n\r\nfor i in range(r):\r\n for j in range(c-1):\r\n if pasture[i][j] == 'S' and pasture[i][j+1] == 'W':\r\n print(\"No\")\r\n exit()\r\n if pasture[i][j] == 'W' and pasture[i][j+1] == 'S':\r\n print(\"No\")\r\n exit()\r\n\r\nfor i in range(r-1):\r\n for j in range(c):\r\n if pasture[i][j] == 'S' and pasture[i+1][j] == 'W':\r\n print(\"No\")\r\n exit()\r\n if pasture[i][j] == 'W' and pasture[i+1][j] == 'S':\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\nfor i in range(r):\r\n for j in range(c):\r\n if pasture[i][j] == '.':\r\n print('D', end='')\r\n if pasture[i][j] == 'W':\r\n print('W', end='')\r\n if pasture[i][j] == 'S':\r\n print('S', end='')\r\n print(\"\\n\", end='')", "import sys\r\n\r\nfirstline= sys.stdin.readline().strip()\r\nR=int(firstline.split()[0])\r\nC=int(firstline.split()[1])\r\n\r\narray=[]\r\nfor line in sys.stdin:\r\n splitLine=list(line)\r\n #print(splitLine)\r\n array.append(splitLine)\r\n\r\n#print(array[0][1])\r\npossible=True\r\n\r\nfor i in range(R):\r\n for j in range(C):\r\n if array[i][j] == \"W\":\r\n #print(i , j)\r\n if i+1<R and array[i + 1][j]== '.':\r\n array[i+1][j]='D'\r\n if i+1<R and array[i + 1][j]== 'S':\r\n possible=False\r\n if j+1<C and array[i][j + 1]== '.':\r\n array[i][j+1]='D'\r\n if j+1<C and array[i][j + 1]== 'S':\r\n possible=False\r\n if i>0 and array[i-1][j]=='.':\r\n array[i-1][j]='D'\r\n if i>0 and array[i-1][j]=='S':\r\n possible=False\r\n if j>0 and array[i][j-1]=='.':\r\n array[i][j-1] = 'D'\r\n if j>0 and array[i][j-1]=='S':\r\n #print(i,j)\r\n possible=False\r\n # pass\r\nif possible==True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\nif possible==True:\r\n for line in array:\r\n result = ''.join(item for item in line)\r\n print(result, end='')", "def checkProtection(r, c, arr):\r\n for i in range(r):\r\n for j in range(c):\r\n if arr[i][j] == 'S':\r\n for x, y in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\r\n if 0 <= x < r and 0 <= y < c:\r\n if arr[x][y] == 'W': return False\r\n return True\r\n\r\ndef putDoggys(r, c, arr):\r\n for i in range(r):\r\n for j in range(c):\r\n if arr[i][j] == 'W':\r\n for x, y in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\r\n if 0 <= x < r and 0 <= y < c:\r\n if arr[x][y] == '.': arr[x][y] = 'D'\r\n\r\ndef solve():\r\n r, c = map(int, input().split())\r\n arr = [list(input()) for _ in range(r)]\r\n if checkProtection(r, c, arr):\r\n print(\"Yes\")\r\n putDoggys(r, c, arr)\r\n for row in arr:\r\n print(''.join(row))\r\n else:\r\n print(\"No\")\r\n\r\nsolve()", "rows, columns = map(int, input().split())\narr = []\nfor _ in range(rows):\n line = list(input().strip())\n for index, char in enumerate(line):\n if char == \".\":\n line[index] = \"D\"\n arr.append(line)\n\nresult = True\nbreaker = False\nfor r in range(rows):\n for c in range(columns):\n if arr[r][c] == \"S\":\n coords = ((-1,0),(1,0),(0,-1),(0,1))\n for coord in coords:\n newr = r+coord[0]\n newc = c+coord[1]\n if newr >= rows or newr < 0:\n continue\n if newc >= columns or newc < 0:\n continue\n if arr[newr][newc] == \"W\":\n result = False\n breaker = True\n break\n if breaker:\n break\n if breaker:\n break\n \nif result:\n print(\"Yes\")\n for line in arr:\n for char in line:\n print(char, end=\"\")\n print()\nelse:\n print(\"No\")\n\n\t \t \t \t \t\t\t\t \t\t\t\t\t\t\t\t", "rows, cols = [int(x) for x in input().split(\" \")]\r\nboard = []\r\nfor row in range(rows):\r\n\tboard.append([\"D\" if s == \".\" else s for s in input()])\r\n\r\ndef solve(rows, cols, board):\r\n\tfor r in range(rows):\r\n\t\tfor c in range(cols):\r\n\t\t\tif board[r][c] == 'W':\r\n\t\t\t\tif r+1 < rows and board[r+1][c] == 'S':\r\n\t\t\t\t\tprint(\"No\")\r\n\t\t\t\t\treturn False\r\n\t\t\t\tif r - 1 >= 0 and board[r-1][c] == 'S':\r\n\t\t\t\t\tprint(\"No\")\r\n\t\t\t\t\treturn False\r\n\t\t\t\tif c+1 < cols and board[r][c+1] == 'S':\r\n\t\t\t\t\tprint(\"No\") \r\n\t\t\t\t\treturn False\r\n\t\t\t\tif c - 1 >= 0 and board[r][c-1] == 'S':\r\n\t\t\t\t\tprint(\"No\")\r\n\t\t\t\t\treturn False\r\n\treturn True\r\n\r\nif solve(rows, cols, board):\r\n\tprint(\"Yes\")\r\n\tfor row in board:\r\n\t\tprint(\"\".join(row))", "r,c = map(int,input().split())\r\nfield = []\r\nfor i in range(r):\r\n field.append(list(input()))\r\nworlf = 0\r\ndie =0\r\ndirection = [(-1,0),(1,0),(0,-1),(0,1)]\r\nfor i in range(r):\r\n if die:\r\n break\r\n for j in range(c):\r\n if field[i][j] == 'S':\r\n left = j-1\r\n if left>-1:\r\n if field[i][left] == '.':\r\n field[i][left] = 'D'\r\n elif field[i][left] == 'W':\r\n die = 1\r\n break\r\n right = j+1\r\n if right<c:\r\n if field[i][right] == '.':\r\n field[i][right] = 'D'\r\n elif field[i][right] == 'W':\r\n die = 1\r\n break\r\n up = i-1\r\n if up>-1:\r\n if field[up][j] == '.':\r\n field[up][j] = 'D'\r\n elif field[up][j] == 'W':\r\n die = 1\r\n break\r\n down = i+1\r\n if down<r:\r\n if field[down][j] == '.':\r\n field[down][j] = 'D'\r\n elif field[down][j] == 'W':\r\n die = 1\r\n break\r\n elif field[i][j] == 'W':\r\n worlf+=1\r\nprint('No' if die else 'Yes')\r\nif not die:\r\n for i in range(r):\r\n print(''.join(field[i]))", "r, c = map(int, input().split())\ng = []\nfor i in range(r):\n g.append(list(input()))\nok = True\ndx = [0, 0, -1, 1]\ndy = [1, -1, 0, 0]\nfor i in range(r):\n for j in range(c):\n if g[i][j] == 'S':\n for k in range(4):\n x = i + dx[k]\n y = j + dy[k]\n if x >= 0 and x < r and y >= 0 and y < c:\n if g[x][y] == 'W':\n ok = False\n elif g[x][y] == '.':\n g[x][y] = 'D'\nif ok:\n print(\"Yes\")\n for i in range(r):\n print(''.join(g[i]))\nelse:\n print(\"No\")\n", "r,c=map(int,input().split())\r\nk=[]\r\nk.append(\"0\"*(c+2))\r\nfor i in range(r):\r\n k.append(input())\r\n k[i+1]=k[i+1].replace(\".\",\"D\")\r\n k[i+1]=\"0\"+k[i+1]+\"0\"\r\nk.append(\"0\"*(c+2))\r\nm=True\r\nfor i in range(1,len(k)-1):\r\n for j in range(1,c+1):\r\n if k[i][j]==\"W\" and (k[i-1][j]==\"S\" or k[i+1][j]==\"S\" or k[i][j-1]==\"S\" or k[i][j+1]==\"S\"):\r\n m=False\r\n print(\"No\")\r\n break\r\n if not m:\r\n break\r\nif m:\r\n print(\"Yes\")\r\n for i in range(1,len(k)-1):\r\n print(k[i][1:c+1])\r\n \r\n \r\n", "def issafe(x,y,r,c):\r\n if x>=0 and y>=0 and x<r and y<c:\r\n return True\r\n return False\r\n\r\nr,c = list(map(int,input().split()))\r\nmatix = []\r\nfor _ in range(r):\r\n dd = list(input())\r\n matix.append(dd)\r\nqueue = []\r\nnhi = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n if matix[i][j] == 'S':\r\n queue.append((i,j))\r\n\r\nvisited = set()\r\nwhile queue:\r\n x,y = queue.pop()\r\n for m,n in [(-1,0),(0,-1),(1,0),(0,1)]:\r\n nex = x+m\r\n ney = y+n\r\n if issafe(nex,ney,r,c) and (nex,ney) not in visited: \r\n if matix[nex][ney]=='S':\r\n queue.append((nex,ney))\r\n elif matix[nex][ney] == '.':\r\n matix[nex][ney] = 'D'\r\n elif matix[nex][ney] == 'W':\r\n nhi = 1\r\n break\r\n visited.add((nex,ney))\r\nif nhi == 1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for kk in range(r):\r\n print(\"\".join(matix[kk]))", "r, c = map(int, input().split())\r\nls = [[c for c in input()] for i in range(r)]\r\nfor i in range(r):\r\n dead = False\r\n for j in range(c):\r\n if ls[i][j] == 'W':\r\n if i != 0 and ls[i - 1][j] == 'S': dead = True\r\n if i != r - 1 and ls[i + 1][j] == 'S': dead = True\r\n if j != 0 and ls[i][j - 1] == 'S': dead = True\r\n if j != c - 1 and ls[i][j + 1] == 'S': dead = True\r\n if dead: \r\n break\r\n elif ls[i][j] == '.':\r\n ls[i][j] = 'D'\r\n if dead:\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")\r\n for i in range(r):\r\n print(''.join(ls[i]))\r\n\r\n", "n, m = map(int, input().split())\r\nfield = [list(input()) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if field[i][j] == \"S\":\r\n if i > 0 and field[i - 1][j] == \"W\":\r\n print(\"NO\")\r\n exit(0)\r\n if j > 0 and field[i][j - 1] == \"W\":\r\n print(\"NO\")\r\n exit(0)\r\n if i < n - 1 and field[i + 1][j] == \"W\":\r\n print(\"NO\")\r\n exit(0)\r\n if j < m - 1 and field[i][j + 1] == \"W\":\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\nfor l in field:\r\n for i in range(m):\r\n if l[i] == \".\":\r\n l[i] = \"D\"\r\n print(*l, sep=\"\")\r\n", "class CodeforcesTask948ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.pasture_dims = []\r\n self.pasture = []\r\n\r\n def read_input(self):\r\n self.pasture_dims = [int(x) for x in input().split(\" \")]\r\n for x in range(self.pasture_dims[0]):\r\n self.pasture.append(list(input()))\r\n\r\n def process_task(self):\r\n can = True\r\n for r in range(self.pasture_dims[0]):\r\n for c in range(self.pasture_dims[1]):\r\n if self.pasture[r][c] == \"S\":\r\n if r > 0:\r\n if self.pasture[r - 1][c] == \"W\":\r\n can = False\r\n elif self.pasture[r - 1][c] == \".\":\r\n self.pasture[r - 1][c] = \"D\"\r\n if r < self.pasture_dims[0] - 1:\r\n if self.pasture[r + 1][c] == \"W\":\r\n can = False\r\n elif self.pasture[r + 1][c] == \".\":\r\n self.pasture[r + 1][c] = \"D\"\r\n if c > 0:\r\n if self.pasture[r][c - 1] == \"W\":\r\n can = False\r\n elif self.pasture[r][c - 1] == \".\":\r\n self.pasture[r][c - 1] = \"D\"\r\n if c < self.pasture_dims[1] - 1:\r\n if self.pasture[r][c + 1] == \"W\":\r\n can = False\r\n elif self.pasture[r][c + 1] == \".\":\r\n self.pasture[r][c + 1] = \"D\"\r\n if not can:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n for row in self.pasture:\r\n print(\"\".join(row))\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask948ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n, m = map(int,input().split())\r\nmatriz = []\r\nfor i in range(n):\r\n matriz.append(list(input()))\r\nlobo = False\r\nfor i in range(n):\r\n for j in range(m):\r\n \tif(matriz[i][j] == '.'):\r\n \t\tmatriz[i][j] = 'D'\r\nfor i in range(n):\r\n for j in range(m):\r\n if (matriz[i][j] == 'S'):\r\n if (i + 1 < n): #Cima\r\n if (matriz[i+1][j] == 'W'):\r\n lobo = True\r\n break\r\n\r\n if (i - 1 >= 0): #Baixo\r\n if (matriz[i-1][j] == 'W'):\r\n lobo = True\r\n break\r\n\r\n if (j + 1 < m): #Direita\r\n if (matriz[i][j+1] == 'W'):\r\n lobo = True\r\n break\r\n\r\n if (j - 1 >= 0): #Esquerda\r\n if (matriz[i][j-1] == 'W'):\r\n lobo = True\r\n break\r\n \r\n if lobo == True:\r\n break\r\n \r\nif lobo == True:\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')\r\n \r\n\tfor i in range(n):\r\n\t\tlinha = \"\"\r\n\t\tfor j in range(m):\r\n\t\t \tlinha += matriz[i][j]\r\n\t\tprint(linha)", "r,c = map(int,input().split())\r\npasture = []\r\nres = \"\"\r\nfor _ in range(r):\r\n linha = input()\r\n if('WS' in linha or 'SW' in linha):\r\n res = \"No\"\r\n else:\r\n pasture.append(linha)\r\n\r\nif(res == \"No\"):\r\n print(\"No\")\r\nelse:\r\n spos = []\r\n wpos = []\r\n for j in range(len(pasture)):\r\n if(j == 0):\r\n for i in range(len(pasture[j])):\r\n if(pasture[j][i] == 'S'):\r\n spos.append((j + 1,i))\r\n elif(pasture[j][i] == 'W'):\r\n wpos.append((j,i))\r\n elif(j == r-1):\r\n for i in range(len(pasture[j])):\r\n if(pasture[j][i] == 'S'):\r\n spos.append((j-1,i))\r\n elif(pasture[j][i] == 'W'):\r\n wpos.append((j,i))\r\n else:\r\n for i in range(len(pasture[j])):\r\n if(pasture[j][i] == 'S'):\r\n spos.append((j-1,i))\r\n spos.append((j+1,i))\r\n elif(pasture[j][i] == 'W'):\r\n wpos.append((j,i))\r\n \r\n for pos in wpos:\r\n if pos in spos:\r\n res = \"No\"\r\n break\r\n \r\n if(res == \"No\"):\r\n print(res)\r\n else:\r\n print(\"Yes\")\r\n for row in pasture:\r\n new_row = row.replace('.','D')\r\n print(new_row)\r\n\r\n", "# Link to problem : https://codeforces.com/problemset/problem/948/A\n\n# There is one case in which we cannot save the sheep which is SW\n# In above case sheep and wolf are adjacent to each other and we cannot place a dog in between them\n# But in all other case we can place a dog at '.' places\n\nr,c = map(int, input().split())\ngrid = []\nfor i in range(r):\n l = list(input())\n grid.append(l)\n\ndef check(i, j, grid):\n if i > 0:\n if grid[i][j] == 'S' and grid[i - 1][j] == 'W':\n return 'NO'\n if grid[i][j] == 'S' and grid[i - 1][j] == '.':\n grid[i - 1][j] = 'D'\n if i < len(grid) - 1:\n if grid[i][j] == 'S' and grid[i + 1][j] == 'W':\n return 'NO'\n if grid[i][j] == 'S' and grid[i + 1][j] == '.':\n grid[i + 1][j] = 'D'\n if j > 0:\n if grid[i][j] == 'S' and grid[i][j - 1] == 'W':\n return 'NO'\n if grid[i][j] == 'S' and grid[i][j - 1] == '.':\n grid[i][j - 1] = 'D'\n if j < len(grid[0]) - 1:\n if grid[i][j] == 'S' and grid[i][j + 1] == 'W':\n return 'NO'\n if grid[i][j] == 'S' and grid[i][j + 1] == '.':\n grid[i][j + 1] = 'D'\n return ''\n \n\ndef main():\n for i in range(len(grid)):\n for j in range(len(grid[0])):\n if check(i, j, grid) == 'NO':\n print('No')\n return\n print('Yes')\n for i in range(len(grid)):\n print(''.join(grid[i]))\n \nif __name__ == \"__main__\":\n main()", "n, m = map(int, input().split())\r\na = [input().replace('.', 'D') for _ in range(n)]\r\nflag = True\r\nfor i in range(n):\r\n for j in range(m):\r\n if i>0 and {a[i][j], a[i-1][j]} == {'S', 'W'}:\r\n flag = False\r\n if j>0 and {a[i][j], a[i][j-1]} == {'S', 'W'}:\r\n flag = False\r\nif flag:\r\n print('Yes')\r\n print('\\n'.join(a))\r\nelse:\r\n print('No')", "from sys import stdin\nfrom collections import deque,Counter,defaultdict,OrderedDict\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport time\nimport random\nimport bisect\n\n\nr,c = map(int,input().split())\ngrid = []\nfor i in range(r):\n s = list(input())\n for x in range(len(s)):\n if s[x] == '.':\n s[x] = 'D'\n grid.append(s)\n\nfor i in range(0,r):\n for j in range(0,c):\n wolf = False\n if grid[i][j] == 'S':\n if 'W' in [grid[i][min(j+1,c-1)],grid[i][max(0,j-1)],grid[max(0,i-1)][j],\\\n grid[min(r-1,i+1)][j]]:\n print(\"No\")\n sys.exit()\nprint('Yes')\nfor i in grid:\n print(''.join(i))\n", "def solve():\r\n row, col = map(int, input().split())\r\n grid = []\r\n for i in range(row):\r\n grid.append(list(input()))\r\n for i in range(row):\r\n for j in range(col):\r\n if grid[i][j] == \"W\":\r\n # up\r\n if 0 <= i-1:\r\n if grid[i-1][j] == \".\":\r\n grid[i-1][j] = \"D\"\r\n elif grid[i-1][j] == \"S\":\r\n print(\"No\")\r\n return\r\n # down\r\n if i+1 < row:\r\n if grid[i+1][j] == \".\":\r\n grid[i+1][j] = \"D\"\r\n elif grid[i+1][j] == \"S\":\r\n print(\"No\")\r\n return\r\n # left\r\n if 0 <= j-1:\r\n if grid[i][j-1] == \".\":\r\n grid[i][j-1] = \"D\"\r\n elif grid[i][j-1] == \"S\":\r\n print(\"No\")\r\n return\r\n # right\r\n if j+1 < col:\r\n if grid[i][j+1] == \".\":\r\n grid[i][j+1] = \"D\"\r\n elif grid[i][j+1] == \"S\":\r\n print(\"No\")\r\n return\r\n print(\"Yes\")\r\n for i in grid:\r\n print(\"\".join(i))\r\n return\r\n\r\nt = 1\r\nwhile t != 0:\r\n res = solve()\r\n # print(res)\r\n t -= 1\r\n", "R,C = list(map(int , input().split()))\r\nprev = input().replace('.', 'D')\r\n\r\nres = [prev]\r\nfor cnt in range(C-1):\r\n if (prev[cnt] == 'W' and prev[cnt+1] == 'S') or (prev[cnt] == 'S' and prev[cnt+1] == 'W'):\r\n print('No')\r\n exit(0)\r\nfor row in range(R-1):\r\n cur = input().replace('.', 'D')\r\n res.append(cur)\r\n if C==1 :\r\n if (prev[0] == 'W' and cur[0] == 'S') or (prev[0] == 'S' and cur[0] == 'W'):\r\n print('No')\r\n exit(0)\r\n\r\n for cnt in range(C-1):\r\n if (cur[cnt] == 'W' and cur[cnt+1] == 'S') or (cur[cnt] == 'S' and cur[cnt+1] == 'W'):\r\n print('No')\r\n exit(0)\r\n\r\n\r\n for cnt in range(C):\r\n if (prev[cnt] == 'W' and cur[cnt] == 'S') or (prev[cnt] == 'S' and cur[cnt] == 'W'):\r\n print('No')\r\n exit(0)\r\n\r\n prev = cur\r\n\r\nprint('Yes')\r\nfor c in res:\r\n print(c)\r\n\r\n", "r,c=map(int,input().strip().split())\nm = [list(input()) for i in range(r)]\npossible=True\nfor i in range(r):\n\tfor j in range(c):\n\t\tif m[i][j]=='W':\n\t\t\tif i-1>=0:\n\t\t\t\tif m[i-1][j]=='S':\n\t\t\t\t\tpossible=False\n\t\t\t\telif m[i-1][j]=='.':\n\t\t\t\t\tm[i-1][j]='D'\n\t\t\tif j-1>=0:\n\t\t\t\tif m[i][j-1]=='S':\n\t\t\t\t\tpossible=False\n\t\t\t\telif m[i][j-1]=='.':\n\t\t\t\t\tm[i][j-1]='D'\n\t\t\tif i+1<r:\n\t\t\t\tif m[i+1][j]=='S':\n\t\t\t\t\tpossible=False\n\t\t\t\telif m[i+1][j]=='.':\n\t\t\t\t\tm[i+1][j]='D'\n\t\t\tif j+1<c:\n\t\t\t\tif m[i][j+1]=='S':\n\t\t\t\t\tpossible=False\n\t\t\t\telif m[i][j+1]=='.':\n\t\t\t\t\tm[i][j+1]='D'\n\tif not possible:\n\t\tbreak;\nif possible:\n\tprint(\"Yes\")\n\tfor i in range(r):\n\t\tfor j in range(c):\n\t\t\tprint(m[i][j],end='')\n\t\tprint()\nelse:\n\tprint(\"No\")\n \t\t\t \t\t \t\t\t \t \t\t \t\t\t \t\t", "r,c=map(int,input().split())\r\np=[input()+'.'for _ in[0]*r]+['.'*(c+1)]\r\nf=0\r\nfor i in range(r):\r\n for j in range(c):\r\n t=p[i][j+1],p[i+1][j]\r\n s=p[i][j]\r\n if (s=='S'and'W'in t or s=='W'and'S'in t):f=1\r\nif f:print('No')\r\nelse:\r\n print('Yes')\r\n for s in p[:r]:print(s[:c].replace('.', 'D'))", "\r\narr = []\r\nr,c = map(int,input().split())\r\ndef inside(i,j):\r\n return 0<=i<len(arr) and 0<=j<len(arr[0])\r\nfor _ in range(r):\r\n arr.append(list(input()))\r\nstate = True\r\ndirr = [(0,1),(0,-1),(1,0),(-1,0)]\r\nfor i in range(len(arr)):\r\n for j in range(len(arr[i])):\r\n if arr[i][j] == 'S':\r\n for d in dirr:\r\n newi,newj = i+d[0],j+d[1]\r\n if inside(newi,newj):\r\n if arr[newi][newj] == 'W':\r\n state = False\r\n break\r\n elif arr[newi][newj] !='S':\r\n arr[newi][newj] = 'D'\r\nif state:\r\n print('yes')\r\n for s in arr:\r\n print(''.join(s))\r\nelse:\r\n print('no')\r\n \r\n \r\n ", "R,C=map(int,input().split())\r\nFld=[]\r\nfor r in range(R):\r\n l=list(str(input()))\r\n Fld.append(l)\r\n \r\nwolf=0\r\nflag=0\r\nfor i in range(R):\r\n for j in range(C):\r\n if((j!=0) and Fld[i][j]=='S' and Fld[i][j-1]=='W'):\r\n wolf+=1\r\n \r\n if((j!=C-1) and Fld[i][j]=='S' and Fld[i][j+1]=='W'):\r\n wolf+=1\r\n \r\n if((i!=0) and Fld[i][j]=='S' and Fld[i-1][j]=='W'):\r\n wolf+=1\r\n \r\n if((i!=R-1) and Fld[i][j]=='S' and Fld[i+1][j]=='W'):\r\n wolf+=1\r\n \r\n if(wolf>0):\r\n flag=1\r\n break\r\n\r\n if(flag==1):\r\n break\r\n\r\nif(flag==1):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n for i in range(R):\r\n for j in range(C):\r\n if(Fld[i][j]=='.'):\r\n print(\"D\",end=\"\")\r\n\r\n else:\r\n print(Fld[i][j],end=\"\")\r\n print()\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n ", "r, c = map(int, input().split())\na = [[] for i in range(r)]\nfor i in range(r):\n a[i] = list(input())\nfor row in range(r):\n for col in range(c):\n if a[row][col] == \"S\":\n if row > 0:\n if a[row-1][col] == \"W\":\n print(\"No\")\n exit()\n if row < r-1:\n if a[row+1][col] == \"W\":\n print(\"No\")\n exit()\n if col > 0:\n if a[row][col-1] == \"W\":\n print(\"No\")\n exit()\n if col < c-1:\n if a[row][col+1] == \"W\":\n print(\"No\")\n exit()\nprint(\"Yes\")\nfor row in range(r):\n for col in range(c):\n if a[row][col] == \"S\":\n if row > 0:\n a[row-1][col] = \"D\" if a[row-1][col] == \".\" else a[row-1][col] \n if row < r-1:\n a[row+1][col] = \"D\" if a[row+1][col] == \".\" else a[row+1][col]\n if col > 0:\n a[row][col-1] = \"D\" if a[row][col-1] == \".\" else a[row][col-1]\n if col < c-1:\n a[row][col+1] = \"D\" if a[row][col+1] == \".\" else a[row][col+1]\nfor row in range(r):\n print(\"\".join(a[row]))", "n,m = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\nt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'S':\r\n if (i > 0):\r\n if a[i-1][j] == 'W':\r\n t = 1\r\n break\r\n elif a[i-1][j] == '.':\r\n a[i-1][j] = 'D'\r\n if (j < m-1):\r\n if a[i][j+1] == 'W':\r\n t = 1\r\n break\r\n elif a[i][j+1] == '.':\r\n a[i][j+1] = 'D'\r\n if (i < n-1):\r\n if a[i+1][j] == 'W':\r\n t = 1\r\n break\r\n elif a[i+1][j] == '.':\r\n a[i+1][j] = 'D'\r\n if (j > 0):\r\n if a[i][j-1] == 'W':\r\n t = 1\r\n break\r\n elif a[i][j-1] == '.':\r\n a[i][j-1] = 'D'\r\nif t == 1:print('No')\r\nelse:\r\n print('Yes')\r\n for i in a:\r\n for j in i:\r\n print(j,end ='')\r\n print()\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,a,b=f()\r\nl=il()\r\nsm=sum(l)\r\nk=l.pop(0)\r\nc=0\r\nl.sort(reverse=True)\r\nfor i in range(0,n-1):\r\n if (k*a)/sm<b:\r\n c+=1\r\n sm-=l[i]\r\n l[i] = 0\r\n else:\r\n break\r\nprint(c)", "n,a,b=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nfirst=z[0]\r\ns=sum(z)\r\ndel(z[0])\r\nz.sort()\r\ni=n-2\r\nwhile first*a/s<b:\r\n s-=z[i]\r\n i-=1\r\nprint(n-i-2)\r\n", "n,A,B=map(int,input().split())\r\nhole=list(map(int, input().split()))\r\nh1=hole[0]\r\ns1=hole.count(h1)\r\ntong=sum(hole)\r\nS=h1*A/B\r\nhole.sort()\r\nhole.reverse()\r\nrs=0\r\nfor i in hole:\r\n if S>=tong:\r\n break\r\n if i<=tong:\r\n if i==h1:\r\n if s1==1:\r\n continue\r\n else:\r\n s1-=1\r\n tong-=i\r\n rs+=1\r\nprint(rs)\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nsm = sum(arr)\r\nfirst = arr.pop(0)\r\n\r\nif first* a >= sm * b:\r\n print(0)\r\nelse:\r\n arr.sort()\r\n ans = 0\r\n\r\n while first* a < sm * b and arr:\r\n sm -= arr.pop()\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ns1=a[0]\r\ns=sum(a)\r\ndel a[0]\r\na.sort(reverse=True)\r\ntmps=int((s1*n[1])/n[2])\r\ni=0\r\ndem=0\r\nwhile tmps<s:\r\n s-=a[i]\r\n i+=1\r\n dem+=1\r\nprint(dem)", "n,a,b=[int(n) for n in input().split()]\r\nnums=[int(nums) for nums in input().split()]\r\ntotalsize=0\r\nfor i in nums:\r\n totalsize+=i\r\ntemp=nums[0]*a\r\nnums.pop(0)\r\nnums.sort(reverse=True)\r\nindex=0\r\ncheckflow=0\r\nif (temp/(totalsize))>=b:\r\n print(0)\r\n checkflow=1\r\nwhile(index<len(nums)):\r\n if (temp/(totalsize-nums[index]))>=b:\r\n break\r\n totalsize-=nums[index]\r\n index+=1\r\nif checkflow!=1:\r\n print(index+1)\r\n", "import sys\nsys.setrecursionlimit(2000)\nfrom collections import Counter\n\ndef solution(n, A, B, s):\n\n summ = sum(s)\n val = s[0]\n s = sorted(s[1:], reverse=True)\n\n count = 0\n frac = val / summ\n while(A*frac < B):\n summ -= s[count]\n count += 1\n frac = val / summ\n\n print(count)\n\nif __name__ == \"__main__\":\n\n # single variables\n n, A, B = [int(val) for val in input().split()]\n\n # vectors\n s = [int(val) for val in input().split()]\n\n # solve it!\n solution(n, A, B, s)\n\n\n\n", "n, a, b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nc = 0\r\ny = s[0]\r\nk = sum(s)\r\ns.remove(s[0])\r\ni = 0\r\ns.sort(reverse=True)\r\nwhile ((a * y) / k) < b:\r\n k -= s[i]\r\n i += 1\r\n c += 1\r\nprint(c)", "# python3\n\ndef readline(): return tuple(map(int, input().split()))\n\n\ndef main():\n n, a, b = readline()\n s1, *s = readline()\n\n bound = s1 * (a - b) / b\n for si in sorted(s):\n bound -= si\n if bound < 0:\n break\n n -= 1\n print(n - 1)\n\n\nmain()\n", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nnew=l[1::]\r\nnew.sort(reverse=True)\r\ns=sum(l)\r\nif l[0]*a>=s*b:\r\n print(0)\r\nelse:\r\n ans=0\r\n for i in range(n-1):\r\n s-=new[i]\r\n ans+=1\r\n if l[0]*a>=s*b:\r\n print(ans)\r\n break\r\n", "for _ in range(1):\n n,a,b=(map(int,input().split()))\n arr=list(map(int,input().split()))\n temp=arr[0]*a/b\n temp1=sum(arr)\n arr.pop(0)\n arr.sort()\n arr.reverse()\n count=0\n for i in range(0,len(arr)):\n if temp>=temp1:\n break\n else:\n temp1-=arr[i]\n\n count += 1\n print(count)\n\n\n ", "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# _INPUT_LINES = sys.stdin.read().splitlines()\r\n# input = iter(_INPUT_LINES).__next__\r\n# _OUTPUT_BUFFER = io.StringIO()\r\n# sys.stdout = _OUTPUT_BUFFER\r\n#\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\nn, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nsm = sum(arr)\r\n\r\ncnt = 0\r\n\r\nfirst = arr.pop(0)\r\n\r\narr.sort()\r\n\r\nwhile first * a / sm < b:\r\n cnt += 1\r\n sm -= arr.pop()\r\n\r\nprint(cnt)\r\n", "n,a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nk=(s[0]*a)/b\r\nl=s[0]\r\ns.sort()\r\nz=s.index(l)\r\n#print(z)\r\ns=s[:z]+s[z+1:]\r\ns.insert(0,l)\r\n#print(s)\r\nj=n-1\r\nans=0\r\nval=sum(s)\r\n#print(val,k)\r\nwhile(val>k):\r\n\tval-=s[j]\r\n\tans+=1\r\n\tj-=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def main_function():\r\n n, A, B = [int(i) for i in input().split(\" \")]\r\n s = [int(i) for i in input().split(\" \")]\r\n sums = sum(s)\r\n s_1 = s[0]\r\n s.pop(0)\r\n s.sort(reverse=True)\r\n blocked_area = 0\r\n blocked_count = 0\r\n index = 0\r\n while (B > ((A * s_1 ) / (sums - blocked_area))):\r\n\r\n blocked_count += 1\r\n blocked_area += s[index]\r\n index += 1\r\n print(blocked_count)\r\n\r\n\r\nmain_function()\r\n", "n, A, B = [int(w) for w in input().split()]\ns = [int(w) for w in input().split()]\n\nS = sum(s)\ns1, *s = s\ns.sort()\ns.reverse()\n#s1*A/S >= B => S*B <= s1*A\nn = 0\nwhile S*B > s1*A:\n S -= s[n]\n n += 1\n\nprint(n)\n", "n, a, b = map(int, input().split(\" \"))\r\n\r\nholes = [int(i) for i in input().split(\" \")]\r\nfirst_hole = holes[0]\r\nsum_size = sum(holes)\r\ndel holes[0]\r\nholes = sorted(holes)[::-1]\r\n\r\ns = 0\r\nwhile (first_hole * a) / sum_size < b:\r\n sum_size -= holes[s]\r\n s += 1\r\nprint(s)\r\n\r\n", "from bisect import bisect_left as bs\nimport sys\nif locals()['__file__'][-2:] == 'py':\n sys.stdin = open('in.txt', 'r')\nrd = lambda: map(int, input().split())\nn, a, b = rd()\nli = list(rd())\ns = sum(li)\nx = li[0]\nli = li[1:]\nli.sort(reverse=True)\nadd = [0]\nfor i in li:\n add.append(add[-1] + i)\nrequire = s - x * a / b\nfind = bs(add, require)\nprint(find)\n", "n, a, b = [int(i) for i in input().split(' ')]\nholes_sizes = [int(i) for i in input().split(' ')]\n\ns = sum(holes_sizes)\nfirst_hole_size = holes_sizes[0]\nopened_holes = holes_sizes[1:]\nopened_holes.sort(reverse=True)\n\nif ((first_hole_size * a)/s >= b):\n print(0)\nelse:\n for i in range(len(opened_holes)):\n s -= opened_holes[i]\n if ((first_hole_size * a)/s >= b):\n print(i + 1)\n break\n\t\t \t \t\t \t\t\t\t\t\t \t \t \t \t\t\t", "n,a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nf=x[0]\r\nx=x[1:]\r\nx.sort()\r\ns=sum(x)+f\r\ncurrent = f*a/s\r\nif current>=b:\r\n print(0)\r\nelse:\r\n ans=0\r\n while(current<b):\r\n s-=x[-1-ans]\r\n current = f*a/s\r\n ans+=1\r\n print(ans)", "from itertools import accumulate\nfrom operator import add\n\nn, A, B = [int(i) for i in input().split(' ')]\ns = [int(i) for i in input().split(' ')]\n\n\ndef gao():\n if n == 1:\n return 0\n\n first = s[0]\n a = [0] + sorted(s[1:])\n sum = list(accumulate(a, add))\n \n l, r = 0, n - 1\n ans = -1\n while l <= r:\n mid = (l + r) // 2\n # first/(first + sum[mid]) * A >= B\n # equals to: first * A >= (first + sum[mid]) * B\n if first * A >= (first + sum[mid]) * B:\n ans = mid\n l = mid + 1\n else:\n r = mid - 1\n return n - 1 - ans\n\nprint(gao())", "\r\n\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\nn = numbers[0]\r\nA = numbers[1]\r\nB = numbers[2]\r\n\r\narr = list(map(int, input().split()))\r\n\r\nnew_arr = arr[1:n]\r\n\r\nnew_arr.sort(reverse = True)\r\n\r\nSum = 0\r\nfor x in arr:\r\n Sum+=x\r\n\r\np = (A*arr[0])/B\r\n\r\n\r\ncnt = 0\r\nfor i in range(n-1):\r\n if p >= Sum:\r\n break\r\n else:\r\n Sum-=new_arr[i]\r\n cnt+=1\r\n \r\n\r\nprint(cnt)", "\r\ndef check(key,a,b,s):\r\n\tval = key*a/s\r\n\tif (val >= b):\r\n\t\treturn True\r\n\treturn False\r\n\r\ndef main():\r\n\tn, a, b = map(int, input().split())\r\n\r\n\ttmp = list(map(int, input().split()))\r\n\r\n\tkey = tmp[0]\r\n\r\n\tarr = sorted(tmp[1:])\r\n\r\n\ts = key\r\n\ti = -1\r\n\tres = n-1\r\n\r\n\twhile (True):\r\n\t\ttmp = check(key,a,b,s)\r\n\t\tif (not tmp):\r\n\t\t\treturn res+1\r\n\t\ti += 1\r\n\t\tif (i >= len(arr)):\r\n\t\t\treturn res\r\n\t\ts += arr[i]\r\n\t\tres -= 1\r\n\r\n\r\nprint(main())\r\n", "n, A, B = map(int, input().split())\ns = []\ntS = 0\n\nfor i in input().split():\n s.append(int(i))\n tS = tS + int(i)\ns1 = s[0]\ns = s[1:]\n\ns.sort(reverse=True)\n\nw = 0\nw1 = 0\nb = 0\nbl = 0\nwhile True:\n\n w1 = A * ((s1) / (tS - bl))\n if w1 >= B:\n break\n if b > len(s) - 1:\n print(b)\n exit()\n bl = bl + s[b]\n b += 1\n\nprint(b)\n", "n, a, b = map(int, input().split())\r\npipe = list(map(int, input().split()[:n]))\r\nprimeiro = pipe[0]\r\npipe.pop(0)\r\npipe.sort()\r\n\r\nbloqueados = 0\r\natual_tam = primeiro\r\n\r\nfor x in pipe:\r\n atual_tam = atual_tam + x\r\n\r\natual_vol = int(a*primeiro/atual_tam)\r\n#a volume colocado\r\n#b volume desejado\r\n\r\nwhile (atual_vol < b):\r\n bloqueados = bloqueados+1\r\n atual_tam = atual_tam - pipe.pop(-1)\r\n\r\n atual_vol = int(a*primeiro/atual_tam)\r\n\r\nprint(bloqueados)\r\n\r\n\r\n\r\n", "n, A, B = list(map(int, input().split()))\r\nsizes = list(map(int, input().split()))\r\ns1 = sizes[0]\r\nS = sum(sizes)\r\nz = sorted(sizes[1:], reverse=True)\r\ncnt = 0\r\nfor i in range(n-1):\r\n if s1 * A // S >= B:\r\n break\r\n else:\r\n cnt += 1\r\n S -= z[i]\r\nprint(cnt)", "n, a, b = map(int, input().split())\r\nu = list(map(int, input().split()))\r\np = u[0]\r\nu = u[1:] + [0]\r\nu.sort()\r\nu[0] = p\r\nok = True\r\nfor i in range(1, n):\r\n u[i] += u[i - 1]\r\n ans = p * a / u[i]\r\n if ans < b:\r\n print(n - i)\r\n ok = False\r\n break\r\nif ok:\r\n print(0)\r\n", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nif l[0]*a/b>=s:\r\n print(0)\r\nelse:\r\n x,c=l[0]*a/b,0\r\n l=l[1:]\r\n l.sort()\r\n for i in range(n-2,-1,-1):\r\n s-=l[i]\r\n c+=1\r\n if s<=x:\r\n print(c)\r\n break\r\n \r\n", "R = lambda: map(int, input().split())\r\n\r\nn, A, B = R()\r\ns = list(R())\r\nt = s[0]\r\ns0 = sum(s)\r\ns = sorted(s[1:])\r\n\r\nx = t*A/B\r\n#print(x)\r\nres = len(s)\r\n\r\ni = 0\r\nwhile s0 > x:\r\n s0 -= s[res - i - 1]\r\n i += 1\r\nprint(i)\r\n\r\n", "n,i,o = map(int,input().split())\r\na = list(map(int,input().split()))\r\nf = a[0]\r\na.pop(0)\r\na.sort(reverse = True)\r\ns = sum(a)+f\r\nt = 0\r\ny = i*f\r\n#print(y/s)\r\nwhile(y / s < o):\r\n s -= a[t]\r\n t+=1\r\nprint(t)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef solve():\r\n [n, a, b] = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n s1 = arr[0]\r\n arr = sorted(arr[1:], reverse = True)\r\n sActive = s1*((a-b)/b)\r\n total = sum(arr)\r\n ans = 0\r\n for i in range(n-1):\r\n if total <= sActive :\r\n break\r\n else :\r\n total -= arr[i]\r\n ans += 1\r\n print(ans)\r\n \r\n \r\nsolve()", "n,A,B = list(map(int,input().split(' ')))\r\nsq = list(map(int,input().split(' ')))\r\n\r\nif A*sq[0]/sum(sq) >= B:\r\n print(0)\r\nelse:\r\n s = list()\r\n s.append(sq[0])\r\n s.extend(sorted(sq[1:]))\r\n lev = 1\r\n pra = n-1\r\n while lev!=pra:\r\n s8 = sum(s[:(lev+pra)//2+1])\r\n if A*s[0] >= B*s8:\r\n lev = (lev+pra)//2 + 1\r\n if A*s[0] == B*s8:\r\n break\r\n else:\r\n pra = (lev+pra)//2 \r\n print(n-lev)\r\n##print(lev, s)\r\n", "def solve(n, A, B, arr):\r\n if n == 1: return 0\r\n Sum, val = sum(arr), arr[0]*A/B\r\n if Sum <= val: return 0\r\n for i,s in enumerate(sorted(arr[1:], reverse=True), 1):\r\n Sum -= s\r\n if Sum <= val: return i\r\n return 0\r\n\r\n\r\nn, A, B = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(solve(n, A, B, arr))", "_, a, b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ni = iter(sorted(s[1:], reverse=True))\r\nssum = sum(s[1:])\r\ns0 = s[0]\r\ncnt = 0\r\n\r\nwhile s and (s0 * a) / (ssum + s0) < b:\r\n ni = next(i)\r\n ssum -= ni\r\n cnt += 1\r\n\r\nprint(cnt)\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,a,b = get_int_list()\r\nlst = get_int_list()\r\n\r\ns = a*(lst[0])/b\r\n\r\nl = sorted(lst[1:])\r\ntotal = lst[0]\r\ncount = 1\r\nfor i in l:\r\n if total+i <= s:\r\n total += i\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(n-count)", "n, A, B = map(int, input().split())\r\nst = input()\r\na = st.split()\r\nS = 0\r\n\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n S += a[i]\r\n\r\nanswer = -1\r\n\r\nif a[0] * A / S >= B:\r\n answer = 0\r\nelse:\r\n b = a[1:]\r\n b.sort(reverse=True)\r\n a[1:] = b\r\n\r\n for i in range(1, n):\r\n S -= a[i]\r\n if a[0] * A / S >= B:\r\n answer = i\r\n break\r\n\r\nprint(answer)\r\n", "n, a, b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nss = sum(s)\r\nl = sorted(s[1::], reverse=True)\r\ni = 0\r\nwhile s[0]*a/ss < b:\r\n\tss -= l[i]\r\n\ti += 1\r\n\r\nprint(i)", "n, A, B = map(int, input().split(' '))\ns = list(map(int, input().split(' ')))\nlst = list(reversed(sorted(s[1:])))\n\nblocking_holes = 0\ntotal_volumes = sum(s)\n\nfor hole in lst:\n if s[0] * A / total_volumes >= B:\n break\n total_volumes -= hole\n blocking_holes += 1\n\nprint(blocking_holes)\n\n", "n,a,b= map(int,input().split())\r\ns = list(map(int,input().split()))\r\nfirst = s[0]\r\nsum_all = sum(s)\r\nno_first = s[1:]\r\nno_first.sort(reverse=True)\r\nans = 0\r\nfor i in range(n-1):\r\n if a*first / sum_all >= b:\r\n\r\n break\r\n else:\r\n sum_all -= no_first[i]\r\n ans+=1\r\nprint(ans)\r\n", "n,a,b=map(int,input().split())\r\nf,*r=list(map(int,input().split()))\r\n\r\nr=sorted(r,reverse=True)\r\nS=f+sum(r)\r\ni=0\r\nwhile b>f*a/S and i<n-1:\r\n\tS-=r[i]\r\n\ti+=1\r\nprint(i)\r\n\r\n\r\n\r\n", "n,a,b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl = [l[0]] + list(sorted(l[1:]))\r\nzy = (l[0]*a)/b\r\nsm = sum(l)\r\nj = n-1\r\nwhile j > 0 and sm > zy:\r\n sm-=l[j]\r\n j -= 1\r\nprint(n-j-1)", "n, A, B = map(int, input().split())\r\ng, *s = map(int, input().split())\r\ns = 0, *sorted(s, reverse=True)\r\ng, sm = g * A, sum(s) + g\r\nfor i in range(n):\r\n sm -= s[i]\r\n if g / sm >= B:\r\n print(i)\r\n break\r\n", "n,a,b=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\ns=sum(l1)\r\nx=l1[0]\r\nl1=l1[1:]\r\nl1.sort()\r\nl1=l1[::-1]\r\ncount=0\r\nfor item in l1:\r\n if (x*a)/s >=b:\r\n break\r\n else :\r\n s-=item\r\n count+=1\r\nprint(count)", "n,A,B = [int(x) for x in input().split(' ')]\ns = [int(x) for x in input().split(' ')]\ntotal = sum(s)\nif s[0]/total*A >= B:\n print(0)\nelse:\n printed = False\n s_sorted = sorted(s[1:], reverse=True)\n for i in range(len(s_sorted)):\n total-=s_sorted[i]\n if B<=(s[0]/total)*A:\n print(i+1)\n printed = True\n break", "hole, l, need = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = a.pop(0)\r\nb = x*l / need\r\na.sort(reverse=True)\r\ny = sum(a)+x\r\np = 0\r\nwhile b<y:\r\n y -= a[p]\r\n p +=1\r\n \r\nprint(p)\r\n", "def main():\n [n, A, B] = [int(_) for _ in input().split()]\n holes = [int(_) for _ in input().split()]\n sum_holes = sum(holes)\n\n other_holes = holes[1:]\n other_holes.sort(reverse=True)\n\n max_sum_holes = holes[0] * A / B\n index = 0\n\n while sum_holes > max_sum_holes and index < n - 1:\n sum_holes -= other_holes[index]\n index += 1\n\n print(index)\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nfrom heapq import heapify, heappop\r\n# target * sum / toal <= cur_sum\r\n\r\nlength, total, target = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nsum_ = sum(arr)\r\nmax_heap = [-x for x in arr[1:]]\r\nheapify(max_heap)\r\n\r\ncur_sum = arr[0]\r\nans = 0\r\n\r\nwhile target * sum_ / total > cur_sum:\r\n delta = heappop(max_heap)\r\n sum_ += delta\r\n ans +=1\r\n\r\nprint(ans)", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nx=l[0]\r\nif n==1:\r\n print(0)\r\nelse:\r\n l=l[1:]\r\n l.sort()\r\n l.reverse()\r\n i=0\r\n while(s*b>(a*x)) and i<n-1:\r\n s-=l[i]\r\n i+=1\r\n print(i)", "from math import ceil\r\nn, A, B = map(int, input().split())\r\ns = [int(i) for i in input().split()]\r\np=s[1:]\r\np.sort(reverse=True)\r\nt=sum(s)\r\nsu=(s[0]*A)/B\r\nk=t-su\r\ng=0\r\ni=0\r\nh=len(p)\r\nr=True\r\nwhile(r):\r\n if (s[0]*A)/sum(s)>=B:\r\n r=False\r\n break\r\n m=ceil((i+h)/2)\r\n S=sum(p[:m])\r\n if S>=k and sum(p[:m-1])<k :\r\n g=m\r\n break\r\n elif S<k:\r\n i=m\r\n else:\r\n h=m\r\n \r\n \r\nprint(g)", "from bisect import bisect_right\r\n\r\ndef get_ints():\r\n return map(int, input().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().split()))\r\n\r\ndef min_value_greater_than(arr, k):\r\n arr.sort()\r\n return arr[bisect_right(arr, k)]\r\n\r\n\r\n# YOUR CODE HERE\r\nn,A,B = get_ints()\r\ns = get_list()\r\n\r\nl = s[1:]\r\nl.sort()\r\nS = s[0]*A/B-s[0]\r\na = sum(l)\r\ncnt = 0\r\nwhile a>S:\r\n cnt += 1\r\n a-=l.pop()\r\nprint(cnt)\r\n", "\r\nn, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nsum_ = sum(l)\r\ns0 = l.pop(0)\r\n\r\nans = 0\r\ni = 0\r\nl.sort(reverse = True)\r\nwhile i < n - 1 and s0 * a / sum_ < b:\r\n\tans += 1\r\n\tsum_ -= l[i]\r\n\ti += 1\r\n\r\n\r\nprint(ans) ", "n, A, B = [int(x) for x in input().split(' ')]\r\ns = [int(x) for x in input().split(' ')]\r\nS = sum(s)\r\na = s[0]\r\nq = sorted(s[1:])\r\nc = 0\r\nwhile (a * A) / S < B:\r\n S -= q.pop()\r\n c += 1\r\nprint(c)", "n,a,b=map(int,input().split())\nP=list(map(int,input().split()))\ns=sum(P)\nw=list(P)\nw.pop(0)\nw.sort()\ncount=0\nxy=(a*P[0])/b\nwhile s>xy:\n s-=w[-1]\n w.pop()\n count+=1\nprint(count)\n\n\t \t\t \t \t\t\t \t \t \t \t", "n,A,B = map(int,input().split())\r\ns = input().split()\r\nS=0\r\nfor i in range(n):\r\n s[i] = int(s[i])\r\n S+=s[i]\r\nt =s[0]\r\ns.remove(t)\r\ns.sort()\r\ni = n-2\r\nwhile (A*t/S<B):\r\n S-=s[i]\r\n i-=1 \r\nprint(max(n-2-i,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", "n,a,b=map(int,input().split())\r\ni,*l=list(map(int,input().split()))\r\nl.sort()\r\ns=sum(l)\r\nif a*i/(i+s)>=b:print(0)\r\nelse:\r\n\ts-=l[-1]\r\n\tx=1\r\n\twhile a*i/(i+s)<b:\r\n\t\tx+=1\r\n\t\ts-=l[-x]\r\n\tprint(x)\r\n", "import sys\r\nimport math\r\n\r\n#n = int(sys.stdin.readline().strip())\r\nn, A, B = map(int, sys.stdin.readline().strip().split(' '))\r\narr = list(map(int, sys.stdin.readline().strip().split(' ')))\r\nfirst_hole = arr[0]\r\nsum_holes = sum(arr)\r\nsorted_arr = sorted(arr[1:], reverse = True)\r\n\r\nidx = 0\r\nans = 0\r\nwhile (first_hole * A) / sum_holes < B:\r\n\tsum_holes -= sorted_arr[idx]\r\n\tidx += 1\r\n\tans += 1\r\nprint(ans)\r\n\r\n\r\n\r\n", "n,a,b=map(int,input().split())\r\nx,*l=map(int,input().split())\r\nl.sort()\r\nc=0\r\ns=sum(l)\r\np=(x*a)/b-x\r\nwhile p<s:\r\n\tc+=1\r\n\ts-=l.pop()\r\nprint(c)", "n,A,B = list(map(int,input().split()))\r\nli = list(map(int,input().split()))\r\nlisum = sum(li)\r\nfe = li[0]\r\nli.pop(0)\r\nli.sort(reverse=True)\r\ncount = 0\r\nfor i in range(n-1):\r\n if ((fe*A)/lisum)<B:\r\n count+=1\r\n lisum = lisum-li[i]\r\n else:\r\n break \r\nprint(count)\r\n ", "n, a, b = map(int,input().split())\ns = list(map(int,input().split()))\nc = s [1:]\nc.sort()\nf = 0\ne = s[0]\nfor x in c:e += x\nwhile True:\n\tif s[0] * (a / e) >= b:break\n\telse:\n\t\tf += 1\n\t\te -= c[-1]\n\t\tc.pop()\nprint(f)\n", "#http://codeforces.com/problemset/problem/967/B\r\nn,A,B=map(int,input().split())\r\nRaz=list(map(int,input().split()))\r\nx=Raz.pop(0)\r\nRaz.sort()\r\ns=sum(Raz)\r\nk=0\r\nwhile((x*A)/(s+x)<B):\r\n k+=1\r\n s-=Raz.pop(-1)\r\nprint(k)", "n, a, b = [int(x) for x in input().split()]\r\no = []\r\ns = 0\r\nfor x in input().split():\r\n s += int(x)\r\n o.append(int(x))\r\n\r\ns1 = o[0]\r\no[0] = 0\r\no.sort()\r\ncount = 0\r\nwhile(s1*a < b*s):\r\n s -= o.pop()\r\n count+=1\r\nprint(count)\r\n", "n, a, b = [int(c) for c in input().split()]\n\npesos = [int(k) for k in input().split()]\n\nfirst = pesos[0]\ni = 0\nsoma = sum(pesos[i:n])\npesos.pop(0)\npesos.sort(reverse=True)\n\nwhile ((first*a)/soma< b):\n\n \n soma -= pesos[i]\n i += 1\n\nprint(i)\n\n \t\t\t\t\t\t \t\t\t\t \t \t\t \t", "n,a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nfirst = l[0]\r\nl.pop(0)\r\nl.sort()\r\n#print(l)\r\ns = sum(l)+first\r\ni=0\r\nans = first*a/s\r\n#print(ans,s,l)\r\ncnt=0\r\nwhile(ans<b):\r\n\r\n s = s - l.pop()\r\n ans = first * a / s\r\n i+=1\r\n cnt+=1\r\nprint(cnt)\r\n\r\n", "n,a,b=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nk=ar[0]\r\nadd=sum(ar)\r\nar.pop(0)\r\nar.sort()\r\nn-=1\r\ns=0\r\nwhile (((k*a)/add)<b):\r\n add-=ar[n-1];\r\n s+=1 \r\n n-=1 \r\n if(n==0):\r\n break\r\nprint(s)", "def watering_plants (n,poured,goal, seq) :\r\n blocked = 0\r\n first_hole = seq.pop(0)\r\n seq.sort()\r\n divisor = sum(seq) + first_hole\r\n while (first_hole*poured)/divisor < goal :\r\n divisor -= seq[-1]\r\n seq.pop(-1)\r\n blocked += 1\r\n \r\n return blocked\r\n \r\n \r\nn,poured,goal = list(map(int,input().split()))\r\n\r\nseq = list(map(int,input().split()))\r\n\r\n\r\nprint (watering_plants(n,poured,goal,seq))\r\n \r\n \r\n ", "def main():\n [n, a, b] = [int(i) for i in input().split()]\n s = [int(i) for i in input().split()]\n sumAll = 0\n for i in range(n):\n sumAll += s[i]\n rest = s[1:]\n rest.sort(reverse=True)\n thresh = sumAll - s[0] * a / b\n i = 0\n sumBlocked = 0\n while sumBlocked < thresh:\n sumBlocked += rest[i]\n i += 1\n print(i)\nif __name__ == \"__main__\":\n main()\n", "[n, a, b] = [int(i) for i in input().split()]\ns = [int(i) for i in input().split()]\nsum_s = sum(s)\ns = [s[0]] + sorted(s[1:])\nresult = 0\n\nfor i in range(n-1, 0, -1):\n if s[0]*a/sum_s >= b:\n break\n sum_s -= s[i]\n result += 1\n\nprint(result)\n\n", "n, A, B = map(int, input().split())\n\narray = input().split()\narray = [int(j) for j in array]\narray[1:n] = sorted(array[1:n])\n\ncontador = 0\ntotal = sum(array)\n\nfor i in range(n-1, -1, -1):\n if A*array[0]/total >= B:\n break\n contador += 1\n total -= array[i]\n\nprint(contador)\n\t \t\t \t\t\t \t\t\t \t\t \t\t \t \t \t", "from itertools import accumulate\r\n\r\n\r\ndef check(p):\r\n return const / sum_[p] >= B\r\n\r\n\r\ndef binSearch(a, b):\r\n left, right = a - 1, b + 1\r\n\r\n while right - left > 1:\r\n mid = (left + right) // 2\r\n\r\n if check(mid):\r\n left = mid\r\n\r\n else:\r\n right = mid\r\n\r\n return n - left - 1\r\n\r\n\r\nn, A, B = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\ns = [s[0]] + sorted(s[1:])\r\nsum_ = list(accumulate(s))\r\n\r\nconst = s[0] * A\r\n\r\nprint(binSearch(0, n - 1))\r\n", "n,a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nc=0\r\nss = sum(s)\r\n \r\ns1 = s[0]\r\nsl = s[1:]\r\nsl.sort()\r\n \r\nnum = 0\r\n \r\nwhile s1*a/ss < b:\r\n ss -= sl.pop()\r\n num += 1\r\n \r\nprint(num)\r\n", "n, a, b = map(int, input().split())\npipe = list(map(int, input().split()[:n]))\nprimeiro = pipe[0]\npipe.pop(0)\npipe.sort()\n\nbloqueados = 0\natual_tam = primeiro\n\nfor x in pipe:\n atual_tam = atual_tam + x\n\natual_vol = int(a*primeiro/atual_tam)\n#a volume colocado\n#b volume desejado\n\nwhile (atual_vol < b):\n bloqueados = bloqueados+1\n atual_tam = atual_tam - pipe.pop(-1)\n\n atual_vol = int(a*primeiro/atual_tam)\n\nprint(bloqueados)\n\n\n\n\n \t\t\t \t\t \t \t \t\t\t\t \t \t \t", "n,a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nc=s[0]\r\ns=s[1:]\r\nsum1=sum(s)+c\r\nans=sum2=0\r\ns.sort(reverse=True)\r\nfor i in range(n):\r\n if(a*c/((sum1-sum2))>=b):\r\n # print(a*c/(sum(s[i:])+c))\r\n print(ans)\r\n break\r\n else:\r\n sum2+=s[i]\r\n ans+=1", "n,a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nma = s[0]\r\ns = s[1:]\r\ns.sort(reverse = True)\r\nblocked = 0\r\nsum = sum(s)+ma\r\nwhile ma*a/(sum)<b:\r\n sum-=s[blocked]\r\n blocked+=1\r\nprint(blocked)\r\n", "n, a, b = [int(x) for x in input().split()]\r\n\r\nhs = [int(x) for x in input().split()]\r\n\r\ntarget = 1.0 * hs[0] * a / b\r\n\r\nleft = sorted(hs[1:])\r\ns = sum(hs)\r\n\r\nres = 0\r\nwhile s > target:\r\n res += 1\r\n s -= left[-res]\r\n\r\nprint(res)\r\n", "n,a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nsm=sum(s)\r\nf=s[0]\r\ns=sorted(s[1:])\r\nif((f/sm)*a>=b):\r\n print(0)\r\nelse:\r\n cnt=0\r\n for i in range(1,n):\r\n cnt+=1\r\n sm-=s[-i]\r\n if((f/sm)*a>=b):\r\n print(cnt)\r\n break\r\n\r\n \r\n\r\n\r\n", "MIS = lambda: map(int,input().split())\r\nn, A, B = MIS()\r\nhole = list(MIS())\r\ns1 = hole[0]\r\nhole = sorted(hole[1:], reverse = True)\r\n\r\nsize = sum(hole) + s1\r\nif s1*A >= size*B: print(0); exit()\r\nfor i in range(n-1):\r\n size-= hole[i]\r\n if s1*A >= size*B: print(i+1); break", "from itertools import accumulate\nfrom bisect import bisect_left, bisect_right\n\nn, a, b = (int(i) for i in input().split())\ns = (int(i) for i in input().split())\nx, s = next(s), list(accumulate(sorted(s)))\n# (a * x)/z' >= b\n# a * x >= b * z'\n# z' = z + x\n# z <= (a * x) / b - x\nz = (a * x) / b - x\nres = len(s) - bisect_right(s, z)\n# print(res, z, s)\nprint(res)\n", "n,a,b = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\ns = sum(mas)\r\ne = mas[0]*a\r\nmas = mas[1:]\r\nmas.sort()\r\nmas.reverse()\r\nfrom sys import exit\r\nfor i in range(n-1):\r\n if e/s>=b:\r\n print(i)\r\n exit()\r\n s-=mas[i]\r\nprint(n-1)", "\r\nn,A,B = map(int,input().split(' '))\r\ns = list(map(int,input().split(' ')))\r\n\r\nadf = s[0]\r\nS = sum(s)\r\ns.remove(adf)\r\ns = sorted(s,reverse=True)\r\n\r\nc = 0\r\nt = (A*adf)/S\r\ni =0\r\nwhile t<B and i<n-1:\r\n c = c+1\r\n S = S-s[i]\r\n t = (A*adf)/S\r\n i = i+1\r\n \r\n\r\n\r\nprint(c)\r\n", "n, a, b = map(int, input().split())\nholes = [int(i) for i in input().split()]\ncounter, total = 0, 0\n\nfor i in range(n):\n total += holes[i]\n\nfirst = holes[0]\n\n# sort list to test from biggest to smallest hole\nholes.remove(holes[0])\nholes.sort()\nholes.insert(0, first)\n\nfor j in range(n-1, 0, -1):\n if (first * a / total) >= b:\n break\n total -= holes[j]\n counter += 1\n\nprint(counter)\n\t \t\t \t \t\t \t \t\t\t\t\t\t \t\t\t", "n, A, B = map(int, input().split())\ns = list(map(int, input().split()))\nS = sum(s)\nk = s[0]\np = s[1:]\np.sort(reverse = True)\nans = 0\nfor i in range(len(p)):\n if (k*A)/S >= B:\n ans = 0\n break\n S -= p[i]\n if (k*A)/S >= B:\n ans = i + 1\n break\nprint(ans)\n", "n,a,b=map(int, input().split())\r\nl=list(map(int , input().split()))\r\nfirst=l[0]\r\nl1=l[1:]\r\nl1.sort()\r\nc=0\r\nsumm=sum(l)\r\n\r\nwhile first*a/summ <b:\r\n summ=summ-l1.pop()\r\n c+=1\r\n\r\nprint(c)\r\n\r\n \r\n ", "a, b, c = map(int, input().rstrip().split(\" \"))\r\nl = list(map(int, input().rstrip().split(\" \")))\r\nS = sum(l)\r\nf = l.pop(0)\r\nl.sort(reverse=True)\r\np = b * f\r\ni = 0\r\nwhile p / S < c:\r\n S = S - l[i]\r\n i = i + 1\r\nprint(i)\r\n", "n , A, B = input().split(' ')\nn = int(n)\nA = int(A)\nB = int(B)\nL = input().split(' ')\nfor i in range(len(L)):\n L[i] = int(L[i])\n\nfirst = L[0]\nS = L[1:]\nS = sorted(S)[::-1]\ncount = 0\nsumi = sum(S)\nk = first*A\nfor i in S:\n if k/(first+sumi) < B:\n sumi -= i\n count += 1\nprint(count)\n\n\n\n\n\n\n\n\n\n\n\n\n# while k/(first+sumi) < B:\n# maxi = max(S)\n# sumi -= maxi\n# S.remove(maxi)\n# count += 1\n# print(count)\n", "n,A,B=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndef cal(si,A,B,S):\r\n x = (si*A)/S\r\n if(x>=B):\r\n return True\r\n return False\r\n\r\nf=l[0]\r\nS=sum(l)\r\nif(cal(f,A,B,S)):\r\n print(0)\r\nelse:\r\n seq =sorted( l[1:],reverse=True)\r\n l[1:]=seq\r\n count=1\r\n for i in range(1,len(l)):\r\n S-=l[i]\r\n if(cal(f,A,B,S)):\r\n print(count)\r\n break\r\n count+=1\r\n else:\r\n print(count)\r\n \r\n ", "a,b,c=[int(i) for i in input().split()]\r\nd=[int(i) for i in input().split()]\r\ne=sorted(d[1:],reverse=True)\r\ns=sum(e)\r\nans=0\r\nfor i in range(0,len(e)):\r\n if((b*(d[0]))/(d[0]+s)>=c):\r\n break\r\n s=s-e[i]\r\n ans=ans+1\r\n if((b*(d[0]))/(d[0]+s)>=c):\r\n break\r\nprint(ans)", "n,a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\np0=s[0]\r\ns=s[1:]\r\nmax_s=p0*(a/b-1)\r\ns.sort()\r\ns_pip,np=sum(s),0\r\nwhile np+1<=len(s) and s_pip>max_s:\r\n\ts_pip-=s[len(s)-np-1]\r\n\tnp+=1\r\nprint(np)", "n, A, B = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\nsumm = int(s[0]*A/B)\r\n\r\nans = 0\r\nfor i in range(0, n):\r\n ans += s[i]\r\n\r\ns.pop(0)\r\ns.sort()\r\n\r\nj = n-2\r\nwhile ans > summ:\r\n ans -= s[j]\r\n j -= 1\r\n\r\nprint(n-j-2)", "n,A,B = map(int, input().split())\r\ns1,*s = map(int,input().split())\r\ns.sort(reverse=True)\r\n\r\ntotal=sum(s[:])+s1\r\nhole_block = 0\r\nwhile True:\r\n judgement = (s1*A)/total\r\n if judgement >= B:\r\n print(hole_block)\r\n break\r\n hole_block += 1\r\n total -= s[hole_block-1]", "#967B\r\nn,A,B = map(int, input().split())\r\nL = list(map(int, input().split()))\r\na = L[0]\r\nS = sum(L)\r\nL.pop(0)\r\nL.sort(reverse=True)\r\ncount = 0\r\nfor i in L:\r\n if a/S*A>=B:\r\n break\r\n else:\r\n S-=i\r\n count += 1\r\nprint(count)\r\n", "X = list(map(int, input().split()))\r\nHoles = list(map(int, input().split()))\r\nFirst, SUM, Holes, i = Holes[0], sum(Holes), list(sorted(Holes[1:], reverse=True)), 0\r\nwhile First * X[1] / SUM < X[2]:\r\n SUM, i = SUM - Holes[i], i + 1\r\nprint(i)\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: I have fever and runny nose\r\n", "x=list(map(int,input().split()))\r\nholes=list(map(int,input().split()))\r\ntotal=0\r\nsum=0\r\nfor i in range(x[0]):\r\n total+=holes[i]\r\ninitialhole=holes[0]\r\nholes.sort()\r\npoint=0\r\nfor i in range(x[0]-1,-1,-1):\r\n if holes[i]==initialhole and point==0:\r\n point=1\r\n else:\r\n if ((initialhole*x[1])/total)<x[2]:\r\n total-=holes[i]\r\n sum+=1\r\n else:\r\n break\r\nprint(sum)", "n,A,B=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nS=sum(s)\r\nq=sorted(s[1:],reverse=True)\r\nq=s[:1]+q\r\nk=int((s[0]*A)//B)\r\nc=0\r\nfor i in range(1,n):\r\n if(S<=k):\r\n break\r\n else:\r\n S-=q[i]\r\n c+=1\r\nprint(c)\r\n", "n, A, B = map(int, input().split(\" \"))\nsize = [int(x) for x in input().split(\" \")]\ns = sum(size)\nfirst = size[0]\nspilled_first = first * A / s\n\nclosed = 0\nsize = sorted(size[1:], reverse=True)\nfor k in size:\n if spilled_first >= B:\n break\n s = s - k\n closed += 1\n spilled_first = first * A / s\n\nprint(closed)\n", "n, Vin, Vvoulu = map(int, input().split())\r\nsizes= list(map(int, input().split()))\r\nL=len(sizes)\r\n\r\n#Vreel= sizes[0] * Vin / S\r\n#donc\r\nlim=sizes[0]* Vin/ Vvoulu\r\n# contrainte S <= lim\r\n# dc Sblock\r\n#Sblock >= sum(sizes[:]) - lim\r\n#a resoudre\r\nminabloquer= sum(sizes[:]) - lim\r\n#print(minabloquer)\r\nsofar=0\r\ncount=0\r\nrenorma=sizes[1:]\r\nrenorma.sort(reverse=True)\r\n#print(renorma)\r\n#print(minabloquer)\r\n#print(lim)\r\ntotal = 0\r\nco=0\r\nwhile(total< minabloquer):\r\n total += renorma[co]\r\n co+=1\r\n\r\nprint(co)\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\nx = num.pop(0)\r\nnum.sort()\r\nsum1 = sum(num)\r\nnum.reverse()\r\nif (x * a) / (sum1 + x) >= b:\r\n print(0)\r\nelse:\r\n for i in range(len(num)):\r\n sum1 -= num[i]\r\n if (x * a) / (sum1 + x) >= b:\r\n print(i + 1)\r\n break", "n,a,b=map(int,input().split())\nl=list(map(int,input().split()))\ns=sum(l)\nz=list(l)\nz.pop(0)\nz.sort()\ncount=0\nac=(a*l[0])/b\nwhile s>ac:\n s-=z[-1]\n z.pop()\n count+=1\nprint(count)\n \t \t \t\t \t\t \t \t \t \t \t\t", "n, a, b = map(int, input().split())\ns = list(map(int, input().split()))\nx = s[0]\nsumm = sum(s)\ny = []\nfor i in range(n):\n\ty.append([s[i], i])\ny.sort(reverse = True)\ncount = 0\nindex = 0\nwhile (x * a) / summ < b:\n\tcount += 1\n\tif y[index][1] == 0:\n\t\tindex += 1\n\tsumm -= y[index][0]\n\tindex += 1\nprint(count)\t\t\n\n", "import sys\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,A,B = mints()\r\ns = list(mints())\r\ns1 = s[0]\r\nS = sum(s)\r\ns = s[1:]\r\ns.sort(reverse=True)\r\nif s1*A >= B*S:\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(len(s)):\r\n\t\tS -= s[i]\r\n\t\tif s1*A >= B*S:\r\n\t\t\tprint(i+1)\r\n\t\t\texit(0)\r\n", "x=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\ns=0\r\nc=y.pop(0)\r\ny.sort()\r\np=sum(y)\r\nwhile (c*x[1])/(p+c)<x[2]:\r\n s+=1\r\n p-=y.pop(-1)\r\n\r\nprint(s)\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn,a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nq=s[0]\r\nsu=sum(s)\r\ndel s[0]\r\ns.sort()\r\ni=n-2\r\nwhile q*a/su<b:\r\n su-=s[i]\r\n i-=1\r\nprint(n-2-i)\r\n \r\n \r\n", "import math\r\nfrom sys import stdin,stdout\r\ndef L():\r\n return list(map(int,stdin.readline().split())) #For array input\r\ndef Si():\r\n return sorted(list(map(int,stdin.readline().split()))) #For sorted array\r\ndef In():\r\n return map(int,stdin.readline().split()) #For multiple input\r\ndef I():\r\n return int(stdin.readline()) #For single input\r\ndef main():\r\n n,a,b=In()\r\n l=L()\r\n if( sum(l)<=int(l[0]*a/b) ):\r\n print(0)\r\n else:\r\n x=sum(l)-int(l[0]*a/b)\r\n l.remove(l[0])\r\n l=sorted(l,reverse=True)\r\n for i in range(n-1):\r\n x-=l[i]\r\n if(x<=0):\r\n print(i+1)\r\n break\r\n\r\n\r\nif __name__ == \"__main__\" :\r\n main()", "# LUOGU_RID: 101739387\nn, a, b, t, *m = map(int, open(0).read().split())\r\ns = t * a / b - t\r\nans = n - 1\r\nfor x in sorted(m):\r\n s -= x\r\n if s < 0:\r\n break\r\n ans -= 1\r\nprint(ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfrom heapq import heapify, heappop\r\n\r\ndef solve():\r\n [n, a, b] = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n s1 = arr[0]\r\n arr = [-arr[i] for i in range(1, n)]\r\n heapify(arr)\r\n sActive = s1*((a-b)/b)\r\n total = sum(arr)*-1\r\n ans = 0\r\n for i in range(n-1):\r\n if total <= sActive :\r\n break\r\n else :\r\n total += heappop(arr)\r\n ans += 1\r\n print(ans)\r\n \r\n \r\nsolve()", "n,a,b = map(int,input().split())\r\nsi = list(map(int,input().split()))\r\nif a == b:\r\n print(n-1) \r\nelse:\r\n num = si[0]\r\n summ = sum(si)\r\n a = b / a\r\n if num / summ >= a:\r\n print(0)\r\n else:\r\n si.sort()\r\n i2 = 0\r\n i = n-1\r\n while i > -1:\r\n if i2 == 0 and si[i] == num:\r\n i2 = 1\r\n i -= 1\r\n continue\r\n summ -= si[i]\r\n if num / summ >= a:\r\n print(n - i - i2)\r\n break\r\n i -= 1\r\n", "n, A, B = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ntmp = s[0] * A / B - s[0]\r\n\r\nidx = n - 1\r\nsum_s = sum(s[1:])\r\nss = sorted(s[1:], reverse=True)\r\nfor i in range(n - 1):\r\n if sum_s <= tmp:\r\n idx = i\r\n break\r\n sum_s -= ss[i]\r\n\r\nprint(idx)", "n, a, b = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nssr = sorted(s, reverse=True)\r\nfor i in range(n - 1):\r\n if ssr[i] == s[0]:\r\n ssr = ssr[:i] + ssr[i+1:]\r\n break\r\nsumm = 0\r\nfor i in s:\r\n summ += i\r\n\r\nfor i in range(n):\r\n if s[0] * a / summ >= b:\r\n print(i)\r\n exit()\r\n else:\r\n summ -= ssr[i]\r\n", "a = input()\r\na = a.split(' ')\r\nb = input()\r\nb = b.split(' ')\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\n \r\ndef reska():\r\n x = 0\r\n for i in range(len(b)):\r\n x += b[i]\r\n y = 0\r\n if a[1]*(b[0]/(x)) >= a[2]:\r\n print(0)\r\n return\r\n c = b[1:]\r\n c = sorted(c)\r\n for i in range(len(c)-1,-1,-1):\r\n y += 1\r\n x -= c[i]\r\n if a[1]*(b[0]/(x)) >= a[2]:\r\n print(y)\r\n return\r\nreska()\r\n", "n, A, B = map(int, input().split())\r\ns = list(map(int, input().split()))\r\none = s[0]\r\nS = sum(s)\r\ns = s[1:]\r\ns.sort()\r\nres = one * A / S\r\ncnt = 0\r\nif res >= B:\r\n print(cnt)\r\nelse:\r\n for i in range(n-2, -1, -1):\r\n S -= s[i]\r\n res = one * A / S\r\n cnt += 1\r\n if res >= B:\r\n break\r\n print(cnt)", "meta_list = input().split()\r\nn = int(meta_list[0])\r\nA = int(meta_list[1])\r\nB = int(meta_list[2])\r\n \r\nhole_list = [*map(lambda x: int(x), input().split())]\r\n \r\ndef hole_finder(A, B, n, hole_list):\r\n volume = hole_list[0] * A\r\n new_list = hole_list[1:]\r\n new_list.sort()\r\n x = sum(hole_list)\r\n counter = 0\r\n while volume < B * x:\r\n x -= new_list.pop()\r\n print(n - len(new_list) - 1)\r\n \r\n \r\nhole_finder(A, B, n, hole_list) ", "n,A,B = map(int, input().split())\r\nL = list(map(int, input().split()))\r\na = L[0]\r\nS = sum(L)\r\nL = sorted(L[1:],reverse=True)\r\ncount = 0\r\nfor i in L:\r\n if a/S*A>=B:\r\n break\r\n else:\r\n S-=i\r\n count+=1\r\nprint(count)", "n,a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ns1 = s[1:]\r\ns1.sort()\r\nx = sum(s)\r\nwhile(a*s[0]<b*x):\r\n x-=s1.pop()\r\nprint(n - len(s1)-1)", "n, a, b = list(map(int, input().split()))\r\nholes = list(map(int, input().split()))\r\ns = sum(holes)\r\nf = holes[0]\r\ndel holes[0]\r\nholes = sorted(holes)[::-1]\r\nh = 0\r\nfor x in range(len(holes)):\r\n if f * a / s >= b:\r\n break\r\n s -= holes[x]\r\n h += 1\r\nprint(h)", "def solve(a, b, s):\r\n first = s[0]\r\n total = sum(s)\r\n s = s[1:]\r\n s.sort(reverse=True)\r\n i = 0\r\n while first * a / total < b:\r\n total -= s[i]\r\n i += 1\r\n return i\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, a, b = map(int, input().split())\r\n s = [int(x) for x in input().split()]\r\n print(solve(a, b, s))", "def solve():\r\n n, A, B = map(int, input().split())\r\n S = list(map(int, input().split()))\r\n\r\n S2 = S[1:]\r\n S2.sort()\r\n\r\n M = sum(S)\r\n count = 0\r\n for s in reversed(S2):\r\n if M <= S[0]*A/B:\r\n print(count)\r\n return\r\n M -= s\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\n\r\nn, a, b = map(int, input().split())\r\narray = list(map(int, input().split()))\r\narray = array[:1] + sorted(array[1:])\r\ntot = sum(array)\r\nwhile a * array[0] < b * tot:\r\n tot -= array.pop()\r\nprint(n - len(array))", "import heapq\r\n\r\nn, A, B = map(int, input().split())\r\n\r\nholes = list(map(int, input().split()))\r\ntmpSum = sum(holes)\r\ns1 = holes[0]\r\ndel holes[0]\r\n\r\nfor i in range(n-1):\r\n holes[i] = 0 - holes[i]\r\nheapq.heapify(holes)\r\nans = 0\r\n\r\nwhile True:\r\n if s1 * A >= B * tmpSum:\r\n break\r\n top = heapq.heappop(holes)\r\n tmpSum += top\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n,A,B=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\ns1=[]\r\ns1=l[1:]\r\ns1.sort(reverse=True)\r\nreq=(l[0]*A)//B\r\nif(req>=s):\r\n print(0)\r\nelse:\r\n c=0\r\n for i in s1:\r\n c+=1\r\n s-=i\r\n if(s<=req):\r\n print(c)\r\n break\r\n \r\n", "n,a,b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nsm = sum(s)\r\ns0 = s.pop(0)\r\ns = sorted(s)\r\nfor i in range(n):\r\n if i == 0:\r\n if a * s0 / sm >= b:\r\n print(0)\r\n break\r\n else:\r\n sm -= s[-i]\r\n if a * s0 / sm >= b:\r\n print(i)\r\n break", "#Ana Clara Lacaze\n#193858\n\nn,A,B = [int(x) for x in input().split()]\ns = [int(x) for x in input().split()]\nblockHoles = 0\nf = s[0]\nsum = sum(s)\ns.pop(0)\ns.sort(reverse=True)\n\nwhile ((A*f)/sum<B):\n sum-= s[blockHoles]\n blockHoles+= 1\nprint(blockHoles)\n \t \t\t\t \t \t\t\t\t \t \t\t\t\t\t", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\ndef main():\r\n n, x, y = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n A = A[0:1] + sorted(A[1:])\r\n for i in range(1, n):\r\n A[i] += A[i-1]\r\n #print(A)\r\n tmp = A[0] * x / y\r\n #print('tmp: %f' % (tmp))\r\n first = 0\r\n last = bisect.bisect_right(A, tmp)\r\n #print('first: %d, last: %d' % (first, last))\r\n print(n - (last - first))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\nsys.setrecursionlimit(10**5)\r\ninput=sys.stdin.readline\r\n\r\ndef gprint(t,ans=''): print(f\"Case #{t+1}:\",ans)\r\nints = lambda : list(map(int,input().split()))\r\nalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\np2 = [1]\r\n#for i in range(70):p2.append(p2[-1]*2)\r\np = 10**9+7\r\nANS=[]\r\n\r\nn,A,B = ints()\r\na = ints()\r\nx = a[0]\r\na = a[1:]\r\na.sort()\r\nS = sum(a)+x\r\ni = 0\r\n\r\nwhile True:\r\n ans = x*A/S\r\n if ans>=B:\r\n print(i)\r\n break\r\n i += 1\r\n S -= a.pop()\r\n", "if_debag = False\n\ninput_texts = \"\"\"4 80 20\n3 2 1 4\n\"\"\"\n\ninput_texts = input_texts.split('\\n')\nit = iter(input_texts)\n\ndef my_input():\n if if_debag:\n return next(it)\n else:\n return input()\n\nn, A, B = my_input().split()\nn = int(n)\nA = int(A)\nB = int(B)\n\nss0 = [int(s) for s in my_input().split()]\nss1 = sorted(ss0[1:], key=lambda s:s, reverse=False)\n\ndef ss(i):\n if i == 0:\n return ss0[0]\n else:\n return ss1[i - 1]\n\nssss = 0\nsss = []\nfor i in range(n):\n ssss += ss(i)\n sss.append(ssss)\nans = 0\nfor i in range(n):\n flow = ss0[0] * A / sss[n - i - 1]\n if flow >= B:\n ans = i\n break\n ans +- 1\nprint(ans)", "n,a,b=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nans=x[0]*a/b\r\nif len(x)==1:\r\n print(0)\r\nelse:\r\n l=x[1:]\r\n l.sort(reverse=True)\r\n a,su=0,0\r\n for i in l:\r\n su+=i\r\n su+=x[0]\r\n if(ans>=su):\r\n print(0)\r\n else:\r\n for i in range(len(l)):\r\n su-=l[i]\r\n a+=1\r\n if(ans>=su):\r\n break\r\n print(a)", "n, A, B = input().split(' ')\nn, A, B = int(n), int(A), int(B)\ns = [int(i) for i in input().split(' ')]\nnum = sum(s)\nfirst = s[0]\nafter = s[1:]\nafter.sort()\nrst = 0\nptr = len(after) - 1\nwhile first / num < B / A:\n num -= after[ptr]\n ptr -= 1\n rst += 1\nprint(rst)\n# print(after)\n", "n, A, B = [int(x) for x in str(input()).split(\" \")]\ns = [int(x) for x in str(input()).split(\" \")]\nS = sum(s)\ns1 = s[0]\ns = s[1:]\ns.sort(reverse=True)\n\nc = 0\ni = 0\nwhile (A * s1) / S < B and i < len(s):\n S -= s[i]\n c += 1\n i += 1\n\nprint(c)\n\t\t \t \t\t \t\t \t\t\t \t\t\t \t\t\t\t", "n, A, B = map(int, input().split())\na = list(map(int, input().split()))\nother_holes = sorted(a[1:], reverse=True)\nS = sum(a)\nfor i in range(n):\n if i > 0:\n S -= other_holes[i - 1]\n if a[0] / S * A >= B:\n print(i)\n break", "I=lambda:map(int,input().split())\r\nn,a,b=I()\r\nx,*s=I()\r\ns=sorted(s)[::-1]\r\nS=x+sum(s)\r\nfor i in range(n):\r\n if i:S-=s[i-1]\r\n if x*a>=S*b:break\r\nprint(i)\r\n", "n, a, b = map(int, input().split())\ns = [int(i) for i in input().split()]\ny = s[0]\ns = s[1:]\ns.sort()\nm = [y]\nfor i in s:\n m.append(m[-1]+i)\nfor i in range(n):\n if b*m[-1-i] <= a*m[0]:\n print(i)\n break", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ntotal = sum(arr)\r\nfirst = arr[0]\r\n\r\narr = [arr[0]] + sorted(arr[1:])\r\ncount = 0\r\n\r\nfor i in range(n-1, 0, -1):\r\n if first * a / total >= b:\r\n break \r\n\r\n total -= arr[i]\r\n count += 1\r\n\r\nprint(count)", "import sys\r\nimport math\r\nimport collections\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nn, a, b = ints()\r\nd = ints()\r\nx = d[0]\r\nd = d[1:]\r\nd.sort()\r\nsm = sum(d) + x\r\nwhile (x * a) / sm < b:\r\n sm -= d[-1]\r\n d.pop()\r\nprint((n - 1) - len(d))", "n, a, b = map(int, input().split())\r\noutput = []\r\ns = 0\r\nx = list(map(int, input().split()))\r\nfor i in x:\r\n s += i\r\n output.append(i)\r\ns1 = output[0]\r\noutput[0] = 0\r\noutput.sort()\r\ncount = 0\r\nwhile(s1*a < b*s):\r\n s -= output.pop()\r\n count+=1\r\nprint(count)", "import sys \r\ninput = sys.stdin.readline\r\n\r\n#Continuously cover the next largest hole until we have at least B liters of water coming through\r\ndef Solve(n,A,B,s):\r\n\r\n #Sum of all hole sizes\r\n S = sum(s)\r\n #Size of first hole\r\n s0 = s[0]\r\n\r\n # No need to block any holes\r\n if A * (s0/S) >= B:\r\n return 0\r\n\r\n #Sort by hole size from largest to smallest\r\n s = sorted(((size, idx) for (idx, size) in enumerate(s)), reverse=True)\r\n\r\n #Keep covering holes until we have at least B liters of water flowing out of first hole\r\n count = 0\r\n for i in range(len(s)):\r\n size, idx = s[i]\r\n\r\n #Can't block first hole\r\n if idx == 0:\r\n continue\r\n\r\n S -= size\r\n count += 1\r\n\r\n if A*(s0/S) >= B:\r\n return count \r\n\r\n #Should never happen since B <= A\r\n return -1 \r\n\r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n,A,B = map(int,input().split())\r\n s = list(map(int,input().split()))\r\n print(Solve(n,A,B,s))", "n, A, B = map(int, input().split())\n\nx, *holes = (map(int, input().split()))\nS = x + sum(holes)\nholes.sort(reverse=True)\n\nfor i in range(n):\n if x*A >= B*S:\n break\n else:\n S -= holes[i]\nprint(i)\n", "nh,totl,finl=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\ncount=0\r\nfl=0\r\nnewl=l[1:]\r\nk=0\r\nsumm=l[0]+sum(newl)\r\nnewl=sorted(newl,reverse=True)\r\nwhile(True):\r\n ans=(totl*l[0])/summ\r\n if(ans>=finl):\r\n break\r\n else: \r\n summ=summ-newl[k]\r\n count+=1\r\n k+=1\r\nprint(count) \r\n", "n,a,b=map(int,input().split())\r\nc = list(map(int,input().split()))\r\ns = c[0]\r\ns_t = c[0]*a//b\r\nd = sorted(c[1:])\r\ncount = 0\r\n#print(d,s_t)\r\nfor i in range(n-1):\r\n s+=d[i]\r\n if s==s_t:\r\n count+=1\r\n break\r\n elif s>s_t:\r\n break\r\n count+=1\r\nprint(n-1-count)", "i=input().split(' ')\nn=int(i[0])\na=int(i[1])\nb=int(i[2])\ni=input().split(' ')\narr=list(map(int, i))\nq = arr[0]\narr = sorted(arr[1:], reverse=True)\ns = sum(arr) + q\ni = 0\nwhile i<n-1 and q*a/s<b:\n s -= arr[i]\n i += 1\n\nprint(i)", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=sum(l)\r\nl1=l[1:]\r\nl1.sort()\r\nwhile a*l[0]/x<b : \r\n x-=l1.pop() \r\nprint(n-len(l1)-1)", "n, A, B = [int(x) for x in input().split()]\nsizes = [int(x) for x in input().split()]\n\ntotal = sum(sizes)\nfirst = sizes.pop(0)\n\nsorted_sizes = sorted(sizes)\nsize = len(sizes)\n\naux = 0\ncount = 0\n\nwhile(True):\n result = first*A/(total - aux)\n if (result < B):\n aux += sorted_sizes[size - count - 1]\n count += 1\n else:\n print(count)\n break\n \t \t \t \t \t \t\t \t\t\t\t \t \t\t", "n, a, b = list(map(int, input().split()))\ns = list(map(int, input().split()))\n\nholes = sorted(s[1:])\nholes = holes[::-1]\nf = a*s[0]\nsum_hole = sum(s)\nflow = f/sum_hole\n\ncount = 0\nflag = 0\nfor h in holes:\n if flow >= b:\n print(count)\n flag =1\n break\n else:\n sum_hole -= h\n flow = f/sum_hole\n count += 1\n \nif not flag:\n print(count)\n\t \t \t \t\t\t \t\t\t \t \t \t\t", "n, A, B = list(map(int,input().split()))\r\nC = list(map(int,input().split()))\r\ns = C[0]\r\nC = C[1:]\r\nC.sort(reverse=True)\r\nS = sum(C) + s\r\nfor i in range(0,n):\r\n if B <= s*A/S:\r\n print(i)\r\n break\r\n S -= C[i]\r\n\r\n ", "n, a, b = map(int, input().split())\ns = list(map(int, input().split()))\n\ns[1:n] = sorted(s[1:n])\nso = sum(s)\nc = 0\n\nfor i in range(n - 1, -1, -1):\n if (s[0] * a) / so < b:\n c += 1\n so -= s[i]\n else:\n print(c)\n break\n\n\t \t\t\t \t \t \t \t\t \t \t\t \t\t", "n,a,b=map(int, input().split())\ns = list(map(int , input().split()))\n\ns0=s[0]\ns1=s[1:]\ns1.sort()\ncount = 0\nsum = sum(s)\n \nwhile s0*a/sum < b:\n sum-=s1.pop()\n count+=1\n\nprint(count)\n\n \t\t \t\t\t \t\t\t\t\t\t \t\t \t\t\t\t\t \t\t \t", "import bisect\r\ndef howmanytodrop(n,A,B,first,rest):\r\n rest = list(reversed(sorted(rest)))\r\n thresholds = [0]\r\n count = 0\r\n for item in rest:\r\n count += item\r\n thresholds.append(count)\r\n target = sum(rest) + first - (A*first / B)\r\n return bisect.bisect_left(thresholds,target)\r\n\r\nn,A,B = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nfirst = l[0]\r\nrest = l[1:]\r\nprint(howmanytodrop(n,A,B,first,rest))", "n, a, b = [int(i) for i in input().strip().split()]\ns = [int(i) for i in input().strip().split()]\ntotal = sum(s)\nsi = s[0]\ns = s[1:]\ns = sorted(s, reverse=True)\nfound = False\nfor i in range(n-1):\n if (a * si) / total >= b:\n print(i)\n found = True\n break\n total -= s[i]\n\nif not found:\n print(n-1)\n\n\n \t \t \t \t \t \t \t\t\t\t \t \t\t\t", "n,A,B=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\n#print(\"sum\",s)\r\ncnt=1\r\nakash=l[0]\r\nif (l[0]*A)//s>=B:\r\n print(0)\r\nelse:\r\n l.pop(0)\r\n l.sort(reverse=True)\r\n i=1\r\n curr_sum=s-l[0]\r\n while not ((akash*A)//curr_sum>=B):\r\n cnt+=1\r\n curr_sum-=l[i]\r\n i+=1\r\n print(cnt)\r\n", "#Watering system\r\nn, A, B = [int(w) for w in input().split()]\r\ns = [int(w) for w in input().split()]\r\nSt = sum(s)\r\ns1, *s = s\r\ns.sort()\r\ns.reverse()\r\nn = 0\r\nwhile St*B > s1*A:\r\n St -= s[n]\r\n n += 1\r\nprint(n)", "(n,a,b) = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nl = []\r\nfor i in range(1,n):\r\n l.append(s[i])\r\ns1 = s[0]\r\nl.sort()\r\ns_block = 0\r\nfor i in s:\r\n s_block+=i\r\ns_block -= (s1*a/b)\r\nans = 0\r\nc = 0\r\nj = len(l)-1\r\nwhile j>=0 and ans<s_block:\r\n ans+=l[j]\r\n c+=1\r\n j-=1\r\nprint(c)\r\n \r\n", "# prottoyfuad\r\n\r\nn, a, b = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nfirst = ar[0];\r\ntot = sum(ar)\r\nar = sorted(ar[1 : ], reverse = True)\r\ncnt = 0\r\nif ((first * a) // tot) < b :\r\n for i in range(n-1) :\r\n \tcnt += 1\r\n \ttot -= ar[i]\r\n \tif ((first * a) // tot) >= b :\r\n \t\tbreak\r\nprint(cnt)\r\n", "n,A,B=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nf=s[0]\r\nt=sum(s)\r\ns.pop(0)\r\ns.sort(reverse=True)\r\ni=0\r\nwhile A*f/t<B:\r\n t-=s[i]\r\n i+=1\r\nprint(i)", "import sys\r\nimport math\r\nimport bisect\r\nfrom math import ceil\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, a, b = rinput()\r\ns = get_list()\r\n\r\nsi = s.pop(0)\r\nS = si*a/b\r\n\r\ns.sort(reverse = True)\r\ncnt = 0\r\nsu = sum(s) + si\r\ni = 0\r\n\r\n# print(su, S)\r\n\r\nwhile(i<n and su>S):\r\n\tsu -= s[i]\r\n\tcnt += 1\r\n\ti += 1\r\n\r\nprint(cnt)\t", "n, a, b = [int(x) for x in input().split(\" \")]\n\ndata = [int(x) for x in input().split(\" \")]\n\ns = sum(data)\n\nfirst = data.pop(0)\n\n\nif (first * a) / s >= b:\n print(0)\nelse:\n\n data.sort()\n\n s -= data.pop()\n\n c = 1\n while (first * a) / s < b:\n s -= data.pop()\n c += 1\n\n print(c)", "n, a, b = [int(s) for s in input().split()]\r\nss = [int(s) for s in input().split()]\r\nxs = sorted(ss[1:], reverse=True)\r\ns = sum(ss)\r\ni = 0\r\nwhile ss[0] * a < b * s:\r\n s -= xs[i]\r\n i += 1\r\nprint(i)\r\n", "import sys, copy\r\n\r\nn ,a, b = map(int, sys.stdin.readline().split())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nres = [0] + arr[1:]\r\nres.sort()\r\npf = [0] * n\r\npf[0] = arr[0]\r\nfor i in range(1, n):\r\n pf[i] = pf[i - 1] + res[i]\r\ncnt = 0\r\nfor i in range(n - 1, -1, -1):\r\n if arr[0] * a / pf[i] >= b:\r\n print(cnt)\r\n break\r\n cnt += 1", "n,a,b=[int(x) for x in input().split()]\r\ns=list(map(int,input().split()))\r\nt=sum(s)\r\nk=0\r\nr=sorted(s[1:])\r\nfor i in range(n-1):\r\n\tif (s[0]*a)//t<b:\r\n\t\tt-=r[n-i-2]\r\n\t\tk+=1\r\nprint(k)", "n, a, b = map(int, input().split(' '))\r\ns = list(map(int, input().split(' ')))\r\ns0 = s.pop(0)\r\nsm = sum(s) + s0\r\ns.sort(reverse=True)\r\nif (a * s0) / sm >= b:\r\n print(0)\r\nelse:\r\n for i in range(n - 1):\r\n sm -= s.pop(0)\r\n if (a * s0) / sm >= b:\r\n print(i + 1)\r\n break", "n, a, b = map(int, input().split())\r\n\r\ns = list(map(int, input().split()))\r\n\r\nsu = sum(s)\r\n\r\ns1 = s[1:]\r\n\r\ns1.sort()\r\n\r\nc = 0\r\na = a * s[0]\r\n\r\nwhile a / su < b:\r\n su -= s1[n-2-c]\r\n c += 1\r\nprint(c)\r\n", "n, a, b = tuple(map(int, input().split()))\r\nholes = list(map(int, input().split()))\r\ns = sum(holes)\r\n\r\n\r\nfor index, size in enumerate(sorted(holes[1:], reverse=True), start=1):\r\n if holes[0] * a / s >= b:\r\n print(index - 1)\r\n break\r\n s -= size\r\nelse:\r\n print(n - 1)", "n,a,b=tuple(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\np=arr[0]\r\narr.remove(p)\r\nx=(p*a)/b\r\nx-=p\r\ncount=1\r\narr.sort()\r\ni=0\r\nwhile x>0 and i<n-1:\r\n\tx-=arr[i]\r\n\tcount+=1\r\n\ti+=1\r\nif x>0:\r\n\tres=n\r\nelif x==0:\r\n\tres=count\r\nelse :\r\n\tres=count-1\r\nprint(n-res)\r\n", "n,a,b=map(int,input().split())\r\nl1=[int(a) for a in input().split()]\r\nl1=[l1[0]]+sorted(l1[1:])\r\nsm=float(sum(l1))\r\nan1=l1[0]/b*a\r\nctr=0\r\nfor i in range(n-1,-1,-1):\r\n if l1[0]/sm*a>=b:\r\n break\r\n else:\r\n sm-=l1[i]\r\nprint(n-i-1)\r\n", "def run():\r\n n, a, b = [int(x) for x in input().split()]\r\n d = [int(x) for x in input().split()]\r\n\r\n main = d[0]\r\n other = d[1:]\r\n other.sort()\r\n ans = n-1\r\n s = main\r\n for x in other:\r\n if main * a < b * (s+x):\r\n print(ans)\r\n return\r\n s += x\r\n ans -= 1\r\n print(0)\r\n\r\n\r\nrun()", "n,a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nma=sum(s)\r\nss=s[0]\r\ns.pop(0)\r\ns.sort()\r\nt=0\r\nfor i in range(len(s)-1,-1,-1):\r\n if ss*a/ma>=b:\r\n break\r\n ma-=s[i]\r\n t+=1\r\nprint(t)\r\n\r\n\r\n\r\n\r\n \r\n##//////////////// ////// /////// // /////// // // //\r\n##//// // /// /// /// /// // /// /// //// //\r\n##//// //// /// /// /// /// // ///////// //// ///////\r\n##//// ///// /// /// /// /// // /// /// //// // //\r\n##////////////// /////////// /////////// ////// /// /// // // // //\r\n\r\n\r\n\r\n", "n,a,b=map(int,input().split())\r\nx=[int(x) for x in input().split()]\r\np=x[0]\r\nd=sum(x)\r\nx.remove(x[0])\r\nc=0\r\nx.sort(reverse=True)\r\n\r\nfor i in x:\r\n if((a*p)/d>=b):\r\n break\r\n else:\r\n d-=i\r\n c+=1\r\nprint(c)", "# -*- coding: utf-8 -*-\n\nn, A, B = [int(x) for x in input().split()]\n\nholes = [int(x) for x in input().split()]\ntotal = sum(holes)\n\nfirst = holes[0]\nholes = holes[1:]\n\nholes.sort(reverse=True)\nans = 0\n\nfor hole in holes:\n if A * first / total >= B:\n break\n\n total -= hole\n ans += 1\n\nprint(ans)\n\t\t \t \t\t\t \t\t \t\t\t \t \t\t", "n,a,b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns = [s[0]] + list(sorted(s[1:]))\r\nz = (s[0]*a)/b\r\nsm = sum(s)\r\ni = n-1\r\nwhile i > 0 and sm > z:\r\n sm-=s[i]\r\n i -= 1\r\nprint(n-i-1)\r\n", "def _input():\r\n return map(int, input().strip().split())\r\ndef _print(s):\r\n print(''.join(map(str, s)))\r\n\r\nn, A, B = _input()\r\ns = list(_input())\r\nr = list(s[1:])\r\nr.sort(reverse=True)\r\ntot = sum(s)\r\nif s[0] * A >= B * tot:\r\n print(0)\r\n exit(0)\r\n\r\ncur = tot\r\nfor i in range(len(r)):\r\n cur -= r[i]\r\n if s[0] * A >= B * cur:\r\n print(i + 1)\r\n exit(0)\r\n", "def f(l1,l2):\r\n n,a,b = l1\r\n s = sum(l2)\r\n l = l2[1:]\r\n l.sort(reverse=True)\r\n i = 0\r\n while b*s>l2[0]*a:\r\n s -= l[i]\r\n i += 1\r\n return i\r\n\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nprint(f(l1,l2))\r\n", "n,a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx1=x[1:]\r\nx1.sort()\r\n\r\ny=sum(x)\r\n\r\nwhile(a*x[0]<b*y):\r\n y-=x1.pop()\r\nprint(n-len(x1)-1)\r\n\r\n", "import math\r\nimport sys\r\nfrom collections import *\r\nfrom bisect import bisect_left, bisect_right\r\n \r\n \r\n \r\ndef cint() : return list(map(int, sys.stdin.readline().strip().split()))\r\ndef cstr() : return list(map(str, input().split(' '))) \r\n \r\n\r\n \r\ndef solve():\r\n n,a,b = cint()\r\n lst = cint()\r\n first = lst.pop(0)\r\n lst.sort()\r\n summ = sum(lst) + first\r\n\r\n counter = 0\r\n while (first/summ)*a < b:\r\n summ -= lst.pop()\r\n counter +=1\r\n\r\n print(counter)\r\n \r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n \r\n while t!=0:\r\n solve()\r\n t-=1", "n,a,b=map(int,input().split())\r\nli=list(map(int,input().split()))\r\ns=sum(li)\r\nfh = li[0]\r\nli.remove(li[0])\r\nli.sort()\r\nli=li[::-1]\r\n\r\ncount=0\r\n\r\nif fh*a/s < b:\r\n\ti=0\r\n\twhile fh*a/s < b:\r\n\t\ts-=li[i]\r\n\t\ti+=1\r\n\t\tcount+=1\r\nprint(count)\r\n", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\ni=0\r\nx=l[0]\r\nj=0\r\nif (a*l[0])/s>=b:\r\n print(0)\r\nelse:\r\n l=l[1:]\r\n l.sort()\r\n l.reverse()\r\n while ((b*s)>(a*x)) and j<n-1:\r\n s=s-l[j]\r\n j+=1\r\n print(j)\r\n", "\ninput_list = input().split();\nn = int(input_list[0]);\nA = int(input_list[1]);\nB = int(input_list[2]);\n\njk= input().split();\n\nlist1=[int(s) for s in jk];\n \nsi = list1[0];\nlist1.remove(list1[0]);\n\nlist1.sort();\ncnt = 0;\n\nS = si;\nnum = n-2;\n\nfor it in list1: \n S +=it;\nwhile num>=0:\n temp = si*A/S;\n if(temp>=B):\n break;\n cnt = cnt+1;\n S = S - list1[num];\n num = num-1;\n\nprint(cnt);\n \n", "import sys,math\r\nn,A,B=map(int,sys.stdin.readline().split())\r\nl=list(map(int,sys.stdin.readline().split()))\r\ns1=l[0]\r\nsumall=l[0]\r\nx=l[1:]\r\nx.sort()\r\n# print(x)\r\ntaken=0\r\nfor i in range(n):\r\n if i!=0:\r\n sumall+=x[i-1]\r\n if (s1*A)/sumall>=B:\r\n taken+=1\r\n else:break\r\nprint(n-taken)\r\n\r\n", "n, A, B = list(map(int, input().split()))\ns = list(map(int, input().split()))\n\nholes = sorted(s[1:])\nholes.reverse()\n\nt = sum(holes)\nif (t + s[0]) * B <= s[0] * A:\n\tprint(0)\n\texit(0)\n\nfor i in range(n - 1):\n\tt -= holes[i]\n\tif (t + s[0]) * B <= s[0] * A:\n\t\tprint(i + 1)\n\t\texit(0)", "n,A,B=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nrequired=arr[0]*A/B\r\nsumm=arr[0]\r\ndel arr[0]\r\narr.sort(reverse=True)\r\nsumm+=sum(arr)\r\ncount=0\r\nwhile summ>required and count<len(arr):\r\n summ-=arr[count]\r\n count+=1 \r\nprint(count)", "n , s , a = map(int , input().split())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\n\r\nt = sum(arr)\r\n\r\nf= arr[0]\r\narr = arr[1:]\r\narr.sort(reverse = True)\r\n\r\n\r\nc = 0\r\n\r\nfor i in range(n-1):\r\n if (f * s)/t >= a: break\r\n t -= arr[i]\r\n c += 1\r\n\r\nprint(c)\r\n\r\n\r\n\r\n", "n, A, B = (int(x) for x in input().split())\r\ns = [int(x) for x in input().split()]\r\nml = sum(s) - (A*s[0]) / B\r\ns.pop(0)\r\ns = sorted(s,reverse = True)\r\nsu,cnt = 0, 0\r\nfor x in s:\r\n if su >= ml: break\r\n su += x\r\n cnt += 1\r\nprint(cnt)", "n, a, b = map(int, input().split())\nhole_sizes = list(map(int, input().split()))\n\nf = hole_sizes[0]\ns = sum(hole_sizes)\nst = sorted(hole_sizes[1:], reverse=True)\nans = 0\n\nwhile a * f < b * s:\n s -= st[ans]\n ans += 1\n\nprint(ans)\n\n \t \t\t\t \t\t \t\t\t\t\t \t\t \t \t\t\t\t", "n,a,b=map(int,input().split())\r\nif n==1:\r\n\tprint('0')\r\n\texit()\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nz=sorted(l[1:],reverse=True)\r\nfor i in range(n-1):\r\n\tif l[0]*a/s>=b:\r\n\t\tprint(i)\r\n\t\texit()\r\n\ts-=z[i]\r\nprint(i+1)", "n,a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nc,h,j = sum(s),0,0\r\nk = s[1:]\r\nk.sort(reverse=True)\r\nfor i in k:\r\n\tif ((a*s[0])/c)>=b:\r\n\t\tbreak\r\n\tc-=i\r\n\tj+=1\r\nprint(j)", "n, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\ns, x, c = sum(l), l.pop(0), 0\r\nl.sort()\r\n\r\nwhile (x * a) / s < b:\r\n\ts -= l.pop()\r\n\tc += 1\r\n\t\r\nprint(c)", "def main():\n x = input().split()\n n = int(x[0])\n a = int(x[1])\n b = int(x[2])\n percnt = b/a\n arr = [int(i) for i in input().split()]\n first = arr[0]\n vazao = first\n holes = sorted(arr[1:])\n for i in range(len(holes)):\n vazao += holes[i]\n i = n-2\n nholes = 0\n while((first/vazao) < percnt):\n vazao -= holes[i]\n i -= 1\n nholes += 1\n print(nholes)\n\nmain()\n \t \t\t \t \t \t\t \t \t\t\t \t\t", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nq=l[0]\r\nl.pop(0)\r\nl=sorted(l)[::-1]\r\ns=sum(l)+q\r\ncount=0\r\n\r\nwhile True:\r\n\tf=(q*a)/s\r\n\tif(f>=b):\r\n\t\tprint(count)\r\n\t\texit()\r\n\tcount+=1\r\n\ts-=l[count-1]\r\n\tif(count>n+1):\r\n\t\tprint(n-1)\r\n\t\texit()\r\n\r\nprint()", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n sum+=l[i]\r\nv=(l[0]*a)/sum\r\ncons=l[0]*a\r\nc=0\r\nif(v>=b):\r\n print(c)\r\nelse:\r\n l.pop(0)\r\n l.sort(reverse=True)\r\n # print(*l)\r\n while(True):\r\n sum-=l[c]\r\n if(cons/sum >=b):\r\n print(c+1)\r\n break\r\n else:\r\n c+=1" ]

[ "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\na.sort()\r\nif m==n:\r\n print(sum(a))\r\nif m<n:\r\n print(sum(a[0:m]))\r\nif m>n:\r\n print(sum(a)-d*(m-n))", "n, d = map(int, input().split())\r\nhooks = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nhooks.sort()\r\n\r\nprofit = 0\r\nfor i in range(m):\r\n if i < n:\r\n profit += hooks[i]\r\n else:\r\n profit -= d\r\n\r\nprint(profit)", "I = lambda:map(int,input().split())\r\nn, d = I()\r\na = sorted(I())+[-d]*99\r\nprint(sum(a[:next(I())]))", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=int(input())\r\ncol_rub=0\r\nif n<m:\r\n col_rub-=(m-n)*d\r\n col_rub+=sum(a)\r\n\r\nelse:\r\n col_rub+=sum(a[:m])\r\nprint(col_rub)", "n = [*map(int, input().split())]\r\nlst = [*map(int, input().split())]\r\nm= int(input())\r\nx=0\r\ny=0\r\nif m>=n[0]:\r\n x=sum(lst)\r\n y = (m - n[0] )* n[1]\r\n\r\nelse:\r\n lst.sort()\r\n x=sum(lst[0:m-n[0]])\r\n\r\nprint(x-y)\r\n\r\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\n\r\n# sort hooks by cost\r\nhooks = sorted(enumerate(a, start=1), key=lambda x: x[1])\r\n\r\nprofit = 0\r\nfor i in range(m):\r\n if i < n:\r\n # guest takes a hook\r\n profit += hooks[i][1]\r\n else:\r\n # no available hooks, pay fine\r\n profit -= d\r\n\r\nprint(profit)\r\n", "n, d = [*map(int, input().split())]\r\nlst = [*map(int, input().split())]\r\nm = int(input())\r\nx, y = 0, 0\r\n\r\nif m >= n:\r\n x = sum(lst)\r\n y = (m - n ) * d\r\nelse:\r\n lst.sort()\r\n x = sum(lst[:m - n])\r\n\r\nprint(x - y)", "n,d = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\n\r\nsort = sorted(arr)\r\n# print(sort[:49])\r\nsm= sum(arr)\r\n# fd = \r\n# print(sm)\r\nln = m-n\r\nnp = ln*d\r\n# print(np)\r\n# print(sm-np)\r\nif m<=n:\r\n\tprint(sum(sort[:m]))\r\nelse:\r\n\tprint(sm-np)", "n, d = [int(i) for i in input().split(' ')]\r\na = [int(i) for i in input().split(' ')]\r\nm = int(input())\r\nreward = 0\r\n# сортируем крючки по стоимости\r\n\r\na.sort()\r\n# идут гости и занимают крючки\r\nfor i in range(m):\r\n if len(a) > 0:\r\n reward += a.pop(0)\r\n else:\r\n reward -= d\r\n\r\nprint(reward)\r\n", "t , d = list(map(int , input().split()))\r\na = list(map(int , input().split()))\r\nn = int(input())\r\n\r\nif(len(a) == n):\r\n print(sum(a))\r\nelif(n > len(a)):\r\n res = n - len(a)\r\n res2 = sum(a) - res*d\r\n print(res2)\r\nelif(len(a) > n):\r\n a = sorted(a)\r\n \r\n res = a[0 : n]\r\n print(sum(res))", "d = int(input().split()[1])\r\ns = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nif m > len(s):\r\n print(sum(s)-d*(m-len(s)))\r\nelse:\r\n print(sum(s[:m]))", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nm = int(input())\r\n\r\nf = min(0, (n - m) * d)\r\n\r\nprint(sum(sorted(l)[:m]) + f)", "I=lambda:map(int,input().split())\r\nn,d=I()\r\na=sorted(I())+[-d]*99\r\nprint(sum(a[:next(I())]))", "# https://codeforces.com/contest/368\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, d = map(int, input().split())\na = list(map(int, input().split()))\nm = int(input())\n\nif m >= n:\n ans = sum(a) - (m - n) * d\nelse:\n a.sort()\n ans = sum(a[:m])\n\nprint(ans)\n", "n, d = (int(i) for i in input().split())\na = sorted(int(i) for i in input().split())\nm = int(input())\nres = sum(a[:min(n, m)]) - max(0, m - n) * d\nprint(res)\n" ]

[ "\r\n\r\nn = int(input())\r\n\r\nW = 0\r\npers = []\r\nH1 = 0; H2 = 0\r\nI = 0\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n pers.append([w,h])\r\n W += w\r\n\r\n if h > H2:\r\n H2 = h\r\n I = i\r\n\r\nfor i in range(n):\r\n if i == I:\r\n continue\r\n w, h = pers[i]\r\n\r\n if H2 >= h > H1:\r\n H1 = h\r\n\r\nfor i in range(0, n):\r\n if i == I:\r\n print((W-pers[i][0])*H1, end = \" \")\r\n else:\r\n print((W-pers[i][0])*H2, end = \" \")\r\n", "st=int(input())\r\nsumma=0\r\nq=[]\r\nw=[]\r\nish=[]\r\nfor i in range(st):\r\n z,x=map(int,input().split())\r\n q.append(z)\r\n w.append(x)\r\n ish.append(x)\r\nsumma=sum(q)\r\nw.sort()\r\nfor i in range(st):\r\n qw=w[st-1]\r\n if ish[i]==qw:\r\n qw=w[st-2]\r\n print((summa-q[i])*qw,end=' ')", "n = int(input())\r\nW = 0\r\nh1 = [0] * (n + 2)\r\nh = [0] * (n + 2)\r\nw = [0] * (n + 2)\r\nfor i in range(1, n + 1):\r\n w[i], h[i] = map(int, input().split())\r\n W += w[i]\r\n h1[i] = max(h[i], h1[i - 1])\r\nh2 = [0] * (n + 2)\r\nfor i in range(n, 0, -1):\r\n h2[i] = max(h[i], h2[i + 1])\r\nprint(' '.join([str((W - w[i]) * max(h1[i - 1], h2[i + 1])) for i in range(1, n + 1)]))\r\n", "def main():\n n = int(input())\n height = [] \n width = []\n for i in range(n):\n a, b = map(int, input().split())\n width.append(a)\n height.append(b)\n s_w = sum(width)\n m_h = max(height)\n a = height.index(m_h)\n height[a] = 0\n s_m = max(height)\n height[a] = m_h\n for i in range(n):\n if height[i] != m_h:\n print((s_w -width[i]) * m_h, end=' ')\n else:\n print(s_m * (s_w -width[i]), end=' ')\nmain()", "n = int(input())\r\nw = []\r\nh = []\r\nfor i in range(n):\r\n wi,hi = list(map(int,input().split()))\r\n w.append(wi)\r\n h.append(hi)\r\nW = 0\r\nH = -1\r\nH2 = -1\r\nfor i in range(n):\r\n W += w[i]\r\n if h[i] > H:\r\n H = h[i]\r\nif h.count(H) > 1:\r\n H2 = H\r\nelse:\r\n for i in range(n):\r\n if h[i] > H2 and not h[i] == H:\r\n H2 = h[i]\r\nsum = []\r\nfor i in range(n):\r\n x = W - w[i]\r\n y = 0\r\n if h[i] == H:\r\n y = H2\r\n else:\r\n y = H\r\n sum.append(x*y)\r\nprint(*sum)\r\n", "n = int(input())\r\nw = [0] * n\r\nh = [0] * n\r\nfor i in range(n):\r\n w[i], h[i] = map(int, input().split())\r\n\r\nsum_w = sum(w)\r\nmax_h = max(h)\r\n\r\nmax_count = sum(map(lambda o: int(o == max_h), h))\r\n\r\nif max_count > 1:\r\n ans = map(lambda o: (sum_w - w[o]) * max_h, range(n))\r\nelse:\r\n max_h2 = max(filter(lambda o: o != max_h, h))\r\n ans = map(lambda o: (sum_w - w[o]) * (max_h2 if h[o] == max_h else max_h), range(n))\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "n = int(input())\r\nwidth = []\r\nheigth = []\r\nsumw = 0\r\nh1, h2 = 0, 0\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n width.append(w)\r\n heigth.append(h)\r\n sumw += w\r\n if h > h1:\r\n h2 = h1\r\n h1 = h\r\n elif h > h2:\r\n h2 = h\r\nfor i in range(n):\r\n if heigth[i] != h1:\r\n print((sumw - width[i]) * h1, end=' ')\r\n else:\r\n print((sumw - width[i]) * h2, end=' ')", "W = []\r\nH = []\r\nfor h in range(int(input())):\r\n w, h = map(int, input().strip().split())\r\n W.append(w)\r\n H.append(h)\r\n\r\nfirst, second = 0, min('inf')\r\nfor i in H:\r\n if i > first:\r\n second = first\r\n first = i\r\n elif i > second:\r\n second = i\r\n\r\nans = []\r\nsumW = sum(W)\r\nfor i in range(len(H)):\r\n if H[i] == first:\r\n ans.append(second*(sumW-W[i]))\r\n else:\r\n ans.append(first*(sumW-W[i]))\r\nprint(*ans)", "n=int(input())\na=[list(map(int,input().split())) for _ in range(n)]\nx,y=[a[0]],[a[-1]]\nfor i in range(1,n):\n x.append([x[-1][0]+a[i][0], max(x[-1][1],a[i][1])])\n y.append([y[-1][0]+a[n-i-1][0], max(y[-1][1],a[n-i-1][1])])\nfor i in range(n):\n if i==0:\n print(y[n-i-2][0]*y[n-i-2][1], end=' ')\n elif i==n-1:\n print(x[i-1][0]*x[i-1][1],end=' ')\n else:\n print((x[i-1][0]+y[n-i-2][0])*max(x[i-1][1],y[n-i-2][1]), end=' ')", "n = int(input())\r\nwidth = 0\r\nheight1 = 0\r\nheight2 = 0\r\narr = []\r\nfor _ in range(n):\r\n w, h = map(int, input().split())\r\n width += w\r\n if h >= height1:\r\n height2 = height1\r\n height1 = h\r\n elif h > height2:\r\n height2 = h\r\n arr.append((h, w))\r\n \r\nfor i in arr:\r\n a, b = i\r\n if a == height1:\r\n print(height2 * (width - b), end=\" \")\r\n else:\r\n print(height1 * (width - b), end=\" \")\r\n ", "z,zz=input,lambda:list(map(int,z().split()))\r\nfast=lambda:stdin.readline().strip()\r\nzzz=lambda:[int(i) for i in fast().split()]\r\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\r\nfrom string import *\r\nfrom re 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 bisect import bisect_left as bsl\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) or x==0:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=1\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\ndef output(answer):\r\n stdout.write(str(answer))\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n If you Know me , Then you probably don't know me !\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\nnum=int(z())\r\n\r\nlst_x=[0]*num\r\nlst_y=[0]*num\r\n\r\ns=0\r\nfor i in range(num):\r\n x,y=zzz()\r\n s+=x\r\n lst_x[i]=(x)\r\n lst_y[i]=(y)\r\nlst=lst_y \r\nlst_y=sorted(lst_y)\r\n\r\nans=[]\r\n\r\nfor i,j in zip(lst_x,lst):\r\n w=s-i\r\n h=lst_y[-1]\r\n if h==j:h=lst_y[-2]\r\n print(w*h,)\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nw = [0] * (n)\r\nh = [0] * (n)\r\nfor i in range(n):\r\n w[i], h[i] = map(int, input().split())\r\ns = sum(w)\r\ntemp = sorted(h)\r\nm1, m2 = temp[-1], temp[-2]\r\nfor i in range(n):\r\n a = s - w[i]\r\n b = m1\r\n if h[i] == m1:\r\n b = m2\r\n print(a*b, end=' ')", "s=[]\r\nhh=[]\r\nsum_of_W=0\r\nh1=-100\r\nh2=-100\r\nn=int(input())\r\nfor _ in range(n):\r\n w,h=map(int,input().split())\r\n hh.append(h) \r\n h2=max(h2,h)\r\n h1,h2=max(h2,h1),min(h2,h1)\r\n sum_of_W+=w\r\n s.append(w)\r\nans=[]\r\nfor i in range(n):\r\n W=sum_of_W-s[i]\r\n if hh[i]==h1:\r\n ans.append(W*h2)\r\n else:\r\n ans.append(W*h1)\r\nprint(' '.join(map(str,ans)))\r\n", "mas = []\r\nsumW, maxH, numMaxH, prevMaxH = 0, 0, 0, 0\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n w, h = [int(j) for j in input().split()]\r\n sumW += w\r\n mas.append(w)\r\n if maxH < h:\r\n prevMaxH = maxH\r\n maxH = h\r\n numMaxH = i\r\n elif prevMaxH < h :\r\n prevMaxH = h\r\n\r\nfor i in range(n):\r\n if i == numMaxH:\r\n print((sumW-mas[i])*prevMaxH, end=\" \")\r\n else:\r\n print((sumW-mas[i])*maxH, end = \" \")", "n = int(input())\r\n\r\nmp = {}\r\nfor i in range(n):\r\n mp[i+1] = list(map(int, input().split()))\r\n mp[i+1].append(i+1)\r\n\r\nwidthSum = 0\r\nfor i in list(mp.keys()):\r\n widthSum+=mp[i][0]\r\n\r\nkeys = list(mp.values())\r\nkeys = list(sorted(keys, key = lambda x: x[1]))\r\nfor i in range(1,n+1):\r\n if(keys[-1][2]!=i):\r\n calc = (widthSum-mp[i][0])*(keys[-1][1])\r\n else:\r\n calc = (widthSum-mp[i][0])*(keys[-2][1])\r\n print(calc, end=\" \")\r\nprint()\r\n# print(mp, widthSum, keys)\r\n\r\n", "n = int(input())\r\nA = []\r\nB = []\r\nC = []\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\n C.append(b)\r\nS = 0\r\nfor i in range(len(A)):\r\n S += A[i]\r\nC.sort()\r\nD = []\r\nfor i in range(n):\r\n t = S - A[i]\r\n if B[i] == C[-1]:\r\n V = t * C[-2]\r\n else:\r\n V = t * C[-1]\r\n D.append(V)\r\n\r\nfor i in range(len(D)):\r\n print(D[i], end=' ')", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nmx1, mx2 = -1, -1\r\nfor i in a:\r\n if i[1] > mx1:\r\n mx2 = mx1\r\n mx1 = i[1]\r\n elif i[1] > mx2:\r\n mx2 = i[1]\r\ns = 0\r\nfor i in a:\r\n s += i[0]\r\nans = []\r\nfor i in range(len(a)):\r\n S = s\r\n S -= a[i][0]\r\n if a[i][1] == mx1:\r\n ans.append(S * (mx2))\r\n else:\r\n ans.append(S * mx1)\r\nprint(*ans)\r\n", "n = int(input())\r\nw_sum = 0\r\nh_max = -float('inf')\r\nh_sub_max = -float('inf')\r\nw = [0] * n\r\nh = [0] * n\r\nfor i in range(n):\r\n w[i], h[i] = map(int, input().split())\r\n w_sum += w[i]\r\n if h_max <= h[i]:\r\n h_sub_max = h_max\r\n h_max = h[i]\r\n elif h_sub_max < h[i]:\r\n h_sub_max = h[i]\r\nfor i in range(n):\r\n if h[i] == h_max:\r\n print((w_sum - w[i]) * h_sub_max, end=' ')\r\n else:\r\n print((w_sum - w[i]) * h_max, end=' ')\r\nprint()\r\n", "n = int(input())\r\ns,maxh,smaxh = 0,0,0\r\nl = []\r\nfor _ in range(n):\r\n w,h = map(int,input().split())\r\n l.append([w,h])\r\n s+=w\r\n if h>=maxh:\r\n smaxh = maxh\r\n maxh = h \r\n elif h>smaxh:\r\n smaxh = h\r\nfor i in range(n):\r\n totalWidth = s-l[i][0]\r\n maxHeight = maxh if l[i][1]!=maxh else smaxh\r\n print(totalWidth*maxHeight,end=\" \")", "T = int(input())\r\nh = []\r\nw = []\r\nSUM = 0\r\nfor i in range(T):\r\n width,height = map(int,input().split())\r\n SUM+= width\r\n w.append(width)\r\n h.append(height)\r\nH_S = h.copy()\r\nH_S.sort()\r\nfor i in range(T):\r\n a = SUM-w[i]\r\n b = H_S[T-1]\r\n if h[i] == H_S[T-1]:\r\n b = H_S[T-2]\r\n print(a*b,end = \" \")\r\n", "n = int(input())\r\nfriends = []\r\nfor m in range(n):\r\n\tfriends.append(list(map(int, input().split())))\r\nphotos = []\r\nw = 0\r\nh = []\r\nfor k in range(n):\r\n\tw += friends[k][0]\r\n\th.append(friends[k][1])\r\nh.sort()\r\nfor i in range(n):\r\n\tif friends[i][1] == h[len(h) - 1]:\r\n\t\tphotos.append((w - friends[i][0]) * h[(n - 2)])\r\n\telse:\r\n\t\tphotos.append((w - friends[i][0]) * h[(n - 1)])\r\nprint(*photos)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\ns = sum(i[0] for i in g)\r\nw = sorted([i[1] for i in g])\r\nfor i in g:\r\n if i[1] != w[-1]:\r\n print((s-i[0])*w[-1], end=' ')\r\n else:\r\n print((s-i[0])*w[-2], end=' ')\r\n", "n, height, lst, s = int(input()), [], [], 0\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n s += w\r\n height.append(h)\r\n lst.append([w, h])\r\nheight.sort()\r\nfor i in range(n): print((s - lst[i][0]) * (height[-1] if lst[i][1] != height[-1] else height[-2]), end=\" \")\r\nprint()", "n=int(input())\r\nw,h,h1,h2=[],[],0,0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n w.append(x)\r\n h.append(y)\r\n if y>h1:\r\n h2=h1\r\n h1=y\r\n elif y>h2:\r\n h2=y\r\nans=sum(w)\r\nfor i in range(n):\r\n if h[i]==h1:\r\n print((ans-w[i])*h2,end=' ')\r\n else:\r\n print((ans-w[i])*h1,end=' ')\r\n", "n = int(input())\r\nw,h = [], []\r\nh1,h2, s = 0, 0, 0\r\nfor _ in range(n):\r\n a,b = list(map(int,input().split()))\r\n w.append(a)\r\n h.append(b)\r\n s += a\r\n if b > h1:\r\n h2 = h1\r\n h1 = b\r\n elif b > h2:\r\n h2 = b\r\n \r\n\r\nfor i in range(n):\r\n \r\n if h[i] != h1:\r\n print((s-w[i])*h1,end=' ')\r\n else:\r\n print((s-w[i])*h2,end=' ')\r\n \r\n \r\n", "#s=list(input()) #for string\r\nimport math\r\nimport array as arr\r\ninarr=lambda:map(int,input().split()) #similar to #define \r\nn=int(input())\r\na=[]\r\nb=[]\r\ns=0\r\nfir = -float(\"inf\")\r\nsec=-float(\"inf\")\r\nfor _ in range(n):\r\n w,h=map(int,input().split())\r\n a.append(w)\r\n b.append(h)\r\n s+=w;\r\n if(h>fir):\r\n sec=fir\r\n fir=h\r\n elif(h>sec):\r\n sec=h\r\ni=0\r\nwhile(i<n):\r\n if(b[i]==fir):\r\n print(sec * (s - a[i]), end=\" \")\r\n else:\r\n print(fir * (s - a[i]), end=\" \") \r\n i=i+1 \r\n \r\n \r\n ", "n=int(input())\r\nmh1=-1\r\nmh1_poz=-1\r\nmh2=-1\r\nw_all=0\r\nA=[]\r\nfor i in range(n):\r\n x,y=[int(k) for k in input().split()]\r\n A.append((x,y))\r\n w_all+=x\r\n if y>=mh1:\r\n mh2=mh1\r\n mh1=y\r\n mh1_poz=i\r\n elif y>mh2:\r\n mh2=y\r\nfor i in range(n):\r\n if i!=mh1_poz:\r\n print((w_all-A[i][0])*mh1,end=' ')\r\n else:\r\n print((w_all-A[i][0])*mh2,end=' ')\r\n", "n=int(input())\r\nW=[]\r\nH=[]\r\nsumw=[]\r\nmaxh=[]\r\ns=0\r\nm=0\r\nfor i in range(n):\r\n\tw,h=map(int,input().split( ))\r\n\tW.append(w)\r\n\tH.append(h)\r\n\ts+=w\r\n\r\nh,I=0,0\r\nfor y in H:\r\n if y>h:\r\n I,h=h,y\r\n elif y>I:\r\n I=y\r\n#print(l) \r\nfor i in range(n):\r\n\tsumw.append(s-W[i])\r\n\r\nans=[]\r\nfor i in range(n):\r\n\tans.append(sumw[i]*(I if H[i]==h else h))\r\n\r\nprint(' '.join(str(i) for i in ans))", "a,b=[],[]\r\nfor i in range(int(input())):\r\n q,w=map(int,input().split())\r\n a+=[q]\r\n b+=[w]\r\nr=sorted(b)\r\ne=sum(a)\r\nl=[]\r\nfor i in range(len(a)):\r\n l+=[(e-a[i])*(r[-1] if r[-1]!=b[i] else r[-2])]\r\nprint(*l)", "def main():\n n = int(input())\n ww, hh = [0] * n, [0] * n\n for i in range(n):\n w, h = map(int, input().split())\n ww[i], hh[i] = w, h\n idx = max(range(n), key=hh.__getitem__)\n mx0 = hh[idx]\n hh[idx] = 1\n mx1 = max(hh)\n width = sum(ww)\n for i, w in enumerate(ww):\n if i == idx:\n ww[i] = (width - ww[i]) * mx1\n else:\n ww[i] = (width - ww[i]) * mx0\n print(' '.join(map(str, ww)))\n\n\nif __name__ == '__main__':\n main()", "from sys import stdin\r\nfrom heapq import heapify, heappush, heappop\r\n\r\nn = int(stdin.readline())\r\na = [tuple(map(int, stdin.readline().split())) for _ in range(n)]\r\nsumW = sum([v[0] for v in a])\r\npq = [(-a[i][1], i) for i in range(n)]\r\nheapify(pq)\r\nret = []\r\nfor i, (w, _) in enumerate(a):\r\n p1, p2 = heappop(pq), None\r\n if p1[1] == i:\r\n p2 = heappop(pq)\r\n maxH = -p2[0] if p2 else -p1[0]\r\n heappush(pq, p1)\r\n if p2:\r\n heappush(pq, p2)\r\n ret.append(maxH * (sumW - w))\r\nprint(*ret)", "n=int(input())\nW=[]\nH=[]\n\nfor _ in range(0,n):\n w,h = input().split()\n w=int(w)\n h=int(h)\n W.append(w)\n H.append(h)\nt = sum(W)\nH1=sorted(H)\n\n# print(H1)\nfor i in range(n):\n if(H[i]==H1[n-1]):\n print((t-W[i])*H1[n-2], end=\" \")\n else:\n print((t-W[i])*H1[n-1], end=\" \" )\n", "import sys\n\nn = int(sys.stdin.readline())\nwidth = {}\nheights = []\nfor i in range(n):\n w, h = map(int, sys.stdin.readline().strip().split())\n heights.append((h, i))\n width[i] = w\ntotal_width = sum(width.values())\n\nheights.sort(reverse=True)\nfor i in range(n):\n w = total_width - width[i]\n h = heights[0][0] if heights[0][1] != i else heights[1][0]\n sys.stdout.write(str(w*h) + ' ')\n", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\n#print=sys.stdout.write\nimport random\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nW=0\nd=defaultdict(int)\nfmax=0\nsmax=0\nH=[]\nl=[]\nfor i in range(n):\n a,b=M()\n l.append([a,b])\n W+=a\n if(b>=fmax):\n smax=max(smax,fmax)\n fmax=b\n elif(b>smax):\n smax=b\nfor i in range(n):\n if(l[i][1]==fmax):\n p=smax\n else:\n p=fmax\n print((W-l[i][0])*p,end=\" \")\n", "n=int(input())\r\nW=[]\r\nH=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n W.append(a)\r\n H.append(b)\r\n\r\ncopy=H.copy()\r\ncopy.sort(reverse=True)\r\nWsum=sum(W)\r\nfor i in range(n):\r\n if(H[i]!=copy[0]):\r\n print((Wsum-W[i])*copy[0],end=\" \")\r\n else:\r\n print((Wsum-W[i])*copy[1],end=\" \")\r\nprint()\r\n ", "n=int(input())\r\nw=[0]*n\r\nh=[0]*n\r\nhh=[0]*n\r\nfor i in range(n):\r\n w[i],h[i]=map(int,input().split())\r\n hh[i]=h[i]\r\nww=sum(w)\r\nh.sort(reverse=True)\r\nans=[]\r\nfor i in range(n):\r\n if hh[i]==h[0]:\r\n ans.append((ww-w[i])*h[1])\r\n else:\r\n ans.append((ww-w[i])*h[0])\r\nprint(*ans)", "t=int(input())\r\nh=[]\r\nw=[]\r\ntotalw=0\r\nmax_h=0\r\nsec_max=0\r\nfor _ in range(t):\r\n wi,hi=map(int,input().split())\r\n w.append(wi)\r\n h.append(hi)\r\nsw=sum(w)\r\nmax_h=max(h)\r\nsh=max(h[:h.index(max(h))]+h[h.index(max(h))+1:])\r\nans=[]\r\nfor i in range(t):\r\n width=sw-w[i]\r\n if(h[i]==max_h):\r\n height=sh\r\n else:\r\n height=max_h\r\n ans.append(width*height)\r\nprint(*ans)", "n = int(input())\nh0 = int(-1)\nh1 = int(-1)\narr = []\nsw = int(0)\ncnt = int(0)\nfor _ in range(n):\n w, h = map(int, input().split())\n arr.append([w, h])\n sw += w\n if h0 < h:\n cnt = 0\n h0 = h\n elif h0 == h:\n cnt += 1\nfor x in arr:\n if x[1] != h0 and x[1] > h1:\n h1 = x[1]\nif cnt > 0:\n h1 = h0\nfor i in range(len(arr)):\n if arr[i][1] == h0:\n print((sw - arr[i][0]) * h1, end = ' ')\n else:\n print((sw - arr[i][0]) * h0, end = ' ')\n\n", "def read_data():\n n = int(input())\n data = []\n for i in range(0, n):\n data.append([int(x) for x in input().split(\" \")])\n return data\n\n\ndef foo(data):\n width = []\n heights = []\n result = \"\"\n for row in data:\n width.append(row[0])\n heights.append(row[1])\n\n width = sum(width)\n heights.sort(reverse=True)\n for row in data:\n w = width - row[0]\n if row[1] == heights[0]:\n h = heights[1]\n else:\n h = heights[0]\n\n result += str(w * h) + \" \"\n return result[:len(result) - 1]\n\n\nprint(foo(read_data()))", "n_friends = int(input())\r\n\r\nsizes = list()\r\n\r\nfor _ in range(n_friends):\r\n w, h = map(int, input().split())\r\n\r\n sizes.append((w, h))\r\n\r\nsorted_h = sorted(s[1] for s in sizes)\r\n\r\nmax_h = sorted_h[-1]\r\nalmost_max_h = sorted_h[-2]\r\nsum_w = sum(s[0] for s in sizes)\r\n\r\n\r\n\r\nfor i in range(1, n_friends + 1):\r\n if sizes[i - 1][1] != max_h:\r\n print(max_h * (sum_w - sizes[i - 1][0]), end=' ')\r\n else:\r\n print(almost_max_h * (sum_w - sizes[i - 1][0]), end=' ')\r\n\r\nprint()", "n = int(input())\r\nwh = [tuple(map(int, input().split())) for i in range(n)]\r\nW = sum([kappa[0] for kappa in wh])\r\npref = [wh[0][1]]\r\nfor i in range(1, n):\r\n pref.append(max(pref[-1], wh[i][1]))\r\nsuff = [0] * (n - 1) + [wh[n - 1][1]]\r\nfor i in range(n - 2, -1, -1):\r\n suff[i] = max(suff[i + 1], wh[i][1])\r\nprint(\" \".join([str((W - wh[i][0]) * max((pref[i - 1] if i - 1 >= 0 else 0), (suff[i + 1] if i + 1 < n else 0))) for i in range(n)]))", "w = []\r\nh = []\r\nmaxh = 0\r\nmaxh2 = 0\r\n\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n w.append(a)\r\n h.append(b)\r\n if b >= maxh:\r\n maxh2 = maxh\r\n maxh = b\r\n elif b > maxh2:\r\n maxh2 = b\r\n\r\nx = sum(w)\r\nfor i in range(len(w)):\r\n if maxh != h[i]: print((x - w[i])*maxh, end = ' ')\r\n else: print((x - w[i])*maxh2, end = ' ')", "a = []\r\nwSum = 0\r\nfor i in range(int(input())):\r\n a.append(list(map(int, input().split())))\r\n wSum += a[-1][0]\r\nh1,h2 = sorted(map(lambda x:x[1], a), reverse=True)[:2]\r\nfor w,h in a:\r\n print((wSum - w) * (h2 if h == h1 else h1), end=' ')", "n=int(input())\r\nw=[]\r\nh=[]\r\nfor _ in range(n):\r\n\twi,hi=map(int,input().split(' '))\r\n\tw.append(wi);h.append(hi)\r\nm1=-1;m2=-1;width=sum(w)\r\nt1=list(h)\r\nt1.sort()\r\nm1=t1[-1];m2=t1[-2]\r\nfor i in range(n):\r\n\t#print(width-w[i],end=\" \")\r\n\tif h[i]!=m1:\r\n\t\tprint((width-w[i])*m1,end=\" \")\r\n\telse:\r\n\t\tprint((width-w[i])*m2,end=\" \")\r\n", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\nw,h=[],[]\r\nfor _ in range(n):\r\n wi,hi=mi()\r\n w.append(wi)\r\n h.append(hi)\r\n \r\nsumm=sum(w)\r\ndp=[0]*n;rdp=[0]*n\r\ncurr_max=0\r\nfor i in range(n):\r\n dp[i]=curr_max\r\n if h[i]>curr_max:\r\n curr_max=h[i]\r\n\r\ncurr_max=0 \r\nfor i in range(n-1,-1,-1):\r\n rdp[i]=curr_max\r\n if h[i]>curr_max:\r\n curr_max=h[i]\r\n \r\nres=[]\r\n\r\nfor i in range(n):\r\n res.append((summ-w[i])*(max(dp[i],rdp[i])))\r\n \r\nprint(*res)", "friends = []\r\nn = int(input())\r\n\r\nfull_w = 0\r\nmax_h = 0\r\nsmax_h = 0\r\nfor i in range(n):\r\n\tw,h = input().split()\r\n\tw,h = int(w), int(h)\r\n\r\n\tfull_w += w\r\n\r\n\tif(max_h < h):\r\n\t\tsmax_h = max_h\r\n\t\tmax_h = h\r\n\telse:\r\n\t\tsmax_h = max(smax_h, h)\r\n\r\n\tfriends.append((w,h))\r\n\r\nanswer = \"\"\r\nfor i in range(len(friends)):\r\n\r\n\tcw, ch = friends[i][0],friends[i][1]\r\n\r\n\tw = (full_w - cw)\r\n\r\n\r\n\th = max_h if(max_h != ch) else smax_h\r\n\tanswer += str(w * h) + \" \"\r\n\r\nanswer = answer[:-1]\r\n\r\nprint(answer)", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\nn = int(input())\r\nb = [list(map(int, input().split())) for i in range(n)]\r\ns = sum(u[0] for u in b)\r\nheights = sorted((u[1] for u in b), reverse =True)\r\nfor i in b :\r\n print((s - i[0]) * (heights[1] if i[1] == heights[0] else heights[0]), end =' ')\r\nprint()\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n=int(input())\r\ntot=0\r\nmax1=0\r\npos=-1\r\na=[]\r\nmax2=0\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\n tot+=x\r\narr=[]\r\nfor _ in range(n):\r\n arr.append(a[_][1])\r\n if a[_][1]>max1:\r\n max1=arr[_]\r\n pos=_\r\narr[pos]=-1\r\nfor i in range(n):\r\n max2=max(max2,arr[i])\r\nfor i in range(n):\r\n w=tot-a[i][0]\r\n h=max1\r\n if max1==a[i][1]:\r\n h=max2\r\n print(w*h,end=\" \")", "n = int(input())\r\n\r\nW = H1 = H2 = 0\r\nw = [0] * n\r\nh = [0] * n\r\n\r\nfor i in range(n):\r\n tmpW, tmpH = [int(s) for s in input().split()]\r\n w[i] = tmpW\r\n h[i] = tmpH\r\n W += tmpW\r\n if H1 < tmpH:\r\n H2 = H1\r\n H1 = tmpH\r\n elif H2 < tmpH:\r\n H2 = tmpH\r\n\r\nfor i in range(n):\r\n localMax = H1 if H1 != h[i] else H2\r\n print((W - w[i]) * localMax, end=' ')\r\n\r\n\r\n", "n = int(input())\r\nws = []\r\nhs = []\r\npixels = []\r\nfor i in range(n):\r\n wi, hi = list(map(int, input().split()))\r\n ws.append(wi)\r\n hs.append(hi)\r\ns = sum(ws)\r\nm1 = sorted(hs, reverse=True)[0]\r\nm2 = sorted(hs, reverse=True)[1]\r\nfor i in range(n):\r\n W = s - ws[i]\r\n if hs[i] == m1:\r\n H = m2\r\n else:\r\n H = m1\r\n pixels.append(str(W * H))\r\nprint(' '.join(pixels))", "import math\r\n\r\n\r\ndef main_function():\r\n w_h = [[int(i) for i in input().split(\" \")] for j in range(int(input()))]\r\n sums = 0\r\n collector = []\r\n h_collector = []\r\n for i in w_h:\r\n sums += i[0]\r\n h_collector.append(i[1])\r\n h_collector.sort()\r\n for i in w_h:\r\n w, h = i\r\n if h == h_collector[-1]:\r\n collector.append((sums - w) * (h_collector[-2]))\r\n else:\r\n collector.append((sums - w) * (h_collector[-1]))\r\n for i in range(len(collector)):\r\n if i == len(collector) - 1:\r\n print(collector[i])\r\n else:\r\n print(collector[i], end=\" \")\r\n \r\n\r\n\r\nmain_function()\r\n", "n = int(input())\r\nw_fr = []\r\nh_fr = []\r\nc=0\r\nb=0\r\nitog = \"\"\r\nd = 0\r\n\r\nfor i in range(n):\r\n w, h = map(int, input().split(\" \"))\r\n w_fr.append(w)\r\n h_fr.append(h)\r\n d += w\r\n \r\nh_minus_max, h_max = sorted(h_fr)[-2:]\r\n\r\nfor i in range(n):\r\n b = d - w_fr[i]\r\n if h_max == h_fr[i]:\r\n itog += str(h_minus_max*b) + \" \"\r\n else:\r\n itog += str(h_max*b) + \" \"\r\n c=0\r\n b=0\r\n\r\nprint(itog[:-1])", "n=int(input())\r\nl=[]\r\nmax_height=0\r\ntotal=0\r\nlst=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l.append([a,b])\r\n lst.append(b)\r\n if(b>max_height):\r\n max_height=b\r\n total+=a\r\nlst.sort()\r\nk=lst[-2]\r\nfor i in range(n):\r\n if(l[i][1]==max_height):\r\n ans=(total-l[i][0])*(k)\r\n else:\r\n ans=(total-l[i][0])*(max_height)\r\n print(ans,end=\" \")\r\n ", "n = int(input())\r\nw=[]\r\nh=[]\r\nh1=[]\r\nres=0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n res+=x\r\n h.append(y)\r\n h1.append(y)\r\n w.append(x)\r\nh.sort()\r\nfor i in range(n):\r\n a=res-w[i]\r\n b=h[n-1]\r\n if h[n-1]==h1[i]:\r\n b=h[n-2]\r\n print(a*b,end=\" \")\r\n", "h,w=[],[]\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n w.append(a)\r\n h.append(b)\r\nmaxh=max(h)\r\nmaxh2=-1\r\nif h.count(maxh)>1: maxh2=maxh\r\nelse:\r\n for i in h:\r\n if i<maxh:\r\n maxh2=max(maxh2,i)\r\nsumw=sum(w)\r\nfor i in range(n):\r\n W=sumw-w[i]\r\n if h[i]==maxh: H=maxh2\r\n else: H=maxh\r\n print(W*H)", "import heapq\nn = int(input())\nw = []\nh = []\nhigh = []\nfor i in range(n):\n x, y = map(int, input().split())\n w.append(x)\n h.append(y)\n high.append(y)\n if len(high) > 2:\n high.sort()\n high.pop(0)\nans = []\ns = sum(w)\nfor i in range(n):\n width = s - w[i]\n if high[1] != h[i]:\n height = high[1]\n else:\n height = high[0]\n ans.append(width * height)\nprint(\" \".join(map(str, ans)))", "import random\r\nimport math\r\n\r\nimport itertools\r\ndef all_lucky(arr, n):\r\n m = [10*j+n for j in range(1,n)]\r\n for q in m:\r\n arr.append(q)\r\n for mi in range(n-1):\r\n k = 2\r\n while m[mi]*k < 10*n:\r\n m.append(m[mi]*k)\r\n arr.append(m[mi]*k)\r\n k+=1\r\n l = len(m)\r\n p = len(arr)\r\n #print(m)\r\n #print(arr)\r\n for i in range(p):\r\n for k in range(l):\r\n if arr[i] + m[k]< 10*n:\r\n arr.append(arr[i]+m[k])\r\n #print(arr)\r\n return arr\r\n\r\ndef main():\r\n t = int(input())\r\n W = [0]\r\n H = [0]\r\n mh1 = 0\r\n mh2 = 0\r\n for _ in range(t):\r\n w, h = list(map(int, input().split()))\r\n W.append(W[-1]+ w)\r\n H.append(h)\r\n if h > mh1:\r\n mh2 = mh1\r\n mh1 = h\r\n else:\r\n if h> mh2:\r\n mh2 = h\r\n\r\n s = ''\r\n for i in range(1,t+1):\r\n nw = W[-1]-W[i]+W[i-1]\r\n nh = mh2 if H[i] == mh1 else mh1\r\n s += str(nw*nh)+ ' '\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "lst_w,lst_h=[],[]\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n lst_w.append(a)\r\n lst_h.append(b)\r\n\r\ntotal_w=sum(lst_w)\r\nsorted_h=sorted(lst_h)\r\n\r\nfor i in range(n):\r\n if lst_h[i]==sorted_h[n-1]:\r\n print((total_w-lst_w[i])*sorted_h[n-2], end=\" \")\r\n else:\r\n print((total_w - lst_w[i]) * sorted_h[n-1], end=\" \")", "#Imports\r\nfrom collections import defaultdict as dc\r\nimport sys\r\nimport math\r\nmod=10**9 +7\r\n# How to sort a list using two compare :\r\n# instead of defining a function define class as a key\r\n# class key(str):\r\n# def __lt__(x,y):# return int(x+y)>int(y+x)\r\n\r\ndef sinp():\r\n p=str(sys.stdin.readline())\r\n return p\r\n\r\ndef seive(n):\r\n p=[0]*(n+1)\r\n for i in range(2,n): \r\n for j in range(2*i,n+1,i):\r\n p[i]=1\r\n return p\r\n\r\n\r\ndef inp(): \r\n p=int(sys.stdin.readline())\r\n return p\r\n\r\ndef line():\r\n p=list(map(int,sys.stdin.readline().split()))\r\n return p\r\n\r\ndef read_mat():\r\n n=inp()\r\n a=[]\r\n for i in range(n):\r\n a.append(line())\r\n return a\r\n\r\ndef ind(a):\r\n return ord(a)-ord('A')\r\n\r\ndef digit(n):\r\n z=n\r\n p=0\r\n q=0\r\n while z:\r\n if z%10>p:\r\n q=p\r\n p=z%10\r\n elif z%10>q:\r\n q=z%10\r\n z=z//10\r\n return p,q\r\n\r\ndef solve(t):\r\n n=inp()\r\n p=[]\r\n w=0\r\n h1=0\r\n h2=0\r\n for i in range(n):\r\n p.append(line())\r\n w+=p[-1][0]\r\n if p[-1][1]>h1:\r\n h2=h1\r\n h1=p[-1][1]\r\n elif p[-1][1]>h2:\r\n h2=p[-1][1]\r\n for i in range(n):\r\n if p[i][1]==h1:\r\n print((w-p[i][0])*h2,end=' ')\r\n else:\r\n print((w-p[i][0])*h1,end=' ')\r\n print()\r\n# t=inp()\r\nt=1\r\nfor _ in range(t):\r\n solve(t)", "n = int(input())\r\nw = [0 for i in range(n)]\r\nh = [0 for i in range(n)]\r\nfor i in range(n):\r\n wi, hi = map(int, input().split())\r\n w[i] = wi\r\n h[i] = hi\r\nws = sum(w)\r\nh1 = sorted(h)\r\nsh = h1[-1]\r\nmh = h1[-2]\r\nans = []\r\nfor i in range(n):\r\n a = sh\r\n if h[i] == sh:\r\n a = mh\r\n ans.append((ws - w[i]) * a)\r\nprint(*ans)", "import sys\ninput=sys.stdin.readline\nprint=sys.stdout.write\nn=int(input())\na=[0]*(10**6)\nb=[0]*(10**6)\nsm=0\nfor x in range(n):\n el=input().split()\n a[x]=int(el[0])\n b[x]=int(el[1])\n sm+=a[x]\nma=max(b)\nma2=0\nflag=0\nflag2=0\nfor i in range(n):\n if(b[i]==ma):\n flag+=1\n flag2=i\nif flag==1:\n for i in range(n):\n if b[i]!=ma:\n ma2=max(ma2,b[i])\nif flag==1:\n for i in range(n):\n if i==flag2:\n print(str(ma2*(sm-a[i]))+\" \")\n else:\n print(str(ma*(sm-a[i]))+\" \")\nelse:\n for i in range(n):\n print(str(ma*(sm-a[i]))+\" \")", "\r\ns = 0\r\nL = []\r\nM = []\r\nfor i in range(int(input())) :\r\n w , l = map(int , input().split())\r\n L.append((w , l))\r\n s += w\r\n M.append(l)\r\nM.sort(reverse = True)\r\nfor i in L :\r\n if i[1] != M[0] :\r\n print((s - i[0]) * M[0] , end =\" \")\r\n else :\r\n print((s-i[0]) * M[1] , end = \" \")\r\n", "R=0\nL=[]\nM=[]\nfor i in range(int(input())):\n\tw,h=[int(x) for x in input().split()];L.append((w,h));R+=w;M.append(h)\nM.sort();M=M[::-1]\nfor i in L:\n\tif i[1]==M[0]:print(M[1]*(R-i[0]))\n\telse:print(M[0]*(R-i[0]))\n\n\t\t \t \t\t\t\t \t\t\t \t \t\t \t \t", "n=int(input())\r\nL=[list(map(int,input().split())) for i in range(n)]\r\nL1=sorted(L,key=lambda x:x[1])\r\nsu=0\r\nfor x in L :\r\n su+=x[0]\r\ns=\"\"\r\nfor x in L :\r\n if L1[-1][1]==x[1] :\r\n s+=str((su-x[0])*L1[-2][1])+\" \"\r\n else :\r\n s+=str((su-x[0])*L1[-1][1])+\" \"\r\n \r\nprint(s) \r\n", "\r\n##########################################################\r\nfrom collections import Counter\r\n# c=sorted((i,int(val))for i,val in enumerate(input().split()))\r\nimport heapq\r\n# c=sorted((i,int(val))for i,val in enumerate(input().split()))\r\n# n = int(input())\r\n# ls = list(map(int, input().split()))\r\n# n, k = map(int, input().split())\r\n# n =int(input())\r\n# e=list(map(int, input().split()))\r\nfrom collections import Counter\r\n#print(\"\\n\".join(ls))\r\n#print(os.path.commonprefix(ls[0:2]))\r\n#for i in range(int(input())):\r\n#n=int(input())\r\n\r\nn=int(input())\r\nd=[]\r\ns=0\r\nfor i in range(n):\r\n j, k = map(int, input().split())\r\n s+=j\r\n\r\n d.append((j,k))\r\n\r\npre=[-1]*n\r\nsu=[-1]*n\r\nvar=0\r\nfor i in range(n):\r\n pre[i]=var\r\n var=max(var,d[i][1])\r\nvar=0\r\n\r\nfor i in range(n-1,-1,-1):\r\n su[i]=var\r\n var=max(var,d[i][1])\r\nfor i in range(n):\r\n ans=max(pre[i],su[i])*(s-d[i][0])\r\n print(ans,end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n1 = input()\r\nn = int(n1)\r\nw = list()\r\nh = list()\r\nw_sum = 0\r\nh_max1 = 0\r\nh_max2 = 0\r\n\r\nfor i in range(n):\r\n wt1, ht1 = input().split()\r\n wt = int(wt1)\r\n ht = int(ht1)\r\n w.append(wt)\r\n h.append(ht)\r\n w_sum += wt\r\n if (ht > h_max1):\r\n h_max2 = h_max1\r\n h_max1 = ht\r\n elif (ht > h_max2):\r\n h_max2 = ht\r\n\r\nfor i in range(n):\r\n wt = w_sum - w[i]\r\n ht = h_max1\r\n if (h[i] == h_max1):\r\n ht = h_max2\r\n a = wt * ht\r\n print(a, end=\" \")", "n= int(input())\na=[]\nhe=[]\nh=[]\nsum=0\nfor i in range(n):\n p,q=[int(x) for x in input().split()]\n a.append(p)\n he.append(q)\n sum=sum+p\n h.append(q)\nh.sort()\ni=0\nfor i in range(n):\n if(he[i]==h[n-1]):\n print(h[n-2]*(sum-a[i]))\n #print(h[n-2],(sum-a[i]))\n else:\n print(h[n-1]*(sum-a[i]))\n #print(h[n-1],(sum-a[i]))\n", "n=int(input())\r\nar=[]\r\nmax1=0 \r\nmax2=0\r\ntw=0\r\nfor i in range(n):\r\n w,h=map(int,input().split())\r\n tw+=w \r\n if(h>=max1):\r\n max2=max1 \r\n max1=h \r\n if(max2<h and h<max1):\r\n max2=max(max2,h)\r\n \r\n ar.append((w,h)) \r\n \r\nfor i in range(n):\r\n if(ar[i][1]==max1):\r\n print((tw-ar[i][0])*max2,end=' ')\r\n else:\r\n print((tw-ar[i][0])*max1 , end=' ')\r\n ", "n = int(input().rstrip())\r\nw = [0] * n\r\nh = [0] * n\r\nfor i in range(n):\r\n w[i], h[i] = [int(j) for j in input().split()]\r\nsuma = sum(w)\r\nmax1 = max(h)\r\nmax2 = 0\r\nif h.count(max1) != 1: max2 = max1\r\nelse:\r\n for i in range(n):\r\n if h[i] != max1:\r\n max2 = max(max2, h[i])\r\nfor i in range(n):\r\n if h[i] == max1:\r\n print((suma - w[i])* (max2))\r\n else:\r\n print((suma - w[i])* (max1))", "n,height,lst,s=int(input()),[],[],0\r\nfor i in range(n):w,h=map(int,input().split());s+=w;height.append(h);lst.append([w,h])\r\nheight.sort()\r\nfor i in range(n):print((s-lst[i][0])*(height[-1] if lst[i][1]!=height[-1] else height[-2]),end=\"\\n\"if i==n-1else\" \")", "n = int(input())\narr = []\nhs = []\nfor _ in range(n):\n w, h = map(int, input().split())\n arr.append((w, h))\n hs.append(h)\n\nhs.sort()\nh_max = hs[-1]\n\nw_sum = sum([i[0] for i in arr])\n\nans = []\nfor i in range(n):\n w = w_sum - arr[i][0]\n h = arr[i][1]\n if h == h_max:\n ans.append(w * hs[-2])\n else:\n ans.append(w * h_max)\nprint(*ans)\n", "n = int(input())\r\nw,h = [], []\r\nfor _ in range(n):\r\n a,b = list(map(int,input().split()))\r\n w.append(a)\r\n h.append(b)\r\n\r\ns = 0\r\nfor i in w:\r\n s += i\r\n\r\nsorted_h = sorted(h)\r\nans = []\r\nfor i in range(n):\r\n \r\n wi = s-w[i]\r\n tmp = sorted_h[-1]\r\n if h[i] == sorted_h[-1]:\r\n tmp = sorted_h[-2]\r\n \r\n ans.append(wi*tmp)\r\n\r\nprint(*ans)\r\n \r\n", "n = int(input())\r\nT = []\r\nheights = []\r\ntotal_width = 0\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n total_width += w\r\n T.append((w, h))\r\n heights.append(h)\r\nheights.sort()\r\nfor i in range(len(T)):\r\n actual_width = total_width - T[i][0]\r\n actual_height = heights[-1]\r\n if actual_height == T[i][1]:\r\n actual_height = heights[-2]\r\n print(actual_width * actual_height)", "n=int(input())\r\nl=[]\r\nsum=0\r\n\r\nfor i in range(n):\r\n y=[int(x) for x in input().split()]\r\n l.append(y)\r\n sum+=y[0]\r\n \r\ndef func(x):\r\n return x[1]\r\n \r\nk=sorted(l, key=func, reverse=True)\r\nmax_h=k[0][1]\r\nh=0\r\nw=0\r\nfor i in range(n):\r\n if(l[i][1]==max_h and len(l)>1):\r\n h=k[1][1]\r\n w=sum-l[i][0]\r\n \r\n elif len(l)>1:\r\n h=max_h\r\n w=sum-l[i][0]\r\n \r\n print(h*w)", "n=int(input())\r\nw,h=[0]*n,[0]*n\r\nfor i in range(n):\r\n w[i],h[i]=map(int,input().split())\r\nwsum=sum(w)\r\nmaxh=max(h)\r\nans=[0]*n\r\nif h.count(maxh)>1:\r\n \r\n for i in range(n):\r\n ans[i]=(wsum-w[i])*maxh\r\nelse:\r\n max2h=-1\r\n for i in range(n):\r\n if h[i]!=maxh:\r\n max2h=max(max2h,h[i])\r\n for i in range(n):\r\n if h[i]==maxh:\r\n ans[i]=(wsum-w[i])*max2h\r\n else:\r\n ans[i]=(wsum-w[i])*maxh\r\nprint(*ans)", "n = int(input())\r\n_list_ = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nwidth = [x[0] for x in _list_]\r\nheight = [x[1] for x in _list_]\r\n\r\nmax1 = max(height)\r\nh = height.copy()\r\ndel h[h.index(max1)]\r\nmax2 = max(h)\r\ns = sum(width)\r\n\r\nfor i in range(n):\r\n a = s - width[i]\r\n b = height[i]\r\n x = 0\r\n if b == max1:\r\n x = max2 * a\r\n else:\r\n x = max1 * a\r\n print(x, end=\" \")\r\n", "a=int(input())\r\n\r\nw=[]\r\nh=[]\r\nfor i in range(a):\r\n x,y=map(int,input().split())\r\n w.append(x)\r\n h.append(y)\r\n\r\nsw=sum(w)\r\nsh=[max(h),max(h[:h.index(max(h))]+h[h.index(max(h))+1:])]\r\n\r\nfor i in range(a):\r\n print((sw-w[i])*(sh[sh[0]==h[i]]),end=' ')\r\n", "n=int(input())\r\na=[]\r\nb=[]\r\nans=0\r\nh1=0\r\nh2=0\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\ta+=[x]\r\n\tb+=[y]\r\n\tans+=x\r\n\tif(y>h2):\r\n\t\th2=min(h1,y)\r\n\t\th1=max(h1,y)\r\nfor i in range(n):\r\n\tif(b[i]==h1):\r\n\t\tprint((ans-a[i])*(h2),end=\" \")\r\n\telse:\r\n\t\tprint((ans-a[i])*(h1), end=\" \")", "from collections import Counter\r\nt=int(input())\r\nl=[]\r\nm=[]\r\ns=0\r\nfor _ in range(t):\r\n w,h=map(int,input().split())\r\n s+=w\r\n l.append(w)\r\n m.append(h)\r\nd=Counter(m)\r\nl1=sorted(l,reverse=True)\r\nm1=sorted(m,reverse=True)\r\nmx1=m1[0]\r\nmx2=m1[1]\r\nif d[mx1]==1:\r\n for i in range(t):\r\n if m[i]==mx1:print((s-l[i])*mx2,end=' ')\r\n else:print((s-l[i])*mx1,end=' ')\r\nelse:\r\n for i in range(t):print((s-l[i])*mx1,end=' ')", "R = lambda: map(int, input().split())\r\nn = int(input())\r\narr = [list(R()) for i in range(n)]\r\ntop2 = sorted((x[1] for x in arr), reverse=True)[:2]\r\nsw = sum(x[0] for x in arr)\r\nfor x in arr:\r\n h = top2[0] if top2[0] != x[1] else top2[1]\r\n print(h * (sw - x[0]), end=' ')", "#!/usr/bin/env python3\r\n# coding: utf-8\r\n\r\nn = int(input())\r\n\r\nfriends = [\r\n tuple(map(int, input().split()))\r\n for _ in range(n)\r\n]\r\n\r\nw_sum = sum(friend[0] for friend in friends)\r\ntop_height_0, top_height_1 = sorted((friend[1] for friend in friends), reverse=True)[:2]\r\n\r\nfor friend in friends:\r\n print((w_sum - friend[0]) * (top_height_0 if friend[1] != top_height_0 else top_height_1), end=\" \")\r\n", "n = int(input())\r\narw = []\r\narh = []\r\nfor i in range(n):\r\n w, h = [int(j) for j in input().split()]\r\n arw.append(w)\r\n arh.append(h)\r\nsumm = 0\r\nfor i in range(n):\r\n summ += arw[i]\r\nh_m = max(arh)\r\ncnt = arh.count(h_m)\r\nfor i in range(n):\r\n w = summ - arw[i]\r\n if arh[i] == h_m and cnt == 1:\r\n b = []\r\n for j in range(n):\r\n b.append(arh[j])\r\n b.pop(i)\r\n h = max(b)\r\n else:\r\n h = h_m\r\n print(h * w)", "n = int(input())\ns = 0\nwidth = []\nheight = []\nfirst = -float(\"inf\")\nsecond = -float(\"inf\")\nfor i in range(n):\n w, h = map(int, input().split())\n width.append(w)\n height.append(h)\n s += w\n if h > first:\n second = first\n first = h\n elif h > second:\n second = h\n\nfor i in range(n):\n if height[i] == first:\n print(second * (s - width[i]), end=\" \")\n else:\n print(first * (s - width[i]), end=\" \")\n", "n = int(input())\r\nsum,h,w,c=0,[],[],[]\r\nfor i in range(n):\r\n a,b = map (int,input().split ())\r\n w.append(a)\r\n h.append(b)\r\n c.append(b)\r\n sum+=a\r\nc.sort()\r\nfor i in range(n):\r\n mh = c[n-1]\r\n if (h[i] == mh):\r\n mh = c[n-2]\r\n print((sum-w[i])*mh,end=' ')", "n = int(input())\r\n\r\nsw = 0\r\nws = []\r\n\r\nm1, m1i = -1, -1\r\nm2, m2i = -1, -1\r\n\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n\r\n ws.append(w)\r\n\r\n sw += w\r\n\r\n if h >= m1:\r\n m2, m2i = m1, m1i\r\n m1, m1i = h, i\r\n\r\n elif h >= m2:\r\n m2, m2i = h, i\r\n\r\nfor i in range(n):\r\n w = sw - ws[i]\r\n\r\n print((m2 if i == m1i else m1) * w, end=' ')\r\n", "n = int(input())\r\nm1, m2, s = 0, 0, 0\r\nw, h = [], []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n w.append(a)\r\n h.append(b)\r\n if b > m1:\r\n m1, m2 = b, m1\r\n elif b > m2:\r\n m2 = b\r\n s += a\r\nans = []\r\nfor i in range(n):\r\n if h[i] == m1:\r\n ans.append((s - w[i]) * m2)\r\n else:\r\n ans.append((s - w[i]) * m1)\r\nprint(*ans)", "n = int(input())\r\npics = []\r\nW = 0\r\nb = []\r\nH1, H2, = -1, -1\r\nh1, h2 = 0, 0\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n W += w\r\n if h > h1:\r\n H2 = H1\r\n h2 = h1\r\n h1 = h\r\n H1 = i\r\n \r\n elif h > h2:\r\n h2 = h\r\n H2 = i\r\n pics.append((w, h))\r\n\r\nfor i in range(n):\r\n Width = W - pics[i][0]\r\n if i == H1:\r\n Height = h2\r\n else:\r\n Height = h1\r\n b.append(Width*Height)\r\n\r\nfor num in b:\r\n print(num, end=\" \")", "w=[]\r\nh=[]\r\npixels=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n x , y = list(map(int,input().split()))\r\n w.append(x)\r\n h.append(y)\r\nwsum=0\r\nfor i in w:\r\n wsum+=i\r\nz=h.copy()\r\nh.sort()\r\nh1 , h2 = h[-1], h[-2]\r\n\r\n \r\no=0\r\nfor i in w:\r\n temp=wsum\r\n if z[o]==h1:\r\n pixels.append((temp-i)*h2)\r\n else:\r\n pixels.append((temp-i)*h1)\r\n temp=wsum\r\n o+=1\r\nfor i in pixels:\r\n print(i,end=\" \")", "n = int(input())\r\nws, hs, ans = [], [], ''\r\nfor i in range(n):\r\n w,h = map(int,input().split())\r\n ws.append(w)\r\n hs.append(h)\r\nconst = tuple(hs)\r\nsum_ws = sum(ws)\r\nmax_hs = (max(hs), hs.index(max(hs)))\r\nfor i in range(n):\r\n if i == max_hs[1]:\r\n hs[i] = 0\r\n ans += str((sum_ws-ws[i])*max(hs)) + ' '\r\n hs = list(const)\r\n max_hs = (max(hs), hs.index(max(hs)))\r\n else:\r\n ans += str((sum_ws-ws[i])*max_hs[0]) + ' '\r\nprint(ans[:-1])", "__author__ = 'aste'\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n w = [0]*n\r\n h = [0]*n\r\n\r\n total_width = 0\r\n for i in range(0, n):\r\n w[i], h[i] = map(int, input().split())\r\n total_width += w[i]\r\n\r\n max_h_f = [0]*n\r\n max_h_b = [0]*n\r\n for i in range(1, n):\r\n max_h_f[i] = max(h[i - 1], max_h_f[i - 1])\r\n for i in range(n - 2, -1, -1):\r\n max_h_b[i] = max(h[i + 1], max_h_b[i + 1])\r\n for i in range(0, n):\r\n max_w = total_width - w[i]\r\n max_h = max(max_h_f[i], max_h_b[i])\r\n print((max_w * max_h), end=' ')\r\n\r\nmain()\r\n", "L, M = [],[]\r\nhm, hm1, s = 0,0,0;\r\nfor i in range(int(input())):\r\n w, h = [int(x) for x in input().split()]; s += w; L.append([w, h]);\r\n if h > hm: hm1 = hm; hm = h\r\n elif h>hm1: hm1=h\r\nfor i in L:\r\n if i[1] == hm: print(hm1*(s-i[0]))\r\n else: print(hm*(s-i[0]))", "from heapq import *\n\n\ndef lets_do_it():\n n = int(input())\n sum_of_widths = 0\n max_height_heap = []\n width_heights = []\n\n while n:\n width, height = [int(a) for a in input().split(' ')]\n sum_of_widths += width\n heappush(max_height_heap, -height)\n width_heights.append((width, height))\n n -= 1\n\n # print(width_heights)\n # print(f'Heap = {max_height_heap}')\n for curr_width, curr_height in width_heights:\n # print(f'curr_wid = {curr_width} | height = {curr_height}')\n width = sum_of_widths - curr_width\n height = -1 * heappop(max_height_heap)\n if height == curr_height:\n height = -1 * heapreplace(max_height_heap, -curr_height)\n\n print(width * height, end=\" \")\n heappush(max_height_heap, -1 * height)\n\n\ndef main():\n # test_cases = int(input())\n test_cases = 1\n while test_cases:\n lets_do_it()\n test_cases -= 1\n\n\nmain()\n", "friends_w = []\r\nfriends_h = []\r\nmax_h = 0\r\nmax_h_2 = 0\r\ntotal_w = 0\r\n\r\namount = int(input())\r\nfor i in range(amount):\r\n w, h = map(int, input().split())\r\n friends_w.append(w)\r\n friends_h.append(h)\r\n if max_h_2 < h:\r\n if max_h < h:\r\n max_h_2 = max_h\r\n max_h = h\r\n else:\r\n max_h_2 = h\r\n total_w += w\r\n\r\n# print(max_h, max_h_2)\r\nfor i in range(amount):\r\n if friends_h[i] == max_h:\r\n print(max_h_2 * (total_w - friends_w[i]))\r\n else:\r\n print(max_h * (total_w - friends_w[i]))\r\n", "n = int(input())\r\nppl = []\r\nw = []\r\nh = []\r\nfor i in range(n):\r\n\twi, hi = map(int, input().split(' '))\r\n\tppl.append([wi,hi])\r\n\tw.append(wi)\r\n\th.append(hi)\r\nsu = sum(w)\r\nm1 = sorted(h)\r\nfor i in range(n):\r\n\tif h[i] == m1[-1]:\r\n\t\thh = m1[-2]\r\n\telse:\r\n\t\thh = m1[-1]\r\n\tans = (su-w[i]) * hh\r\n\tprint(ans,end=\" \")\r\n", "n=int(input())\ntotal=0\nL=[]\nH=[]\nfor i in range(n):\n\tw,h=[int(x) for x in input().split()]\n\tL.append((w,h))\n\ttotal+=w\n\tH.append(h)\nH.sort()\nH=H[::-1]\nfor i in L:\n\tif i[1]==H[0]:\n\t\tprint(H[1]*(total-i[0]))\n\telse:\n\t\tprint(H[0]*(total-i[0]))\n", "n=int(input())\r\nw=[]\r\nh=[]\r\n\r\nfor x in range(n):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n w.append(a)\r\n h.append(b)\r\nsums=0\r\nfor i in w:\r\n sums+=i\r\nmaxm=-1\r\nmaxmm=-1\r\ni=0\r\nwhile(i<len(h)):\r\n if(h[i]>=maxm):\r\n maxmm=maxm\r\n maxm=h[i]\r\n if(h[i]>maxmm and h[i]<maxm):\r\n maxmm=h[i]\r\n i+=1\r\nstrs=\"\"\r\nfor i in range(n):\r\n if(h[i]==maxm):\r\n ans=(sums-w[i])*maxmm\r\n else:\r\n ans=(sums-w[i])*maxm\r\n strs+=str(ans)\r\n strs+=\" \"\r\nprint(strs[:-1])\r\n", "n = int(input())\r\nsum = 0\r\nmax1 = 0\r\nmax2 = 0\r\nlw = []\r\nlh = []\r\nfor _ in range(n):\r\n w, h = map(int, input().split())\r\n lw.append(w)\r\n lh.append(h)\r\n sum += w\r\n if h >= max1:\r\n max2 = max1\r\n max1 = h\r\n else:\r\n max2 = max(max2, h)\r\nfor i in range(n):\r\n cw = sum - lw[i]\r\n ch = max1 if max1 != lh[i] else max2\r\n print(cw*ch, end = \" \")", "from sys import stdin,stdout\r\nfrom math import gcd,log2;\r\nimport math;\r\nfrom collections import defaultdict\r\nimport sys\r\n# import numpy as np\r\ninput=stdin.readline\r\nprint=stdout.write\r\nn=int(input())\r\nw=[0]*n\r\nh=[0]*n\r\n\r\nfor i in range(n):\r\n w[i],h[i]=map(int,input().split())\r\nsumofwidth=sum(w)\r\nmaxheight=max(h)\r\ncountofmaxheight=h.count(maxheight)\r\nsecondmaxheight=0\r\nif countofmaxheight==1:\r\n for i in range(n):\r\n if h[i]>secondmaxheight and h[i]<maxheight:\r\n secondmaxheight=h[i]\r\nfor i in range(n):\r\n a=sumofwidth-w[i]\r\n if h[i]==maxheight and countofmaxheight==1:\r\n b=secondmaxheight\r\n else:\r\n b=maxheight\r\n print(str(a*b)+\" \")\r\n\r\n\r\n", "w=[]\r\nh=[]\r\nn=int(input())\r\nfor i in range(n):\r\n h_, w_ = (int(i) for i in input().split(' '))\r\n w.append(w_)\r\n h.append(h_)\r\n\r\nw_max=max(w)\r\nw2=w.copy()\r\nw2.sort()\r\nw_secmax=w2[-2]\r\nh_sum=sum(h)\r\n\r\nfor i in range(n):\r\n if w[i]==w_max:\r\n print((h_sum-h[i])*w_secmax, end=' ')\r\n else:\r\n print((h_sum-h[i])*w_max, end=' ')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = 0\r\na = [tuple(map(int, input().split())) for i in range(n)]\r\nma1 = 0\r\nma2 = 0\r\nfor i in range(n):\r\n s += a[i][0]\r\n if ma1 <= a[i][1]:\r\n ma2 = ma1\r\n ma1 = a[i][1]\r\n elif ma2 < a[i][1]:\r\n ma2 = a[i][1]\r\n\r\nans = []\r\nfor i in range(n):\r\n h = s - a[i][0]\r\n if ma1 == a[i][1]:\r\n w = ma2\r\n else:\r\n w = ma1\r\n ans.append(h * w)\r\n\r\nprint(*ans)", "s=0\nL=[]\nM=[]\nfor i in range(int(input())):\n\tw,h=[int(x) for x in input().split()];L.append((w,h));s+=w;M.append(h)\nM.sort();M=M[::-1]\nfor i in L:\n\tif i[1]==M[0]:print(M[1]*(s-i[0]))\n\telse:print(M[0]*(s-i[0]))\n", "n = int(input())\r\n\r\ndef solve(n):\r\n w = []\r\n h = []\r\n for i in range(n):\r\n inp = input().split()\r\n w.append(int(inp[0]))\r\n h.append(int(inp[-1]))\r\n\r\n res = []\r\n sm = sum(w)\r\n h_mx = sorted(enumerate(h), reverse=True, key=lambda x: x[-1])\r\n for i in range(n):\r\n w_ = sm - w[i]\r\n if i == h_mx[0][0]:\r\n h_ = h_mx[1][1]\r\n else:\r\n h_ = h_mx[0][1]\r\n\r\n res.append(str(w_*h_))\r\n\r\n return ' '.join(res)\r\nprint(solve(n))\r\n", "from sys import stdin\nfrom collections import deque\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\ndef ii(): return int(stdin.readline())\ndef fi(): return float(stdin.readline())\ndef mi(): return map(int, stdin.readline().split())\ndef fmi(): return map(float, stdin.readline().split())\ndef li(): return list(mi())\ndef lsi():\n\tx=list(stdin.readline())\n\tx.pop()\n\treturn x\ndef si(): return stdin.readline()\na=[]\nb=[]\np=[]\nfor _ in range(ii()):\n\tx, y=mi()\n\ta.append(x)\n\tb.append(y)\ns=sum(a)\nx=max(b)\ny=b.index(x)\nz=0\nif y:\n\tz=max(b[:y])\nif y<len(b)-1:\n\tz=max(z, max(b[y+1:]))\nfor i in range(len(a)):\n\tif b[i]==x:\n\t\tp.append((s-a[i])*z)\n\telse:\n\t\tp.append((s-a[i])*x)\nprint(*p)\n \t\t\t \t \t\t\t\t\t \t\t \t \t \t \t", "def f1(dp,hh,a,n):\r\n for i in range (1,n+1):\r\n dp[i]=dp[0]-a[i-1][0]*hh\r\n print(*(dp[1:]))\r\ndef f2(dp,h,a,n,dd):\r\n for i in range (1,n+1):\r\n if a[i-1][1]!=h[0]:\r\n dp[i]=dp[0]-a[i-1][0]*h[0]\r\n else:\r\n dp[i]=dd-a[i-1][0]*h[1]\r\n print(*(dp[1:]))\r\nn=int(input())\r\na=[]\r\ndp=[0 for _ in range (n+1)]\r\nh=[0 for __ in range (n)]\r\nfor _ in range (n):\r\n a.append(list(map(int,input().split())))\r\n dp[0]+=a[_][0]\r\n h[_]=a[_][1]\r\nk=False\r\nh.sort(reverse=1)\r\n#print(h)\r\nif h[0]==h[1]:\r\n k=True\r\ndd=dp[0]\r\ndp[0]*=h[0]\r\nif k==True:\r\n f1(dp,h[0],a,n)\r\n #print(1)\r\nelse:\r\n f2(dp,h,a,n,dd*h[1])", "import sys\r\ninputlist=sys.stdin.readlines()\r\nnumber_of_friends=int(inputlist[0])\r\nwidth_list=[]\r\nheight_list=[]\r\nsum_of_widths=0\r\nfor i in range(number_of_friends):\r\n w,h=list(map(int,inputlist[i+1].strip().split(' ')))\r\n width_list.append(w)\r\n height_list.append(h)\r\n sum_of_widths=sum_of_widths+w\r\n#print(width_list)\r\n#print(height_list)\r\n#print('sum_of_widths=',sum_of_widths)\r\nif height_list[0]>height_list[1]:\r\n max,second_max=height_list[0],height_list[1]\r\nelse:\r\n max,second_max=height_list[1],height_list[0]\r\nfor i in height_list[2:]:\r\n if(i>=max):\r\n second_max=max\r\n max=i\r\n elif(i>second_max):\r\n second_max=i\r\n#print('max=',max,'second_max=',second_max)\r\n\r\nfor i in range(number_of_friends):\r\n width=sum_of_widths-width_list[i]\r\n height=second_max if (height_list[i]==max) else max\r\n print(width*height,end=' ')", "n = int(input())\r\n\r\nheights = []\r\nweights = []\r\nsum_weights = 0\r\n\r\nfor i in range(n):\r\n w, h = [int(x) for x in input().split()]\r\n sum_weights += w\r\n weights.append(w)\r\n heights.append((h, i))\r\n\r\nheights.sort(key=lambda x: x[0])\r\n\r\nfor i in range(n - 1):\r\n if heights[-1][1] == i:\r\n print((sum_weights - weights[i]) * heights[-2][0], end=\" \")\r\n else:\r\n print((sum_weights - weights[i]) * heights[-1][0], end=\" \")\r\n\r\nif heights[-1][1] == n - 1:\r\n print((sum_weights - weights[n - 1]) * heights[-2][0])\r\nelse:\r\n print((sum_weights - weights[n - 1]) * heights[-1][0])\r\n", "t = int(input())\r\nwidth = list()\r\nhieght = list()\r\nwidth_sum = 0\r\nsecond_max = 0\r\nans = list()\r\nfor i in range(t):\r\n w, h = map(int, input().split())\r\n width.append(w)\r\n hieght.append(h)\r\n width_sum += w\r\nhieght_max = max(hieght)\r\nfor i in range(t):\r\n if hieght[i]>second_max and hieght[i]!=hieght_max:\r\n second_max = hieght[i]\r\nif hieght.count(hieght_max) > 1:\r\n for i in range(t):\r\n ans.append((width_sum - width[i]) * hieght_max)\r\nelse:\r\n for i in range(t):\r\n if hieght[i] == hieght_max:\r\n ans.append((width_sum - width[i]) * second_max)\r\n else:\r\n ans.append((width_sum - width[i]) * hieght_max)\r\nprint(*ans)", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nfrom bisect 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 = inp()\r\n x, y = [], []\r\n s = 0\r\n for i in range(n):\r\n a, b = mp()\r\n x.append(a)\r\n y.append(b)\r\n s += a\r\n prefix = [0]\r\n suffix = [0]\r\n for i in range(n):\r\n prefix.append(max(prefix[-1], y[i]))\r\n suffix.append(max(suffix[-1], y[n-i-1]))\r\n suffix = suffix[::-1]\r\n ans = []\r\n for i in range(n):\r\n ans.append((s-x[i])*max(prefix[i], suffix[i+1]))\r\n print(*ans)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "n=int(input())\r\nw=[[] for i in range(n)]\r\nh=[[] for i in range(n)]\r\nh1=[[] for i in range(n)]\r\nsum=0\r\nfor i in range(n):\r\n wi,hi=map(int,input().split())\r\n w[i]=wi\r\n h[i]=hi\r\n h1[i]=hi\r\n sum+=wi\r\nm1=max(h)\r\n\r\n\r\nh1.remove(m1)\r\nm2=max(h1)\r\n\r\n\r\nfor i in range(n):\r\n s1=sum-w[i]\r\n if h[i]==m1:\r\n s2=m2\r\n else:\r\n s2=m1\r\n \r\n print(s1*s2,end=' ')", "s=0\r\nL=[]\r\nM=[]\r\nfor i in range(int(input())):\r\n\tw,l=[int(x) for x in input().split()];L.append((w,l));s+=w;M.append(l)\r\nM.sort();M=M[::-1]\r\nfor i in L:\r\n\tif i[1]==M[0]:print(M[1]*(s-i[0]))\r\n\telse:print(M[0]*(s-i[0]))\r\n", "#!/usr/bin/env python\r\n#* _ * _ coding:utf-8 - * -\r\nfrom math import *\r\n\r\nn = int(input())\r\nw = []\r\nh = []\r\nfor i in range(0, n):\r\n a = list(map(int, input().split()))\r\n #print(a)\r\n w.append(a[0])\r\n h.append(a[1])\r\n\r\nW = sum(w)\r\nH = max(h)\r\nh2 = h\r\nmaxid = h2.index(H)\r\ndel h2[maxid]\r\nH2 = max(h2)\r\nh.insert(maxid, H)\r\n\r\nfor i in range(0, n):\r\n if (H != h[i]):\r\n print(H * (W - w[i]), end = \" \")\r\n else:\r\n print(H2 * (W - w[i]), end = \" \")\r\n", "n = int(input())\nw_list = []\nh_list = []\nfor i in range(n):\n w, h = map(int, input().split())\n w_list.append(w)\n h_list.append(h)\n\ntotal_w = sum(w_list)\nsorted_h = sorted(h_list, reverse=True)\n\nresult = []\nfor i in range(n):\n if (h_list[i] == sorted_h[0]):\n max_h_now = sorted_h[1]\n else:\n max_h_now = sorted_h[0]\n result.append((total_w - w_list[i]) * (max_h_now))\nprint(*result, sep=\" \")", "n = int(input())\na = []\nW = 0\nh1 = h2 = 0\nflag = 0\n\nfor i in range(n):\n inp = input().split()\n wi, hi = int(inp[0]), int(inp[1])\n a.append([wi, hi])\n W += wi\n\n if hi >= h1:\n h2 = h1\n h1 = hi\n elif hi > h2:\n h2 = hi\n\nfor i in a:\n if i[1] == h1:\n print((W - i[0])* h2, end=\" \")\n else:\n print((W - i[0]) * h1, end=\" \")", "n=int(input())\r\nw=[]\r\nh=[]\r\nsw=0\r\nfor i in range(n):\r\n st=input().split()\r\n w.append(int(st[0]))\r\n h.append(int(st[1]))\r\ns=sum(w)\r\nmh=h.index(max(h))\r\nmm=max(h)\r\nfor i in range(n):\r\n sd=s-w[i]\r\n if i==mh:\r\n saveH=h.pop(i)\r\n m=max(h)\r\n h.insert(i,saveH)\r\n print(sd*m,end=' ')\r\n m=mm\r\n else:\r\n m=mm\r\n print(sd*m,end=' ')\r\n \r\n \r\n \r\n", "n=int(input())\r\nl=[]\r\nk=[0]\r\nw=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n w+=x\r\n l.append([x,y])\r\n k.append(y)\r\nm=max(k)\r\nk.remove(m)\r\nt=max(k)\r\ni=0\r\nwhile i<n:\r\n if l[i][1]==m:\r\n k[i]=((w-l[i][0])*t)\r\n i+=1\r\n continue\r\n k[i]=((w-l[i][0])*m)\r\n i+=1\r\nprint(*k)", "n = int(input())\r\na = []\r\nsu = 0\r\nmax1,max2 = [None,None]\r\nfor i in range(n):\r\n x,y = [ int(t) for t in input().split()]\r\n a.append([x,y])\r\n su += x\r\n if max1==None or y>a[max1][1]:\r\n max1,max2 = [i,max1]\r\n elif max2==None or y>a[max2][1]:\r\n max2 = i\r\nprint(' '.join([str((su-a[i][0])*a[max2 if i==max1 else max1][1]) for i in range(n)])) ", "arr_w = []\r\nN = int(input())\r\nmax_h, i1 = 0, None\r\nmax2_h, i2 = 0, None\r\nfor i in range(N):\r\n w_i, h_i = map(int, input().strip().split())\r\n arr_w.append(w_i)\r\n if h_i > max_h:\r\n max2_h, i2 = max_h, i1\r\n max_h, i1 = h_i, i\r\n elif h_i > max2_h:\r\n max2_h, i2 = h_i, i\r\nW = sum(arr_w)\r\nres = []\r\nfor i in range(N):\r\n h = max_h if i != i1 else max2_h\r\n res.append(str((W-arr_w[i]) * h))\r\nprint(' '.join(res))", "w = []\r\nh = []\r\nW = 0\r\nn = int(input())\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n w.append(a)\r\n h.append(b)\r\n W += a\r\nH1 = max(h)\r\nI = h.index(H1)\r\nH2 = max(h[:I] + h[I+1:])\r\nfor i in range(n):\r\n H = H1 if i != I else H2\r\n print((W - w[i]) * H, end=' ')", "n = int(input())\r\nwidth = []\r\nheight = []\r\nwidth_sum = 0\r\nfor i in range(n):\r\n s, t = map(int, input().split())\r\n width.append(s)\r\n height.append(t)\r\n width_sum += width[i]\r\nmax_height = max(height)\r\np = height.index(max_height)\r\nheight.remove(max_height)\r\nmax2_height = max(height)\r\nheight.insert(p, max_height)\r\nfor i in range(n):\r\n sub_w = (width_sum-width[i])\r\n if height[i]==max_height:\r\n sub_h = max2_height\r\n else:\r\n sub_h = max_height\r\n print(sub_w*sub_h, end=' ')", "n = int(input())\r\ni=0\r\nw=[]*n\r\nh=[]*n\r\ni=0\r\nwhile (i<n):\r\n pair = input().split()\r\n w.append(int(pair[0]))\r\n h.append(int(pair[1]))\r\n i+=1\r\nW=0\r\nfor x in w :\r\n W+=x\r\nh_sorted = sorted(h)\r\nfor x in range(0,n):\r\n W_new = W-w[x]\r\n if(h[x]==h_sorted[-1]):\r\n h_new = h_sorted[-2]\r\n else:\r\n h_new = h_sorted[-1]\r\n b= h_new * W_new \r\n print(b, end=\" \")\r\n\r\n\r\n\r\n\t\r\n\r\n \r\n", "n=int(input())\r\n\r\nW=0;\r\nw_list=[];\r\nh_max=0;ind_max=0\r\nh_m=0\r\nfor _ in range(n):\r\n w,h=map(int,input().split())\r\n w_list.append(w)\r\n W+=w\r\n \r\n if h>=h_max:\r\n h_max,h_m=h,h_max\r\n ind_max=_\r\n elif h>h_m:\r\n h_m=h\r\n\r\nfor i in range(ind_max):\r\n print((W-w_list[i])*h_max,end=\" \")\r\nprint((W-w_list[ind_max])*h_m,end=\" \")\r\nfor i in range(ind_max+1,n):\r\n print((W-w_list[i])*h_max,end=\" \")\r\n", "\r\nn = int(input())\r\npp = [list(map(int,input().split()))+[i] for i in range(n)]\r\ntw = sum([p[0] for p in pp])\r\npp = sorted(pp,key=lambda p:p[1])\r\nfor i in range(n-1):\r\n pp[i].append( (tw-pp[i][0])*pp[-1][1] )\r\npp[-1].append( (tw-pp[-1][0])*pp[-2][1])\r\npp = sorted(pp,key=lambda p:p[2])\r\nprint(*[p[3] for p in pp])\r\n", "n=int(input())\r\nW=0\r\nh1=[0]*(n+2)\r\nh=[0]*(n+2)\r\nw=[0]*(n+2)\r\nfor i in range(1,n+1):\r\n w[i],h[i]=map(int,input().split())\r\n W+=w[i]\r\n h1[i]=max(h[i],h1[i-1])\r\nh2=[0]*(n+2)\r\nfor i in range(n,0,-1):\r\n h2[i]=max(h[i],h2[i+1])\r\nprint(' '.join([str((W-w[i])*max(h1[i-1],h2[i+1])) for i in range(1,n+1)]))", "n = int(input())\r\nw, h, a = [], [], []\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n w += [x]\r\n h += [y]\r\ns = sum(w)\r\nh1 = h.copy()\r\nh1.sort()\r\nfor i in range(n):\r\n W = s - w[i]\r\n if h[i] == h1[n-1]:\r\n H = h1[n-2]\r\n else:\r\n H = h1[n-1]\r\n a += [W*H]\r\nfor i in a:\r\n print(i, end=\" \")", "n=int(input());\r\na=[];b=[];\r\nfor i in range(n):\r\n\tk=list(map(int,input().split()));\r\n\ta.append(k[0]);\r\n\tb.append(k[1]);\r\nM=max(b);\r\nm=b.index(M);\r\nMM=0;\r\nfor i in range(n):\r\n\tif(i!=m and b[i]>MM):MM=b[i];\r\nk=sum(a);\r\nc=[];\r\nfor i in range(n):\r\n\tif(i==m):c.append((k-a[i])*MM);\r\n\telse:c.append((k-a[i])*M);\r\nprint(*c);\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nw=[0]*n\r\nh=[0]*n\r\nc=[x for x in range(n)]\r\nss=0\r\nfor i in range(n):\r\n w[i],h[i]=map(int,input().split())\r\n ss+=w[i]\r\ns=sorted(zip(h,c))\r\na=s[n-1][1]\r\nb=s[n-2][1]\r\nfor i in range(n):\r\n vv=ss-w[i]\r\n if(i==a):\r\n cc=h[b]\r\n else:\r\n cc=h[a]\r\n print(cc*vv,end=\" \")", "n = int(input())\r\na = []\r\nb = []\r\na.append(0)\r\nsum_ = 0\r\nfor i in range(n):\r\n w,h = map(int,input().split())\r\n a.append(w)\r\n sum_ = sum_ + w\r\n b.append((h,i+1))\r\nb.sort()\r\nfor i in range(1,n+1):\r\n if (i == b[len(b)-1][1]):\r\n h = b[len(b)-2][0]\r\n else:\r\n h = b[len(b)-1][0]\r\n w = sum_ - a[i]\r\n print(w * h,end = ' ')", "n=int(input())\r\nwis=[]\r\nhes=[]\r\nhm=0\r\ncount=1\r\nfor i in range(n):\r\n w,h=map(int, input().split())\r\n wis.append(w)\r\n hes.append(h)\r\n if h>hm:\r\n hm=h\r\n count=1\r\n elif h==hm:\r\n count+=1\r\nif count==1:\r\n hes2=sorted(hes)\r\n seh=hes2[-2]\r\n \r\nallwide=sum(wis) \r\n\r\nfor p in range(n):\r\n if hes[p]<hm :\r\n print((allwide-wis[p])*hm)\r\n elif hes[p]==hm and count>1:\r\n print((allwide-wis[p])*hm)\r\n elif hes[p]==hm and count==1:\r\n print((allwide-wis[p])*seh)", "def main():\n n = int(input())\n ww, hh = [0] * n, [0] * n\n for i in range(n):\n w, h = map(int, input().split())\n ww[i], hh[i] = w, h\n hi = sorted(range(n), key=hh.__getitem__)\n width = sum(ww)\n height = hh[hi[-1]]\n for i in hi[:-1]:\n ww[i] = (width - ww[i]) * height\n i = hi[-1]\n ww[i] = (width - ww[i]) * hh[hi[-2]]\n\n print(' '.join(map(str, ww)))\n\n\nif __name__ == '__main__':\n main()", "def solve (n,seq) :\r\n h = sorted(seq,reverse = True , key = lambda i : i[1])\r\n maxHeight1 = h[0][1]\r\n maxHeight2 = h[1][1]\r\n \r\n width = sum([w for w,h in seq])\r\n \r\n for w,h in seq :\r\n if h != maxHeight1 :\r\n print ((width-w)*maxHeight1, end = \" \")\r\n else :\r\n print ((width-w)*maxHeight2, end = \" \")\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\nn = int(input())\r\nseq = []\r\nfor x in range(n) :\r\n seq.append(list(map(int,input().split())))\r\n \r\n\r\n\r\nsolve(n,seq)\r\n \r\n ", "import sys\n\n__author__ = 'zumzoom'\n\nn = int(sys.stdin.readline())\nA = []\nw = 0\nh1, h2 = 0, 0\ni1 = 0\nfor line in sys.stdin.readlines()[:n]:\n l = [int(x) for x in line.split()]\n A.append(l[0])\n w += l[0]\n if l[1] > h1:\n h2 = h1\n h1 = l[1]\n i1 = len(A) - 1\n elif l[1] > h2:\n h2 = l[1]\n\nfor i in range(n):\n if i == i1:\n print((w - A[i]) * h2, end=' ')\n else:\n print((w - A[i]) * h1, end=' ')\n", "n=int(input())\r\ntotal=0\r\nwidth=[]\r\nheight=[]\r\nhe=[]\r\nfor i in range(0,n):\r\n w,h=[int(x) for x in input().split()]\r\n total+=w\r\n width.append(w)\r\n height.append(h)\r\n he.append(h)\r\nhe.sort() \r\nfor i in range(0,n):\r\n if(height[i]==he[n-1]):\r\n print(he[n-2]*(total-width[i]),end=' ')\r\n else:\r\n print(he[n-1]*(total-width[i]),end=' ')\r\n \r\n \r\n ", "width=[]\r\nheight=[]\r\ns=0\r\nn=int(input())\r\nfor _ in range(n):\r\n w,h=map(int,input().split())\r\n width.append(w)\r\n s=s+w\r\n height.append(h)\r\nreq1=[]\r\nreq2=[]\r\na=s\r\nk=sorted(height)\r\nk.sort(reverse=True)\r\n#print(k)\r\n#print(height)\r\nfor i in width:\r\n a=a-i\r\n req1.append(a)\r\n a=s\r\nfor i in range(n):\r\n if height[i]!=k[0]:\r\n req1[i]*=k[0]\r\n else:\r\n req1[i]*=k[1]\r\nfor i in range(n):\r\n print(req1[i],end=\" \")\r\n\r\n \r\n", "n = int(input())\nw = [0] * n\nh = [0] * n\nfor i in range(n):\n w[i], h[i] = map(int, input().split())\n\nsum_w = sum(w)\n\nmax_h = max(h[0], h[1])\nmax_h_2 = min(h[0], h[1])\nfor i in range(2, n):\n if h[i] >= max_h:\n max_h_2 = max_h\n max_h = h[i]\n elif h[i] >= max_h_2:\n max_h_2 = h[i]\n\nfor i in range(n):\n wi = sum_w - w[i]\n hi = max_h if h[i] != max_h else max_h_2\n print(wi * hi, end=' ')\n", "#code\r\nn=int(input())\r\nls=[]\r\ntemp1=0\r\ntemp2=[]\r\nfor i in range(n):\r\n w,h=map(int,input().split())\r\n temp1+=w\r\n temp2.append(h)\r\n ls.append([w,h])\r\ntemp2.sort(reverse=True)\r\nfor i in range(n):\r\n if(ls[i][1]!=temp2[0]): print((temp1-ls[i][0])*temp2[0],end=\" \")\r\n else: print((temp1-ls[i][0])*temp2[1],end=\" \")\r\nprint() ", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 1000000007\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\nn = int(input())\r\na = matrix(n, 2)\r\nfor i in range(n):\r\n a[i][0], a[i][1] = map(int, input().split())\r\nw = 0\r\nh1 = 0\r\nh2 = 0\r\nfor i in a:\r\n w += i[0]\r\n if i[1] >= h1:\r\n h2 = h1\r\n h1 = i[1]\r\n else:\r\n h2 = max(h2, i[1])\r\n\r\nfor x in a:\r\n w0 = w - x[0]\r\n if x[1] == h1:\r\n h0 = h2\r\n else:\r\n h0 = h1\r\n print(w0 * h0, end=' ')\r\n", "n=int(input())\r\nsw=0\r\nmh=-2**69\r\nbad=[]\r\nhl=[]\r\nfor _ in range(n):\r\n w,h=map(int,input().split())\r\n mh=max(mh,h)\r\n sw+=w\r\n hl.append(h)\r\n bad.append([w,h])\r\nsol=[]\r\nhl.sort()\r\nmh2=hl[-2]\r\nfor i in bad:\r\n wt=i[0]\r\n h=i[1]\r\n if h==mh:\r\n he=mh2\r\n else:\r\n he=mh\r\n sol.append((sw-wt)*he)\r\nprint(*sol)" ]

[ "#!/usr/bin/python3\n\nimport sys\n\nn, l, r, ql, qr = map(int, sys.stdin.readline().strip().split())\nw = [int(x) for x in sys.stdin.readline().strip().split()]\n\ns = [0]\nfor i in range(0, n):\n s.append(s[-1] + w[i])\n\ndef cost(left):\n right = n - left\n diff = left - right\n bonus = 0\n if diff > 0: # left part is larger\n bonus = ql * (diff - 1)\n elif diff < 0: # right part is larger\n bonus = qr * (-diff - 1)\n return bonus + l * s[left] + r * (s[n] - s[left])\n\nbest = cost(0)\nfor left in range(1, n+1):\n c = cost(left)\n if c < best:\n best = c\n\nprint(best)\n", "if __name__ == '__main__':\r\n\tn, l, r, ql, qr = map(int, input().split())\r\n\tweights = [int(x) for x in input().split()]\r\n\r\n\tcurr_sum = 0\r\n\tcum_sum = list()\r\n\r\n\tfor i in weights:\r\n\t\tcurr_sum += i\r\n\t\tcum_sum.append(curr_sum)\r\n\t# print(cum_sum)\r\n\tmin_cost = r*curr_sum + (n-1)*qr\r\n\r\n\tfor i in range(1, n+1):\r\n\t\ttaskl = i\r\n\t\ttaskr = n - i\r\n\r\n\t\tcost = l*cum_sum[taskl-1] + r*(cum_sum[-1]-cum_sum[taskl-1])\r\n\t\t# print(cost)\r\n\t\tif taskl > taskr:\r\n\t\t\tcost += ql*(taskl-taskr-1)\r\n\t\telif taskr > taskl:\r\n\t\t\tcost += qr*(taskr-taskl-1)\r\n\t\t# print(i, cost)\r\n\t\tmin_cost = min(min_cost, cost)\r\n\r\n\tprint(min_cost)", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n,l,r,ql,qr=[int(x) for x in input().split()]\r\n arr=[int(x) for x in input().split()]\r\n #ans=1000000000000\r\n temp1,temp2=[],[]\r\n curr=0\r\n for i in arr:\r\n curr+=i\r\n temp1.append(curr)\r\n curr=0\r\n for i in arr[::-1]:\r\n curr+=i\r\n temp2.append(curr)\r\n temp2=temp2[::-1]\r\n ans=min(l*sum(arr)+(n-1)*ql,r*sum(arr)+(n-1)*qr)\r\n for i in range(n-1):\r\n \r\n curr=temp1[i]*l+temp2[i+1]*r\r\n if i+1>n-(i+1):\r\n curr+=(2*(i+1)-n-1)*ql\r\n elif i+1<n-(i+1):\r\n curr+=(n-2*(i+1)-1)*qr\r\n #print(curr)\r\n ans=min(ans,curr)\r\n print(ans)", "n, l, r, ql, qr = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nsum = 0\r\nsums = []\r\nfor i in range(n):\r\n sum += w[i]\r\n sums.append(sum)\r\n\r\nmin = r * sum + qr * (n - 1)\r\nfor i in range(n):\r\n ss = l * sums[i] + r * (sum - sums[i])\r\n if i + 1 > n - i - 1 and i - n + i + 1 > 0:\r\n ss += ql * (i - n + i + 1)\r\n elif i + 1 < n - i - 1 and n - i - 2 - i > 1:\r\n ss += qr * (n - i - 2 - i - 1)\r\n if ss < min:\r\n min = ss\r\nprint(min)\r\n\r\n", "n, l, r, Ql, Qr = [int(x) for x in input().split(' ')]\r\nw = [int(x) for x in input().split(' ')];\r\nsum = [0 for x in range(n+1)];\r\nfor i in range(1, n+1):\r\n\tsum[i] = sum[i-1] + w[i-1];\r\nans = 2**32;\r\nfor k in range(0, n+1):\r\n\ttemp = sum[k]*l + (sum[n] - sum[k])*r;\r\n\tif (2*k > n):\r\n\t\ttemp += (2*k-n-1)*Ql;\r\n\telif (2*k < n):\r\n\t\ttemp += (n-2*k-1)*Qr;\r\n\tans = min(ans, temp);\r\nprint(ans);", "'''\r\nhttps://codeforces.com/problemset/problem/354/A\r\n\r\n输入 n(1≤n≤1e5) l r(1≤l,r≤100) ql qr(1≤l,r≤1e4) 和长为 n 的双端队列 q(1≤q[i]≤100)。\r\n每次操作弹出 q 的队首或者队尾，代价分别为 l*a[i] 和 r*a[i]。\r\n如果上一次和当前都是弹出队首，则代价额外加上 ql。\r\n如果上一次和当前都是弹出队尾，则代价额外加上 qr。\r\n输出清空 q 的最小代价。\r\n\r\n\r\n输入\r\n3 4 4 19 1\r\n42 3 99\r\n输出 576\r\n\r\n输入\r\n4 7 2 3 9\r\n1 2 3 4\r\n输出 34\r\n'''\r\n\r\n\r\nfrom cmath import inf\r\nfrom functools import cache\r\nfrom itertools import accumulate\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, l, r, ql, qr = _nA()\r\n a = _nA()\r\n ps = list(accumulate(a, initial=0))\r\n\r\n def f(i):\r\n if n-i > i:\r\n return l*ps[i]+r*(ps[-1]-ps[i])+qr*(n-i-i-1)\r\n elif i > n-i:\r\n return l*ps[i]+r*(ps[-1]-ps[i])+ql*(i-(n-i)-1)\r\n else:\r\n return l*ps[i]+r*(ps[-1]-ps[i])\r\n x = min(min(f(i) for i in range(n)), l*ps[-1]+ql*(n-1))\r\n print(x)\r\n\r\n\r\nsolve()\r\n", "n, l , r, ql , qr = map(int,input().split())\nw = [0] + list(map(int,input().split()))\nfor i in range (1,n+1):\n w[i] += w[i-1]\ns = w[n]\nprint(min(l*w[i] + r*(s-w[i]) + ql*max(0,2*i-n-1) + qr*max(0,n-2*i-1) for i in range(n+1)))\n\n \t \t\t \t\t \t\t\t\t\t \t \t\t\t\t \t", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n,l,r,Qi,Qr = get_ints_in_variables()\r\n arr = get_ints_in_list()\r\n leftMost = [arr[0]*l]\r\n tmp = arr[0]*l\r\n for i in range(1, n):\r\n tmp += (arr[i]*l)\r\n leftMost.append(tmp)\r\n \r\n right = [arr[n-1]*r]\r\n tmp = arr[n-1]*r\r\n start = n-2\r\n while start > -1:\r\n tmp += (arr[start]*r)\r\n right.append(tmp)\r\n start -= 1\r\n \r\n rightMost = []\r\n start = n-1\r\n for i in range(0, n):\r\n rightMost.append(right[start])\r\n start -= 1\r\n \r\n mn = sys.maxsize\r\n for i in range(0, n-1):\r\n leftSide = i+1\r\n rightSide = (n-(i+1))\r\n if leftSide+1 == rightSide or leftSide == rightSide+1 or leftSide == rightSide:\r\n tot = leftMost[i]+rightMost[i+1]\r\n elif leftSide < rightSide:\r\n rightSide -= (leftSide+1)\r\n tot = (leftMost[i]+rightMost[i+1])+(rightSide*Qr)\r\n else:\r\n leftSide -= (rightSide+1)\r\n tot = (leftMost[i]+rightMost[i+1])+(leftSide*Qi)\r\n if tot < mn:\r\n mn = tot\r\n\r\n \r\n # print(leftMost)\r\n # print(rightMost)\r\n \r\n if mn > leftMost[n-1]+(n-1)*Qi:\r\n mn = leftMost[n-1]+(n-1)*Qi\r\n if mn > rightMost[0]+(n-1)*Qr:\r\n mn = rightMost[0]+(n-1)*Qr\r\n print(mn)\r\n\r\n\r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "# Problem: A. Vasya and Robot\r\n# Contest: Codeforces - Codeforces Round 206 (Div. 1)\r\n# URL: https://codeforces.com/problemset/problem/354/A\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\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/354/A\r\n\r\n输入 n(1≤n≤1e5) l r(1≤l,r≤100) ql qr(1≤l,r≤1e4) 和长为 n 的双端队列 q(1≤q[i]≤100)。\r\n每次操作弹出 q 的队首或者队尾，代价分别为 l*a[i] 和 r*a[i]。\r\n如果上一次和当前都是弹出队首，则代价额外加上 ql。\r\n如果上一次和当前都是弹出队尾，则代价额外加上 qr。\r\n输出清空 q 的最小代价。\r\n输入\r\n3 4 4 19 1\r\n42 3 99\r\n输出 576\r\n\r\n输入\r\n4 7 2 3 9\r\n1 2 3 4\r\n输出 34\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, l, r, ql, qr = RI()\r\n a = RILST()\r\n s = sum(a) * r\r\n ans = s + (n - 1) * qr\r\n p = 0\r\n for i, v in enumerate(a, start=1):\r\n p += l * v\r\n s -= r * v\r\n if i > n - i:\r\n x = i - n + i - 1\r\n ans = min(ans, p + s + x * ql)\r\n else:\r\n x = n - i - i - 1\r\n if x >= 1:\r\n ans = min(ans, p + s + x * qr)\r\n else:\r\n ans = min(ans, p + s )\r\n print(ans)\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 math\r\nimport sys\r\nimport time\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heappush, heappop\r\nfrom itertools import permutations\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(input().split())\r\n\r\n\r\ndef mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef gmi():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef lgmi():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef lii():\r\n return list(map(int, input().split()))\r\n\r\nn,l,r,ql,qr = mi()\r\na = lii()\r\nans = float('inf')\r\npre = [0]\r\nsuf = [0] * (n + 1)\r\nfor i in range(n):\r\n pre.append(pre[-1] + a[i] * l)\r\nfor i in range(n - 1,-1,-1):\r\n suf[i] = suf[i + 1] + a[i] * r\r\nans = suf[0] + qr * (n - 1)\r\nfor i in range(n):\r\n ll,rr = i + 1,n - i - 1\r\n add = 0\r\n if ll < rr:\r\n add = (rr - ll - 1) * qr\r\n elif ll > rr:\r\n add = (ll - rr - 1) * ql\r\n ans = min(ans,pre[i + 1] + suf[i + 1] + add)\r\nprint(ans)\r\n\r\n", "n,l,r,ql,qr = map(int,input().split())\r\nw = list(map(int, input().split()))\r\n\r\ns = [0, *w]\r\nfor i in range(1, n+1): s[i] += s[i-1]\r\n\r\nc_min = s[n]*r + (n-1)*qr\r\nfor i in range(1, n+1):\r\n cc = l*s[i] + (s[n]- s[i])*r\r\n if 2*i < n:\r\n cc += (n-2*i-1)*qr\r\n elif 2*i > n:\r\n cc += (i-(n-i) -1)*ql\r\n c_min = min(c_min, cc)\r\n\r\nprint(c_min)\r\n", "# LUOGU_RID: 99429204\nn, l, r, ql, qr = map(int, input().split())\r\na = [int(v) for v in input().split()]\r\nsum = sum(a)\r\nans = qr * (n-1) + sum * r\r\nlsum = 0\r\nfor i in range(n):\r\n L = i + 1\r\n R = n - L\r\n lsum += a[i]\r\n rsum = sum - lsum\r\n if abs(L - R) <= 1:\r\n ans = min(ans, lsum * l + rsum * r)\r\n else:\r\n ans = min(ans, lsum * l + rsum * r + max(0, L - R - 1) * ql + max(0, R - L - 1) * qr)\r\nprint(ans)", "n,l,r,ql,qr=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\n#brute force is the mother of all approaches \r\nmini=10**20 \r\nsm=sum(arr)\r\nappaji=0\r\ncurr=0 \r\nfor i in range(n+1):\r\n if i>0:\r\n curr+=arr[i-1]\r\n now=curr*l+(sm-curr)*r \r\n j=n-i \r\n if i>j: \r\n now+=(i-j-1)*ql # appaji 1 \r\n if j>i:\r\n now+=(j-i-1)*qr #appaji 2 \r\n mini=min(mini,now)\r\nprint(mini)", "from collections import defaultdict\r\n\r\ndef L():\r\n\treturn input()\r\n\r\ndef LI():\r\n\treturn int(input())\r\n\r\ndef LII():\r\n\treturn list(map(int, input().split()))\r\n\r\ndef solve():\r\n\tn, l, r, ql, qr = LII()\r\n\tarr = LII()\r\n\tl_sum, r_sum = 0, sum(arr) * r\r\n\tglobal_min = r_sum + (n - 1) * qr\r\n\r\n\tfor idx, val in enumerate(arr):\r\n\t\tl_sum, r_sum = l_sum + val * l, r_sum - val * r\r\n\t\tl_cnt, r_cnt = idx + 1, n - idx - 1\r\n\t\tlocal_min = l_sum + r_sum + max(0, l_cnt - r_cnt - 1) * ql + max(0, r_cnt - l_cnt - 1) * qr\r\n\t\tif local_min < global_min:\r\n\t\t\tglobal_min = local_min\r\n\t\r\n\tprint(global_min)\r\n\r\nsolve()", "\r\nn, l, r, ql, qr = map(int, input().split())\r\nq = list(map(int, input().split()))\r\n# 一开始都从队尾弹出\r\nval = sum(q) * r\r\nres = val + qr * (n - 1)\r\nfor i in range(1, n + 1):\r\n j = n - i\r\n val += l * q[i - 1] - r * q[i - 1]\r\n if i < j:\r\n res = min(res, val + qr * (j - i - 1))\r\n elif i > j:\r\n res = min(res, val + ql * (i - j - 1))\r\n else:\r\n res = min(res, val)\r\nprint(res) ", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nN = 10**5 + 5\r\nn, l, r, q1, q2 = map(int, input().split())\r\nw = [int(x) for x in input().split()]\r\npre = [0] * N\r\nfor i in range(n):\r\n pre[i + 1] = pre[i] + w[i]\r\n\r\nans = 10**18\r\n\r\nfor i in range(n + 1):\r\n curr = pre[i] * l + (pre[n] - pre[i]) * r\r\n x, y = i, n - i\r\n if(x < y):\r\n curr += q2 * (y - x - 1)\r\n elif(x > y):\r\n curr += q1 * (x - y - 1)\r\n ans = min(ans, curr)\r\nprint(ans)\r\n", "path = list(map(int, input().split()))\r\nn, L, R, QL, QR = path[0], path[1], path[2], path[3], path[4]\r\nw = list(map(int, input().split()))\r\n\r\nsumpref = [0]\r\nfor i in range(1, n + 1) :\r\n sumpref.append(w[i - 1] + sumpref[i - 1])\r\n\r\nanswer = QR * (n - 1) + sumpref[n] * R\r\n\r\nfor i in range(1, n + 1) :\r\n energy = L * sumpref[i] + R * (sumpref[n] - sumpref[i])\r\n if i > (n - i) :\r\n energy += (i - (n - i) - 1) * QL\r\n elif (n - i) > i :\r\n energy += ((n - i) - i - 1) * QR\r\n if answer > energy:\r\n answer = energy\r\n\r\nprint(answer)", "def 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\nn, l, r, ql, qr = MII()\r\na = LII()\r\npre = [0] * n\r\nsuf = [0] * n\r\nfor i in range(n): \r\n pre[i] = a[i]\r\n if i: pre[i] += pre[i - 1]\r\nfor i in range(n - 1, -1, -1):\r\n suf[i] = a[i]\r\n if i < n - 1: suf[i] += suf[i + 1]\r\nans = 10 ** 18\r\nfor i in range(-1, n):\r\n cntl, cntr = i + 1, n - 1 - i\r\n suml = 0 if i == -1 else pre[i]\r\n sumr = 0 if i == n - 1 else suf[i + 1]\r\n diff = abs(cntl - cntr)\r\n diff -= 1\r\n diff = max(0, diff)\r\n val = l * suml + r * sumr + diff * (ql if cntl > cntr else qr)\r\n ans = min(ans, val)\r\nprint(ans)", "\r\n\r\nfrom collections import defaultdict\r\nimport math\r\nimport sys \r\nfrom bisect import bisect_right\r\n\r\ndef clc():\r\n n,l,r,ql,qr = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n summ = sum(arr)\r\n ans = r*summ +(n-1)*qr\r\n \r\n left= 0\r\n for i in range(0,n):\r\n left+=arr[i]\r\n right = summ-left \r\n curr = left*l +right*r \r\n #print(curr,left,right,l,r)\r\n left_part = i+1 \r\n right_part = n-left_part\r\n #print(left_part,right_part,left,right)\r\n if(left_part>right_part):\r\n \r\n curr+=(max(0,(left_part-right_part-1))*ql)\r\n else:\r\n curr+=(max(0,(right_part-left_part-1))*qr)\r\n \r\n ans= min(ans,curr)\r\n #print(ans)\r\n print(ans)\r\n return True\r\ncc = clc()\r\n\r\nif not cc :\r\n print(-1)\r\n ", "MOD=10**9+7\r\ndef slove():\r\n # n=int(input())\r\n # m=input()\r\n n,l,r,ql,qr=list(map(int,input().split(' ')))\r\n a=list(map(int,input().split(' ')))\r\n acc=[0]\r\n for x in a:\r\n acc.append(acc[-1]+x)\r\n ans=min(acc[n]*r+(n-1)*qr,acc[n]*l+(n-1)*ql)\r\n for i in range(n//2):\r\n left=acc[i+1] #[0,i]\r\n right=acc[n]-acc[n-1-i] #[n-i-1,n-1]\r\n rest=acc[n-i-1]-acc[i+1]\r\n d=n-2*(i+1)\r\n \r\n if d>=1: d-=1\r\n front=left*l+right*r+rest*l+d*ql\r\n tail=left*l+right*r+rest*r+d*qr\r\n ans=min(ans,front,tail)\r\n # print(d)\r\n print(ans)\r\n \r\n return\r\n\r\n\r\n# t=int(input())\r\nt=1\r\n# M=1<<30\r\nfor _ in range(t):\r\n slove()\r\n ", "n,l,r,ql,qr = map(int, input().split())\r\na = list(map(int, input().split()))\r\nright = sum(a)\r\nleft = 0\r\nans = right*r + (n - 1)*qr\r\nfor i in range(n):\r\n left += a[i]\r\n right -= a[i]\r\n\r\n rightTime = n - i - 1\r\n leftTime = i + 1\r\n if leftTime > rightTime:\r\n ans = min(ans, left*l + right*r + (leftTime - rightTime - 1)*ql)\r\n elif leftTime < rightTime:\r\n ans = min(ans, left*l + right*r + (rightTime - leftTime - 1)*qr)\r\n else:\r\n ans = min(ans, left*l + right*r)\r\nprint(ans)", "n,l,r,Ql,Qr = map(int,input().split())\r\nw = list(map(int,input().split())) \r\ncount = 0 \r\nx = sum(w)*r\r\npr = (n-1)*Qr \r\npl = 0*Ql \r\nmn = x+pr \r\n\r\nfor i in range(1,n+1):\r\n x = x-w[i-1]*r+w[i-1]*l\r\n mn = min(mn,x+ max(0,n-(2*i+1))*Qr + max(0,-n+2*i-1)*Ql) \r\n #print(mn)\r\n \r\nprint(mn)", "import sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nM = lambda:map(int,input().split())\r\ninf = float('inf')\r\nn,l,r,ll,rr = M()\r\nw = list(M())\r\nres = inf\r\npre = 0\r\nsuf = sum(w)\r\nfor i in range(n+1):\r\n le,re = i,n-i\r\n if abs(re-le) <= 1:\r\n res = min(res,pre*l+suf*r)\r\n elif le < re:\r\n res = min(res,pre*l+suf*r+(re-le-1)*rr)\r\n else:\r\n res = min(res,pre*l+suf*r+(le-re-1)*ll)\r\n if i != n:\r\n suf -= w[i]\r\n pre += w[i]\r\nprint(res)", "\r\n\r\nif __name__ == \"__main__\":\r\n n, l, r, ql, qr = map(int, input().split())\r\n w = list(map(int, input().split()))\r\n\r\n s = [0] * (n+1)\r\n for i in range(1, n+1):\r\n s[i] = s[i-1] + w[i-1]\r\n\r\n res = float(\"inf\")\r\n for i in range(n+1):\r\n v = l * s[i] + r * (s[n] - s[i])\r\n if i > n - i:\r\n v += (2 * i - n - 1) * ql \r\n else:\r\n v += max(n - 2 * i - 1, 0) * qr\r\n res = min(res, v)\r\n print(res)", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n n, l, r, ql, qr = map(int, input().split())\r\n L = list(map(int, input().split()))\r\n ans = sum(L) * r + (n - 1) * qr\r\n flag = sum(L) * r\r\n for i in range(n):\r\n left_len = i + 1\r\n right_len = n - i - 1\r\n flag += L[i] * l - L[i] * r\r\n if left_len >= right_len:\r\n res = flag + max(0, left_len - 1 - right_len) * ql\r\n else:\r\n res = flag + max(0, right_len - 1 - left_len) * qr\r\n ans = min(ans, res)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def main(arr,l,r,q1,q2):\r\n\r\n n=len(arr)\r\n prefix=[0] \r\n\r\n for i in range(len(arr)):\r\n prefix.append(prefix[-1]+arr[i])\r\n ans=float('inf')\r\n \r\n for i in range(0,n+1):\r\n\r\n left=i \r\n right=n-i \r\n\r\n left_s=prefix[left] \r\n right_s=prefix[-1]-left_s\r\n if left==right:\r\n ans=min(ans,left_s*l+right_s*r+(q1*(left-right)))\r\n\r\n elif left>right:\r\n ans=min(ans,left_s*l+right_s*r+(q1*(left-right-1)))\r\n else:\r\n ans=min(ans,left_s*l+right_s*r+(q2*(right-left-1)))\r\n return ans\r\n \r\n\r\nn,l,r,q1,q2=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nprint(main(arr,l,r,q1,q2))\r\n", "\"\"\" My template \"\"\"\n# x0,y0,ax,ay,bx,by = list(map(int,input().split()))\n# xs,ys,t = list(map(int,input().split()))\n# V = []\n# for i in range(61):\n# V.append([x0,y0])\n# x0=ax*x0+bx;y0=ay*y0+by;\n# A=0\n# for i in range(61):\n# for j in range(i,61):\n# ans=min(abs(xs-V[i][0])+abs(ys-V[i][1]),abs(xs-V[j][0])+abs(ys-V[j][1]))\n# for k in range(i,j):\n# ans=ans+abs(V[k+1][0]-V[k][0])+abs(V[k+1][1]-V[k][1])\n# if ans<=t:\n# A=max(A,j-i+1);\n# print(A)\n\n# def f(s):\n# s = str(s)\n# ans = 0\n# for i in s:\n# ans += int(i)\n# return ans\n\nimport math\nimport itertools\nn, L, R, Ql, Qr = list(map(int, input().split()))\nw = list(map(int, input().split()))\npw = list(itertools.accumulate(w))\nts = sum(w)\nans = math.inf\nfor i in range(n+1):\n l = i\n r = n - i\n if l > 0:\n lsum = pw[i-1]\n else:\n lsum = 0\n rsum = ts - lsum\n if l < r:\n ans = min(ans, L*lsum + rsum*R + max((r-l-1)*Qr, 0))\n else:\n ans = min(ans, L*lsum + rsum*R + max((l-r-1)*Ql, 0))\nprint(ans)\n", "from math import inf\n\nn, l, r, ql, qr = map(int, input().split())\n\nq = list(map(int, input().split()))\n\nf = [0] * (n + 1)\nfor i in range(1, n + 1):\n f[i] += f[i - 1] + q[i - 1]\nans = inf\nfor i in range(0, n + 1):\n sl = f[i] * l\n sr = (f[n] - f[i]) * r\n cL = i\n cR = n - i\n sum = sl + sr\n if cL > cR:\n sum += (cL - cR - 1) * ql\n elif cR > cL:\n sum += (cR - cL - 1) * qr\n ans = min(ans, sum)\nprint(ans)", "import sys\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\n\r\nn, l, r, ql, qr = RI()\r\nnums = list(RI())\r\n\r\na = [0]\r\nfor v in nums:\r\n a.append(a[-1] + v)\r\n\r\n# 枚举分割点[0, i - 1]是左侧， [i, n - 1]是右侧\r\nans = float(\"inf\")\r\nfor i in range(n + 1):\r\n t = a[i] * l + (a[n] - a[i]) * r\r\n # 左边右边各几个?\r\n l_cnt = i\r\n r_cnt = n - i\r\n if abs(l_cnt - r_cnt) > 1:\r\n if l_cnt > r_cnt:\r\n t += (l_cnt - r_cnt - 1) * ql\r\n else:\r\n t += (r_cnt - l_cnt - 1) * qr\r\n ans = min(ans, t)\r\n\r\nprint(ans)" ]

[ "n=int(input())\nL=list(map(int,input().split()))\ni=0\nsol=[L[0]]\nwhile i+2<len(L)-1:\n if L[i+1]>L[i+2]:\n sol.append(L[i+1])\n i+=1\n else:\n sol.append(L[i+2])\n i+=2\nsol.append(L[len(L)-1])\nprint(min(sol))\n\t\t \t \t \t\t\t \t \t \t\t \t \t \t", "n=int(input())\nl=list(map(int,input().split()))\np=min(l[0],l[-1])\ng=5\nfor i in range(p):\n while i in l:\n o=l.index(i)\n l[o]=\".\"\n if l[o-1]==\".\" or l[o+1]==\".\":p=i;g=3;break\n if g==3:break\nprint(p)\n\n \t\t \t\t\t\t\t\t \t \t \t\t \t\t \t \t", "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 = iia()\r\nm = float(\"inf\")\r\nfor i in range(n):\r\n if i == 0 or i == n - 1:\r\n m = min(m, arr[i])\r\n if i < n - 2:\r\n m = min(m,max(arr[i + 1], arr[i + 2]))\r\n elif i<n-1:\r\n m = min(m, arr[i + 1])\r\nprint(m)", "import sys\nimport math as mt\ninput=sys.stdin.buffer.readline \nimport math as mt \n\n#t=int(input())\nt=1\nfor __ in range(t):\n #n,m=map(int,input().split())\n n=int(input())\n a=list(map(int,input().split()))\n mini=min(a[0],a[-1])\n i=0\n while i<n-2:\n \n if a[i+1]>a[i+2]:\n mini=min(mini,a[i+1])\n else:\n mini=min(mini,a[i+2])\n i+=1\n i+=1\n \n print(mini) \n \n \n \n \n \n \n \n \n \n \n \n \n \n\t \t \t\t \t\t \t\t\t \t \t", "import time,sys,io,math\r\ninp=sys.stdin.readline\r\npr=sys.stdout.write\r\n\r\ndef solve():\r\n n=int(inp())\r\n a=[int(i) for i in inp().split()]\r\n b=[(a[i],i) for i in range(n)]\r\n b.sort()\r\n check=[1 for _ in range(n)]\r\n for el in b:\r\n if el[1]==0 or el[1]==n-1:\r\n pr(f\"{el[0]}\"+\"\\n\")\r\n break\r\n if check[el[1]-1]==0 or check[el[1]+1]==0:\r\n pr(f\"{el[0]}\"+\"\\n\")\r\n break\r\n check[el[1]]=0\r\n\r\nstart=time.time()\r\nt=1\r\n#t=int(inp())\r\nfor _ in range(t):\r\n solve()\r\n#pr(f\"Time lapsed: {time.time()-start}\")", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\na = [int(x) for x in (sys.stdin.readline()).split()]\r\n \r\ni = 0\r\nres = a[i]\r\nwhile(i < n - 2):\r\n if(a[i + 1] > a[i + 2]):\r\n if(a[i + 1] < res):\r\n res = a[i + 1]\r\n i += 1\r\n else:\r\n if(a[i + 2] < res):\r\n res = a[i + 2]\r\n i += 2\r\n\r\nif(a[n - 1] < res):\r\n res = a[n - 1] \r\nprint(res)\r\n \r\n ", "n = int(input())\narr = [int(x) for x in input().split()]\nminimum_value = max(arr)+1\nfor i in range(n-1):\n\ttemp = max(arr[i], arr[i+1])\n\tminimum_value = min(minimum_value, temp)\nminimum_value = min(arr[0], arr[-1], minimum_value)\nprint(minimum_value)", "n = int(input())\np = [int(x) for x in input().split()]\nans = min(p[-1], p[0])\n\nfor i in range(n - 1):\n if max(p[i], p[i + 1]) < ans:\n ans = max(p[i], p[i + 1])\n\nprint(ans)\n", "n, t = int(input()), list(map(int, input().split()))\n\nprint(min(min(max(t[i], t[i + 1]) for i in range(1, n - 2)), t[0], t[n - 1]) if n > 2 else min(t))\n\n\n\n# Made By Mostafa_Khaled", "import sys\r\ndef main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n dmax = max(a)\r\n for d in range(dmax+1):\r\n nok = 0\r\n for i in range(n-2):\r\n if (a[i+1] <= 0 and a[i+2] <= 0):\r\n nok = 1\r\n if (a[0] <= 0 or a[-1] <= 0 or nok):\r\n print(d)\r\n break\r\n for i in range(n):\r\n a[i]-=1\r\nif __name__ == \"__main__\":\r\n ##sys.stdin = open(\"in.txt\",'r') \r\n ##sys.stdout = open(\"out.txt\",'w')\r\n main()\r\n ##sys.stdin.close()\r\n ##sys.stdout.close()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nf=1\r\nwhile f:\r\n m=10000\r\n for i in range(n):\r\n if l[i]:\r\n m=min(m,l[i])\r\n c=c+m\r\n for i in range(n):\r\n if l[i]:\r\n l[i]=l[i]-m\r\n if l[0]==0 or l[-1]==0:\r\n f=0\r\n break\r\n for i in range(n-1):\r\n if l[i]==0 and l[i+1]==0:\r\n f=0\r\n break\r\nprint(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = float('inf')\r\nfor i in range(n-2):\r\n ans = min (ans,max(a[i],a[i+1]))\r\nans = min(ans,a[n-1],a[0])\r\nprint(ans)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nprint(min(A[0], A[-1],\r\n min((max(A[i],A[i+1]) for i in range(1,n-2)), default=A[0])))", "def di():return map(int, input().split())\r\ndef ii():return int(input())\r\ndef li():return list(map(int, input().split()))\r\ndef si():return list(map(str, input()))\r\nfrom collections import Counter\r\nimport math\r\nclass YourTupleComparator(tuple):\r\n def __lt__(self, other):\r\n return self[1] < other[1]\r\n# n=int(input())\r\n# import sys\r\n# for i in range(int(input())):\r\n # arr=list(map(int,input().split()))\r\n # n,m,k=map(int,input().split())\r\nn=ii()\r\narr=li()\r\nsort=sorted(arr)\r\nmn=1000\r\nfor i in range(n-1):\r\n temp=[arr[i],arr[i+1]]\r\n mn=min(mn,max(temp))\r\nprint(min(arr[0],arr[-1],mn))", "def solve(n, arr):\r\n edge_break = min(arr[0], arr[-1])\r\n i = 1\r\n mid_break = edge_break\r\n while i < n-2:\r\n mbt = max(arr[i], arr[i+1])\r\n if mbt < mid_break:\r\n mid_break = mbt\r\n i += 1\r\n return min(edge_break, mid_break)\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(solve(n, arr))\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nans=min(a[0],a[n-1])\r\nfor i in range(n-1):\r\n if max(a[i],a[i+1])<ans:ans=max(a[i],a[i+1])\r\nprint(ans)\r\n", "n = int(input())\r\npath = list(map(int,input().split()))\r\nusetiles = []\r\nusetiles.append(path[0])\r\ntiles = 0\r\nwhile tiles<n-1:\r\n\tif tiles==n-2:\r\n\t\tusetiles.append(path[tiles+1])\r\n\t\ttiles+=1\r\n\t\tcontinue\r\n\tif tiles==n-3:\r\n\t\tusetiles.append(path[tiles+2])\r\n\t\ttiles+=2\r\n\t\tcontinue\r\n\tif path[tiles+1]>path[tiles+2]:\r\n\t\tusetiles.append(path[tiles+1])\r\n\t\ttiles+=1\r\n\telse:\r\n\t\tusetiles.append(path[tiles+2])\r\n\t\ttiles+=2\r\n#print(usetiles)\r\nprint(min(usetiles))\r\n\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\nn = I()\r\narr = L()\r\nans = 1001\r\nfor i in range(n-1):\r\n ans = min(ans, max(arr[i],arr[i+1]))\r\n\r\nif arr[0]<ans:\r\n ans = arr[0]\r\nif arr[n-1]<ans:\r\n ans = arr[n-1]\r\n \r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n_max = min(a[0], a[-1])\r\nb = 10**3\r\nfor i in range(1, n-2):\r\n b = min(b, max(a[i], a[i+1]))\r\nprint(min(_max, b))", "import math\r\nimport string\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n if n < 4:\r\n print(min(a[0], a[-1]))\r\n else:\r\n min_days = min(a[0], a[n - 1])\r\n for i in range(1, n - 2):\r\n if max(a[i], a[i + 1]) < min_days:\r\n min_days = max(a[i], a[i + 1])\r\n print(min_days)\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "#!/usr/bin/env python\r\nfrom __future__ import division, print_function\r\nimport math\r\nimport os\r\nimport sys\r\nfrom sys import stdin,stdout\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**5)\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n#sys.setrecursionlimit(10**6)\r\n\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n#-----------------------------------------------------------------\r\n\r\ndef regularbracket(t):\r\n p=0\r\n for i in t:\r\n if i==\"(\":\r\n p+=1\r\n else:\r\n p-=1\r\n if p<0:\r\n return False\r\n else:\r\n if p>0:\r\n return False\r\n else:\r\n return True\r\n\r\n#-------------------------------------------------\r\ndef binarySearchCount(arr, n, key):\r\n left = 0\r\n right = n - 1\r\n\r\n count = 0\r\n\r\n while (left <= right):\r\n mid = int((right + left) / 2)\r\n\r\n # Check if middle element is\r\n # less than or equal to key\r\n if (arr[mid] <= key):\r\n count = mid+1\r\n left = mid + 1\r\n\r\n # If key is smaller, ignore right half\r\n else:\r\n right = mid - 1\r\n return count\r\n#------------------------------reverse string(pallindrome)\r\ndef reverse1(string):\r\n pp=\"\"\r\n for i in string[::-1]:\r\n pp+=i\r\n if pp==string:\r\n return True\r\n return False\r\n#--------------------------------reverse list(paindrome)\r\ndef reverse2(list1):\r\n l=[]\r\n for i in list1[::-1]:\r\n l.append(i)\r\n if l==list1:\r\n return True\r\n return False\r\ndef mex(list1):\r\n #list1 = sorted(list1)\r\n p = max(list1)+1\r\n for i in range(len(list1)):\r\n if list1[i]!=i:\r\n p = i\r\n break\r\n return p\r\ndef sumofdigits(n):\r\n n = str(n)\r\n s1=0\r\n for i in n:\r\n s1+=int(i)\r\n return s1\r\ndef perfect_square(n):\r\n s = math.sqrt(n)\r\n if s==int(s):\r\n return True\r\n return False\r\n#print(perfect_square(16))\r\n#endregion-------------------------------------------\r\n\r\ndef soretd(s):\r\n for i in range(1,len(s)):\r\n if s[i-1]>s[i]:\r\n return False\r\n return True\r\n#print(soretd(\"1\"))\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n l=[arr[0]]\r\n i=1\r\n while(i<len(arr)-2):\r\n if arr[i+1]>arr[i]:\r\n l.append(arr[i+1])\r\n i+=2\r\n else:\r\n l.append(arr[i])\r\n i+=1\r\n l.append(arr[n-1])\r\n print(min(l))\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nanswer = min(l[0], l[-1])\r\n\r\nfor i in range(0, n-1):\r\n answer= min(answer, max(l[i], l[i+1]))\r\n\r\nprint(answer)", "n=int(input())\r\nL=list(map(int,input().split()))\r\nif(n<=2):\r\n print(min(L))\r\nelif(n==3):\r\n print(min(L[0],L[2]))\r\nelse:\r\n i=1\r\n e=n-2\r\n ans=1000\r\n while(i<e):\r\n ans=min(ans,max(L[i],L[i+1]))\r\n i+=1\r\n print(min(ans,L[0],L[-1]))\r\n ", "\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nr = 0\r\nf = True\r\nwhile f :\r\n for i in range(n):\r\n arr[i] -=1\r\n\r\n for i in range(1 , n):\r\n if arr[i] <= 0 and arr[i-1] <= 0 :\r\n f = False\r\n break\r\n \r\n r += 1 \r\n if arr[0] <= 0 or arr[-1] <= 0 :\r\n break\r\n\r\nprint(r)\r\n\r\n", "def find_min_days_to_reach_n(n, a):\r\n dp = [0] * (n + 1)\r\n dp[1] = a[0]\r\n for i in range(2, n + 1):\r\n dp[i] = min(a[i - 1], max(dp[i - 1], dp[i - 2]))\r\n return dp[n]\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n min_days = find_min_days_to_reach_n(n, a)\r\n print(min_days)\r\nif __name__ == \"__main__\":\r\n main()# 1690223548.064376", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 10 ** 4\r\nans = min(a[0], a[-1])\r\nfor i in range(n - 1):\r\n ans = min(ans, max(a[i], a[i + 1]))\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = a[0]\r\ni = 0\r\n\r\nwhile i < n-2:\r\n if a[i+1] > a[i+2]:\r\n if a[i+1] < ans:\r\n ans = a[i+1]\r\n i += 1\r\n else:\r\n if a[i+2] < ans:\r\n ans = a[i+2]\r\n i += 2\r\n\r\nif a[-1] < ans:\r\n ans = a[-1]\r\n \r\nprint(ans)\r\n", "\n\nif __name__ == '__main__':\n n = int(input())\n tab = list(map(int, input().split()))\n smallest = 10**3 + 1\n for i in range(len(tab) - 1):\n if smallest > tab[i] and (tab[i - 1] <= tab[i] or tab[i + 1] <= tab[i]):\n smallest = tab[i]\n\n smallest = min([smallest, tab[0]])\n smallest = min([smallest, tab[-1]])\n\n print(smallest)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=min(l[0],l[-1])\r\nfor i in range(1,len(l)-2):\r\n d=min(d,max(l[i],l[i+1]))\r\nprint(d)\r\n ", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nk = 10**4\r\nfor i in range(1,n):\r\n k = min(max(l[i],l[i-1]),k)\r\nk = min((k,l[0],l[-1])) \r\nprint(k)", "n = int(input())\r\n\r\ndata = [int(x) for x in input().split()]\r\nanswers = []\r\nanswers.append(data[0])\r\nfor i in range(1, len(data) - 2):\r\n answers.append(max(data[i], data[i + 1]))\r\nanswers.append(data[-1])\r\nprint(min(answers))", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=min(l[0],l[-1])\r\ng=5\r\nfor i in range(p):\r\n while i in l:\r\n o=l.index(i)\r\n l[o]=\".\"\r\n if l[o-1]==\".\" or l[o+1]==\".\":p=i;g=3;break\r\n if g==3:break\r\nprint(p)\r\n", "n=int(input()) \r\nl=list(map(int,input().split(' '))) \r\na=0\r\nb=max(l) \r\nc=True\r\nwhile c:\r\n a=a+1\r\n for i in range(n):\r\n if l[i]>0:\r\n l[i]=l[i]-1\r\n if l[0]==0:\r\n c=False\r\n if l[n-1]==0:\r\n c=False\r\n for i in range(1,n-2):\r\n if l[i]==0 and l[i+1]==0:\r\n c=False\r\nprint(a)", "n = int(input())\na = list(map(int,input().split()))\n\nm = max(a)\n\n#algo\ndays = 0\nmiddle = False\nends = False\ni=1\nwhile i <= m:\n\n\tfor j in range(len(a)):\n\t\tif a[j] is not 0:\n\t\t\ta[j] = a[j] - 1\n\t#print (a)\t\n\tif a[0] is 0 or a[len(a)-1] is 0:\n\t\tdays = i\n\t\tends= True\n\t\tbreak\n\tfor j in range(1,len(a)-1):\n\t\tif a[j] == 0 and a[j-1] == 0:\n\t\t\tdays = i\n\t\t\tmiddle = True\n\t\t\tbreak\n\tif middle == True or ends == True:\n\t\tbreak\n\ti+=1\t\t\t\nprint (days)", "n = int(input())\r\na = [int(c) for c in input().split()]\r\n\r\nans = 1e6 + 7\r\nfor i in range(n-1):\r\n cur = max(a[i], a[i+1])\r\n if cur < ans:\r\n ans = cur\r\n\r\nans = min(ans, a[0], a[n-1])\r\nprint(ans)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = A.copy()\r\nB.sort()\r\na = []\r\nflag = 1\r\nfor i in B:\r\n if flag:\r\n indi = [m for m, x in enumerate(A) if x == i]\r\n for ind in indi:\r\n if ind == 0 or ind == n-1:\r\n print(i)\r\n flag = 0\r\n break\r\n elif ind-1 in a or ind+1 in a:\r\n print(i)\r\n flag = 0\r\n break\r\n else:\r\n a.append(ind)\r\n else:\r\n break\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nxx=[]\r\nxx.append(x[0])\r\nxx.append(x[-1])\r\nfor i in range(1,n-1):\r\n xx.append(max(x[i],x[i+1]))\r\nprint(min(xx))", "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()\r\n PI=float('inf')\r\n dp=[0]*n\r\n if n<=2:\r\n print(min(a[0],a[-1]))\r\n continue\r\n dp[0]=a[0]\r\n dp[1]=min(a[0],a[1])\r\n for i in range(2,n):\r\n dp[i]=min(a[i],max(dp[i-1],dp[i-2]))\r\n # print(dp)\r\n print(dp[-1])", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nm=min(list1[0],list1[-1])\r\ni=1\r\nwhile(True):\r\n if(i<n and i+1<n):\r\n if(list1[i]>=list1[i+1]):\r\n m=min(m,list1[i])\r\n i+=1\r\n else:\r\n m=min(m,list1[i+1])\r\n i+=2\r\n else:\r\n break\r\n \r\nprint(m)", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(max(a)):\r\n if a[0]==0 or a[-1]==0:\r\n print(count)\r\n exit()\r\n for k in range(n-1):\r\n if a[k]==0 and a[k+1]==0:\r\n print(count)\r\n exit()\r\n count+=1\r\n for j in range(n):\r\n if a[j]>0:\r\n a[j]-=1\r\nprint(count)\r\n\r\n\r\n\r\n", "n = int(input())\n\narr = list(map(int, input().split()))\n\nres = min(arr[0], arr[n-1])\n\nfor i in range(1, n-1):\n maxi = max(arr[i], arr[i+1])\n\n res = min(res, maxi)\n\n\nprint(res)", "n=int(input())\r\na=[0]+list(map(int,input().split()))+[0]\r\nans=1000000000\r\nfor i in range(n + 1):\r\n ans=min(ans,max(a[i], a[i+1]))\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nf = l[0]\r\ns = l[-1]\r\na = []\r\na.append(f)\r\na.append(s)\r\nwhile n:\r\n m = min(l)\r\n if m in a:\r\n print(m)\r\n break\r\n else:\r\n a.append(l[l.index(m)+1])\r\n a.append(l[l.index(m)-1])\r\n l.remove(m)\r\n #print(*a)\r\n n = n-1", "n,a = int(input()), [0] + list(map(int,input().split())) + [0]\r\nprint(min(max(a[i],a[i+1]) for i in range(n+1)))", "N = int(input())\r\nX = list(map(int, input().split()))\r\nMin, i = X[0], 0\r\nwhile i < N - 1:\r\n Temp = X[i + 1:i + 3]\r\n Min = min(Min, max(Temp))\r\n i += Temp.index(max(Temp)) + 1\r\nprint(min(Min, X[-1]))\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 656\r\n", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\nn = iinput()\r\nA = rlinput()\r\ndestroyed = [False]*n\r\n\r\ndef check(destroyed,i,n):\r\n if i == 0 or i == n-1:\r\n return True\r\n if destroyed[i-1] == True or destroyed[i+1] == True:\r\n return True\r\n return False\r\nA = list(enumerate(A))\r\nA.sort(key = lambda x : x[1])\r\nfor a in A:\r\n destroyed[a[0]] = True\r\n if check(destroyed,a[0],n):\r\n print(a[1])\r\n break\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans = min(a[0], a[-1])\r\nfor i in range(0,len(a)-1):\r\n ans=min(ans,max(a[i],a[i+1]))\r\nprint(ans)", "def mi():\r\n return map(int, input().split())\r\n'''\r\n5\r\n10 2 8 3 5\r\n'''\r\nn = int(input())\r\na = list(mi())\r\nr = a[0]\r\ni = 0\r\nwhile i<n:\r\n# print (r, i)\r\n if i+1<n and i+2<n:\r\n if a[i+1]>a[i+2]:\r\n i = i+1\r\n r = min(r, a[i])\r\n else:\r\n i = i+2\r\n r = min(r, a[i])\r\n elif i+1<n:\r\n i = i+1\r\n r = min(r, a[i])\r\n else:\r\n i+=1\r\nprint (r)\r\n", "import sys\r\ninpu = sys.stdin.buffer.readline\r\nprin = sys.stdout.write\r\nn = int(inpu())\r\na = list(map(int, inpu().split()))\r\nstart = 0\r\nend = 10**3\r\nans = 0\r\nwhile start <= end :\r\n mid = (start + end)//2\r\n np = 0\r\n if (a[0] < mid) or (a[-1] < mid) :\r\n end = mid - 1\r\n continue\r\n for i in range(1, n - 1) :\r\n if (a[i] < mid) and (a[i + 1] < mid) :\r\n np = 1\r\n break\r\n if np == 1:\r\n end = mid - 1\r\n else:\r\n ans = mid\r\n start = mid + 1\r\nprin(str(ans) + '\\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\n\r\ndef main():\r\n if os.path.exists('in.txt'):\r\n input = open('in.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n # --------------------------------INPUT---------------------------------\r\n n = int(input.readline())\r\n lis = list(map(int, input.readline().split()))\r\n\r\n ans = lis[0]\r\n cont_next = False\r\n for i, x in enumerate(lis):\r\n\r\n if cont_next or i == n-1:\r\n cont_next = False\r\n continue\r\n\r\n if i+1 == n-1:\r\n ans = min(ans, lis[i+1])\r\n break\r\n\r\n if lis[i+1] <= lis[i+2]:\r\n cont_next = True\r\n ans = min(ans, lis[i+2])\r\n else:\r\n ans = min(ans, lis[i+1])\r\n\r\n\r\n output = ans\r\n # -------------------------------OUTPUT----------------------------------\r\n if os.path.exists('out.txt'):\r\n open('out.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n# threading.Thread(target=main).start()\r\n", "n = int(input())\r\nif n == 1:\r\n print(input())\r\n exit()\r\ntiles = list(map(int, input().split()))\r\ndays = tiles[0]\r\ni = 0\r\nwhile i<n-1:\r\n days = min(days, max(tiles[i], tiles[i+1]))\r\n i+=1\r\nprint(min(days, tiles[0], tiles[-1]))\r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nday = min(arr[0],arr[-1])\r\nfor i in range(n-2):\r\n day = min(day,max(arr[i+1],arr[i+2]))\r\nprint(day)", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef calc(x):\n d_sum = sum(map(int,str(x)))\n return x*x + d_sum *x\n\ndef solution():\n n = int(input())\n arr = list(map(int, input().split()))\n # find greaterh than prevoise\n # left right pointer\n res = float(\"inf\") \n i = 0\n while i < len(arr):\n res = min(res, arr[i])\n if i + 2 < len(arr) and arr[i+1] < arr[i+2]:\n i += 2\n else:\n i += 1\n\n return print(res)\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = min(a[0], a[-1])\r\nind = 0\r\nwhile ind + 1 < n:\r\n\tans = min(ans, max(a[ind], a[ind + 1]))\r\n\tind += 1\r\nprint(ans)", "n = int(input())\r\narr = [0] + list(map(int, input().split())) + [0]\r\nprint(min(max(arr[i], arr[i + 1]) for i in range(n+1)))\r\n", "n=int(input())\r\nls=list(map(int,input().split()))\r\nmn=min(ls[0],ls[n-1])\r\nfor i in range (n-2,1,-1):\r\n mn=min(mn,max(ls[i],ls[i-1]))\r\nprint(mn)", "n = int(input())\r\na = [int(k) for k in input().split()]\r\ns = min(a[0], a[-1])\r\nfor i in range(n-2):\r\n s = min(s, max(a[i+1], a[i+2]))\r\nprint(s)\r\n\r\n\r\n\r\n", "from math import inf\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\nmax1 = 0\r\nmin1 = inf\r\nfor i in range(1,n-1):\r\n max1 = max(lst[i],lst[i+1])\r\n min1 = min(max1,min1)\r\nprint(min(lst[0],lst[-1],min1))", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nday_0=a[0]\r\nday_n=a[n-1]\r\n\r\nmini_s=2**31\r\nmini=2**31\r\nfor i in range(0,n-1):\r\n temp=max(a[i],a[i+1])\r\n mini=min(mini,temp)\r\n \r\nmini=min(a[0],mini,a[n-1])\r\nprint(mini)", "n = int(input())\ns = list(map(int,input().split()))\na = [0]*n\nfor i in range(n):\n if i == 0:\n a[i]=s[i]\n elif i == 1:\n a[i]=min(s[i],a[i-1])\n else:\n a[i]=max(min(s[i],a[i-1]),min(s[i],a[i-2]))\nprint(a[-1])", "# 192B\r\n\r\nfrom sys import stdin\r\nfrom operator import itemgetter\r\n\r\n__author__ = 'artyom'\r\n\r\nn = int(stdin.readline().strip())\r\na = list(map(int, stdin.readline().strip().split()))\r\np = sorted([[x, i] for i, x in enumerate(a)], key=itemgetter(0))\r\nfor e in p:\r\n a[e[1]] = -1\r\n if e[1] == 0 or e[1] == n - 1 or a[e[1] - 1] == -1 or a[e[1] + 1] == -1:\r\n print(e[0])\r\n exit()", "n=int(input())\r\narr=list(map(int,input().strip().split()))\r\nans=min(arr[0],arr[n-1])\r\na=0;\r\nfor i in arr:\r\n ans=min(ans,max(i,a))\r\n a=i\r\n\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=9999\r\nfor i in range(n-1):\r\n if(l[i]<=l[i+1] and l[i+1]<c):\r\n c=l[i+1]\r\n elif(l[i]>l[i+1] and l[i]<c):\r\n c=l[i]\r\nprint(min(l[0],l[n-1],c))", "n = int(input())\r\narr = list(map(int, input().split()))\r\na = arr.copy()\r\nif arr[0] == 0 or arr[n-1] == 0:\r\n print(0)\r\n exit(0)\r\nmaxi, mini = max(arr), min(arr)\r\nfor i in range(mini, maxi + 1):\r\n for j in range(n):\r\n if arr[j] == i:\r\n a[j] = 0\r\n if j > 0:\r\n if a[j] == 0 and a[j-1] == 0:\r\n print(i)\r\n exit(0)\r\n elif j < n - 1:\r\n if a[j] == 0 and a[j+1] == 0:\r\n print(i)\r\n exit(0)\r\n if a[0] == 0 or a[n-1] == 0:\r\n print(i)\r\n break", "# 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')\ndef check(l, n):\n if l[0] == 0 or l[-1] == 0:\n return False\n i = 0\n while i < n - 1:\n if l[i] == 0 and l[i + 1] == 0:\n return False\n i += 1\n return True\nn = int(input())\nl = list(map(int, input().split()))\nans = min(l)\nold = ans\nm = 0\n\nwhile check(l, n):\n ans += m\n i = 0\n while i < n:\n if l[i] > 0:\n l[i] -= old\n if l[i] != 0:\n if m == 0:\n m = l[i]\n m = min(m, l[i])\n i +=1\n old = m\n \nprint(ans)\n\n\n\n\n", "num=int(input())\r\ndays=list(map(int,input().split()))\r\nmin1=min(days[0],days[num-1])\r\nfor i in range(1,num-1):\r\n if(min1>=days[i] and min1>=days[i+1]):\r\n min1=max(days[i],days[i+1])\r\nprint(min1)", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nb=[a[n-1]]\r\ni=n-1\r\nwhile i>1:\r\n if a[i-1]>a[i-2]:\r\n b.append(a[i-1])\r\n i-=1\r\n else:\r\n b.append(a[i-2])\r\n i-=2\r\nb.append(a[0])\r\nprint(min(b))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nl=[a[0],a[len(a)-1]]\r\nfor i in range(1,len(a)-1):\r\n l.append(max(a[i],a[i+1]))\r\nprint(min(l)) \r\n \r\n \r\n", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import stdin\r\n\r\nn, a, ans = int(input()), arr_inp(), 0\r\n\r\nwhile (True):\r\n mi = min(a)\r\n ans = mi\r\n for i in range(n):\r\n if (i == 0 and a[i] == mi) or (i == n - 1 and a[i] == mi):\r\n exit(print(ans))\r\n elif i > 0 and i < n - 1 and a[i] == mi:\r\n if a[i - 1] == float('inf') or a[i + 1] == float('inf'):\r\n exit(print(ans))\r\n else:\r\n a[i] = float('inf')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\nwhile True:\r\n if a[0] == 0 or a[-1] == 0:\r\n print(res)\r\n break\r\n\r\n j = 0\r\n while j < n:\r\n if j == n - 1:\r\n break\r\n \r\n if j + 2 < n and a[j + 2] > 0:\r\n j += 2\r\n elif j + 1 < n and a[j + 1] > 0:\r\n j += 1\r\n else:\r\n print(res)\r\n exit(0)\r\n\r\n for j in range(n):\r\n a[j] -= 1\r\n\r\n res += 1\r\n", "n = int(input())\r\na = input().split()\r\na = [int(i) for i in a]\r\ns = []\r\nfor i in range(1,len(a)-1):\r\n\tif(a[i]>a[i+1]):\r\n\t\ts.append(a[i])\r\n\telse:\r\n\t\ts.append(a[i+1])\r\n\t\ti = i+1\r\ns.append(a[0])\r\ns.append(a[len(a)-1])\r\nprint(min(s))\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\n\r\nif(n>=3):\r\n l[0] = min(l[0],max(l[1],l[2]))\r\nfor i in range(1,n-1):\r\n if i+1==n-1:\r\n l[i] = l[i+1]\r\n else:\r\n l[i] = max(l[i+1],l[i+2])\r\nprint(min(l))", "def main():\n input()\n aa = list(map(int, input().split()))\n l, a = [aa[-1]], aa[0]\n for b in aa:\n l.append(a if a > b else b)\n a = b\n print(min(l))\n\n\nif __name__ == '__main__':\n main()\n", "def time_left (n,tiles):\r\n time = 0\r\n j = 0\r\n while True :\r\n if tiles[0] == 0 or tiles[-1] == 0 :\r\n return time\r\n j = 0\r\n while j < n-1 :\r\n if j+2 < n and tiles[j+2] > 0 :\r\n j += 2\r\n elif j+1 < n and tiles[j+1] > 0 :\r\n j+= 1\r\n else:\r\n return time\r\n for y in range(n) :\r\n tiles[y] -= 1\r\n time += 1\r\n \r\n \r\n\r\nn = int(input())\r\ntiles = list(map(int,input().split()))\r\nprint (time_left(n,tiles))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=1\r\ncurr=1001\r\nwhile i<n-1:\r\n if a[i]>a[i+1]:\r\n curr=min(curr,a[i])\r\n i+=1\r\n else:\r\n curr=min(curr,a[i+1])\r\n i+=2\r\ncurr=min(a[0],a[-1],curr)\r\nprint(curr)" ]

[ "def gcd(n,m):\n if m==0:return n\n else:return gcd(m,n%m)\na,h,w=map(int,input().split())\ng=gcd(a+h,a+w)\ns=(a+w)//g\nt=((w//a+1)//s)*s-1\nif t<=0:print(-1)\nelse:print(\"%.10lf\"%((w-t*a)/(t+1)))", "def gcd(a,b):\n if(b==0):return a;\n else: return gcd(b,a%b);\ndef main():\n a,h,w=map(int,input().split());\n x=gcd(a+h,a+w);\n y=(a+w)//x;\n z=((w//a+1)//y)*y-1;\n if(z<=0): print(\"-1\");\n else: print(\"%.10lf\"%((1.00*w-z*a)/(z+1)));\nmain();", "def gcd(x,y):\r\n\tif (x%y==0): return y\r\n\treturn gcd(y,x%y)\r\na,h,w=input().split()\r\na=int(a)\r\nh=int(h)\r\nw=int(w)\r\ng=gcd(h+a,w+a)\r\nif (g<a or h<a or w<a):\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(g/(g//a)-a)", "def gcd(x,y):\n if y==0:return x\n else:return gcd(y,x%y)\nA,H,W=map(int,input().split())\nG=gcd(A+H,A+W)\nS=(A+W)//G\nT=((W//A+1)//S)*S-1\nif T<=0:print(-1)\nelse:print(\"%.10lf\"%((W-T*A)/(T+1)))", "def exgcd(a, b):\r\n if b == 0: return a, 1, 0\r\n g, y, x = exgcd(b, a % b)\r\n y -= a // b * x\r\n return g, x, y\r\n\r\na, h, w = map(int, input().split())\r\nk1, k2 = a + h, a + w\r\ng, x, y = exgcd(k1, k2)\r\nif (w - h) % g != 0:\r\n print(-1)\r\n exit(0)\r\nmx = min(w // a, (w - h + (a + w) * (h // a)) // (a + h))\r\nif mx <= 0:\r\n print(-1)\r\n exit(0)\r\nmod = abs(k2) / g\r\nx *= (w - h) // g\r\nx = (x % mod + mod) % mod\r\nt = mx // mod * mod + x\r\nwhile t > mx: t -= mod\r\nif t <= 0:\r\n print(-1)\r\n exit(0)\r\nprint(\"%.10f\" % ((w - t * a) / (t + 1)))\r\n", "a,h,w=(int(x) for x in input().split())\r\nif h==w:\r\n if a<h:\r\n n=w//a\r\n x=(w-a*n)/(n+1)\r\n print(x)\r\n elif a==h:\r\n print(0)\r\n else:\r\n print(-1)\r\nelse:\r\n for i in range(100):\r\n if h>w:\r\n w,h=h,w\r\n if w>h+a*2:\r\n w=w-h-a\r\n if h>w:\r\n w,h=h,w \r\n m=h//a\r\n s=(w-h)//a\r\n r=0\r\n if m<s or s==0:\r\n for i in range(m,0,-1):\r\n x=(h-a*i)/(i+1)\r\n w1=w-x\r\n a1=a+x\r\n q=w1%a1\r\n if q<0.00000001 or a1-q<0.0000001:\r\n r=1\r\n break\r\n if r==0:\r\n print(-1)\r\n else:\r\n print(x)\r\n else:\r\n for i in range(s,0,-1):\r\n x=(w-h-i*a)/i\r\n w1=w-x\r\n a1=a+x\r\n q=w1%a1\r\n if q<0.00000001:\r\n r=1\r\n break\r\n if r==0:\r\n print(-1)\r\n else:\r\n print(x)", "def gcd(a,b):\n if b==0:return a\n else:return gcd(b,a%b)\na,h,w=map(int,input().split())\ng=gcd(a+h,a+w)\nt=(a+w)//g\nq=((w//a+1)//t)*t-1\nif q<=0:print(-1)\nelse:print(\"%.9lf\"%((w-q*a)/(q+1)))\n" ]

[ "n=int(input());\r\ns=list(map(int,input().split()));\r\np=s[0];\r\nfor i in s:\r\n if(i%p): \r\n print(-1);\r\n exit(0);\r\nans=[];\r\nfor i in s:\r\n ans+=[i,p];\r\nprint(len(ans));\r\nprint(*ans);", "n=int(input())\na=list(map(int,input().split()))\nfor i in range(1,n):\n if a[i]%a[0]:exit(print(-1))\nprint(2*n)\nfor i in range(n):print(a[0],a[i],end=' ')\n \t\t \t \t \t\t\t \t\t \t \t\t\t\t\t \t\t \t \t", "import sys, os, io\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\nm = int(input())\ns = list(map(int, input().split()))\ns.sort()\ns0 = s[0]\nok = 1\nfor i in s:\n if i % s0:\n ok = 0\nif not ok:\n ans = -1\n print(ans)\n exit()\nans = []\nfor i in s:\n ans.append(i)\n ans.append(s0)\nm = len(ans)\nprint(m)\nsys.stdout.write(\" \".join(map(str, ans)))\n\t\t \t \t\t\t \t\t \t \t\t \t \t", "from collections import defaultdict,deque\r\nimport sys\r\nimport bisect\r\ninput=sys.stdin.readline\r\n\r\n\r\nn=int(input())\r\nhcf=[int(i) for i in input().split() if i!='\\n']\r\nans=[]\r\nif n==1:\r\n print(1)\r\n print(hcf[0])\r\nelse:\r\n for i in range(1,n):\r\n if hcf[i]%hcf[0]!=0:\r\n print(-1)\r\n break\r\n else:\r\n for i in range(n):\r\n ans.append(hcf[i])\r\n ans.append(hcf[0])\r\n print(len(ans))\r\n print(*ans)\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\ntemp = a[-1]\r\nfor i in range(0, n):\r\n temp = math.gcd(temp, a[i])\r\nif temp != a[0]:\r\n print(-1)\r\nelse:\r\n res = []\r\n for i in range(n):\r\n res.append(a[i])\r\n res.append(temp)\r\n res.pop(-1)\r\n print(len(res))\r\n print(*res)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nm = int(input())\r\ns = list(map(int, input().split()))\r\ns.sort()\r\ns0 = s[0]\r\nok = 1\r\nfor i in s:\r\n if i % s0:\r\n ok = 0\r\nif not ok:\r\n ans = -1\r\n print(ans)\r\n exit()\r\nans = []\r\nfor i in s:\r\n ans.append(i)\r\n ans.append(s0)\r\nm = len(ans)\r\nprint(m)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "'''input\r\n2 \r\n2 3\r\n'''\r\n'''\r\nAuthor : dhanyaabhirami\r\nGreat things never come from comfort zones\r\n'''\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter as ccd\r\nfrom itertools import permutations as pp\r\nfrom itertools import combinations as cc\r\nfrom random import randint as rd\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nimport heapq as hq\r\nimport math\r\n\r\nmod=pow(10,9) +7\r\ndef inp(flag=0):\r\n if flag==0:\r\n return list(map(int,input().strip().split(' ')))\r\n else:\r\n return int(input())\r\n\r\n# Code credits\r\n# assert(debug()==true)\r\n\r\n# for _ in range(int(input())):\r\n# n=inp(1)\r\n \r\nn=int(input())\r\ns = inp()\r\nans = []\r\npossible = True\r\nfor i in range(n):\r\n if s[i]%s[0]!=0:\r\n possible = False\r\n break\r\n ans.append(s[0])\r\n ans.append(s[i])\r\nif possible:\r\n print(2*n)\r\n print(*ans)\r\nelse:\r\n print(-1)", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\ns = [int(x) for x in stdin.readline().split()]\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\ns = set(s)\r\n\r\nflag2 = False\r\n\r\nfor x in s:\r\n flag = True\r\n for y in s:\r\n if not gcd(x,y) in s:\r\n flag = False\r\n break\r\n if flag:\r\n flag2 = x\r\n break\r\n\r\nif flag2 != False:\r\n print(n*2)\r\n for x in s:\r\n print(x,flag2,end=' ')\r\nelse:\r\n print(-1)\r\n", "import sys\r\nfrom array import array\r\n\r\nmax_ = 10 ** 6 + 1\r\nn, a = int(input()), array('i', [int(x) for x in input().split()])\r\n\r\nfor i in range(1, n):\r\n if a[i] % a[0]:\r\n exit(print(-1))\r\n\r\nans = array('i')\r\nfor i in range(n):\r\n ans.append(a[i])\r\n ans.append(a[0])\r\n\r\nprint(f\"{len(ans)}\\n{' '.join(map(str, ans))}\")\r\n", "n=int(input())\nakui=list(map(int,input().split()))\nfor i in akui:\n\n\n if i%akui[0]:exit(print(-1))\nprint(2*n)\n\n\nfor i in range(n):print(akui[i],akui[0],end=' ')\n\n\t \t \t \t \t \t \t \t \t" ]

[ "# http://codeforces.com/contest/771/problem/D\n\"\"\"\nDP-solution.\n\nFor each state (v, k, x, v_is_last_letter) we trial a step along the v, k and x\naxes and check that\ndp[future_state] = min(dp[future_state], dp[state] + cost_of_move)\nHence this implicitly reults in the one with least cost.\n\nV, K, X are arrays that contain the number of occurences of v, k, x at the i'th\nindex of s.\n\"\"\"\n\n\ndef cost_of_move(state, ss_ind):\n \"\"\"\n eg. ss = s[0:K.index(k+1)]\n Note: ss includes the i+1'th occurence of letter I. We hence want\n ss = s[0:ss_ind-1]\n And then we cound the number of occurences of V, K, X in this substring.\n\n However, we don't need ss now - this info is contained in lists V, K, X.\n \"\"\"\n\n curr_v, curr_k, curr_x = state\n cost = sum([max(0, V[ss_ind-1] - curr_v), max(0, K[ss_ind-1] - curr_k),\n max(0, X[ss_ind-1] - curr_x)])\n return cost\n\n\nif __name__ == \"__main__\":\n\n n = int(input())\n s = input()\n\n V = [s[0:i].count('V') for i in range(n+1)]\n K = [s[0:i].count('K') for i in range(n+1)]\n X = [(i - V[i] - K[i]) for i in range(n+1)]\n\n # Initialising\n n_v, n_k, n_x = V[n], K[n], X[n]\n\n dp = [[[[float('Inf') for vtype in range(2)] for x in range(n_x+1)]\n for k in range(n_k+1)] for v in range(n_v+1)]\n dp[0][0][0][0] = 0\n\n for v in range(n_v + 1):\n for k in range(n_k + 1):\n for x in range(n_x + 1):\n for vtype in range(2):\n orig = dp[v][k][x][vtype]\n if v < n_v:\n dp[v+1][k][x][1] = min(dp[v+1][k][x][vtype],\n orig + cost_of_move([v, k, x], V.index(v+1)))\n if k < n_k and vtype == 0:\n dp[v][k+1][x][0] = min(dp[v][k+1][x][0],\n orig + cost_of_move([v, k, x], K.index(k+1)))\n if x < n_x:\n dp[v][k][x+1][0] = min(dp[v][k][x+1][0],\n orig + cost_of_move([v, k, x], X.index(x+1)))\n print(min(dp[n_v][n_k][n_x]))\n", "from collections import defaultdict\r\na, b, c = [], [], []\r\nmyDictForAns = defaultdict(lambda : float(\"inf\"))\r\nmyDictForAns[(0,0,0,0)] = 0\r\ndef schet(a, i, x):\r\n ret = 0\r\n while i < len(a) and a[i] < x:\r\n ret += 1\r\n i += 1\r\n return ret\r\ndef main():\r\n for i in range(len(s)):\r\n if s[i] == \"V\":\r\n a.append(i)\r\n elif s[i] == \"K\":\r\n b.append(i)\r\n else :\r\n c.append(i)\r\n for i in range(len(a)+1):\r\n for j in range(len(b)+1):\r\n for k in range(len(c)+1):\r\n for p in range(2):\r\n if i < len(a):\r\n myDictForAns[(i+1,j,k,1)] = min(myDictForAns[(i+1,j,k,1)], myDictForAns[(i,j,k,p)] + schet(a,i,a[i])+schet(b,j,a[i])+schet(c,k,a[i]))\r\n if j < len(b) and p == 0:\r\n myDictForAns[(i,j+1,k,0)] = min(myDictForAns[(i,j+1,k,0)], myDictForAns[(i,j,k,p)]+schet(a,i,b[j])+schet(b,j,b[j])+schet(c,k,b[j]))\r\n if k < len(c):\r\n myDictForAns[(i,j,k+1,0)]=min(myDictForAns[(i,j,k+1,0)],myDictForAns[(i,j,k,p)]+schet(a,i,c[k])+schet(b,j,c[k])+schet(c,k,c[k]))\r\n print(min(myDictForAns[(len(a),len(b),len(c),0)],myDictForAns[(len(a),len(b),len(c),1)]))\r\nn = int(input())\r\ns = input()\r\nmain()# 1695142106.8230271" ]

[ "t = list(input())\n\nq_inds = [i for i, x in enumerate(t) if x == \"Q\"]\na_inds = [i for i, x in enumerate(t) if x == \"A\"]\n\nans = 0\nfor i, qi in enumerate(q_inds):\n for ai in a_inds:\n if qi < ai:\n for qi_2 in q_inds[i+1:]:\n if ai < qi_2:\n ans += 1\nprint(ans)", "n = input()\r\nn = n.lower()\r\nt = 0\r\nfor i in range(len(n)-2):\r\n for j in range(i+1,len(n)-1):\r\n for k in range(j+1,len(n)):\r\n if n[i] == 'q' and n[j] == 'a' and n[k] == 'q':\r\n t+=1\r\nprint(t)", "s = input()\nQ_left = 0\nQ_right = s.count('Q')\nnum = 0\n\nfor let in s:\n if let == 'Q':\n Q_left += 1\n Q_right -= 1 \n elif let == 'A':\n num += Q_left * Q_right\n\nprint(num)\n\t \t \t \t \t \t \t\t \t \t \t", "inputStr = input()\r\ncomb = [0,0,0]\r\ncount = 0\r\nfor i in range(len(inputStr)):\r\n if inputStr[i] == 'Q':\r\n comb[0] == 1\r\n for j in range(i, len(inputStr)):\r\n if inputStr[j] == 'A':\r\n comb[1] == 1\r\n for k in range(j, len(inputStr)):\r\n if inputStr[k] == 'Q':\r\n comb[2] += 1\r\n count += 1\r\nprint(count)", "a = input()\r\nn = len(a)\r\nc = 0\r\nfor i in range(n):\r\n if a[i] == 'Q':\r\n for j in range(i + 1, n):\r\n if a[j] == 'A':\r\n for k in range(j + 1, n):\r\n if a[k] == 'Q':\r\n c += 1\r\nprint(c)", "a = list(input())\r\n\r\ncount = 0\r\nt = 0\r\nfor i in range(0, len(a)):\r\n for j in range(i, len(a)):\r\n for k in range(j, len(a)):\r\n if a[i] == \"Q\" and a[j] == \"A\" and a[k] == \"Q\":\r\n count += 1\r\n\r\nprint(count)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ns = input()\r\n\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n\tif s[i] == 'Q':\r\n\t\tfor j in range(i + 1, len(s)):\r\n\t\t\tif s[j] == 'A':\r\n\t\t\t\ty = 0\r\n\t\t\t\tfor k in range(j + 1, len(s)):\r\n\t\t\t\t\tif s[k] == 'Q':\r\n\t\t\t\t\t\ty += 1\r\n\t\t\t\tans += y\r\n\r\nprint(ans)", "def qaqcount(n,s):\r\n total = 0\r\n for i in range(n):\r\n if s[i] == 'Q':\r\n for j in range(i+1,n):\r\n if s[j] == 'A':\r\n for k in range(j+1,n):\r\n if s[k] == 'Q':\r\n total += 1\r\n return total\r\n \r\ns = input()\r\nprint(qaqcount(len(s),s))", "from typing import List, Union\r\nfrom collections import namedtuple\r\nimport sys\r\nimport traceback\r\nfrom time import perf_counter\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n self.qaq_list = ['Q', 'A', 'Q']\r\n self.qaq_set = set(self.qaq_list)\r\n self.letter_dict = {}\r\n\r\n def qaq(self, letters: List):\r\n count = 0\r\n letters = [l for l in letters if l in self.qaq_set]\r\n count = self._calculate_qaq(letters, 0)\r\n print(count)\r\n return count\r\n\r\n def _calculate_qaq(self, cur_letters, index):\r\n count = 0\r\n cur_str = ''.join(cur_letters)\r\n if cur_str in self.letter_dict.keys():\r\n return self.letter_dict[cur_str]\r\n\r\n for i in range(len(cur_letters)):\r\n if cur_letters[i] == self.qaq_list[index]:\r\n if i < len(cur_letters) - 1 and index < 2:\r\n count += self._calculate_qaq(cur_letters[i + 1:], index + 1)\r\n else:\r\n if index == 2:\r\n count += 1\r\n self.letter_dict[cur_str] = count\r\n return count\r\n\r\n\r\nTestCase = namedtuple('TestCase', 'letters correct')\r\n\r\n\r\ndef read_test_cases(input_file, output_file):\r\n test_cases = []\r\n try:\r\n with open(input_file) as in_f:\r\n test_num = int(in_f.readline())\r\n with open(output_file) as out_f:\r\n for _ in range(test_num):\r\n letters = list(in_f.readline().strip())\r\n correct = int(out_f.readline())\r\n t = TestCase(letters, correct)\r\n test_cases.append(t)\r\n # raise Exception('My Test Exception')\r\n except Exception as exc:\r\n exc_name = exc.__class__.__name__\r\n exc_msg = str(exc)\r\n exc_info = sys.exc_info()\r\n print('EXCEPTION:', exc_name, exc_msg)\r\n traceback.print_exception(*exc_info)\r\n return test_cases\r\n\r\n\r\ndef run_test_cases(test_cases: List[TestCase]):\r\n for t in test_cases:\r\n result = Solution().qaq(t.letters)\r\n print('LETTERS:', t.letters, 'CORRECT:', t.correct, 'RESULT:', result, 'CHECK:', result == t.correct)\r\n\r\n\r\nif __name__ == '__main__':\r\n if len(sys.argv) > 1 and '--debug' in sys.argv:\r\n test_cases = read_test_cases('data/input.txt', 'data/output.txt')\r\n start_counter = perf_counter()\r\n run_test_cases(test_cases)\r\n stop_counter = perf_counter()\r\n print('COUNTER:', stop_counter - start_counter)\r\n else:\r\n letters = list(input().strip())\r\n Solution().qaq(letters)\r\n", "k=input()\r\ns=0\r\nfor i in range(len(k)):\r\n if k[i]=='A':\r\n s=s+k[:i].count(\"Q\")*k[i:].count(\"Q\")\r\nprint(s) \r\n \r\n", "s = input()\r\nq = 0\r\na = 0\r\nready = 0\r\nfor l in s:\r\n if l==\"Q\":\r\n q += 1\r\n ready+=a\r\n elif l==\"A\":\r\n a+=q\r\nprint(ready)", "t=input()\r\nt=t[:t.rfind('Q')+1]\r\nn=len(t)\r\ncount=0\r\nfor i in range(n):\r\n if(t[i]!='Q'):\r\n continue\r\n else:\r\n for j in range(i+1,n):\r\n if t[j]=='A':\r\n for k in range(j+1,n):\r\n if(t[k]=='Q'):\r\n count+=1\r\nprint(count)", "MAX = 100\r\ndef countSubsequence(s, n): \r\n cntQ = 0\r\n cntA = 0\r\n result = 0\r\n C=0\r\n for i in range(n): \r\n if (s[i] == 'Q'): \r\n cntQ += 1\r\n result += C \r\n continue\r\n \r\n if (s[i] == 'A'): \r\n cntA += 1\r\n C += cntQ \r\n continue\r\n else: \r\n continue\r\n \r\n print(result) \r\nif __name__ == '__main__': \r\n s = input()\r\n n = len(s) \r\n countSubsequence(s, n) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jan 15 14:27:01 2021\r\n\r\n@author: Олег\r\n\"\"\"\r\ns = input()\r\nql = 0\r\nc = 0\r\nqr = s.count('Q')\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n ql += 1\r\n qr -= 1\r\n elif s[i] == 'A':\r\n c += ql * qr\r\nprint(c)\r\n", "rijec = input()\n\ndef racun(rijec):\n zbroj = 0\n for i in range(len(rijec)):\n if rijec[i]=='Q':\n for j in range(i+1,len(rijec)):\n if rijec[j]=='A':\n for x in range(j+1,len(rijec)):\n if rijec[x]=='Q':\n zbroj+=1\n return zbroj\n \n\n\n# racun(rijec)\n\nprint(racun(rijec))", "#If I read a Q i need to create a sequence AND\n# see if I have a sequence with QA, if I have + 1 QAQ\n#If I read an A I need to add it to create a new seq QA for each seq Q that exists \nlistOfQAQ = []\ntext = input()\ntotalQAQ = 0\nfor i in range(len(text)): \n if(text[i] == 'Q'):\n #See if I have a seq\n for seq in listOfQAQ:\n if(seq == 'QA'):\n totalQAQ = totalQAQ + 1\n #Create a new seq\n listOfQAQ.append('Q')\n elif(text[i] == 'A'): \n for i in range(len(listOfQAQ)):\n #\n if(listOfQAQ[i] == 'Q'): \n listOfQAQ.append('QA')\nprint(totalQAQ)\n\t \t \t \t \t\t\t\t \t\t \t \t \t \t\t\t \t", "s = input()\r\ncunt = 0\r\nfor i,n in enumerate(s):\r\n if n=='A':\r\n x=s[0:i].count('Q')\r\n y=s[i: ].count('Q')\r\n cunt+=x*y\r\n\r\nprint(cunt)\r\n\r\n\r\n", "s = input()\ns = s.lower()\nn = len(s)\ncount = 0\nfor i in range(n):\n if s[i] == 'a':\n count += s[:i].count('q') * s[i+1:].count('q')\nprint(count)\n \t \t\t\t \t\t \t\t \t\t \t\t\t \t", "s=input()\r\nl=[]\r\nk=[]\r\nc=0\r\nfor i in s:\r\n l.append(i)\r\n# print(l) \r\nfor i in l:\r\n if i=='Q' or i=='A':\r\n k.append(i)\r\n# print(k)\r\nn=len(k)\r\nfor i in range(n+1):\r\n for j in range(i+1,n):\r\n for z in range(j+1,n):\r\n m=k[i]+k[j]+k[z]\r\n # print(m)\r\n if(m=='QAQ'):\r\n c+=1\r\nprint(c)\r\n ", "s = input()\r\nl = len(s)\r\nans = 0\r\nfor i in range(l):\r\n if s[i] == \"A\":\r\n ans += s[:i].count(\"Q\") * s[i:].count(\"Q\")\r\nprint(ans)\r\n", "x=input()\r\ncount=0\r\nqs=[]\r\nfor i in x:\r\n if i ==\"Q\" or i==\"A\":\r\n qs.append(i)\r\n\r\nfor i in range(len(qs)):\r\n if qs[i]=='Q':\r\n for j in range(i,len(qs)):\r\n if qs[j]=='A':\r\n for k in range(j,len(qs)):\r\n if qs[k]=='Q':\r\n count=count+1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n", "#check stevegregg's solution for more insight on dp solution\n\n\nzoop=input()\n\nqcount=[0]*len(zoop)\nqacount=[0]*len(zoop)\nqaqcount=[0]*len(zoop)\n\nif zoop[0]=='Q':\n qcount[0]=1\n\nfor i in range(1,len(zoop)):\n zp=zoop[i]\n\n if zp=='Q':\n qcount[i]=qcount[i-1]+1\n qacount[i]=qacount[i-1]\n qaqcount[i]=qaqcount[i-1]+qacount[i-1]\n\n elif zp=='A':\n qcount[i]=qcount[i-1]\n qacount[i]=qacount[i-1]+qcount[i-1]\n qaqcount[i]=qaqcount[i-1]\n\n else:\n qcount[i]=qcount[i-1]\n qacount[i]=qacount[i-1]\n qaqcount[i]=qaqcount[i-1] \n\nprint(qaqcount[-1])", "a = input()\r\nk = 0\r\nfor i in range(len(a)):\r\n if a[i] == \"Q\":\r\n for j in range(i, len(a)):\r\n if a[j] == \"A\":\r\n for l in range(j, len(a)):\r\n if a[l] == \"Q\":\r\n k += 1\r\nprint(k)\r\n", "s=input()\r\nsum=0\r\nfor i in range(len(s)):\r\n\tif s[i]=='Q':\r\n\t\tfor j in range(i,len(s),1):\r\n\t\t\tif s[j]=='A':\r\n\t\t\t\tfor k in range(j,len(s),1):\r\n\t\t\t\t\tif s[k]=='Q':\r\n\t\t\t\t\t\tsum=sum+1\r\nprint(sum)\r\n\r\n", "import re\n\n\ncount = 0\nindex_a = -1\nindex_last_q = 0\n\nword = input()\n# QAQAQ\na_indexes = [pos for pos, char in enumerate(word) if char == 'A']\n\n\nfor q_index, chr in enumerate(word):\n if chr == 'Q':\n for a_index in a_indexes:\n if a_index > q_index:\n count += len(re.findall('Q',word[a_index:]))\n\nprint(count)", "s = input()\r\nn = len(s)\r\ndp = [[0, 0, 0] for i in range(n + 1)]\r\nif s[0] == 'Q':\r\n dp[1][0] = 1\r\nfor i in range(1, n + 1):\r\n if s[i-1] == 'Q':\r\n dp[i][0] = dp[i-1][0] + 1\r\n dp[i][1] = dp[i-1][1]\r\n dp[i][2] = dp[i-1][1] + dp[i-1][2]\r\n elif s[i-1] == 'A':\r\n dp[i][0] = dp[i-1][0]\r\n dp[i][1] = dp[i-1][1] + dp[i-1][0]\r\n dp[i][2] = dp[i-1][2]\r\n else:\r\n dp[i][0] = dp[i-1][0]\r\n dp[i][1] = dp[i-1][1]\r\n dp[i][2] = dp[i-1][2]\r\nprint(dp[n][2])", "s = input()\n\nqaq = 0\n\nfor i in range(0, len(s)):\n\t# find an A\n\tif s[i] == 'A':\n\t\t# find Qs before A\n\t\tbefore = s[:i].count('Q')\n\t\t# find Qs after A\n\t\tafter = s[i+1:].count('Q')\n\t\t# add before * after to qaq\n\t\tqaq += before * after\n\nprint(qaq)", "a = input()\r\ncount =0\r\nfor i in range(len(a)):\r\n if a[i]=='Q':\r\n for j in range(i,len(a)):\r\n if a[j]=='A':\r\n for k in range(j,len(a)):\r\n if a[k]=='Q':\r\n count+=1\r\nprint(count)\r\n\r\n", "s=input()\r\nl=len(s)\r\n\r\nq=0\r\nres=0\r\n\r\ntotal_q=0\r\nfor i in s:\r\n if i=='Q':\r\n total_q+=1\r\n \r\nfor i in s:\r\n if i=='Q':\r\n q+=1\r\n elif i=='A':\r\n res+=q*(total_q-q)\r\n\r\nprint(res)", "s = str(input())\r\nc=0\r\nfor i in range(len(s)):\r\n\tfor j in range(i,len(s)):\r\n\t\tfor k in range(j,len(s)):\r\n\t\t\tif s[i]==\"Q\" and s[j]==\"A\" and s[k]==\"Q\": c+=1\r\nprint(c)", "# 코드포스 894A QAQ\r\nimport sys\r\nfrom itertools import combinations\r\nput = sys.stdin.readline\r\n\r\nstring = put().strip()\r\nQA = {'Q': [], 'A': []}\r\n\r\nfor i in range(len(string)):\r\n if string[i] == 'Q' or string[i] == 'A':\r\n QA[string[i]].append(i)\r\n\r\nanswer = 0\r\nfor i in combinations(QA['Q'], 2):\r\n i1, i3 = i\r\n for i2 in QA['A']:\r\n if i1 < i2 < i3:\r\n answer += 1\r\n\r\nprint(answer)", "s = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n for j in range(i+1, len(s)):\r\n for k in range(i+1, j+1):\r\n if(s[i] == \"Q\" and s[k] == \"A\" and s[j] == \"Q\"):\r\n res += 1\r\n\r\nprint(res)", "#erase and extend\r\n\r\ndef solve(s):\r\n\t\r\n\tans = 0\r\n\tn = len(s)\r\n\tfor i in range(n):\r\n\t\t\r\n\t\tif s[i] == 'Q':\r\n\t\t\tfor j in range(i+1,n):\r\n\t\t\t\t\r\n\t\t\t\tif s[j] == 'A':\r\n\t\t\t\t\tfor k in range(j+1,n):\r\n\t\t\t\t\t\tif s[k] == 'Q':\r\n\t\t\t\t\t\t\tans += 1\r\n\t\r\n\tprint(ans)\r\n\treturn\r\n\r\n\r\ns = input()\r\nsolve(s)\r\n", "s = ''\r\nfor j in str(input()):\r\n if j == 'Q' or j == 'A':\r\n s += j\r\ncount = 0\r\nfor j in range(len(s)):\r\n if s[j] == 'Q':\r\n for k in range(j + 1, len(s)):\r\n if s[k] == 'A':\r\n for l in range(k + 1, len(s)):\r\n if s[l] == 'Q':\r\n count += 1\r\nprint(count)\r\n", "s = input()\nn = len(s)\ncount=0\nqval = [0]*n\nqval[0]=s[0]=='Q'\nfor i in range(1,n):\n if s[i]=='Q':\n qval[i]+=1\n qval[i]+=qval[i-1]\nfor i in range(0,n):\n if s[i]!='Q':\n continue\n for j in range(i+1,n):\n if s[j]!='A':\n continue\n count+=qval[n-1]-qval[j]\nprint(count)\n", "s = input()\nn, i = len(s), 0\nwhile i < n and s[i] != 'Q':\n i += 1\ns = s[i:]\nn = len(s)\ni = n - 1\nwhile i > 0 and s[i] != 'Q':\n i -= 1\ns = s[:i + 1]\narr = [x.count('A') for x in s.split('Q')][1:-1]\nn = len(arr)\nprint(sum(i * (n + 1 - i) * arr[i - 1] for i in range(1, n + 1)))", "def calcUtil(s,sub):\r\n calcUtil.times+=1\r\n n=len(s)\r\n M=[[0 for i in range(4)] for j in range(n+1)]\r\n for i in range(n+1):\r\n M[i][0]=1\r\n for i in range(1,4):\r\n for j in range(1,n+1):\r\n if s[j-1]==sub[i-1]:\r\n M[j][i]=M[j-1][i]+M[j-1][i-1]\r\n else:\r\n M[j][i]=M[j-1][i]\r\n # for item in M:\r\n # print(*item)\r\n return M[n][3]\r\n\r\n\r\ndef calc(s):\r\n sub='QAQ'\r\n calcUtil.times=0\r\n val = calcUtil(s,sub)\r\n # print(calcUtil.times)\r\n return val\r\ns=input()\r\nprint(calc(s))", "s = input()\r\nn = len(s)\r\n\r\nleft = [0 for _ in range(n)]\r\nright = [0 for _ in range(n)]\r\n\r\nleft[0] = 1 if s[0] == 'Q' else 0\r\nright[0] = 1 if s[-1] == 'Q' else 0\r\nfor i in range(1, n):\r\n if s[i] == 'Q':\r\n left[i] = left[i-1] + 1 \r\n else:\r\n left[i] = left[i-1]\r\n\r\n if s[n-i-1] == 'Q':\r\n right[i] = right[i-1] + 1 \r\n else:\r\n right[i] = right[i-1]\r\n\r\nright = right[::-1]\r\n\r\nresult = 0\r\nfor i, char in enumerate(s):\r\n if char == 'A':\r\n result += left[i] * right[i]\r\n\r\nprint(result)\r\n", "import itertools\r\nprint(sum(map(lambda x: (x == ('Q', 'A', 'Q')), itertools.combinations(input(), 3))))", "# author: birsnot - Nardos Wehabe\r\n\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n s = input()\r\n N = len(s)\r\n dp = [[0,0,0]]*(N + 1)\r\n for i, ch in enumerate(s, 1):\r\n if ch == \"Q\":\r\n dp[i][0] = dp[i - 1][0] + 1\r\n dp[i][2] = dp[i - 1][2] + dp[i - 1][1]\r\n elif ch == \"A\":\r\n dp[i][1] = dp[i - 1][0] + dp[i - 1][1]\r\n print(dp[N][2])\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "s = input()\r\nn = len(s)\r\nq1 = list(map(lambda x:1 if x=='Q' else 0,s))\r\nq2 = list(q1)\r\nfor i in range(1,n):\r\n q2[i] += q2[i-1]\r\nvq = q2[n-1]\r\na1 = list(map(lambda x:1 if x=='A' else 0,s))\r\nr1 = list(map(lambda x1,x2:x1*(vq-x1)*x2,q2,a1))\r\nfor i in range(1,n):\r\n r1[i] += r1[i-1]\r\nprint(r1[n-1])", "# Problem Name : QAQ\r\n# Problem Link : https://codeforces.com/problemset/problem/894/A\r\n# Input Operation\r\nimport sys\r\nstr=sys.stdin.readline()\r\n# Output Operation\r\na,b,c=0,0,0\r\nfor i in str:\r\n if i==\"Q\":\r\n c+=b\r\n a+=1\r\n if i==\"A\":\r\n b+=a\r\nprint(c)\r\n", "string = input()\r\ncount=0\r\nfor i in range(len(string)):\r\n for j in range(i+1,len(string)):\r\n for k in range(j+1,len(string)):\r\n if(string[i] ==\"Q\" and string[j]==\"A\" and string[k]==\"Q\"):\r\n count+=1\r\nprint(count)\r\n", "s = str(input())\r\n\r\nans = 0\r\n\r\nid1 = 0\r\nfor i in s:\r\n if i == 'Q':\r\n id2 = id1 + 1\r\n for j in s[id1+1:]:\r\n if j == 'A':\r\n for k in s[id2+1:]:\r\n if k == 'Q':\r\n ans += 1\r\n id2 += 1\r\n else:\r\n id2 += 1\r\n id1 += 1\r\n else:\r\n id1 += 1\r\n\r\nprint(ans)", "dp = {}\r\ndef dynamic(i, j, string, test):\r\n if j == 3:\r\n return 1\r\n \r\n if i == len(string):\r\n return 0\r\n \r\n if (i, j) in dp:\r\n return dp[(i, j)]\r\n \r\n dp[(i, j)] = dynamic(i + 1, j, string, test)\r\n if test[j] == string[i]:\r\n dp[(i, j)] += dynamic(i + 1, j + 1, string, test)\r\n\r\n return dp[(i, j)]\r\n\r\nprint(dynamic(0, 0, input(), \"QAQ\"))", "A = input()\r\nn = len(A)\r\nans = 0\r\nfor i in range(n-2):\r\n if A[i] == 'Q':\r\n for j in range(i+1,n-1):\r\n if A[j] == 'A':\r\n for m in range(j+1,n):\r\n if A[m] == 'Q':\r\n ans += 1\r\nprint(ans)", "s = input()\nn = len(s)\ncount=0\nqval = [0]*n\nqval[0]=s[0]=='Q'\nfor i in range(1,n):\n if s[i]=='Q':\n qval[i]+=1\n qval[i]+=qval[i-1]\naval = [0]*n\naval[0] = qval[n-1]-qval[0]\nfor i in range(1,n):\n if s[i]=='A':\n aval[i]+=qval[n-1]-qval[i]\n aval[i]+=aval[i-1]\nans = 0\nfor i in range(0,n):\n if s[i]!='Q':\n continue\n ans+=aval[n-1]-aval[i]\nprint(ans)\n", "from itertools import combinations\r\ns = list(input())\r\nper = combinations(s,3)\r\nres = list(map(\"\".join,per))\r\nc = 0\r\nst = \"QAQ\"\r\nfor i in res:\r\n if st == i:\r\n c = c + 1\r\nprint(c)", "s = input()\r\nr = 0\r\nfor c in range(len(s)):\r\n if s[c] == \"Q\":\r\n for i in range(c + 1, len(s)):\r\n if s[i] == \"A\":\r\n for j in range(i + 1, len(s)):\r\n if s[j] == \"Q\":\r\n r += 1\r\nprint(r)", "s,b,anwser = input(),\"\",0\r\n\r\nfor i in range (0, len(s)):\r\n if s[i] == \"Q\":\r\n for j in range (i, len(s)):\r\n if s[j] == \"A\":\r\n for h in range (j, len(s)):\r\n if s[h] == \"Q\":\r\n anwser += 1\r\nprint(anwser)", "s=input()\r\nc=0\r\nl=len(s)\r\nz=1\r\nfor i in range(l):\r\n #if(z==0):\r\n # break\r\n if(s[i]=='Q'):\r\n for j in range(i+1,l-1):\r\n if(s[j]=='A'):\r\n for k in range(j+1,l):\r\n if(s[k]=='Q'):\r\n z=1\r\n c+=1\r\n else:\r\n z=0\r\nprint(c)\r\n", "string = input().strip(\" \")\r\ndef ON3solution(string):\r\n new_string=\"\"\r\n count = 0\r\n for i in range(len(string)):\r\n if len(new_string)==0 and string[i]==\"Q\":\r\n new_string = new_string + \"Q\"\r\n for j in range(i+1,len(string)-1):\r\n if string[j] == \"A\" and new_string[-1]==\"Q\":\r\n new_string = new_string + \"A\"\r\n for k in range(j+1,len(string)):\r\n if string[k] == \"Q\" and new_string[-1]==\"A\":\r\n new_string = new_string + \"Q\"\r\n count = count + 1\r\n new_string = \"QA\"\r\n else:\r\n continue\r\n new_string = \"Q\"\r\n else:\r\n continue\r\n new_string = \"\"\r\n return count\r\nprint(ON3solution(string))", "string = input()\r\nq_count = count = 0\r\nq_total = string.count('Q')\r\nfor char in string:\r\n if char == 'Q':\r\n q_count += 1\r\n elif char == 'A':\r\n count += q_count * (q_total-q_count)\r\nprint(count)\r\n ", "inp=input()\r\nvalue=0\r\nfor i in range(len(inp)):\r\n\tif inp[i]==\"A\":\r\n\t\tvalue+=inp[:i].count(\"Q\")*inp[i:].count(\"Q\")\r\nprint(value)", "def until_this(a,x):\n c=0\n for i in a:\n if(i<x):\n c+=1\n else:\n break\n return(c)\ns=input().strip()\nq=[]\na=[]\ncount=0\nfor i in range(len(s)):\n if(s[i]==\"Q\"):\n q.append(i)\n elif(s[i]==\"A\"):\n a.append(i)\n\nfor i in a:\n now=until_this(q,i)\n rest=len(q)-now\n count+=now*rest\n\nprint(count)", "q, a, s = 0, 0, 0\r\nfor i in input():\r\n if i == 'Q':\r\n q += 1\r\n s += a\r\n elif i == 'A':\r\n a += q\r\nprint(s)\r\n", "s = input() # ввод строки\r\nn = len(s) # длина строки\r\n\r\n# Инициализация динамического массива для хранения префиксных сумм\r\ndp = [0] * n\r\n\r\n# Считаем префиксные суммы для символов 'Q' в строке\r\ndp[0] = int(s[0] == 'Q')\r\nfor i in range(1, n):\r\n dp[i] = dp[i - 1] + int(s[i] == 'Q')\r\n\r\n# Считаем количество подпоследовательностей \"QAQ\" в строке\r\ncount = 0\r\nfor i in range(1, n - 1):\r\n if s[i] == 'A':\r\n count += dp[i - 1] * (dp[n - 1] - dp[i])\r\n\r\nprint(count)\r\n", "b = [] ; s = 0\r\na = list(input())\r\nfor i in a:\r\n b.append(i)\r\n if i == 'A':\r\n c = a[len(b):len(a)]\r\n s += b.count('Q')*c.count('Q')\r\nprint(s)", "a = input()\r\nn = len(a)\r\nres = 0\r\np = a.count('Q')\r\nfor i in range(n):\r\n if a[i] == 'A':\r\n b = a[:i].count('Q') \r\n res += b * (p - b)\r\nprint(res)", "def qaq(string):\n l = len(string)\n result, q, aux = 0, 0, 0\n for i in range(l):\n if string[i] == 'Q':\n q += 1\n for i in range(l):\n if string[i] == 'Q':\n aux += 1\n if string[i] == 'A':\n result += aux*(q-aux)\n return result\n\nif __name__ == '__main__':\n n = str(input())\n print(qaq(n))\n \t \t\t \t\t\t\t\t\t\t\t\t\t \t \t\t \t\t \t", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\ns = input()\r\nans = 0 \r\nfor i in range(len(s)):\r\n if(s[i] == \"A\") :\r\n ans += s[:i].count(\"Q\") * s[i+1::].count(\"Q\")\r\nprint(ans)", "s=input()\r\nn=s.count('Q')\r\nx=0\r\nk=0\r\nfor i in s:\r\n if(i=='Q'):\r\n x+=1\r\n elif(i=='A'):\r\n k+=x*(n-x)\r\nprint(k)\r\n\n# Sat Apr 22 2023 20:19:40 GMT+0300 (Moscow Standard Time)\n", "s=input()\r\n\r\n\r\ni=0\r\nres=0\r\nwhile i<len(s):\r\n j=i+1\r\n while j<len(s):\r\n k=j+1\r\n while k<len(s):\r\n if (s[i]=='Q') and (s[j]=='A') and (s[k]=='Q'):\r\n res+=1\r\n k+=1\r\n j+=1\r\n i+=1\r\nprint(res)\r\n", "# n = int(input())\r\ns = list(input())\r\ntotal_q = s.count('Q')\r\nans = 0\r\n\r\nq_l = 0\r\nq_r = total_q\r\n\r\nfor c in s:\r\n if c == 'Q':\r\n q_l += 1\r\n q_r -= 1\r\n if c == 'A':\r\n ans += q_l * q_r\r\n\r\nprint(ans)\r\n", "from sys import stdin\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque as dq\r\nfrom collections import Counter as ctr\r\nfrom heapq import heapify,heappush as ha, heappop as hp\r\nfrom math import ceil,floor,gcd,sqrt\r\nfrom bisect import bisect_left as bsl, bisect_right as bsr\r\nfrom bisect import insort_left as isl, insort_right as isr\r\nfrom itertools import permutations, combinations\r\nip = lambda : int(stdin.readline())\r\nips = lambda : str(stdin.readline())[:-1]\r\nipm = lambda : map(int,stdin.readline().split())\r\nipl = lambda : list(ipm())\r\nmod = int(1e9)+7\r\nmod2 = 998244353\r\n#for _ in range(1):\r\n #n,a,b,c = ipm()\r\ns = ips()\r\nt = 'QAQ'\r\nn = len(s)\r\nm = len(t)\r\ndp = [[0 for i in range(m+1)] for j in range(n+1)]\r\nfor i in range(n+1):\r\n dp[i][0] = 1\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if s[i-1]==t[j-1]:\r\n dp[i][j] = dp[i-1][j-1]+dp[i-1][j]\r\n else:\r\n dp[i][j] = dp[i-1][j]\r\nprint(dp[n][m])\r\n", "string = input()\r\nres = 0\r\nfor i in range(len(string)):\r\n if string[i] == 'A':\r\n res += (string[:i].count('Q') * string[i:].count('Q'))\r\nprint(res)", "n=input()\r\ncount=0\r\nnum=0\r\na=n.count('Q')\r\nfor i in range(len(n)):\r\n if n[i]=='Q':\r\n count+=1\r\n elif n[i]=='A':\r\n num+=count*(a-count)\r\nprint(num)", "a=str(input())\r\nma=0\r\npre,suf=[0]*len(a),[0]*len(a)\r\nn=len(a)\r\nfor i in range(len(a)):\r\n if i==0:\r\n if a[i]==\"Q\":\r\n pre[i]=1\r\n else:\r\n pre[i]=0\r\n continue\r\n if a[i]==\"Q\":\r\n pre[i]=pre[i-1]+1\r\n else:\r\n pre[i]=pre[i-1]\r\nfor i in range(len(a)-1,-1,-1):\r\n if i==len(a)-1:\r\n if a[i]==\"Q\":\r\n suf[i]=1\r\n else:\r\n suf[i]=0\r\n continue\r\n if a[i]==\"Q\":\r\n suf[i]=suf[i+1]+1\r\n else:\r\n suf[i]=suf[i+1] \r\nfor i in range(len(a)-1):\r\n if a[i]==\"A\":\r\n ma+=pre[i]*suf[i+1]\r\nprint(ma)\r\n\r\n", "word = input()\r\nresult = 0\r\nfor i in range(len(word)-2):\r\n\tif word[i] != \"Q\":\r\n\t\tcontinue\r\n\tfor j in range(i+1,len(word)-1):\r\n\t\tif word[j] != \"A\":\r\n\t\t\tcontinue\r\n\t\tfor k in range(j+1,len(word)):\r\n\t\t\tif word[k] != \"Q\":\r\n\t\t\t\tcontinue\r\n\t\t\tresult += 1 \r\nprint(result)", "a=input()\r\nco=0\r\nfor i in range(len(a)):\r\n if a[i]==\"Q\":\r\n for j in range(i+1,len(a)):\r\n if a[j]==\"A\":\r\n for k in range(j+1,len(a)):\r\n if a[k]==\"Q\":\r\n co+=1\r\nprint(co)", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"Q\":\r\n aces =0\r\n for j in range(i+1,len(s)):\r\n if s[j] == \"A\":\r\n aces+=1\r\n if s[j] == \"Q\":\r\n ans+=aces\r\n \r\n\r\n\r\nprint(ans)\r\n", "a=input()\r\nLA=[]\r\nLQ=[]\r\nLL=[]\r\nfor i in range(len(a)):\r\n if \"Q\" not in LL:\r\n if a[i]==\"Q\":\r\n LQ.append(i)\r\n LL.append(\"Q\")\r\n elif \"Q\" in LL:\r\n if a[i]==\"Q\":\r\n LQ.append(i)\r\n LL.append(\"Q\")\r\n elif a[i]==\"A\":\r\n LA.append(i)\r\n LL.append(\"A\")\r\n#print(2*(LL.count(\"Q\"))-(LL.count(\"A\")))\r\n#['Q', 'A', 'Q', 'A', 'Q']\r\n# QAQAQAQ\r\n#['Q', 'A', 'Q', 'Q', 'Q']\r\n#print(LL)\r\nC=0\r\nfor i in range(len(LL)):\r\n if LL[i]==\"A\":\r\n C=C+LL[i:].count(\"Q\")*LL[:i].count(\"Q\")\r\n \r\nprint(C)", "#QAQ\r\nn=input()\r\ncount=0\r\nfor a in range(len(n)):\r\n for b in range(a+1,len(n)):\r\n for c in range(b+1,len(n)):\r\n if (n[a]=='Q' and n[b]=='A' and n[c]=='Q'):\r\n count+=1\r\nprint(count)", "from itertools import combinations\r\n\r\nprint(sum(map(lambda x: (x == ('Q', 'A', 'Q')), combinations(input(), 3))))\r\n", "n = input()\r\nk = 0\r\nfor i in range (len(n)):\r\n if n[i] == \"A\":\r\n k += (n[:i].count(\"Q\") * n[i:].count(\"Q\"))\r\nprint(k) ", "import itertools\r\ns = input()\r\ncom = list(itertools.combinations(s, 3))\r\ncom = [\"\".join(list(i)) for i in com]\r\nprint(com.count(\"QAQ\"))", "s = input()\r\nn = len(s)\r\nm = 0\r\n\r\nfor i in range(n):\r\n if s[i] == 'Q':\r\n for j in range(i + 1, n):\r\n if s[j] == 'A':\r\n for k in range(j + 1, n):\r\n if s[k] == 'Q':\r\n m += 1\r\nprint(m)", "n=input()\r\nprint(sum(n[:i].count('Q')*n[i:].count('Q') for i in range (len(n)) if n[i]=='A'))", "txt = input()\n\ncnt = 0\ncnt_first_q = 0\ncnt_second_q = txt.count('Q')\n\nfor el in txt:\n if el == 'Q':\n cnt_first_q += 1 \n cnt_second_q -= 1 \n elif el == 'A':\n cnt += cnt_first_q * cnt_second_q\nprint(cnt)\n\t\t\t\t\t \t \t\t \t\t \t\t \t\t\t \t\t\t\t\t", "s = input()\r\nres = 0\r\nn = len(s)\r\nfor i in range(n):\r\n for j in range(i,n):\r\n for k in range(j,n):\r\n if s[i] == 'Q' and s[j] =='A' and s[k] =='Q':\r\n res+=1\r\nprint(res) ", "S = input()\r\nL = len(S)\r\nt = 0\r\nfor i in range(L):\r\n for j in range(i + 1, L):\r\n for k in range(j + 1, L):\r\n if S[i] == \"Q\" and S[j] == \"A\" and S[k] == \"Q\":\r\n t += 1\r\n\r\nprint(t)", "n=input()\ns=\"\"\nfor j in n:\n if j == 'Q' or j == \"A\":\n s+=j\na=0\ncount=0\nfor i in range(len(s)):\n if s[i] == 'Q':\n for j in range(i+1,len(s)):\n if s[j] == 'A':\n a+=1\n else:\n count+=a\n a=0\nprint(count)", "s = input()\nx = 0\ny = 0\nans = 0\nfor i in range(0, len(s)):\n if(s[i] == 'Q'):\n ans += x\n y += 1\n elif(s[i] == 'A'):\n x += y\nprint(ans)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\ns = input()\r\nres = 0\r\nn = len(s)\r\nleft, right = [0] * n, [0] * n\r\nfor i in range(1, n):\r\n if s[i - 1] == 'Q':\r\n left[i] = left[i - 1] + 1\r\n else:\r\n left[i] = left[i - 1]\r\nfor i in range(n - 2, -1, -1):\r\n if s[i + 1] == 'Q':\r\n right[i] = right[i + 1] + 1\r\n else:\r\n right[i] = right[i + 1]\r\n# print(left, right)\r\nfor i in range(1, n - 1):\r\n if s[i] == 'A':\r\n res += left[i] * right[i]\r\nprint(res)", "s=input()\r\nk=0\r\na=[]\r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)):\r\n for k in range(j+1,len(s)):\r\n if s[i]+s[j]+s[k]=='QAQ':\r\n a.append(s[i]+s[j]+s[k])\r\nprint(len(a))\r\n\r\n", "si = input()\nans = 0\nqc = 0\nqt = si.count(\"Q\")\nfor i in range(len(si)):\n\tif si[i] == \"A\":\n\t\tans += qc*(qt- qc)\n\telif si[i] == \"Q\":\n\t\tqc += 1\nprint(ans)\n\t\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\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n if s[i] ^ 81:\r\n continue\r\n for j in range(i + 1, n):\r\n if s[j] ^ 65:\r\n continue\r\n for k in range(j + 1, n):\r\n if s[k] == 81:\r\n ans += 1\r\nprint(ans)", "string= input()\r\norg = \"QAQ\"\r\n\r\nans = [0]\r\nmemo = {}\r\ndef clc(i,j):\r\n\r\n if j == len(org):\r\n \r\n return 1\r\n if i == len(string):return 0\r\n if (i,j) in memo:return memo[i,j]\r\n if string[i] == org[j]:\r\n a = clc(i+1,j+1)\r\n b = clc(i+1,j)\r\n memo[i,j] = a+b\r\n return a+b\r\n else:\r\n a = clc(i+1,j)\r\n memo[i,j] = a\r\n return a\r\n\r\nan = clc(0,0)\r\nprint(an)", "s = input()\r\ni = 0\r\nresult = 0\r\nwhile i < len(s):\r\n\tj = i + 1\r\n\twhile j < len(s):\r\n\t\tk = j + 1\r\n\t\twhile k < len(s):\r\n\t\t\tif (s[i] == 'Q') and (s[j] == 'A') and (s[k] == 'Q'):\r\n\t\t\t\tresult = result + 1\r\n\t\t\tk = k + 1\r\n\t\tj = j + 1\r\n\ti = i + 1\r\nprint(result)\r\n\r\n\t\t\r\n\r\n\t", "n = input()\r\ncounter = 0\r\nfor i in range(0, len(n)):\r\n if n[i] == \"Q\":\r\n for a in range(i + 1, len(n)):\r\n if n[a] == \"A\":\r\n for b in range(a + 1, len(n)):\r\n if n[b] == \"Q\":\r\n counter += 1\r\n\r\nprint(counter)", "\r\ns = input()\r\ncnt = [0,0,0] #0=Q, 1=QA, 2=QAQ\r\nfor c in s:\r\n if c == 'Q':\r\n cnt[0] += 1\r\n cnt[2] += cnt[1]\r\n if c == 'A':\r\n cnt[1] += cnt[0]\r\nprint(cnt[2])\r\n", "s = input()\nn = len(s)\ncount=0\nfor i in range(0,n):\n if s[i]!='Q':\n continue\n for j in range(i+1,n):\n if s[j]!='A':\n continue\n for k in range(j+1,n):\n if s[k]!='Q':\n continue\n count+=1\nprint(count)\n", "s = input()\r\n\r\nq = 0\r\nsumm = 0\r\nq_tot = s.count(\"Q\")\r\nfor let in s:\r\n if let == \"Q\":\r\n q += 1\r\n elif let == \"A\":\r\n summ += q*(q_tot-q)\r\nprint(summ)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "string = input()\r\ncounter = 0\r\nfor i in range(len(string)-2):\r\n if string[i] == 'Q':\r\n for j in range(i+1,len(string)-1):\r\n if string[j] == 'A':\r\n for k in range(j+1,len(string)):\r\n if string[k] == 'Q':\r\n counter += 1\r\nprint(counter)", "s = input()\nl = len(s)\nans = 0\nfor i in range(l):\n if s[i]=='Q':\n for j in range(i+1, l):\n if s[j]=='A':\n for k in range(j+1, l):\n if s[k]=='Q':\n ans += 1\nprint(ans)", "s=input()\r\nq=a=ans=0\r\nfor i in s:\r\n if i=='Q':\r\n q+=1\r\n ans+=a\r\n elif i=='A':\r\n a+=q\r\nprint(ans)", "def qaq():\r\n inp=input()\r\n c=0\r\n for i in range(len(inp)):\r\n for j in range(i+1,len(inp)):\r\n for k in range(j+1,len(inp)):\r\n if inp[i]=='Q' and inp[j]=='A' and inp[k]=='Q':c+=1\r\n print(c)\r\nqaq()", "word = input()\r\nql, qr = 0, word.count('Q')\r\nout = 0\r\nfor i in range(len(word)):\r\n if word[i] == 'Q':\r\n ql += 1\r\n qr -= 1\r\n elif word[i] == 'A':\r\n out += ql * qr\r\nprint(out)\r\n", "word = input()\r\nn = word.count(\"Q\")\r\ncounter, appeared = 0, 0\r\nfor i in word:\r\n if i == \"Q\":\r\n appeared += 1\r\n if i == \"A\":\r\n counter += (n - appeared) * appeared\r\nprint(counter)", "s = input()\r\nl = len(s)\r\ncnt = 0\r\nfor i in range(0,l):\r\n for j in range(i+1,l):\r\n for k in range (j + 1, l):\r\n if(s[i] == \"Q\" and s[j] == \"A\" and s[k] == \"Q\"):\r\n cnt = cnt +1\r\nprint(cnt)", "n = str(input())\r\nlstN = []\r\nlenLstN = 0\r\nfor i in range(0, len(n)):\r\n if n[i] == \"Q\" or n[i] == \"A\":\r\n lstN += n[i]\r\n lenLstN += 1\r\nstrings = \"\".join(str(y) for y in lstN)\r\ncountA = lstN.count(\"A\")\r\nsoQAQ = 0\r\nfor x in range(0, lenLstN):\r\n if strings[x] == \"A\":\r\n stringstemp = strings.split(\"A\", 1)\r\n soQTrai = stringstemp[0].count(\"Q\")\r\n soQphai = stringstemp[1].count(\"Q\")\r\n stringsSau = strings.replace(\"A\", \"-\", 1)\r\n strings = stringsSau\r\n soQAQ += soQphai * soQTrai\r\nprint(soQAQ)", "#problem 894A, QAQ\r\n#SWR\r\nimport sys\r\n#\r\ndef cantidad(lista):\r\n contar = 0\r\n for i in range(len(lista)):\r\n if lista[i] == \"Q\":\r\n contar += 1\r\n return contar\r\n#\r\ndef contar(string):\r\n total = 0\r\n for i in range(len(string)):\r\n if string[i] == \"A\":\r\n cant_1 = cantidad(string[:i])\r\n cant_2 = cantidad(string[i+1:])\r\n total += cant_1*cant_2\r\n return total\r\n#\r\ndef quitar(cant):\r\n nuevo = \"\"\r\n for i in range(len(cant)):\r\n if cant[i] == \"A\" or cant[i] == \"Q\":\r\n nuevo = nuevo + cant[i]\r\n return nuevo\r\n#\r\ndef main():\r\n cant = sys.stdin.readline().strip(\"\\n\")\r\n cant = quitar(cant)\r\n resp = contar(cant)\r\n sys.stdout.write(str(resp))\r\nmain()\r\n", "a = [i for i in input() if i == 'Q' or i == 'A']\r\nt = 0\r\nfor i in range(len(a)):\r\n for j in range(i, len(a)):\r\n for k in range(j, len(a)):\r\n if a[i] == 'Q' and a[j] == 'A' and a[k] == 'Q':\r\n t += 1\r\nprint(t)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jun 22 11:16:50 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\ns=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]=='A':\r\n ans+=(s[:i].count('Q')*s[i+1:].count('Q'))\r\nprint(ans)\r\n", "n = input()\r\ncounter = 0\r\nfor i in range(len(n)):\r\n if n[i] == 'Q':\r\n for j in range(i+1,len(n)):\r\n if n[j] == 'A':\r\n for p in range(j+1,len(n)):\r\n if n[p] == 'Q':\r\n counter += 1\r\nprint(counter)", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s)):\r\n for k in range(j + 1, len(s)):\r\n if s[i] + s[j] + s[k] == 'QAQ':\r\n ans += 1\r\nprint(ans)", "s = input().rstrip()\n\n#brute force\ncount = 0\nfor i in range(len(s) - 2):\n for j in range(i + 1, len(s) - 1):\n for k in range(j + 1, len(s)):\n test = s[i] + s[j] + s[k]\n if test == \"QAQ\":\n count += 1\nprint(count)\n", "word = input()\n\ndef QAQs(word):\n Qs = [i for i in range(len(word)) if word[i] == 'Q']\n As = [i for i in range(len(word)) if word[i] == 'A']\n qaqs = 0\n for q in Qs:\n for a in As:\n if a > q:\n qaqs += len([i for i in Qs if i > a])\n\n return qaqs\n\n\n\nprint(QAQs(word))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 5 16:47:09 2020\r\n\r\n@author: Admin\r\n\"\"\"\r\n\r\na=input()\r\ndp=[0]*len(a)\r\nfor i in range(len(a)):\r\n for j in range(0,i):\r\n if a[j]=='Q' and a[i]=='A':\r\n dp[i]+=1\r\n \r\ndp2=[0]*len(a)\r\ns=0\r\nfor i in range(len(a)):\r\n for j in range(0,i):\r\n if dp[j]!=0:\r\n if a[j]=='A' and a[i]=='Q':\r\n dp2[i]+=dp[j]\r\n s+=dp[j]\r\n \r\nprint(s)\r\n", "s = input()\r\ncount = 0\r\nfor i in range(0,len(s)):\r\n if s[i]=='Q':\r\n for j in range(i+1,len(s)):\r\n if s[j]=='A':\r\n count += s[j+1:len(s)].count('Q')\r\nprint(count)", "s = input()\r\nn = 0\r\nleft = s.find(\"Q\")\r\nright = s.rfind(\"Q\")\r\nif left == right:\r\n print(0)\r\nelse:\r\n for i in range(left, right-1):\r\n for j in range(i+1, right):\r\n for k in range(j+1, right+1):\r\n if s[i] + s[j] + s[k] == \"QAQ\":\r\n n += 1\r\n print(n)", "from collections import *\r\n\r\ns = input()\r\n\r\nh = Counter(s)\r\nq_count = h['Q']\r\ncount = 0\r\nres = 0\r\nfor i in s:\r\n if i=='Q':\r\n count+=1\r\n elif i=='A':\r\n res+=count*(q_count-count)\r\nprint(res)", "\r\ns=str(input());l=0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n t=''\r\n for j in range(i,len(s)):\r\n t+=s[j]\r\n if s[j]=='Q':\r\n l+=t.count('A')\r\nprint(l)\r\n", "a=input()\r\nd=0\r\nfor i in range(len(a)):\r\n if a[i]==\"Q\":\r\n b=i\r\n for i in range(b+1,len(a)):\r\n if a[i]=='A':\r\n c=i\r\n for i in range(c+1,len(a)):\r\n if a[i]==\"Q\":\r\n d+=1\r\nprint(d)\r\n \r\n \r\n\r\n \r\n ", "def main():\r\n s=input()\r\n l=len(s)\r\n c=i=0\r\n while i<l:\r\n if s[i]=='Q':\r\n y=i+1\r\n while y<l:\r\n if s[y]=='A':\r\n z=y+1\r\n while z<l:\r\n if s[z]=='Q': c+=1\r\n z+=1\r\n y+=1\r\n i+=1\r\n print(c)\r\nif __name__=='__main__':\r\n main()", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\ntc=1\r\n#tc=int(input())\r\nfor _ in range(1,tc+1):\r\n s=input()\r\n n=len(s)\r\n a=[0]*n\r\n c=0\r\n ans=0\r\n for i in range(n):\r\n if s[i]=='Q':\r\n c+=1\r\n a[i]=c\r\n c=0\r\n for i in range(n-1,-1,-1):\r\n if s[i]=='Q':\r\n c+=1\r\n if s[i]=='A':\r\n ans+=c*a[i]\r\n print(ans)\r\n \r\n \r\n ", "s=input()\r\ns2=\"\"\r\nfor l in s:\r\n\tif l==\"Q\" or l==\"A\":\r\n\t\ts2+=l\r\nans=0\r\nfor a in range(len(s2)-2):\r\n\tif s2[a]==\"Q\":\r\n\t\tfor b in range(a+1,len(s2)-1):\r\n\t\t\tif s2[b]==\"A\":\r\n\t\t\t\tfor c in range(b+1,len(s2)):\r\n\t\t\t\t\tif s2[c]==\"Q\":\r\n\t\t\t\t\t\tans+=1\r\nprint(ans)", "s=input()\r\nqc=s.count(\"Q\")\r\nans=0\r\nn=len(s)\r\ndp=[0]*(n+1)\r\nc=0\r\nfor i in range(n):\r\n if s[i]=='Q':\r\n c+=1\r\n dp[i]=c\r\nfor i in range(n):\r\n if s[i]==\"A\":\r\n ans+=dp[i]*(qc-dp[i])\r\nprint(ans)\r\n", "s = input()\r\nnews = ''\r\nfor i in s:\r\n if i in 'QA':\r\n news += i\r\nans = 0\r\nfor i in range(len(news)):\r\n if news[i] == 'A':\r\n ans += (news[:i].count('Q') * news[i:].count('Q'))\r\nprint(ans)\r\n", "s=input()\r\ncnt,x,y=0,0,0\r\nn=len(s)\r\nfor i in range(n):\r\n if (s[i]=='Q'):\r\n cnt += x\r\n y+=1\r\n elif (s[i]=='A'):\r\n x+=y\r\nprint(cnt)", "import sys\r\n\r\n\r\ndef solveBetter(s):\r\n s_mod = ''\r\n for el in s:\r\n if el in 'QA':\r\n s_mod += el\r\n\r\n s = s_mod\r\n n = len(s_mod)\r\n\r\n prefix_Q = [0]*(n+1)\r\n suffix_Q = [0]*(n+1)\r\n\r\n for i, el in enumerate(s):\r\n prefix_Q[i+1] += prefix_Q[i] + (s[i] == 'Q')\r\n\r\n for i in range(n-1, -1, -1):\r\n suffix_Q[i] = suffix_Q[i+1] + (s[i] == 'Q')\r\n\r\n count = 0\r\n\r\n for i in range(n):\r\n if s[i] == 'A':\r\n count += prefix_Q[i] * suffix_Q[i]\r\n\r\n return count\r\n\r\n\r\nif 1 == 2:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nelse:\r\n input = sys.stdin.readline\r\n\r\ns = input()\r\nprint(solveBetter(s))\r\n", "s = input()\r\n\r\nn = len(s)\r\nres = 0\r\nfor i in range(n-2):\r\n if s[i] == 'Q':\r\n for j in range(i+1, n-1):\r\n if s[j] == 'A':\r\n for k in range(j+1, n):\r\n if s[k] == 'Q':\r\n res += 1\r\nprint(res)", "s=input()\r\npos1=s.find('Q')\r\npos2=s.rfind('Q')\r\na=s[pos1:pos2+1]\r\nc=0\r\nfor i in range(len(a)):\r\n\tif a[i]=='Q':\r\n\t\tfor j in range(i,len(a)):\r\n\t\t\tif a[j]=='A':\r\n\t\t\t\tfor k in range(j,len(a)):\r\n\t\t\t\t\tif a[k]=='Q':\r\n\t\t\t\t\t\tc+=1\r\nprint(c)", "S = input()\r\nn = len(S)\r\ncnt = 0\r\nfor i in range(n-2):\r\n for j in range(i+1,n-1):\r\n for k in range(j+1,n):\r\n if S[i] == 'Q' and S[j] =='A' and S[k] == 'Q':\r\n cnt += 1\r\nprint(cnt)\r\n ", "arr = list(input())\r\nsum = 0\r\nfor i in range(len(arr)):\r\n if arr[i] == 'Q':\r\n for j in range(i+1,len(arr)):\r\n if arr[j] == 'A':\r\n for k in range(j+1,len(arr)):\r\n if arr[k] == 'Q':\r\n sum +=1\r\n\r\nprint(sum)", "def find_q(s, k):\n return s.find('Q', k)\n\n\ndef find_a(s, k):\n return s.find('A', k)\n\n\ndef find(s):\n count = 0\n q1 = 0\n\n while True:\n q1 = find_q(s, q1)\n if q1 < 0:\n break\n\n a = q1 + 1\n while True:\n a = find_a(s, a)\n if a < 0:\n break\n\n q2 = a + 1\n while True:\n q2 = find_q(s, q2)\n if q2 < 0:\n break\n count += 1\n q2 += 1\n\n a += 1\n q1 += 1\n return count\n\n\ndef main():\n s = input()\n print(find(s))\n\n\ndef test():\n print(find('QAQ'))\n print(find('QAAQ'))\n\n\nmain()\n", "import re\r\n\r\ns = re.sub('[^QA]+','',input())\r\n\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n ans += (s[:i]).count('Q') * (s[(i+1):]).count('Q')\r\n \r\nprint(ans)", "a=input()\r\nn=len(a)\r\ndp=[[0]*(n+1) for h in range(4)]\r\ndp[0]=[1]*(n+1)\r\np=['Q','A','Q']\r\nfor j in range(3):\r\n x=0\r\n for i in range(n):\r\n if a[i]==p[j]:\r\n x+=dp[j][i]\r\n #print(i,j)\r\n dp[j+1][i+1]=x\r\nprint(dp[3][n])", "string = input().strip(\" \")\r\ndef num_Qs_before(index, string):\r\n count = 0\r\n for i in range(index):\r\n if string[i]==\"Q\":\r\n count+=1\r\n return count\r\ndef num_Qs_after(index, string):\r\n count = 0\r\n for i in range(index+1,len(string)):\r\n if string[i]==\"Q\":\r\n count+=1\r\n return count\r\ndef ONsolution(string):\r\n # new_string = \"\"\r\n count = 0\r\n # multiplicative_factor = 0\r\n for i in range(len(string)):\r\n if string[i]==\"A\":\r\n count = count + (num_Qs_before(i,string)*num_Qs_after(i,string))\r\n return count\r\nprint(ONsolution(string))", "s=input()\r\nqCount=0\r\naCount=0\r\ncount=[]\r\nfor i in range(len(s)):\r\n if(s[i]=='Q'):\r\n qCount+=1\r\n if(qCount>0 and s[i]=='A'):\r\n count.append(qCount)\r\n \r\n aCount+=1\r\n \r\n\r\ncount=[i*(qCount-i) for i in count]\r\n\r\n\r\nprint(sum(count))", "s=input()\r\nprint ([s[i]+s[j]+s[k]for i in range(len(s))for j in range(i)for k in range(j)].count('QAQ'))", "s = input()\nql, qr = 0, s.count(\"Q\")\nres = 0\nfor c in s:\n if c == \"Q\":\n ql += 1\n qr -= 1\n elif c ==\"A\":\n res += ql * qr\nprint(res)\n", "n = input()\r\nans = 0\r\nfor i in range(len(n)):\r\n if n[i] == 'A':\r\n ans += n[:i].count('Q')*n[i:].count('Q')\r\nprint(ans)", "s = input()\r\nres = 0\r\nfor ind in range(len(s)):\r\n if s[ind] == \"Q\":\r\n r = ind\r\n for i in range(ind + 1, len(s)):\r\n if s[i] == \"A\":\r\n for j in range(i + 1, len(s)):\r\n if s[j] == \"Q\":\r\n res += 1\r\nprint(res)", "s = input()\r\nsecuencias = 0\r\nfor i in range(len(s)):\r\n if (s[i] == \"Q\"):\r\n j = i+1\r\n while(j < len(s)):\r\n if (s[j] == \"A\"):\r\n k = j+1\r\n while (k < len(s)):\r\n if (s[k] == \"Q\"):\r\n secuencias += 1\r\n k += 1\r\n j += 1\r\n\r\n\r\nprint(secuencias)", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n for k in range(j,n):\r\n if (s[i]=='Q' and s[j]=='A' and s[k]=='Q'):\r\n #print(i,j,k)\r\n count+=1\r\nprint(count)\r\n", "from collections import Counter\r\nimport math\r\nimport itertools\r\nimport random\r\n\r\nimport sys\r\nsys.setrecursionlimit(100000)\r\n\r\n\r\ndef nq(s,next, num, f):\r\n l = len(s)\r\n for i in range(l):\r\n if s[i] == next:\r\n if num == 2:\r\n f+=1\r\n else:\r\n f = nq(s[i+1:], \"Q\", 2, f)\r\n return f\r\n\r\n\r\n\r\ndef main():\r\n s = input()\r\n ans2 = 0\r\n for j in range(len(s)):\r\n if s[j] == 'Q':\r\n ans2+=nq(s[j+1:], 'A', 1, 0)\r\n print(ans2)\r\n # ans = 0\r\n # for i in range(len(s)):\r\n # if s[i] == \"Q\":\r\n # for j in range(i+1,len(s)):\r\n # if s[j] == \"A\":\r\n # for k in range(j + 1, len(s)):\r\n # if s[k] == \"Q\":\r\n # ans+=1\r\n # print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "a = input()\r\nans = 0\r\nfor i in range(0,len(a)):\r\n for j in range(i,len(a)):\r\n for h in range(j,len(a)):\r\n if a[i] == 'Q' and a[j] == 'A' and a[h] == 'Q':\r\n ans += 1\r\nprint(ans)\r\n", "sequenceCounter = 0\r\nsequence = input()\r\nfor Last_Q_index in range(2,sequence.__len__()):\r\n if sequence[Last_Q_index] == 'Q':\r\n for A_index in range(Last_Q_index-1,0,-1):\r\n if sequence[A_index] == 'A':\r\n for First_Q_index in range(A_index-1,-1,-1):\r\n if sequence[First_Q_index] == 'Q':\r\n sequenceCounter += 1\r\nprint(int(sequenceCounter))", "import math\n\nclass Solution:\n\n\tdef fun(self, S1, S2, i, j, dp):\n\n\t\tif j < 0:\n\t\t\treturn 1\n\n\t\tif i < 0:\n\t\t\treturn 0\n\n\t\tif dp[i][j] != -1:\n\t\t\treturn dp[i][j]\n\n\t\tif S1[i] == S2[j]:\n\t\t\tdp[i][j] = self.fun(S1, S2, i - 1, j - 1, dp) + self.fun(S1, S2, i - 1, j, dp)\n\t\telse:\n\t\t\tdp[i][j] = self.fun(S1, S2, i - 1, j, dp)\n\n\t\treturn dp[i][j]\n\n\tdef QAQ(self, S):\n\t\tdp = [[-1 for _ in range(3)] for __ in range(len(S))]\n\n\t\tprint(self.fun(S, \"QAQ\", len(S) - 1, 2, dp))\n\n\n\ndef main():\n\tS = input()\n\n\tsol = Solution()\n\n\tsol.QAQ(S)\n\nif __name__ == '__main__':\n\n\tmain()", "def solution(s):\r\n\tn = len(s)\r\n\tm = 3\r\n\tcSt = \"QAQ\"\r\n\tdp= [[0 for c in range(m+1)]for r in range(n+1)]\r\n\tfor i in range(n+1):\r\n\t\tdp[i][0]= 1\r\n\tfor i in range(1,n+1,1):\r\n\t\tfor j in range(1,m+1,1):\r\n\t\t\tif s[i-1]== cSt[j-1]:\r\n\t\t\t\tdp[i][j]= (dp[i-1][j-1]+dp[i-1][j])\r\n\t\t\telse:dp[i][j]= dp[i-1][j]\r\n\tprint(dp[n][m])\r\n\t\t\r\nif __name__ == \"__main__\":\r\n\tseq = input()\r\n\tsolution(seq)", "s = input()\r\ncount = 0;\r\nn = len(s)\r\nfor i in range(n - 2):\r\n for j in range(i , n - 1):\r\n for k in range(j , n):\r\n if s[i] == \"Q\" and s[j] == \"A\" and s[k] == \"Q\":\r\n count = count + 1\r\nprint(count) \r\n\r\n", "a = input()\n\nkol = 0\nfor i in range(len(a)):\n for j in range(i+1, len(a)):\n for k in range(j+1, len(a)):\n if (a[i] + a[j] + a[k]) == \"QAQ\":\n kol += 1\nprint(kol)\n\n\n# Sat Nov 04 2023 19:27:36 GMT+0300 (Moscow Standard Time)\n", "def qaq_count(s, index=0, temp=''):\r\n if index>=len(s):\r\n return 0\r\n if len(temp) == 2 and s[index]=='Q':\r\n return 1+qaq_count(s, index+1, temp)\r\n elif (len(temp) == 1 and s[index]=='A') or (len(temp)==0 and s[index]=='Q'):\r\n return qaq_count(s, index+1, temp+s[index])+qaq_count(s, index+1, temp)\r\n else:\r\n return qaq_count(s, index+1, temp)\r\n \r\n\r\ns = input()\r\nprint(qaq_count(s))", "QAQ = input()\ncnt_q_first = 0\ncnt_q_second = QAQ.count(\"Q\")\nresult = 0\nfor char in QAQ:\n if char == \"Q\":\n cnt_q_first += 1\n cnt_q_second -= 1\n if char == 'A':\n result += cnt_q_first * cnt_q_second\nprint(result)\n \t\t\t \t\t\t \t \t \t \t\t \t \t", "# Read the input string\ns = input()\n\n# Initialize the count variable\ncount = 0\n\n# Iterate through each character of the string\nfor i in range(len(s)):\n if s[i] == \"Q\":\n for j in range(i + 1, len(s)):\n if s[j] == \"A\":\n for k in range(j + 1, len(s)):\n if s[k] == \"Q\":\n # Found a subsequence \"QAQ\"\n count += 1\n\n# Print the result\nprint(count)\n\n \t \t \t\t\t \t\t \t \t \t\t\t", "def count_occur(): \n s = input()\n count_sets = 0\n\n for i in range(len(s)):\n q_sum = 0\n\n if s[i] == 'A':\n q_left = s[:i].count('Q')\n q_right = s[i:].count('Q')\n q_sum = q_left * q_right\n\n count_sets += q_sum\n\n return count_sets\n\nprint(count_occur())\n\n\n\t \t\t \t \t \t\t\t\t\t \t \t \t \t\t\t\t\t\t", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n for j in range(i):\r\n for k in range(j):\r\n if(s[i]+s[j]+s[k]=='QAQ'):\r\n c=c+1\r\nprint(c)\r\n \r\n", "s = list(map(str, input()))\nq = 0\nqa = 0\nqaq = 0\n\nfor char in s:\n if char == 'Q':\n q += 1\n qaq += qa\n\n if char == 'A':\n qa += q\n\nprint(qaq)\n", "s = input()\r\nq = 0\r\nqa = 0\r\nresult = 0\r\nfor c in s :\r\n if c == 'Q' :\r\n q += 1\r\n result += qa\r\n if c == 'A' :\r\n qa += q\r\nprint(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Nov 29 19:00:11 2020\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\n\r\ndef qaq(values):\r\n count=0\r\n for i in range(len(values)):\r\n if values[i]=='Q':\r\n for j in range(i+1,len(values)):\r\n if values[j]=='A':\r\n for k in range(j+1,len(values)):\r\n if values[k]=='Q':\r\n count=count+1\r\n return count\r\nvalues=input()\r\nprint(qaq(values))", "def subsq(S, s): # пусть подстрока s фикс длины 3 \r\n \r\n count = 0\r\n \r\n for i in range(len(S)):\r\n for j in range(i+1, len(S)):\r\n for k in range(j+1, len(S)):\r\n if (S[i] + S[j] + S[k] == s):\r\n count+=1\r\n return count\r\n\r\n\r\nS = input()\r\nprint(subsq(S, \"QAQ\"))\r\n\r\n", "# O(n)\r\ns=input()\r\nif 'Q' in s:\r\n a=[] ; cur=0\r\n for i in range(s.index('Q'),len(s)):\r\n if s[i] == 'A':\r\n cur+=1\r\n if s[i] == 'Q':\r\n a.append(cur)\r\n ans=0 ; n=len(a)\r\n for i in range(n):\r\n ans+=a[i]*i - a[i]*(n-1-i)\r\n print(ans) \r\nelse:\r\n print(0)\r\n \r\n \r\n ", "\r\ndef subsequence(l1,l2):\r\n\r\n #print(dp[10][0])\r\n if (l1 == 0 and l2 == 0) or l2 == 0:\r\n return 1\r\n\r\n elif l1 == 0:\r\n return 0\r\n\r\n\r\n elif dp[l2][l1] != -1:\r\n\r\n return dp[l2][l1]\r\n\r\n elif S[l1-1] != sub[l2-1]:\r\n\r\n dp[l2][l1] = subsequence(l1-1,l2)\r\n return dp[l2][l1]\r\n\r\n else:\r\n #print(11)\r\n dp[l2][l1] = subsequence(l1-1,l2-1) + subsequence(l1-1,l2)\r\n\r\n return dp[l2][l1]\r\n\r\n\r\nS = input()\r\nsub = 'QAQ'\r\n\r\ndp = [[-1 for i in range(102)] for j in range(10)]\r\n\r\nprint(subsequence(len(S),len(sub)))\r\n", "s= input()\nn=len(s)\ncount=0\nfor i in range(0, n):\n\tfor j in range(i+1, n):\n\t\tfor k in range(j+1, n):\n\t\t\tif s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q':\n\t\t\t\tcount +=1\n \nprint(count)", "s=input()\r\ndp=[[-1 for i in range(3+1)]for j in range(len(s)+1)]\r\ndef func(s,t,n,m):\r\n\tif (n==0 and m==0) or m==0:\r\n\t\treturn 1\r\n\tif n==0:\r\n\t\treturn 0\r\n\tif dp[n][m]!=-1:\r\n\t\treturn dp[n][m]\r\n\tif s[n-1]==t[m-1]:\r\n\t\tdp[n][m]=func(s,t,n-1,m-1)+func(s,t,n-1,m)\r\n\t\treturn dp[n][m]\r\n\telse:\r\n\t\tdp[n][m]=func(s,t,n-1,m)\r\n\t\treturn dp[n][m]\r\nprint(func(s,'QAQ',len(s),3))\r\n\t", "s = input()\r\nc = 0\r\nfirst_q_count = 0\r\nlast_q_count = s.count(\"Q\")\r\nfor i in range(len(s)):\r\n char = s[i]\r\n if char == \"Q\":\r\n first_q_count += 1\r\n last_q_count -= 1\r\n if char == \"A\":\r\n c += first_q_count * last_q_count\r\nprint(c)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input().strip()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == 'Q':\r\n for j in range(i+1,n):\r\n if s[j] == 'A':\r\n for k in range(j+1,n):\r\n if s[k] == 'Q':\r\n ans += 1\r\nprint(ans)\r\n \r\n# sys.stdout.write('\\n'.join(map(str, out)))\r\n'''\r\nquick observations\r\n\r\n\r\n'''", "def fun(cad):\n c= 0\n n = len(cad)\n\n for i in range(n - 2):\n if cad[i] == 'Q':\n for j in range(i + 1, n - 1):\n if cad[j] == 'A':\n for k in range(j + 1, n):\n if cad[k] == 'Q':\n c += 1\n\n return c\n\ncad =input()\nc= fun(cad)\nprint(c)\n \t\t\t\t \t\t \t\t \t\t \t\t \t \t\t", "s=str(input())\r\ndp='QAQ'\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n for j in range(i,len(s)):\r\n if s[j]=='A':\r\n for k in range(j, len(s)):\r\n if s[k]=='Q':\r\n c+=1\r\nprint(c)\r\n\r\n\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\n\r\nfor i in range(n):\r\n if s[i] == \"A\":\r\n l = s[:i]\r\n r = s[i+1:]\r\n ans += l.count(\"Q\") * r.count(\"Q\")\r\nprint(ans)", "def iinput():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\nmas = list(input())\r\nans = 0\r\n\r\npref = [0 for i in mas]\r\nfor i in range(len(mas)):\r\n if i == 0:\r\n if mas[i] == \"Q\":\r\n pref[i] = 1\r\n else:\r\n pref[i] = 0\r\n elif mas[i] == \"Q\":\r\n pref[i] = pref[i - 1] + 1\r\n else:\r\n pref[i] = pref[i - 1]\r\n\r\nmax_pref = pref[-1]\r\n\r\nfor i in range(len(mas)):\r\n if mas[i] == \"A\":\r\n ans += pref[i] * (max_pref - pref[i])\r\n\r\nprint(ans)\r\n", "s = input()\nsubs_cnt = 0\nq_before_cnt = 0\na_cnt = 0\nq_after_cnt = s.count('Q')\nfor c in s:\n if c == 'A':\n subs_cnt += q_before_cnt * q_after_cnt\n if c == 'Q':\n q_before_cnt += 1\n q_after_cnt -= 1\nprint(subs_cnt)\n\n\n \t \t\t \t\t\t\t \t \t\t \t \t", "s=input()\r\nn=len(s)\r\nt=0\r\np=n*[0]\r\nif s[0]=='Q':\r\n d=1\r\nelse:\r\n d=0\r\np[0]=d\r\nfor i in range(1,n):\r\n if s[i]=='Q':\r\n d=1\r\n else:\r\n d=0\r\n p[i]=p[i-1]+d\r\nfor i in range(n):\r\n if s[i]=='A':\r\n t+=p[i]*(p[-1]-p[i])\r\nprint(t)\r\n", "string = input()\r\nq = 0\r\nqa = 0\r\nqaq = 0\r\nfor j in range(len(string)):\r\n if string[j] == \"Q\":\r\n q = q+1\r\n qaq += qa\r\n elif string[j] == \"A\":\r\n qa += q\r\nprint(qaq)\r\n", "n = input()\r\nr =0\r\nfor i in range(0,len(n)):\r\n if n[i] == 'Q':\r\n for k in range(i+1,len(n)):\r\n if n[k] == 'A':\r\n for y in range(k+1,len(n)):\r\n if n[y] == 'Q':\r\n r+=1\r\nprint(r)\r\n", "from collections import defaultdict, deque, Counter\r\nimport heapq\r\nimport sys\r\nimport threading\r\nimport math\r\n\r\n\r\ndef solve():\r\n string = input()\r\n ans = 0\r\n q = 0\r\n qa = 0\r\n for s in string:\r\n if s=='Q':\r\n ans += qa\r\n q +=1\r\n elif s=='A':\r\n qa +=q\r\n\r\n return ans\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ndef main():\r\n # t = inp()\r\n # for _ in range(t):\r\n print(solve())\r\n\r\n\r\nthreading.stack_size(1 << 27)\r\nsys.setrecursionlimit(1 << 30)\r\nmain_thread = threading.Thread(target=main)\r\nmain_thread.start()\r\nmain_thread.join()\r\n", "a=input()\r\ns=''\r\nfor x in range(len(a)):\r\n if a[x]=='Q' or a[x]=='A':\r\n s+=a[x]\r\no=0\r\nfor x in range(len(s)):\r\n if s[x]=='Q':\r\n for y in range(x,len(s)):\r\n if s[y]=='A':\r\n for z in range(y,len(s)):\r\n if s[z]=='Q':\r\n o+=1\r\nprint(o)", "s = input()\r\nk = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n for j in range(i + 1, len(s)):\r\n if s[j] == 'A':\r\n for l in range(j + 1, len(s)):\r\n if s[l] == 'Q':\r\n k += 1\r\nprint(k)\r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 10/09/2020\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport heapq\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\ns = is1()\r\ndp = [0] * (len(s))\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n dp[i] = s[:i].count('Q') * s[i + 1 :].count('Q')\r\nprint(sum(dp))\r\n\r\n", "a=input()\r\nb=a.upper()\r\nl=len(a)\r\nc=[]\r\nsum=0\r\nfor i in b:\r\n if i=='Q' or i=='A':\r\n c.append(i)\r\nfor i in range(len(c)):\r\n if c[i]=='Q':\r\n for j in range(i+1,len(c)):\r\n if c[j]=='A':\r\n for k in range(j+1,len(c)):\r\n if c[k]=='Q':\r\n sum=sum+1\r\nprint(sum)\r\n\r\n\r\n", "s = input()\r\na = 0\r\nb = 0\r\nc = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n c += b\r\n a += 1\r\n if s[i] == 'A':\r\n b += a\r\nprint(c)", "#1/10\r\n\r\nn = input()\r\n\r\na = 0\r\nb = 0\r\nc = 0\r\n\r\n\r\nfor i in range(len(n)):\r\n \r\n if n[i] == 'Q':\r\n c += b\r\n a += 1\r\n if n[i] == 'A':\r\n b += a\r\n\r\nprint(c)", "a=input()\r\nn=len(a)\r\ncount=0\r\nfor i in range(n):\r\n if(a[i]!='Q'):\r\n continue\r\n for j in range(i+1,n):\r\n if(a[j]!='A'):\r\n continue\r\n for k in range(j+1,n):\r\n if(a[k]=='Q'):\r\n count+=1\r\nprint(count)\r\n ", "s=input()\r\nQ=[]\r\nn=len(s)\r\nq=0\r\nfor i in range(n):\r\n if s[i]==\"Q\":\r\n q+=1\r\n Q.append(q)\r\nans=0\r\nfor i in range(1,n-1):\r\n if s[i]!=\"A\":\r\n continue\r\n ans+=Q[i-1]*(Q[-1]-Q[i])\r\nprint(ans)\r\n\r\n\r\n", "st=input()\r\nlst=[]\r\nfor i in range(len(st)):\r\n if st[i]=='Q':\r\n lst.append(i)\r\n#print(lst)\r\nans=0\r\nfor i in range(len(lst)):\r\n for j in range(i+1,len(lst)):\r\n ans+=(st[lst[i]:lst[j]+1].count('A'))\r\nprint(ans)", "k=input();\r\nprint(sum(k[:i].count(\"Q\")*k[i:].count(\"Q\") \r\nfor i in range(len(k)) \r\nif k[i]==\"A\"))", "N = input()\r\nQAQ = 0\r\nfor i in range(0,len(N)):\r\n if N[i] == 'Q':\r\n for j in range(i,len(N)):\r\n if N[j] == 'A':\r\n for k in range(j,len(N)):\r\n if N[k] == 'Q':\r\n QAQ += 1\r\nprint(QAQ)", "a=input()\r\nans=0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n for k in range(j+1,len(a)):\r\n if(a[i]==\"Q\" and a[j]==\"A\" and a[k]==\"Q\"):\r\n ans+=1\r\nprint(ans)\r\n\r\n", "s=input()\r\nf=0\r\nfor i in range(len(s)):\r\n\tif s[i]==\"A\":\r\n\t\tf+=s[:i].count(\"Q\")*s[i:].count(\"Q\")\r\nprint(f)\r\n\r\n", "n = input()\r\nans = 0\r\nfor i in range(len(n)-2):\r\n for j in range(i+1, len(n)-1):\r\n for z in range(j+1, len(n)):\r\n if n[i]=='Q' and n[j]=='A' and n[z]=='Q':\r\n ans+=1\r\nprint(ans)", " \r\n# T = int(input())\r\n# for i in range(1,T+1):\r\n# N,X = map(int,input().split(\" \"))\r\n# A = list(map(int,input().split(\" \")))\r\n# fin_lst = []\r\n# lst3 = []\r\n# for j in range(N):\r\n# if A[j] <= X:\r\n# fin_lst.append(j+1)\r\n# else:\r\n# lst2 = []\r\n# lst2.append(j+1)\r\n# fac = A[j]//X\r\n# lst2.append(fac)\r\n# lst3.append(lst2) \r\n# lst3 = sorted(lst3, key = lambda x: x[1]) \r\n# for j in lst3:\r\n# fin_lst.append(j[0])\r\n# print(\"Case #{}:\".format(i),end= \" \")\r\n# print(*fin_lst)\r\n\r\n# T = int(input())\r\n# for i in range(T):\r\n# n,x = map(int,input().split(\" \"))\r\n# if n ==1 or n==2:\r\n# print(1)\r\n# else:\r\n# n = n - 2\r\n# if n%x == 0:\r\n# ans = n//x + 1\r\n# print(ans) \r\n# else:\r\n# ans = n//x + 2\r\n# print(ans) \r\n\r\n# T = int(input())\r\n# for i in range(T):\r\n# n,m = map(int,input().split(\" \"))\r\n# lst = []\r\n# count = 0\r\n# for j in range(n):\r\n# lst1 = []\r\n# lt,rt = map(int,input().split(\" \"))\r\n# lb,rb = map(int,input().split(\" \"))\r\n# lst1.append(lt)\r\n# lst1.append(rt)\r\n# lst1.append(lb)\r\n# lst1.append(rb)\r\n# lst.append(lst1)\r\n# if m%2 != 0:\r\n# print(\"NO\") \r\n# else:\r\n# for j in lst:\r\n# if j[1]==j[2]: \r\n# count += 1 \r\n# print(\"YES\")\r\n# break\r\n# if count == 0:\r\n# print(\"NO\") \r\n\r\n# n = int(input())\r\n# count = 0\r\n# if n >= 100:\r\n# div = n//100\r\n# count += div\r\n# rem = n%100\r\n# n = rem\r\n# if n >= 20:\r\n# div = n//20\r\n# count += div\r\n# rem = n%20\r\n# n = rem\r\n# if n >= 10:\r\n# div = n//10\r\n# count += div\r\n# rem = n%10\r\n# n = rem \r\n# if n >= 5:\r\n# div = n//5\r\n# count += div\r\n# rem = n%5\r\n# n = rem \r\n# if n >= 1:\r\n# div = n//1\r\n# count += div\r\n# rem = n%1\r\n# print(count) \r\n\r\nn = input()\r\nstring = \"\"\r\ntotalCount = 0\r\nfor i in n:\r\n if i == 'Q' or i == 'A':\r\n string += i\r\nfor i in range(len(string)):\r\n if string[i] == 'A':\r\n countb = string.count('Q',0,i)\r\n counta = string.count('Q',i,len(string))\r\n totalCount += counta*countb\r\nprint(totalCount) \r\n\r\n \r\n\r\n\r\n\r\n", "from heapq import *\r\nfrom collections import *\r\nfrom math import *\r\nimport sys\r\n# arr=defaultdict(lambda : 0)\r\ninput=sys.stdin.readline\r\ndef solve():\r\n s=input()\r\n ans=0\r\n for i in range(len(s)):\r\n if s[i]==\"Q\":\r\n for j in range(i+1,len(s)):\r\n if s[j]==\"A\":\r\n ans+=s[j+1::].count(\"Q\")\r\n print(ans)\r\nsolve()\r\n", "s = input()\r\ncount = 0\r\nprev_scores = [0,0]\r\nfor i in s:\r\n if i=='Q':\r\n prev_scores[0]+=1\r\n count+=prev_scores[1]\r\n elif i=='A':\r\n prev_scores[1]+=prev_scores[0]\r\n \r\nprint(count)", "s=input()\ncpt=0\nfor i in range(len(s)):\n for j in range(i, len(s)):\n for k in range(j, len(s)):\n if s[i]+s[j]+s[k]==\"QAQ\":\n cpt+=1\n\nprint(cpt)\n", "from itertools import combinations\r\nprint(sum(map(lambda x: (x==('Q','A','Q')),combinations(input(),3))))", "s = input()\nqb = 0\nql = s.count(\"Q\")\na = 0\nfor x in s:\n if x == \"Q\":\n qb += 1\n ql -= 1\n if x == \"A\":\n a += qb * ql\nprint(a)\n", "import math\r\nimport sys\r\n#from collections import deque, Counter, OrderedDict, defaultdict\r\n#import heapq\r\n#ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#import bisect\r\n#from bisect import bisect_left,bisect_right\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ns=insr()\r\nn=len(s)\r\nq=s.count('Q')\r\ntemp=0\r\ncnt=0\r\nfor i in range(n):\r\n if s[i]=='Q':\r\n temp+=1\r\n elif s[i]=='A':\r\n cnt+=temp*(q-temp)\r\nprint(cnt)", "def qaq():\r\n _string = str(input())\r\n amount = 0\r\n str_size = len(_string)\r\n\r\n for pos in range(str_size):\r\n if _string[pos] == 'Q':\r\n for pos2 in range(pos, str_size):\r\n if _string[pos2] == 'A':\r\n for pos3 in range(pos2, str_size):\r\n if _string[pos3] == 'Q':\r\n amount += 1\r\n\r\n print(amount)\r\n\r\n\r\nqaq()\r\n", "s=input()\r\nn=len(s)\r\ncnt=0\r\ni=0\r\nwhile(i<n-2):\r\n while(i<n-2 and s[i]!='Q'):\r\n i+=1\r\n j=i+1\r\n while(j<n-1):\r\n while(j<n-1 and s[j]!='A'):\r\n j+=1\r\n if(j<n-1):\r\n cnt+=s[j:].count('Q') \r\n j+=1\r\n i+=1\r\nprint(cnt)\r\n ", "s=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]=='A':\r\n ans+=s[:i].count('Q')*s[i+1:].count('Q')\r\n #print(s[:i],s[i+1:])\r\nprint(ans)", "strg = input()\r\nlenstrg = len(strg)\r\nif lenstrg <= 2:\r\n print(0)\r\nelse:\r\n dp = [[0 for j in range(lenstrg)] for i in range(3)]\r\n dp[0][0] = int(strg[0] == 'Q')\r\n for i in range(1, lenstrg):\r\n dp[0][i] = int(strg[i] == 'Q') + dp[0][i - 1]\r\n for i in range(1, lenstrg):\r\n dp[1][i] = int(strg[i] == 'A') * dp[0][i - 1] + dp[1][i - 1]\r\n for i in range(2, lenstrg):\r\n dp[2][i] = int(strg[i] == 'Q') * dp[1][i - 1] + dp[2][i - 1]\r\n print(dp[2][-1])", "arr = input()\r\ndp = []\r\nnum = 0\r\nfor i in reversed(range(len(arr))):\r\n if arr[i] == 'Q':\r\n num += 1\r\n elif arr[i] == 'A':\r\n dp.append(num)\r\nans = 0\r\nfor i in range(len(dp)):\r\n ans += (num - dp[i]) * dp[i]\r\n\r\nprint(ans)\r\n", "s = input()\nn = len(s)\n\ncount = 0\n\nfor i in range(n):\n if s[i] == 'Q':\n for j in range(i+1, n):\n if s[j] == 'A':\n for k in range(j+1, n):\n if s[k] == 'Q':\n count += 1\n\nprint(count)\n\n\t \t \t \t \t\t \t \t \t \t \t", "while True:\r\n try:\r\n s = input()\r\n l = 0\r\n for i in range(len(s)):\r\n if s[i] == \"Q\":\r\n for j in range(i+1, len(s)):\r\n if s[j] == \"A\":\r\n for k in range(j+1, len(s)):\r\n if s[k] == \"Q\":\r\n l += 1\r\n print(l)\r\n except:\r\n break", "def numberOfQAQs():\r\n n = len(str1)\r\n cache = [[0 for j in range(4)] for i in range(n + 1)]\r\n \r\n for r in range(n + 1):\r\n cache[r][0] = 1\r\n \r\n for r in range(1, n + 1):\r\n for c in range(1, 4):\r\n if str1[r - 1] == str2[c - 1]:\r\n cache[r][c] = cache[r - 1][c - 1] + cache[r - 1][c]\r\n else:\r\n cache[r][c] = cache[r - 1][c]\r\n return cache[n][3] \r\n\r\nstr1 = input()\r\nstr2 = 'QAQ'\r\n\r\nprint(numberOfQAQs())\r\n", "s=input()\r\nq=s.count(\"Q\")\r\nc=0\r\nqq=0\r\nfor i in range(len(s)):\r\n if s[i]==\"A\":\r\n c+=qq*(q-qq)\r\n if s[i]==\"Q\":\r\n qq+=1\r\nprint(c)", "def solve():\n s = input()\n # n = len(s) \n a,b,c = 0,0,0\n for char in s:\n if char == \"Q\":\n a += 1\n c+=b\n if char == \"A\":\n b += a\n print(c)\n \n \n \ndef main():\n # t = int(input())\n t = 1\n for _ in range(t):\n solve()\n\n\n\nif __name__ == \"__main__\":\n main()\n", "s = input()\nn = len(s)\nprefix = [0] * n\nfor i in range(n):\n if i > 0:\n prefix[i] = prefix[i - 1]\n if s[i] == 'Q':\n prefix[i] += 1\nans = 0\nq_cnt = s.count('Q')\nfor i in range(n):\n if s[i] == 'A':\n ans += prefix[i] * (q_cnt - prefix[i])\nprint(ans)", "str=input()\r\nl=len(str)\r\nw=0\r\nfor i in range(l):\r\n if str[i] == \"Q\":\r\n for j in range(i,l):\r\n if str[j] == \"A\":\r\n for k in range(j,l):\r\n if str[k] == \"Q\":\r\n w+=1\r\nprint(w)", "s=input()\r\nq,qa,qaq=0,0,0\r\nfor i in range(len(s)):\r\n if s[i]=='A':\r\n qa+=q #if q present then qa is incremented\r\n elif s[i]=='Q':\r\n q+=1 # if Q is found then q+=1\r\n qaq+=qa # if qa is present then qaq is incremented\r\nprint(qaq)", "s = input()\nout = 0\ncount_q1 = 0\ncount_q2 = s.count('Q')\nfor i in range(len(s)):\n if s[i] == 'Q':\n count_q1 += 1\n count_q2 -= 1\n if s[i] == \"A\":\n out += count_q1*count_q2\nprint(out)\n \t \t\t\t \t \t\t \t\t\t \t\t\t\t\t \t\t\t\t", "s=input()\r\nn=len(s)\r\nm=0\r\nfor i in range(len(s)):\r\n\tif s[i]=='Q':\r\n\t\tfor j in range(i,n):\r\n\t\t\tif s[j]=='A':\r\n\t\t\t\tfor k in range(j,n):\r\n\t\t\t\t\tif s[k]=='Q':\r\n\t\t\t\t\t\tm+=1\r\nprint(m)", "s=input()\r\ncount=0\r\nfor k in range(len(s)):\r\n if s[k]==\"Q\":\r\n for l in range(k+1,len(s)):\r\n if s[l]==\"A\":\r\n for m in range(l+1,len(s)):\r\n if s[m]==\"Q\":\r\n count+=1\r\nprint(count)", "def solve(s):\r\n\tcnt = 0\r\n\tfor i in range(len(s)):\r\n\t\tfor j in range(i,len(s)):\r\n\t\t\tfor k in range(j,len(s)):\r\n\t\t\t\tif s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q':\r\n\t\t\t\t\tcnt += 1\r\n\r\n\treturn cnt\r\n\r\n\r\nn = input()\r\nprint(solve(n))", "w = input()\r\nb = len(w)\r\notv = 0\r\na = 0\r\nfor i in range(b):\r\n if w[i] == \"Q\":\r\n a +=1\r\np = []\r\nQl = 0\r\nQr = a\r\nfor s in range(b):\r\n if w[s] == \"Q\":\r\n Ql += 1\r\n Qr -= 1\r\n elif w[s] == \"A\":\r\n j = Ql*Qr\r\n p.append(j)\r\nc = int(len(p))\r\nu = 0\r\nfor y in range(c):\r\n u += p[y]\r\nprint(u)", "s = \"\".join([*filter(lambda x: x in (\"Q\",\"A\"),input())])\r\nn = s.count(\"Q\");i = 0\r\ncnt = 0\r\nwhile n:\r\n if(s[i] != \"Q\"): i += 1\r\n else:\r\n m = s[i:].count(\"A\")\r\n j = i+1\r\n while m:\r\n if(s[j]!=\"A\"): j+=1\r\n else: cnt += s[j:].count(\"Q\"); m-= 1; j+=1\r\n n -= 1; i += 1\r\nprint(cnt)", "s = input()\r\ncount = 0\r\nfor _ in range(len(s)):\r\n if s[_] == 'Q':\r\n for i in range(_,len(s)):\r\n if s[i] == 'A':\r\n for j in range(i,len(s)):\r\n if s[j] == 'Q':\r\n count+=1\r\n\r\nprint(count)", "n=input()\r\ncount=0\r\nq=0\r\nqaq=0\r\nfor i in n:\r\n if(i=='A'):\r\n count+=q\r\n elif(i=='Q'):\r\n qaq+=count\r\n q+=1\r\nprint(qaq)", "st=input()\r\ncount=0\r\nfor i in range(len(st)):\r\n if st[i]==\"Q\":\r\n for j in range(i+1,len(st)):\r\n if st[j]==\"Q\":\r\n count+=st.count(\"A\",i,j)\r\n \r\nprint(count)", "from itertools import combinations\r\ns=input()\r\nt='';c=0\r\nfor i in s:\r\n if i=='Q' or i=='A':\r\n t+=i\r\nl=list(combinations(t,3))\r\nfor i in l:\r\n if ''.join(i)=='QAQ':\r\n c+=1\r\nprint(c)\r\n", "from itertools import accumulate\r\nfrom operator import add\r\n\r\nline = input()\r\nlen_ = len(line)\r\nprefix_sum = list(accumulate((int(x == \"Q\") for x in line), add))\r\nprint(sum(int(j == \"A\") * prefix_sum[i] * (prefix_sum[len_ - 1] - prefix_sum[i]) for i, j in enumerate(line)))\r\n", "from tkinter import N\n\n\ns = input()\nn = 0\n\n\ndef findQAQ(string, subs):\n if not subs:\n return\n global n\n for i, v in enumerate(string):\n if v == subs[0]:\n findQAQ(string[i+1:], subs[1:])\n if len(subs) == 1:\n n += 1\n\n\nfindQAQ(s, 'QAQ')\nprint(n)\n\n \t\t \t \t\t\t\t\t \t\t\t\t\t\t\t \t\t \t \t", "# https://codeforces.com/problemset/problem/894/A\n\n# variation of find subsequence of A in B - we returned if the len of the LCS is equal to s2\n\ndef subsequence(s1, s2, n, m):\n dp = [[0] * (m + 1) for _ in range(n + 1)]\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, m + 1):\n if s1[i - 1] == s2[j - 1]:\n dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j] # this thing is still not clear\n else:\n dp[i][j] = dp[i - 1][j]\n return dp[n][m]\n\n\n# print(dp)\n\n\n# from itertools import combinations as c\n# s, n = input(), 0\n# for a in c(s, 3):\n# if ''.join(a) == 'QAQ':\n# n += 1\n# print(n)\n\n\ns1 = input()\nprint(subsequence(s1, \"QAQ\", len(s1), 3))\n", "seq = input()\r\n\r\ncount = 0\r\nwhile(seq.find('A')!=-1):\r\n order = seq.split('A', 1)\r\n cur_sub = order[0].count('Q') * order[1].count('Q')\r\n count = count + cur_sub\r\n seq = seq.replace('A', '', 1)\r\n\r\nprint(count)\r\n", "s = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n res += s.count('Q',0,i)*s.count('Q',i,len(s))\r\nprint(res)", "s = input()\r\nn = len(s)\r\na = []\r\nfor i in range(n):\r\n if s[i] in 'AQ':\r\n a.append(s[i])\r\na = ''.join(a)\r\nn = len(a)\r\nk = 0\r\nb = []\r\nans = 0\r\nfor x in a:\r\n if x == 'A':\r\n k += 1\r\n b.append(k)\r\nfor i in range(n):\r\n if a[i] == 'Q':\r\n for j in range(i + 1, n):\r\n if a[j] == 'Q':\r\n ans += b[j] - b[i]\r\n#print(b)\r\nprint(ans)\r\n", "s=input()\r\nfrom collections import defaultdict\r\ndic=defaultdict(int)\r\nans=0\r\nfor i in range(0,len(s)):\r\n if s[i]==\"A\":\r\n ans=ans+s[0:i].count(\"Q\")*s[i+1:len(s)].count(\"Q\")\r\nprint(ans)", "s = input()\r\n\r\nqs = [0 for i in range(len(s))]\r\nres = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n qs[i] = qs[i-1] + 1\r\n else:\r\n qs[i] = qs[i-1]\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n res += qs[i] * (qs[len(qs)-1] - qs[i])\r\n\r\nprint(res)", "a=input()\r\ncnt=0\r\nn=len(a)\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n for y in range(j+1, n):\r\n if a[i]==a[y]=='Q' and a[j]=='A':\r\n cnt+=1\r\nprint(cnt)", "n=input()\nn=list(n)\na, b, c = 0, 0, 0\nfor i in n:\n if i=='Q':\n c+=b\n a+=1\n if i=='A':\n b+=a\nprint(c)\n \t \t\t\t\t\t \t \t \t\t \t \t \t \t\t", "s = list(input())\r\n\r\nq = 0\r\nqa = 0\r\nqaq = 0\r\n\r\nfor x in s:\r\n if x == \"Q\":\r\n q+=1\r\n qaq += qa\r\n if x == \"A\":\r\n qa+=q\r\n\r\nprint(qaq)\r\n\r\n ", "s = input()\r\nq, qa, qaq = 0, 0, 0\r\nfor c in s:\r\n\tif c == 'Q':\r\n\t\tq += 1\r\n\t\tqaq += qa\r\n\telif c == 'A':\r\n\t\tqa += q\r\nprint(qaq)", "\r\ndef count(a,b):\r\n m,n=len(a),len(b)\r\n lookup=[[0]*(n+1) for _ in range(m+1)]\r\n for i in range(n+1):\r\n lookup[0][i]=0\r\n for i in range(m+1):\r\n lookup[i][0]=1\r\n for i in range(1,m+1):\r\n for j in range(1,n+1):\r\n if a[i-1]==b[j-1]:\r\n lookup[i][j]=lookup[i-1][j-1]+lookup[i-1][j]\r\n else:\r\n lookup[i][j]=lookup[i-1][j]\r\n return lookup[m][n]\r\n\r\ndef main():\r\n a=input()\r\n b=\"QAQ\"\r\n print(count(a,b))\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "s=input() \r\ne=0 \r\nfor i in range(len(s)):\r\n if s[i]=='A':\r\n e+=s[:i].count('Q')*s[i+1:].count('Q')\r\nprint(e)", "def solve():\n s = input()\n noOfQ, cummlative_q_for_all_given_As, ans = 0,0,0\n for char in s:\n if char == \"Q\":\n noOfQ+=1\n ans += cummlative_q_for_all_given_As\n if char == \"A\":\n cummlative_q_for_all_given_As += noOfQ\n print(ans)\n \n \n \n \ndef main():\n # t = int(input())\n t = 1\n for _ in range(t):\n solve()\n\n\n\nif __name__ == \"__main__\":\n main()\n", "seq = ''.join([i for i in input() if i in {'A', 'Q'}])\r\nlines = [0]\r\n\r\nfor i in seq[::-1]:\r\n lines += [lines[-1] + (i == \"Q\")]\r\n\r\nlines.reverse()\r\n\r\ncnt = 0\r\nfor i in range(len(seq)):\r\n for j in range(i + 1, len(seq)):\r\n if seq[i] + seq[j] == 'QA':\r\n cnt += lines[j]\r\n\r\nprint(cnt)\r\n", "x=input()\r\nc=0\r\nfor i in range(len(x)):\r\n for j in range(i+1,len(x)):\r\n for k in range(j+1,len(x)):\r\n if x[i]+x[j]+x[k]=='QAQ':\r\n c+=1\r\nprint(c)", "l = list(input())\r\ncount = 0\r\nd = []\r\nfor i in l:\r\n if i ==\"Q\" or i == \"A\":\r\n d.append(i)\r\ni = 0\r\nf = d.count(\"A\")\r\nl,r = 0,d.count(\"Q\")\r\nwhile f != 0:\r\n if d[i] == \"Q\":\r\n l += 1\r\n r -= 1\r\n elif d[i] == \"A\":\r\n count += l*r\r\n f -= 1\r\n i += 1\r\nprint(count)", "import math\n\nclass Solution:\n\n\tdef __init__(self):\n\t\tself.count = 0\n\n\tdef QAQ(self, S):\n\n\t\tx = 0\n\t\ty = 0\n\n\t\tfor char in S:\n\t\t\tif char == \"Q\":\n\t\t\t\tself.count += x\n\t\t\t\ty += 1\n\t\t\telif char == \"A\":\n\t\t\t\tx += y\n\n\ndef main():\n\tS = input()\n\n\tsol = Solution()\n\n\tsol.QAQ(S)\n\n\tprint(sol.count)\n\nif __name__ == '__main__':\n\n\tmain()", "\r\ninP = input().upper()\r\ninP = ''.join([i for i in inP if i == 'Q' or i =='A'])\r\n#print(inP)\r\n\r\nsum = 0\r\nfor i in range(len(inP)):\r\n if inP[i] == 'Q' :\r\n for j in range(i+1,len(inP)):\r\n if inP[j] == 'A':\r\n sum += inP[j+1:len(inP)].count('Q')\r\n\r\nprint(sum)", "import sys\r\nimport math\r\nfrom collections import defaultdict as ddict\r\nfrom collections import deque\r\nimport heapq\r\nfrom queue import Queue\r\n\r\nfast_inp = lambda: sys.stdin.readline().split('\\n')[0]\r\nread_list = lambda: fast_inp().split(' ')\r\nread_listi = lambda: list(map(int, fast_inp().split(' ')))\r\nread_listf = lambda: list(map(float, fast_inp().split(' ')))\r\nread_int = lambda: int(fast_inp())\r\nread_float = lambda: float(fast_inp())\r\nread = lambda: fast_inp()\r\nDEBUG = False\r\n\r\n\r\ndef debug(**kwargs):\r\n if not DEBUG:\r\n return\r\n print('*' * 20)\r\n for k, v in kwargs.items():\r\n print(f'\\t{k}:{v}\\t')\r\n print('*' * 20)\r\n\r\n\r\ndef solve() -> None:\r\n s = read()\r\n result = 0\r\n for i in range(len(s)):\r\n if s[i] != 'Q': continue\r\n for j in range(i + 1, len(s)):\r\n if s[j] != 'A': continue\r\n for k in range(j + 1, len(s)):\r\n if s[k] == 'Q':\r\n result += 1\r\n print(result)\r\n\r\nt = 1\r\nfor _ in range(t):\r\n solve()", "import sys\r\n\r\n\r\ndef solve(s):\r\n s_mod = ''\r\n for el in s:\r\n if el in 'QA':\r\n s_mod += el\r\n\r\n s = s_mod\r\n n = len(s)\r\n\r\n if n < 3:\r\n return 0\r\n\r\n count = 0\r\n\r\n for i in range(n-2):\r\n if s[i] == 'Q':\r\n for j in range(i+1, n-1):\r\n if s[j] == 'A':\r\n for k in range(j+1, n):\r\n if s[k] == 'Q':\r\n count += 1\r\n\r\n return count\r\n\r\n\r\nif 1 == 2:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nelse:\r\n input = sys.stdin.readline\r\n\r\ns = input()\r\nprint(solve(s))\r\n", "s = input()\r\nps1 = [0] * len(s)\r\nps2 = [0] * len(s)\r\nnq1 = 0\r\nnq2 = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n nq1 += 1\r\n if s[i] == 'A':\r\n ps1[i] = nq1\r\nfor i in range(len(s)-1, -1, -1):\r\n if s[i] == 'Q':\r\n nq2 += 1\r\n if s[i] == 'A':\r\n ps2[i] = nq2\r\nans = 0\r\nfor i in range(len(s)):\r\n if ps1[i] != 0 and ps2[i] != 0:\r\n ans += ps1[i] * ps2[i]\r\nprint(ans)", "n = input().strip()\n\ncount = 0\n\nnum_qs = [0] * len(n)\n\nfor i in range(len(n)):\n num_qs[i] = num_qs[i-1] + (1 if n[i] == 'Q' else 0)\n\nfor i in range(len(n)):\n if n[i] == 'A':\n left = num_qs[i]\n right = num_qs[-1] - num_qs[i]\n if left and right:\n count += num_qs[i] * (num_qs[-1] - num_qs[i])\n\n\"\"\"\nfor i in range(len(n)):\n if n[i] == 'Q':\n for j in range(i+1, len(n)):\n if n[j] == 'A':\n for k in range(j+1, len(n)):\n if n[k] == 'Q':\n count += 1\n\n\"\"\"\nprint(count)\n", "def solve(s1,s2,m,n,d):\r\n if(n==0):\r\n return 1\r\n if(m==0):\r\n return 0\r\n if((m,n) in d):\r\n return d[(m,n)]\r\n if(s1[m-1]==s2[n-1]):\r\n temp=solve(s1,s2,m-1,n-1,d)+solve(s1,s2,m-1,n,d)\r\n else:\r\n temp=solve(s1,s2,m-1,n,d)\r\n d[(m,n)]=temp \r\n return temp\r\ns1=input()\r\ns2='QAQ'\r\nd={}\r\nprint(solve(s1,s2,len(s1),3,d))", "string = input().strip(\" \")\r\ndef ON2solution(string):\r\n count = 0\r\n for i in range(len(string)):\r\n if string[i]==\"A\":\r\n num_Q_before = 0\r\n num_Q_after = 0\r\n for j in range(i):\r\n if string[j]==\"Q\":\r\n num_Q_before = num_Q_before + 1\r\n for k in range(i+1,len(string)):\r\n if string[k]==\"Q\":\r\n num_Q_after = num_Q_after + 1\r\n count = count + num_Q_after*num_Q_before\r\n return count\r\nprint(ON2solution(string))", "s = input()\r\nt = ''\r\nfor x in s:\r\n if x == 'Q' or x == 'A':\r\n t += x\r\nresult = 0\r\nfor i in range(len(t)):\r\n if t[i] == 'Q':\r\n for j in range(i+1, len(t)):\r\n if t[j] == 'A':\r\n result += t[j+1:].count('Q')\r\nprint(result)\r\n", "#QAQ\r\n\r\n\r\nDiamond_String = input()\r\n\r\nResult = 0\r\nx = 0\r\ny = 0\r\n\r\nfor value in Diamond_String:\r\n\r\n\tif value == \"Q\":\r\n\r\n\t\tResult+=x\r\n\t\ty+=1\r\n\telif value == \"A\":\r\n\r\n\t\tx+=y\r\n\r\nprint(Result)\r\n\r\n\r\n# word = \"\"\r\n# gate = False\r\n# Result = 0 \t\r\n# for value in Diamond_String:\r\n\r\n# \tif value == \"Q\":\r\n# \t\tword+=value\r\n# \t\tgate = True\r\n\r\n# \telif value == \"A\" and gate == True:\r\n# \t\tword += value\r\n\r\n# print(word)\r\n\r\n# count = 1\r\n# countList = []\r\n# for num in range(len(word)):\r\n\r\n# \tif num == len(word) - 1:\r\n# \t\tif word[num] == \"Q\":\r\n# \t\t\tcountList.append(count)\r\n\t\t\r\n# \t\tbreak\r\n# \tif word[num] != word[num+1]:\r\n# \t\tcountList.append(count)\r\n# \t\tcount = 1\r\n# \telse:\r\n# \t\tcount+=1\r\n\r\n# print(countList)\r\n\r\n# for num in range(0,len(countList)-1,2):\r\n# \tvalue = countList[num] * countList[num+1]\r\n# \tvalue = value * countList[num+2]\r\n# \tResult +=value\r\n# # for num in range(0,len(countList), 2):\r\n\r\n# # \tfor num1 in range(num+2,len(countList),2):\r\n\r\n# # \t\tvalue = countList[num] * countList[num+1]\r\n# # \t\tvalue = value * countList[num1]\r\n# # \t\tResult += value\r\n\r\n# \t\t# print(num,num1)\r\n# # for num in range(0,len(countList),2):\r\n\r\n# # \tfor num1 in range(num+3,len(countList),2):\r\n# # \t\tvalue = countList[num] * countList[num1]\r\n# # \t\tvalue = value * countList[num1+1]\r\n# # \t\tResult+=value\r\n\r\n\r\n# if len(countList) > 3:\r\n# \tResult *=3\r\n\r\n# print(Result)", "str = input()\ns = 0\nfor t in range(len(str)):\n if str[t] == 'A':\n s1 = 0\n s2 = 0\n for j in range(t):\n if str[j] == 'Q':\n s1 += 1\n for j in range(t+1, len(str)):\n if str[j] == 'Q':\n s2 += 1\n s += s1 * s2\n\nprint(s)\n\n\t\t \t\t \t \t \t\t \t\t\t \t \t \t", "a = input()\r\nn = len(a)\r\nb = [1 if a[0] == 'Q' else 0]\r\nans = 0\r\nfor i in range(1,n):\r\n b.append(b[-1] + (a[i] == 'Q'))\r\nfor i in range(1,n-1):\r\n c = a[i]\r\n if c == 'A':\r\n ans += b[i]*(b[n-1]-b[i])\r\nprint(ans)", "s=list(input())\nn=len(s)\nq=0\na=0\nfor i in range(n):\n if s[i]=='Q':\n q+=1\n\npre=0\npost=q\nans=0\nfor i in range(n):\n if s[i]=='Q':\n pre+=1\n post-=1\n if s[i]=='A':\n ans+=pre*post\nprint(ans)", "S = list(input().strip())\r\n\r\nans = 0\r\n\r\npref = [0]\r\n\r\nfor i in range(len(S)):\r\n if S[i] == 'Q':\r\n pref += [pref[-1] + 1]\r\n else:\r\n pref += [pref[-1]]\r\n\r\nfor i, s in enumerate(S):\r\n if s == 'A':\r\n ans += pref[i] * (pref[len(S)] - pref[i + 1])\r\n\r\nprint(ans)", "def myFunction(text:str):\r\n filteredText = \"\"\r\n cont = 0\r\n for char in text:\r\n if char in \"QA\":\r\n filteredText += char\r\n \r\n #brute force\r\n for i in range(len(filteredText)-2): #Q\r\n if filteredText[i] == \"Q\":\r\n for j in range(i+1, len(filteredText)-1): #A\r\n if filteredText[j] == \"A\":\r\n for k in range(j+1, len(filteredText)): #Q\r\n if filteredText[k] == \"Q\":\r\n cont += 1\r\n print(cont)\r\n\r\nmyFunction(input())", "t = list(input())\nc = 0\nfor i in range(len(t)):\n for j in range(i+1,len(t)):\n for k in range(j+1,len(t)):\n if t[i] == 'Q' and t[j] == 'A' and t[k] == 'Q':\n c+=1\n else:\n pass\nprint(c)\n", "\r\nx=input()\r\nc=0\r\nfor i in range(len(x)):\r\n for j in range(i+1,len(x)):\r\n for k in range(j+1,len(x)):\r\n if x[i]=='Q' and x[j]=='A' and x[k]=='Q' :\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n", "s = input()\r\nn = len(s)\r\ni = 0\r\ncount = 0\r\nwhile i < n:\r\n if s[i] == 'Q':\r\n j = i + 1\r\n while j < n:\r\n if s[j] == 'A':\r\n k = j + 1\r\n while k < n:\r\n if s[k] == 'Q':\r\n count = count + 1\r\n k = k + 1\r\n j = j + 1\r\n i = i + 1\r\nprint(count)", "from itertools import combinations\r\na=input();p=0\r\nfor i in combinations(a,3):\r\n if i[0]=='Q' and i[1]=='A' and i[2]=='Q':p+=1\r\nprint(p)", "a = input()\r\nn = len(a)\r\nans = 0\r\nfor i in range(n-1):\r\n\tif a[i]==\"Q\":\r\n\t\tfor j in range(i+1,n-1):\r\n\t\t\tif a[j]==\"A\":\r\n\t\t\t\tfor k in range(j+1,n):\r\n\t\t\t\t\tif a[k]==\"Q\":\r\n\t\t\t\t\t\tans+=1\r\nprint(ans)", "s = input()\r\nn = len(s);Q1=Q2=count=0\r\n\r\nfor i in range(n):\r\n\tif s[i]==\"A\":\r\n\t\tfor j in range(0,i):\r\n\t\t\tif s[j]==\"Q\":\r\n\t\t\t\tQ1+=1\r\n\t\tfor k in range(i+1,n):\r\n\t\t\tif s[k]==\"Q\":\r\n\t\t\t\tQ2+=1\r\n\tcount+=(Q1*Q2)\r\n\tQ1=Q2=0\r\nprint(count)", "s = input()\nq = [0 for i in range(len(s))]\na = [0 for i in range(len(s))]\nind = 0\nr = 0\nfor i in range(len(s)):\n\tif s[i] == \"Q\":\n\t\tfor j in range(ind+1):\n\t\t\tr += q[j] * a[j]\n\t\tif a[ind] == 0:\n\t\t\tq[ind] += 1\n\t\telse:\n\t\t\tind += 1\n\t\t\tq[ind] += 1\n\telif s[i] == \"A\":\n\t\tif ind > 0 or q[0] > 0:\n\t\t\tfor j in range(ind+1):\n\t\t\t\ta[j] += 1\nprint(r)", "# a, b, c, x, k = map(int, input().split())\n# max = x // k\n#\n# for newmax in reversed(range(max + 1)):\n# if newmax < a:\n# print(a - 1)\n# break\n# percent = k * newmax * c / 100\n# newx = x - percent\n# try:\n# if newx // newmax == 5.0:\n# print(newmax)\n# break\n# except ZeroDivisionError:\n# print(0)\n# break\n#\n#\n# a, b, c, x, k = map(int, input().split())\n# max = x // k\n#\n# if max < a or max > b:\n# output1 = output = max\n# else:\n# c = c / 100 + 1\n# output = x // (c * k)\n# output1 = a - 1\n# print(max(output, output1))\n\n# k = int(input())\n\nimport functools as ft\nimport itertools as it\nimport pickletools as pt\n\n# data = [1, 1, 2]\n# it.combinations('ABCD', 2)\n# it.combinations_with_replacement('ABCD', 2)\n# def answ2(n):\n# f0 = 1\n# f1 = 1\n# f2 = 2\n# for i in range(n):\n# f3 = f0 + f1 + f2\n# f0 = f1\n# f1 = f2\n# f2 = f3\n# return f0\n\n# l = [1, 2, 4]\n#\n#\n# def answ(n):\n# if n == 0:\n# return 1\n# else:\n# for i in range(4, n + 1):\n# i -= 1\n# l.append(l[i - 1] + l[i - 2] + l[i - 3])\n# return l[n - 1]\n#\n#\n# print(answ(int(input())))\n\n# Последовательность без трех единиц\n# def answ(n):\n# c0 = 1\n# c1 = 1\n# c11 = 0\n# if n == 0:\n# return 1\n# else:\n# for i in range(1, n):\n# cc = c0\n# c0 = c0 + c1 + c11\n# cd = c1\n# c1 = cc + c1\n# c11 = cd\n# c1 -= c11\n# return c0 + c1 + c11\n\n\n# n, m = map(int, input().split())\n#\n# a = []\n# for i in range(n):\n# a.append(list(input()))\n# print(a)\n#\n# for i in range(n):\n# for j in range(m):\n# if a[i][j] != 0:\n# a[i][j] = min(int(a[i - 1][j - 1]), int(a[i][j - 1]), int(a[i - 1][j])) + 1\n# print(a)\n\n\n\na = input()\nv, b, c = 0, 0, 0\nfor i in range(len(a)):\n if a[i] == 'Q':\n c += b\n v += 1\n\n if a[i] == 'A':\n b += v\nprint(c)\n\n\n# mstr = input()\n# for i in range(len(mstr)):\n# if mstr[i] == \"Q\":\n\n\n\n\n# n = int(input())\n# h = list(map(int, input().split()))\n# k = [0, abs(h[0] - h[1])]\n# for i in range(2, n):\n# a1 = k[i - 1] + abs(h[i - 1] - h[i])\n# a2 = k[i - 2] + abs(h[i - 2] - h[i])\n# if a1 < a2:\n# k.append(a1)\n# else:\n# k.append(a2)\n# print(k[n - 1])\n# print(k)\n#\n# answ = []\n# for i in range(len(k)):\n# try:\n# answ.append(k[i] + k[i + 1])\n# except IndexError:\n# pass\n# print(answ)\n\n\n\n\n# n = int(input())\n# l = []\n# for i in range(n):\n# l.append(list(map(int, input().split())))\n\n# ch = 0\n# for i in l:\n# maxi1 = max(i)\n# i.remove(maxi1)\n# maxi2 = max(i)\n#\n# if ch == 0:\n# ch += 1\n# break\n# else:\n# tmp1 = maxi1\n# tmp2 = maxi2\n# maxi1 = max(i)\n# i.remove(maxi1)\n# maxi2 = max(i)\n\n# answ = 0\n# ch = 0\n# for i in l:\n# if ch == 0:\n# answ += max(i)\n# # print(1, answ)\n# ind = i.index(answ)\n# # print(\"ind\", ind)\n# else:\n# maxi = max(i)\n# # print(\"maxi\", maxi)\n# tmp = ind\n# ind = i.index(maxi)\n# # print(\"ind\", ind)\n# if tmp == ind:\n# i.remove(maxi)\n# maxi = max(i)\n# ind = i.index(maxi)\n# answ += maxi\n# # print(2, answ)\n# else:\n# maxi = max(i)\n# ind = i.index(maxi)\n# answ += maxi\n# # print(3, answ)\n# ch += 1\n# print(answ)\n\n\n# n = int(input())\n# k = int(input())\n# d = [1, k - 1]\n#\n#\n# for i in range(2, n + 1):\n# d.append((d[i - 1] + d[i - 2]) * (k - 1))\n#\n# print(d[-1])\n", "s = input()\r\n\r\nans = 0\r\n\r\nfor i in s:\r\n if(i != 'Q' and i != 'A'):\r\n s = s.replace(i, \"\")\r\n\r\nans = 0\r\nfor i in range(len(s)):\r\n for k in range(i+1, len(s)):\r\n for j in range(k+1, len(s)):\r\n if(s[i] == 'Q' and s[k] == 'A' and s[j] == 'Q'):\r\n ans += 1\r\nprint(ans)", "import sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\r\nMOD = int(1e9 + 7)\r\nINF = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\ns=input()\r\n\r\nn=len(s)\r\n\r\nleft=[]\r\ncnt=0\r\nfor i in range(n):\r\n if s[i]==\"Q\":\r\n cnt+=1\r\n left.append(cnt)\r\nright=[]\r\ncnt=0\r\nfor i in range(n-1,-1,-1):\r\n if s[i]==\"Q\":\r\n cnt+=1\r\n right.append(cnt)\r\nright=right[::-1]\r\nres=0\r\nfor i in range(n):\r\n if s[i]==\"A\":\r\n res+=left[i]*right[i]\r\nprint(res)", "s = input()\r\ncnt = 0\r\nfor i in range(1,len(s)-1):\r\n if s[i] == 'A':\r\n a = s[0:i]\r\n b = s[i+1:len(s)]\r\n cnt += a.count('Q')*b.count('Q')\r\nprint(cnt)\r\n \r\n ", "s = list(str(input()))\r\nk = [i for i in s if i == 'Q' or i == 'A']\r\nr = 0\r\nfor i in range(len(k)-1):\r\n if k[i] == 'A':\r\n r += k[0:i].count('Q')*k[i+1:len(k)].count('Q')\r\nprint(r)\r\n", "n = input()\r\nc = 0\r\nfor i in range(len(n)):\r\n if n[i] == 'Q':\r\n for j in range(i+1,len(n)):\r\n if n[j] == 'A':\r\n for t in range(j+1,len(n)):\r\n if n[t] == 'Q':\r\n c += 1\r\nprint(c)\r\n", "m = input()\r\na = \"\"\r\nfor i in m:\r\n if i == \"Q\" or i == \"A\":\r\n a+=i\r\ns = 0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n for k in range(j+1,len(a)):\r\n if i != j and j!=k and k!=i:\r\n if a[i] == \"Q\" and a[j] == \"A\" and a[k] == \"Q\":s+=1\r\nprint(s)", "def main():\r\n s = input()\r\n res = 0\r\n for i in range(len(s)):\r\n if s[i] == \"Q\":\r\n for j in range(i, len(s)):\r\n if s[j] == \"A\":\r\n for k in range(j, len(s)):\r\n if s[k] == \"Q\":\r\n res += 1\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def count(left, right, arr):\r\n counter = 0\r\n for i in arr[left:right]:\r\n if i == 'Q':\r\n counter+=1\r\n return counter\r\n\r\ns = input()\r\npositions = []\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n positions.append(i)\r\nresult = 0\r\nfor i in range(len(positions)):\r\n result += count(0, positions[i], s)*count(positions[i], len(s), s)\r\nprint(result)\r\n \r\n", "s=input()\r\nl=len(s)\r\nans=0\r\nal=s.count('Q')\r\nc=0\r\nfor i in range(l):\r\n if s[i]=='Q' :\r\n c+=1\r\n elif s[i]=='A' :\r\n ans+=c*(al-c)\r\nprint(ans)", "def d(s, stage=0):\n if stage == 0:\n return d(s, 1)\n elif stage == 1:\n return sum([d(s[i + 1::], 2) for i in range(len(s)) if s[i] == 'Q'])\n elif stage == 2:\n return sum([d(s[i + 1::], 3) for i in range(len(s)) if s[i] == 'A'])\n elif stage == 3:\n return s.count('Q')\n\n\na = ''.join([i for i in input() if i in ('Q', 'A')])\nprint(d(a))", "from typing import List, Tuple\nfrom collections import defaultdict, deque, namedtuple\nfrom heapq import heappush as push, heappop as pop\nimport sys \n\nINF = (int)(1e9+7)\n\nsys.setrecursionlimit(INF)\n\n\ndef su(s):\n\n\tn = len(s)\n\tcnt = 0\n\tfor i in range(0, n-2):\n\t\tfor j in range(i+1, n-1):\n\t\t\tfor k in range(j+1, n):\n\n\t\t\t\tif s[i] == \"Q\" and s[j] == \"A\" and s[k] == \"Q\":\n\t\t\t\t\tcnt += 1\n\n\treturn cnt \n\n\n\nif __name__ == \"__main__\":\n\n\ts = input()\n\tprint(su(s))\n", "s = input()\r\nres = sum(s[:i].count('Q') * s[i:].count('Q') for i in range(len(s)) if s[i]=='A')\r\nprint(res)", "string=input()\r\ndp=[0 for _ in range(len(string))]\r\nans=0\r\nfor i in range(len(string)):\r\n for j in range(i):\r\n if string[i]==\"Q\" and string[j]==\"A\":\r\n dp[i]+=dp[j]\r\n elif string[i]==\"A\" and string[j]==\"Q\":\r\n dp[i]+=1\r\n if string[i]==\"Q\":\r\n ans+=dp[i]\r\nprint(ans)", "from sys import stdin\t\r\nfrom typing import List\r\n\r\n\r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ns = input()\r\n\r\nn = len(s)\r\n\r\nif n < 4:\r\n print(0)\r\nelse:\r\n \r\n c = 0\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if s[i]+s[j]+s[k] == 'QAQ':\r\n c += 1\r\n \r\n print(c)\r\n\r\n ", "word = input()\nans = 0\nfor i in range(len(word)):\n for j in range(i + 1, len(word)):\n for k in range(j + 1, len(word)):\n if word[i] == 'Q' and word[j] == 'A' and word[k] == 'Q':\n ans = ans + 1\nprint(ans)", "st = input()\n\nctd = 0\nfor x in range(len(st)):\n if st[x] == 'Q':\n for y in range(x+1,len(st)):\n if st[y] == 'A':\n for z in range(y+1,len(st)):\n if st[z] == 'Q':\n ctd += 1\nprint(ctd)\n \t \t \t\t\t\t \t\t\t \t \t\t\t\t\t\t \t", "S=input()\r\nN=0\r\nfor i in range(len(S)-2):\r\n for j in range(i+1,len(S)-1):\r\n for k in range(j+1,len(S)):\r\n if S[i]+S[j]+S[k]=='QAQ':\r\n N+=1\r\nprint(N)", "s = input()\r\n\r\nn = len(s)\r\nctr_q = 0\r\narr_a = []\r\nfor i in range(n):\r\n\tif s[i] == 'Q':\r\n\t\tctr_q += 1\r\n\telif s[i] == 'A':\r\n\t\tarr_a.append(ctr_q)\r\n\t\t\r\n#print(ctr_q, arr_a)\r\n#QAQAQYSYIOIWIN\r\n#3 [1, 2]\r\n# 1*(3-1) + 2*(3-2) = 4\r\n\r\ns = 0\r\nfor x in arr_a:\r\n\ts += x*(ctr_q-x)\r\nprint(s)", "import sys; from functools import lru_cache\r\nimport re; regex = re.compile('[^AQ]')\r\n\r\n\r\ninp = regex.sub(\"\", sys.stdin.readline())\r\n\r\n\r\n@lru_cache(maxsize=None)\r\ndef dp(l, score):\r\n if score == 3: return 1\r\n if len(l) == 0: return 0 \r\n \r\n for s, c in [(0, \"Q\"), (1, \"A\"), (2, \"Q\")]:\r\n if score == s and l[0] == c:\r\n return dp(l[1:], score + 1) + dp(l[1:], score)\r\n return dp(l[1:], score)\r\n\r\nprint(dp(inp, 0))", "import sys \n\n\ndef check_str(inp_str: str):\n #Массив под количество Q до А\n mass_a = []\n #Счетчики\n cnt_q = 0\n ans = 0\n #Обход всех символов\n for chr in inp_str:\n if chr == 'Q':\n cnt_q += 1\n if chr == 'A':\n mass_a.append(cnt_q)\n\n #Суммирование итогового результата\n for cnt in mass_a:\n ans += cnt * (cnt_q - cnt)\n \n return ans\n\n\nif __name__ == '__main__':\n #Получение количества входных примеров \n s = sys.stdin.readline().strip()\n print(check_str(inp_str = s))\n\n\n\t \t \t \t \t \t \t \t \t \t", "s = input()\r\na = 0\r\nn = len(s)\r\nfor i in range(n):\r\n if s[i] == \"A\":\r\n a += s[:i].count(\"Q\") * s[i:].count(\"Q\")\r\nprint(a)\r\n", "s = input()\r\nn = len(s)\r\nprefix = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if s[i] == \"Q\" and s[j] == \"A\" and s[k] == \"Q\":\r\n prefix += 1 \r\nprint(prefix)\r\n", "t = input()\r\n\r\ns = [0]*len(t)\r\npoint = 0\r\nsol = 0\r\nfor i in range(len(t)):\r\n if t[i] == 'Q':\r\n point+=1\r\n if t[i] == 'A':\r\n s[i]=point\r\nfor i in range(len(t)):\r\n sol+=s[i]*(point-s[i])\r\nprint(sol)", "def single():return input()\r\ndef multiple():return list(map(int, input().split()))\r\ns=single()\r\nword=\"QAQ\"\r\ncol=len(s)\r\ndp=[[0 for j in range(col+1)] for i in range(3)]\r\nfor i in range(1, col+1):\r\n if word[0]==s[i-1]:\r\n dp[0][i]=dp[0][i-1]+1\r\n else:\r\n dp[0][i]=dp[0][i-1]\r\nfor i in range(1,3):\r\n for j in range(i+1, col+1):\r\n if word[i]==s[j-1]:\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]\r\n else:\r\n dp[i][j]=dp[i][j-1]\r\n# for i in dp:\r\n# print(i)\r\nprint(dp[-1][-1])", "s=input()\r\ncnt=0\r\nx,y=0,0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n cnt+=x \r\n y+=1 \r\n elif s[i]=='A':\r\n x+=y \r\nprint(cnt)\r\n", "s=input()\r\nn=len(s)-1\r\nans=0\r\nfor i in range(n+1):\r\n\tfor j in range(i+1,n+1):\r\n\t\tfor k in range(j+1,n+1):\r\n\t\t\tif(s[i]=='Q'and s[j]=='A' and s[k]=='Q'):\r\n\t\t\t\tans+=1\r\nprint(ans)", "def dp(string, smile, index):\r\n # if smile == \"QAQ\":\r\n # return 1\r\n if not len(string):\r\n return 0\r\n\r\n temp = []\r\n\r\n if smile == \"Q\":\r\n for i in range(index, len(string)):\r\n if string[i][0] == \"A\":\r\n temp.append(dp(string, \"QA\", string[i][1]))\r\n elif smile == \"QA\":\r\n for i in range(index, len(string)):\r\n if string[i][0] == \"Q\":\r\n temp.append(1)\r\n\r\n return sum(temp)\r\n\r\n\r\ns = input()\r\na = \"\"\r\nfor i in s:\r\n if i in [\"Q\", \"A\"]:\r\n a += i\r\n\r\nb = [[x, i] for i, x in enumerate(a)]\r\n\r\nans = []\r\n\r\nfor s in b:\r\n if s[0] == \"Q\":\r\n ans.append(dp(b, \"Q\", s[1]))\r\n\r\nprint(sum(ans))", "s=input()\r\nl=len(s)\r\ncount=0\r\n\r\n\r\nfor i in range(l):\r\n\tif(s[i]=='Q'):\r\n\t\tfor j in range(i+1,l):\r\n\t\t\tif(s[j]=='A'):\r\n\t\t\t\tfor k in range(j+1,l):\r\n\t\t\t\t\tif(s[k]=='Q'):\r\n\t\t\t\t\t\tcount+=1\r\n\r\n\r\nprint(count)", "s = input()\r\nsum = 0\r\nfor i in s:\r\n if i != 'Q' and i != 'A':\r\n s = s.replace(i, '')\r\nwhile s.find('A') != - 1:\r\n sum += s[:s.find('A')].count('Q') * s[s.find('A'):len(s)].count('Q')\r\n s = s.replace('A', '', 1)\r\nprint(sum)", "s = input()\r\nn = len(s)\r\n\r\n\r\nq_suffix = [0] * (n + 2)\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if s[i] == \"Q\":\r\n q_suffix[i] = q_suffix[i + 1] + 1\r\n else:\r\n q_suffix[i] = q_suffix[i + 1]\r\n\r\n\r\naq_suffix = [0] * (n + 1)\r\n\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if s[i] == \"A\":\r\n aq_suffix[i] = aq_suffix[i + 1] + q_suffix[i + 1]\r\n else:\r\n aq_suffix[i] = aq_suffix[i + 1]\r\n\r\n\r\nres = 0\r\nfor i in range(n):\r\n if s[i] == \"Q\":\r\n res += aq_suffix[i + 1]\r\nprint(res)\r\n\r\n\r\n\r\n", "s=input()\r\nn=len(s)\r\na=0\r\nfor x in range(n):\r\n for y in range(x+1,n):\r\n for z in range(y+1,n):\r\n if s[x]=='Q' and s[y]=='A' and s[z]=='Q':\r\n a+=1\r\nprint(a)", "s=input()\r\nc=0\r\nn=len(s)\r\nfor i in range(n-2):\r\n if s[i]=='Q':\r\n for j in range(i+1,n-1):\r\n if s[j]=='A':\r\n lal = s[j+1:].count('Q')\r\n c+=lal\r\nprint(c)", "def decode():\r\n s = input().strip()\r\n cnt = 0\r\n n = len(s)\r\n for i in range(n):\r\n if s[i] != 'Q':\r\n continue\r\n for j in range(i + 1, n):\r\n if s[j] != 'A':\r\n continue\r\n for k in range(j + 1, n):\r\n if s[k] == 'Q':\r\n cnt += 1\r\n print(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n decode()\r\n", "qaq = input()\nlen = len(qaq)\nans = 0 \nfor i in range(len):\n if qaq[i] == 'Q':\n for j in range(len - i):\n if qaq[j + i] == 'A':\n for t in range(len - i - j):\n if qaq[t + i + j] == 'Q':\n ans += 1\nprint(ans)\n\t\t\t\t\t \t\t\t \t \t \t\t\t\t \t\t\t \t\t\t", "s = input()\nn = len(s)\n\nans = 0\nfor i in range(n - 2):\n if s[i] == 'Q':\n for j in range(i + 1, n - 1):\n if s[j] == 'A':\n for k in range(j + 1, n):\n if s[k] == 'Q':\n ans += 1\nprint(ans)\n", "s = input()\r\na=b=c=0\r\nfor i in s:\r\n if i=='A': a += b\r\n elif i=='Q':\r\n b += 1\r\n c += a\r\nprint(c)", "s=input()\r\np=\"QAQ\"\r\nc=0\r\nn=len(s)\r\n# dp=[0]*(len(s)+1)\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if(s[i]+s[j]+s[k]==p):\r\n c+=1\r\nprint(c)", "S = input()\r\nn = len(S)\r\n# print(S)\r\nif n <= 2:\r\n print(0)\r\nelse:\r\n count = 0\r\n for i in range(n):\r\n if S[i] == \"Q\":\r\n for j in range(i+1,n):\r\n if S[j] == \"A\":\r\n for k in range(j+1,n):\r\n if S[k] == \"Q\":\r\n count += 1\r\n print(count)\r\n", "n=input()\r\ns=0\r\na=len(n)\r\nfor i in range(a):\r\n if n[i]==\"A\":\r\n s=s+n[:i].count(\"Q\")*n[i:].count(\"Q\")\r\nprint(s)", "import re\r\nstr1=input()\r\nsum1=0\r\nc=[x.start() for x in re.finditer('A',str1)]\r\nfor i in c:\r\n d=str1[0:i]\r\n e=str1[i+1:]\r\n sum1+=(d.count('Q')*e.count('Q'))\r\nprint(sum1)", "s = input()\r\nn = len(s)\r\ncnt = 0\r\nfor i in range(n-2):\r\n if s[i]=='Q':\r\n for j in range(i+1, n-1):\r\n if s[j]=='A':\r\n cnt += s[j+1:].count('Q')\r\nprint(cnt)\r\n", "a=input()\r\nn=len(a)\r\ncount=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if(a[i]=='Q' and a[j]=='A' and a[k]=='Q'):\r\n count+=1\r\nprint(count)\r\n", "s=input()\r\nt=\"QAQ\"\r\nm=len(s)\r\nn=len(t)\r\ndp=[[1 for i in range(m+1)]for j in range(n+1)]\r\nfor i in range(1,n):\r\n dp[i][0]=0\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if t[i-1]==s[j-1]:\r\n dp[i][j]=dp[i-1][j-1]+dp[i][j-1]\r\n else:\r\n dp[i][j]=dp[i][j-1]\r\nprint(dp[-1][-1]-1)", "s = input()\r\np = 0\r\n\r\nfor i in range(len(s)):\r\n c = 0\r\n c1 = 0\r\n if s[i] == 'A':\r\n \r\n for w in range(i):\r\n if s[w] == 'Q':\r\n c+=1\r\n\r\n for w in range(i,len(s)):\r\n if s[w] == 'Q':\r\n c1+=1\r\n p = p+(c1*c) \r\nprint(p)\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "s = input()\r\nres = x = y = 0\r\n\r\nfor c in s:\r\n if c == 'Q':\r\n res += x\r\n y += 1\r\n elif c == 'A':\r\n x += y\r\n\r\nprint(res)\r\n", "def solve(s):\n cnt = s.count('Q')\n ans = 0\n temp = 0\n for i in s:\n if i=='Q':\n temp+=1\n elif i=='A':\n ans+=(temp*(cnt-temp))\n return ans\n\nif __name__ == \"__main__\":\n s = input()\n print(solve(s))\n\t \t\t\t \t \t \t\t\t\t \t\t\t\t\t \t\t\t \t", "word = input()\r\nn = len(word)\r\nprev_q = 0\r\nq_count = 0\r\na_count = 0\r\ntable = [0] * n\r\n\r\nfor i in range(n):\r\n if word[i] == \"Q\":\r\n table[i] = prev_q + q_count * a_count\r\n prev_q = table[i]\r\n q_count += 1\r\n a_count = 0\r\n elif word[i] == \"A\":\r\n a_count += 1\r\n\r\nprint(sum(table))", "string = input()\r\n\r\ntotal = 0\r\nfor i in range(len(string)):\r\n if string[i] == \"A\":\r\n total += string[:i].count('Q') * string[i:].count('Q') \r\nprint(total) \r\n \r\n ", "s = input()\r\nstart = 0\r\nend = s.count('Q')\r\nans = 0\r\nfor x in s:\r\n if x == 'Q':\r\n start += 1\r\n end -= 1\r\n if x == 'A':\r\n ans += start * end\r\nprint(ans)", "s = input()\nn = len(s)\ncount = 0\ncount_q_l = s.count('Q')\ncount_q_r = 0\nfor i in range(n):\n if s[i] == 'Q':\n count_q_l -= 1\n count_q_r += 1\n if s[i] == 'A':\n count += count_q_l * count_q_r\nprint(count)\n\n\n\n\t\t\t\t\t\t\t \t\t \t \t\t\t \t \t \t \t", "\r\nn=input()\r\na=n.count('Q')\r\nb=0\r\nc=0\r\nfor i in range(len(n)):\r\n if n[i]=='A':\r\n c=c+(b*(a-b))\r\n if n[i]=='Q':\r\n b=b+1\r\nprint(c)\r\n\r\n\r\n\r\n", "x=input()\r\ns=sun=s1=asun=0\r\nsun=0\r\nfor i in range(len(x)):\r\n if x[i]=='Q':\r\n s+=1\r\nfor i in range(len(x)):\r\n if x[i]=='Q':\r\n s1+=1\r\n if x[i]=='A':\r\n asun+=1\r\n sun+=s1*(s-s1)\r\nprint(sun)", "inp=input()\r\nans=0\r\nfor i in range(len(inp)-2):\r\n\tfor j in range(i+1,len(inp)-1):\r\n\t\tfor k in range(j+1,len(inp)):\r\n\t\t\tif inp[i]=='Q' and inp[j]=='A' and inp[k]=='Q':\r\n\t\t\t\tans+=1\r\nprint(ans)", "result=0\r\ncase=input()\r\ncaseLst=list(case)\r\nlength=len(caseLst)\r\nfor i in range(0,length):\r\n\tq=caseLst[i]\r\n\tif q==\"Q\":\r\n\t\tfor k in range(i+1,length):\r\n\t\t\ta=caseLst[k]\r\n\t\t\tif a==\"A\":\r\n\t\t\t\tfor s in range(k+1,length):\r\n\t\t\t\t\tif caseLst[s]==\"Q\":\r\n\t\t\t\t\t\tresult+=1\r\nprint(result)", "linea = input()\r\ncantidad_Q = 0\r\ncapacidad_de_suma = 0\r\ncuenta = 0\r\nfor i in linea:\r\n if i == 'Q':\r\n cuenta += capacidad_de_suma\r\n cantidad_Q += 1\r\n elif i == 'A':\r\n capacidad_de_suma += cantidad_Q\r\nprint(cuenta)", "s=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n s1=s[(i+1):]\r\n for j in range(len(s1)):\r\n if s1[j]=='A':\r\n s2=s1[(j+1):]\r\n ans=ans+s2.count('Q')\r\nprint(ans)", "s=input()\r\nq=0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n q=q+1\r\nc=0\r\na=0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n c=c+1\r\n elif s[i]=='A':\r\n a=a+c*(q-c)\r\nprint(a)", "def search(index ,arr):\r\n x = 0\r\n y = 0\r\n for i in range(index):\r\n if arr[i] == \"Q\":\r\n x += 1\r\n for i in range(index , len(arr)):\r\n if arr[i] == \"Q\":\r\n y+= 1\r\n return x, y\r\n\r\n\r\n\r\nin_str = input()\r\nA_indexes = []\r\nQAQ_list = []\r\ncount = 0\r\nfor i in range(len(in_str)):\r\n if (in_str[i]== \"A\"):\r\n A_indexes.append(i)\r\ncount = 0\r\nfor i in A_indexes:\r\n x , y = search(i, in_str)\r\n count += x*y\r\n\r\nprint(count)", "t = input()\r\n\r\nli = list()\r\na = 0\r\nq = 0\r\nfor i in t:\r\n if i == 'Q':\r\n li.append(i)\r\n q += 1\r\n elif i == 'A':\r\n li.append(i)\r\n a += 1\r\n\r\nlast_as = 0\r\nsubseqs = 0\r\nidx = 0\r\nfor i in li:\r\n if i == 'A':\r\n last_qs = idx-last_as\r\n remaining_qs = q-last_qs\r\n last_as += 1\r\n subseqs += last_qs*remaining_qs\r\n idx += 1\r\nprint(subseqs)\r\n", "s = input()\r\nstop = 0\r\ncountq = 0\r\ndp = [0]*len(s)\r\ndp[0] = 0\r\nif (s[0]==\"Q\"):\r\n countq = 1\r\ni = 1\r\nwhile i < len(s):\r\n if (s[i] =='Q'):\r\n dp[i] = dp[i-1]+stop\r\n countq+=1\r\n elif(s[i]=='A'):\r\n dp[i] = dp[i-1]\r\n stop += countq\r\n elif((s[i]!='A')and(s[i]!='Q')):\r\n dp[i] = dp[i-1]\r\n i+=1\r\nprint(dp[len(s)-1])\r\n", "n = input()\r\ncount = 0\r\nln = len(n)\r\nfor i in range(ln):\r\n for j in range((i+1),ln):\r\n if n[i]=='Q' and n[j]=='Q':\r\n count += n[(i+1):j].count('A')\r\nprint(count)\r\n", "def count(a,b,m,n):\r\n\tdp = [[0] * (n+1) for i in range (m+1)]\r\n\tfor i in range (m+1):\r\n\t\tdp[i][0] = 1\r\n\tfor i in range (1,m+1):\r\n\t\tfor j in range (1,n+1):\r\n\t\t\tif a[i-1] == b[j-1]:\r\n\t\t\t\tdp[i][j] = dp[i-1][j-1] + dp[i-1][j]\r\n\t\t\telse:\r\n\t\t\t\tdp[i][j] = dp[i-1][j]\r\n\treturn dp[m][n]\r\nif __name__ == '__main__':\r\n\ts = input()\r\n\tq = 'QAQ'\r\n\tprint(count(s,q,len(s),3))", "pQ = [0]\na = input()\nt = 0\nfor i in a:\n \n if i == 'Q':\n t += 1\n pQ += [t]\nnat = 0\nfor i in range(len(a)):\n now = a[i]\n if now == 'A':\n nat += pQ[i] * (t - pQ[i])\nprint(nat)\n", "from itertools import *\r\nprint(sum(1 for a in combinations(input(),3) if ''.join(a)=='QAQ'))", "a = input()\r\nc = 0\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n for k in range(len(a)):\r\n if i<j and j<k and a[i]==\"Q\" and a[j]==\"A\" and a[k]==\"Q\":\r\n c+=1\r\nprint(c)\r\n", "s = input()\r\nans =[]\r\nn = len(s)\r\nfor i in range(n-2):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n ans.append(s[i]+s[j]+s[k])\r\nfinal = 0\r\nfor i in range(len(ans)):\r\n if ans[i] == 'QAQ':\r\n final+=1\r\nprint(final)\r\n", "a=input()\r\nn=0\r\nc=[]\r\nk=[]\r\nfor i in range(len(a)):\r\n if a[i]=='Q':\r\n n+=1\r\n c.append(n)\r\n elif a[i]=='A':\r\n c.append(n)\r\n else:\r\n c.append(0)\r\n if a[i]=='Q':\r\n h=0\r\n for j in range(0,i):\r\n if a[j]=='A':\r\n h+=c[j]\r\n k.append(h)\r\n else:\r\n k.append(0)\r\nprint(sum(k))\r\n", "#!/usr/bin/env python3\n# coding=utf-8\n\nb = input()\nQ = 0\nA = 0\nQA = []\ncount = 0\nfor i in range(len(b)):\n if b[i] == 'Q':\n Q += 1\n QA.append(0)\n count_ = 0\n for j in range(i):\n if b[j] == 'A':\n count_ += QA[j]\n count += count_\n elif b[i] == 'A':\n A += 1\n QA.append(Q)\n else:\n QA.append(0)\n continue\nprint(count)\n", "from itertools import combinations\r\nn=input()\r\nc=0\r\nfor i in combinations(n,3):\r\n if i==('Q','A','Q'):\r\n c+=1\r\nprint(c)", "def g(x, left, right):\n total = 0\n for i in range(left, right):\n if x[i] == 'A':\n total += 1\n\n return total\n\n\ndef f(x, left, right):\n\n total = 0\n for new_right in range(right, left, -1):\n v = x[new_right]\n\n if v == 'Q':\n total += g(x, left, new_right)\n \n return total\n\nn = input()\nx = ''\n\nfor i in n:\n if i == 'Q' or i == 'A':\n x += i\n\nleft = 0\nright = len(x) - 1\ntotal = 0\n\nfor left in range(len(x)):\n v = x[left]\n if v == 'Q':\n total += f(x, left, right)\n\nprint(total)\n\t\t\t\t\t \t\t \t\t \t \t\t\t\t \t\t\t \t", "s=input()\r\nl=[]\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i]=='Q':\r\n l.append(1)\r\n elif s[i]=='A':\r\n l.append(-1)\r\n else:\r\n l.append(0)\r\nc=0\r\nfor i in range(n):\r\n if l[i]==-1:\r\n s1=l[:i].count(1)\r\n s2=l[i:].count(1)\r\n c=c+s1*s2\r\nprint(c)\r\n \r\n ", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n-2):\r\n if s[i]=='Q':\r\n for j in range(i+1,n-1):\r\n if s[j]=='A':\r\n for k in range(j+1,n):\r\n if s[k]=='Q':\r\n c+=1\r\nprint(c)", "a = input(\"\")\r\nc = 0\r\nfor i in range(0, len(a)):\r\n for j in range(i, len(a)):\r\n for k in range(i+1, len(a)):\r\n if a[i] == \"Q\" and a[j] == \"A\" and a[k] == \"Q\" and j < k:\r\n c += 1\r\nprint(c)\r\n", "a = input()\r\nn = len(a)\r\nc=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n for k in range(j,n):\r\n if a[i]=='Q' and a[j]=='A' and a[k]=='Q':\r\n c+=1\r\nprint(c)", "a=input()\r\ns=0\r\nfor i in range(len(a)):\r\n if a[i]=='A':\r\n s+=a[:i].count('Q')*a[i:].count('Q')\r\nprint(s)", "s = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"Q\":\r\n for f in range(i, len(s)):\r\n if s[f] == \"A\":\r\n for k in range(f, len(s)):\r\n if s[k] == \"Q\":\r\n count += 1\r\nprint(count)", "def fun1(a,b,l1,l2):\r\n if(l1==0 and l2==0)or(l2==0):\r\n return 1\r\n if(l1==0):\r\n return 0\r\n if (a[l1-1]==b[l2-1]):\r\n return (fun1(a,b,l1-1,l2-1)+ fun1(a,b,l1-1,l2))\r\n else:\r\n return fun1(a,b,l1-1,l2)\r\n\r\ns=input()\r\n#count=0\r\nsubseq=\"QAQ\"\r\n\r\nprint(fun1(s,subseq,len(s),len(subseq)))", "# -*- coding: utf-8 -*-\n\nmessage = list(input())\n\nans = 0\n\nfor i in range(len(message) - 2):\n for j in range(i + 1, len(message) - 1):\n for x in range(j + 1, len(message)):\n if (message[i] == 'Q' and message[j] == 'A' and message[x] == 'Q'):\n ans += 1\n\nprint(ans)\n\n \t \t \t \t \t \t\t \t \t\t \t\t \t", "n=input()\nans=0\nfor i in range(len(n)-2):\n for j in range(i+1,len(n)-1):\n for k in range(j+1,len(n)):\n if n[i]+n[j]+n[k]==\"QAQ\":ans+=1\nprint(ans)\n", "s = input()\r\nnq=0\r\ne = []\r\nfor i in s:\r\n if i==\"Q\":\r\n nq+=1\r\n elif i==\"A\":\r\n e.append(nq)\r\nr=0\r\nfor i in e:\r\n r+=i*(nq-i)\r\nprint(r)", "s = str(input(\"\"))\r\nans = []\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(s)):\r\n if s[i]=='A':\r\n for j in range(i):\r\n if s[j]== 'Q':\r\n c1 += 1\r\n for k in range(i,len(s)):\r\n if s[k]== 'Q':\r\n c2 += 1\r\n ans.append(c1*c2)\r\n c1 = 0\r\n c2 = 0\r\nprint(sum(ans))\r\n\r\n", "s = input()\r\ntemp = []\r\nfor i in s:\r\n if i == 'Q' or i=='A':\r\n temp += [i]\r\ns = ''.join(temp)\r\ndel(temp)\r\nans = 0\r\nfor i in range(len(s)-2):\r\n if s[i]=='Q':\r\n for j in range(i+1,len(s)-1):\r\n if s[j]=='A':\r\n for z in range(j+1,len(s)):\r\n if s[z] == 'Q':\r\n ans += 1\r\nprint(ans)\r\n", "# O(n**2)\r\ns=input()\r\nans=0\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i]=='Q':\r\n cur=0\r\n for j in range(i+1,n):\r\n if s[j]=='A':\r\n cur+=1\r\n if s[j]=='Q':\r\n ans+=cur\r\nprint(ans)\r\n \r\n \r\n \r\n ", "from itertools import combinations as comb\r\nst = input()\r\nnew = \"\"\r\nfor i in st:\r\n if i=='Q' or i=='A':\r\n new += i\r\n\r\nc = 0\r\nfor i in list(comb(new,3)):\r\n final = ''.join(i)\r\n if final==\"QAQ\":\r\n c += 1\r\nprint(c)\r\n", "string = input()\ncount = 0\nQplace = []\nfor i in string:\n if i == 'A' or i == 'Q':\n count += 1\n if i == \"Q\":\n Qplace.append(count)\ntotal = 0\nif len(Qplace) > 0:\n lastQ = Qplace[-1]\nwhile len(Qplace) >= 2:\n i = Qplace[0]\n qplace = 1\n while qplace < len(Qplace):\n total += Qplace[qplace] - i - 1 - (qplace - 1)\n qplace += 1\n Qplace.remove(i)\nprint(total)\n \t\t \t\t \t \t\t \t\t \t\t\t\t\t\t \t \t", "s=input()\r\nl=list(s)\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n if l[i]=='A':\r\n a=0\r\n b=0\r\n for j in range(i):\r\n if l[j]=='Q':\r\n a+=1\r\n for j in range(i,n):\r\n if l[j]=='Q':\r\n b+=1\r\n c+=a*b\r\nprint(c)", "s = input()\n\nn = len(s)\ncount_q1 = 0\ncount_q2 = s.count(\"Q\")\ncount = 0\n\nfor i in range(n):\n if s[i] == \"Q\":\n count_q1 += 1\n \n if s[i] == \"A\":\n count += count_q1 * (count_q2 - count_q1)\n\nprint(count)\n \t\t \t\t\t \t\t\t\t\t\t \t\t\t \t\t\t\t \t", "#DEBUG\r\n#import sys\r\n#sys.stdin = open('in1.txt', 'r')\r\n#\r\n\r\nword = input()\r\nn = len(word)\r\nprefix1 = []\r\nq = 0\r\nfor i in range(n):\r\n if word[i] == 'Q':\r\n q += 1\r\n prefix1.append(q)\r\n#print(prefix1)\r\nq = 0\r\nprefix2 = [0 for i in range(n)]\r\nfor i in range(n-1, -1, -1):\r\n if word[i] == 'Q':\r\n q += 1\r\n prefix2[i] = q\r\n#print(prefix2)\r\nres = 0\r\nfor i in range(n):\r\n if word[i] == 'A':\r\n res += prefix1[i]*prefix2[i]\r\nprint(res)\r\n", "s = input()\r\nstack = [0]\r\ncountA = 0\r\ncountQ = 0\r\nfor i in range(0,len(s)):\r\n ii = len(s) - i - 1\r\n if s[ii] == 'Q':\r\n p = countA*countQ\r\n if stack:\r\n p += stack[-1]\r\n stack.append(p)\r\n countQ += 1\r\n countA = 0\r\n elif s[ii] == 'A':\r\n countA += 1\r\nprint(sum(stack))", "s=input()\r\nq=[i for i in range(len(s)) if s[i]=='Q']\r\nif(len(q)<2):\r\n print(0)\r\nelse:\r\n a=[i for i in range(len(s)) if s[i]=='A' and q[0]<i<q[-1]]\r\n if(len(a)<1):\r\n print(0)\r\n else:\r\n count=0\r\n temp=-1\r\n for i in q:\r\n for j in a:\r\n while True:\r\n if(i<j<q[temp]):\r\n count=count+1\r\n temp=temp-1\r\n else:\r\n break\r\n temp=-1\r\n print(count)", "S = input()\r\n\r\npreq = []\r\nsufq = []\r\n\r\ncount = 0\r\n\r\nfor i in range(len(S)):\r\n\r\n if S[i] == 'Q':\r\n count += 1\r\n\r\n elif S[i] == 'A':\r\n preq.append(count)\r\n\r\n#preq.append(count)\r\ncount = 0\r\n\r\nfor j in range(len(S)-1,-1,-1):\r\n\r\n if S[j] == 'Q':\r\n count += 1\r\n\r\n elif S[j] == 'A':\r\n sufq.append(count)\r\n\r\n#sufq.append(count)\r\nsufq.reverse()\r\nans = 0\r\n\r\n#(preq)\r\n#print(sufq)\r\n\r\nfor k in range(len(preq)):\r\n\r\n ans += preq[k]*sufq[k]\r\n\r\nprint(ans)\r\n\r\n\r\n", "s=input()\r\nt=\"QAQ\"\r\ndp={}\r\ndef dfs(i,j):\r\n if j==len(t):\r\n return 1\r\n if i==len(s):\r\n return 0\r\n if (i,j) in dp:\r\n return dp[(i,j)]\r\n if s[i]==t[j]:\r\n dp[(i,j)]=dfs(i+1,j+1)+dfs(i+1,j)\r\n else:\r\n dp[(i,j)]=dfs(i+1,j)\r\n return dp[(i,j)]\r\nprint(dfs(0,0))", "s=input()\r\nval=0\r\nqal=s.count('Q')\r\nlst=[]\r\nfor i in s:\r\n if i=='Q':\r\n val +=1\r\n if i=='A':\r\n lst.append(val)\r\nsum=0\r\nfor i in lst:\r\n sum += i*(qal-i)\r\n\r\nprint(sum)\r\n\r\n", "import sys\r\nimport collections\r\nimport math\r\nimport functools\r\nimport itertools\r\nimport bisect\r\nimport operator\r\nimport heapq\r\nimport random\r\ntrue=True\r\nfalse=False\r\nnull=None\r\ntcid=0\r\ntcmax=99999999\r\ndef compute(val, func): return func(val)\r\ndef seq(lo,hi,step=1): \r\n return range(lo,hi+1,step)\r\ndef sround(val,nd):\r\n return f'{val:.{nd}f}'\r\ndef ceil(a,b):\r\n ans=a//b\r\n if a%b!=0: ans+=1\r\n return ans\r\ndef perr(*args,**kwargs): print(*args,file=sys.stderr,**kwargs)\r\ndef line():\r\n ln=sys.stdin.readline().strip()\r\n #perr(ln)\r\n if ln=='': sys.exit()\r\n return ln\r\ndef lines(n): return [line() for i in range(n)]\r\ndef split(ln=None): return (ln or line()).split()\r\ndef num(str=None):\r\n str=str or line()\r\n return float(str) if '.' in str else int(str)\r\ndef nums(o=None):\r\n if o is not None:\r\n if isinstance(o, int): o=lines(o)\r\n elif isinstance(o, str): o=split(o)\r\n return list(map(num, o or split()))\r\n#\r\n#help(\"sys.modules\")\r\n\"\"\"\r\nceil(a,b) sround(val,nd) true false null\r\nnum(?) nums(?) split(?) lines(n) line()\r\nperr(print) tcmax seq() compute(v,f) tcid\r\n\"\"\"\r\n#{#\r\n\r\n#}#\r\ndef mainloop(tcid=1):\r\n# {{{\r\n s=line()\r\n q=\"Q\"\r\n a=\"A\"\r\n ans=0\r\n for ii in range(len(s)-2):\r\n for jj in range(ii+1,len(s)-1):\r\n for kk in range(jj+1,len(s)):\r\n if s[ii]==q and s[jj]==a and s[kk]==q:\r\n ans+=1\r\n print(ans)\r\n# }}}\r\nwhile tcid<tcmax:\r\n tcid+=1\r\n mainloop(tcid)\r\n\"\"\"\r\nNOTES = .\r\n\r\n\"\"\"\r\n\"\"\"\r\nPROBLEM #ID = .\r\n\r\n\"\"\"", "s = input()\r\ncount = 0\r\n# a, b = map(int, input().split())\r\nfor i in range(len(s)):\r\n for j in range(len(s)):\r\n if s[i] == s[j] == 'Q':\r\n count += s[i:j].count('A')\r\nprint(count)\r\n", "s = input()\r\nn = len(s)\r\nq = [0]*n\r\nc = 0\r\nif s[0] == 'Q':\r\n q[0] = 1\r\nfor i in range(1,n):\r\n if s[i] == 'Q':\r\n q[i] = q[i-1]+1\r\n else:\r\n q[i] = q[i-1]\r\n\r\nfor i in range(1,n):\r\n if s[i] == 'A':\r\n c+=(q[-1]-q[i])*q[i]\r\nprint(c)", "s=input()\r\ncounter=0\r\nfor q1 in range(len(s)):\r\n for a in range(q1+1,len(s)):\r\n for q2 in range(a+1,len(s)):\r\n if(s[q1]=='Q' and s[a]=='A' and s[q2]=='Q'):\r\n counter+=1\r\nprint(counter)", "def solve():\r\n n=list(input())\r\n q=n.count(\"Q\")\r\n c=0\r\n s=0\r\n for i in range(len(n)):\r\n if n[i]==\"Q\":\r\n c+=1\r\n elif n[i]==\"A\":\r\n s+=c*(q-c)\r\n else:\r\n continue\r\n print(s)\r\n\r\nif __name__==\"__main__\":\r\n solve()\r\n", "s = input()\r\ncountA = s.count('A')\r\nc=0\r\ntot=0\r\nind=0\r\nl=list(s)\r\nfor i in range(len(s)-1):\r\n if(s[i]=='A'):\r\n \r\n tot+= (l[:i].count('Q') * l[i+1:].count('Q'))\r\n ind=i\r\nprint(tot)", "a = input()\r\nb = \"\"\r\nfor i in range(len(a)):\r\n if a[i] == 'Q' or a[i] == 'A':\r\n b += a[i]\r\ncount = 0\r\narr = []\r\nfor i in range(len(b)):\r\n if b[i] == 'Q' and b[i] != 'A':\r\n count += 1\r\n else:\r\n arr.append(count)\r\n count = 0\r\n continue\r\narr.append(count)\r\ncount = 0\r\nfor i in range(1, len(arr), 1):\r\n count += (sum(arr[0:i]) * sum(arr[i:]))\r\nprint(count)\r\n", "from itertools import combinations\r\n\r\na = input()\r\naa = ''\r\nfor letter in a:\r\n if letter in ['Q','A']:\r\n aa += letter\r\nprint(list(combinations(aa,3)).count(('Q', 'A', 'Q')))", "def find_q(xs):\n res = 0\n\n for s in xs:\n if s == 'Q':\n res += 1\n\n return res\n\n\ndef find_aq(xs):\n res = 0\n\n for i in range(len(xs)):\n if xs[i] == 'A':\n res += find_q(xs[i + 1:])\n\n return res\n\n\ndef find_qaq(xs):\n res = 0\n\n for i in range(len(xs)):\n if xs[i] == 'Q':\n res += find_aq(xs[i + 1:])\n\n return res\n\n\ndef main():\n xs = input()\n print(find_qaq(xs))\n\n\nmain()\n", "s1=str(input())\r\ncnt=0\r\nfor i in range(len(s1)):\r\n\tfor j in range(i+1,len(s1)):\r\n\t\tfor k in range(j+1,len(s1)):\r\n\t\t\tif s1[i]=='Q' and s1[j]=='A' and s1[k]=='Q':\r\n\t\t\t\tcnt+=1\r\nprint(cnt)", "#!/usr/env/python3\n\npp = input()\n\ncount = 0\nfor i in range(len(pp)):\n for j in range(i+1, len(pp)):\n for k in range(j+1, len(pp)):\n if pp[i] == \"Q\" and pp[j] == \"A\" and pp[k] == \"Q\":\n count += 1\n\nprint(count)\n", "string = input()\r\ncount = 0\r\nfor i in range(len(string)):\r\n if string[i] == 'Q':\r\n for j in range(i, len(string)):\r\n if string[j] == 'A':\r\n for k in range(j, len(string)):\r\n if string[k] == 'Q':\r\n count += 1\r\nprint(count)", "s = input()\n\nl_q = [0 for _ in range(len(s))]\nfor (i, c) in enumerate(s):\n if c == \"Q\":\n l_q[i] += 1\n l_q[i] += 0 if i == 0 else l_q[i - 1]\n\nt = 0\nfor (i, c) in enumerate(s):\n if c == \"A\" and i > 0:\n t += (l_q[len(l_q) - 1] - l_q[i - 1]) * l_q[i - 1]\n\nprint(t) \n \t\t\t\t\t \t\t \t\t\t\t \t \t \t \t\t", "# brute force\r\ns = input()\r\n\r\nlength = len(s)\r\ncount = 0\r\nfor i in range(0,length):\r\n if s[i] =='Q':\r\n for j in range(i+1,length):\r\n if s[j] == 'A':\r\n for l in range(j,length):\r\n if s[l] == 'Q':\r\n count+=1\r\nprint(count)", "def linear_time(_str : str) -> int:\r\n g_count = 0\r\n before_u = 0\r\n before_2nd_g = 0\r\n\r\n for char in _str:\r\n if char == 'Q':\r\n g_count += 1\r\n before_2nd_g += before_u # how many prefixes are already exist\r\n\r\n elif char == 'A':\r\n before_u += g_count \r\n\r\n print(before_2nd_g)\r\n \r\ns = input()\r\nlinear_time(s)", "def dp(index, word):\r\n if not word:\r\n return 1\r\n if index == len(s):\r\n return 0\r\n ans = 0\r\n if s[index] == word[0]:\r\n ans += dp(index + 1, word[1:])\r\n return ans + dp(index + 1, word)\r\n\r\n\r\ns = input()\r\nprint(dp(0, 'QAQ'))", "s= input()\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n for j in range(i+1,len(s)):\r\n if s[j] == 'A':\r\n for k in range(j+1,len(s)):\r\n if s[k] == 'Q':\r\n cnt +=1\r\n pass\r\n pass\r\nprint(cnt)", "k = 0\r\nq = 0\r\na = 0\r\nfor i in input():\r\n if i == 'A':\r\n a += q\r\n elif i == 'Q':\r\n k += a\r\n q += 1\r\nprint(k)\r\n", "import sys\r\nfrom os import path\r\n\r\n\r\ndef read_list_int():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef read_list_float():\r\n return [float(i) for i in input.split()]\r\n\r\n\r\ndef read_list_string():\r\n return [i for i in input.split()]\r\n\r\n\r\ndef display(dp):\r\n for row in dp:\r\n for val in row:\r\n print(val, end=' ')\r\n print()\r\n\r\n\r\ndef solve():\r\n sequence = input()\r\n sub_sequence = \"QAQ\"\r\n n = len(sequence)\r\n m = len(sub_sequence)\r\n dp = [[0 for _ in range(m+1)] for j in range(n+1)]\r\n for i in range(n+1):\r\n dp[i][0] = 1\r\n for i in range(1, n+1):\r\n for j in range(1, m+1):\r\n if sub_sequence[j-1] == sequence[i-1]:\r\n dp[i][j] = dp[i-1][j-1] + dp[i-1][j]\r\n else:\r\n dp[i][j] = dp[i-1][j]\r\n print(dp[n][m])\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\nsolve()\r\n", "s = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n for j in range(len(s)):\r\n for k in range(len(s)):\r\n if s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q' and i < j and k > j:\r\n res += 1\r\nprint(res)", "from itertools import combinations\r\na = input()\r\nans = 0\r\nfor i in combinations(a,3):\r\n if i == (\"Q\",\"A\",\"Q\"):\r\n ans += 1\r\nprint(ans)\r\n", "def somme(ch,i):\r\n s=0\r\n for j in range(i,len(ch)):\r\n for u in range(j,len(ch)):\r\n if ch[j]=='A':\r\n if ch[u]=='Q':\r\n s=s+1\r\n return(s)\r\ns=0\r\nch=input()\r\nfor i in range (len(ch)):\r\n if ch[i]=='Q':\r\n s=s+somme(ch,i)\r\nprint(s)\r\n\r\n", "a=input()\r\nd=0\r\nfor i in range(len(a)):\r\n b=0\r\n s=0\r\n for j in range(i,len(a)):\r\n if a[i]!='Q':\r\n break\r\n if a[i]=='Q' and b==0:\r\n b+=1\r\n if b>0 and a[j]=='A':\r\n s+=1\r\n if b>0 and a[j]=='Q':\r\n d+=s\r\nprint(d)\r\n", "k=str(input())\r\na=0\r\nfor i in range(len(k)):\r\n\tif k[i]==\"A\":\r\n\t\ta+=k[:i].count(\"Q\")*k[i:].count(\"Q\")\r\nprint(a)", "s = input()\n\n\ndef count_qaqs(s):\n Qs_pre = 0\n Qs_post = s.count(\"Q\")\n counter = 0\n for sym in s:\n if sym == 'Q':\n Qs_post -= 1\n Qs_pre += 1\n if sym == 'A':\n counter += Qs_post*Qs_pre\n return counter\n\nprint(count_qaqs(s))\n\t\t\t\t \t\t \t \t \t \t \t \t\t\t \t\t", "s = input()\r\nQ = 0\r\nQA = 0\r\nQAQ = 0\r\nfor i in s:\r\n if i == \"Q\":\r\n Q += 1\r\n QAQ += QA\r\n if i == \"A\":\r\n QA+= Q\r\nprint(QAQ)", "s = str(input())\nt = \"QAQ\"\nn = len(s)\nm = len(t)\ndp = [1, 0, 0, 0]\nfor i in range(n):\n j = m-1\n while (j >= 0):\n if (t[j] == s[i]):\n dp[j+1] += dp[j]\n j -= 1\nprint(dp[3])\n \t\t\t \t \t \t\t \t \t \t \t", "x = input('')\r\nc1 = 0\r\nc2 = 0\r\na=x.count('Q')\r\nfor i in x:\r\n if i=='Q':\r\n c1+=1\r\n if i=='A':\r\n c2+=c1*(a-c1)\r\nprint(c2)\r\n", "x = input()\r\n\r\nq_count = 0\r\nqa_count = 0\r\nqaq_count = 0\r\n\r\nfor i in range(len(x)):\r\n if x[i] == 'Q':\r\n qaq_count += qa_count\r\n q_count += 1\r\n if x[i] == 'A':\r\n qa_count += q_count\r\n\r\nprint(qaq_count)\r\n", "#n=int(input())\r\n#l=list(map(int,input().split()))\r\ns=input()\r\nr=0\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i]=='Q':\r\n for j in range(i+1,n):\r\n if(s[j]=='A'):\r\n for k in range(j+1,n):\r\n if(s[k]=='Q'):\r\n r+=1\r\nprint(r)\r\n", "# your code goes here\r\n\r\ns = input()\r\n\r\n\r\nl = len(s)\r\nans = 0\r\n\r\nfor i in range(l-3+1):\r\n\tfor j in range(i+1,l-2+1):\r\n\t\tfor k in range(j+1,l-1+1):\r\n\t\t\tif (s[i]=='Q' and s[j] == 'A' and s[k]=='Q'):\r\n\t\t\t\tans += 1\r\n\t\t\t\r\n\r\nprint(ans)", "# LUOGU_RID: 106150686\ns=input()\r\nn=len(s)\r\ncnt=0;\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if s[i]=='Q' and s[j]=='A' and s[k]=='Q':\r\n cnt=cnt+1\r\nprint(cnt)\r\n", "string = input().strip(\" \")\r\ncount_Q = 0\r\nfor i in range(len(string)):\r\n if string[i]==\"Q\":\r\n count_Q = count_Q + 1\r\ndef ONsolution(string):\r\n count_Q_before = 0\r\n count_Q_after = 0\r\n ans = 0\r\n for i in range(len(string)):\r\n if string[i]==\"Q\":\r\n count_Q_before = count_Q_before + 1\r\n count_Q_after = count_Q - count_Q_before\r\n elif string[i]==\"A\":\r\n ans = ans + count_Q_before*count_Q_after\r\n return ans\r\nprint(ONsolution(string))\r\n", "s_n = input()\r\nans = 0\r\na_ind = s_n.find('A')\r\n\r\nwhile a_ind > -1:\r\n ans += s_n.count('Q', 0, a_ind) * s_n.count('Q', a_ind+1)\r\n a_ind = s_n.find('A', a_ind+1)\r\n\r\nprint(ans)", "\r\n\r\ns = input()\r\ntot = 0\r\nfor i in range(len(s)):\r\n if s[i]==\"Q\":\r\n for j in range(i+1, len(s)):\r\n if s[j]==\"A\":\r\n for k in range(j+1, len(s)):\r\n if s[k]==\"Q\":\r\n tot += 1\r\nprint(tot)", "s=input()\r\nn=len(s)\r\nt=0\r\nfor i in range(n):\r\n if s[i]=='A':\r\n t+=s[:i].count('Q')*s[i+1:].count('Q')\r\nprint(t)\r\n", "import bisect\ns = ' ' + input()\nQ, A = [], []\nfor i, v in enumerate(s):\n if v == 'Q':\n Q.append(i)\n elif v == 'A':\n A.append(i)\nsq, sa = len(Q), len(A)\nres = 0\nfor i in range(sq):\n a = bisect.bisect_left(A, Q[i])\n for j in range(a, sa):\n b = bisect.bisect_right(Q, A[j])\n res += sq - b\nprint(res)\n\t\t \t\t \t \t\t \t \t \t\t\t \t\t\t", "s = input()\r\n# limpiamos caracteres que sobran por ambos lados\r\nfirstQ = s.find('Q')\r\nsinv = s[::-1]\r\nlastQ = sinv.find('Q')\r\nnew_s = s[firstQ:len(s)-lastQ]\r\n\r\n#print(\"[s]\", new_s)\r\n# fin limpieza\r\n# iteramos para buscar una Q, luego una A y luego otra Q,\r\nc = 0\r\nfor i, primletra in enumerate(new_s):\r\n if primletra == 'Q': \r\n sub_s = new_s[i+1:]\r\n #print(\"[sub_s -> A]\", sub_s)\r\n for j, segletra in enumerate(sub_s):\r\n if segletra == 'A':\r\n c+= sub_s[j+1:].count('Q')\r\n #print(\"[sub_s -> Q]\", sub_s[j+1:])\r\nprint(c)\r\n", "s = input()\r\nn = len(s)\r\ns1 = ''\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == 'Q':\r\n s1 += 'Q'\r\n elif s[i] == 'A' and s1.count('Q') > 0:\r\n s1 += 'A'\r\nfor i in range(len(s1)):\r\n if s1[i] == 'Q':\r\n for j in range(i, len(s1)):\r\n if s1[j] == 'A':\r\n ans += s1[j:].count('Q')\r\nprint(ans)\r\n", "if __name__ == \"__main__\":\r\n s = str(input())\r\n new_s = ''\r\n for i in range(len(s)):\r\n if s[i] == 'Q':\r\n new_s += 'Q'\r\n elif s[i] == 'A':\r\n new_s += 'A'\r\n answer = 0\r\n for i in range(len(new_s)):\r\n for x in range(i + 1, len(new_s)):\r\n for j in range(x + 1, len(new_s)):\r\n if new_s[i] + new_s[x] + new_s[j] == 'QAQ':\r\n answer += 1\r\n print(answer)\r\n", "ii=lambda : int(input())\r\niin=lambda : map(int,input().split())\r\nil=lambda : list(map(int,input().split()))\r\n\r\n\r\n\r\na=input()\r\nans=0\r\nfor i in range(len(a)-1):\r\n if(a[i]==\"A\"):\r\n ans+=a[:i].count(\"Q\")*a[i+1:].count(\"Q\")\r\nprint(ans)", "s=input()\nRes=0\nfor i in range(1,len(s)):\n r2=0\n r1=0\n if s[i]=='A':\n for j in range(i):\n if s[j]=='Q':\n r1+=1\n for j in range(i,len(s)):\n if s[j]=='Q':\n r2+=1\n Res+=r1*r2\nprint(Res)\n\n\t\t\t\t \t\t \t \t \t \t\t\t \t\t\t \t", "num=input()\r\nn=len(num)\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if num[i]+num[j]+num[k]==\"QAQ\":\r\n ans +=1\r\nprint(ans)", "s = input()\r\nq = 0\r\nqs = 0\r\nans = 0\r\nfor i in s:\r\n qs += int(i is 'Q')\r\nc = 0\r\nfor i in range(len(s)):\r\n c += int(s[i] is 'Q')\r\n if s[i] is 'A':\r\n ans += c * (qs - c)\r\nprint(ans)\r\n", "def main():\r\n s = input()\r\n l = len(s)\r\n cnt = 0\r\n for i in range(l):\r\n if s[i] == \"Q\":\r\n for j in range(i+1, l):\r\n if s[j] == \"A\":\r\n for k in range(j+1, l):\r\n if s[k] == \"Q\":\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\nmain()", "def QAQ(s):\n n = len(s)\n count = 0\n count_Q = 0\n count_Qr = s.count(\"Q\")\n for i in range(n):\n if s[i] == \"Q\":\n count_Q += 1\n if s[i] == \"Q\":\n count_Qr -= 1\n if s[i] == \"A\":\n count += count_Q * count_Qr\n return count\ns = input()\nprint(QAQ(s))\n \t \t \t\t \t\t\t\t \t\t \t\t", "import sys\r\nimport math\r\nfrom sys import stdin,stdout\r\nimport itertools\r\nimport copy\r\nfrom collections import*\r\nfrom math import gcd,ceil,floor\r\nmod = 1000000007\r\n##sys.stdout=open(\"Updated prg/Output3.txt\",\"w\")\r\n##sys.stdin=open(\"Updated prg/Input3.txt\",\"r\")\r\ns=input()\r\ns1=\"QAQ\"\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]==\"Q\":\r\n for j in range(i,len(s)):\r\n if s[j]==\"A\":\r\n for k in range(j,len(s)):\r\n if s[k]==\"Q\":\r\n c=c+1\r\nprint(c)", "ct, x, y = 0, 0, 0\r\nfor i in input():\r\n if i == 'Q':\r\n ct += x\r\n y += 1\r\n if i == 'A':\r\n x += y\r\nprint(ct)", "str=input()\r\ncount=0\r\nfor i in range(len(str)):\r\n for j in range (i+1,len(str)):\r\n for k in range(j+1,len(str)):\r\n if str[i]==\"Q\" and str[j]==\"A\" and str[k]==\"Q\":\r\n # print(i,\" \",j,\" \",k)\r\n count+=1\r\n\r\nprint(count)\r\n", "n=input()\r\nan=0\r\nfor i in range(len(n)):\r\n if n[i]!='Q':\r\n continue\r\n for j in range(i+1,len(n)):\r\n if n[j] != 'A':\r\n continue\r\n for k in range(j+1,len(n)):\r\n if n[k] =='Q':\r\n an+=1\r\nprint(an)", "str=input()\r\ncount=0\r\nfor i in range(len(str)):\r\n if str[i]=='Q':\r\n for j in range(i+1,len(str)):\r\n if str[j]=='A':\r\n for k in range(j+1,len(str)):\r\n if str[k]=='Q':\r\n count+=1\r\nprint(count)", "a = []\r\nb = []\r\ns = input()\r\nn = len(s)\r\ncc = 0\r\nans = 0\r\nfor i in range(0, n):\r\n if s[i] == 'Q':\r\n cc += 1\r\n a.append(cc)\r\ncc = 0\r\nfor i in range(n-1, -1, -1):\r\n if s[i] == 'Q':\r\n cc += 1\r\n b.append(cc)\r\nb.reverse()\r\nfor i in range(0, n):\r\n if s[i] == 'A':\r\n ans += a[i]*b[i]\r\nprint(ans)", "s=input()\r\nr=len(s)\r\ni=0\r\ncount=0\r\nfor i in range(r):\r\n if s[i]=='Q':\r\n for j in range(i+1,r):\r\n if s[j]=='A':\r\n for k in range(j+1,r):\r\n if s[k]=='Q':\r\n count+=1\r\nprint(count) ", "s=input()\r\nif(len(s)<3):\r\n print(\"0\")\r\n exit()\r\nans=0\r\nfor i in range(1,len(s)-1):\r\n if(s[i]=='A'):\r\n ans+=(s[:i].count('Q'))*(s[i+1:].count('Q'))\r\nprint(ans)", "s=input()\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i]=='A':\r\n cnt+=s[:i].count('Q')*s[i:].count('Q')\r\nprint(cnt)", "s=input()\r\nl,k=[],[]\r\nfor i in range(len(s)):\r\n if s[i]=='A':\r\n l.append(i)\r\n elif s[i]=='Q':\r\n k.append(i)\r\nt=0\r\nfor i in range(len(l)):\r\n a,b=0,0\r\n for j in k:\r\n if j<l[i]:\r\n a+=1 \r\n else:\r\n b+=1 \r\n t+=a*b\r\nprint(t)", "def solver():\n n = input()\n q_counter = 0\n qa = [0 for i in range(len(n)+1)]\n qaq = [0 for i in range(len(n) + 1)]\n\n for i in range(1, len(n) + 1):\n qa[i] = qa[i - 1]\n qaq[i] = qaq[i-1]\n if n[i-1] == \"Q\":\n q_counter = q_counter + 1\n qaq[i] = qaq[i-1] + qa[i-1]\n\n elif n[i-1] == \"A\":\n qa[i] = qa[i-1] + q_counter\n\n print(qaq[-1])\n\n\nsolver()\n", "def qaq():\n string = list(input())\n n = len(string)\n count = 0\n\n for i in range(0, n):\n for j in range(i+1, n):\n for k in range(j+1, n):\n if(string[i] == \"Q\" and string[j] == \"A\" and string[k] == \"Q\"):\n count += 1\n \n print(count)\n\nif __name__ == \"__main__\":\n qaq()\n\n \t \t\t \t \t\t \t \t\t \t \t \t\t", "s=input()\r\nres=0\r\nfor i in range(len(s)):\r\n for j in range(i+1, len(s)):\r\n for k in range(j+1, len(s)):\r\n if s[i]+s[j]+s[k]==\"QAQ\":\r\n res+=1\r\nprint(res)", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\ns = input();c = 0\r\nfor i in range(len(s)):\r\n for j in range(i,len(s)):\r\n for k in range(j,len(s)):\r\n if s[i] == \"Q\" and s[j] == \"A\" and s[k] == \"Q\":\r\n c+=1\r\nprint(c)\r\n", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n for ii in range(i,len(s)):\r\n for iii in range(ii,len(s)):\r\n if s[i]=='Q' and s[ii]=='A' and s[iii]=='Q':\r\n c+=1\r\nprint(c)\r\n\r\n\r\n", "s=input()\r\nx=''\r\nfor i in s:\r\n if i=='Q' or i=='A':\r\n x+=i\r\nrj=0\r\nd=len(x)\r\nfor i in range(d):\r\n if x[i]=='Q':\r\n for j in range(i,d):\r\n if x[j]=='A':\r\n for k in range(j,d):\r\n if x[k]=='Q':\r\n rj+=1\r\n\r\nprint(rj)\r\n", "s = \"\"\n\n\ndef read_input():\n global s\n s = input()\n\n\ndef solve():\n total_count = 0\n\n for i in range(0, len(s)):\n if s[i] == 'Q':\n for j in range(i + 1, len(s)):\n if s[j] == 'A':\n for k in range(j + 1, len(s)):\n if s[k] == 'Q':\n total_count = total_count + 1\n\n return total_count\n\n\nread_input()\nprint(solve())\n", "s=str(input())\r\nl1=[]\r\nfor i in s:\r\n if i=='Q' or i=='A':\r\n l1.append(i)\r\n\r\n# print(l1)\r\nchk='QAQ'\r\nl=len(l1)\r\nct=0\r\ni=0\r\nj=0\r\nk=0\r\nfor i in range(l+1):\r\n for j in range(i+1,l):\r\n for k in range(j+1,l):\r\n if chk==l1[i]+l1[j]+l1[k]:\r\n ct+=1\r\nprint(ct)\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, sys.stdin.readline().strip().split()) \r\ndef listinput(): return list(map(int, sys.stdin.readline().strip().split())) \r\nk=input();\r\nprint(sum(k[:i].count(\"Q\")*k[i:].count(\"Q\") \r\nfor i in range(len(k)) \r\nif k[i]==\"A\"))", "st = input()\nn = len(st)\ndp = [0 for i in range(n)]\n\nfor i in range(n):\n if st[i]=='Q':\n for j in range(i-1,-1,-1):\n if st[j]== 'A':\n for k in range(j-1,-1,-1):\n if st[k]=='Q':\n dp[i] += 1\nprint(sum(dp))\n", "s = input()\r\ncntq = 0\r\ncntq2 = 0\r\nans = 0 \r\nfor i in range(0,len(s)):\r\n if (s[i] =='Q'):\r\n cntq+=1\r\nfor i in range (0,len(s)):\r\n if(s[i] =='A'):\r\n ans+=(cntq2*(cntq-cntq2)) \r\n if (s[i] =='Q'):\r\n cntq2+=1\r\nprint(ans)\r\n\r\n", "def solve():\r\n\ts = input()\r\n\tn = len(s)\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\tfor j in range(i, n):\r\n\t\t\tfor k in range(j, n):\r\n\t\t\t\tif s[i] + s[j] + s[k] == 'QAQ':\r\n\t\t\t\t\tcnt += 1\r\n\t\r\n\tprint(cnt)\r\n\r\nsolve()\r\n", "seq = \"\".join([i for i in input() if i in {\"A\", \"Q\"}])\r\nfirst = [0]\r\nsecond = [0]\r\n\r\nfor i in seq[::-1]:\r\n first += [first[-1] + (i == \"Q\")]\r\n\r\nfor i in seq:\r\n second += [second[-1] + (i == \"Q\")]\r\n\r\nfirst.reverse()\r\ndel first[0]\r\ndel second[-1]\r\n\r\nsm = 0\r\nfor i in range(len(seq)):\r\n sm += first[i] * second[i] * (seq[i] == \"A\")\r\n\r\nprint(sm)\r\n", "t = 1\r\nfor _ in reversed(range(t)):\r\n a = input()\r\n x = len(a)\r\n foa = [0] * x\r\n rea = [0] * x\r\n su = 0\r\n for i in range(x):\r\n if a[i] == 'Q':\r\n su += 1\r\n foa[i] = su\r\n su = 0\r\n for i in reversed(range(x)):\r\n if a[i] == 'Q':\r\n su += 1\r\n rea[i] = su\r\n ans=0\r\n for i in range(x):\r\n if a[i]=='A':\r\n ans+=foa[i]*rea[i]\r\n print(ans)\r\n\r\n", "def main():\n chain = input()\n\n count = 0\n\n for i, l in enumerate(chain):\n if l == 'Q':\n for j, m in enumerate(chain[i+1:]):\n if m == 'A':\n for n in chain[j+i+1:]:\n if n == 'Q':\n count += 1\n \n print(count)\n\n\nmain()\n\t\t\t \t\t \t \t\t\t\t\t \t\t \t", "s = list(input())\r\na = 0\r\nl = 0\r\nfor y in range(s.count(\"A\")):\r\n i = s.index(\"A\")\r\n l += s[0:i].count(\"Q\") * s[i+1:].count(\"Q\")\r\n s[i] = 'a'\r\nprint(l)\r\n", "s = input()\n\nfrom collections import Counter\n\nn = len(s)\nc = Counter()\ndp = [0] * n\n\nfor i, a in enumerate(s):\n if a == 'Q':\n if c['A']:\n dp[i] = c['A']\n c['Q'] += 1\n else:\n c['Q'] += 1\n elif a == 'A':\n if c['A']:\n # print('here', c, i)\n c['A'] += c['Q']\n else:\n c['A'] = c['Q']\n# print(c)\n# print(dp)\nprint(sum(dp))", "s=input()\r\nn=len(s)\r\nl1=[0 for i in range(n)]\r\nl2=[0 for i in range(n)]\r\nq=0\r\nfor i in range(n):\r\n if s[i]==\"Q\":\r\n q+=1\r\n l1[i]=q\r\nq=0\r\nfor i in range(n-1, -1, -1):\r\n if s[i]==\"Q\":\r\n q+=1\r\n l2[i]=q\r\nans=0\r\nfor i in range(n):\r\n if s[i]==\"A\":\r\n ans+=l1[i]*l2[i]\r\nprint(ans)", "seq = input()\ncont = 0\nletters = ['A', 'Q']\nstr_ = [a for a in seq if a in letters]\ncont = 0\nfor i in range(len(seq)):\n if seq[i] == 'Q':\n for j in range(i, len(seq)):\n if seq[j] == 'A':\n for k in range(j, len(seq)):\n if seq[i]+seq[j]+seq[k] == 'QAQ':\n cont += 1\nprint(cont)\n\n\t \t \t \t \t \t \t \t\t \t", "ll= input()\r\nt= 0\r\nxy=[i for i in range(len(ll)) if ll[i]==\"A\"]\r\nyx=[i for i in range(len(ll)) if ll[i]==\"Q\"]\r\nfor i in yx:\r\n for m in xy:\r\n if m>i:\r\n t+=ll[m:].count(\"Q\")\r\nprint(t)", "string = input()\r\ntotal = 0\r\nq = 0\r\n\r\nfor i in range(len(string)):\r\n if string[i] == 'Q':\r\n q += 1\r\n if string[i] == 'A':\r\n total += q * string[i:].count('Q')\r\n \r\nprint(total)", "# https://codeforces.com/problemset/problem/894/A\r\n\r\nstring = input()\r\nans = 0\r\n\r\nfor i in range(len(string)):\r\n if string[i] == \"Q\":\r\n for k in range(i, len(string)):\r\n if string[k] == \"A\":\r\n for l in range(k, len(string)):\r\n if string[l] == \"Q\":\r\n ans += 1\r\nprint(ans)", "s = input()\r\nn = len(s)\r\nif n==1 or n==2:\r\n print(0)\r\nelse:\r\n count = 0\r\n for i in range(n-2):\r\n for j in range(i+1,n-1):\r\n for k in range(j+1,n):\r\n if s[i]+s[j]+s[k]==\"QAQ\":\r\n count+=1\r\n print(count)\r\n", "s = input()\r\nt = \"QAQ\"\r\ndp = {}\r\n\r\ndef recur(i,j):\r\n if j == len(t):\r\n return 1\r\n if i == len(s):\r\n return 0\r\n \r\n if (i,j) in dp:\r\n return dp[(i,j)]\r\n\r\n ans = 0\r\n\r\n if s[i] == t[j]:\r\n ans += recur(i+1,j+1)\r\n \r\n ans += recur(i+1,j)\r\n\r\n dp[(i,j)] = ans\r\n\r\n return dp[(i,j)]\r\n\r\nprint(recur(0,0))", "a = input()\r\nq = 0\r\nd = 0\r\nwhile q != len(a):\r\n s = q\r\n while s != len(a):\r\n w = s\r\n while w != len(a):\r\n if a[q] == \"Q\" and a[s] == 'A' and a[w] == 'Q':\r\n d += 1\r\n w += 1\r\n s += 1\r\n q += 1\r\nprint(d)\r\n", "s = input()\r\ns_new = ''\r\nstart_A = False\r\nfor el in s:\r\n if el == 'Q':\r\n s_new += el\r\n start_A = True\r\n elif el == 'A' and start_A:\r\n s_new += el\r\nqa = 0\r\nfree_q = 0\r\nall_q = 0\r\ncnt = 0\r\nfor el in s_new:\r\n if el == 'Q':\r\n free_q += 1\r\n all_q += 1\r\n cnt += qa\r\n else:\r\n free_q = 0\r\n qa += all_q\r\nprint(cnt)\r\n", "seq = input()\r\nn = seq.count('A')\r\nans = 0\r\nfor i in range(n):\r\n\ta = seq.index('A')\r\n\tbefore = seq[:a]\r\n\tafter = seq[a:]\r\n\tm = before.count('Q')\r\n\tn = after.count('Q')\r\n\tans += (m*n)\r\n\tseq = seq[:a]+seq[(a+1):]\r\nprint(ans)", "from itertools import combinations\r\nn = input()\r\nans = 0\r\nfor i in combinations (n,3):\r\n if i == (\"Q\", \"A\", \"Q\"):\r\n ans+=1\r\nprint(ans)", "a = input()\r\ncount = 0\r\nfor i in range(len(a)):\r\n if a[i]==\"Q\":\r\n for j in range(i, len(a)):\r\n if a[j]==\"A\":\r\n for k in range(j, len(a)):\r\n if a[k]==\"Q\":\r\n count+=1\r\nprint(count)", "s = input()\r\nn = len(s)\r\n\r\ndp = [0] * n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(0,i):\r\n if s[i] == \"A\" and s[j] == \"Q\":\r\n dp[i] += 1\r\n if s[i] == \"Q\":\r\n ans += dp[j]\r\n \r\nprint(ans) ", "'''input\r\nQAQQQZZYNOIWIN\r\n'''\r\n'''\r\nAuthor : dhanyaabhirami\r\nGreat things never come from comfort zones\r\n'''\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter as ccd\r\nfrom itertools import permutations as pp\r\nfrom itertools import combinations as cc\r\nfrom random import randint as rd\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nimport heapq as hq\r\nimport math \r\n\r\nmod=pow(10,9) +7\r\ndef inp(flag=0):\r\n if flag==0:\r\n return list(map(int,input().strip().split(' ')))\r\n else:\r\n return int(input())\r\n\r\n# Code credits\r\n# assert(debug()==true)\r\n# for _ in range(int(input())):\r\n\r\ndef count_recursion(i,j):\r\n\tif j==len(target):\r\n\t\treturn 1\r\n\tif i==len(source):\r\n\t\treturn 0\r\n\tif source[i]==target[j]:\r\n\t\treturn count_recursion(i+1,j+1)+count_recursion(i+1,j)\r\n\telse:\r\n\t\treturn count_recursion(i+1,j)\r\n\r\nsource = input().strip()\r\ntarget = 'QAQ'\r\nprint(count_recursion(0,0))\r\n", "# 0 -> how many a's after?\r\n# 1 -> how many q's after?\r\n\r\n\r\nfrom collections import deque\r\n\r\n\r\nline = input()\r\n\r\nq = deque()\r\na = deque()\r\nfor i in range(len(line)-1, -1, -1):\r\n c = line[i]\r\n if c == 'Q':\r\n q.appendleft((i, len(a)))\r\n if c == 'A':\r\n a.appendleft((i, len(q)))\r\n\r\ntotal = 0\r\nfor i, _ in q:\r\n for j, num_qs in a:\r\n if j < i:\r\n continue\r\n total += num_qs\r\n\r\nprint(total)\r\n", "stri=input()\r\nn=len(stri)\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if stri[i]=='Q' and stri[j]=='A' and stri[k]=='Q':\r\n cnt+=1\r\nprint(cnt)\r\n", "import math\r\n\r\nstring=input()\r\nn=len(string)\r\ntable=[0 for i in range(n)]\r\ncount=0\r\nfor i in range(n):\r\n if string[i]==\"Q\":\r\n count+=1\r\n table[i]=count\r\nresult=0\r\ntotal=table[n-1]\r\nfor i in range(n):\r\n if string[i]==\"A\":\r\n result+=(table[i]*(total-table[i]))\r\nprint(result)", "str1 = input()\r\nlist1 = []\r\nans = 0\r\nlist1[:0] = str1\r\nfor x in range(len(list1)):\r\n for y in range(x+1, len(list1)):\r\n for z in range(y+1, len(list1)):\r\n if(list1[x] == 'Q' and list1[y] == 'A' and list1[z] == 'Q'):\r\n ans += 1\r\nprint(ans)\r\n", "a = input()\r\nn = len(a)\r\nres = 0\r\nch = 0\r\np = a.count('Q')\r\nfor i in range(n):\r\n if a[i] == 'A':\r\n res += ch * (p - ch)\r\n elif a[i] == 'Q':\r\n ch += 1\r\nprint(res)", "n = input()\r\nb = len(n)\r\nc = 0\r\nfor i in range(b):\r\n for j in range(i + 1, b):\r\n for k in range(j + 1, b):\r\n if n[i] + n[j] + n[k] == \"QAQ\":\r\n c += 1\r\nprint(c)\r\n", "from itertools import combinations as c\r\ns, n = input(), 0\r\nfor a, b, c in c(s, 3):\r\n if a+b+c=='QAQ':n+=1 \r\nprint(n)", "s = input()\ncountQPassed = 0\ncountQNotPassed = len([x for x in s if x == 'Q'])\ncountRes = 0\n\nfor x in s:\n if x == 'A':\n countRes += countQPassed * countQNotPassed\n elif x == 'Q':\n countQPassed += 1\n countQNotPassed -= 1\n \nprint(countRes)\n\t\t \t \t \t\t \t\t\t \t\t\t\t\t\t\t \t\t\t\t", "string=input()\r\nn = len(string)\r\ncount = 0\r\nfor i in range(n):\r\n if string[i] == 'Q':\r\n for j in range(i+1, n):\r\n if string[j] == 'A':\r\n for k in range(j+1, n):\r\n if string[k] == 'Q':\r\n count += 1\r\n\r\nprint(count)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n str_ = input().rstrip()\r\n q_indices = []\r\n a_indices = []\r\n for indx, j in enumerate(str_):\r\n if j == 'Q':\r\n q_indices.append(indx)\r\n elif j == 'A':\r\n a_indices.append(indx)\r\n count = 0\r\n q_ = len(q_indices)\r\n a_ = len(a_indices)\r\n for k in range(q_ - 1):\r\n for l in range(a_):\r\n if a_indices[l] > q_indices[k]:\r\n for u in range(k + 1, q_):\r\n if q_indices[u] > a_indices[l]:\r\n count += 1\r\n output(str(count))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "arr = list(input().strip())\nl = len(arr)\nresult = 0\nfor i in range(l):\n if arr[i] == \"Q\":\n for j in range(i,l):\n if arr[j] == \"A\":\n for k in range(j,l):\n if arr[k] == \"Q\":\n result += 1\nprint(result)\n\t\t \t \t \t\t\t \t \t \t \t \t \t", "s = input() \r\ntarget = \"QAQ\"\r\n\r\ndp = [[0 for j in range(len(s))] for i in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(len(s)):\r\n if s[j] == target[i]:\r\n if i == 0:\r\n dp[i][j] = 1\r\n else:\r\n dp[i][j] = sum(dp[i-1][:j])\r\n#print(\"dp\", dp)\r\nprint(sum(dp[2]))", "s=input()\nx=''\nfor i in s:\n if i=='Q' or i=='A':\n x+=i\nrj=0\nd=len(x)\nfor i in range(d):\n if x[i]=='Q':\n for j in range(i,d):\n if x[j]=='A':\n for k in range(j,d):\n if x[k]=='Q':\n rj+=1\n \nprint(rj)\n\n\t\t \t \t\t\t \t\t\t \t\t \t\t\t \t \t \t\t", "s=input()\r\nres=0\r\nfor i in range(len(s)-2):\r\n for j in range(i+1,len(s)-1):\r\n for k in range(j+1,len(s)):\r\n if s[i]=='Q' and s[j]=='A' and s[k]=='Q':\r\n res+=1\r\nprint(res)", "from typing import List, Tuple\nfrom collections import defaultdict, deque, namedtuple\nfrom heapq import heappush as push, heappop as pop\nimport sys \n\nINF = (int)(1e9+7)\n\nsys.setrecursionlimit(INF)\n\n\ndef su(s):\n\n\tn = len(s)\n\tcnt = 0\n\tfor i in range(0, n-2):\n\t\tfor j in range(i+1, n-1):\n\t\t\tfor k in range(j+1, n):\n\n\t\t\t\tif s[i] == \"Q\" and s[j] == \"A\" and s[k] == \"Q\":\n\t\t\t\t\tcnt += 1\n\n\treturn cnt \n\n\ndef test(s):\n\n\tn = len(s)\n\n\tleft = [0] * n\n\tright = [0] * n\n\t\n\tif s[0] == 'Q': left[0] = 1\n\tfor i in range(1, n, 1):\n\t\tif s[i] == 'Q':\n\t\t\tleft[i] = left[i-1] + 1\n\t\t\tcontinue \n\t\tleft[i] = left[i-1]\n\n\tif s[n-1] == 'Q': right[n-1] = 1\n\tfor i in range(n-2, -1, -1):\n\t\tif s[i] == 'Q':\n\t\t\tright[i] = right[i+1] + 1\n\t\t\tcontinue \n\t\tright[i] = right[i+1]\n\n\tres = 0\n\tfor i in range(n):\n\t\tif s[i] == 'A':\n\t\t\tres += left[i] * right[i]\n\n\treturn res\n\nif __name__ == \"__main__\":\n\n\ts = input()\n\t# print(su(s))\n\tprint(test(s))\n", "l=input()\n\nl_qaq = []\nfor i in l :\n if i == \"Q\" or i == \"A\" :\n l_qaq.append(i)\n\ncount = 0\n\ncouple = []\nfor i in range(len(l_qaq)) :\n if l_qaq[i] == \"Q\" :\n for j in range(len(l_qaq)) :\n if j != i and l_qaq[j] == \"Q\" :\n small = i\n big = j\n if j < i :\n small = j\n big = i\n if str(small)+str(big) not in couple :\n couple.append(str(small)+str(big))\n for k in range(small+1, big) :\n if l_qaq[k] == \"A\" :\n count += 1\nprint(count)\n\t\t\t\t \t\t\t\t\t\t\t\t \t \t \t \t \t \t", "a=input()\r\ns=0\r\nfor i in range(len(a)):\r\n if a[i]=='Q':\r\n for j in range(i,len(a)):\r\n if a[j]=='A':\r\n for k in range(j,len(a)):\r\n if a[k]=='Q':\r\n s=s+1\r\nprint(s)\r\n \r\n", "s=input()\r\nl=list(s)\r\ncnt=0\r\nfor i in range(0,len(l)-2):\r\n if l[i] == 'Q':\r\n for j in range(i,len(l)-1):\r\n if l[j] =='A':\r\n for k in range(j,len(l)):\r\n if l[k] =='Q' :\r\n cnt+=1\r\n\r\nprint(cnt)", "s = input()\r\nn = len(s)\r\n\r\nq=0\r\nqa=0\r\nresult =0\r\nfor i in s:\r\n if i=='Q':\r\n result += qa\r\n q += 1\r\n elif i=='A':\r\n qa += q\r\n\r\nprint(result)", "s = ''\r\nfor let in input():\r\n\tif let in ['Q','A']:\r\n\t\ts += let\r\ni = 0\r\nn = len(s)\r\ncnt = 0\r\nwhile i < n - 2:\r\n\tif s[i] == 'Q':\r\n\t\tj = i+1\r\n\t\twhile j < n - 1:\r\n\t\t\tif s[j] == 'A':\r\n\t\t\t\tk = j + 1\r\n\t\t\t\twhile k < n:\r\n\t\t\t\t\tif s[k] == 'Q':\r\n\t\t\t\t\t\tcnt += 1\r\n\t\t\t\t\tk += 1\r\n\t\t\tj += 1\r\n\ti += 1\r\nprint(cnt)", "m = input()\r\nans = 0\r\nfor i in range(len(m)):\r\n if m[i]=='Q':\r\n c_a = 0\r\n for j in range(i, len(m)):\r\n if m[j]=='A':\r\n c_a+=1\r\n elif m[j]=='Q':\r\n ans+=c_a\r\nprint(ans)", "from collections import deque\nfrom heapq import *\nimport sys\nsys.setrecursionlimit(5005)\nmod = 1000000007\ntime = 0\n\ndef solve():\n\ts = input()\n\tn = len(s)\n\tdp = [[0,0,0] for i in range(n)]\n\tif s[0]=='Q':\n\t\tdp[0][0] = 1\n\tfor i in range(1,n):\n\t\tif s[i]=='Q':\n\t\t\tdp[i][2] = dp[i-1][2]+dp[i-1][1]\n\t\t\tdp[i][0] = dp[i-1][0]+1\n\t\t\tdp[i][1] = dp[i-1][1]\n\t\telif s[i]=='A':\n\t\t\tdp[i][1] = dp[i-1][1]+dp[i-1][0]\n\t\t\tdp[i][0] = dp[i-1][0]\n\t\t\tdp[i][2] = dp[i-1][2]\n\t\telse:\n\t\t\tdp[i][0] = dp[i-1][0]\n\t\t\tdp[i][1] = dp[i-1][1]\n\t\t\tdp[i][2] = dp[i-1][2]\n\tprint(dp[n-1][2])\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nt = 1\n#t = int(input())\n\nfor i in range(t):\n\tsolve()", "s = list(input())\r\n\r\nans = 0\r\nn = len(s)\r\nfor i in range(n-1, -1, -1):\r\n if s[i] != 'Q' and s[i] != 'A':\r\n s.pop(i)\r\n\r\nn = len(s)\r\nfor i in range(n-2):\r\n if s[i] == 'Q':\r\n for j in range(i+1, n-1):\r\n if s[j] == 'A':\r\n for k in range(j+1, n):\r\n if s[k] == 'Q':\r\n ans += 1\r\n\r\nprint(ans)", "n=input()\r\nout=0\r\nfor i in range(len(n)):\r\n for j in range(i+1,len(n)):\r\n for k in range(j+1,len(n)):\r\n if n[i]=='Q' and n[j]=='A' and n[k]=='Q':\r\n out+=1\r\nprint(out)\r\n", "s = input()\r\nd = 0\r\nfor i in range(len(s)-2):\r\n\tfor j in range(i+1,(len(s)-1)):\r\n\t\tfor k in range(j+1,len(s)):\r\n\t\t\tif s[i]+s[j]+s[k]=='QAQ':\r\n\t\t\t\td+=1\r\nprint(d)\r\n\r\n\r\n", "import math\r\nfrom traceback import print_tb;\r\n\r\ndef getArray():\r\n arr=[int(ai) for ai in input().split()];\r\n return arr;\r\n\r\n\r\ndef solve(): \r\n s=input()\r\n a=[]\r\n cnt=0\r\n for i in range(0,len(s)):\r\n if s[i]=='Q':\r\n cnt+=1\r\n a.append(cnt)\r\n ans=0\r\n for i in range(0,len(s)):\r\n if s[i]=='A':\r\n ans+=(cnt-a[i])*(a[i])\r\n print (ans)\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n pass\r\n\r\n\r\nt=1\r\n#t=int(input());\r\nfor i in range(0,t):\r\n solve()", "def main():\r\n data = input()\r\n prefix = [0] * len(data)\r\n if data[0] == 'Q':\r\n prefix[0] = 1\r\n for i in range(1, len(data)):\r\n if data[i] == 'Q':\r\n prefix[i] = prefix[i-1] + 1\r\n else:\r\n prefix[i] = prefix[i-1]\r\n ans = 0\r\n for i in range(1, len(data) - 1):\r\n if data[i] == 'A':\r\n ans += prefix[i] * (prefix[-1] - prefix[i])\r\n print(ans)\r\n\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "s = input()\nqr = s.count('Q')\nql = 0\nans = 0\nfor x in s:\n if x == 'Q':\n ql += 1\n qr -= 1\n if x == 'A':\n ans += ql * qr\nprint(ans)\n", "s = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n a, b = 0, 0\r\n for j in range(i-1, -1, -1):\r\n if s[j] == 'Q':\r\n a += 1\r\n for j in range(i+1, len(s)):\r\n if s[j] == 'Q':\r\n b += 1\r\n count += a * b\r\nprint(count)\r\n", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10,pi\r\n# from functools import cmp_to_key\r\n\r\n\r\ns=' '+input()+' '\r\nn=len(s)-2\r\nN=n+10\r\nf1=[0]*N;f2=[0]*N\r\nfor i in range(1,n+1):\r\n f1[i]=f1[i-1]+(s[i-1]=='Q')\r\nfor i in range(n,0,-1):\r\n f2[i]=f2[i+1]+(s[i+1]=='Q')\r\nans=0\r\nfor i in range(1,n+1):\r\n if s[i]=='A':\r\n ans+=f1[i]*f2[i]\r\nprint(ans)", "n = list(input())\n\nc = 0\n\nfor i in range(len(n)):\n for j in range(i,len(n)):\n for k in range(j,len(n)):\n if n[i]+n[j]+n[k]==\"QAQ\":\n c+=1\nprint(c)", "k=input()\ns=0\nfor i in range(len(k)):\n if k[i] == 'A':\n qsb=k[0:i].count('Q')\n qsa=k[i+1: ].count('Q')\n if qsb!=0 and qsa!=0:\n if qsb==1 or qsa==1:\n s+=(qsb+qsa-1)\n else:\n s+=(qsb*qsa)\nprint(s)\n\n\n", "# https://codeforces.com/problemset/problem/894/A\r\n\r\ns, ans = [char for char in input() if char == 'Q' or char == 'A'], 0\r\n\r\nfor idx, char in enumerate(s):\r\n if char == 'Q':\r\n for i in range(idx+1, len(s)):\r\n if s[i] == 'A':\r\n ans += s[i+1:len(s)].count('Q')\r\n\r\nprint(ans)", "s=input()\r\nc=0\r\ntry:\r\n q=s.index(\"Q\")\r\n for i in range(q,len(s)):\r\n if s[i]==\"A\":\r\n k=s[i:].count(\"Q\")\r\n l=s[:i].count(\"Q\")\r\n c+=l*k\r\n print(c)\r\nexcept Exception:\r\n print(0)\r\n \r\n \r\n \r\n", "input_string = input()\r\nlength_string = len(input_string)\r\n# dp = [0]*length_string # for a stores number of qs after it for q stores number of as after it\r\nq_count = 0\r\naq_count = 0\r\nans = 0\r\nfor i in range(length_string-1, -1, -1):\r\n if input_string[i] == 'A':\r\n aq_count += q_count\r\n elif input_string[i] == 'Q':\r\n ans += aq_count\r\n q_count += 1\r\n\r\nprint(ans)", "s=input()\r\nn=0\r\nfor i in range(0,len(s)):\r\n if s[i]=='Q':\r\n for j in range(i,len(s)):\r\n if s[j]=='A':\r\n for k in range(j,len(s)):\r\n if s[k]=='Q':\r\n n+=1\r\nprint(n)\r\n", "import sys\r\nimport re\r\n\r\ndef axe():\r\n s = re.sub(r'[^QA]', '', sys.stdin.read()).strip('A')\r\n c = 0\r\n axs = [i for i,j in enumerate(s) if j == 'A']\r\n qxs = [i for i,j in enumerate(s) if j == 'Q']\r\n for i in qxs:\r\n for j in axs:\r\n if i < j: c += sum(i > j for i in qxs)\r\n return c\r\n \r\nprint(axe())\r\n\r\n \r\n", "n = input()\r\ni=0\r\nres=0\r\nwhile i<len(n):\r\n j=i+1\r\n while j<len(n):\r\n x = j+1\r\n while x<len(n):\r\n if n[i] =='Q' and n[j] =='A' and n[x] =='Q':\r\n res+=1\r\n x+=1\r\n j+=1\r\n i+=1\r\nprint(res)\r\n \r\n\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n-2):\r\n for j in range(i+1, n-1):\r\n for k in range(j+1, n):\r\n if s[i] + s[j] + s[k] == 'QAQ':\r\n ans += 1\r\nprint(ans)", "s = input()\r\nans = 0\r\nfor i, x in enumerate(s):\r\n if x == 'Q':\r\n for j in range(i + 1, len(s)):\r\n if s[j] == 'A':\r\n for k in range(j + 1, len(s)):\r\n if s[k] == 'Q':\r\n ans += 1\r\nprint(ans)", "arr = input()\r\n\r\nlength = len(arr)\r\n\r\ncount = 0\r\n\r\nfor i in range (0,length):\r\n if arr[i] == \"Q\":\r\n for j in range (i+1,length):\r\n if arr[j] == \"A\":\r\n for k in range (j+1,length):\r\n if arr[k] == \"Q\":\r\n count+=1 \r\n\r\nprint (count)\r\n", "string = input()\r\nsubstring = 'QAQ'\r\nres = []\r\ncount = 0\r\nfor i in range(len(string)-1):\r\n if string[i] == 'Q':\r\n for j in range(i+1, len(string)):\r\n if string[j] == 'A':\r\n for k in range(j, len(string)):\r\n if string[k] == 'Q':\r\n count += 1\r\n res.append(string[i]+string[j]+string[k])\r\nprint(len(res))\r\n\r\n", "n1 = input()\r\nfinalstr = \"\"\r\ndp = {}\r\nlength = 0\r\nindex_A = []\r\nfor i in n1:\r\n if i == \"Q\" or i == \"A\":\r\n finalstr+=i\r\n length+=1\r\n if i == \"A\":\r\n index_A.append(length-1)\r\n\r\nfor i in range(length):\r\n dp[i] = 0\r\n \r\nif length > 0:\r\n if finalstr[0] == \"Q\":\r\n dp[0] = 1\r\n else:\r\n dp[0] = 0\r\n \r\n for i in range(1,length):\r\n if finalstr[i] == \"Q\":\r\n dp[i] += 1\r\n dp[i] += dp[i-1]\r\n else:\r\n dp[i] += dp[i-1]\r\n \r\n count = 0\r\n for i in index_A:\r\n before = dp[i]\r\n after = dp[length-1] - dp[i]\r\n count += before*after\r\n \r\n print(count)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n\r\n", "s = str(input())\r\n\r\ncount = 0\r\nfor i in str(s):\r\n count += 1\r\ncQ = 0\r\ncA = 0\r\nqaq = ['' for i in range(count)]\r\na = 0\r\nfor i in str(s):\r\n if i == 'Q' or i == \"A\":\r\n qaq[a] = i\r\n a += 1\r\n else:\r\n pass\r\n\r\nans = 0\r\nfor i in range(count):\r\n if qaq[i] == \"Q\":\r\n for j in range(i+1,count):\r\n if qaq[j] ==\"A\":\r\n for k in range(j+1, count):\r\n if qaq[k] == \"Q\":\r\n ans += 1\r\n\r\nprint(ans)", "def find_QAQ2():\n str = input()\n if (len(str) < 1) or (len(str) > 100):\n exit()\n counter = 0\n Q = str.count('Q')\n count_Q = 0\n for i in range(len(str)):\n if str[i] == 'Q':\n count_Q += 1\n if str[i] == 'A':\n counter += count_Q*(Q-count_Q)\n print(counter)\nfind_QAQ2()\n\t\t \t\t \t\t\t \t\t \t \t\t\t\t \t \t \t\t", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n#####################################################################\r\na = input()\r\ncount = 0\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n for k in range(len(a)):\r\n if i < j and i < k and j < k and a[i] == 'Q' and a[j] == 'A' and a[k] == 'Q':\r\n count +=1\r\nprint(count)\r\n", "s=input()\r\nl=len(s)\r\nr=0\r\nfor i in range(l):\r\n if s[i]==\"A\":\r\n left=i-1\r\n q1,q2=0,0\r\n right=i+1\r\n while left>=0:\r\n if s[left]==\"Q\":\r\n q1+=1\r\n left-=1\r\n while right<l:\r\n if s[right]==\"Q\":\r\n q2+=1\r\n right+=1\r\n r+=q1*q2\r\nprint(r)", "st = input()\nnew_st = str([i for i in st if i == 'Q' or i == 'A'])\noutput_value = 0\nfor i in range(len(new_st)):\n if new_st[i] == 'Q':\n for j in range(i, len(new_st)):\n if new_st[j] == 'A':\n output_value += new_st.count('Q', j + 1, len(new_st))\n\nprint(output_value)\n\n", "s=input()\r\na=0\r\nb=0\r\nans=0\r\nfor i in s:\r\n if(i=='Q'):\r\n ans+=b\r\n a+=1\r\n elif(i=='A'):\r\n b+=a\r\nprint(ans)", "#Problema G\n\na = input()\ntotal = 0\nfor i in range(len(a)):\n if (a[i]=='Q'):\n b = a[i:len(a)]\n for j in range (len(b)):\n if (b[j]=='A'):\n c = b[j:len(b)]\n for k in range (len(c)):\n if (c[k]=='Q'):\n total =total+1\nprint(total)\n\n \t \t \t \t\t\t\t\t \t\t\t\t\t\t \t \t", "def check_str(inpt_str: str):\n cntr = 0\n for i in range(len(inpt_str)):\n if inpt_str[i] == 'A':\n cntr += inpt_str[:i].count('Q')* inpt_str[i+1:].count('Q')\n print(cntr)\ndef main():\n inpt_str = input()\n check_str(inpt_str)\n\nif __name__ == '__main__':\n main() \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 ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM :A. QAQ\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\nn=input()\r\nr,q,a=0,0,0\r\nfor i in range(len(n)):\r\n if n[i]==\"Q\":\r\n q+=1\r\n r+=a\r\n elif n[i]==\"A\":\r\n a+=q\r\nprint(r)", "f = str(input())\r\na = list(f)\r\ncount = 0\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n for k in range(len(a)):\r\n if (a[i] == \"Q\" and a[j] == \"A\" and a[k] == \"Q\") and (k>j and j>i):\r\n count+=1\r\nprint(count)", "### Implementation that can be used for generic patterns\nchar_list = [char for char in input()]\npattern = [char for char in \"QAQ\"]\n\nseen_prefix = [0] * len(pattern)\nfor letter in char_list:\n\tfor p_i in range(0, len(pattern)):\n\t\tif pattern[p_i] == letter:\n\t\t\tif p_i == 0:\n\t\t\t\tseen_prefix[p_i] += 1\n\t\t\telse:\n\t\t\t\tseen_prefix[p_i] += seen_prefix[p_i-1]\n\nprint(seen_prefix[-1])\n\n### Optimial implementation with 1 pass\n#char_list = [char for char in input()]\n#\n#q_seen = 0\n#qa_seen = 0\n#qaq_seen = 0\n#for letter in char_list:\n#\tif letter == 'Q':\n#\t\tq_seen += 1\n#\t\tqaq_seen += qa_seen\n#\telif letter == 'A':\n#\t\tqa_seen += q_seen\n#\n#print(qaq_seen)\n\n\n### NAIVE (non-brute force) IMPLEMENTATION with 3 passes trough list\n\n#char_list = [char for char in input()]\n#\n#q_before = [0] * len(char_list)\n#q_before[0] = 1 if char_list[0] == 'Q' else 0\n#for i in range(1, len(char_list)):\n#\tq_before[i] = q_before[i-1]\n#\tif char_list[i] == 'Q':\n#\t\tq_before[i] += 1\n#\n#qa_before = [0] * len(char_list)\n#for i in range(1, len(char_list)):\n#\tqa_before[i] = qa_before[i-1]\n#\tif char_list[i] == 'A':\n#\t\tqa_before[i] += q_before[i-1]\n#\n#\n#qaq_count = 0\n#for i in range(2, len(char_list)):\n#\tif char_list[i] == \"Q\":\n#\t\tqaq_count += qa_before[i]\n#\n#print(qaq_count)\n", "MAX = 1 << 20\r\nwhile True:\r\n try:\r\n str0 = input()\r\n sum1 = [0] * 200\r\n num = 0\r\n for i in range(len(str0)):\r\n if str0[i] == 'Q':\r\n num += 1\r\n sum1[i] = num\r\n result = 0\r\n for i in range(len(str0)):\r\n if str0[i] == 'A':\r\n result += sum1[i] * (sum1[len(str0) - 1] - sum1[i])\r\n print(result)\r\n except:\r\n break", "string = input()\nstarting_index = 0\ncounter = 0\nwhile starting_index<len(string):\n if string[starting_index]==\"Q\":\n for j in range(starting_index+1,len(string)):\n if string[j]==\"A\":\n for k in range(j+1,len(string)):\n if string[k]==\"Q\":\n counter+=1\n starting_index+=1\nprint(counter)", "s = input()\r\nl = len(s)\r\nt = 0\r\nfor i in range(l):\r\n for j in range(i + 1, l):\r\n for k in range(j + 1, l):\r\n if s[i] == \"Q\" and s[j] == \"A\" and s[k] == \"Q\":\r\n t += 1\r\n\r\nprint(t)", "string = input()\n\nq = []\na = []\n\nfor i in range(len(string)):\n if string[i] == 'Q':\n q.append(i)\n elif string[i] == 'A':\n a.append(i)\n\nresult = 0\n\nfor i in range(len(q)):\n for j in range(len(a)):\n if a[j] > q[i]:\n for k in range(i+1, len(q)):\n if q[k] > a[j]:\n result = result + 1\n\nprint(result)\n \t \t\t\t\t \t\t \t\t \t \t", "s=input()\nn=len(s)\nans=0\nfor ii in range(n-2):\n if s[ii]==\"Q\":\n for jj in range(ii+1,n-1):\n if s[jj]==\"A\":\n for kk in range(jj+1,n):\n if s[kk]==\"Q\":\n ans+=1\nprint(ans)\n \t\t\t \t \t \t \t \t \t \t \t\t\t", "def QAQ():\n entry = input()\n qtdd_a = 0\n seg = []\n for c in entry:\n if c=='A':\n qtdd_a += 1\n elif c=='Q':\n seg.append(qtdd_a)\n qtdd_a = 0\n\n soma = 0\n exp = 0\n for i in range(len(seg)):\n exp += i*seg[i]\n soma += exp\n \n print(soma)\n\ndef count_stuff(s):\n n_a = 0\n n_q = 0\n for c in s:\n if(c=='A'):\n n_a+=1\n elif(c=='Q'):\n n_q+=1\n return n_q,n_a\n\nQAQ()\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 Mon Jul 6 21:05:44 2020\r\n\r\n@author: Олег\r\n\"\"\"\r\n\r\n\r\ninp = input()\r\na = ''\r\nn = 0\r\nqc = ac = 0\r\nal = []\r\nfor i in range(len(inp)):\r\n if inp[i] == 'Q':\r\n a += 'q'\r\n qc += 1\r\n if inp[i] == 'A':\r\n a += 'a'\r\n n += 1\r\n ac += 1\r\n al.append(i)\r\n#print(al) ;\r\nres = 0\r\nfor i in al:\r\n res += inp[0:i].count(\"Q\") * inp[i+1:].count(\"Q\")\r\nprint(res)", "t = list(input())\r\ncry=0\r\nfor i in range(len(t)):\r\n\tif t[i] == \"Q\":\r\n\t\tfor j in range(i,len(t)):\r\n\t\t\tif t[j]==\"A\":\r\n\t\t\t\tfor k in range(j,len(t)):\r\n\t\t\t\t\tif t[k]==\"Q\":\r\n\t\t\t\t\t\tcry +=1\r\nprint (cry)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 23 21:45:06 2023\r\n\r\n@author: rohan\r\n\"\"\"\r\n\r\ns = input()\r\nn = len(s)\r\n\r\ndp = [[-1 for i in range(n)] for i in range(n)]\r\ndef solve(i, c):\r\n if c == 3:\r\n return 1\r\n \r\n if i >= n:\r\n return 0\r\n \r\n if dp[i][c] != -1:\r\n return dp[i][c] \r\n\r\n t1 = t2 = 0\r\n if c == 0 and s[i] == \"Q\":\r\n t1 = solve(i+1, 1)\r\n elif c == 1 and s[i] == \"A\":\r\n t1 = solve(i+1, 2)\r\n elif c == 2 and s[i] == \"Q\":\r\n t1 = solve(i+1, 3)\r\n \r\n t2 = solve(i+1, c)\r\n \r\n dp[i][c] = t1 + t2\r\n return dp[i][c]\r\n\r\nprint(solve(0, 0))", "s = input()\nq= 0\na= 0\nsemua_a = []\nfor i in s:\n if i=='Q':\n q+=1\n elif i=='A':\n a+=1\n semua_a.append(q)\n q=0\nif q>0:\n semua_a.append(q)\ntotal = 0\nleft = 0\nright = sum(semua_a)\nfor i in range(len(semua_a)-1):\n right-=semua_a[i]\n left+=semua_a[i]\n total+=left*right\nprint(total)", "import math\r\ns=input()\r\nl='QAQ'\r\nc=0\r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)):\r\n for k in range(j+1,len(s)):\r\n if(s[i]+s[j]+s[k]=='QAQ'):\r\n c+=1\r\nprint(c)\r\n", "import itertools\n\ncount = 0\n\nfor a, b, c in itertools.combinations(input(), 3):\n if a == c == 'Q' and b == 'A':\n count += 1\n\nprint(count)\n", "def lcs(a, pat):\r\n m = len(a)\r\n n = len(pat)\r\n dp = [[0 for i in range(n+1)] for i in range(m+1)]\r\n for i in range(m+1):\r\n dp[i][0] = 1\r\n for i in range(1,m+1):\r\n for j in range(1,n+1):\r\n if a[i-1] == pat[j-1]:\r\n dp[i][j] = dp[i-1][j-1]+dp[i-1][j]\r\n else:\r\n dp[i][j] = dp[i-1][j]\r\n return dp[m][n]\r\n \r\n \r\n \r\ns = input()\r\npat = \"QAQ\"\r\nprint(lcs(s, pat))", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n if s[i] == 'Q':\r\n j=i+1\r\n count_A=0\r\n while(j<n):\r\n if s[j]=='A':\r\n count_A+=1\r\n elif s[j]=='Q':\r\n ans+=count_A\r\n j+=1\r\nprint(ans)", "s = input()\r\ndp = [0] * len(s)\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n for j in range(i + 1, len(s)):\r\n if s[j] == 'A':\r\n for k in range(j + 1, len(s)):\r\n if s[k] == 'Q':\r\n dp[k] += 1\r\n\r\nprint(sum(dp))", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n if(s[i]=='A'):\r\n c=c+(s[:i].count('Q'))*(s[i+1:].count('Q'))\r\nprint(c)\r\n", "import re\r\ndef cnt(a,b):\r\n m=len(a)\r\n n=len(b)\r\n lookup=[[0]*(n+1) for i in range(m+1)]\r\n for i in range(n+1):\r\n lookup[0][1]=0\r\n for i in range(m+1):\r\n lookup[i][0]=1\r\n for i in range(1,m+1):\r\n for j in range(1,n+1):\r\n if(a[i-1]==b[j-1]):\r\n lookup[i][j]=lookup[i-1][j-1]+lookup[i-1][j]\r\n else:\r\n lookup[i][j]=lookup[i-1][j]\r\n return lookup[m][n]\r\nif(__name__=='__main__'):\r\n s=input()\r\n index=0\r\n curr=\"\"\r\n s=re.sub('[^AQ]+', '', s)\r\n #print(s)\r\n print(cnt(s,\"QAQ\"))\r\n", "string = input ()\r\ncount = 0\r\nfor i in range (len (string)):\r\n if string [i] == 'Q':\r\n for j in range (i + 1, len (string)):\r\n if string [j] == 'A':\r\n for k in range (j + 1, len (string)):\r\n if string [k] == 'Q':\r\n count += 1\r\nprint (count)\r\n", "s = input()\nans = 0\nq = 0\nfor i in range(len(s)):\n\n if s[i] == 'Q':\n q += 1\n\n if s[i] == 'A':\n ans+= q * s[i+1:].count('Q')\nprint(ans)", "s = input()\r\nl = len(s)\r\nres = 0\r\nfor i in range(l-2) :\r\n for j in range(i+1,l-1) :\r\n for k in range(j+1,l) :\r\n if s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q' :\r\n res += 1\r\nprint(res)", "from itertools import combinations\r\na=input()\r\ns=0\r\nfor i in combinations(a,3):\r\n z=i\r\n if z[0]=='Q' and z[1]=='A' and z[2]=='Q':\r\n s+=1\r\nprint(s)\r\n \r\n \r\n", "import re\r\n\r\ns = input()\r\nq_indices = [m.start() for m in re.finditer('Q', s)]\r\na_indices = [m.start() for m in re.finditer('A', s)]\r\nresult = 0\r\nfor i in a_indices:\r\n q_no = len(q_indices)\r\n before_a = -1\r\n for j in range(q_no):\r\n if q_indices[j] > i:\r\n before_a = j\r\n break\r\n if before_a > 0:\r\n after_a = q_no - before_a\r\n result += after_a * before_a\r\nprint(result)", "string = input()\r\n\r\ncount = 0\r\nlength = len(string)\r\nfor i in range(length):\r\n if string[i] == 'Q':\r\n for j in range(i, length):\r\n if string[j] == 'A':\r\n for k in range(j, length):\r\n if string[k] == 'Q':\r\n count += 1\r\n\r\nprint(count)\r\n", "s=list(input())\r\nl=len(s)\r\nq=0\r\nqa=0\r\nqaq=0\r\n \r\nfor i in s:\r\n\tif i=='Q':\r\n\t\tq+=1\r\n\t\tqaq+=qa\r\n\telif i=='A':\r\n\t\tqa+=q\r\n \r\nprint(qaq)", "def count_mathes(s):\n #QAQ counts\n count = 0\n count_Q_first = 0\n count_Q_all = s.count('Q')\n for i, s_i in enumerate(s):\n if s_i == 'Q':\n count_Q_first += 1\n if s_i == 'A':\n count += count_Q_first * (count_Q_all - count_Q_first)\n return count\n\ns = input()\nprint(count_mathes(s))\n \t\t \t \t \t\t \t\t \t\t\t \t\t\t", "s = input()\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n cnt += s[:i].count('Q') * s[i:].count('Q')\r\n\r\nprint(cnt)", "k=input()\r\nsum=0\r\nfor i in range(len(k)):\r\n if k[i]==\"A\":\r\n sum+=k[:i].count(\"Q\")*k[i:].count(\"Q\")\r\nprint(sum)", "line = input()\r\n\r\nres = 0\r\n\r\nfor i in range(len(line)):\r\n if line[i] == 'Q':\r\n for j in range(i, len(line)):\r\n if line[j] == 'A':\r\n for k in range(j, len(line)):\r\n if line[k] == 'Q':\r\n res += 1\r\nprint(res)", "s = input()\r\nN = len(s)\r\nL, R = [0] * (N + 1), [0] * (N + 1)\r\nfor i in range(1, N + 1):\r\n L[i] = L[i - 1]\r\n if s[i - 1] == 'Q':\r\n L[i] += 1\r\n\r\nfor i in range(N - 1, -1, -1):\r\n R[i] = R[i + 1]\r\n if s[i] == 'Q':\r\n R[i] += 1\r\n\r\nans = 0\r\nfor i in range(1, N - 1):\r\n if s[i] == 'A':\r\n ans += L[i] * R[i + 1]\r\nprint(ans)", "s=input()\r\na=list(0 for i in range(3))\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n a[0],a[2]=a[0]+1,a[2]+a[1]\r\n if s[i]=='A':\r\n a[1]+=a[0]\r\nprint(a[2])\r\n \r\n \r\n \r\n", "#QAQ\r\ns=input()\r\np,q,c=0,0,0\r\nfor i in s:\r\n if(i=='Q'):\r\n p+=1\r\nfor i in s:\r\n if(i=='Q'):\r\n q+=1\r\n p-=1\r\n if(i=='A'):\r\n c+=p*q\r\nprint(c) \r\n ", "s = input()\r\ns = list(filter(lambda x: x in {'A', 'Q'}, s))\r\ncnt = 0\r\nfor i in range(len(s) - 2):\r\n for j in range(i + 1, len(s) - 1):\r\n for k in range(j + 1, len(s)):\r\n if s[i] in 'Q' and s[j] in 'A' and s[k] in 'Q':\r\n cnt += 1\r\nprint(cnt)", "from itertools import combinations as c\r\nans = 0\r\nfor i in c(input(), 3):\r\n ans += (\"\".join(i) == \"QAQ\")\r\nprint(ans)", "a = str(input())\nb = 'QAQ'\nm, n = len(a), len(b)\n\nt = [[0 for x in range(n + 1)] for i in range(m + 1)]\n\nfor i in range(n + 1): t[0][i] = 0\nfor i in range(m + 1): t[i][0] = 1\n\nfor i in range(1, m + 1):\n for j in range(1, n + 1):\n if a[i - 1] == b[j - 1]: t[i][j] = t[i - 1][j - 1] + t[i - 1][j]\n else: t[i][j] = t[i - 1][j]\n\nprint(t[m][n])\n \t\t \t\t \t \t\t \t \t \t \t \t", "def QAQcounter(S):\r\n m=len(S)\r\n dp = [[0 for i in range(3) ]for _ in range(m )]\r\n if S[0]=='Q':\r\n dp[0][0]=1\r\n for i in range(1,m):\r\n if S[i]=='A':\r\n # The number of Qs and QAQs will not change.\r\n dp[i][0]=dp[i-1][0]\r\n dp[i][2]=dp[i-1][2]\r\n # Checks if there was any Q before this character in the string.\r\n if dp[i-1][0]>=1:\r\n # If there was Q before the A so it makes (more) QAs so the number of current QA is equal to the number of previous QAs + the number of all Qs present in the string[0:i]. That is because the A will make all the previous Qs, and QA.\r\n dp[i][1]=dp[i-1][1]+dp[i-1][0]\r\n elif S[i]=='Q':\r\n #The number of QAs will not change but the number of Qs will increase by 1.\r\n dp[i][0]=dp[i-1][0]+1\r\n dp[i][1]=dp[i-1][1]\r\n # Checks if there was any QA before this character in the string\r\n if dp[i-1][1]>=1:\r\n # Same as counting QAs.\r\n dp[i][2]=dp[i-1][2]+dp[i-1][1]\r\n else:\r\n # If the character is not Q or A, the number of Qs, QAs, and QAQs will be the same as before.\r\n dp[i][0]=dp[i-1][0]\r\n dp[i][1]=dp[i-1][1]\r\n dp[i][2] = dp[i - 1][2]\r\n return dp[m-1][2]\r\n\r\n\r\ns=input()\r\nprint(QAQcounter(s))", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n for j in range(i):\r\n for k in range(j):\r\n if s[k]==\"Q\" and s[j]==\"A\" and s[i]==\"Q\":\r\n ans+=1\r\nprint(ans)", "s = input()\r\nt = \"QAQ\"\r\nm = len(s)\r\nn = len(t)\r\n\r\ndp = [[0] * (n + 1) for _ in range(m + 1)]\r\n\r\nfor i in range(m + 1):\r\n dp[i][0] = 1\r\n\r\nfor i in range(1, m + 1):\r\n for j in range(1, n + 1):\r\n if s[i - 1] == t[j - 1]:\r\n dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1]\r\n else:\r\n dp[i][j] = dp[i - 1][j]\r\n \r\nprint(dp[-1][-1])", "# Anuneet Anand\n\ns = input()\nn = len(s)\nm = 0\nfor i in range(n):\n\tfor j in range(i+1,n):\n\t\tfor k in range(j+1,n):\n\t\t\tif s[i]==\"Q\" and s[j]==\"A\" and s[k]==\"Q\":\n\t\t\t\tm +=1\n\nprint(m)", "s = input()\r\ncnt = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] != 'Q':\r\n continue\r\n for j in range(i + 1, len(s)):\r\n if s[j] != 'A':\r\n continue\r\n for k in range(j + 1, len(s)):\r\n if s[k] == 'Q':\r\n cnt += 1\r\n\r\nprint(cnt)", "s=input()\r\nn=len(s)\r\nc=0\r\npre=[]\r\npre.append(0)\r\nsuf=[]\r\nfor i in range(n-1):\r\n if s[i]=='Q':\r\n c+=1\r\n pre.append(c)\r\n \r\n# for i in range(n-2):\r\n# if s[i]=='Q':\r\n# for j in range(i+1,n-1):\r\n# if s[j]=='A':\r\n# for k in range(j+1,n):\r\n# if s[k]=='Q':\r\n# c+=1\r\n# print(c)\r\n# print(pre)\r\ns=s[::-1]\r\nc=0\r\nsuf.append(0)\r\nfor i in range(n-1):\r\n if s[i]=='Q':\r\n c+=1\r\n suf.append(c)\r\nsuf.reverse()\r\n# print(pre,suf)\r\ns=s[::-1]\r\nans=0\r\nfor i in range(n):\r\n if s[i]=='A':\r\n ans+=suf[i]*pre[i]\r\nprint(ans)\r\n ", "s = input()\r\nQ = 0\r\nA = []\r\ncounter = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n Q += 1\r\n elif s[i] == 'A' and Q > 0:\r\n A.append(Q)\r\n\r\nfor elem in A:\r\n counter += elem * (Q - elem)\r\n\r\nprint(counter)\r\n", "s=list(input())\nt=len(s)\nans=0\nfor i in range(t):\n if s[i]=='Q':\n for j in range(i+1,t):\n if s[j]=='A':\n for k in range(j+1,t):\n if s[k]=='Q':\n ans=ans+1\nprint(ans)\n", "A=input()\r\nN=len(A)\r\nprefix=[]\r\ncount=0\r\nfor i in range(N):\r\n if A[i]==\"Q\":\r\n count+=1 \r\n prefix+=[count]\r\nsuffix=[0]*N\r\ncount=0\r\nfor i in range(1,N+1):\r\n if A[-i]==\"Q\":\r\n count+=1 \r\n suffix[-i]=count\r\nsum=0\r\nfor i in range(N):\r\n if A[i]==\"A\":\r\n sum+=suffix[i]*prefix[i]\r\nprint(sum)", "s = input()\r\nn = len(s)\r\nc = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n if s[i] + s[j] + s[k] == 'QAQ':\r\n c += 1\r\nprint(c)\r\n", "s, dem = input(), 0\r\nfor x in range(len(s) - 1):\r\n if s[x] != 'Q': continue\r\n for i in range(x + 1, len(s)):\r\n if s[i] != 'Q': continue\r\n for j in range(x + 1, i):\r\n if s[j] == 'A': dem += 1\r\nprint(dem)", "def count(a,b,m,n):\r\n\tif (m==0 and n==0) or n==0:\r\n\t\treturn 1\r\n\tif m ==0 :\r\n\t\treturn 0\r\n\tif a[m-1]==b[n-1]:\r\n\t\treturn count(a,b,m-1,n-1) + count(a,b,m-1,n)\r\n\telse:\r\n\t\treturn count(a,b,m-1,n)\r\nif __name__ == '__main__':\r\n\ts = input()\r\n\tq = 'QAQ'\r\n\tprint(count(s,q,len(s),3))", "#26\r\ns=str(input())\r\nn=len(s)\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if((s[i]=='Q') and (s[j]=='A') and (s[k]=='Q')):\r\n cnt+=1\r\nprint(cnt) ", "n = list(input())\r\np = [\"Q\",\"A\",\"Q\"]\r\nc = 0;\r\nfor i in range(len(n)):\r\n if n[i] == \"Q\":\r\n for j in range(i+1, len(n)): \r\n if n[j] == \"A\":\r\n for k in range(j+1, len(n)):\r\n if n[k] == \"Q\":\r\n c += 1\r\nprint(c)", "qaq=input()\r\ntotal=0\r\nfor i,v in enumerate(qaq):\r\n for j in range(i+1,len(qaq)):\r\n for k in range(j+1,len(qaq)):\r\n if qaq[i]+qaq[j]+qaq[k]=='QAQ':\r\n total+=1\r\nprint(total)", "s = input()\ncount = 0\nfor i in range(len(s)):\n if s[i] == 'A':\n count += s[:i].count('Q') * s[i:].count('Q')\nprint(count)\n\t\t\t\t\t\t \t\t\t\t \t\t\t \t\t \t \t", "C=[]\r\nB=[]\r\nD=[]\r\nE=[]\r\ncount=0\r\nfor b in input():\r\n B.append(b)\r\n\r\nfor i in range(len(B)):\r\n \r\n for j in range(i,len(B)):\r\n for k in range(j,len(B)):\r\n if B[i] == 'Q':\r\n if B[j] == 'A':\r\n if B[k] == 'Q':\r\n D.append(i)\r\n C.append(j)\r\n E.append(k)\r\n \r\n\r\nprint(len(E))", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(n):\r\n if s[i]==\"Q\":\r\n for j in range(i+1,n):\r\n if s[j]==\"A\":\r\n for k in range(j+1,n):\r\n if s[k]==\"Q\":\r\n count+=1\r\nprint(count)\r\n ", "t = input()\r\n\r\nfilt = [ x for x in t if x == \"Q\" or x ==\"A\"]\r\n\r\ntimes = 0\r\n\r\n\r\nq_pos = []\r\na_pos = []\r\nfor x in range(0,len(filt)) :\r\n if filt[x] == \"Q\":\r\n q_pos.append(x+1)\r\n else:\r\n a_pos.append(x+1)\r\n\r\n\r\nif (len(q_pos)<2) or (len(a_pos)<1):\r\n print (0)\r\n\r\nelse:\r\n for y in a_pos :\r\n q_before = 0\r\n q_after = 0\r\n for x in q_pos :\r\n if x < y :\r\n q_before +=1\r\n else:\r\n q_after += 1\r\n times += (q_before)*q_after\r\n print (times)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n# @Time : 2022/10/21 22:54\r\n# @Author : KuangRen777\r\n# @File : 894A. QAQ.py\r\n# @Tags :dp\r\n\r\nimport sys\r\nimport os\r\nimport math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\r\nfrom io import BytesIO, IOBase\r\nimport bisect\r\n\r\n# sys.setrecursionlimit(10**6)\r\nBUFSIZE = 4096\r\nMOD = 10 ** 9 + 7\r\nMODD = 998244353\r\ninf = float('inf')\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\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMI = lambda: map(str, input().split())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ns=list(input())\r\ndp=[0]*len(s)\r\nq=[]\r\ntag=0\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n q.append(i)\r\nfor i in range(len(q)):\r\n for j in range(i, len(q)):\r\n for x in range(q[i], q[j]+1):\r\n if s[x]=='A':\r\n ans+=1\r\nprint(ans)\r\n# for i in range(len(s)):\r\n# if tag==0 and s[i]=='Q':\r\n# tag+=1\r\n# dp[i]=dp[i-1]\r\n# continue\r\n# elif tag==1 and s[i]=='A':\r\n# tag+=1\r\n# dp[i]=dp[i-1]\r\n# continue\r\n# elif tag==2 and s[i]=='Q':\r\n# tag=0\r\n# dp[i]=dp[i-1]+1\r\n\r\n# print(dp[len(s)-1])", "n = input()\r\ncounter = 0\r\nfor i in range(1,len(n)-1):\r\n r = n[:i]\r\n l = n[i+1:]\r\n if n[i] =='A':\r\n rQ = r.count('Q')\r\n lQ = l.count('Q')\r\n counter += rQ*lQ\r\nprint(counter)", "x = input()\nanswer = 0\ntry:\n x = x[x.index(\"Q\"):]\n Q_ind = [i for i in range(len(x)) if x.startswith(\"Q\", i)]\n A_ind = [i for i in range(len(x)) if x.startswith(\"A\", i)]\n if len(Q_ind)<2 or len(A_ind) < 1:\n answer = 0\n else:\n for i in range(len(Q_ind)):\n filter_A = list(filter(lambda x: x > Q_ind[i], A_ind))\n for j in range(len(filter_A)):\n filter_Q = list(filter(lambda x: x > filter_A[j], Q_ind))\n answer += len(filter_Q)\n print(answer)\nexcept ValueError:\n print(answer)\n ", "#\r\ns=input()\r\nki=[]\r\na=[]\r\nfor i in range(len(s)):\r\n\tif s[i]==\"Q\":\r\n\t\tki.append(i)\r\n\telif s[i]==\"A\":\r\n\t\ta.append(i)\r\nans=0\r\nfor i in ki:\r\n\tfor j in a:\r\n\t\tif j>i:\r\n\t\t\tfor k in ki:\r\n\t\t\t\tif k>j:\r\n\t\t\t\t\tans+=1\r\nprint(ans)\r\n\r\n", "s = input().lower()\r\nn = len(s)\r\na = 0\r\nq = 0\r\nres = 0\r\nfor i in range(n):\r\n if s[i]==\"q\":\r\n a+=1\r\n res+=q\r\n if s[i]==\"a\":\r\n q+=a\r\nprint(res)", "s = input()\r\n\r\nx, y = s.count(\"Q\"), s.count(\"A\")\r\n\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] != \"Q\":\r\n continue\r\n a = 0\r\n q = 0\r\n for z in range(i + 1, len(s)):\r\n if s[z] == \"A\":\r\n ans += s[z:].count(\"Q\")\r\nprint(ans)\r\n \r\n", "s = input()\ncnt = 0\nfirst_q_count = 0\nlast_q_count = s.count(\"Q\")\nfor i in range(len(s)):\n char = s[i]\n if char == \"Q\":\n first_q_count += 1\n last_q_count -= 1\n if char == \"A\":\n cnt += first_q_count * last_q_count\nprint(cnt)\n \t\t \t \t \t \t \t \t \t \t \t", "def main():\r\n s=input()\r\n if s.count('Q')==0 or s.count('A')==0:\r\n print(0)\r\n return\r\n sn=[]\r\n for i in s:\r\n if i==\"A\" or i==\"Q\":\r\n sn.append(i)\r\n while sn[0]=='A':\r\n sn.pop(0)\r\n while sn[-1]=='A':\r\n sn.pop(-1)\r\n cq=sn.count('Q')\r\n na=0\r\n ss=0\r\n for i in range(len(sn)):\r\n if sn[i]=='A':\r\n ss+=(i-na)*(cq-i+na)\r\n na+=1\r\n print(ss)\r\n return\r\nmain()", "def count(a, b):\r\n\tm = len(a) \r\n\tn = len(b)\r\n\tlookup = [[0] * (n + 1) for i in range(m + 1)]\r\n\tfor i in range(n+1):\r\n\t\tlookup[0][i] = 0\r\n\tfor i in range(m + 1):\r\n\t\tlookup[i][0] = 1\r\n\tfor i in range(1, m + 1):\r\n\t\tfor j in range(1, n + 1):\r\n\t\t\tif(a[i-1]==b[j-1]):\r\n\t\t\t\tlookup[i][j] = lookup[i - 1][j - 1] + lookup[i - 1][j]\r\n\t\t\telse:\r\n\t\t\t\tlookup[i][j] = lookup[i - 1][j]\r\n\treturn lookup[m][n] \r\n\r\ns=input()\r\ns1=\"QAQ\"\r\nprint(count(s,s1))\r\n\r\n\r\n\r\n", "import math\r\ndef getint():\r\n return [int(i) for i in input().split()]\r\ndef getstr():\r\n return [str(i) for i in input().split()]\r\n#--------------------------------------------------------------------------\r\ndef solve():\r\n string=input()\r\n initial=\"\"\r\n for i in string:\r\n if i in [\"Q\",\"A\"]:\r\n initial+=i\r\n ans=0\r\n n=len(initial)\r\n for i in range(n-2):\r\n if initial[i] ==\"Q\":\r\n for j in range(i+1,n-1):\r\n if initial[j]==\"A\":\r\n for k in range(j+1,n):\r\n if initial[k]==\"Q\":\r\n ans+=1\r\n print(ans)\r\n \r\n#--------------------------------------------------------------------------\r\n#for _ in range(int(input())):\r\nsolve()\r\n", "def main():\r\n from sys import stdin, stdout\r\n\r\n # stdin = open(\"in.txt\", \"r\")\r\n # it = iter(map(int, stdin.read().split()))\r\n\r\n s = stdin.read()\r\n\r\n tot_q_cnt = s.count('Q')\r\n curr_q_cnt = 0\r\n ans = 0\r\n\r\n for x in s:\r\n \tif x == 'A':\r\n \t\tans += curr_q_cnt * (tot_q_cnt - curr_q_cnt)\r\n \telif x == 'Q':\r\n \t\tcurr_q_cnt += 1\r\n\r\n stdout.write(str(ans) + '\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "s=input()\r\nn=len(s)\r\nx='QAQ'\r\ndp=[[0 for i in range(n+1)] for j in range(4)]\r\nfor i in range(4):\r\n for j in range(n+1):\r\n if i==0 or j==0 :\r\n dp[i][j]=0\r\n elif i==1:\r\n if s[j-1]==x[i-1]:\r\n dp[i][j]=dp[i][j-1]+1\r\n else:\r\n dp[i][j] = dp[i][j - 1]\r\n elif x[i-1]==s[j-1]:\r\n dp[i][j]=dp[i-1][j-1]+dp[i][j-1]\r\n else:\r\n dp[i][j]=dp[i][j-1]\r\nprint(dp[3][n])\r\n\r\n\r\n", "text = input()\r\nq = []\r\na = []\r\nc = 0\r\nfor i in range(len(text)):\r\n if text[i] == 'Q':\r\n q.append(i)\r\n if text[i] == 'A':\r\n a.append(i)\r\nfor x in range(len(q)):\r\n for y in range(len(a)):\r\n if q[x] < a[y]:\r\n for z in range(x+1, len(q)):\r\n if q[z] > a[y]:\r\n c += len(q) - z\r\n break\r\nprint(c)\r\n", "s=input()\r\nk=0\r\nl=len(s)\r\nfor i in range(l):\r\n for j in range(i+1,l):\r\n for z in range(j+1,l):\r\n if s[i]+s[j]+s[z]=='QAQ':\r\n k+=1\r\nprint(k)", "string_i = input()\r\nn = len(string_i)\r\n\r\nfinal_num = 0\r\n\r\nif n == 1 or n == 2 or (n==3 and string_i != \"QAQ\"):\r\n print(\"0\")\r\nelse:\r\n for i in range(n - 2):\r\n if string_i[i] == \"Q\":\r\n for j in range(i + 1, n - 1):\r\n if string_i[j] == \"A\":\r\n for k in range(j + 1, n):\r\n if string_i[k] == \"Q\":\r\n final_num += 1\r\n print(final_num)", "t = input()\r\nn = len(t)\r\nOTBET = 0\r\nfor i in range(n):\r\n if t[i] == 'Q':\r\n for j in range(i, n):\r\n if t[j] == 'A':\r\n for k in range(j, n):\r\n if t[k] == 'Q':\r\n OTBET += 1\r\n\r\nprint(OTBET)", "s = input()\r\nres = 0\r\nnumq = 0\r\nnumqa = 0\r\nfor ch in s:\r\n if ch == \"A\": numqa += numq\r\n elif ch == \"Q\":\r\n res += numqa\r\n numq += 1\r\nprint(res)", "\r\n\r\n\r\n\r\ndef qaq():\r\n\r\n\r\n s = input()\r\n\r\n\r\n counts = {'Q': 0,'QA': 0}\r\n\r\n\r\n first_letter = s[0]\r\n\r\n\r\n\r\n result = 0\r\n for i in range(0,len(s)):\r\n letter = s[i]\r\n if letter =='Q':\r\n counts['Q'] += 1\r\n if counts['QA']:\r\n result += counts['QA']\r\n elif letter == 'A':\r\n counts['QA'] += counts['Q']\r\n\r\n\r\n\r\n \r\n print(result)\r\n\r\n\r\n\r\nqaq()\r\n\r\n\r\n", "from itertools import *\r\n\r\nn = input()\r\nanswer = 0\r\nfor i in combinations(n, 3):\r\n if ''.join(i) == \"QAQ\":\r\n answer += 1\r\nprint(answer)\r\n", "str = input()\r\nc = 0\r\nx = len(str)\r\nfor i in range(0, x):\r\n j = i + 1\r\n for j in range(j, x):\r\n k = j + 1\r\n for k in range(k, x):\r\n if str[i] == 'Q' and str[j] == 'A' and str[k] == 'Q':\r\n c = c + 1\r\n\r\nprint(c)\r\n", "a =input()\r\ncount=0\r\nfor i in range(len(a)):\r\n for j in range(i+1, len(a)):\r\n for k in range(i+1, j+1):\r\n if(a[i] == \"Q\" and a[k] == \"A\" and a[j] == \"Q\"):\r\n count+= 1\r\nprint(count)\r\n", "n = list(input())\r\ns = 0\r\nfor i in range(len(n)):\r\n if n[i] == 'Q':\r\n for j in range(i, len(n)):\r\n if n[j] == 'A':\r\n for k in range(j, len(n)):\r\n if n[k] == 'Q':\r\n s += 1\r\nprint(s)\r\n", "s = str(input())\r\n\r\nl = len(s)\r\nn = 0\r\n\r\nfor i in range(0, l-2):\r\n\tif s[i] == 'Q':\r\n\t\tfor j in range(i+1, l-1):\r\n\t\t\tif s[j] == \"A\":\r\n\t\t\t\tfor k in range(j+1, l):\r\n\t\t\t\t\tif s[k] == \"Q\":\r\n\t\t\t\t\t\tn += 1\r\n\r\nprint(n)", "s=input()\r\nq,p=0,0\r\nans=0\r\nfor i in s:\r\n if i=='A':\r\n p+=q\r\n elif i=='Q':\r\n ans+=p\r\n q+=1\r\nprint(ans)\r\n \r\n", "# t = int(input())\nt = 1\n# # n, m = map(int, input().split())\n# # a = list(map(int, input().split()))\n# # a.sort()\nimport math\nfrom collections import Counter\nimport random\n\n\ndef count(a, b, m, n):\n # If both first and second string\n # is empty, or if second string\n # is empty, return 1\n if (m == 0 and n == 0) or n == 0:\n return 1\n\n # If only first string is empty\n # and second string is not empty,\n # return 0\n if m == 0:\n return 0\n\n # If last characters are same\n # Recur for remaining strings by\n # 1. considering last characters\n # of both strings\n # 2. ignoring last character\n # of first string\n if a[m - 1] == b[n - 1]:\n return count(a, b, m - 1, n - 1) + count(a, b, m - 1, n)\n else:\n # If last characters are different,\n # ignore last char of first string\n # and recur for remaining string\n return count(a, b, m - 1, n)\n\n\nwhile t != 0:\n s = input()\n s1 = \"QAQ\"\n print(count(s,s1,len(s),len(s1)))\n t -= 1\n", "s =input()\r\ncount=0\r\nfor i in range(len(s)):\r\n for j in range(i+1, len(s)):\r\n for k in range(i+1, j+1):\r\n if(s[i] == \"Q\" and s[k] == \"A\" and s[j] == \"Q\"):\r\n count+= 1\r\nprint(count)\r\n", "s = input()\nans = 0\nn = len(s)\nfor i in range(n - 2):\n for j in range(i + 1, n - 1):\n for l in range(j + 1, n):\n if s[i] == 'Q' and s[j] == 'A' and s[l] == 'Q':\n ans+=1\nprint(ans)", "s = input()\r\n\r\nc = 0\r\nfor i in range(1,len(s)-1):\r\n if s[i]=='A':\r\n c1 = s[:i].count('Q')\r\n c2 = s[i+1:].count('Q')\r\n c += c1*c2\r\nprint(c)", "import math\ndef error(*n):\n print(\"[Err]\",end=\" \")\n for i in n:\n print(i,end=\" \")\n print()\n\n##oke kak sangat cute diamondnya\n\ns = input()\n\n##n = [int(i) for i in input().split()]\n##if type(n) == list:\n## n = n[0]\n\nq1=s.find('Q')\na=0\nq2=0\nans = 0\nwhile q1!=-1:\n a=s.find('A',q1+1)\n while a!=-1:\n q2=s.find('Q',a+1)\n while q2!=-1:\n## error(f\"q1 {q1} a {a} q2 {q2}\")\n ans+=1\n q2 = s.find('Q',q2+1)\n a = s.find('A',a+1)\n q1=s.find('Q',q1+1)\nprint(ans)\n\n\t \t\t\t \t\t\t\t \t\t\t \t\t \t\t \t\t\t", "s=input()\r\nn=len(s)\r\ncount =0\r\n\r\nfor i in range(n):\r\n if s[i]==\"Q\":\r\n for j in range(i+1,n):\r\n flag=0\r\n if s[j]==\"A\":\r\n for k in range(j+1,n):\r\n if s[k]==\"Q\":\r\n count+=1\r\n flag=1\r\n #break \r\n #if flag:\r\n # break\r\nprint(count)\r\n \r\n \r\n \r\n \r\n", "m=input()\r\nn=len(m)\r\nx=0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n if m[i]+m[j]+m[k]=='QAQ':\r\n x+=1\r\nprint(x)\r\n", "s=input()\r\nq=0\r\nqa=0\r\nqaq=0\r\nfor i in s:\r\n if i==\"Q\":\r\n q=q+1\r\n qaq=qaq+qa\r\n elif i==\"A\":\r\n qa=qa+q\r\nprint(qaq)", "import sys\r\nif sys.platform =='ios':\r\n\timport clipboard\r\n\ta=clipboard.get()\r\n\ta = a.split('\\n')\r\n\ttext = '\\n'.join(a)\r\n\twith open('input_file.txt','w') as f:\r\n\t\tf.write(text)\r\n\tsys.stdin = open('input_file.txt')\r\nsys.setrecursionlimit(410000000)\r\nstdin = sys.stdin \r\nni = lambda: int(ns())\r\nna = lambda: list(map(int, stdin.readline().split()))\r\nns = lambda: stdin.readline().strip()\r\nnm = lambda: map(int,input().split())\r\nna_1 = lambda: list(map(lambda x:int(x)*(-1), stdin.readline().split()))\r\nna_2 = lambda: list(map(lambda x:int(x)-1, stdin.readline().split()))\r\n\r\ns = input()\r\nN = len(s)\r\nans = 0\r\nfor i in range(N):\r\n\tif s[i] == \"Q\":\r\n\t\tfor j in range(i+1,N):\r\n\t\t\tif s[j] == \"A\":\r\n\t\t\t\tfor l in range(j+1,N):\r\n\t\t\t\t\tif s[l] == \"Q\":\r\n\t\t\t\t\t\tans += 1\r\n\t\t\t\t\r\nprint(ans)", "def sub(arr):\r\n cou=0\r\n for i in range(len(arr)):\r\n for j in range(i+1,len(arr)):\r\n for k in range(j+1,len(arr)):\r\n if(arr[i]+arr[j]+arr[k]=='QAQ'):\r\n cou+=1\r\n return cou\r\nprint(sub(input()))", "def main():\r\n s = input()\r\n kol = 0\r\n for i in range(len(s)):\r\n for j in range(i + 1, len(s)):\r\n for k in range(j + 1, len(s)):\r\n if s[i] + s[j] + s[k] == 'QAQ':\r\n kol += 1\r\n print(kol)\r\nif __name__ == '__main__':\r\n main()", "text = list(input())\r\n\r\npriviousCount = []\r\nqCount = 0 \r\n\r\nfor let in text :\r\n if let == \"Q\" :\r\n qCount += 1\r\n elif let == \"A\" :\r\n priviousCount.append(qCount)\r\n\r\ncount = 0\r\nfor num in priviousCount :\r\n count += num * (qCount - num)\r\n \r\nprint(count)", "def count(a, b, m, n): \r\n \r\n # If both first and second string \r\n # is empty, or if second string \r\n # is empty, return 1 \r\n if ((m == 0 and n == 0) or n == 0): \r\n return 1\r\n \r\n # If only first string is empty \r\n # and second string is not empty, \r\n # return 0 \r\n if (m == 0): \r\n return 0\r\n \r\n # If last characters are same \r\n # Recur for remaining strings by \r\n # 1. considering last characters \r\n # of both strings \r\n # 2. ignoring last character \r\n # of first string \r\n if (a[m - 1] == b[n - 1]): \r\n return (count(a, b, m - 1, n - 1) + \r\n count(a, b, m - 1, n)) \r\n else: \r\n \r\n # If last characters are different, \r\n # ignore last char of first string \r\n # and recur for remaining string \r\n return count(a, b, m - 1, n)\r\ns = input()\r\nx = 'QAQ'\r\n\r\nprint(count(s, x, len(s),len(x))) ", "s = input()\r\nn= len(s)\r\ncount=0\r\nfor i in range(0,n):\r\n if(s[i]==\"Q\"):\r\n for j in range(i,n):\r\n if(s[j]==\"A\"):\r\n for k in range(j,n):\r\n if(s[k]==\"Q\"):\r\n count+=1\r\n \r\nprint(count) \r\n", "a = input()\nstart = a.find('A')\nend = len(a)-1\nn=0\nif(start==-1):\n print(0)\nelse:\n while(start!=end):\n if(a[start]!='A'):\n start+=1\n else:\n n+=a[0:start].count('Q') * a[start:end+1].count('Q')\n start+=1\n print(n)\n \t\t \t \t \t \t \t\t \t\t \t \t\t\t\t", "if __name__ == '__main__':\r\n s = str(input())\r\n n = len(s)\r\n preSumQ = [0] * (n + 1)\r\n for i in range(n):\r\n preSumQ[i + 1] = preSumQ[i] + (s[i] == \"Q\")\r\n res = 0\r\n for i in range(n):\r\n if s[i] == \"A\":\r\n res += preSumQ[i] * (preSumQ[n] - preSumQ[i + 1])\r\n print(res)", "def main():\r\n\ts = input()\r\n\tres = 0\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] == \"A\":\r\n\t\t\tres += s[:i].count(\"Q\") * s[i:].count(\"Q\")\r\n\tprint(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n=input()\r\ncount=0\r\nfor i in range(len(n)):\r\n for j in range(i+1,len(n)):\r\n for k in range(j+1,len(n)):\r\n if(n[i]==\"Q\" and n[j]==\"A\" and n[k]==\"Q\"):\r\n count+=1;\r\nprint(count)\r\n \r\n", "n=input()\r\nn=list(n)\r\na=0\r\nb=0\r\nc=0\r\nfor i in range(len(n)):\r\n if n[i]=='Q':\r\n c+=b\r\n a+=1\r\n if n[i]=='A':\r\n b+=a\r\nprint(c)\r\n", "s = input().strip()\r\ns = list(s)\r\nn = len(s)\r\ncount = 0\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tfor k in range(j+1,n):\r\n\t\t\tif (s[i]==\"Q\") and (s[j]==\"A\") and (s[k]==\"Q\"):\r\n\t\t\t\tcount += 1\r\nprint(count)\r\n\t\t", "S = input()\r\nresult = 0\r\nfor i in range(len(S)):\r\n if S[i] == 'A':\r\n prefix = list(S)[:i].count('Q')\r\n suffix = list(S)[i+1:].count('Q')\r\n result += prefix * suffix\r\nprint(result)\r\n ", "seq = ''\r\nfor i in input():\r\n if i in {'A', 'Q'}:\r\n seq += i\r\n\r\ncnt = 0\r\nfor i in range(len(seq)):\r\n for j in range(i + 1, len(seq)):\r\n cur = seq[j + 1:].count('Q')\r\n if seq[i] + seq[j] == 'QA':\r\n cnt += cur\r\n\r\nprint(cnt)\r\n", "import sys\n\ns = input()\nl = len(s)\nc = 0\nfor i in range(l):\n for j in range(i + 1, l):\n for k in range(j + 1, l):\n if (s[i] + s[j] + s[k] == \"QAQ\"):\n c += 1\nprint(c)\n", "s = input()\r\nk = ''\r\nfor i in s:\r\n if i == 'Q' or i == 'A':\r\n k += i\r\nl = len(k)\r\ncount = 0\r\nfor i in range(l):\r\n for j in range(i, l):\r\n for p in range(j, l):\r\n if i != j and i != k and j != k:\r\n if k[i] == 'Q' and k[j] == 'A' and k[p] == 'Q':\r\n count += 1\r\nprint(count)", "s = input()\r\nn = len(s)\r\nfreq = [0 for _ in range(n)]\r\ncount = 0\r\nans = 0\r\n\r\nfor index, char in enumerate(s):\r\n if char == \"A\":\r\n count += 1\r\n freq[index] = count\r\n\r\nfor index, char in enumerate(s):\r\n if char == \"Q\":\r\n\r\n for j in range(index+1, n):\r\n if s[j] == \"Q\":\r\n ans += freq[j] - freq[index]\r\n\r\nprint(ans)\r\n", "n=input()\r\nz=0\r\nfor i in range (len(n)):\r\n if n[i]==\"Q\": \r\n for j in range(i,len(n)):\r\n if n[j]==\"A\":\r\n for k in range (j, len(n)):\r\n if n[k]==\"Q\":\r\n z+=1\r\nprint (z)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 18 17:19:02 2022\r\n\r\n@author: dehon\r\n\"\"\"\r\n\r\ns = input()\r\ncount = 0\r\n \r\nfor i in range(0, len(s)):\r\n if s[i] == 'Q':\r\n for j in range(i+1, len(s)):\r\n if s[j] == 'A':\r\n for k in range(j+1, len(s)):\r\n if s[k] == 'Q':\r\n count += 1\r\n \r\nprint(count)", "S = input()\r\nresult = 0\r\nfor i in range(len(S)):\r\n if S[i] == 'Q' :\r\n for j in range(i+1,len(S)):\r\n if S[j] == 'A':\r\n for k in range(j+1,len(S)):\r\n if S[k] == 'Q':\r\n result += 1\r\nprint(result)", "s = input()\n\ncnts = [0 for i in range(len(s))]\ncnt = 0\nfor i in range(len(s)):\n c = s[i]\n if c == 'Q':\n cnt += 1\n cnts[i] = cnt\n \nres = 0\nfor i in range(1, len(s) - 1, 1):\n c = s[i]\n if c == 'A':\n res += cnts[i-1] * (cnts[-1] - cnts[i-1])\nprint(res)\n \t \t \t\t \t\t \t \t \t\t \t\t", "n=input()\r\ncount=0\r\nfor i in range(len(n)):\r\n for j in range((i+1),len(n)):\r\n if n[i]=='Q' and n[j]=='Q':\r\n count+=n[(i+1):j].count('A')\r\nprint(count)", "s = input()\r\n\r\nln = len(s)\r\n\r\nsubs = [0] * ln\r\n\r\nfor i in range(2, ln):\r\n cnt = 0\r\n \r\n if s[i] == \"Q\":\r\n for j in range(i - 1, -1, -1):\r\n if s[j] == \"A\":\r\n for k in range(j - 1, -1, -1):\r\n if s[k] == \"Q\":\r\n cnt += 1\r\n \r\n subs[i] = cnt + subs[i - 1]\r\n \r\nprint(subs[-1])", "# https://codeforces.com/problemset/problem/894/A\r\n\r\ns = input()\r\nl, r = [0 for _ in range(len(s))], [0 for _ in range(len(s))]\r\n\r\nif s[0] == 'Q':\r\n l[0] = 1\r\n\r\nif s[-1] == 'Q':\r\n r[-1] = 1\r\n\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] == 'Q':\r\n l[i] = l[i-1] + 1\r\n else:\r\n l[i] = l[i-1]\r\n\r\nfor j in range(len(s)-2, -1, -1):\r\n if s[j] == 'Q':\r\n r[j] = r[j+1] + 1\r\n else:\r\n r[j] = r[j+1]\r\n\r\nres = 0\r\nfor z in range(len(s)):\r\n if s[z] == 'A':\r\n res += l[z] * r[z]\r\n\r\nprint(res)", "def main():\r\n str=input()\r\n q=\"QAQ\"\r\n dp=[0]*4\r\n dp[0]=1\r\n for i in range(len(str)):\r\n for j in range(3):\r\n if q[j] == str[i]:\r\n dp[j+1]+=dp[j]\r\n print(dp[3])\r\nif __name__ == '__main__':\r\n main()\r\n", "from itertools import combinations\r\na=input().strip()\r\nresult=0\r\ns=''\r\nfor i in a:\r\n\tif i in \"QA\":\r\n\t\ts+=i\r\ni=0\r\nj=1\r\nk=2\r\nfor i in list(combinations(s,3)):\r\n\tt=''.join(i)\r\n\tif(t==\"QAQ\"):\r\n\t\tresult+=1\r\nprint(result)\r\n\r\n\r\n\r\n", "from sys import stdin\r\n \r\nrd = stdin.readline\r\n \r\ns = rd().strip()\r\n\r\nforward = s.count('Q')\r\nbehind = 0\r\nres = 0\r\n\r\nfor i in s:\r\n\r\n if i == 'Q':\r\n behind += 1\r\n forward -= 1\r\n\r\n elif i == 'A': res += behind * forward\r\n\r\nprint(res)\r\n\r\n \r\n \r\n\r\n \r\n\r\n \r\n", "word = input()\r\nnum = 0\r\nfor idx1 in range(len(word)):\r\n if word[idx1] == \"Q\":\r\n for idx2 in range(len(word)):\r\n if word[idx2] == \"A\" and idx2 > idx1:\r\n for idx3 in range (len(word)):\r\n if word[idx3] == \"Q\" and idx3 > max(idx1,idx2):\r\n num += 1\r\nprint(num)\r\n", "n=input().split()\r\nstring=n[0]\r\nletters=list(string)\r\nz=0\r\nfor i in range (len(letters)):\r\n if letters[i]==\"Q\": \r\n for j in range(i+1,len(letters)):\r\n if letters[j]==\"A\":\r\n for k in range (j+1, len(letters)):\r\n if letters[k]==\"Q\":\r\n z+=1\r\nprint (z)", "x=input()\r\na=0\r\nfor i in range(len(x)):\r\n for j in range(i+1,len(x)):\r\n for k in range(j+1,len(x)):\r\n if x[i]=='Q' and x[j]=='A' and x[k]=='Q':\r\n a+=1\r\nprint(a)", "word = input()\r\nn = len(word)\r\nqfirst, qlast = 0, 0\r\nfor i in range(n):\r\n if word[i] == 'Q':\r\n qlast += 1\r\nres = 0\r\nfor i in range(n):\r\n if word[i] == 'Q':\r\n qfirst += 1; qlast -= 1\r\n if word[i] == 'A':\r\n res += qfirst*qlast\r\nprint(res)", "a = 0\r\nd = 0\r\nans = 0\r\nfor i in input():\r\n if i == \"Q\":\r\n ans += d\r\n a += 1\r\n elif i== \"A\":\r\n d += a\r\nprint(ans)", "s=str(input())\n\nn=len(s)\ncount=0\nfor i in range (n):\n for j in range (i+1,n):\n for k in range(j+1,n):\n if (s[i],s[j],s[k])==(\"Q\",\"A\",\"Q\"):\n count+=1\nprint(count)\n\n \n\t\t\t\t \t \t \t \t\t \t \t\t\t\t \t \t\t\t", "s = input()\r\nd = {'Q':[0], 'A':[]}\r\nfor x in s:\r\n if x == 'Q':\r\n if d['A'] == [] or d['A'][-1] != 0:\r\n d['A'].append(0)\r\n d['Q'][-1] += 1\r\n if x == 'A' and d['A']:\r\n if d['Q'][-1] != 0:\r\n d['Q'].append(0)\r\n d['A'][-1] += 1\r\ncount = 0\r\nfor i in range(len(d['A'])):\r\n if d['A'][i] != 0:\r\n l = sum(d['Q'][:i + 1])\r\n r = sum(d['Q'][i + 1:])\r\n count += l * d['A'][i] * r\r\nprint(count)", "s = input()\r\ncnt = 0\r\nfor i in range(len(s)):\r\n for j in range(i, len(s)):\r\n if s[i]=='Q':\r\n if s[j]=='A':\r\n for k in range(j, len(s)):\r\n if s[k]=='Q':\r\n cnt+=1\r\nprint(cnt) \r\n", "from itertools import combinations\nn = input()\nans = 0\nfor i in combinations(n,3):\n if i == (\"Q\",\"A\",\"Q\"):\n ans += 1\nprint(ans)\n\n\t\t\t \t \t \t \t\t \t \t \t\t \t\t\t\t", "import math\r\n# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 10**9 + 7\r\ns = S()\r\ncurrq = 0\r\nd = {}\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i] == \"Q\":\r\n currq +=1\r\n if s[i] == \"A\":\r\n d[i] = currq\r\nans = 0\r\nfor i in range(len(s)-1):\r\n if s[i] == \"Q\":\r\n for j in range(i+1,len(s)):\r\n if s[j] == \"A\":\r\n ans += d[j]\r\nprint(ans)", "entree = input()\nn = len(entree)\ncntQ = 0\ncntA = []\nfor i in range(n):\n if entree[i] =='Q' :\n cntQ += 1\n elif entree[i] == 'A' : \n cntA.append(cntQ)\n\nentree = 0\nfor x in cntA:\n entree += x*(cntQ-x)\nprint(entree)\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 count_occur(): \n\ts = input()\n\tcount_sets = 0\n\n\n\tsave = {'Q' : 0, 'QA' : 0, 'QAQ' : 0}\n\tfor i in range(len(s)):\n\t\tif s[i] == 'Q':\n\t\t\tsave['Q'] += 1\n\t\t\tsave['QAQ'] += save['QA']\n\t\tif s[i] == 'A':\n\t\t\tsave['QA'] += save['Q']\n\n\treturn save['QAQ']\n\n\nprint(count_occur())\n\t\t\t \t\t\t \t \t\t\t\t \t \t \t\t\t\t", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n-1):\r\n if s[i]==\"Q\":\r\n for j in range(i+1,n):\r\n if s[j]==\"A\":\r\n c=c+s[j:].count(\"Q\")\r\nprint(c)", "s = str(input())\r\n\r\ncnt = 0\r\n\r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)):\r\n for k in range(j+1,len(s)):\r\n a = s[i]+ s[j] +s[k] \r\n \r\n if a == \"QAQ\":\r\n cnt += 1\r\n \r\nprint(cnt) ", "s = input()\ncount = 0\n\nfor a in range(len(s)):\n if s[a] != 'Q':\n continue\n \n for b in range(a+1, len(s)):\n if s[b] != 'A':\n continue\n \n for c in range(b+1, len(s)):\n if s[c] == 'Q':\n count += 1\n\nprint(count)\n\t\t \t\t \t \t\t \t \t\t \t\t \t\t\t \t\t\t", "s = input()\nq = 0 \nqa = 0\nqaq = 0\nfor i in range(len(s)):\n if s[i] == 'A':\n qa += q\n elif s[i] == \"Q\":\n q += 1\n qaq += qa\n\nprint(qaq)\n \t\t\t \t\t \t \t \t \t \t\t \t\t\t \t", "def solve(ans):\r\n sz = len(ans)\r\n con = 0\r\n for i in range(sz):\r\n if (ans[i]=='Q'):\r\n for j in range(i+1,sz):\r\n if (ans[j]=='A'):\r\n for k in range(j+1,sz):\r\n if (ans[k]=='Q'): con += 1\r\n return con\r\n\r\nstr = input()\r\nfinal = \"\"\r\nfor i in str:\r\n if (i=='Q' or i=='A'): final += i\r\nprint(solve(final))", "a = input()\r\ncount = 0\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n for k in range(len(a)):\r\n if i<j<k and a[i]==a[k]==\"Q\" and a[j]==\"A\":\r\n count += 1\r\n else:\r\n pass\r\nprint(count)\r\n", "data = input()\nsize = len(data)\n\nfinal = 0\n\nfor i in range(size):\n if(data[i] == \"Q\"):\n data_seg = data[i : size]\n for j in range(len(data_seg)):\n if data_seg[j] == \"A\":\n data_seg2 = data_seg[j: len(data_seg)]\n for k in range(len(data_seg2)):\n if data_seg2[k] == \"Q\":\n final += 1\n\n\nprint(final)\n \t \t \t \t\t \t\t \t \t \t", "s = input()\r\nqaq = 0\r\nif len(s) < 3:\r\n print(qaq)\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] == 'Q':\r\n if i+1 != len(s)-1:\r\n for j in range(i+1, len(s)):\r\n if s[j] == 'A':\r\n qaq += s[j+1:].count('Q')\r\n print(qaq)\r\n\r\n", "s = input()\nans = 0\n\nfor i in range(len(s)):\n if s[i] == 'A':\n L = 0\n R = 0\n for j in range(i-1, -1, -1):\n if s[j] == 'Q':\n L += 1\n for j in range(i+1, len(s)):\n if s[j] == 'Q':\n R += 1\n ans += L * R\n\nprint(ans)\n\n \t\t \t\t\t\t\t \t \t\t\t\t \t \t\t \t\t \t\t", "string = input()\r\n\r\nans = 0\r\nfor i in range(len(string)):\r\n if string[i] == 'Q':\r\n for j in range(i+1,len(string)):\r\n if string[j] =='A':\r\n for k in range(j+1, len(string)):\r\n if string[k] == 'Q':\r\n ans+=1\r\nprint(ans)", "s = input()\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n a = 0\r\n b = 0\r\n for j in range(i - 1, -1, -1):\r\n if s[j] == 'Q':\r\n a += 1\r\n for j in range(i + 1, len(s)):\r\n if s[j] == 'Q':\r\n b += 1\r\n ans += a * b\r\n\r\nprint(ans)\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n\tfor j in range(i + 1, n):\r\n\t\tfor x in range(j + 1, n):\r\n\t\t\tif (s[i] + s[j] + s[x] ) == \"QAQ\":\r\n\t\t\t\tans += 1\r\nprint(ans)", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n\tif s[i] != 'Q':\r\n\t\tcontinue\r\n\tfor j in range(i+1, n):\r\n\t\tif s[j] != 'A':\r\n\t\t\tcontinue\r\n\t\tfor k in range(j+1, n):\r\n\t\t\tif s[k] != 'Q':\r\n\t\t\t\tcontinue\r\n\t\t\tans += 1\r\nprint(ans)\r\n", "str =input()\r\nQAQ = 0\r\nn = (len(str))\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range (j+1,n):\r\n if str[i] == 'Q' and str[j] == 'A' and str[k] == 'Q' :\r\n QAQ +=1\r\n\r\nprint(QAQ)", "s = input().strip()\ndef count(s, p):\n ns = len(s)\n np = len(p)\n dp = [[0 for _ in range(np + 1)] for _ in range(ns + 1)]\n for i in range(np + 1):\n dp[ns][i] = 0\n for i in range(ns + 1):\n dp[i][np] = 1\n\n for i in range(ns - 1, -1, -1):\n for j in range(np - 1, -1, -1):\n c = 0\n if s[i] == p[j]:\n c += dp[i + 1][j + 1]\n c += dp[i + 1][j]\n dp[i][j] = c\n return dp[0][0]\n\nprint(count(s, \"QAQ\"))\n", "if __name__ == '__main__':\n text = input()\n size = len(text)\n total = 0\n for i in range(size):\n for j in range(i + 1, size):\n for k in range(j + 1, size):\n if text[i] == \"Q\" and text[j] == \"A\" and text[k] == \"Q\":\n total += 1\n\n print(total)\n\n\n\t\t\t\t\t\t\t \t\t \t\t \t \t \t\t\t\t \t\t\t", "word = input().strip()\nqaq = 0\nq = 0\nqa = 0\nfor l in word:\n if l == 'Q':\n q += 1\n qaq += qa\n elif l == 'A':\n qa += q\nprint(qaq)\n\n\t \t\t \t\t \t \t\t\t\t \t \t\t\t \t", "from collections import Counter \n\ndef main1(): \n s = input() \n n = len(s) \n x, y, z = 0, 0, 0 \n for i in range(n): \n if s[i] == 'Q': \n z += y \n x += 1 \n elif s[i] == 'A': \n y += x \n print(z) \n\nif __name__ == '__main__': \n t = 1\n for _ in range(t): \n main1() \n\n# 1 2\n# 0 0 true \n# 0 1 false \n# 1 0 false \n# 1 1 false \n# 2 1 true \n# ", "from itertools import combinations\r\nn = input()\r\nn_m = []\r\nfor x in n:\r\n if x == \"Q\" or x == \"A\":\r\n n_m.append(x)\r\na = list(combinations(n_m, 3))\r\nb = []\r\n\r\nfor x in a:\r\n if x[0] == \"Q\" and x[1] == \"A\" and x[2] == \"Q\":\r\n b.append(x)\r\nprint(len(b))", "#https://codeforces.com/problemset/problem/894/A\r\n\r\nletters = [\"Q\", \"A\"]\r\ns = \"\".join([x for x in input() if x in letters])\r\nlen_s= len(s)\r\ncount = 0\r\nfor index in range(len_s):\r\n if(s[index] == letters[0]):\r\n for index_2 in range(index+1, len_s):\r\n if(s[index_2] == letters[1]):\r\n for index_3 in range(index_2+1, len_s):\r\n if(s[index_3] == letters[0]):\r\n count +=1\r\nprint(count)", "n=input()\r\nSum=0\r\nfor i in range(len(n)):\r\n if n[i]==\"A\":\r\n Sum+=n[:i].count(\"Q\")*n[i:].count(\"Q\")\r\nprint(Sum)\r\n", "#By Anan instagram: anan.ssw\r\ns=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n if s[i]=='Q':\r\n for ii in range(i+1,n):\r\n if s[ii]=='A':\r\n for iii in range(ii+1,n):\r\n if s[iii]=='Q':\r\n ans+=1\r\nprint(ans)", "a=input()\r\nb=a.count('Q')\r\ncnt=0\r\nc=0\r\nfor i in a:\r\n if i=='Q':\r\n b=b-1\r\n cnt+=1\r\n elif i=='A':\r\n c+=(b*cnt)\r\nprint(c)\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "s=list(input())\r\na=s.count('Q')\r\nt=0\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n t+=1\r\n if s[i]=='A':\r\n ans+=t*(a-t)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "a=input();\r\ntong=0;\r\nfor i in range(0, len(a)):\r\n for j in range(i+1, len(a)):\r\n for k in range(j+1, len(a)):\r\n if a[i]=='Q' and a[j]=='A' and a[k]=='Q':\r\n tong=tong+1;\r\nprint(tong);\r\n\r\n\r\n# ...\r\n", "s=input()\r\nn=len(s)\r\nl=[0]*n\r\nr=[0]*n\r\nc=0\r\nfor i in range(n):\r\n if s[i]==\"Q\":\r\n c+=1\r\n l[i]=c\r\nc=0\r\nfor i in range(n-1,-1,-1):\r\n if s[i]==\"Q\":\r\n c+=1\r\n r[i]=c\r\nans=0\r\nfor i in range(n):\r\n if s[i]==\"A\":\r\n ans+=(l[i]*r[i])\r\nprint(ans)", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n if(s[i]=='Q') and (s[j]=='A') and (s[k]=='Q'):\r\n ans+=1\r\nprint(ans)", "def count_qaq(s):\r\n count = 0\r\n for i in range(len(s)):\r\n if s[i] == 'Q':\r\n for j in range(i+1, len(s)):\r\n if s[j] == 'Q':\r\n count += s[i+1:j].count('A')\r\n return count\r\nprint(count_qaq(input()))", "from sys import stdin, stdout\r\ncin = stdin.readline\r\ncout = stdout.write\r\nmp = lambda: list(map(int, cin().split()))\r\n\r\ndef chars(): #function for taking string input as character array since string in python is immutable\r\n s = cin()\r\n return(list(s[:len(s) - 1]))\r\n\t\r\ndef pl(a): #print list\t\r\n\tfor val in a:\r\n\t\tcout(val)\r\n\tcout('\\n')\r\n\t\r\n\t\r\n\t\r\ns = chars()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n\tif s[i] == 'Q':\r\n\t\tfor j in range(i+1, n):\r\n\t\t\tif s[j] == 'A':\r\n\t\t\t\tfor k in range(j+1, n):\r\n\t\t\t\t\tif s[k] == 'Q':\r\n\t\t\t\t\t\tans += 1\r\ncout(str(ans))", "def main():\r\n \r\n from sys import stdin, stdout\r\n\r\n somp= stdin.read()\r\n\r\n ratcat=somp.count('Q')\r\n \r\n catrat= 0\r\n \r\n apple= 0\r\n\r\n for xop in somp:\r\n \r\n \tif xop == 'A':\r\n \t \r\n \t\tapple+= catrat* (ratcat-catrat)\r\n \t\t\r\n \telif xop == 'Q':\r\n \t \r\n \t\tcatrat+= 1\r\n\r\n stdout.write(str(apple) + '\\n')\r\n \r\nif __name__ == '__main__':\r\n \r\n main()", "ll= input()\r\nt= 0\r\nxy=[i for i in range(len(ll)) if ll[i]==\"A\"]\r\nfor i in xy:\r\n t+=ll[:i].count(\"Q\")*ll[i:].count(\"Q\")\r\nprint(t)", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(0,n):\r\n\tif s[i]==\"Q\":\r\n\t\tres=0\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tif s[j]==\"A\":\r\n\t\t\t\tQ=0\r\n\t\t\t\tfor r in range(j+1,n):\r\n\t\t\t\t\tif s[r]==\"Q\":\r\n\t\t\t\t\t\tQ+=1\r\n\t\t\t\tres+=Q\r\n\t\tans+=res\r\nprint(ans)", "def solve(s):\n cnt = 0\n\n for i in range(len(s)):\n if s[i] == 'Q':\n for j in range(i+1,len(s)):\n if s[j] == 'A':\n for k in range(j+1,len(s)):\n if s[k] == 'Q':\n cnt += 1\n\n\n print(cnt)\n\n\n\n\nif __name__ == '__main__':\n s = input()\n solve(s)", "st=list(filter(lambda x:x in ['A','Q','Q'],input()))\r\nco=0\r\nfor i in range(len(st)):\r\n if (st[i]=='Q'):\r\n for o in range(i+1,len(st)):\r\n if (st[o]=='A'):\r\n co+=st[o:].count('Q')\r\nprint(co)\r\n\r\n", "n = list(input())\r\nq = 0\r\nqa = 0\r\nsum = 0\r\nfor i in range(len(n)):\r\n q += [0,1][n[i] == 'Q']\r\n qa += [0,q][n[i] == 'A']\r\n sum += [0,qa][n[i] == 'Q']\r\nprint(sum)", "str = input()\r\ncount = 0\r\nfor i in range(0,len(str)):\r\n for j in range(i+1, len(str)):\r\n for k in range(j + 1, len(str)):\r\n if str[i] == \"Q\" and str[j] == \"A\" and str[k] == \"Q\":\r\n count += 1\r\nprint(count)", "s=input()\r\nn=len(s)\r\nl=[]\r\nfor i in s:\r\n if i==\"Q\" or i==\"A\":\r\n l.append(i)\r\nc=0\r\nll=len(l)\r\nfor i in range(ll):\r\n if l[i]==\"A\":\r\n cpre,cpost=0,0\r\n for j in range(i):\r\n if l[j]==\"Q\":\r\n cpre+=1\r\n for k in range(i+1,ll):\r\n if l[k]==\"Q\":\r\n cpost+=1\r\n c+=(cpre*cpost)\r\nprint(c)\r\n", "def check(s):\r\n res = 0\r\n l = []\r\n for i in range(len(s)):\r\n if s[i] == 'Q' or s[i] == 'A':\r\n l.append(s[i])\r\n for i in range(len(l)-2):\r\n for j in range(i+1,len(l)-1):\r\n for k in range(j+1,len(l)):\r\n if l[i] == 'Q' and l[j] == 'A' and l[k] == 'Q':\r\n res += 1\r\n return res\r\n\r\ns = str(input())\r\nprint(check(s))", "if 1:\n from sys import stdin\n line = iter(stdin.read().split('\\n'))\nelse:\n with open('inputs.txt', 'r') as _: line = iter(_.read().split('\\n'))\ninput = lambda: next(line)\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\n\nstring = input()\n\n#disregards other characters\nfor i in range(len(string) - 1, -1, -1):\n if string[i] != 'A' and string[i] != 'Q': string = string[:i] + string[i + 1:]\n\n# brute force\nout = 0\nfor ind, val in enumerate(string):\n if val != 'Q': continue\n for ind0, val0 in enumerate(string[ind + 1:]):\n if val0 != 'A': continue\n for ind1, val1 in enumerate(string[ind + ind0 + 2:]):\n if val1 == 'Q': out += 1\n\nprint(out)", "s = input()\r\n\r\nsum1 = 0\r\n\r\nk = len(s)\r\n\r\nfor i in range(k):\r\n if s[i]=='Q':\r\n for j in range(i+1,k):\r\n if s[j]=='A':\r\n for l in range(j+1,k):\r\n if s[l]=='Q':\r\n sum1 += 1\r\nprint(sum1)\r\n", "s = input()\r\nt = 'QAQ'\r\n\r\nn = len(s)\r\n\r\ndp = [[0 for j in range(n + 1)] for i in range(3 + 1)]\r\nfor i in range(n + 1):\r\n dp[0][i] = 1\r\n\r\nfor i in range(1, 3 + 1):\r\n for j in range(1, n + 1):\r\n if s[j - 1] == t[i - 1]:\r\n dp[i][j] = dp[i - 1][j - 1]\r\n dp[i][j] += dp[i][j - 1]\r\n \r\nprint(dp[-1][-1])\r\n\r\n", "string = input()\r\ndp = [0]*(len(string))\r\nq = 0\r\nqa = 0\r\nfor i in range(len(string)):\r\n if string[i] == 'Q':\r\n dp[i] = dp[i-1] + qa\r\n q += 1\r\n elif string[i] == 'A':\r\n dp[i] = dp[i-1]\r\n qa += q\r\n else:\r\n dp[i] = dp[i-1]\r\nprint(dp[-1])\r\n", "s = input()\r\nn = len(s)\r\ncount = 0\r\nfor i in range(n-2): \r\n for j in range(i+1,n-1): \r\n for k in range(j+1,n): \r\n if s[i]==\"Q\" and s[j]==\"A\" and s[k]==\"Q\": \r\n count += 1\r\nprint(count)", "s = input()\r\nsum = 0\r\nfor i in range(len(s)):\r\n if(s[i] == 'A'):\r\n s1, s2 = 0, 0 \r\n for j in range(i):\r\n if(s[j] == 'Q'):\r\n s1 += 1 \r\n for j in range(i+1,len(s)):\r\n if(s[j] == 'Q'):\r\n s2 += 1 \r\n sum += s1 * s2 \r\nprint(sum)", "n = input()\nn = list(n)\nnum = 0\nfor i in range(len(n)):\n if n[i] == 'Q':\n for j in range(i, len(n)):\n if n[j] == 'A':\n for k in range(j, len(n)):\n if n[k] == 'Q':\n num +=1\nprint(num)\n\n\t \t \t \t\t\t\t \t \t \t\t \t\t\t", "s = input()\r\nn = len(s)\r\ncheck = \"QAQ\"\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n if s[i]+s[j]+s[k] == check:\r\n ans += 1\r\n \r\nprint(ans)\r\n \r\n ", "s = input()\r\nans = 0\r\nn = len(s)\r\nfor i in range(n):\r\n if s[i] =='Q':\r\n if i < n:\r\n for j in range(i+1 , n):\r\n if s[j] == 'A':\r\n if j<n:\r\n for k in range(j+1 , n):\r\n if s[k] == 'Q':\r\n ans+=1\r\nprint(ans)", "inpt = input()\r\ncount = 0\r\n\r\nfor i in range (len(inpt)):\r\n c1 = inpt[i]\r\n for j in range (i+1, len(inpt)):\r\n c2 = inpt[j]\r\n for k in range (j+1,len(inpt)):\r\n c3 = inpt[k]\r\n if c1 == \"Q\" and c2 == \"A\" and c3 == \"Q\":\r\n count += 1\r\n\r\nprint (count)", "s = input()\r\nc = 0\r\nfor i in range(0,len(s)):\r\n for j in range(i+1,len(s)):\r\n for k in range(j+1,len(s)):\r\n if(s[i]+s[j]+s[k] == \"QAQ\"):\r\n c+=1\r\nprint(c)", "s = input()\nn = len(s)\n\n# indices_a = []\n\n# for i in range(n):\n# \tif s[i] == 'A':\n# \t\tindices_a.append(i)\n\n\n# m = len(indices_a)\n\n# left_qs, right_qs = [0]*m, [0]*m\n\n# # Populate above lists\n\n# for idx in indices_a:\n# \tleft_qs.append(count_qs_before_idx(idx))\n# \tright_qs.append(count_qs_after_idx(idx)) \n\n# result = 0\n\n# for i in range(m):\n# \tresult += max(left_qs[i], right_qs[i])\n\ncount = 0\n\nfor i in range(0, n):\n\tfor j in range(i+1, n):\n\t\tfor k in range(j+1, n):\n\t\t\tif s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q':\n\t\t\t\tcount +=1\n\nprint(count)", "s = input()\r\nf = [0]\r\nb = [0]\r\n\r\nfor i in range(len(s)-1):\r\n if s[i]=='Q':\r\n f.append(f[i]+1)\r\n else:\r\n f.append(f[i])\r\n\r\n if s[len(s)-1-i]=='Q':\r\n b.append(b[i]+1)\r\n else:\r\n b.append(b[i])\r\n\r\nans = 0\r\nfor i,item in enumerate(s):\r\n if item=='A':\r\n ans += f[i]*b[len(s)-1-i]\r\n\r\nprint(ans)\r\n", "s = input()\r\nl = len(s)\r\nc = 0\r\n\r\nfor i in range(l):\r\n for j in range(i+1, l):\r\n for k in range(j+1, l):\r\n if s[i]+s[j]+s[k] == 'QAQ':\r\n c += 1\r\n\r\nprint(c)\r\n", "s=str(input());q=0;a=0;qq=0;countt=0\r\nfor e in range(len(s)-1,-1,-1):\r\n if s[e]=='A':\r\n countt+= (s[:e].count(\"Q\")*s[e:].count(\"Q\"))\r\nprint(countt) \r\n", "s=input()\r\nn=len(s)\r\nl=[]\r\nc1=0\r\nc2=s.count('Q')\r\nfor i in range(n):\r\n if(s[i]=='Q'):\r\n c1+=1\r\n c2-=1\r\n elif(s[i]=='A'):\r\n l.append((c1,c2))\r\ns1=0\r\nfor i in l:\r\n s1+=i[0]*i[1]\r\nprint(s1)", "s=input()\r\nl=len(s)\r\ncnt=0\r\nfor i in range(l):\r\n for j in range(i,l):\r\n for k in range(j,l):\r\n if(s[i]+s[j]+s[k]==\"QAQ\"):\r\n cnt+=1\r\nprint(cnt)", "line = input()\r\ns, s1, s2 = 0, 0, 0\r\nfor i in range(len(line)):\r\n if line[i] == 'A':\r\n s1, s2 = 0, 0\r\n for j in range(i):\r\n if line[j] == 'Q':\r\n s1 += 1\r\n for j in range(i + 1, len(line)):\r\n if line[j] == 'Q':\r\n s2 += 1\r\n s += s1 * s2\r\nprint(s)\r\n", "a = input()\r\nb= []\r\nfor k in range(len(a)):\r\n if a[k] == \"Q\" or a[k] == \"A\":\r\n b +=[a[k]]\r\nQcount = b.count(\"Q\")\r\narr=[]\r\ncount = 0\r\nfor k in range(len(b)):\r\n if b[k] == \"Q\":\r\n count+= 1\r\n else:\r\n arr += [[count, Qcount - count]]\r\nsum = 0\r\nfor g in arr:\r\n sum += g[0] * g[1]\r\nprint(sum)\r\n", "inp=input()\r\nc=0\r\nfor i in range(len(inp)-2):\r\n if (inp[i]==\"Q\"):\r\n for j in range(i+1,len(inp)-1):\r\n if (inp[j]==\"A\"):\r\n for k in range(j+1,len(inp)):\r\n if (inp[k]==\"Q\"):\r\n c+=1\r\n \r\nprint(c) ", "s=input()\r\np=s.count(\"Q\")\r\nans=0\r\nl=0\r\nfor ch in s:\r\n if ch==\"A\":\r\n ans+=l*p\r\n if ch==\"Q\":\r\n l+=1\r\n p-=1\r\nprint(ans)\r\n", "a = input()\r\nn = 0\r\nfor i in range(len(a)):\r\n if a[i] == 'A':\r\n n+=a[:i].count('Q')*a[i:].count('Q')\r\nprint(n)", "message = [char for char in list(input()) if char == 'Q' or char == 'A']\r\nbefore = 0\r\nnum_q = message.count('Q')\r\ncount = 0\r\nfor char in message:\r\n if char == 'Q':\r\n before += 1\r\n else:\r\n count += before * (num_q - before)\r\nprint(count)", "def QAQ(string):\r\n res=0\r\n for i in range(len(string)):\r\n if string[i]=='Q':\r\n for j in range(i+1,len(string)):\r\n if string[j]=='A':\r\n for k in range(j+1,len(string)):\r\n if string[k]=='Q':res+=1\r\n print(res)\r\nif __name__=='__main__':\r\n QAQ(input())", "# -----------------------------------------------------------\r\n# URL : https://codeforces.com/contest/894/problem/A\r\n# Title : QAQ\r\n# Notes : tag-codeforces, tag-problem-A, tag-div-2\r\n# -----------------------------------------------------------\r\n\r\n\r\ndef solve_slow():\r\n n = input()\r\n nn = list(filter(lambda l: l == \"Q\" or l == \"A\", list(n)))\r\n n_len = len(nn)\r\n _sum = 0\r\n\r\n for i in range(n_len - 2):\r\n for j in range(i + 1, n_len - 1):\r\n for k in range(j + 1, n_len):\r\n if (nn[i] == 'Q') and (nn[j] == 'A') and (nn[k] == 'Q'):\r\n _sum += 1\r\n\r\n return _sum\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(solve_slow())\r\n", "s = input().upper()\r\na = len(s)\r\ncnt = 0\r\nfor i in range(a):\r\n if s[i] == \"Q\":\r\n for j in range(i, a):\r\n if s[j] == \"A\":\r\n for k in range(j, a):\r\n if s[k] == \"Q\":\r\n cnt += 1\r\nprint(cnt)\r\n", "s = n = input()\r\ncnt = x = y = 0\r\nsize = len(n)\r\n# for i in range(size):\r\n# for j in range(i + 1, size):\r\n# for k in range(j + 1, size):\r\n# if s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q':\r\n# cnt += 1\r\n# print(cnt)\r\nfor i in range(size):\r\n if s[i] == 'Q':\r\n cnt += x\r\n y += 1\r\n else:\r\n if s[i] == 'A':\r\n x += y\r\nprint(cnt)\r\n", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]==\"A\":\r\n a=s[:i].count(\"Q\")*s[i:].count(\"Q\")\r\n c=c+a\r\nprint(c)", "# def redirect_io():\n# import pathlib, sys\n# fname = pathlib.Path(__file__).parent/\"input.txt\"\n# sys.stdin = open(fname, 'r')\n# # sys.stdout = open(os.path.join(dir_path, \"output.txt\"), 'r')\n# redirect_io()\n\nfrom math import inf\nfrom functools import lru_cache\n\n# find the number of QAQ subsequences in string\n'''\ncompute number of Q up to index, \nnumber of QA subsequences up to idx,\nand number of QAQ subsequences at idx (ending w Q)\n'''\n# O(N)\ndef solve(s):\n numQ = [int(s[0] == 'Q')]\n numQA = [0]\n\n for i in range(1, len(s)):\n if s[i] == 'Q':\n numQ.append(numQ[-1] + 1)\n else:\n numQ.append(numQ[-1])\n\n for i in range(1, len(s)):\n if s[i] == 'A':\n numQA.append(numQA[-1] + numQ[i])\n else:\n numQA.append(numQA[-1])\n \n ans = 0\n for i in range(len(s)):\n if s[i] == 'Q':\n ans += numQA[i]\n return ans\n\n\ns = input()\nprint(solve(s))\n \n\n\n\n\t \t\t \t\t\t\t \t \t \t \t\t \t\t \t", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n ans += s[:i].count('Q') * s[i:].count('Q')\r\nprint(ans)", "a = [i for i in input()]\r\nn = len(a)\r\npre = [0]\r\nfor i in range(n):\r\n\tif a[i]=='Q':\r\n\t\tpre.append(1)\r\n\telse:\r\n\t\tpre.append(0)\r\nfor i in range(1,n+1):\r\n\tpre[i] += pre[i-1]\r\ntot = pre[n]\r\n# print(pre)\r\nans = 0\r\nfor i in range(n):\r\n\tif a[i]==\"A\":\r\n\t\tans+= pre[i]*(tot-pre[i])\r\nprint(ans)", "q = qa = qaq = 0\nfor c in input():\n if c == \"Q\":\n q += 1\n qaq += qa\n elif c == \"A\":\n qa += q\nprint(qaq)\n", "s = input()\r\nc=0\r\nfor i in range(len(s)):\r\n\tt1=t2=0\r\n\tif s[i]=='A':\r\n\t\tfor j in range(i):\r\n\t\t\tif s[j]=='Q':\r\n\t\t\t\tt1+=1\r\n\t\tfor k in range(i+1,len(s)):\r\n\t\t\tif s[k]=='Q':\r\n\t\t\t\tt2+=1\r\n\t\tc+=t1*t2\r\nprint(c)", "\ndef main():\n string = input()\n size = len(string)\n count = 0\n for i in range(size):\n for j in range(i + 1, size):\n for k in range(j + 1, size):\n if (string[i] == 'Q' and string[j] == 'A' and string[k] == 'Q'):\n count += 1\n print(count)\n\n\nmain()\n \t \t \t \t \t \t\t \t \t", "lst = list(input())\r\ncount = 0\r\nfor a in range(len(lst)):\r\n if lst[a]==\"Q\":\r\n for b in range(a, len(lst)):\r\n if lst[b]==\"A\":\r\n for c in range(b, len(lst)):\r\n if lst[c]==\"Q\":\r\n count+=1\r\nprint(count)", "s = input()\r\na = list(s)\r\nans = 0\r\nfor i in range(len(a) - 2):\r\n for j in range(i, len(a) - 1):\r\n for k in range(j, len(a)):\r\n if s[i] + s[j] + s[k] == \"QAQ\":\r\n ans += 1\r\nprint(ans)\r\n", "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\n\r\ns=stdin.readline()\r\nr=s.count('Q')\r\nl=0\r\nans=0\r\nfor i in s:\r\n if i=='Q':\r\n l+=1\r\n r-=1\r\n if i=='A':\r\n ans+=l*r\r\nstdout.write(str(ans))\r\n", "def count_QAQ(string):\n count = 0\n n = len(string)\n\n for i in range(n - 2):\n if string[i] == 'Q':\n for j in range(i + 1, n - 1):\n if string[j] == 'A':\n for k in range(j + 1, n):\n if string[k] == 'Q':\n count += 1\n\n return count\n\n# Ejemplo de uso:\ninput_string =input()\ncount = count_QAQ(input_string)\nprint(count)\n\t\t\t\t\t\t\t \t\t \t \t\t\t \t \t\t\t", "l = input()\r\n\r\nans = 0\r\ns1 = 0\r\ns2 = 0\r\n\r\nfor i in range(len(l)):\r\n if l[i] == \"A\":\r\n s1 = 0\r\n s2 = 0\r\n for x in range(i):\r\n if l[x] == \"Q\":\r\n s1 += 1\r\n for y in range(i+1, len(l)):\r\n if l[y] == \"Q\":\r\n s2 += 1\r\n \r\n ans += s1 * s2 \r\n \r\nprint(ans)\r\n ", "s=input()\nq=qa=qaq=0\nfor c in s:\n if c=='Q':\n q+=1\n qaq+=qa\n elif c=='A':\n qa+=q\n\nprint(qaq)\n \n\n\n", "# This is a sample Python script.\r\n\r\n#import math\r\n#import numpy as np\r\n\r\n# Press Maj+F10 to execute it or replace it with your code.\r\n\r\ndef main():\r\n s = input()\r\n cpt=0\r\n for i in range(len(s)):\r\n for(j) in range(i,len(s)):\r\n for (k) in range(j,len(s)):\r\n if s[i] == \"Q\":\r\n if s[j]==\"A\":\r\n if s[k]==\"Q\":\r\n cpt+=1\r\n print(cpt)\r\n\r\n\r\n return\r\n\r\n\r\n# Press the green button in the gutter to run the script.\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\r\n", "s = input()\r\nn = len(s)\r\ni = 0\r\nans = 0\r\n\r\nwhile i<n-2 :\r\n if s[i]==\"Q\" :\r\n for j in range(i+1,n-1) :\r\n if s[j]==\"A\" :\r\n for k in range(j+1,n) :\r\n if s[k]==\"Q\" :\r\n ans+=1\r\n i+=1\r\nprint(ans)\r\n \r\n\r\n", "a = input()\r\ns = []\r\nt = []\r\nfor i in range(len(a)):\r\n if a[i] == 'Q':\r\n s.append(i)\r\n elif a[i] == 'A':\r\n t.append(i)\r\nx = 0\r\nfor j in range(len(s)):\r\n for k in range(len(t)):\r\n if t[k] > s[j]:\r\n for l in range(len(s)):\r\n if s[l] > t[k]:\r\n x = x + 1\r\nprint(x)\r\n", "# from collections import Counter\r\nints = lambda: list(map(int, input().split()))\r\ntw = lambda n: (n&(n-1)==0) and n!=0\r\n\r\ndef solve(): \r\n # by Azimjonm2333\r\n a=input()\r\n n=len(a)\r\n s=0\r\n for i in range(n-1):\r\n if a[i]=='Q':\r\n for j in range(i, n):\r\n if a[j]=='A':\r\n for h in range(j, n):\r\n if a[h]=='Q': s+=1\r\n print(s)\r\nt=1\r\n# t=int(input())\r\nfor i in range(t): solve()\r\n", "s=input()\r\nfor i in s:\r\n if i!=\"Q\" and i!=\"A\":\r\n s=s.replace(i,\"\")\r\nco=0\r\nfor i1 in range(len(s)):\r\n for i2 in range(len(s)):\r\n for i3 in range(len(s)):\r\n if i1!=i2 and i1!=i3 and i2!=i3 and i1<i2<i3:\r\n if (s[i1]+s[i2]+s[i3])==\"QAQ\":co+=1\r\nprint(co)\r\n", "s=input()\r\nn=len(s)\r\nc=0\r\narr1=[] # arr1[i] is the # of Q's that appear at or before index i\r\nfor i in range(n):\r\n c+= s[i]=='Q'\r\n arr1.append(c)\r\nc=0\r\narr2=[0] # arr2[i] is the # of 'QA' subsequences that end at or before index i\r\nfor i in range(1,n):\r\n if s[i]=='A':\r\n c+=arr1[i-1]\r\n arr2.append(c)\r\narr3=[0,0] # arr3[i] is the # of 'QAQ' subsequences that end at or before index i\r\nc=0\r\nfor i in range(2,n):\r\n if s[i]=='Q':\r\n c+=arr2[i-1]\r\n arr3.append(c)\r\nprint(arr3[-1])", "s = input()\r\nqas = qs = count = 0\r\nfor letter in s:\r\n if letter == \"Q\":\r\n qs += 1\r\n count += qas\r\n if letter == \"A\": qas += qs\r\nprint(count)\r\n", "import sys\r\ninput = lambda:sys.stdin.readline()\r\n\r\nint_arr = lambda: list(map(int,input().split()))\r\nstr_arr = lambda: list(map(str,input().split()))\r\nget_str = lambda: map(str,input().split())\r\nget_int = lambda: map(int,input().split())\r\nget_flo = lambda: map(float,input().split())\r\n\r\nmod = 1000000007\r\n\r\ndef solve(s):\r\n\ttot = 0\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] == \"A\":\r\n\t\t\tleft = 0\r\n\t\t\tright = 0\r\n\t\t\tfor j in range(i):\r\n\t\t\t\tif s[j] == \"Q\":\r\n\t\t\t\t\tleft += 1\r\n\t\t\tfor k in range(i+1,len(s)):\r\n\t\t\t\tif s[k] == \"Q\":\r\n\t\t\t\t\tright += 1\r\n\t\t\ttot += left*right\r\n\tprint(tot)\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\ns = str(input())\r\nsolve(s)", "st=input()\r\nprint(sum([st[:i].count('Q')*st[i:].count('Q') for i in range(len(st)) if st[i] == 'A']))", "st = input()\r\ncount = 0\r\nfor i in range(0,len(st)):\r\n for j in range(i+1, len(st)):\r\n for k in range(j + 1, len(st)):\r\n if st[i] == \"Q\" and st[j] == \"A\" and st[k] == \"Q\":\r\n count += 1\r\nprint(count)", "s = input()\r\nt = 0\r\nq = [0]*len(s)\r\na = [0]*len(s)\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n t += 1\r\n q[i] = t\r\nfor i in range(len(s)):\r\n if s[i] == 'A':\r\n ans += q[i]*(t-q[i])\r\nprint(ans)\r\n", "word=str(input())\r\ncount=0\r\nfor i in range(len(word)):\r\n\r\n if word[i]==\"A\" and i!=0 and i!=len(word)-1:\r\n aword=word[:i]\r\n bword=word[i+1::]\r\n count1=count2=0\r\n for k in aword:\r\n if k==\"Q\":\r\n count1=count1+1\r\n for j in bword:\r\n if j==\"Q\":\r\n count2=count2+1\r\n count=count+count1*count2\r\nprint(count)", "def rec(string, n):\r\n result = 0\r\n for elem in range(len(string)):\r\n if string[elem] == \"Q\" and n == 1:\r\n result += rec(string[elem:], 2)\r\n if string[elem] == \"A\" and n == 2:\r\n result += rec(string[elem:], 3)\r\n if n == 3:\r\n return string.count(\"Q\")\r\n return result\r\n\r\n\r\nstring = input()\r\nprint(rec(string, 1))", "list1=list(input())\r\nn=len(list1)\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n for k in range(j,n):\r\n if list1[i]=='Q' and list1[j]=='A' and list1[k]=='Q':\r\n cnt+=1\r\nprint(cnt)\r\n", "string = input()\r\nbefore = 0\r\nafter = string.count(\"Q\")\r\nresult = 0\r\nfor char in string:\r\n if char == \"Q\":\r\n after -= 1\r\n before += 1\r\n elif char == \"A\":\r\n result += after * before\r\n\r\n\r\nprint(result)\r\n", "import itertools\r\ns = input()\r\nprint(sum(map(lambda x: (x == ('Q', 'A', 'Q')), itertools.combinations(s, 3))))", "s=input();r=0\r\nfor i in range(len(s)):\r\n\r\n if s[i]=='A':\r\n r+=s.count('Q',0,i)*s.count('Q',i,len(s))\r\nprint(r)", "a=input()\r\nc=0\r\nfor x in range(len(a)):\r\n for y in range(x+1,len(a)):\r\n for z in range(y+1,len(a)):\r\n if a[x]=='Q' and a[y]=='A' and a[z]=='Q':\r\n c+=1\r\nprint(c)", "# QAQ\ndef crying(s):\n ans = 0\n for i in range(len(s)):\n if (s[i] != \"Q\"):\n continue\n for j in range(i + 1, len(s)):\n if s[j] != 'A':\n continue\n for k in range(j + 1, len(s)):\n if s[k] == 'Q':\n ans += 1\n \n\n return ans\n\n\n\n\ns = input()\nprint(crying(s))", "m = input()\r\ns = 0\r\n\r\nm_ = \"\"\r\n\r\nfor i in m:\r\n if i.lower() in ['q', 'a']: m_ = m_+i\r\n\r\nm_ = list(m_)\r\n\r\nfor index, i in enumerate(m_):\r\n if i==\"A\":\r\n s+=m_[:index].count('Q')*m_[index:].count('Q')\r\n\r\nprint(s)", "s = input()\nps = [0] * 105\nfor i in range(len(s)):\n ps[i + 1] = ps[i]\n if (s[i] == 'Q'):\n ps[i + 1] += 1\n\nans = 0\nfor i in range(len(s)):\n if (s[i] == 'A'):\n ans += ps[i] * (ps[len(s)] - ps[i])\nprint (ans)\n", "\"\"\"\r\nSince n ≤ 100, we can iterate on the place of first 'Q','A' and second 'Q'.\r\nThe brute force solution will work in O(n3) time which can surely pass.\r\nIf we only iterate on the place of 'A', we can get the number of 'Q' before and after it using prefix sums, and it leads to O(n) solution.\r\n\"\"\"\r\n\r\n\"\"\"\r\na = input()\r\nlower = a.find(\"A\")# находим A\r\nl = 0# кол-во Q до A\r\nb = 0# кол-во Q после А\r\nfor i in range(lower):\r\n if a[i] == \"Q\":\r\n l += 1\r\n \r\nfor i in range(lower,len(a)):\r\n if a[i] == \"Q\":\r\n b += 1\r\n\r\nans = l * b # для единственного A в строке \r\nprint(ans)# асимптотика O(n) - проходим через весь массив для подсчета Q\r\n\"\"\"\r\n#_____________#\r\n\"\"\"\r\na = input()\r\nans = 0\r\ncounter = a.count(\"A\")\r\nfor j in range(counter):\r\n l = 0# кол-во Q до A\r\n b = 0# кол-во Q после А\r\n lower = a.find(\"A\")# находим A\r\n a.pop(lower)# удаляем A для рассмотрения следующего А \r\n for i in range(lower):\r\n if a[i] == \"Q\":\r\n l += 1\r\n \r\n for i in range(lower-1,len(a)):\r\n if a[i] == \"Q\":\r\n b += 1\r\n \r\n ans += l * b # для единственного A в строке \r\nprint(ans)# асимптотика O(n) - проходим через весь массив для подсчета Q\r\n\"\"\"\r\n\r\n#_____________#\r\n\r\ns = input()\r\n\r\ni = 0\r\nanswer = 0\r\nwhile i < len(s):\r\n j = i+1\r\n while j < len(s):\r\n k = j + 1\r\n while k < len(s):\r\n if (s[i]==\"Q\") and (s[j]==\"A\") and (s[k]==\"Q\"):\r\n answer += 1\r\n k += 1\r\n j += 1\r\n i += 1\r\n\r\nprint(answer)", "def count(a,b):\r\n m = len(a)\r\n n = len(b)\r\n lookup = [[0] * (n+1) for i in range(m+1)]\r\n # print(lookup)\r\n for i in range(n+1):\r\n lookup[0][i] = 0\r\n # print(lookup)\r\n for i in range(m+1):\r\n lookup[i][0] = 1\r\n # print(lookup)\r\n for i in range(1,m+1):\r\n for j in range(1,n+1):\r\n if a[i-1] == b[j-1]:\r\n lookup[i][j] = lookup[i-1][j-1] + lookup[i-1][j]\r\n else:\r\n lookup[i][j] = lookup[i-1][j]\r\n\r\n return lookup[m][n]\r\na = input()\r\nb = \"QAQ\"\r\nprint(count(a,b))", "s=input()\r\na=[]\r\noc=0\r\nfor i in range(1,len(s)):\r\n if(s[i]=='A'):\r\n a.append(i)\r\nst=0\r\nfor j in a:\r\n q1=s[0:j].count('Q')\r\n q2=s[j+1:].count('Q')\r\n oc+=q1*q2\r\nprint(oc)", "x=input()\r\nans=[]\r\nfor i in range(len(x)):\r\n if x[i]=='Q' or x[i]=='A':\r\n ans.append(x[i])\r\nq=ans.count(\"Q\")\r\na=ans.count(\"A\")\r\nsum=0\r\nco=0\r\nfor j in range(len(ans)):\r\n if ans[j]==\"Q\":\r\n co+=1\r\n else:\r\n sum+=co*(q-co)\r\nprint(sum)", "def answer():\r\n a = [x for x in list(input()) if x in \"AQ\"]\r\n i=0\r\n ans=0\r\n while i<len(a):\r\n if a[i]==\"Q\":\r\n j=i+1\r\n while j<len(a):\r\n if a[j]==\"A\":\r\n k=j+1\r\n while k<len(a):\r\n if a[k]==\"Q\":\r\n ans+=1\r\n k+=1 \r\n j+=1\r\n i+=1\r\n print(ans)\r\nanswer()", "import collections\nimport math\ndef main():\n # t = int(input())\n # for _ in range(t):\n #n = int(input())\n s = input()\n #a = list(map(int,input().split()))\n #s = input()\n solution(s)\n\n# def isPalindrome(s):\n# left = 0\n# right = len(s)-1\n# while left<right:\n# if s[left]!=s[right]:\n# return False\n# left += 1\n# right -= 1\n# return True\n\ndef solution(s):\n ans = 0\n for i in range(len(s)):\n for j in range(i+1,len(s)):\n for k in range(j+1,len(s)):\n if s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q':\n ans += 1\n print(ans)\n\n \n \n\n \n \n \n \n\n\nmain()", "class Main:\r\n def __init__(self):\r\n self.s = input()\r\n\r\n def main(self):\r\n pref_sum_As = [0]*self.s.__len__()\r\n self.fill_cumulative_freq('A', pref_sum_As)\r\n subsequence_QAQ_count = 0\r\n for i in range(self.s.__len__()-2):\r\n if self.s[i] == 'Q':\r\n for j in range(i+2, self.s.__len__()):\r\n if self.s[j] == 'Q': subsequence_QAQ_count += (pref_sum_As[j] - pref_sum_As[i])\r\n print(subsequence_QAQ_count)\r\n\r\n def fill_cumulative_freq(self, c, pref_sum):\r\n if self.s[0] == c: pref_sum[0] = 1\r\n for i in range(self.s.__len__()-1):\r\n pref_sum[i+1] = pref_sum[i]\r\n if self.s[i+1] == c: pref_sum[i+1] += 1\r\n\r\nif __name__ == \"__main__\":\r\n Main().main()", "a=input()\r\ns=0\r\nfor i in range(0,len(a)):\r\n for j in range(i,len(a)):\r\n for h in range(j,len(a)):\r\n if a[i]=='Q' and a[j]=='A' and a[h]=='Q':\r\n s += 1\r\nprint(s)", "char_list = [char for char in input()]\n\nq_before = [0] * len(char_list)\nq_before[0] = 1 if char_list[0] == 'Q' else 0\nfor i in range(1, len(char_list)):\n\tq_before[i] = q_before[i-1]\n\tif char_list[i] == 'Q':\n\t\tq_before[i] += 1\n\nqa_before = [0] * len(char_list)\nfor i in range(1, len(char_list)):\n\tqa_before[i] = qa_before[i-1]\n\tif char_list[i] == 'A':\n\t\tqa_before[i] += q_before[i-1]\n\n\nqaq_count = 0\nfor i in range(2, len(char_list)):\n\tif char_list[i] == \"Q\":\n\t\tqaq_count += qa_before[i]\n\nprint(qaq_count)\n", "s=input()\nsuma=0\nk=0\na=[]\nfor i in range(len(s)):\n if s[i]=='Q':\n k+=1\n a.append(k)\nfor j in range(len(s)):\n if s[j]=='A':\n suma+=a[j]*(s.count('Q')-a[j])\nprint(suma)\n\n \t\t\t\t \t\t\t\t\t \t\t \t \t\t \t\t \t\t", "s = input()\r\nn = len(s)\r\ni=0\r\ncnt = 0\r\nwhile i < n:\r\n j = i + 1\r\n i += 1\r\n while j < n:\r\n k = j + 1\r\n j += 1\r\n while k < n:\r\n if s[i-1] == 'Q' and s[j-1] == 'A' and s[k] == 'Q':\r\n cnt += 1\r\n k += 1\r\nprint(cnt)", "def it(): return int(input())\r\ndef pr(a): return print(a)\r\ndef li(): return list(map(int, input().split()))\r\ndef ls(): return [str(i) for i in input()]\r\ndef no(): return print('NO')\r\ndef yes(): return print('YES')\r\ndef mapa(): return map(int, input().split())\r\n#''' ????????????????????????????????????? '''#\r\n#''' ????????| ___ ___ |???????????????? '''#\r\n#''' ????????|(-_-) (*_*)|???????????????? '''#\r\n#''' ????????|/| |\\ /| |\\|???????????????? '''#\r\n#''' ????????|_|_|___|_|_|???????????????? '''#\r\n#''' ????????????????????????????????????? '''#\r\n\r\nn = [str(i) for i in input()]\r\nkol = 0\r\nfor i in range(len(n)):\r\n for j in range(i):\r\n for k in range(j):\r\n if n[i] == 'Q':\r\n if n[j] == 'A':\r\n if n[k] == 'Q':\r\n kol += 1\r\nprint(kol)", "s = input()\nres = 0\nn = len(s)\nfor i in range(1, n - 1):\n if s[i] == 'A':\n l = i - 1\n r = i + 1\n a = 0\n b = 0\n while l >= 0:\n if s[l] == 'Q':\n a += 1\n l -= 1\n while r < n:\n if s[r] == 'Q':\n b += 1\n r += 1\n res += a*b\nprint(res)\n \t \t \t\t\t\t \t \t\t\t\t \t\t \t", "import sys\r\n\r\nword = str(sys.stdin.readline().strip())\r\nletters = []\r\ncnt = 0\r\n\r\nfor i in word:\r\n if i == 'A' or i == 'Q':\r\n letters.append(i)\r\n\r\nfor i in range(len(letters)):\r\n if letters[i] == 'Q':\r\n for j in range(i, len(letters)):\r\n if letters[j] == 'A':\r\n for k in range(j, len(letters)):\r\n if letters[k] == 'Q':\r\n cnt += 1\r\n\r\nprint(cnt)", "seq = input()\r\nl = len(seq)\r\nsubsequences = 0\r\nfor Q1 in range(l):\r\n for A in range(Q1,l):\r\n for Q2 in range(A,l):\r\n if seq[Q1] == 'Q' and seq[A] == 'A' and seq[Q2] == 'Q':\r\n subsequences += 1\r\nprint(subsequences)\r\n\r\n", "s='QAQ'\r\ns1=input()\r\ndp=[[0 for i in range(len(s)+1)] for j in range(len(s1)+1)]\r\nfor i in range(len(s1)+1):\r\n dp[i][0]=1\r\nfor i in range(1,len(s1)+1):\r\n for j in range(1,len(s)+1):\r\n dp[i][j]=dp[i-1][j]\r\n if s1[i-1]==s[j-1]:\r\n dp[i][j]=(dp[i][j]+dp[i-1][j-1])\r\nprint(dp[len(s1)][len(s)])\r\n", "def fun(st):\r\n\tcount=0\r\n\tfor i in st:\r\n\t\tif i=='Q':\r\n\t\t\tcount= count+1\r\n\tans=0\r\n\tleftq=0\r\n\trightq=count\r\n\tfor i in st:\r\n\t\tif i=='Q':\r\n\t\t\tleftq+=1\r\n\t\t\trightq-=1\r\n\t\tif i=='A':\r\n\t\t\tans+=leftq*rightq\r\n\tprint(ans)\r\n\r\n\r\n\r\nst= input()\r\nfun(st)\r\n", "import math\r\nimport sys\r\n#from collections import deque, Counter, OrderedDict, defaultdict\r\n#import heapq\r\n#ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#import bisect\r\n#from bisect import bisect_left,bisect_right\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ns=insr()\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n for j in range(i+1,len(s)):\r\n if s[j]=='A':\r\n for k in range(j+1,len(s)):\r\n if s[k]=='Q':\r\n cnt+=1\r\nprint(cnt)", "count = 0\r\nstring = input()\r\nfor i, char in enumerate(string):\r\n if char == 'A':\r\n count += string[:i].count('Q') * string[i:].count('Q')\r\nprint(count)\r\n", "a=input()\r\nprint(sum(a[:i].count('Q')*a[i:].count('Q') for i in range(len(a)) if a[i]=='A'))", "def findAllSubsequence(string, word):\r\n prefix_arr = [None for _ in range(len(string))]\r\n \r\n curr_no = 0\r\n\r\n for i in range(len(string)):\r\n if string[i] == word[0]:\r\n curr_no += 1\r\n prefix_arr[i] = curr_no\r\n ans = 0\r\n for i in range(1, len(string)-1):\r\n if string[i] == word[1]:\r\n ans += prefix_arr[i-1] * (prefix_arr[-1] - prefix_arr[i])\r\n\r\n return ans\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n string = input()\r\n\r\n #ans = findAllSubsequence(string, \"MOM\") + findAllSubsequence(string, \"DAD\")\r\n ans = findAllSubsequence(string, \"QAQ\")\r\n print(ans)\r\n ", "res = str(input())\r\nlist = []\r\ndef check(start, end, res):\r\n count = 0\r\n for i in range(start + 1, end):\r\n if res[i] == 'A':\r\n count += 1\r\n return count\r\nfor i in range(len(res)):\r\n if res[i] == 'Q':\r\n list.append(i)\r\ncount = 0\r\nfor i in range(0, len(list) - 1):\r\n for j in range(i + 1, len(list)):\r\n count += check(list[i], list[j], res)\r\nprint(count)\r\n\r\n\r\n \r\n \r\n ", "s=list(input())\r\nn=len(s)\r\nla=[]\r\ndp=[0]*(n+2)\r\nif s[0]==\"Q\":\r\n dp[1]=1\r\nfor i in range(1,n):\r\n if s[i]=='A':\r\n la.append(i+1)\r\n elif s[i]=='Q':\r\n dp[i+1]=1\r\n dp[i+1]+=dp[i]\r\n\r\ndp[n+1]=dp[n]\r\nans=0\r\nfor item in la:\r\n ans+=(dp[item]*(dp[-1]-dp[item]))\r\nprint(ans)\r\n", "s=input(\"\")\r\nk=0\r\nj=0\r\ni=0\r\nc=0\r\ns=s+\"1\"\r\nfor i in range(len(s)):\r\n if s[i]=='Q':\r\n for j in range(i,len(s)):\r\n if s[j]=='A':\r\n for k in range(j,len(s)):\r\n if s[k]=='Q':\r\n c=c+1\r\nprint(c)\r\n \r\n", "s = input()\r\n\r\ni = 0\r\nresult = 0\r\nwhile i < len(s):\r\n j = i + 1\r\n while j < len(s):\r\n k = j + 1\r\n while k < len(s):\r\n if (s[i] == 'Q') and (s[j] == 'A') and (s[k] == 'Q'):\r\n result += 1\r\n k += 1\r\n j += 1\r\n i += 1\r\nprint(result)", "def solve():\n linha = input()\n index = 0;contq=0;contqa=0;contSolve=0\n while(index < len(linha)):\n if(linha[index] == 'A'):\n contqa += contq\n if(linha[index] == 'Q'):\n contSolve = contSolve + contqa\n contq = contq + 1\n index = index +1\n print(contSolve)\nsolve()\n\n\n\n\n \t \t \t \t\t\t\t\t \t \t\t\t\t \t \t\t", "def qaq():\r\n input_str = input()\r\n count = 0\r\n for i in range(len(input_str)):\r\n if input_str[i] == \"Q\":\r\n for j in range(i, len(input_str)):\r\n if input_str[j] == \"A\":\r\n for k in range(j, len(input_str)):\r\n if input_str[k] == \"Q\":\r\n count += 1\r\n return count\r\n\r\n\r\nprint(qaq())\r\n", "s=input().strip()\r\n\r\ntarget='QAQ'\r\ncount=0\r\n\r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)):\r\n for k in range(j+1,len(s)):\r\n v=s[i]+s[j]+s[k]\r\n if(v==target):\r\n count+=1\r\n\r\nprint(count)", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if(s[i]=='Q' and s[j]=='A' and s[k]=='Q'):\r\n ans+=1\r\nprint(ans)", "def qaq(seq):\n counter = 0\n for i in range(len(seq)):\n for j in range(i, len(seq)):\n for k in range(j, len(seq)):\n if seq[i] == \"Q\" and seq[j] == \"A\" and seq[k] == \"Q\":\n counter += 1\n\n return counter\n\nseq = input()\nprint(qaq(seq))\n \t\t \t\t \t\t\t \t \t\t\t \t \t\t\t\t", "S = input()\r\n\r\ndp = [0]*len(S)\r\nq = 0\r\n\r\nfor i in range(len(S)):\r\n if S[i] == 'Q':\r\n q += 1\r\n dp[i] = q\r\n \r\nans = 0\r\nfor i in range(len(S)):\r\n if S[i] == 'A':\r\n ans += dp[i]*(dp[-1]-dp[i])\r\nprint(ans)", "s = input()\r\ne = ''\r\nfor ch in s:\r\n if ch == 'Q' or ch == 'A':\r\n e = e + ch\r\nn = len(e)\r\nif n == 0:\r\n print(0)\r\nelse:\r\n dQ = [0] * n\r\n dQA = [0] * n\r\n d = [0] * n\r\n if e[0] == 'Q':\r\n dQ[0] = 1\r\n for i in range(1, len(e)):\r\n dQ[i] = dQ[i - 1] + (e[i] == 'Q')\r\n dQA[i] = dQA[i - 1] + dQ[i - 1] * (e[i] == 'A')\r\n d[i] = d[i - 1] + dQA[i - 1] * (e[i] == 'Q')\r\n print(d[-1])", "s=input()\r\nres=0\r\nfor x in range(1,len(s)) : \r\n b=0;a=0\r\n if s[x]=='A' : \r\n for y in s[:x] :\r\n if y=='Q' :b+=1\r\n for y in s[x:] :\r\n if y == 'Q' : a+=1\r\n res+=a*b\r\nprint(res)", "n = input()\n\ncount = 0\n\nfor k, v in enumerate(n):\n if v == 'Q':\n for k1, v1 in enumerate(n[k+1:]):\n if v1 == 'A':\n for k2, v2 in enumerate(n[k1+1:]):\n if v2 == 'Q':\n \n if k < k1 + k + 1 < k2 + k1 + 1:\n count += 1\n \nprint(count)\n", "t=input()\r\nile=0\r\nfor i in range(len(t)):\r\n if t[i]==\"A\":\r\n ile+=t[i:].count(\"Q\")*t[:i].count(\"Q\")\r\nprint(ile)", "s = input()\r\nans = 0\r\nnum = [0] * len(s)\r\nnum[0] = int(s[0] == 'Q')\r\nfor i in range(1, len(s)):\r\n num[i] = num[i - 1] + (s[i] == 'Q')\r\nfor i in range(1, len(s) - 1):\r\n if s[i] == 'A':\r\n ans += (num[-1] - num[i])* num[i]\r\nprint(ans)", "def substr(st,n):\r\n sum=0\r\n for i in range(n):\r\n if st[i]=='Q':\r\n for j in range(i,n):\r\n if st[j]=='A':\r\n for k in range(j,n):\r\n if st[k]=='Q':\r\n sum+=1\r\n return sum\r\n \r\nst=input()\r\nn=len(st)\r\nres=substr(st,n)\r\nprint(res)\r\n", "s=list(filter(lambda x: x=='Q' or x=='A', list(input())))\r\nq1,a,c=[],[],0\r\nfor j in range(len(s)):\r\n if s[j]=='Q':\r\n q1+=j,\r\n for qa in a:\r\n if j>qa: c+=1\r\n elif s[j]=='A':\r\n for q in q1:\r\n if q < j: a+=j,\r\n else: raise Exception\r\nprint(c)\r\n", "s = input()\r\nans = 0\r\nn = s.count('Q')\r\nc = 0\r\nfor i in s:\r\n if i == 'Q':\r\n c+=1\r\n elif i == 'A':\r\n ans += c*(n-c)\r\nprint(ans)", "a = input()\r\nb = 0\r\nfor i in range(len(a)):\r\n if a[i] == 'Q':\r\n d = 0\r\n for g in a[i:]:\r\n d += 1\r\n if g == 'A':\r\n for j in a[i + d:]:\r\n if j == 'Q':\r\n b += 1\r\nprint(b) ", "s = str(input())\r\nc=0\r\nfor i in range(len(s)-1):\r\n if s[i]=='A':\r\n c+=(s.count('Q',0,i)*(s.count('Q',i+1,len(s))))\r\nprint(c)", "s = input()\nif (len(s) < 1) or (len(s) > 100):\n exit()\ncounter = 0\nfor i in range(len(s)):\n if s[i] == 'A':\n counter += s[:i].count('Q') * s[i + 1:].count('Q')\nprint(counter)\n \t \t\t \t\t \t \t\t \t \t \t \t\t", "import itertools\r\ns=input()\r\nprint(sum([ 1 for v in itertools.combinations(s,3) if v==(\"Q\",\"A\",\"Q\")]))", "# https://codeforces.com/problemset/problem/894/A\r\nstring = input()\r\nnb = 0\r\nfor x in range(len(string)-2):\r\n for y in range(x+1, len(string)-1):\r\n for z in range(y+1, len(string)):\r\n if string[x]==\"Q\" and string[y]==\"A\" and string[z]==\"Q\":\r\n nb += 1\r\nprint(nb)\r\n", "s=input()\r\nq=0\r\na=0\r\ntemp=[]\r\nfor i in s:\r\n if i==\"A\":\r\n temp.append(i)\r\n a+=1\r\n if i==\"Q\":\r\n temp.append(i) \r\n q+=1\r\nqcounter=0\r\nans=0\r\nfor i in temp:\r\n if i==\"Q\":\r\n qcounter+=1\r\n else:\r\n ans+=qcounter*(q-qcounter) \r\nprint(ans) ", "s = input()\r\n\r\ntot_q_cnt = s.count('Q')\r\ncurr_q_cnt = 0\r\nans = 0\r\n\r\nfor x in s:\r\n if x == 'A':\r\n ans += curr_q_cnt * (tot_q_cnt - curr_q_cnt)\r\n elif x == 'Q':\r\n curr_q_cnt += 1\r\nprint(ans)", "s = list(input())\r\ntemp = s.copy()\r\nfor i in s:\r\n if i!='Q' and i!='A':\r\n temp.remove(i)\r\nvalue = 0\r\nwhile('A' in temp):\r\n a = temp.index('A')\r\n x = (temp[:a]).count('Q')\r\n y = (temp[a:]).count('Q')\r\n value+=x*y\r\n temp.remove('A')\r\nprint(value)", "ans=0\r\ns=input()\r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)):\r\n for k in range(j+1,len(s)):\r\n if(s[i]=='Q' and s[j]==\"A\" and s[k]==\"Q\"):\r\n ans+=1\r\nprint(ans)", "t=input()\r\ncount=0\r\nfor i in range(len(t)):\r\n if t[i]=='Q':\r\n for j in range(i+1,len(t)):\r\n if t[j]=='A':\r\n for k in range(j+1,len(t)):\r\n if t[k]=='Q':\r\n count+=1\r\nprint(count)", "from sys import stdin, stdout\r\n\r\ndef main():\r\n line = stdin.readline()\r\n\r\n cont = 0\r\n i = 0\r\n while i < len(line):\r\n if line[i] == 'Q':\r\n j = i+1\r\n while j < len(line):\r\n if line[j] == 'A':\r\n k = j + 1\r\n while k < len(line):\r\n if line[k] == 'Q':\r\n cont += 1\r\n\r\n k += 1\r\n\r\n j += 1\r\n\r\n i += 1\r\n\r\n stdout.write(str(cont))\r\n\r\n\r\nmain()", "s=input()\r\nl=[]\r\nl2=[]\r\nc=0\r\nfor i in range(len(s)):\r\n\tif s[i]==\"A\":\r\n\t\tl.append(i)\r\n\telif s[i]==\"Q\":\r\n\t\tl2.append(i)\r\nif len(l)>0 and len(l2)>1:\r\n\tfor i in l:\r\n\t\tl2.append(i)\r\n\t\tl2.sort()\r\n\t\tj=l2.index(i)\r\n\t\tif j!=0 or j!=len(l2)-1:\r\n\t\t\tc+=(len(l2)-j-1)*j\r\n\t\tl2.pop(j)\r\nprint(c)", "s = input()\r\nans = 0\r\nq = 0\r\nqa = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'Q':\r\n ans += qa\r\n q += 1\r\n if s[i] == 'A':\r\n qa += q\r\nprint(ans)\r\n", "def count(a, b):\r\n m = len(a)\r\n n = len(b)\r\n \r\n # Create a table to store results of sub-problems\r\n lookup = [[0] * (n + 1) for i in range(m + 1)]\r\n \r\n # If first string is empty\r\n for i in range(n+1):\r\n lookup[0][i] = 0\r\n \r\n # If second string is empty\r\n for i in range(m + 1):\r\n lookup[i][0] = 1\r\n \r\n # Fill lookup[][] in bottom up manner\r\n for i in range(1, m + 1):\r\n for j in range(1, n + 1):\r\n \r\n # If last characters are same, \r\n # we have two options -\r\n # 1. consider last characters of \r\n # both strings in solution\r\n # 2. ignore last character of first string\r\n if a[i - 1] == b[j - 1]:\r\n lookup[i][j] = lookup[i - 1][j - 1] + lookup[i - 1][j]\r\n \r\n else:\r\n # If last character are different, ignore\r\n # last character of first string\r\n lookup[i][j] = lookup[i - 1][j]\r\n \r\n return lookup[m][n]\r\n\r\na = input()\r\nb = \"QAQ\"\r\nprint(count(a,b))", "s = input()\nsub_string = \"QAQ\"\n\n\ndef count_subs(s, sub_string, n, m):\n if (n == 0 and m == 0) or m == 0:\n return 1\n if n == 0:\n return 0\n if s[n - 1] == sub_string[m - 1]:\n return count_subs(s, sub_string, n - 1, m - 1) + count_subs(\n s, sub_string, n - 1, m\n )\n else:\n return count_subs(s, sub_string, n - 1, m)\n\n\nprint(count_subs(s, sub_string, len(s), len(sub_string)))\n", "inp = input()\nl = len(inp)\nans = 0\nfor i in range(l):\n for j in range(i+1, l):\n for k in range(j+1, l):\n if inp[i] + inp[j] + inp[k] == 'QAQ':\n ans += 1\nprint(ans)\n\n\t \t\t \t \t \t \t\t\t \t\t\t\t\t", "s = input().lower()\n\nQ_amount_right = s.count('q')\nQ_amount_left = 0\namount_QAQs = 0\nfor elem in s:\n if elem == 'q':\n Q_amount_right -= 1\n Q_amount_left += 1\n if elem == 'a':\n amount_QAQs += Q_amount_left * Q_amount_right\nprint(amount_QAQs)\n\n \t\t \t\t\t\t \t \t\t\t \t\t \t\t \t\t\t \t", "string=input()\r\ndp=[0 for _ in range(len(string))]\r\nans=0\r\nq=0\r\na=0\r\nans=0\r\nfor i in range(len(string)):\r\n if string[i]==\"Q\":\r\n ans+=a\r\n q+=1\r\n elif string[i]==\"A\":\r\n if q>0:\r\n a+=q\r\nprint(ans)", "s = input()\r\nl = len(s)\r\nt = 'QAQ'\r\nm = len(t)\r\ndp = [0] * (m + 1)\r\ndp[0] = 1\r\n\r\nfor i in range(l) :\r\n for x in range(m - 1,-1,-1) :\r\n if s[i] == t[x] :\r\n dp[x + 1] += dp[x]\r\nprint(dp[m])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\ninp = input()\r\notv = 0 \r\nfor i in range(len(inp)):\r\n for j in range(len(inp)):\r\n for k in range(len(inp)):\r\n if inp[i] == 'Q' and inp[j] == 'A' and inp[k] == 'Q' and i < j < k:\r\n otv += 1 \r\nprint(otv)", "s = str(input())\nQ = []\nA = []\nT = 0\nfor x in range(len(s)):\n if(s[x] == \"Q\"):\n Q.append(x)\n if(s[x] == \"A\"):\n A.append(x)\nfor x in range(len(A)):\n QsBefore = 0\n QsAfter = 0\n for i in range(len(Q)):\n if(A[x] > Q[i]):\n QsBefore += 1\n for i in range(len(Q)):\n if(A[x] < Q[i]):\n QsAfter += 1\n T += QsAfter * QsBefore\nprint(T)\n#6Q, 15A\n", "st = input()\r\n\r\ncount = 0\r\n\r\nfor i in range(len(st)):\r\n for j in range(i+1,len(st)):\r\n for k in range(j+1,len(st)):\r\n if st[i] == 'Q' and st[j] == 'A' and st[k] == 'Q':\r\n count = count+1\r\n\r\nprint(count)\r\n", "s = tuple(filter(lambda x: x in (\"Q\", \"A\"), input()))\r\ncnt = 0\r\nn = len(s)\r\nfor i in range(n):\r\n if s[i] == \"Q\":\r\n for j in range(i + 1, n - 1):\r\n if s[j] == \"A\":\r\n for k in range(j + 1, n):\r\n if s[k] == \"Q\":\r\n cnt += 1\r\nprint(cnt)\r\n", "\r\namf = input()\r\nanswer = 0\r\nfor a in range(len(amf)):\r\n for m in range(len(amf)):\r\n for f in range(len(amf)):\r\n if a < m < f and amf[a]==amf[f]==\"Q\" and amf[m]==\"A\":\r\n answer += 1\r\n else:\r\n pass\r\nprint(answer)\r\n\r\n\r\n\r\n", "s = input()\nans = 0\n\nfor i in range(len(s)):\n for j in range(i+1,len(s)):\n for k in range(j+1,len(s)):\n if s[i]+s[j]+s[k]=='QAQ':\n ans += 1\nprint(ans)\n \t \t \t\t\t \t \t\t\t\t \t \t \t\t", "s = input()\r\nQ_count = []\r\nfor c in s:\r\n cv = (Q_count[-1] if Q_count else 0) + (1 if c == 'Q' else 0)\r\n Q_count.append(cv)\r\n\r\nprint(sum(Q_count[i] * (Q_count[-1] - Q_count[i]) for i,c in enumerate(s) if c == 'A'))", "from collections import Counter\ns = input()\nans = 0\nfor i in range(len(s)):\n if s[i] == 'Q':\n for j in range(i + 1, len(s)):\n if s[j] == 'A':\n p = Counter(s[j + 1 : ])\n ans += p['Q']\nprint(ans)\n\n\t \t \t\t\t\t\t \t\t\t \t\t \t\t\t\t \t \t", "import itertools\r\nprint(sum(map(lambda x:(x == (\"Q\",\"A\",\"Q\")),itertools.combinations(input(),3))))", "a=0\r\nd=0\r\nans=0\r\nfor i in input():\r\n if i==\"Q\":\r\n ans+=d\r\n a+=1\r\n elif i==\"A\":\r\n d+=a\r\nprint(ans)", "q,a,s=0,0,0\r\nfor i in input():\r\n if i=='Q':\r\n q+=1\r\n s+=a\r\n elif i=='A':\r\n a+=q\r\nprint(s)", "string = list(input())\r\ncount = 0\r\nfor _ in range(len(string)):\r\n if string[_] == 'Q':\r\n for i in range(_+1,len(string)):\r\n if string[i] == 'A':\r\n for j in range(i+1,len(string)):\r\n if string[j] == 'Q':\r\n count += 1\r\nprint(count)", "string = input()\n\nn = len(string)\n\n\ndp = [0 for i in range(n)]\n\nfor i in range(n):\n for j in range(i):\n \n if string[i] == \"A\" and string[j] == \"Q\":\n dp[i] += 1\n \n if string[i] == \"Q\" and string[j] == \"A\":\n dp[i] += dp[j]\n \n \ntotal = 0\nfor i in range(n):\n if string[i] == \"Q\":\n total += dp[i]\n\nprint(total)", "sum=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if(s[i]=='A'): sum=sum+(s.count('Q',i,len(s)+1)*s.count('Q',0,i+1))\r\nprint(sum) \r\n ", "def ans(s):\r\n Q=0\r\n for i in s:\r\n if i==\"Q\":Q+=1\r\n\r\n pre=0\r\n res=0\r\n for i in s:\r\n if i==\"Q\":pre+=1\r\n elif i==\"A\":\r\n res+=(pre*(Q-pre))\r\n\r\n return res\r\n \r\n \r\ns=input()\r\nprint(ans(s))\r\n\r\n", "s = input()\r\nprint(sum(s[:i].count('Q')*s[i:].count(\"Q\") for i in range(len(s) )if s[i]==\"A\"))\r\n\r\n#print(sum(s[:i].count(\"Q\")*s[i:].count(\"Q\") for i in range(len(s)) if s[i]==\"A\"))", "x=list(input())\r\ni=0\r\na=[]\r\nwhile i<len(x):\r\n if x[i]=='Q' or x[i]=='A':\r\n a.append(x[i])\r\n i=i+1\r\nl=0\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n for k in range(j+1,len(a)):\r\n if a[i]=='Q' and a[j]=='A' and a[k]=='Q':\r\n l=l+1\r\nprint(l)\r\n", "import sys\n\nimport re\nimport collections\nimport math\nimport itertools\n\n\nclass Point(object):\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\n\n\ndef function(*args):\n N = lambda: int(input())\n S = lambda: input()\n A = lambda: [int(e) for e in input()]\n P = lambda: map(int, input().split())\n inp = S()\n ans = 0\n seq = [e for e in inp if e in ('Q', 'A')]\n for e in list(itertools.combinations(seq, 3)):\n if ''.join(p for p in e) == 'QAQ':\n ans+=1\n print(ans)\nif __name__ == '__main__':\n\tfunction()\t\n", "def solve_894a(s: str):\n q_nums = 0 # numbers of all 'Q' in s\n q_cnt_left_a = 0\n q_arr_left_a = [] # number of 'Q' on left side of every 'A'\n\n for c in s:\n if c == 'Q':\n q_nums += 1\n q_cnt_left_a += 1\n elif c == 'A':\n q_arr_left_a.append(q_cnt_left_a)\n\n combs = 0\n for left_q_num in q_arr_left_a:\n right_q_num = q_nums - left_q_num\n combs += left_q_num * right_q_num\n\n print(combs)\n\n\nif __name__ == '__main__':\n s = input()\n\n solve_894a(s=s)", "s = str(input())\r\ncount = 0\r\nfor i in range(len(s)-1):\r\n if s[i] == \"Q\":\r\n for t in range(i+1, len(s)):\r\n if s[t] == \"A\":\r\n count=count+s[t+1:].count(\"Q\")\r\nprint(count)", "def countAQ(vet):\n count = 0\n for i in range(len(vet)):\n if vet[i].upper() == 'A':\n count += countQ(vet[i+1:])\n return count\ndef countQ(vet):\n count = 0\n for i in range(len(vet)):\n if vet[i].upper() == 'Q':\n count +=1\n return count\ndef countQAQ(vet):\n count = 0\n for i in range(len(s)):\n if s[i].upper() == 'Q':\n count += countAQ(s[i+1:])\n return count\ns = input()\ns = list(filter(lambda x: (x.upper() == 'Q' or x.upper() == 'A'), s))\nprint(countQAQ(s))\n\n\t\t \t \t\t\t\t \t \t\t\t \t\t\t\t\t\t", "a=input('')\r\na=a.upper()\r\nb=[]\r\nfor i in range(0,len(a),1):\r\n if(a[i]=='Q' or a[i]=='A'):\r\n b.append(a[i])\r\nct=0\r\nfor i in b:\r\n if(b[0] != 'Q'):\r\n del b[0]\r\nfor i in range(0,len(b),1):\r\n for j in range(i,len(b),1):\r\n for k in range(j,len(b),1):\r\n if(b[i]=='Q' and b[j]=='A' and b[k]=='Q'):\r\n ct += 1\r\nprint(ct)\r\n", "st=input()\r\na=0\r\nb=0\r\nc=0\r\nfor el in st:\r\n if el==\"Q\":\r\n c+=b\r\n a+=1\r\n elif el==\"A\":\r\n b+=a\r\nprint(c)", "expr = input().strip()\n\ncount = 0\n\nfor i in range(len(expr)-2):\n for j in range(i, len(expr)-1):\n for k in range(j, len(expr)):\n if expr[i] + expr[j] + expr[k] == \"QAQ\":\n count+=1\n\nprint(count)", "s = input()\r\nn = len(s)\r\nnumQs = []\r\nnumQ = 0\r\nfor i in range(n):\r\n if s[i] == 'Q':\r\n numQ = numQ+1\r\n numQs.append(numQ)\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n ans = ans+numQs[i]*(numQ-numQs[i])\r\nprint(ans)\r\n ", "s=str(input())\r\npre = [0 for _ in range(len(s))]\r\nsuf = [0 for _ in range(len(s))]\r\nif s[0]==\"Q\":\r\n pre[0],suf[0] = 1,1\r\nif s[-1]==\"Q\":\r\n pre[-1],suf[-1] = 1,1\r\nans=0\r\nfor i in range(1,len(s)):\r\n if s[i]==\"Q\":\r\n pre[i]=pre[i-1]+1\r\n else:\r\n pre[i]=pre[i-1]\r\nfor i in range(len(s)-2,-1,-1):\r\n if s[i]==\"Q\":\r\n suf[i]=suf[i+1]+1\r\n else:\r\n suf[i]=suf[i+1]\r\n if s[i]==\"A\":\r\n ans+=pre[i]*suf[i]\r\n \r\nprint(ans)\r\n ", "#################### Problems from CodeForces solved by Sohaib Moradi aka Shmits ####################\r\n\r\n######################################################################### 1\r\n###### World Cup ###### A problem from CodeForces ###### Wordl Cup ######\r\n# def func(As, n, entranceNum=0):\r\n#\r\n# Min = min(As)\r\n# p = entranceNum\r\n#\r\n# while True:\r\n# if As[p] == 0:\r\n# return p+1\r\n#\r\n# if p != n-1:\r\n# for i in range(p + 1, n): # checking the right side of position p in As for possible answer after 'Min'\r\n# # steps\r\n# d = i - p # distance between position i in As and position p in As (Right side)\r\n# if As[i] <= d:\r\n# return i + 1\r\n#\r\n# for i in range(p): # checking the left side of position p in As for possible answer after 'Min' steps\r\n# d = n - p + i # distance between position i in As and position p in As (Left side)\r\n# if As[i] <= d:\r\n# return i + 1\r\n#\r\n# As = [As[i] - Min for i in range(n)]\r\n# p = (Min % n + p) % n\r\n# Min = min(As)\r\n#\r\n#\r\n# num = int(input())\r\n# A = list(map(int, input().split(\" \")))\r\n#\r\n# print(func(A, num))\r\n#########################################################################\r\n\r\n######################################################################### 2\r\n###### Hit the Lottery ###### A problem from CodeForces ###### Hit the Lottery ######\r\n\r\n\r\n ############ greedy approach ############\r\n# coins = [1, 5, 10, 20, 100]\r\n#\r\n# cash = int(input())\r\n# coinsNum = 0\r\n# for i in range(len(coins)-1, -1, -1):\r\n# coinsNum += cash//coins[i]\r\n# cash = cash % coins[i]\r\n# if cash == 0:\r\n# break\r\n# print(coinsNum)\r\n\r\n ############ DP approach ############\r\n# def minimumCoinsNeeded(coins, cash):\r\n#\r\n# dp = [0] * (cash + 1)\r\n#\r\n# for i in range(1, cash + 1):\r\n# for coin in coins:\r\n# if i - coin >= 0:\r\n# if dp[i] == 0:\r\n# dp[i] = dp[i - coin] + 1\r\n# else:\r\n# dp[i] = min(dp[i], dp[i - coin] + 1)\r\n#\r\n# return dp[cash]\r\n#\r\n# cash = int(input())\r\n# coins = [1, 5, 10, 20, 100]\r\n# print(minimumCoinsNeeded(coins, cash))\r\n#########################################################################\r\n\r\n######################################################################### 3\r\n###### Maximum Increase ###### A problem from CodeForces ###### Maximum Increase ######\r\n\r\n# n = int(input())\r\n#\r\n# arr = list(map(int, input().split(\" \")))\r\n# lens = [1 for i in arr]\r\n#\r\n# for i in range(1, len(arr)):\r\n# if arr[i] > arr[i-1]:\r\n# lens[i] += lens[i-1]\r\n#\r\n# print(max(lens))\r\n#########################################################################\r\n\r\n######################################################################### 4\r\n###### Fair Division ###### A problem from CodeForces ###### Fair Division ######\r\n\r\n# n = int(input())\r\n#\r\n# for i in range(n):\r\n# t = int(input())\r\n# arr = list(map(int, input().split(\" \")))\r\n# ones = arr.count(1)\r\n# twos = arr.count(2)\r\n#\r\n# if ones == 0 and twos % 2 == 0:\r\n# print(\"YES\")\r\n# elif ones % 2 == 0 and ones != 0:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n#########################################################################\r\n\r\n######################################################################### 5\r\n###### QAQ ###### A problem from CodeForces ###### QAQ ######\r\n\r\nstr = input()\r\nn = len(str)\r\nQs = [0 for i in range(n+1)]\r\nAs = []\r\n\r\nfor i in range(n):\r\n if str[i] == \"Q\":\r\n Qs[i+1] = Qs[i] + 1\r\n else:\r\n Qs[i + 1] = Qs[i]\r\n if str[i] == \"A\":\r\n As.append(i)\r\n\r\nnumOfSub = 0\r\nfor j in As:\r\n numOfSub += Qs[j+1] * (Qs[n] - Qs[j+1])\r\n\r\nprint(numOfSub)", "s=input()\r\nans=0\r\nns=\"\"\r\nq=\"QAQ\"\r\nfor i in s:\r\n if i in q:\r\n ns+=i\r\ndp={}\r\ndef dfs(size,ns,p):\r\n if len(p)==3 or size==len(ns):\r\n if p==\"QAQ\":\r\n return 1\r\n return 0\r\n\r\n if (size,p) in dp:\r\n return dp[(size,p)]\r\n\r\n res=dfs(size+1,ns,p)\r\n res+=dfs(size+1,ns,p+ns[size])\r\n\r\n dp[(size, p)]=res\r\n return dp[(size,p)]\r\n\r\n\r\nprint(dfs(0,ns,\"\"))\r\n\r\n\r\n\r\n\r\n", "string = input()\r\nq_count = multiplier = cry_count = 0\r\nfor character in string:\r\n if character == 'Q':\r\n cry_count += multiplier\r\n q_count += 1\r\n elif character == \"A\":\r\n multiplier += q_count\r\nprint(cry_count)", "s = input()\r\nn = len(s)\r\n# QAQAQYSYIOIWINQ\r\ndp = [0] * n\r\nans = 0\r\nfor i in range(1, n):\r\n if s[i] == \"A\":\r\n for j in range(i):\r\n if s[j] == \"Q\":\r\n dp[i] += 1\r\n if s[i] == \"Q\":\r\n for j in range(i):\r\n if s[j] == \"A\":\r\n ans += dp[j]\r\nprint(ans)", "k = input()\r\np = \"AQ\"\r\ni = 0\r\nct = 0\r\nans=0\r\nfor x in range(len(k)):\r\n if k[x] == \"Q\":\r\n for y in range(x + 1, len(k)):\r\n if k[y] == \"A\":\r\n\r\n for z in range(y + 1,len(k)):\r\n if k[z]==\"Q\":\r\n ct+=1\r\nprint(ct)", "from collections import Counter\r\nimport math\r\nimport itertools\r\nimport random\r\n\r\nimport sys\r\nsys.setrecursionlimit(100000)\r\n\r\n\r\ndef nq(s,next, num, f):\r\n print(s)\r\n print(next)\r\n l = len(s)\r\n if l == 1:\r\n if num == 2 and s[0]== next[0]:\r\n print(\"Got One\")\r\n return 1\r\n else:\r\n return 0\r\n else:\r\n if num == 3:\r\n return 1\r\n for i in range(l):\r\n print(\"original: \", s)\r\n print('s: ' ,s[i:])\r\n print(\"number: \", num)\r\n print(next)\r\n if s[i] == next[0]:\r\n f+=nq(s[i+1:], [next[1], next[0]], num+1, f)\r\n else:\r\n f += nq(s[i + 1:], next, num, f)\r\n print(\"returning f: \", f)\r\n print(\"Where s: \", s)\r\n return f\r\ndef main():\r\n s = input()\r\n #ans = nq(s,['Q', 'A'], 0, 0)\r\n ans = 0\r\n for i in range(len(s)):\r\n if s[i] == \"Q\":\r\n for j in range(i+1,len(s)):\r\n if s[j] == \"A\":\r\n for k in range(j + 1, len(s)):\r\n if s[k] == \"Q\":\r\n ans+=1\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "import bisect\r\nimport collections\r\nimport math\r\n\r\n\r\ns = input()\r\nres = []\r\nfor x in s:\r\n if x == 'Q' or x == 'A':\r\n res.append(x)\r\n\r\nresult = 0\r\nfor i in range(len(res)):\r\n for j in range(i+1, len(res)):\r\n for k in range(j+1, len(res)):\r\n if res[i] == 'Q' and res[j] == 'A' and res[k] == 'Q':\r\n result += 1\r\n\r\nprint(result)\r\n", "a=input()\r\ns=[]\r\nfor i in range(len(a)):\r\n for j in range(i):\r\n for k in range(j):\r\n if a[k]+a[j]+a[i]=='QAQ':\r\n s.append(a[k]+a[j]+a[i])\r\nprint(len(s))", "str= input()\nif (len(str) <1) or (len(str) > 100):\n exit()\ncounter = 0\nfor i in range(len(str)):\n for j in range(i+1,len(str)):\n for k in range(j+1,len(str)):\n if str[i]=='Q' and str[j]=='A' and str[k]=='Q':\n counter +=1\nprint(counter)\n\t \t\t\t\t \t\t \t\t\t \t\t\t \t\t \t\t\t\t\t\t", "stri=input()\r\nct=0\r\nfor i in range(len(stri)):\r\n for j in range(i+1,len(stri)):\r\n for k in range(j+1,len(stri)):\r\n if stri[i]=='Q' and stri[j]=='A' and stri[k]=='Q':\r\n ct+=1\r\nprint(ct)\r\n \r\n \r\n", "s = input()\r\ncnt = 0\r\n\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s)):\r\n for k in range(j + 1, len(s)):\r\n cnt += s[i] + s[j] + s[k] == \"QAQ\"\r\n\r\nprint(cnt)\r\n", "res = 0\ns = input().strip()\nq = 0\nfor ch in s:\n\tif ch == 'Q':\n\t\tq += 1\nql = 0\nqr = q\nfor ch in s:\n\tif ch == 'Q':\n\t\tql += 1\n\t\tqr -= 1\n\telif ch == 'A':\n\t\tres += ql * qr\n\nprint(res)\n", "def solve(s : str):\r\n length = len(s)\r\n q = [0] * length\r\n a = [0] * length\r\n for i in range(length - 1, -1, -1):\r\n if s[i] == 'Q':\r\n q[i] = 1\r\n elif s[i] == 'A':\r\n a[i] = sum(q[i:length])\r\n\r\n ans = 0\r\n #print(\"Q = \", q)\r\n #print(\"A = \", a)\r\n for i in range(0, length):\r\n for j in range(i, length - 1):\r\n ans += q[i] * a[j]\r\n\r\n print(ans)\r\n\r\n\r\nsolve(input())", "a = input()\nres = 0\nfor i in range(len(a)):\n if a[i] == 'Q':\n for j in range(i, len(a)):\n if a[j] == 'A':\n for k in range(j, len(a)):\n if a[k] == 'Q':\n res += 1\nprint(res)", "string = input()\r\nlength = len(string)\r\narr = ['_','Q','A','Q']\r\ndp = [[0 for j in range(length+1)]for i in range(4)]\r\nfor i in range(length+1):\r\n dp[0][i] = 1\r\n# print(dp)\r\nfor i in range(1,length+1):\r\n for j in range(1,4):\r\n if string[i-1]==arr[j]:\r\n dp[j][i] = dp[j][i-1]+dp[j-1][i-1]\r\n else:\r\n dp[j][i] = dp[j][i-1]\r\nprint(dp[-1][-1])\r\n", "cnt = 0\r\nstring = input()\r\nfor i in range(len(string)):\r\n if string[i] == 'Q':\r\n for j in range(i + 1, len(string)):\r\n if string[j] == 'A':\r\n for l in range(j + 1, len(string)):\r\n if string[l] == 'Q':\r\n cnt += 1\r\nprint(cnt)", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == 'Q':\r\n for j in range(i + 1, n):\r\n if s[j] == 'A':\r\n for k in range(j + 1, n):\r\n if s[k] == 'Q':\r\n ans += 1\r\nprint(ans)\r\n", "def main():\r\n string = input()\r\n\r\n q_indices = []\r\n a_indices = []\r\n for index, value in enumerate(string):\r\n if value == \"Q\":\r\n q_indices.append(index)\r\n elif value == \"A\":\r\n a_indices.append(index)\r\n\r\n total_counter = 0\r\n for a_index in a_indices:\r\n counter = 0\r\n for q_index in q_indices:\r\n if a_index > q_index:\r\n counter += 1\r\n else:\r\n break\r\n total_counter += counter * (len(q_indices) - counter)\r\n print(total_counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = input().strip()\n\ncount = 0\nfor i in range(len(n)):\n if n[i] == 'Q':\n for j in range(i+1, len(n)):\n if n[j] == 'A':\n for k in range(j+1, len(n)):\n if n[k] == 'Q':\n count += 1\n\nprint(count)\n", "input_str = str(input())\r\n\r\nqaq_chars = list()\r\nfor i in list(input_str):\r\n if( i in ['Q','A']):\r\n qaq_chars.append(i)\r\n\r\nways = 0\r\nn = len(qaq_chars)\r\n\r\nfor i in range(n):\r\n if qaq_chars[i] == 'Q':\r\n for j in range(i+1, n):\r\n if qaq_chars[j] == 'A':\r\n for k in range(j+1, n):\r\n if qaq_chars[k] == 'Q':\r\n ways += 1\r\n\r\n# qaq_chars.remove('A')\r\n# qaq_chars.remove('A')\r\n\r\n\r\n \r\n# print(str(qaq_chars))\r\nprint(str(ways))", "def main():\r\n a = input()\r\n n = len(a)\r\n c = 0\r\n if n < 3:\r\n print(0)\r\n return\r\n\r\n for i in range(n - 2):\r\n if a[i] == 'Q':\r\n for j in range(i + 1, n - 1):\r\n if a[j] == 'A':\r\n for h in range(j + 1, n):\r\n if a[h] == 'Q':\r\n c += 1\r\n\r\n print(c)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "s=input()\r\nq,a,ans=[i for i in range(len(s)) if s[i]==\"Q\"],[i for i in range(len(s)) if s[i]==\"A\"],0\r\nfor i in range(len(q)):\r\n for j in range(i+1,len(q)):\r\n for k in a:\r\n if(k>q[i] and k<q[j]): ans+=1\r\nprint(ans)", "s = input()\r\n\r\ntotal = 0\r\nfor i in range(len(s)):\r\n for j in range (i + 1, len(s)):\r\n for k in range(j + 1, len(s)):\r\n if s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q':\r\n total += 1\r\n k += 1\r\n\r\nprint(total)\r\n", "s = input()\r\n\r\nseq = set()\r\nn = len(s)\r\ni = 0\r\noutput = 0\r\n\r\nwhile i < n:\r\n\tif s[i] == 'Q':\r\n\t\tseq.add(i)\r\n\r\n\telif s[i] == 'A':\r\n\t\tz = len(seq)\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tif s[j] == 'Q':\r\n\t\t\t\toutput+=z\r\n\ti+=1\r\n\r\nprint(output)\r\n", "# Cách 1\r\ns = list(input())\r\nd = 0\r\nfor i in range (len(s)):\r\n for j in range (i):\r\n for k in range (j):\r\n if s[i] == 'Q' and s[j] == 'A' and s[k] == 'Q':\r\n d += 1\r\nprint(d)\r\n", "s = input()\r\n\r\nnum_QAQ = 0\r\nnum_Q = s.count('Q')\r\nleft_Q = 0\r\nfor ch in s:\r\n if ch == 'Q':\r\n left_Q += 1\r\n elif ch == 'A':\r\n num_QAQ += left_Q * (num_Q - left_Q)\r\nprint(num_QAQ)", "s=input()\r\nl=''\r\nfor i in s:\r\n if i=='Q' or i=='A':\r\n l+=i\r\nans=0\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n for k in range(j+1,len(l)):\r\n if l[i]+l[j]+l[k]=='QAQ':\r\n ans+=1\r\nprint(ans)\r\n", "n=input()\r\ns=0\r\nfor i in range(len(n)):\r\n if n[i]=='A':\r\n x=n[:i].count('Q')*n[i:].count('Q')\r\n s+=x\r\nprint(s)\r\n" ]

[ "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nl = []\r\nfor i in range(21):\r\n l.append((1 << i)-1)\r\n\r\n\r\ndef up(key):\r\n for i in range(21):\r\n if (key <= l[i]):\r\n return l[i]\r\n\r\n\r\nans = []\r\nd = defaultdict(int)\r\nx = up(n)\r\n# print(x)\r\nfor i in range(n, -1, -1):\r\n # print('i->', i, 'x-i->', x-i)\r\n while (x-i > n or d[x-i] == 1):\r\n x //= 2\r\n # print('i->', i, 'x->', x)\r\n # print('x-i->', x-i)\r\n ans.append(x-i)\r\n d[x-i] += 1\r\nans.reverse()\r\nxor, x = 0, 0\r\nfor i in ans:\r\n xor += (x ^ i)\r\n x += 1\r\nprint(xor)\r\nprint(*ans)\r\n", "import sys\r\nfrom math import *\r\nfrom collections import *\r\ninp = lambda: sys.stdin.buffer.readline().decode().strip()\r\nout=sys.stdout.write\r\n# n=int(inp())\r\n# arr=list(map(int,inp().split()))\r\nn=int(inp())\r\nans=[0]*(n+1)\r\nmp={}\r\ngg=floor(log(n,2))+1\r\nfor i in range(n,-1,-1):\r\n if i in mp: \r\n ans[i]=mp[i]\r\n continue\r\n x=gg\r\n while x>0:\r\n mmax=(1<<x)-1\r\n want=mmax ^ i\r\n if want in mp or want>n: x-=1\r\n else:\r\n # print(mmax,i,want)\r\n mp[i]=want\r\n ans[i]=want\r\n mp[want]=i\r\n break\r\nbeauty=0\r\nfor i,x in enumerate(ans):\r\n beauty += i^x\r\nprint(beauty)\r\nprint(*ans)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('YES' if b else 'NO')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn = I()\r\nres = [-1] * (n+1)\r\nvalid = [True] * (n+1)\r\nt = 0\r\nnn = n\r\nwhile nn:\r\n t += 1\r\n nn//=2\r\nstandard = (2**t)-1\r\ni = n\r\nsol = 0\r\nwhile i>=0:\r\n if standard - i <= n and valid[standard - i]:\r\n res[i] = standard - i\r\n valid[standard - i] = False\r\n sol += standard\r\n i -= 1\r\n else:\r\n standard//=2\r\np(sol)\r\np(*res)\r\n", "s = n = int(input()) + 1\r\nt, r = [], list(range(n))[::-1]\r\nk = 2 ** 20\r\n\r\nwhile s:\r\n while k >= 2 * s: k //= 2\r\n t = r[n - s: n + s - k] + t\r\n s = k - s\r\n\r\nprint(n * n - n)\r\nprint(' '.join(map(str, t)))", "import math \r\ndef ones(n): \r\n number_of_bits = (int)(math.floor(math.log(n) /\r\n math.log(2))) + 1; \r\n return [((1 << number_of_bits) - 1) ^ n,(1 << number_of_bits) - 1]; \r\nn = int(input())\r\nhas=[0]*(n+1)\r\nans=[0]*(n+1)\r\nfin=0\r\nfor i in range(n,0,-1):\r\n if has[i]==0:\r\n com,fi = ones(i)\r\n# print(com,fi,i)\r\n has[com]=1\r\n fin+=2*fi\r\n ans[com]=i\r\n ans[i]=com\r\nprint(fin)\r\nprint(*ans)\r\n\r\n\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n# print = sys.stdout.write\r\n\r\ndc = defaultdict(int)\r\nn = int(input())\r\nmx = 2**20 - 1\r\nls = []\r\nfor i in range(n,-1,-1) :\r\n ans = (mx^i)\r\n while (dc[ans] != 0 or ans > n) :\r\n mx += 1\r\n mx //= 2\r\n mx -= 1\r\n ans = (mx^i)\r\n ls.append(ans)\r\n dc[ans] += 1\r\n # print(len(ls))\r\nls.reverse()\r\nprint(n*(n+1))\r\nprint(*ls)" ]

[ "inp = input().split()\r\ninp = [int(x) for x in inp]\r\na=0\r\nfor i in range(15):\r\n if(i>0):\r\n if(inp[0]%10==0 or (inp[0]-inp[1])%10==0 or ((inp[0]*i)-inp[1])%10==0 or (inp[0]*i)%10==0):# :\r\n a=i\r\n break\r\nprint(a)", "l = input()\r\nlist1 = l.split(\" \")\r\nk = int(list1[0])\r\nr = int(list1[1])\r\ncount =0\r\nsum = 0\r\nflag = 0\r\nwhile flag == 0 :\r\n sum += k\r\n count += 1\r\n if sum%10 ==0 :\r\n flag = 1\r\n print (count)\r\n else :\r\n sum -= r\r\n if sum % 10 == 0:\r\n flag = 1\r\n print(count)\r\n else :\r\n sum += r\r\n", "k,r=map(int,input().split())\r\nfor i in range(1,11):\r\n if (k*i)%10 in [0,r]:\r\n print(i)\r\n quit()", "price, coin = map(int, input().split())\r\n\r\nfor i in range(1, 11):\r\n if (price * i) % 10 == 0 or coin == (price * i) % 10:\r\n print(i)\r\n break\r\n", "k, r = [int(x) for x in input().split()]\r\na = 1\r\nb = k\r\nwhile True:\r\n if k%10==0:\r\n print(a)\r\n break\r\n elif (k-r)%10==0:\r\n print(a)\r\n break\r\n else:\r\n k+=b\r\n a+=1", "k,r = map(int, input().split(' '))\r\n\r\nfor i in range(1,10):\r\n n = k * i \r\n l=str(n)\r\n if int(l[-1]) == r or int(l[-1]) == 0:\r\n print(i)\r\n break", "k,m =map(int,input().split())\r\nn=1\r\nwhile (k*n-m)%10!=0:\r\n if (k*n)%10==0:\r\n break\r\n n+=1\r\nprint(n)", "k , r = input().split()\r\nk,r=int(k),int(r)\r\nn = 1\r\nwhile True:\r\n m = k*n\r\n if(m-((m//10)*10) == r or m-((m//10)*10) == 0):\r\n break\r\n n += 1\r\nprint(n)\r\n", "k , h = map(int,input().split())\r\nfor n in range(1,100):\r\n m = k * n\r\n if m % 10 == 0:\r\n print(n)\r\n break\r\n elif (m - h) % 10 == 0:\r\n print(n)\r\n break", "k, r = map(int,input().split())\r\ni =1\r\nwhile True:\r\n m = k *i\r\n a = m%10\r\n if a == r or a == 0:\r\n print(i)\r\n break\r\n i+=1", "k, r = map(int, input().split())\r\nfor ans in range(1, 11):\r\n if (k * ans - r) % 10 == 0 or (k * ans) % 10 == 0:\r\n print(ans)\r\n break", "a,b=map(int,input().split())\r\ni=1\r\nwhile 0!=i*a%10!=b:i+=1\r\nprint(i)", "k, r = map(int, input().split())\r\ni = 1\r\nwhile 0 != i * k % 10 != r:\r\n i += 1\r\nprint(i)\r\n", "def minimum_shovels(k, r):\r\n for i in range(1, 11):\r\n if (k * i) % 10 == 0 or (k * i) % 10 == r:\r\n return i\r\n\r\nif __name__ == \"__main__\":\r\n k, r = map(int, input().split())\r\n result = minimum_shovels(k, r)\r\n print(result)", "MYDD = 1103\n\ndef main():\n k, r = map(int, input().split())\n zz = k % 10\n ans = -1\n for j in range(1, 11):\n if zz * j % 10 == r or k * j % 10 == 0:\n ans = j\n break\n print(ans)\n\nif __name__ == '__main__':\n main()\n\n\t \t\t \t \t \t\t\t\t \t\t\t", "s = input()\nk,r = map(int,s.split())\ni = 1\nans = 0\nwhile True:\n ans = k * i\n i += 1\n if(ans%10==0 or ans%10==r):\n break\nprint(i-1)\n\t \t \t \t\t \t\t\t \t\t \t\t \t\t\t\t \t\t", "\n\nn,r=map(int,input().split())\nt=n\nfor i in range (1,10):\n \n \n if(n%10==r or n%10==0):\n print(i)\n break\n n+=t\n\n \t\t\t\t\t\t \t \t \t \t \t\t \t", "v=0\r\npm=0\r\nk,r=map(int,input().split())\r\nflag=True\r\nwhile(flag):\r\n if((pm%10==0 and pm!=0) or (pm%10==r)):\r\n break\r\n v=v+1\r\n pm=pm+k\r\nprint(v)", "k,y=map(int,input().split())\r\nfor i in range(1,11):\r\n if (i*k) %10 == 0 or (k*i) % 10 == y:\r\n print(i)\r\n break\r\n \r\n", "k,r=map(int,input().split())\nc = 1\ncost = k\n \nwhile cost % 10 != 0 and (cost - r) % 10 != 0:\n c += 1\n cost += k\n \nprint(c)\n \t\t \t \t \t \t \t \t\t\t\t \t\t", "\r\nm,n=input().split(\" \")\r\nn=float(n)\r\nm=float(m)\r\nans=1\r\nf=m\r\nwhile f % 10 !=0.0 and (f-n)%10!=0.0:\r\n \r\n f=f+m\r\n ans=ans+1\r\n \r\n \r\nprint(ans)", "k, r = map(int, input().split()) # Read k and r\r\n\r\nshovels = 1 # Initialize the number of shovels to buy\r\n\r\n# Keep increasing the number of shovels until the total cost is a multiple of 10 or ends with r\r\nwhile (k * shovels) % 10 != 0 and (k * shovels) % 10 != r:\r\n shovels += 1\r\n\r\nprint(shovels)", "import math \r\nk,r=map(int,input().split())\r\nblist=[]\r\nc=0\r\nfor y in range(1,1000):\r\n if (k*y)%10==0:\r\n c=y\r\n break \r\nfor x in range(1,1000):\r\n if (k*x-r)%10==0:\r\n blist.append(x)\r\n break\r\nif len(blist)!=0:\r\n print(min(c,blist[0]))\r\nelse:\r\n print(c)", "price_of_1_shovel, r = map(int, input().split())\r\nfor i in range(1, 100):\r\n x = ((price_of_1_shovel * i) - r )%10\r\n if x == 0 :\r\n print(i)\r\n break\r\n y = (price_of_1_shovel * i)%10\r\n if y == 0:\r\n print(i)\r\n break\r\n ", "k,r = map(int,input().split())\r\nc=1\r\nz=k\r\ni=2\r\nwhile str(z)[-1]!=\"0\" or str(z)[-1] != str(r):\r\n \r\n if str(z)[-1]==\"0\" or str(z)[-1] == str(r):\r\n break\r\n else:\r\n c+=1\r\n z=k*i\r\n i+=1\r\n continue\r\nprint(c)\r\n ", "k,r=map(int,input().split())\r\nnum_s=1\r\nwhile (num_s*k)%10!=0 and ((num_s*k)-r)%10!=0:\r\n num_s+=1\r\nprint(num_s) \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "def shovels_without_change(price, different_coin):\n if price % 10 == 0:\n return True\n elif ((price - different_coin) % 10) == 0:\n return True\n else:\n return False\n\nshovel_price, coin = map(int, input().split())\nminimum_shovels = 1\n\nwhile not shovels_without_change((shovel_price * minimum_shovels), coin):\n minimum_shovels += 1\n\nprint(minimum_shovels) ", "k,r = input().split()\r\nk = int(k)\r\nr = int(r)\r\ncount = 0\r\ni = 1\r\nwhile i <= 10:\r\n x = (k % 10) * i\r\n if (x % 10 == r) or (x % 10 == 0):\r\n print(i)\r\n break\r\n else:\r\n i += 1\r\n", "k, r = map(int,input().split())\r\nn = 1\r\nwhile(k*n % 10 != r and k*n % 10 != 0):\r\n n = n + 1\r\nprint(n)", "c,r=map(int,input().split())\r\ni=1\r\nwhile 1:\r\n if ((i*c)-r)%10==0 or (i*c)%10==0:\r\n print(i)\r\n break\r\n else:\r\n i+=1", "k,r = map(int, input().split())\n\n\nif k % 10 == r or k % 10 == 0:\n print(1)\nelse:\n for i in range(2, 11):\n if (k * i) % 10 == r or (k * i) % 10 == 0:\n print(i)\n break\n\t\t \t \t \t\t \t \t \t\t \t \t", "k,r = map(int,input().split())\r\nc=0\r\nwhile True:\r\n c+=1\r\n a = k*c\r\n if a % 10 ==0 or (a-r) % 10 == 0:\r\n print(c)\r\n break\r\n ", "a = input().split(\" \")\r\nb = a[0]\r\nc = int(b[-1])\r\nr = int(a[1])\r\noutput = 10\r\nfor i in range(1,10):\r\n if int(str(c*i)[-1]) == 0:\r\n output = i\r\n break\r\n if int(str(c*i)[-1]) == r:\r\n output = i\r\n break\r\nprint(output)", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nn = a[0]\r\nk = 1\r\nwhile not(n%10 == 0 or ((n%10) - a[1] == 0)):\r\n k += 1\r\n n += a[0]\r\nprint(k)", "a,c=map(int,input().split())\nfor i in range(1,11):\n if (a*i)%10==0 or (a*i)%10==c:\n print(i)\n break\n \t \t \t\t\t \t \t \t \t\t\t\t", "x,y=map(int,input().split())\r\nc=0\r\nfor i in range (1,11):\r\n l=list(str(i*x))\r\n if ((int(l[len(l)-1]))==0):\r\n print(i)\r\n break\r\n elif ((int(l[len(l)-1]))==y):\r\n print(i)\r\n break\r\n", "k, r = map(int,input().split())\r\nfor i in range(1,11):\r\n if (k* i)%10 in[0,r]:\r\n break\r\nprint(i)", "k,r=[int(x) for x in input().split()]\r\n\r\nfor i in range(1,11):\r\n if (k*i)%10==0 or (k*i-r)%10==0:\r\n print(i)\r\n break", "k, r = map(int, input().split())\r\nans = 1\r\nwhile ans*k%10 != 0 and (ans*k-r)%10 != 0:\r\n ans += 1\r\nprint(ans)", "k, r = map(int, input().split())\r\ni = 1\r\nwhile (k * i) % 10 != 0 and (k * i) % 10 != r:\r\n i += 1\r\nprint(i)", "k,r=[int(i) for i in input().split()]\r\ni=1\r\nwhile k*i%10!=r:\r\n\tif k*i%10==0:\r\n\t\tbreak\r\n\ti+=1\r\nprint(i)", "s = [int(i) for i in input().split()]\r\nk = s[0]\r\nr = s[1]\r\ncount = 0\r\nres = 0\r\nwhile True:\r\n count += k\r\n res += 1\r\n if (count - r) % 10 == 0 or count % 10 == 0:\r\n break\r\nprint(res)", "k, r = map(int, input().split());print(next(i for i in range(1, k * 10) if k * i % 10 == r or k * i % 10 == 0))", "costo,coin=map(int,input().split())\r\npalas=0\r\nwhile (costo*palas%10)-coin!=0:\r\n\r\n palas=palas+1\r\n\r\n if costo*palas%10==0:\r\n break\r\nprint(palas)\r\n", "####\na, b = map(int, input().split())\n\nsum = 0\nfor i in range(1, 100000):\n sum += a\n if (sum % 10 == 0) or (sum % 10 == b):\n print(i)\n break\n\n \t \t \t \t\t\t \t \t\t\t\t \t \t \t \t\t", "k, r = map(int, input().split())\r\nshowels = 1\r\nwhile (showels*k) % 10 != r and (showels*k)%10 != 0:\r\n showels += 1\r\nprint(showels)\r\n", "\r\nprice, unique_coin = map(int, input().split())\r\ncost = price\r\nanswer = 1\r\nwhile cost % 10 != 0 and (cost - unique_coin) % 10 != 0:\r\n cost += price\r\n answer += 1\r\nprint(answer)\r\n", "a, b = map(int,input().split())\r\nn = 1\r\nm = a\r\nwhile a % 10 != b and a % 10 != 0:\r\n a += m\r\n n += 1\r\nprint(n)", "k, r = list(map(int, input().split()))\r\n\r\ns = 1\r\nwhile (s * k) % 10 != 0 and (s * k - r) % 10 != 0:\r\n s += 1\r\n\r\nprint(s)\r\n", "k, r = map(int, input().split())\r\nss = 1\r\nwhile (ss * k) % 10 != 0 and (ss * k) % 10 != r:\r\n ss += 1\r\nprint(ss)\r\n", "# Buy a Shovel\r\n\r\nnums = [int(x) for x in input().split(' ')]\r\nk = nums[0]\r\nr = nums[1]\r\nrespuesta = 0\r\n\r\nfor i in range(1, 10):\r\n n = i * k\r\n if respuesta == 0 and (n % 10 == 0 or (n - r) % 10 == 0):\r\n respuesta = i\r\nprint(respuesta)\r\n", "import sys\r\n\r\n\r\ndef solution():\r\n inputs = sys.stdin.readline()\r\n k, r = (int(i) for i in inputs.split())\r\n \r\n k = k - (k // 10) * 10\r\n last_digit = k\r\n count: int = 1\r\n \r\n while k % 10 != 0 and (k - r) % 10 != 0:\r\n k += last_digit\r\n count += 1\r\n \r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()", "a,b=map(int,input().split())\r\na=str(a)\r\nx=a[-1]\r\nx=int(x)\r\nn=x\r\nsum=1\r\nk=0\r\nif x==0:\r\n print(1)\r\nelif x==b:\r\n print(1)\r\nelse:\r\n while k>=0:\r\n n=n+x\r\n sum=sum+1\r\n if n%10==0 or n%10==b:\r\n print(sum)\r\n break\r\n k=k+1", "k,r=map(int,input().split());i=1\nwhile 0!=i*k%10!=r:i+=1\nprint(i)\n\t\t\t \t \t\t \t\t\t\t \t \t\t \t \t\t", "x=input().split()\r\nk1=int(x[0])\r\nr=int(x[1])\r\no=1\r\nw=True\r\nk=k1\r\nwhile w:\r\n if k%10==0:\r\n w=False \r\n o+=1\r\n elif k%10==r:\r\n w=False \r\n o+=1\r\n else:\r\n o+=1\r\n k+=k1\r\nprint(o-1)", "s1=input().split()\r\nk=int(s1[0])\r\nr=int(s1[1])\r\ncheck=True\r\ni=1\r\nwhile (check==True):\r\n if (k*i-r)%10==0:\r\n check=False\r\n elif (k*i)%10==0:\r\n check=False\r\n else:\r\n i=i+1\r\nprint(i)", "\r\nK,R = map(int,input().split())\r\nans = 0\r\nk = K\r\nfor i in range(1,11):\r\n\tk = K*i\r\n\t#print(str(k)[-1],i)\r\n\tif str(k)[-1] == str(R):\r\n\t\tans = i\r\n\t\t#print(8)\r\n\t\tbreak\r\n\tif str(k)[-1] == \"0\":\r\n\t\tans = i\r\n\t\tbreak\r\n\tk = K\r\nprint(ans)", "k, r = map(int, input().split())\nif (k % 10 == 0) or (k == r) or ((k - r) % 10 == 0):\n print(1)\n exit()\nfor res in range(2, 11):\n if (res * k) % 10 == 0 or (res * k) == r or (res * k - r) % 10 == 0:\n print(res)\n exit()\n", "params = input()\r\nparams = params.split()\r\nk, r = int(params[0]), int(params[1])\r\n\r\nif k % 10 == 0:\r\n print(1)\r\n\r\nelif k % 5 == 0:\r\n if r == 5:\r\n print(1)\r\n else:\r\n print(2)\r\n\r\nelse:\r\n index = int()\r\n while True:\r\n\r\n result1 = (index * 10 + r) / (k % 10)\r\n result2 = (index*(k%10))\r\n\r\n if result1 == int(result1):\r\n print(int(result1))\r\n break\r\n elif result2%10 == 0 and result2 != 0:\r\n print(index)\r\n break\r\n index += 1", "s=input().split()\r\nx=int(s[0])\r\nk=x\r\ny=int(s[1])\r\nans=1\r\nwhile True :\r\n if x%10==0 or x%10==y:\r\n print (ans)\r\n break \r\n else :\r\n x=x+k\r\n ans+=1", "k,r=map(int,input().split())\r\n\r\nlast_digit=k%10 \r\ncount=1\r\nk1=k\r\n\r\nwhile last_digit!=r and last_digit!=0:\r\n count+=1 \r\n k1=k1+k \r\n last_digit=k1%10 \r\n \r\nprint(count)", "def minimum_shovels(k, r):\r\n shovels_bought = 0\r\n total_cost = 0\r\n\r\n while True:\r\n shovels_bought += 1\r\n total_cost = k * shovels_bought\r\n\r\n if total_cost % 10 == 0 or total_cost % 10 == r:\r\n break\r\n\r\n return shovels_bought\r\n\r\nk, r = map(int, input().split())\r\n\r\nresult = minimum_shovels(k, r)\r\nprint(result)\r\n", "ll=(list(map(int,input().split(' '))))\r\nans1=11;ans2=11\r\nfor i in range(1,11):\r\n\tif (ll[0]*i)%10==0:\r\n\t\tans1=i\r\n\t\tbreak\r\nfor i in range(1,11):\t\t\r\n\tif ((ll[0]*i)-ll[1])%10==0:\r\n\t\tans2=i\r\n\t\tbreak\r\nprint(min(ans1,ans2))\r\n", "r, k = map(int, input().split())\r\nx = 1\r\ns = 1\r\n\r\nwhile x != 0:\r\n pr = s * r\r\n if pr % 10 == k or pr % 10 == 0:\r\n print(s)\r\n break\r\n else:\r\n s += 1\r\n\r\n", "k,r = map(int, input().split())\r\nc = 1\r\nwhile True:\r\n if ((k*c)-r)%10==0 or k*c%10==0:\r\n break\r\n else:\r\n c+=1\r\nprint(c)", "k,r=map(int,input().split())\r\nsum=0\r\nfor i in range(1,10):\r\n sum+=k\r\n if sum%10==0 or sum%10==r:\r\n print(i)\r\n break\r\n else:\r\n continue\r\n", "s = input()\r\ns = s.split(\" \")\r\nk = int(s[0])\r\nr = int(s[1])\r\nx = 1\r\nwhile k*x % 10 != 0 and k*x % 10 != r :\r\n x = x+1\r\nprint(x)", "k, r = [int(x) for x in input().split()]\r\ns = '0'\r\nj = str(r)\r\ncount = 0\r\nwhile True:\r\n a = k + int(s)\r\n s = str(a)\r\n count += 1\r\n if s[-1] == j or s[-1] == \"0\":\r\n break\r\nprint(count)", "def buy_shovel():\r\n k, r = map(int, input().split())\r\n \r\n for i in range(1,11):\r\n if (i*k)%10 in [0,r]:\r\n break \r\n \r\n print(i)\r\n \r\n \r\nbuy_shovel()", "aa,b=list(map(int,input().split()))\r\na=0\r\ni=0\r\n\r\n\r\nwhile True:\r\n if (a%10==0 and a!=0) or (a%10==b):\r\n break\r\n a=aa+a\r\n i=i+1\r\nprint(i)\r\n\r\n \r\n\r\n \r\n\r\n", "a,b=map(int,input().split())\r\ni=1\r\nwhile True:\r\n if (i*a)%10==0 or (i*a-b)%10==0:\r\n print(i)\r\n break\r\n i+=1", "a, b = map(int, input().split())\nfor loop in range(1, 11):\n price = a * loop\n if price % 10 == 0 or price % 10 == b:\n print(loop)\n break\n\t \t \t \t \t\t \t\t\t \t \t\t\t \t", "n, r = list(map(int, input().split()))\r\ns = 0\r\nc = 0\r\nfor i in range(1, 11):\r\n s = n * i\r\n c += 1\r\n if s%10 == 0 or s%10 == r:\r\n break\r\nprint(c)\r\n\r\n\r\n\r\n", "k,r=map(int,input().split())\r\na=[k,k*2,k*3,k*4,k*5,k*6,k*7,k*8,k*9]\r\nfor i in range(9):\r\n if a[i]%10==r or a[i]%10==0:\r\n print(i+1)\r\n exit()\r\nprint(10)", "k , r = [int(x) for x in input().split()]\r\nshovel_01 = 1\r\nwhile True:\r\n sum_01 = shovel_01 * k\r\n sum_02 = shovel_01 * k - r\r\n if sum_01%10 == 0 or sum_02 %10 ==0 :\r\n print(shovel_01)\r\n break\r\n else:\r\n shovel_01 += 1\r\n", "a,b = [int(x) for x in input().split(\" \")]\r\nans = 10\r\nfor i in range(1,10):\r\n val = (a*i)%10\r\n if val==b or val==0:\r\n ans=i\r\n break\r\nprint(ans)", "# x = int(input())\n# \n# for q in range(x):\n\n\nnum = list(map(int, input().split()))\na,b = num[0],num[1]\nsum = 0\nfor i in range(1,11):\n \n sum+=a\n\n if(str(sum))[-1]=='0' or str(sum)[-1]==str(b):\n print(i)\n break\n\n \n", "x=list(map(int,input().split()))\r\ncon = 1\r\nwhile True:\r\n if (x[0]*con)%10==x[1] or (x[0]*con)%10==0:\r\n print(con)\r\n break\r\n else:\r\n con+=1", "n,r=map(int,input().split())\r\nans=10\r\nfor i in range(1,10):\r\n if (n*i)%10==0 or (n*i)%10==r:\r\n ans=i\r\n break\r\nprint(ans)", "N, X = map(int, input().split())\r\nfor i in range (1,10,1):\r\n d=N*i\r\n if(d%10==0):\r\n print(i)\r\n break\r\n else:\r\n c=N*i- X\r\n if(c%10==0):\r\n \r\n print(i)\r\n break", "k,r = input().split()\r\nk=int(k)\r\nr=int(r)\r\n\r\ncnt = 1\r\n\r\nwhile True:\r\n if (k*cnt)%10==r or (k*cnt)%10==0:\r\n break\r\n cnt+=1\r\n\r\nprint(cnt)", "#q18 A. Buy a Shovel\r\nk,r = map(int,input().split(' '))\r\nnum = 1\r\nflag = True\r\nwhile ( flag ):\r\n if ((k*num )% 10 == r or (k*num) % 10 == 0): \r\n flag = False\r\n else : num+=1\r\nprint (num)", "k,r = map(int,input().split())\r\nfor i in range(1,10):\r\n if (k*i)%10 == r or (k*i)%10 == 0:\r\n print(i)\r\n break\r\n ", "x=input(\"\").split(\" \")\r\nk=int(x[0])\r\nr=int(x[1])\r\n\r\noutput=0\r\nflag=True\r\nwhile(flag):\r\n if((k%10==0) or (k%10==r) ):\r\n output+=1\r\n flag=False\r\n else:\r\n k+= int(x[0])\r\n output+=1\r\n continue\r\n# print(k)\r\nprint (output)", "def min_sh(a,b):\n for i in range(1,11):\n if (a*i)%10==0 or (a*i)%10==b:\n return i \na,b = map(int,input().split())\nprint(min_sh(a,b))", "sq = [int(i) for i in input().split()]\r\ni = 1\r\nwhile i <= 10:\r\n if sq[0] % 10 == 0:\r\n print(1)\r\n break\r\n if i * sq[0] % 10 == 0:\r\n print(i)\r\n break\r\n if i * sq[0] % 10 == sq[1]:\r\n print(i)\r\n break\r\n i += 1\r\n", "k,r=map(int,input().split())\r\ni=1\r\nwhile 0!=i*k%10!=r:i+=1\r\nprint(i)\r\n", "k, r = map(int, input().split()); count = 1\r\n\r\nwhile True:\r\n if (count * k) % 10 == 0 or (count * k) % 10 == r:\r\n print(count); break\r\n else: count += 1", "k,r = map(int, input().split())\r\nk = k%10\r\n\r\nfor i in range(1,101):\r\n \r\n if k*i % 10 == 0 or k*i % 10 == r:\r\n print(i)\r\n break\r\n", "k, r = input().split(\" \")\r\nk = int(k)\r\nr = int(r)\r\nsum=0\r\nfor i in range(1,1000, +1): \r\n sum=sum+k\r\n if((sum%10==0) or (sum%10==r)):\r\n print(i)\r\n break\r\n else:\r\n continue", "k, r = map(int, input().split())\r\ni = 1\r\ntemp = k\r\nwhile k % 10 != 0 and k % 10 != r:\r\n i+=1\r\n k = temp * i \r\nprint(i)", "k,r=map(int,input().strip().split())\ncount=1\nwhile(True):\n if (count*k-r)%(10)==0 or (count*k)%10==0:\n print(count)\n break\n count=count+1\n \t\t \t\t\t \t\t\t\t\t\t \t\t\t", "k, r = map(int, input().split())\r\nsh= 1\r\nwhile True:\r\n if (sh * k - r) % 10 == 0 or (sh * k) % 10 == 0:\r\n break\r\n sh+= 1\r\nprint(sh)\r\n", "k, r = map(int, input().split())\r\n# k * x = 10 * q + r? \r\nfor l in range(1, 10):\r\n if k * l % 10 == 0 or (k * l - r) % 10 == 0:\r\n print(l)\r\n break\r\n\r\n", "x, y = [int(x) for x in input().split()]\r\ni = 1\r\n\r\nwhile True:\r\n \r\n if( (((x*i) % 10) == y )or ((x * i)%10==0)):\r\n print(i)\r\n break\r\n\r\n i += 1\r\n", "def main():\r\n k, r = [int(i) for i in input().split()]\r\n cnt, totalPrice, mod = 1, k, k%10\r\n\r\n while mod!=r and mod!=0:\r\n totalPrice += k\r\n cnt += 1\r\n mod = totalPrice % 10\r\n \r\n print(cnt)\r\n\r\nmain() ", "import sys\r\nnum = sys.stdin.readline().strip().split()\r\n# print(num)\r\n# print(int(num[0]))\r\nfor i in range(1, 10):\r\n s = i * int(num[0])\r\n # print(s)\r\n # print(s % 10)\r\n if s % 10 == 0:\r\n print(i)\r\n break\r\n if s % 10 != 0:\r\n m = s % 10\r\n # print(m)\r\n if m / int(num[1]) == 1:\r\n print(i)\r\n break\r\n else:\r\n continue", "k, r = map(int, input().split())\nvalue, price = 0, 0\ni = 1\nwhile (i):\n if ((price%10 == 0) and price != 0) or (price%10 == r):\n break\n value += 1\n price += k\nprint(value)\n \t \t\t \t \t\t\t\t \t\t \t\t\t \t\t\t\t \t", "def shovels(price,ucoin):\r\n bought = 0\r\n new_price = price\r\n while True:\r\n bought += 1\r\n if (new_price % 10) == 0 or ((new_price % 10) - ucoin) == 0:\r\n break\r\n new_price += price\r\n return bought\r\n\r\nprice, ucoin = [int(n) for n in input().split()]\r\nprint(shovels(price,ucoin))", "n,r=map(int,input().split())\r\nt=n\r\nfor i in range (1,10):\r\n if(n%10==r or n%10==0):\r\n print(i)\r\n break\r\n n+=t", "entradas= [int(x) for x in input().split(\" \")]\npreco = entradas[0]\nmoeda_dif = entradas[1]\n\n\npas=1\npreco_total=preco\n\nwhile((preco_total-moeda_dif)%10!=0 and preco_total%10!=0):\n pas+=1\n preco_total+=preco\n\nprint(pas)\n\n\n\n\n\t\t \t\t\t \t\t\t\t \t\t \t \t\t\t \t \t \t", "k,r=map(int,input().split())\r\ni=1\r\nwhile(not(((k*i)%10==0)or((k*i)%10==r))):\r\n i+=1\r\nprint(i)", "n,t=map(int,input().split())\r\nfor i in range(1,1001):\r\n if (n*i)%10 == t or (n*i)%10 ==0:\r\n print(i)\r\n break", "k, r = map(int,input().split())\r\ncounter = 1\r\nwhile True:\r\n res = k*counter\r\n if res % 10 == 0 or (res - r) % 10 == 0:\r\n break\r\n counter += 1\r\nprint(counter)\r\n ", "def main():\r\n k, r = map(int, input().split())\r\n count = 1\r\n price = k\r\n while True:\r\n if (price % 10 == 0) or (price % 10 == r):\r\n break\r\n else:\r\n count += 1\r\n price += k \r\n print(count)\r\n\r\nmain()", "K,R=map(int,input().split())\r\ncount=1\r\nprice=K\r\nwhile price%10!=0 and (price-R)%10!=0:\r\n\tcount+=1\r\n\tprice+=K\r\nprint(count)", "listA = list(map(int,input().split(\" \")))\r\nk = listA[0]\r\nr = listA[1]\r\nfor i in range(1,10):\r\n ans = i*k\r\n rem = ans%10\r\n if rem==0:\r\n print(i)\r\n break\r\n else:\r\n if rem==r:\r\n print(i)\r\n break\r\n ", "x,y= map(int,input().split())\r\na = 1\r\nwhile (a*x)%10!=0and (a*x)%10!=y:\r\n a+=1\r\nprint(a)\r\n", "a,b=map(int, input().split())\r\nfor i in range (1,10):\r\n if a*i%10==b:\r\n print(i)\r\n break\r\n elif a*i%10==0:\r\n print(i)\r\n break", "k, r = map(int, input().split())\r\n\r\nif r == 10:\r\n print(1) # Монет номиналом 10 всегда достаточно, чтобы купить 1 лопату\r\nelse:\r\n n = 1\r\n while (k * n) % 10 != 0 and (k * n) % 10 != r:\r\n n += 1\r\n print(n)", "k, r = map(int, input().split())\r\n\r\nprice = k\r\ncount = 1\r\n\r\nwhile price % 10 != 0 and price % 10 != r:\r\n price += k\r\n count += 1\r\n\r\nprint(count)", "k, r = list(map(int, input().split()))\r\nif k % 10 == 0:\r\n print(\"1\")\r\nelse:\r\n for n in range(1, 10):\r\n if n * k % 10 == 0:\r\n print(n)\r\n break\r\n elif n * k % 10 == r:\r\n print(n)\r\n break\r\n else:\r\n continue\r\n", "price,num=map(int,input().split())\r\n\r\n\r\nfor n in range(1,1000):\r\n temp= n * price\r\n if temp % 10 == num or temp % 10 == 0:\r\n print(n)\r\n break\r\n", "a,b = map(int,input().split())\r\ncost = a\r\nif (a%10) == 0 or (a%10) == b:\r\n print(1)\r\nelse:\r\n while a%10 != 0 :\r\n a +=cost\r\n if a%10 == 0:\r\n print(a//cost)\r\n break\r\n elif a%10 == b:\r\n print(a//cost)\r\n break\r\n \r\n \r\n\r\n\r\n", "k, r = map(int, input().split())\r\n\r\nno_of_shovels = 0\r\n\r\nwhile True:\r\n\tno_of_shovels += 1\r\n\tif (no_of_shovels * k) % 10 in (0, r):\r\n\t\tbreak\r\n\r\nprint(no_of_shovels)", "n, k = map(int,input().split())\r\n\r\nfor i in range(1, 11):\r\n if (n*i) % 10 == k or (n*i) % 10 == 0:\r\n print(i)\r\n break", "k,r=map(int,input().split())\r\ni=1\r\nwhile(True):\r\n if((i*k)%10==0 or (i*k)%10==r):\r\n break\r\n i+=1\r\nprint(i)", "a,b=map(int,input().split())\nif a%10==0:\n print(1)\n\nelse:\n for i in range(1,11):\n d=a*i\n if d%10==b:\n print(i)\n break\n elif d%10==0:\n print(i)\n break\n\t\t \t\t\t \t\t\t \t\t\t \t\t \t", "import sys\r\nimport bisect\r\n# Fast input reading\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n# Constants\r\nMOD = 10**9 + 7\r\nINF = float('inf')\r\n\r\n# Utility functions\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n# Main function\r\ndef main():\r\n # Input reading\r\n k,r=map(int,input().split())\r\n c=2\r\n temp=k\r\n while(k%10!=0 and (k%10)%10!=r):\r\n k=c*temp\r\n c+=1\r\n print(c-1)\r\nif __name__ == \"__main__\":\r\n main()", "k, r = map(int, input().split())\r\nshovels = 1\r\nwhile (k * shovels - r) % 10 != 0 and k * shovels % 10 != 0:shovels += 1\r\nprint(shovels)", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nk,r = getints()\r\nfor i in range(1,11):\r\n s = str(k*i)[-1]\r\n if s == '0' or s == str(r):\r\n print(i)\r\n break", "price,money=map(int,input().split())\r\ni=1\r\nt=price\r\n\r\nwhile(price%10!=0 and price%10!=money):\r\n i+=1\r\n price=t*i\r\nprint(i)", "k,r=map(int,input().split())\r\nfor i in range(1,10):\r\n if (k*i)%10==0 or ((k*i)-r)%10==0:\r\n print(i)\r\n break\r\n ", "k, r = map(int, input().split())\r\nfor i in range(1,11):\r\n if (i*k)%10 == r or (i*k)%10 == 0:\r\n print(i)\r\n break", "input_ = input().split()\nk, r = int(input_[0]), int(input_[1])\n\nn = 1\nwhile True:\n\tif ((k%10)*n)%10 == r:\n\t\tprint(n)\n\t\tbreak\n\tif (n*k) % 10 == 0:\n\t\tif k % 5 == 0:\n\t\t\tprint(n)\n\t\t\tbreak\n\t\tif abs((k % 10 % 2)-(r % 2)) == 1:\n\t\t\tprint(n)\n\t\t\tbreak\n\tn += 1", "k, r = [int(x) for x in input().split()]\r\nx = 1\r\nwhile (k*x)%10!=0 and (k*x)%10!=r:\r\n x += 1\r\nprint(x)", "a,b = map(int, input().split())\r\ni=1\r\nwhile ((i*a-b)%10!=0) and ((i*a)%10!=0):i+=1\r\nprint(i)\r\n", "cena, mon= list(map(int, input().split()))\r\nn=1\r\nwhile True:\r\n lop=cena*n\r\n if lop%10==0:\r\n print(n)\r\n break\r\n elif (lop%10 - mon)==0:\r\n print(n)\r\n break\r\n n+=1\r\n", "# -*- coding: utf-8 -*-\r\nvalues = input().split()\r\nshovel = int(values[0])\r\ncoin = int(values[1])\r\n\r\nfor i in range(1, 11):\r\n prize = shovel * i\r\n if prize % 10 == 0 or (prize - coin) % 10 == 0:\r\n print(i)\r\n break\r\n", "a, b = input().split()\n\n\n\ncount = 1\nwhile True:\n number = int(a)*count\n if number%10 == 0:\n print(count)\n break\n elif (number - int(b)) % 10 == 0:\n print(count)\n break\n count += 1\n", "k, r = map(int,input().split())\r\n\r\ni = 0\r\ncost = 0\r\n\r\nwhile True:\r\n if cost % 10 == 0 and cost>0:\r\n print(i)\r\n break\r\n cost += k\r\n if (cost-r)%10 == 0 and cost>0:\r\n print(i+1)\r\n break\r\n i += 1", "x,y=map(int,input().split())\r\nn=1\r\nwhile True: \r\n if str(x*n)[-1]==str(y) or str(x*n)[-1]==\"0\": \r\n print(n)\r\n break\r\n else:\r\n n+=1", "# -*- coding: utf-8 -*-\n\"\"\"723A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nk,r=map(int,input().split())\ns=1\nwhile (k*s)%10!=r and (k*s)%10!=0:\n s+=1\nprint(s)", "n,r=map(int,input().split())\r\ni=1\r\nwhile (n*i-r)%10!=0 and (n*i)%10!=0:\r\n\ti+=1\r\nprint(i)", "k_r=list(map(int, input().split()))\r\ndef shovel(k, r):\r\n for i in range(1, 11):\r\n if (i * k) % 10 in [0, r]:\r\n break\r\n print(i)\r\nshovel(k_r[0],k_r[1])", "x = input()\r\nfor count in range(0, len(x), 1):\r\n if x[count] == \" \":\r\n a = int(x[:count])\r\n b = x[count + 1:]\r\nfor c in range(1, 10, 1):\r\n tot = str(a * c)\r\n if tot[len(tot) - 1] == \"0\" or tot[len(tot) - 1] == b:\r\n print(c)\r\n break", "# Read the input values\r\nk, r = map(int, input().split())\r\n\r\n# Initialize the number of shovels to 1 (minimum one shovel is required)\r\nshovels = 1\r\n\r\n# Keep increasing the number of shovels until the total price can be paid\r\nwhile (shovels * k) % 10 != 0 and (shovels * k) % 10 != r:\r\n shovels += 1\r\n\r\n# Print the minimum number of shovels required\r\nprint(shovels)\r\n", "k,r=map(int,input().strip().split())\r\nc=0\r\nans=0\r\nfor i in range(1,11):\r\n c=(i*k)\r\n if c%10==r or c%10==0:\r\n ans=i\r\n break\r\nprint(ans)\r\n\r\n", "k, r = map(int, input().split())\r\n \r\nshovel_count = 1\r\ntotal_cost = k\r\n \r\nwhile total_cost % 10 != 0 and (total_cost - r) % 10 != 0:\r\n shovel_count += 1\r\n total_cost += k\r\n \r\nprint(shovel_count)\r\n ", "k,r=map(int,input().split())\r\nfor i in range(1,10000):\r\n if (k*i-r)%10==0 or (k*i)%10==0:\r\n print(i)\r\n break", "k, r = map(int, input().split())\r\ni = 1\r\nwhile True:\r\n if k*i % 10 == 0:\r\n break\r\n if k*i % 10 != 0:\r\n if (k*i - r) % 10 == 0:\r\n break\r\n i += 1\r\nprint(i)\r\n", "shovelPrice, rCoins = map(int, input().split())\r\nminNumber=1\r\n\r\nfor times in range (1,10):\r\n if (times*shovelPrice)%10==0 or ((times*shovelPrice)%10)==rCoins:\r\n minNumber=times\r\n break\r\n \r\n\r\n\r\n \r\n \r\n \r\nprint(minNumber)\r\n\r\n", "a,b=list(map(int,input().split()))\r\ncount=0\r\nsum=1\r\nfor x in range(1,10):\r\n sum=a*x\r\n if sum%10==b or sum%10==0:\r\n break\r\nprint(x)", "u = list(map(int, input().split()))\r\nprice = u[0]\r\npocket = u[1]\r\n\r\n\r\nfor i in range(1, 11):\r\n if (price * i) % 10 == 0 or (price * i) % 10 == pocket :\r\n print(i)\r\n break\r\n", "x,y=map(int,input().split())\r\ns=1\r\nfor i in range(1,9):\r\n if x*i%10==0 or (x*i-y)%10==0:\r\n break\r\n else:\r\n s+=1\r\nprint(s)", "a,s=map(int,input().split())\r\nfor i in range(1,10):\r\n if (a*i)%10==s or (a*i)%10==0:\r\n print(i)\r\n exit()\r\nprint(10)", "k,r = map(int, input().split())\r\nli=[]\r\nfor i in range(1,11):\r\n proizved=i*k\r\n if proizved%10==0 or proizved%10==r:\r\n li.append(i)\r\nprint(min(li))", "line = [int(i) for i in input().split()]\r\n\r\nshovel_price = line[0]\r\n\r\ncoin = line[1]\r\nNOS = 1\r\nwhile (((shovel_price*NOS)%10)%coin !=0 or ((shovel_price*NOS)%10)//coin!=1) and (shovel_price*NOS)%10:\r\n NOS+=1\r\n \r\nprint(NOS)\r\n", "A=[int(x) for x in input().split()]\r\nm=A[0]\r\ncount=0\r\nwhile (m%10!=A[1]) and (m%10!=0):\r\n m=m+A[0]\r\n count+=1\r\nprint(count+1)", "n , m = map(int, input().split())\r\nfound = False\r\ni = 1\r\nwhile not found:\r\n c = n*i\r\n parts = c%10\r\n if parts == m:\r\n found = True\r\n elif parts == 0:\r\n break\r\n else:\r\n i +=1 \r\n\r\n\r\nprint(i)", "k,r = map(int,input().split())\r\nost = k%10\r\ni = 1\r\nflag = False\r\nfor j in range(1,100):\r\n if (k*j)%10 == 0:\r\n flag = True\r\n break\r\n\r\nwhile (ost*i)%10!= r:\r\n i+=1\r\n if i>10**4:\r\n break\r\nif flag == True and (j>i):\r\n print(i)\r\nif flag == False:\r\n print(i)\r\nif flag == True and (j<i):\r\n print(j)\r\n", "inputString = input()\r\n\r\ninputList = [int(i) for i in inputString.split(\" \")]\r\n\r\nshovel = inputList[0]\r\ncoin = inputList[1]\r\n\r\ntotal = 0\r\ncounter = 0\r\n\r\nwhile(total%10 != coin):\r\n counter += 1\r\n total += shovel\r\n\r\n if(total%10 == 0):\r\n break\r\n\r\n\r\nprint(counter)", "k,r=(map(int,input().split()))\r\nfor i in range(1,11):\r\n if (i*k)%10==r or (i*k)%10==0:\r\n print(i)\r\n break", "st=input()\r\nw=st.split(' ')\r\nk=int(w[0])\r\nr=int(w[1])\r\ni=1\r\n# print(k,r)\r\nwhile(True):\r\n if((k*i)%10!=0 and ((k*i)-r)%10!=0):\r\n i=i+1\r\n else:\r\n break\r\n # print(i)\r\nprint(i)", "a, b = list(map(int, input().split()))\nres = 1\n\nt = 1\nwhile True:\n if (a * t) % 10 == 0 or int(str(a * t)[-1]) == b:\n break\n else:\n t += 1\n res += 1\nprint(res)\n", "k, r = map(int, input().split())\r\n\r\nans = 1\r\nwhile True:\r\n if k * ans % 10 == 0 or k * ans % 10 == r:\r\n print(ans)\r\n break\r\n ans += 1\r\n", "b,c = list(map(int, input().split()))\r\nd = b % 10\r\ncontador = 1\r\n\r\nwhile not (d*contador % 10 == 0 or d*contador % 10 == c):\r\n contador += 1\r\n\r\nprint(contador)", "k , r =map(int , input().split())\r\nm = 1\r\nwhile m < 10:\r\n if m * k % 10 == 0 or (m * k - r) % 10 == 0:\r\n print(m)\r\n break\r\n m += 1", "k, r = [int(i) for i in input().split()]\r\nif (k>=1 and k<=1000) and (r>=1 and r<=9):\r\n minNumberShovels = 1\r\n while (True):\r\n if (k*minNumberShovels)%10 == r or (k*minNumberShovels)%10 == 0:\r\n print(minNumberShovels)\r\n break\r\n else:\r\n minNumberShovels +=1\r\nelse:\r\n print(\"Error: The input must contain two integers k and r (1 ≤ k ≤ 1000, 1 ≤ r ≤ 9)\")", "p,b = list(map(int,input().split()))\r\ni = 1\r\nwhile True:\r\n if (p*i)%10 == b or (p*i)%10 == 0:\r\n break\r\n i += 1\r\nprint(i)", "k,r=map(int,input().split())\r\ni=0\r\nwhile i!=1000:\r\n i=i+1\r\n if i*k%10==0 or i*k%10==r:\r\n print(i)\r\n break\r\n", "k,r= [int(x) for x in input().split()]\r\nx=1\r\nwhile (k*x)%10!=0 and (k*x)%10!=r:\r\n x+=1\r\nprint(x)", "# A. Buy a Shovel\r\n\r\nk, r = map(int, input().split())\r\ncount = 1\r\nwhile(True):\r\n if((k * count) % 10 == 0 or (k * count - r) % 10 == 0):\r\n break\r\n else:\r\n count += 1\r\nprint(count)", "def main():\n\tk,r=map(int,input().split())\n\tflag = True\n\tpricemade = 0 \n\tvalue= 0 \n\twhile(flag):\n\t\tif((pricemade%10 == 0 and pricemade !=0) or (pricemade%10 ==r)):\n\t\t\tbreak \n\t\tvalue+=1\n\t\tpricemade+=k\n\n\tprint(value)\n\n\nif __name__ == '__main__':\n\tmain()", "price_of_1_shovel, r = map(int, input().split())\r\nfor i in range(1, 10):\r\n word = str(price_of_1_shovel * i)\r\n if word[-1] == \"0\" or word[-1] == str(r):\r\n print(i)\r\n break\r\n ", "a,b=list(map(int,input().split()))\r\nfor x in range(1,1001):\r\n z=a*x\r\n if z%10==b or z%10==0:\r\n break\r\nprint(x)", "k, r = map(int, input().split())\ni = 1\nif r % k == 0:\n print(r // k)\nelse:\n i = 0\n while True:\n i += 1\n if k * i % 10 == 0 or (i * k) % 10 == r:\n break\n print(i)", "shovelPrice, denomination = stuff = list(map(int,input().strip().split(\" \")))\r\nmod = shovelPrice % 10\r\noriginalShovelPrice = shovelPrice\r\ncount = 1\r\nwhile mod != 0 and mod != denomination:\r\n count += 1\r\n \r\n shovelPrice += originalShovelPrice\r\n mod = shovelPrice % 10\r\n \r\nprint(count) ", "k, r = map(int, input().split())\n\nmultiplier = 1\nwhile True:\n if k * multiplier % 10 == 0 or k * multiplier % 10 == r:\n break\n multiplier += 1\n\nprint(multiplier)\n", "def buy_a_shovel():\n k, r= map(int, input().split())\n n = 1\n while (n*k)%10!=0 and (n*k-r)%10!=0:\n n = n+1\n print(n)\nbuy_a_shovel()", "k, r = map(int, input().split())\r\n\r\ncnt1 = 1\r\ncnt2 = 1\r\nflag = 0\r\nf = 1\r\nf1 = 0\r\nf2 = 0\r\nwhile f:\r\n if (cnt1 * k - r) % 10 == 0 and not f1:\r\n f1 = 1\r\n else:\r\n cnt1 += 1\r\n if cnt2 * k % 10 == 0 and not f2:\r\n f2 = 1\r\n else:\r\n cnt2 += 1\r\n \r\n if f1 and f2:\r\n f = 0\r\n\r\n if cnt1 != cnt2:\r\n break\r\n\r\nprint(min(cnt1, cnt2))\r\n", "k, r = input().split()\nk, r = int(k), int(r)\n\n# if k%10 == 0:\n# print(1)\n# exit()\n# if (k-r)%10 == 0:\n# print(1)\n# exit()\n\ni = k\nwhile True:\n # print(i)\n if(i%10 == 0) or ((i-r)%10 == 0):\n print(i//k)\n break\n i += k\n", "k, r = list(map(int, input().split()))\r\n\r\ndef b(k, r):\r\n\r\n i = 1\r\n\r\n while True:\r\n\r\n if (k * i) % 10 == 0 or (k * i) % 10 == r:\r\n\r\n return i\r\n \r\n i += 1\r\n\r\nprint(b(k, r))", "k, r = map(int, input().split())\r\na = k\r\ncount = 1\r\nwhile True:\r\n if a % 10 != 0 and a % 10 != r:\r\n count += 1\r\n a += k\r\n else:\r\n print(count)\r\n break", "k,r=map(int,input().split())\r\nl=1\r\nwhile True:\r\n m=l*k \r\n if m%10==r or m%10==0:\r\n print(l)\r\n break \r\n l+=1 \r\n ", "price , r = map(int,input().split())\r\nsum = 0 \r\ncount = 0 \r\nwhile True : \r\n sum += price \r\n count += 1\r\n if sum % 10 == r or sum % 10 == 0 : \r\n break \r\nprint(count)", "import math\r\nk,r=map(int,input().split())\r\nt=1\r\ne=k\r\nwhile e%10!=0:\r\n if (e-r)%10==0:break\r\n e+=k\r\n t+=1\r\nprint(t)\r\n", "price, moneta = [int(x) for x in input().split()]\r\nn = 1\r\nlast_num = price % 10\r\nwhile (last_num * n) % 10 != 0 and (last_num * n) % 10 != moneta:\r\n n += 1\r\n \r\nprint(n)", "n, r = map(int, input().split())\r\nfor i in range(1, 1001):\r\n if (i*n)%10 == r or (i*n)%10 == 0:\r\n print(i)\r\n break\r\n \r\n", "k,r =[int(x) for x in input().split()]\r\ni = 1\r\nwhile True:\r\n if (k*i-r)%10==0 or k*i%10==0:\r\n print(i)\r\n break\r\n else:\r\n i = i+1", "x,y=map(int,input().split())\r\ncon=1\r\nwhile 1:\r\n if (x*con)%10==y or (x*con)%10==0:\r\n print(con)\r\n break\r\n con+=1", "k, r = map(int, input().split())\r\notv =1\r\nt =k\r\nwhile True:\r\n if (t%10!=0) and ((t-r)%10!=0):\r\n t+=k\r\n otv+=1\r\n else:\r\n break\r\nprint(otv)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 29 10:37:01 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nk,r=map(int,input().split())\r\nflag=0\r\nfor i in range(1,10):\r\n if (k*i)%10==r:\r\n n=i\r\n flag=1\r\n break\r\nif flag==0:\r\n for i in range(1,11):\r\n if (k*i)%10==0:\r\n n=i\r\n break\r\n \r\nprint(n)\r\n", "k, r = map(int, input().split())\r\n\r\nfor shovels in range(1, 11):\r\n if (k * shovels - r) % 10 == 0 or (k * shovels) % 10 == 0:\r\n print(shovels)\r\n break\r\n", "# 코드포스 732A Buy a Shovel\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nk, r = map(int, put().split())\r\nfor i in range(1, 11):\r\n if k * i % 10 in {r, 0}:\r\n print(i)\r\n break", "k, r = map(int, input().split())\r\ni = 1\r\ncount = 1\r\nwhile (k * i) % 10 != r:\r\n if (k * i) % 10 == 0:\r\n break\r\n count += 1\r\n i += 1\r\n\r\nprint(count)\r\n", "k,r=map(int,input().split())\r\n\r\nfor i in range(1,11):\r\n if (i*k) % 10 in [0,r]:\r\n break\r\nprint(i)", "\r\nk, r = map(int, input().split())\r\nn = 1\r\nwhile (k*n) % 10 not in [0,r]:\r\n n = n + 1\r\nprint(n)", "s = input()\r\ncost, r = int(s.split()[0]), int(s.split()[1])\r\nk = 1\r\nwhile True:\r\n if (cost*k - r) % 10 == 0:\r\n print(k)\r\n break\r\n elif (cost*k)% 10 == 0:\r\n print(k)\r\n break\r\n else:\r\n k += 1", "n, k = map(int, input().split()); a = [n * l % 10 == 0 or n * l % 10 == k for l in range(1, 11)]; print(a.index(True) + 1)", "price,nominal=map(int,input().split())\r\nlopat=0\r\nwhile True:\r\n lopat+=1\r\n if (price*lopat-nominal)%10==0 or price*lopat%10==0:\r\n print(lopat)\r\n break", "k,r = map(int,input().split())\r\ni = 1\r\nwhile 0 != i * k % 10 != r:\r\n\ti+=1\r\nprint(i)\r\n", "def solve(k: int, r: int) -> int:\r\n for i in range(1, 10):\r\n if k * i % 10 == 0 or k * i % 10 == r:\r\n return i\r\n\r\n\r\nassert solve(117, 3) == 9\r\nassert solve(237, 7) == 1\r\nassert solve(15, 2) == 2\r\n\r\nif __name__ == '__main__':\r\n k, r = map(int, input().split())\r\n print(solve(k, r))\r\n", "x, y = map(int, input().split())\r\ni = 1\r\np = False\r\nwhile p == False:\r\n if (i*x) % 10 == 0 or (i*x-y) % 10 == 0:\r\n p = True\r\n else:\r\n i += 1\r\nprint(i)", "a, b = map(int, input().split())\ni = 1\nwhile 0 != (i * a) % 10 != b:\n i += 1\nprint(i)", "n,m=map(int,input().split())\n\ndef funcion(k,r):\n for i in range(1,11):\n # if (i*k)%10==0 or (i*k)%10==r:\n if (i*k)%10 in [0,r]:\n break\n\n return i\nprint (funcion(n,m)) ", "n,r=input().split()\r\nn=int(n)\r\nr=int(r)\r\ni=1\r\nc=0\r\nwhile(1):\r\n p=n*i\r\n if(p%10==0 or p%10==r):\r\n c+=1\r\n break\r\n i+=1\r\nprint(i)", "k , r = map(int,input().split())\r\nans = 1\r\nwhile True:\r\n result = ans * k\r\n if result%10==0 or result%10==r :\r\n break\r\n else:\r\n ans+=1\r\nprint(ans)", "k,r=map(int,input().split())\n# n=int(input())\nkk=k\nans=-1\nfor i in range(1,10):\n if k%10==0 or (k-r)%10==0:\n ans=i\n break\n else:\n k+=kk\nif ans==-1:print(10)\nelse:print(ans)\n \t\t\t \t\t \t\t \t\t \t\t\t \t \t\t\t", "def main():\r\n price, d = [int(i) for i in input().split()]\r\n n = 0\r\n while True:\r\n if n != 0 and (10*n) % price == 0:\r\n print((10*n) // price)\r\n return\r\n if (10*n+d) % price == 0:\r\n print((10*n+d) // price)\r\n return\r\n n += 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "k, r = map(int, input().split())\n\ntotal_price = k\nnum_shovels = 1\nwhile True:\n if total_price % 10 == 0 or total_price % 10 == r:\n break\n else:\n num_shovels += 1\n total_price += k\n\nprint(num_shovels)\n\n \t \t\t \t\t\t \t \t\t \t\t \t \t\t\t", "def f(k,r):\r\n number = 1\r\n\r\n while True:\r\n if (number*k)%10 == 0:\r\n return number\r\n elif (number*k)%10 == r:\r\n return number\r\n else:\r\n number += 1\r\n\r\ninp = input()\r\ninp = [i for i in inp.split()]\r\nk = int(inp[0])\r\nr = int(inp[1])\r\nprint(f(k,r))", "k, r = map(int, input().split())\r\nfor n in range(1, 10):\r\n if (k*n)%10==0 or (k*n)%10==r:\r\n print(n)\r\n exit(0)", "k,r = map(int, input().split())\r\nsh = 1\r\nwhile True:\r\n c = k * sh\r\n if c%10==0 or c%10==r:\r\n break\r\n sh+=1\r\nprint(sh)", "k,r=map(int,input().split())\r\n\r\nn=k\r\ncnt=1 #맨 처음에 무조건 1개\r\n\r\nwhile n%10!=r and n%10!=0: #1원짜리가 안생기고 몇십원으로 딱 떨어지는 경우도 고려\r\n cnt=cnt+1\r\n if n%10==r or n%10==0: #1원 단위가 같아지거나 0으로 끝나면 멈추기\r\n break\r\n n=n+k # shovel의 갯수만큼 돈 더하기\r\n\r\n\r\nprint(cnt)\r\n", "# list(map(int,input().split()))\r\nimport math\r\n\r\nk,r=list(map(int,input().split()))\r\nn=1\r\nwhile((((k*n)-r)%10)!=0 and ((k*n)%10)!=0):\r\n n+=1\r\nprint(n)", "k, r = map(int, input().split())\r\nshovels_to_buy = 1\r\nwhile (k * shovels_to_buy) % 10 != 0 and (k * shovels_to_buy - r) % 10 != 0:\r\n shovels_to_buy += 1\r\nprint(shovels_to_buy)", "kAndR = input()\r\nkAndR = kAndR.split()\r\nk = kAndR[0]\r\nr = kAndR[1]\r\ncounter = 1\r\nwhile counter > 0:\r\n if k[len(k)-1] == \"0\" or k[len(k)-1] == r:\r\n print(counter)\r\n counter = counter + 0\r\n break\r\n else:\r\n k = str(int(kAndR[0])*(counter+1))\r\n counter = counter + 1", "p,c=map(int,input().split())\r\nx=1\r\nwhile 0!=x*p%10 !=c:\r\n x+=1\r\nprint(x)", "k,r=map(int, input().split())\r\nans=1\r\nost=(k*ans)%10\r\nwhile ost!=r and ost!=0:\r\n ans+=1\r\n ost = k * ans % 10\r\nprint(ans)", "cena, moneta_extra = input().split()\r\ncena = int(cena)\r\nmoneta_extra = int(moneta_extra)\r\n\r\n\r\ndef czy_ok(liczba_lopat):\r\n reszta = liczba_lopat * cena % 10\r\n return reszta == moneta_extra or reszta == 0\r\n\r\nliczba_lopat = 1\r\nwhile not czy_ok(liczba_lopat):\r\n liczba_lopat += 1\r\n\r\nprint(liczba_lopat)", "d,m=map(int, (input().split()))\r\nfor i in range(1,11):\r\n if(i*d)%10 in [0,m]:\r\n break \r\nprint(i)", "a,b = map(int,input().split())\nfor i in range(1,11):\n change = a*i%10\n if (change == 0 or change == b):\n break\nprint (i)\n \t \t \t\t \t \t \t\t \t \t", "k, r = list(map(int, input().split()))\r\ntotal = k\r\nans = 1\r\nwhile (total - r) % 10 != 0 and total % 10 != 0:\r\n ans += 1\r\n total = k*ans\r\nprint(ans)\r\n", "k,r=list(map(int,input().split(' ')))\r\ncnt=1\r\nwhile (k*cnt)%10!=0 and (k*cnt)%10!=r:\r\n cnt+=1\r\nprint(cnt)\r\n", "x,y = map(int,input().split())\r\nb = x%10\r\nsum = 1\r\n\r\nwhile b != 0:\r\n if b%y==0 and b/y ==1:\r\n break;\r\n else:\r\n sum = sum + 1\r\n z = sum * x\r\n a = int(z / 10)\r\n b = int(z % 10)\r\nprint(sum)", "k, r = list(map(int, input().split()))\r\n\r\ncount = 1\r\n\r\nstat = k\r\n\r\nwhile True:\r\n \r\n if (k-r) % 10 == 0 or k % 10 == 0:\r\n break\r\n \r\n \r\n k += stat\r\n\r\n count +=1\r\n\r\nprint(count)\r\n", "a, b = map(int, input().split())\r\nc = 1\r\nwhile((a * c - b) % 10 != 0):\r\n if (a * c) % 10 == 0: break\r\n c += 1\r\nprint(c)", "a, b = map(int, input().split())\r\nk = a % 10\r\np = k\r\nans = 1\r\nwhile p != b and p != 0:\r\n p += k\r\n p %= 10\r\n ans += 1\r\nprint(ans)", "n,m = map(int,input().split())\r\nans = 1\r\n#print(n,m)\r\nx = n\r\nwhile(True ):\r\n \r\n if ((ans*n)%10 == 0 or (ans*n )%10 == m):\r\n break\r\n ans +=1\r\nprint(ans)", "import math\r\nimport string\r\n\r\nvalue, r = map(int, input().split())\r\npointer = 1\r\nwhile True:\r\n if ((value * pointer) % 10 == r) or ((value * pointer) % 10 == 0):\r\n print(pointer)\r\n break\r\n pointer += 1\r\n", "liste=list(map(int,input().split()))\r\ni=1\r\nwhile ((i*liste[0])-liste[1])%10!=0 and (i*liste[0]%10!=0):\r\n i+=1\r\nprint(i)", "k, r = map(int, input().split())\nl=1\nwhile True:\n\tif ((k*l-r)%10==0) or k*l%10 == 0:\n\t\tl = l\n\t\tbreak\n\tl+=1\nl=l\nprint(l)\n", "k,r=map(int,input().split())\r\ni=1\r\nwhile True:\r\n if (k*i)%10==r or (k*i)%10==0:\r\n print(i)\r\n break\r\n i+=1", "k,r = list(map(int, input().split()))\r\nx = 1\r\nwhile(k*x %10 not in [0, r]):\r\n x+=1\r\nprint(x)", "k, r = map(int, input().split())\r\nans = 1\r\ncount = 1\r\n\r\nwhile True:\r\n if k * count % 10 == r or k * count % 10 == 0:\r\n print(ans)\r\n break\r\n else:\r\n ans += 1\r\n count += 1", "k,r=map(int,input().split())\r\nc1=1;c2=1\r\nwhile (k*c1)%10!=0 and (k*c1)%10!=r:\r\n c1+=1;c2+=1\r\nprint(c2)", "k,r=(map(int, input().split()))\r\ng=k\r\ni=1\r\nwhile (k%10!=0 and (k-r)%10!=0):\r\n i+=1\r\n k=g*i\r\nprint(i)", "\r\na,b= map(int, input().split())\r\ntp=a\r\nsh=1\r\nwhile(tp%10!=0 and tp%10!=b):\r\n tp+=a\r\n sh+=1\r\nprint(sh)", "raj,shiv = map(int, input().split())\r\ns = 1\r\nwhile (s*raj) % 10 != 0 and (s * raj) % 10 !=shiv:\r\n s += 1\r\nprint(s)", "k,r=map(int,input().split())\r\ni=1 \r\nwhile i*k%10 != r and i*k%10 != 0:\r\n i+=1\r\nprint(i)", "a,b=map(int,input().split())\r\nn=1;\r\nwhile 1:\r\n if (n*a)%10==0 or ((n*a)-b)%10==0:\r\n print(n)\r\n break\r\n else:\r\n \r\n n=n+1\r\n ", "shovel_price, coins = input().split()\r\nshovel_price, coins = int(shovel_price), int(coins)\r\nnumber_of_shovels = 1\r\noutput = False\r\nif shovel_price % 10 == 0 or shovel_price % 10 == coins:\r\n print(number_of_shovels)\r\nelse:\r\n while not output: \r\n number_of_shovels += 1\r\n if shovel_price*number_of_shovels % 10 == 0 or shovel_price*number_of_shovels % 10 == coins:\r\n output = True\r\n print(number_of_shovels)\r\n", "k,r =map(int,input().split())\n\nfor i in range(1,11):\n if(k*i-r)% 10 ==0 or (k*i)%10 == 0:\n print(i)\n break\n\t \t\t \t \t \t \t\t \t \t \t\t \t\t", "k,r=map(int,input().split())\n\nans=10\n\nfor x in [10,9,8,7,6,5,4,3,2,1]:\n\tif ((k*x)%10)==r or (k*x)%10==0:\n\t\tans=x\nprint(ans)\n\t\t\t\t \t \t\t\t\t\t \t \t\t\t \t\t\t\t \t\t", "k, r = map(int, input().split(' '))\r\nshovel = 1\r\nwhile (shovel * k - r) % 10 != 0 and (shovel * k) % 10 != 0:\r\n shovel += 1\r\n \r\nprint(shovel)", "p, q = map(int, input().split())\r\n\r\nfor i in range(1, 11):\r\n if (i * p) % 10 == q or (i * p) % 10 == 0:\r\n print(i)\r\n break\r\n", "num1,num2 = map(int,input().split())\r\nn =0\r\nwhile True:\r\n\tn += 1\r\n\tnum= n * num1\r\n\tif num%10 == num2 or num%10 == 0:\r\n\t\tprint(n)\r\n\t\tbreak", "k,r=map(int,input().split())\r\n\r\n\r\nfor i in range(1,10):\r\n if (k*i)%10==r or (k*i)%10==0:\r\n print(i)\r\n break", "polycarp = list(map(int, input().split()))\r\nk = polycarp[0]\r\nr = polycarp[1]\r\ncounter = 1\r\n\r\nwhile ((k * counter - r) % 10 != 0 and (k * counter) % 10 != 0):\r\n counter += 1\r\n\r\nprint(counter)", "price, burles = map(int, input().split())\r\n\r\nfor i in range(1, 11):\r\n cost = i * price\r\n if cost % 10 == burles or cost % 10 == 0:\r\n print(i)\r\n break\r\n", "a,b=map(int,input().split())\r\ni=1\r\nsum=a\r\nwhile((sum-b)%10!=0 and sum%10!=0):\r\n sum+=a\r\n i+=1\r\n \r\nprint(i)\r\n \r\n ", "k, r = map(int, input().split())\r\nshovels_to_buy = 1\r\n\r\nwhile (k * shovels_to_buy) % 10 != 0 and (k * shovels_to_buy) % 10 != r:\r\n shovels_to_buy += 1\r\n\r\nprint(shovels_to_buy)\r\n", "k, r = map(int,input().split())\r\ns = k\r\nans = 1\r\nwhile not (s % 10 == 0 or s % 10 == r):\r\n s += k\r\n ans += 1\r\nprint(ans)\r\n\r\n", "str=input()\n\nk=str.split(' ')[0]\nr=str.split(' ')[1]\n\nk=int(k)\nr=int(r)\n\nco=1\n\nwhile True:\n if ((k*co)%10==0 or (k*co)%10==r):\n break\n else:\n co+=1\nprint(co)\n \t\t\t\t\t \t\t \t\t\t \t \t\t \t\t\t\t \t\t\t\t", "k,r = map(int,input().split())\r\nfor i in range(1,11):\r\n l = k*i\r\n s = str(l)\r\n if s[-1] == str(r):\r\n print(i)\r\n break\r\n elif s[-1] == '0':\r\n print(i)\r\n break\r\n else:\r\n continue", "def shovel(k, r):\r\n sol = 1\r\n while True:\r\n if (sol*k-r)%10 == 0:\r\n return sol\r\n elif (sol*k) %10 == 0:\r\n return sol\r\n else:\r\n sol += 1\r\n\r\nif __name__ == \"__main__\":\r\n k, r = map(int, input().split())\r\n print(shovel(k, r))", "k,r =map(int,input(\"\").split())\r\nld = k%10\r\nfor i in range(1,10):\r\n if (ld*i)%10==r or (ld*i)%10==0:\r\n ans = i\r\n break\r\n else:\r\n ans = 0 \r\nprint(ans)\r\n", "k, r = [int(x) for x in input().split()]\r\nfor i in range(1, 11):\r\n if k*i % 10 == 0 or (k*i - r) % 10 == 0:\r\n print(i)\r\n break\r\n \r\n", "n=[int(i) for i in input().split()]\r\nfor i in range(1,10000):\r\n if (n[0]*i)%10==0 or ((n[0]*i)%10)-n[1] ==0:\r\n print(i)\r\n break", "a, b = map(int, input().split())\r\nc = a\r\nt = 1\r\nwhile a % 10 != 0:\r\n if a % 10 == b:\r\n break\r\n t += 1\r\n a += c\r\nprint (t)", "k, r = map(int, input().split())\r\nfor n in range(1, 100):\r\n total = n * k\r\n if total % 10 == 0 or total % 10 == r:\r\n print(n)\r\n exit()\r\n\r\nfor n in range(11, 100):\r\n total = n * k\r\n if total % 10 == 0 or total % 10 == r:\r\n print(n//10)\r\n exit()\r\n", "k,r = map(int,input().split())\r\ncount =1\r\nwhile (0!=k*count%10!=r):\r\n\tcount+=1\r\nprint(count)\t", "k, r = map(int, input().split())\r\nsh = 1\r\nchange = True\r\nwhile change:\r\n cost = sh * k\r\n if cost % 10 in [0, r]:\r\n change = False\r\n else:\r\n sh += 1\r\n \r\n\r\nprint(sh)", "n, m = list(map(int, input().split()))\r\n\r\ni = 1\r\nwhile True:\r\n k = n*i\r\n if k % 10 == 0 or k % 10 == m:\r\n print(i)\r\n break\r\n i += 1\r\n", "k , r = list(map(int,input().split(\" \")))\r\n\r\n\r\nfor i in range(1,1000):\r\n if (k * i) % 10 == r:\r\n print(i)\r\n break\r\n elif (k * i) % 10 == 0:\r\n print(i)\r\n break\r\n else:\r\n pass", "k,r=map(int,input().split())\r\ni=1\r\nwhile(True):\r\n sum=k*i\r\n if sum%10==r or sum%10==0:\r\n print(i)\r\n break\r\n i+=1", "n,l=map(int,input().split())\r\nc=1\r\nwhile 0!=(c*n)%10!=l:\r\n c+=1\r\nprint(c)", "def intRd():\r\n return int(input())\r\n\r\ndef lstRd():\r\n return list(map(int, input().split()))\r\n\r\nk, r = lstRd()\r\n\r\n\r\nfor i in range(1, 11):\r\n if ((k * i) % 10) == r or (k * i) % 10 == 0:\r\n print(i)\r\n break\r\n", "k,r = map(int,input().split())\r\nn = 1\r\nwhile (k * n % 10) - r != 0:\r\n if k * n % 10 == 0:\r\n break\r\n n += 1\r\nprint(n)\r\n\r\n", "# import sys\r\n\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\nk, r = map(int, input().split())\r\nans = 1\r\nwhile True:\r\n if (k * ans) % 10 == 0 or (k * ans - r) % 10 == 0:\r\n break\r\n ans += 1\r\nprint(ans)", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = a\r\nfor i in range(1,11):\r\n if a % 10 == 0 or a % 10 == b:\r\n print(i)\r\n break\r\n else:\r\n a = a + c\r\n \r\n", "n,b=map(int,input().split())\r\nl=[]\r\nfor i in range(1,11):\r\n q=(n*i)\r\n if (q % 10 ==0) :\r\n l.append(i)\r\nfor i in range(1,11):\r\n qq=n*i\r\n if ((qq-b) % 10 ==0):\r\n l.append(i)\r\nprint(min(l))", "price, addition_burle = input().split()\r\n\r\n\r\ndef func(k, r):\r\n for i in range(1, 11):\r\n if (i * k) % 10 in [0, r]:\r\n break\r\n\r\n return i\r\n\r\n\r\nprint(func(int(price), int(addition_burle)))", "\r\nk, r = map(int,input().split())\r\n\r\nfor i in range(1,11):\r\n if (k*i) % 10 == r or (k*i) % 10 == 0:\r\n print(i)\r\n break\r\n", "a, b = map(int, input().split())\r\nk = 1\r\nt = True\r\nwhile t:\r\n if (a * k) % 10 == 0 or (a * k) % 10 == b:\r\n t = False\r\n else:\r\n k = k + 1\r\nprint(k)\r\n", "s=list(map(int,input().split(' ')))\r\ni=1\r\nwhile(True):\r\n if(str(int(str(s[0])) * i)[-1] in [\"0\",str(s[1])]): \r\n break\r\n else:\r\n i+=1\r\nprint(i)", "x,y=list(map(int,input().split(\" \")))\r\ni=1\r\n\r\nwhile(1):\r\n if (((i*x)%10==0) or (((i*x)%10)-y==0)):\r\n print (i)\r\n break\r\n else:\r\n i+=1", "def BuyAShovel(pricePerShovel,change):\r\n count=1\r\n while True:\r\n if (count*pricePerShovel)%10==0 or (count*pricePerShovel)%10==change or pricePerShovel==change:\r\n if (count*pricePerShovel)%10==0 or (count*pricePerShovel)%10==change:\r\n return count\r\n else:\r\n count+=1\r\n\r\nprice,change=map(int,input().split())\r\nprint(BuyAShovel(price,change))", "#!/bin/python3\n\n[ K, R ] = [ int( i ) for i in input().split() ]\n\nqtd = 1\naux = K\nwhile (K % 10 != 0) and (( K - R ) % 10 != 0):\n K += aux\n qtd += 1\n\nprint( qtd )\n", "k,r = map(int,input().split())\r\ncnt = 1\r\nwhile True:\r\n if (k*cnt)%10 == r or (k*cnt)%10 == 0:\r\n shovels = cnt\r\n break\r\n\r\n cnt+=1\r\nprint(int(shovels))", "k,r=input().split()\r\nk=int(k)\r\nfor i in range(10):\r\n d=str(i*k)\r\n if d[-1]==r or d[-1]=='0' and i!=0:\r\n print(i)\r\n break", "def main():\r\n D = 10\r\n k, r = map(int, input().split())\r\n \r\n for p in range(1, D+1):\r\n u = p * k\r\n if u % D == 0 or u % D == r:\r\n print(p)\r\n break\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "c,k=map(int,input().split())\r\nj=1\r\nwhile 1:\r\n if ((j*c)-k)%10==0 or (j*c)%10==0:\r\n print(j)\r\n break\r\n else:\r\n j+=1", "from math import dist, ceil, floor, sqrt, log\r\nimport itertools\r\nimport math\r\nimport functools\r\nimport operator\r\nimport collections\r\nimport heapq\r\nimport re\r\nimport string\r\nfrom sys import stdin\r\ninp = stdin.readline\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l: list): return ' '.join(map(str, l))\r\n\r\n\r\ndef main():\r\n k, r = IA()\r\n c = 1\r\n cost = k\r\n s = set([0, r])\r\n while k % 10 not in s:\r\n k += cost\r\n c += 1\r\n return c\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "m = list(map (int , input() . split()))\r\n\r\n\r\nfor i in range(1,11):\r\n x = m[0]*i-m[1]\r\n y = m[0]*i\r\n if x % 10 == 0 or y % 10 == 0 :\r\n print(i)\r\n break\r\n\r\n", "\r\nk,r= map(int, input().split())\r\nc=0\r\nfor i in range(1,11):\r\n p=(k*i)%10\r\n if(p==r or p==0):\r\n c+=1\r\n break\r\n else:\r\n c+=1\r\nprint(c)", "#для код форса\r\nkr = list(map(int, input().split()))\r\nk = kr[0]\r\nr = kr[1]\r\nl = 1\r\nt = 1\r\nwhile t != 0:\r\n if (k*l - r) % 10 == 0:\r\n print(l)\r\n t =0\r\n elif k*l % 10 == 0:\r\n print(l)\r\n t = 0\r\n else:\r\n l += 1 ", "k, r = map(int, input().split())\np = False\nfor i in range(1, 11):\n a = str(k * i)\n if a[-1] == str(r) or a[-1] == '0':\n if not p:\n print(i)\n p = True\n", "k, r = map(int, input().split())\r\nfor i in range(1, 11):\r\n x = k * i\r\n x %= 10\r\n if x == 0 or x == r:\r\n print(i)\r\n break", "k, r = map(int, input().split())\r\no = k\r\nwhile True:\r\n a = str(k)\r\n if a[-1] == \"0\" or a[-1] == str(r):\r\n print(k // o)\r\n break\r\n k += o", "import sys\r\nfrom collections import Counter, deque\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n r = n % 10\r\n i = 1\r\n while (r*i) % 10 != k and (r*i) % 10 != 0:\r\n i+=1\r\n print(i)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "k,r=map(int,input().split())\r\nshovel=1\r\nwhile True :\r\n if (k*shovel)%10==0 or (k*shovel-r)%10==0 :\r\n break\r\n shovel+=1\r\nprint(shovel)", "k, r = map(int, input().split())\r\n\r\ni = 1\r\nwhile (i*k - r) % 10 != 0 and (i*k) % 10 != 0:\r\n i += 1\r\n\r\nprint(i)\r\n", "k, r = map(int, input().split())\r\nshovels = 1\r\nwhile True:\r\n if (shovels*k)%10==r or (shovels*k)%10==0:\r\n print(shovels)\r\n break\r\n else:\r\n shovels+=1", "# Source: https://usaco.guide/general/io\r\n\r\ne, r = map(int, input().split())\r\nke = e\r\ncounter = 1\r\n\r\nwhile True:\r\n if (ke % 10) - r != 0:\r\n if ke % 10 == 0:\r\n break\r\n ke += e\r\n counter += 1\r\n if counter > 10:\r\n break\r\n else:\r\n break\r\n\r\nprint(counter)", "def my_solution(a, b):\r\n shovels = 1\r\n while (((a * shovels % 10) != 0) and ((a * shovels - b) % 10 != 0)):\r\n shovels += 1\r\n print(shovels)\r\n\r\na, b = map(int, input().split())\r\nmy_solution(a, b)", "a,b=map(int,input().split())\r\ni=1\r\nwhile True:\r\n if (a*i)%10 in [0,b]:\r\n print(i)\r\n exit()\r\n i+=1", "#Taking Input\nk,r=map(int,input().strip().split())\ncount=1\n#Running While loop\nwhile(True):\n if (count*k-r)%(10)==0 or (count*k)%10==0:\n print(count)\n break\n\n count=count+1 #incrementing while loop\n\n \t\t \t\t\t\t\t \t\t\t \t \t \t \t\t \t\t\t\t", "a = input().split()\r\na = [int(x) for x in a]\r\nk = a[0]\r\nr = a[1]\r\n\r\nfor i in range(1,10):\r\n if k * i % 10 == 0 or k * i % 10 == r:\r\n print(i)\r\n break", "per,change=map(int,input().split(\" \"))\r\nans=1\r\nwhile ans*per%10!=0 and ans*per%10!=change:\r\n ans+=1\r\nprint(ans)", "k,r = map(int, input().split())\r\nfor i in range(1,11):\r\n if (i*k-r)%10==0 or i*k%10==0:\r\n print(i)\r\n break", "a,b=map(int,input().split())\r\nm=str(a)\r\ns=a\r\nif m[-1]==str(b):\r\n print(1)\r\nelse:\r\n for i in range(1,1000):\r\n a=a*i\r\n m=str(a)\r\n if m[-1]==str(b) or m[-1]==str(0):\r\n print(i)\r\n break\r\n a=s\r\n \r\n \r\n \r\n", "k,r=map(int,input().split())\r\ns=k\r\ni=1\r\nwhile (s%10)not in [r,0]:\r\n i+=1\r\n s=k*i\r\n#print(s)\r\nprint(i)\r\n", "n,k=map(int,input().split())\r\nd=0\r\nfor i in range(1,15):\r\n d=n*i\r\n if d%10==k or d%10==0:\r\n print(i)\r\n break", "# https://codeforces.com/problemset/problem/732/A\r\n\r\ndef main():\r\n k, r = map(int, input().split())\r\n for i in range(1, 11):\r\n if i * k % 10 == 0 or i * k % 10 == r:\r\n print(i)\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k, r = map(int, input().split())\r\n\r\nlst = []\r\n\r\n# for i in range (1, 10):\r\n# lst.append((k%10)*i)\r\ncount = 0 \r\nfor i in range (1, 10):\r\n if r == (k*i)%10 or (k*i)%10 == 0:\r\n count = i\r\n break\r\n \r\nif count != 0:\r\n print(count)\r\nelse:\r\n print(10)", "n,y=list(map(int,input().split()))\r\nx,s=1,n\r\nwhile s%10!=0 and (s-y)%10!=0:\r\n x+=1\r\n s+=n\r\nprint(x)\r\n", "k, r = map(int,input().split())\r\nfor i in range(1,10):\r\n if k*i % 10 == 0 or (k*i-r) % 10 == 0:\r\n print(i)\r\n break\r\n", "k, r = map(int, input().split())\r\nresult = 1\r\nwhile k * result % 10 and (k * result - r) % 10:\r\n result += 1\r\nprint(result)\r\n", "k,r=map(int,input().split())\r\nfor i in range(1,10):\r\n if k*i%10==r or k*i%10==0:\r\n break\r\nprint(i)", "shovel_price, coin_value = (int(i) for i in input().split())\nshovels_to_buy = 1\nwhile shovel_price * shovels_to_buy % 10 != 0 and (shovel_price * shovels_to_buy - coin_value) % 10 != 0:\n shovels_to_buy += 1\nprint(shovels_to_buy)\n", "a, b = map(int, input().split())\r\ns, i = True, 1\r\nwhile s:\r\n if i*a%10==0 or (i*a-b)%10==0:\r\n print(i)\r\n s = False\r\n i += 1\r\n", "n, r = list(map(int, input().split()))\r\nnumber = n\r\ncounter = 1\r\nwhile True:\r\n if number % 10 == 0 or number % 10 == r: break\r\n counter += 1\r\n number += n\r\nprint(counter)", "k, r = input(\"\").split(\" \")\n\nbalance = int(k) % 10\n\nshovelItem = -1\n\nfor i in range(1, 11):\n if (balance*i % 10) == int(r) or (int(k)*i % 10) == 0:\n shovelItem = i\n break\n\n\nprint(shovelItem)\n\t \t \t \t\t \t \t\t\t \t \t \t \t", "x,y=map(int,input().split()) \r\nans=0\r\nfor i in range(1,10):\r\n t=x*i \r\n if t%10==0 or t%10==y:\r\n ans=i\r\n break \r\n else:\r\n ans=i\r\nprint(ans)", "a=input().split()\r\nk=int(a[0]) #117\r\nr=int(a[1]) #3\r\nx=1\r\nwhile((k*x)%10!=r):\r\n if((k*x)%10==0):\r\n break\r\n x+=1\r\nprint(x) \r\n\r\n", "# __________________________\r\n# | { Meow Meow } |\r\n# |________________________|\r\n# \\(^ < ^)/\r\n# | | \r\n# |___| \r\n# | |\r\n# |_|_\r\ndef Solve():\r\n a,b=[int(i) for i in input().split()]\r\n roule = a\r\n res = 1\r\n while a % 10 != b and a % 10 != 0:\r\n a = 1\r\n a = roule * res\r\n res +=1\r\n return res if res == 1 else res - 1 \r\n# _________________________________________________________________ # \r\ndef meow():\r\n # t = int(input())\r\n # while t != 0:\r\n # print(Solve())\r\n # t-=1\r\n print(Solve())\r\nmeow() \r\n\r\n", "k,r = map(int,input().split())\r\ni = 1\r\nwhile(i>0):\r\n res = k * i\r\n m = res%10\r\n if m == r or m == 0:\r\n print(i)\r\n break\r\n else:\r\n i = i+1", "k , r =map(int , input().split())\r\nm = 1\r\nif k % 10 == 0 or (k - r) % 10 == 0:\r\n print(\"1\")\r\nelse:\r\n l = k\r\n while m < 11:\r\n if l % 10 == 0 or (l-r) % 10 == 0:\r\n print(m-1)\r\n break\r\n else:\r\n l = m * k\r\n m += 1", "k,r = map(int, input().split())\r\nx = 0\r\nwhile True:\r\n x += 1\r\n if (k*x) % 10 == 0 or (k*x) % 10 == r:\r\n print(x)\r\n break", "k , r = input().split(' ')\r\nK = int(k)\r\nR = int(r)\r\ncheck = True\r\ncounter = 1\r\nwhile(check):\r\n if (counter * K % 10 == 0):\r\n check = False\r\n elif (((counter * K) - R )% 10 == 0):\r\n check = False\r\n else:\r\n counter += 1\r\nprint(counter)", "from sys import stdin,stdout\r\nfrom collections import Counter,defaultdict \r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n,m = II()\r\n for i in range(1,10):\r\n if n*i%10 == 0 or n*i%10 == m:\r\n print(i)\r\n break \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nsolve() \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndenom, change = inlt()\r\n\r\nfound = False\r\nshovels = 1\r\nwhile not found:\r\n mul = shovels * denom\r\n if mul % 10 == 0 or (mul % 10) - change == 0:\r\n print(shovels)\r\n found = True\r\n else:\r\n shovels += 1", "list = list(map(int,input().split())) \r\nk = list[0]\r\nr = list[1]\r\ncount = 1\r\n\r\nwhile(((count * k) - r) % 10 != 0) and ((count * k) % 10 != 0):\r\n count = count + 1\r\nprint(count)", "#বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n#بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ\r\n\r\n#Bismillahir Rahmanir Rahim\r\n\r\n#************************************************************************\r\n\r\n #PROBLEM :A. Buy a Shovel\r\n #SOLUTATOIN....\r\n\r\n#************************************************************************\r\n\r\nk,r=map(int,input().split())\r\nfor i in range(1,11):\r\n if(i*k)%10==r or (i*k)%10==0:\r\n print(i)\r\n break", "k,r = map(int, input().split())\r\ni = 1\r\nwhile((k*i)%10!=r and (k*i)%10!=0):\r\n i = i + 1\r\nprint(i)", "import sys\r\n\r\nnumbers=[int(i)for i in sys.stdin.readline().split()]\r\n\r\nk=numbers[0]\r\nr=numbers[1]\r\n\r\ni=1\r\n\r\nwhile i <= 10:\r\n if k%10==0:\r\n print(1)\r\n sys.exit()\r\n if i*k%10==0:\r\n print(i)\r\n sys.exit()\r\n if i*k%10==r:\r\n print(i)\r\n sys.exit()\r\n \r\n i += 1", "k, r = [int(a) for a in input().split()]\r\ncount = 1\r\na = k\r\nwhile((k%10 != 0 ) and ((k-r)%10 != 0)):\r\n k+=a\r\n count+=1\r\nprint(count)\r\n ", "a,b=map(int,input().split())\r\n\r\nfor i in range (1,10):\r\n if (a*i)%10==0 or (a*i)%10==b:\r\n print (i)\r\n break\r\n\r\n", "k,r=map(int, input().split())\r\nc=1\r\nwhile True:\r\n if (k*c)%10==r or (k*c)%10==0:\r\n print(c)\r\n exit(0)\r\n else:\r\n c+=1", "a, b = map(int, input().strip().split(' '))\r\n\r\nc = 1\r\n\r\nwhile (a * c) % 10 != 0 and (a * c) % 10 != b:\r\n c += 1\r\n\r\nprint(c)", "#p15\r\nk , r = [int(x) for x in input().split(\" \")]\r\nlastLetters = k % 10\r\n\r\nfor i in range(1 ,11):\r\n if (k * i) % 10 in [r , 0]:\r\n print(i)\r\n break ", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(k, r):\r\n for i in range(1, 21):\r\n if (i*k) % 10 in [0, r]:\r\n sys.stdout.write(f'{i}\\n')\r\n return \r\n\r\nk, r = [int(x) for x in input().split()]\r\nprocess(k, r)", "def solve():\r\n shovel_cost , coins = map(int,input().split())\r\n for i in range(1,10):\r\n rem = (i * shovel_cost) % 10\r\n if rem == coins or rem == 0 :\r\n print(i)\r\n break \r\n\r\nsolve()", "k,r=map(int,input().split())\r\nfor t in range(1,10):\r\n if (k*t)%10==0 or (k*t)%10==r:\r\n print(t)\r\n break", "def main(): \r\n \r\n \r\n k, r = map(int, open(0).read().split())\r\n for i in range(1, 11):\r\n if str(k * i)[-1] in ['0', str(r)]:\r\n break\r\n print(i)\r\n\r\nmain()", "n,x = list(map(int,input().split()))\r\n\r\nnumber = 1\r\nwhile True:\r\n if (number*n-x) % 10 == 0 or number*n % 10 == 0:\r\n print(number)\r\n break\r\n else:\r\n number += 1", "\r\nn, k = map(int, input().split())\r\nn %= 10\r\nfor i in range(1, 10):\r\n y = (n*i) % 10\r\n if y == k or y == 0:\r\n print(i)\r\n break\r\n", "a,b=list(map(int,input().split()))\r\nc=0\r\nd=0\r\nwhile d%10 !=b or d==0:\r\n d+=a\r\n c+=1\r\n if d%10==0:\r\n break\r\nprint(c)", "a,b =map(int,input().split())\r\ni=1\r\nwhile (a*i)%10 != 0 and (a*i)%10 != b:\r\n i+=1\r\nprint(i)", "k, r = input(\"\").split()\nk = int(k)\nr = int(r)\na = k\ncounter = 2\nn = 1\n\nwhile True:\n if ((k - r) % 10 == 0) or (k % 10 == 0):\n break\n else:\n k = k + a\n n += 1\n counter += 1\n\nprint(n)\n\t\t \t \t\t \t\t \t \t\t \t\t \t\t\t \t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\ndef solve(k: int, r: int) -> str:\r\n c = 1\r\n while 1:\r\n if (c * k) % 10 == 0 or (c * k - r) % 10 == 0:\r\n break\r\n c += 1\r\n print(c)\r\n\r\ndef main() -> None:\r\n k, r = map(int, input().split())\r\n\r\n solve(k, r)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "k,r=map(int,input().split())\r\na=k%10\r\ni=1\r\nwhile True:\r\n mul=a*i\r\n mul=mul%10\r\n if mul==r or mul==0:\r\n print(i)\r\n break\r\n i+=1", "p,q=map(int,input().split());i=1\r\nwhile 0!=i*p%10!=q:i+=1\r\nprint(i)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 18 20:30:31 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\nimport sys\r\n\r\ninp=[]\r\nfor line in sys.stdin:\r\n inp += [int(x) for x in line.strip().split()]\r\n \r\n \r\nk = inp[0]\r\nr = inp[1]\r\n'''\r\nk=1\r\nr=9\r\n'''\r\nu = 1\r\n\r\nwhile True:\r\n if ((k*u)%10 == r or (k*u)%10 == 0):\r\n print(u)\r\n break\r\n else:\r\n u+=1\r\n \r\n ", "a,b=map(int,input().split())\r\ncount=1\r\nwhile 0!=count*a%10 and count*a%10!=b:\r\n count+=1\r\nprint(count)", "data = list(map(int, input().split()))\r\nx = data[0]\r\nc = 1\r\nwhile str(x)[-1]!=\"0\" and str(x)[-1]!=str(data[1]):\r\n x += data[0]\r\n c += 1\r\nprint(c)", "def find_min_shovels(k, r):\r\n price_of_one_shovel = k\r\n for x in range(1, 11):\r\n price_of_x_shovels = price_of_one_shovel * x\r\n if price_of_x_shovels % 10 == 0 or price_of_x_shovels % 10 == r:\r\n return x\r\nk, r = map(int, input().split())\r\nresult = find_min_shovels(k, r)\r\nprint(result)\r\n", "k,r=input().split()\nk,r=int(k),int(r)\nfor i in range(1,10):\n\tl=(k*i)%10\n\tif l==0 or l==r:\n\t\tprint(i)\n\t\tbreak\n\n\n\n\n", "k, r = map(int, input().split())\r\nval = 0\r\npri = 0\r\nfla = True\r\n\r\nwhile fla:\r\n if (pri % 10 == 0 and pri != 0) or pri % 10 == r:\r\n break\r\n \r\n val += 1\r\n pri += k\r\n \r\nprint(val)", "testInput = list(map(int, input().split(\" \")))\r\nk = testInput[0]\r\nr = testInput[1]\r\nfor i in range(1,1000):\r\n temp = k*i\r\n if(temp%10==r or temp%10==0):\r\n print(i)\r\n break", "nums = [int(x) for x in input().split()]\nk = nums[0]\nr = nums[1]\nflag = True\ncount = 1\n\nwhile flag:\n\tif (nums[0] - r) % 10 == 0 or nums[0] % 10 == 0:\n\t\tflag = False\n\telse:\n\t\tnums[0] = nums[0] + k\n\t\tcount = count + 1\n\nprint(count)\n", "k,r=[int(e) for e in input().split()]\r\nx=1\r\ns=k\r\nwhile s%10!=0 and s%10!=r:\r\n x+=1\r\n s+=k\r\nprint(x)", "k, r = map(int, input().split())\r\nfor i in range(100):\r\n if (k*(i+1))%10 == r or (k*(i+1))%10 ==0:\r\n print(i+1)\r\n break\r\n", "k, r = map(int, input().split())\r\n\r\nn = 1\r\n\r\nwhile True:\r\n total = k * n\r\n if total % 10 == 0 or total % 10 == r:\r\n print(n)\r\n break\r\n n += 1", "price , change = list(map(int , input().split()))\r\ndef minshovel(price,change):\r\n for i in range(1,10):\r\n r=price*i-change\r\n if r%10==0:\r\n return i\r\n elif (price*i)%10==0:\r\n return i\r\n return 10\r\nprint(minshovel(price,change))", "a , b = map(int,input().split())\r\nn = 1\r\nwhile True:\r\n\td = (a * n)%10\r\n\tt = str(d) \r\n\tif a == b:\r\n\t\tprint(1)\r\n\t\tbreak\r\n\tif d == 0 or d == b:\r\n\t\tprint(n)\r\n\t\tbreak\r\n\tn += 1", "k, r = [int(num) for num in input().split(\" \")]\r\n\r\ntotal_price = k\r\n\r\nwhile total_price % 10 not in [r, 0]:\r\n total_price += k\r\n\r\nprint(total_price // k)", "k,r=map(int,input().split())\nfor i in range(1,11):\n if(i*k)%10==0 or ((i*k)-r)%10==0:\n print(i)\n break\n \t \t \t \t\t\t \t\t \t\t \t \t\t \t", "import math\r\nk , r = map(int, input().split())\r\ns = 0\r\nfor i in range(1,10):\r\n if k*i%10==0 or k*i%10==r:\r\n s += 1\r\n break\r\n else: s+=1\r\n\r\nprint(s)", "#https://codeforces.com/problemset/problem/732/A\r\n\r\ndef get_last_digit_as_string(number):\r\n return str(number)[-1]\r\n(price, coin_value) = input().split(\" \")\r\nshovel_count = 1\r\nwhile get_last_digit_as_string(int(price)*shovel_count) != coin_value and get_last_digit_as_string(int(price)*shovel_count) != \"0\":\r\n shovel_count += 1\r\nprint(shovel_count)", "k,r=map(int,input().split())\r\nn=k\r\ncount=1\r\nwhile(not(k%10==0 or k%10==r)):\r\n count+=1\r\n k=n*count\r\nprint(count)", "x = list(map(int,input().split()))\r\nsum = 1\r\nfirst = x[0]\r\nwhile (x[0]%10 != 0) and (x[0]%10 != x[1]):\r\n x[0] += first\r\n sum += 1\r\nprint(sum)", "k,r = [int(x) for x in input().split(\" \")]\r\ni = 1\r\nwhile True:\r\n if (k*i)%10 == 0:\r\n print(i)\r\n break\r\n elif (k*i)%10 == r:\r\n print(i) \r\n break\r\n i = i + 1\r\n ", "a,b = map(int, input().split())\r\nfor i in range(1, 11):\r\n if (i*a)%10==0 or (i*a)%10==b:\r\n print(i)\r\n break", "def function(inp):\n flag=0\n i=1\n while(flag==0):\n if((i*inp[0]-inp[1])%10==0) or (i*inp[0]%10==0):\n flag=1\n print(str(i))\n break\n i+=1\n \ninp = list(map(int, input().split()))\nfunction(inp)\n\n \t \t\t \t\t\t \t\t\t \t\t\t\t\t", "cost, coin = map(int, input().split())\r\nans = 1\r\nwhile True:\r\n res = (cost*ans)%10\r\n if res == 0 or res == coin:\r\n break\r\n ans+=1\r\nprint(ans)", "def main():\r\n # input\r\n k, r = map(int, input().split())\r\n\r\n # soln\r\n for i in range(1, 11):\r\n if (k*i)%10 == r or (k*i)%10 == 0:\r\n print(i)\r\n break\r\n\r\nif __name__ == \"__main__\":\r\n main()", "k, r = map(int, input().split())\r\nnumber_of_shovel = 1\r\nwhile(True):\r\n # print(number_of_shovel)\r\n if((number_of_shovel*k - r)%10 == 0):\r\n break\r\n if((number_of_shovel*k))%10 == 0:\r\n break\r\n else:\r\n number_of_shovel += 1\r\nprint(number_of_shovel)", "k,r = map(int,input().split())\r\nfor i in range(1,11):\r\n if k * i % 10 == 0 or k * i % 10 == r:\r\n break\r\nprint(i)", "# Read input values\r\nk, r = map(int, input().split())\r\n\r\n# Initialize number of shovels\r\nshovels = 1\r\n\r\n# Check if the price is already a multiple of r or if it ends in 0\r\nwhile (k * shovels) % 10 != 0 and (k * shovels) % 10 != r:\r\n shovels += 1\r\n\r\n# Print the number of shovels needed\r\nprint(shovels)\r\n", "k, r = map(int, input().split())\r\nn = 1\r\nwhile True:\r\n if ((n * k) % 10) % r == 0 and ((n * k) % 10) / r <= 1:\r\n print(n)\r\n exit(0)\r\n else:\r\n n += 1", "price,coin = map(int,input().split())\r\ncounter = 0\r\nresult = 0\r\nwhile(True):\r\n counter= counter+1\r\n result= price*counter\r\n\r\n if(result % 10 == 0 or result % 10 == coin):\r\n break\r\nprint(counter)", "k,r=map(int,input().split());i=1\r\nwhile 0!=i*k%10!=r: i+=1\r\nprint(i)", "k, r = map(int, input().split())\r\ne = 1\r\nt = k\r\nwhile t % 10 != 0 and t % 10 != r:\r\n e += 1\r\n t += k\r\nprint(e)", "k, r = map(int, input().split())\r\n\r\nfor i in range(1, 10):\r\n # print(f'{i} showel(s) for {i * k} burles')\r\n if (i * k) % 10 == 0 or (i * k - r) % 10 == 0:\r\n print(i)\r\n break\r\nelse:\r\n print(10)", "k,r=map(int,input().split())\ncount = 1\ncost = k\n \nwhile cost % 10 != 0 and (cost - r) % 10 != 0:\n count += 1\n cost += k\n \nprint(count)\n\t\t \t \t \t\t\t \t\t \t \t\t \t\t\t \t\t\t", "st=input(\"\")\nw=st.split(' ')\nk=int(w[0])\nr=int(w[1])\ni=1\nwhile True:\n if((k*i)%10!=0) and (((k*i)-r)%10!=0):\n i+=1\n else:\n break\nprint(i)\n\t \t \t \t\t\t\t \t\t\t \t \t \t\t \t \t", "a, b = map(int, input().split())\r\nmult = 1\r\nd = a\r\nfor i in range(100):\r\n a = d * mult\r\n if a % 10 == b or a % 10 == 0:\r\n print(mult)\r\n quit()\r\n mult += 1", "def Shovel(k, r):\r\n\r\n i = 1\r\n\r\n while True:\r\n\r\n x = k * i\r\n\r\n if x % 10 == 0 or x % 10 == r:\r\n return i\r\n \r\n i += 1\r\n\r\nk, r = map(int, input().split())\r\n\r\nprint(Shovel(k, r))", "#Buy a Shovel\nl=input()\nlis=l.split(\" \")\ncount=1\nwhile(True):\n if (count*int(lis[0])-int(lis[1]))%(10)==0 or (count*int(lis[0]))%10==0:\n print(count)\n break\n count=count+1\n \t \t\t \t\t \t \t\t \t\t \t \t", "a, b = map(int, input().split())\r\ncount =1\r\nfor i in range(1, 10):\r\n m = a*i\r\n rem = m%10\r\n if(rem==b or rem==0):\r\n print(count)\r\n break\r\n count=count+1\r\n \r\n ", "k,r=map(int,input().split())\r\nshovel=1\r\nwhile True:\r\n if (shovel*k)%10==0 or (shovel*k)%10==r:\r\n break\r\n shovel+=1\r\nprint(shovel)", "i = [int(x) for x in input().split(' ')]\r\nk = i[0]\r\nr = i[1]\r\n \r\nm = 0\r\nu = True\r\n\r\nwhile u:\r\n m+=1\r\n k*=m\r\n if k%10-r == 0 or k%10 == 0:\r\n u = False\r\n k = i[0]\r\n \r\n \r\n\r\nprint(m)\r\n", "# Read the input\r\nk, r = map(int, input().split())\r\n\r\n# Initialize the number of shovels to 1\r\nshovels = 1\r\n\r\n# Keep increasing the number of shovels until we can pay without change\r\nwhile (k * shovels) % 10 != 0 and (k * shovels - r) % 10 != 0:\r\n shovels += 1\r\n\r\n# Print the result\r\nprint(shovels)\r\n", "k, r = map(int, input().split())\r\n\r\nfor i in range(1,10):\r\n if (i*k)%10==0 or ((i*k)%10)-r==0:\r\n print(i)\r\n break\r\n\r\n", "shovel, coins = [int(x) for x in input().split()]\r\n\r\ntotal=shovel%10\r\nfor i in range(1,10):\r\n if((total*i)%10 == coins or (shovel*i)%10== 0):\r\n print(i)\r\n break", "k ,n =[int(x) for x in input().split()]\r\ni=1\r\nwhile True:\r\n if k*i %10 ==0:\r\n break\r\n elif k*i %10 ==n:\r\n break\r\n\r\n i = i+1\r\nprint(i)\r\n", "nums = [i for i in input().split()]\r\ni = 0\r\nkoko = nums[0]\r\nwhile nums[0][-1] != \"0\" and nums[0][-1] != nums[1]:\r\n i += 1\r\n nums[0] = str(int(koko) * i)\r\nif i == 0:\r\n i = 1\r\nprint(i)", "a,b=map(int,input().split())\r\ni=1\r\nwhile True:\r\n if (a*i)%10 ==0 or (a*i)%10==b:\r\n print(i)\r\n break\r\n else:\r\n i+=1", "k, r = map(int, input().split(' '))\r\ns = 0\r\nfor i in range(1, 10):\r\n if i * (k % 10) % 10 == r:\r\n s = i\r\n break\r\nif s == 0:\r\n r = k\r\n s = 1\r\n while k % 10 != 0:\r\n k += r\r\n s += 1\r\nprint(s)\r\n", "price, change = map(int, input().split())\r\ncount = 0\r\n\r\nwhile True:\r\n count += 1\r\n if (price * count - change) % 10 == 0 or price * count % 10 == 0:\r\n break\r\n\r\nprint(count)\r\n", "shovel_cost, faka = map(int, input().split())\r\nshovels = 1\r\nshovel = str(shovel_cost)\r\nlength = len(shovel)\r\n\r\nwhile True:\r\n if (shovel_cost * shovels) % 10 == faka or (shovel_cost * shovels) % 10 == 0:\r\n print(shovels)\r\n break # Exit the loop when you find a valid solution\r\n else:\r\n shovels += 1", "n, m = list(map(int, input().strip().split()))\r\ns = 0\r\nx = 1\r\nwhile True:\r\n s += 1\r\n c = (n*x) % 10\r\n x += 1\r\n if c == m:\r\n print(s)\r\n break\r\n if c == 0:\r\n print(s)\r\n break", "a = list(map(int,input().split()))\r\nn = 1\r\nwhile True:\r\n if((a[0]*n)%10 == 0 or (a[0]*n)%10 == a[1]):\r\n print(n)\r\n break\r\n else:\r\n n += 1 ", "a,b=map(int,input().split())\ni=1\nwhile True:\n if((a*i)%10==0):\n break\n if((a*i)%10==b):\n break\n i+=1\nprint(i)\n \t \t \t \t \t \t \t\t\t \t\t \t\t\t", "n=list(map(int,input().split(\" \")))\r\na=n[0]\r\nb=n[-1]\r\ncount=1\r\nwhile True:\r\n result = 0\r\n\r\n\r\n if ((a*count)%10)==0 or (((a*count)-b)%10)==0:\r\n print(count)\r\n break\r\n else:\r\n count+=1\r\n", "a,b=map(int,input().split())\r\ni=1\r\nwhile 0!=i*a%10 != b:\r\n i+=1\r\nprint(i) ", "data=input()\ndata=data.split()\nk=int(data[0])\nr=int(data[1])\ncount=1\ntemp=k\nwhile True:\n if temp%10==r or temp%10==0:\n break\n count+=1\n temp=k*count\nprint(count)\n\t \t \t \t \t \t\t\t \t\t \t \t\t\t \t \t\t", "count = 1\r\nx = input().split()\r\ny = int(x[0])\r\nif (y % 10)-int(x[1]) == 0:\r\n print(count)\r\nelse:\r\n while (y % 10) != 0:\r\n count += 1\r\n y = int(x[0])*count\r\n if (y % 10)-int(x[1]) == 0:\r\n break\r\n print(count)", "entrada = list(map(int, input().split()))\r\nres = entrada[0]\r\nmultipl = 1\r\nwhile True:\r\n if res % 10 == 0 or res % 10 == entrada[1]:\r\n break\r\n res = entrada[0]*multipl\r\n multipl += 1\r\nprint(res//entrada[0])", "l,r=map(int,input().split())\r\ni=1\r\nwhile 0!=(i*l)%10!=r:\r\n i+=1\r\nprint(i)\r\n", "n,m=map(int, input().split())\r\ni=1\r\nwhile((n*i-m)%10!=0 and (n*i)%10!=0):\r\n i+=1\r\nprint(i)\r\n\r\n\r\n\r\n\r\n", "nums = list(map(int, input().split()))\r\n\r\nost = nums[0]\r\n\r\nc = 1\r\n\r\n\r\n\r\n# while ost % 10 != nums[1] or ost % 10 != 0:\r\n# ost += nums[0]\r\n# c += 1\r\n\r\nwhile 1:\r\n if ost % 10 == 0 or ost % 10 == nums[1]:\r\n print(c)\r\n exit()\r\n else:\r\n ost += nums[0]\r\n c += 1\r\n", "def main() -> None :\r\n print(minimum_Shovel_Count_Without_Change(*user_Inputs()))\r\n\r\n\r\ndef minimum_Shovel_Count_Without_Change(shovel_price: int, extra_burles: int) :\r\n for shovel_count in range(1, 10+1, 1) :\r\n if is_Possible_Without_Change(shovel_count*shovel_price, extra_burles) :\r\n return shovel_count\r\n\r\ndef is_Possible_Without_Change(total_price: int, extra_burles: int) :\r\n return (total_price%10 == 0) or (digits(total_price)[-1] == extra_burles)\r\n\r\ndef digits(num: int) -> list[int] :\r\n return list(map(int, str(num)))\r\n\r\n\r\ndef user_Inputs() -> list[int] :\r\n return input_Array()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "x,y=map(int,input().split())\r\nc=1\r\nyes=x\r\nwhile yes%10!=0 and (yes-y)%10!=0:\r\n\tc+=1\r\n\tyes+=x\r\nprint(c)", "inp=input().split(' ')\r\nk=int(inp[0])\r\nr=int(inp[1])\r\nc=k\r\nn=1\r\nif r!=0:\r\n while(c%10!=r and c%10!=0):\r\n n+=1\r\n c+=k\r\n print(n)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\ndem=1\r\nwhile dem*a%10!=0 and a*dem%10!=b:\r\n dem+=1\r\nprint(dem)", "n,y=list(map(int,input().split()))\r\nx,s=0,0\r\nwhile x<=10:\r\n x+=1\r\n s+=n\r\n if s%10==0:\r\n print(x)\r\n break\r\n elif (s-y)%10==0:\r\n print(x)\r\n break", "k,r=map(int,input().strip().split())\r\ni=1\r\ncount=1\r\nwhile i>0:\r\n if ((k*i)-r)%10==0 or (k*i)%10==0:\r\n break\r\n else:\r\n count+=1\r\n i+=1\r\nprint(count)", "k, r = map(int, input().split())\n\nshovel_count = 1\ntotal_cost = k\n\nwhile total_cost % 10 != 0 and (total_cost - r) % 10 != 0:\n shovel_count += 1\n total_cost += k\n\nprint(shovel_count)\n\n \t\t\t\t\t\t \t \t \t \t \t\t\t", "k, r = list(map(int, input().split()))\ncount = 1\nsum = k\nwhile sum % 10 != 0 and sum % 10 != r:\n count += 1\n sum = k * count \nprint(count)", "n,r=input().split()\nn=int(n)\nr=int(r)\ni=1\nc=0\nwhile(1):\n p=n*i\n if(p%10==0 or p%10==r):\n c+=1\n break\n i+=1\nprint(i)\n\n \t \t \t \t\t\t\t\t\t \t\t \t \t \t \t\t\t\t", "k, r = [int(x) for x in input().split()]\r\ni = 1\r\nwhile True:\r\n total_cost = k * i\r\n if total_cost % 10 == 0 or total_cost % 10 == r:\r\n break\r\n i += 1\r\nprint(i)", "t = 1#int(input())\r\nfor q in range(0, t):\r\n\r\n # lenght = 2\r\n # s = input().split(\" \")\r\n #\r\n #\r\n #\r\n # for i in range(0, lenght):\r\n # s[i] = int(s[i])\r\n k, r = map(int, input().split(\" \"))\r\n ch = 1\r\n while (k * ch) % 10 != 0 and (k * ch) % 10 != r:\r\n ch += 1\r\n print(ch)", "tm = input().split()\r\nk, r = int(tm[0]), int(tm[1])\r\nit = 1\r\nwhile True:\r\n if k * it % 10 == 0 or k * it % 10 == r:\r\n print(it)\r\n exit(0)\r\n it += 1", "k,r = map(int,input().split())\r\ncounter = 1\r\nwhile (k*counter) % 10 != 0 and ((k*counter)-r) % 10 != 0 :\r\n counter += 1\r\nprint(counter)", "k,r = input(\"\").split()\r\nc = 1\r\ni = 0\r\nwhile c % 10 != 0:\r\n i+= 1\r\n \r\n if int(k) * i % 10 == 0:\r\n c= int(k) * i\r\n else:\r\n c = int(k) * i - int(r)\r\nprint(i)", "a,b = input().split()\r\na = int(a)\r\ni = 0\r\nwhile True:\r\n i+=1\r\n c = str(a*i)\r\n if c[-1]==b or c[-1]==\"0\":\r\n print(i)\r\n break", "s = list(map(int,input().split()))\r\nb = s[0]\r\nv = s[1]\r\nc = 0\r\nwhile b%10 != v and b%10 != 0:\r\n b+=s[0] \r\n c+=1\r\nprint(c+1)", "lst = list(map(int, input().split()))\r\n\r\nfor i in range(1, 10):\r\n cost = str(lst[0] * i)\r\n if cost[-1] == '0' or cost[-1] == str(lst[1]):\r\n print(i)\r\n break", "k, r = map(int,input().split())\r\n\r\ni = 1\r\n\r\nwhile (k*i) != 0:\r\n if (k*i)%10 == 0:\r\n print(i)\r\n break\r\n elif (k*i)%10 == r:\r\n print(i)\r\n break\r\n \r\n \r\n i+=1\r\n \r\n ", "l = str(input()).split()\r\ns = int(l[0])\r\nd = int(l[1])\r\ns1 = s\r\ni = 1\r\nwhile s % 10 != d and s % 10 != 0:\r\n s += s1\r\n i += 1\r\nprint(i)", "k, r = map(int, input().split())\r\nshovels = 0\r\nmoney_money = 0\r\nwhile True:\r\n money_money += k\r\n shovels += 1\r\n if int(str(money_money)[-1]) == r or int(str(money_money)[-1]) == 0:\r\n break\r\nprint(shovels)", "k, r = map(int, input().split())\n\ntotal = k - r\ncount = 1\nif total % 10 == 0 or (total + r) % 10 == 0 : \n print(count)\n exit()\nwhile count < 10: \n count += 1\n total += k\n if total % 10 == 0 or (total + r) % 10 == 0: \n print(count)\n exit()\nprint(count)\n", "#!/bin/env python3\n\nk, r = input().split()\n\nk = int(k)\nr = int(r)\n\nn = 1\nwhile ((n * k) % 10 != 0) and ((n * k - r) % 10 != 0):\n n += 1\n\nprint(n)\n", "m = input().split()\na = int(m[0])\nn = a\nb = int(m[1])\ni = 1\nwhile True:\n if a%10==0 or a%10==b:\n break\n else:\n i+=1\n a=n*i\nprint(i)\n\t \t \t\t\t \t \t \t \t \t \t\t", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n k, r = [int(x) for x in input().split()]\n k %= 10\n a, i = k, 1\n while k % 10 != r and k % 10 != 0:\n k += a\n i += 1\n print(i)\n\n\nif __name__ == \"__main__\":\n main()\n", "k, r = map(int, input().split(' '))\r\n\r\nmax_iters = 999\r\nx = 1\r\ncondition = False\r\n\r\nwhile not condition or x < max_iters:\r\n condition = (x * k) % 10 == 0 or (x * k - r) % 10 == 0\r\n if condition: break\r\n else: x += 1\r\nprint(x)\r\n", "k, r = map(int, input().split())\r\nans = 10\r\nfor i in range(1, 10):\r\n s = k * i\r\n if s % 10 in (0, r):\r\n ans = min(ans, i)\r\nprint(ans)", "def sol(a1,a,b,c):\r\n if a%10==0:\r\n return c\r\n if a%10==b:\r\n return c\r\n return sol(a1,a1+a,b,c+1)\r\na,b=map(int,input().split())\r\nprint(sol(a,a,b,1))", "k, r = map(int, input().split())\r\ns, i = 10 * k, 10\r\nsp = []\r\nfor i in range(9, 0, -1):\r\n s = i * k\r\n if s % 10 == 0 or s % 10 == r:\r\n sp.append(i)\r\nif sp != []:\r\n print(sp[-1])\r\nelse:\r\n print(10)", "a,b=map(int,input().split())\nx=1\n\nwhile True:\n if ((a*x)%10==0):\n break\n elif ((a*x)%10==b):\n break\n x+=1\n\nprint(x)\n\n\t\t \t \t \t\t\t \t \t \t \t\t \t \t\t\t \t \t", "s = input().split(\" \")\r\nk = int(s[0])\r\nr = int(s[1])\r\nl_r = r % 10\r\ncount = 1\r\nwhile True:\r\n if count * k % 10 == 0 or count * k % 10 == l_r:\r\n print(count)\r\n break\r\n else:\r\n count += 1\r\n", "x,y = map(int , input().split())\nfor i in range(1,10):\n if(str(x*i).endswith(str(y)) or str(x*i).endswith(\"0\")):\n print(i)\n break\n\t\t \t\t \t\t \t \t\t\t\t\t\t\t\t\t\t", "#732A\r\nn=list(map((int),input().split()))\r\ni=1\r\nwhile True:\r\n if (i*n[0])%10==0:\r\n break\r\n if (i*n[0]-n[1])%10==0:\r\n break\r\n i+=1\r\nprint(i)", "k,r=list(map(int,input().split()))\r\nls=[]\r\nif k%10==0:\r\n print(1)\r\nelse:\r\n k=k%10\r\n for i in range(1,10):\r\n ls.append(k*i)\r\nfor i in ls:\r\n if (i-r)%10==0:\r\n print(ls.index(i)+1)\r\n break\r\n elif (i)%10==0:\r\n print(ls.index(i)+1)\r\n break", "sp = input().split()\r\nnom = int(sp[0])\r\ncop = int(sp[1])\r\ni = 1\r\nkol = 0\r\n\r\nwhile 1 == 1:\r\n if (nom - cop) % 10 == 0 or nom % 10 == 0:\r\n break\r\n else:\r\n nom = int(sp[0]) \r\n nom = nom * i\r\n kol += 1\r\n i += 1\r\nif kol == 0:\r\n kol = 1\r\nprint(kol)", "k,r = map(int,input().split())\r\ncount = 1\r\ns = k\r\nwhile True:\r\n if (k%10) == r:\r\n break\r\n elif (k%10) == 0:\r\n break\r\n k += s\r\n count += 1\r\nprint(count)", "a1 , a2 = map(int,input().split(' ')) \r\ni = 1 \r\nwhile (i*a1)%10 != a2 and i*a1%10 != 0 : \r\n i += 1 \r\nprint(i)", "k, r = map(int, input().split())\r\nflag = 0\r\ni = 1\r\nfor i in range(1, 11):\r\n res = k * i\r\n tmp = res%10\r\n if tmp == r or tmp == 0:\r\n flag = 1\r\n break\r\nif flag == 1: print(i)\r\nelse: print(10)", "w,v=map(int,input().split())\r\nx=1\r\nwhile 0!=x*w%10!=v:x+=1\r\nprint(x)", "k,r=input().split()\n\nk=int(k)\nr=int(r)\n\nco=1\nflag=True\n\nwhile True:\n if ((k*co)%10==0 or (k*co)%10==r):\n break\n else:\n co+=1\nprint(co)\n \t \t\t \t\t\t\t\t\t\t \t\t \t\t \t\t\t\t", "k, r = list(map(int,input().split()))\r\ntemp = k\r\ni = 1\r\nflag = False\r\nwhile temp%10!=0 and temp%10!=r:\r\n temp = k*i\r\n i += 1\r\n flag = True\r\n\r\nprint( i-1 if flag else i )", "ls = input().split()\nk = int(ls[0])\nr = int(ls[1])\ncounter = 1\n\nwhile True:\n if (k * counter) % 10 == 0 or (k * counter) % 10 == r:\n break\n else:\n counter += 1\nprint(counter)\n \n \t\t\t\t\t\t\t \t \t\t\t\t\t \t\t\t \t\t\t", "# Problem: https://codeforces.com/problemset/problem/732/A\r\n# Answer: \r\n\r\n# *************************\r\n\r\n# P has two kinds of dollars in his wallet:\r\n # An unlimited number of 10 bills, and\r\n # One bill worth between 1 and 9.\r\n\r\n# P needs to purchase shovels from a store.\r\n# The first input represents the price of a shovel, followed by the value of P's unique bill worth between 1 and 9.\r\n# 117 3 ==> A shovel costs 173 and he has 1 bill worth $3 in his pocket.\r\n\r\n# Output the minimum number of shovels P must buy so that he can pay without receiving any change.\r\n\r\n# To solve, we check the following:\r\n # Is the price of the shovel % 10 == 0?\r\n # If yes, output that shovel's number.\r\n \r\n # If no, is the price of the shovel % 10 minus the unique dollar's value == 0? If yes, output the shovel's number. \r\n # If no, go on to the next shovel.\r\n\r\n# *************************\r\n\r\nstartingValues = [int(i) for i in input().split()]\r\n\r\nshovelPrice = startingValues[0]\r\nuniqueDollar = startingValues[1]\r\nn = 1\r\noutput = 0\r\n\r\ngoAhead = True\r\nwhile(goAhead):\r\n \r\n if (shovelPrice * n) % 10 == 0:\r\n output = n\r\n goAhead = False\r\n \r\n if ((shovelPrice * n) % 10) - uniqueDollar == 0:\r\n output = n\r\n goAhead = False\r\n n += 1\r\n\r\nprint(output)", "k,r=map(int,input().split())\r\nfor i in range(1,1000):\r\n\tif (i*k-r)%10==0 or (i*k)%10==0:\r\n\t\tprint(i)\r\n\t\tbreak", "n = input()\n\nn, m = n.split()\n\nn = int(n)\nm = int(m)\n\nans = 10\n\nfor i in range(1,10):\n if (i*n)%10 == m or (i*n)%10 == 0:\n ans = i\n break\n\n\nprint(ans)", "input_number = input()\r\nprice_str, chang_str = input_number.split()\r\nprice = int(price_str)\r\nchange = int(chang_str)\r\ni = 1\r\ntotal = 0\r\nwhile True:\r\n total = price*i\r\n if (total % 10 == 0):\r\n print(i)\r\n break\r\n elif (total-change) % 10 == 0:\r\n print(i)\r\n break\r\n else:\r\n i += 1\r\n", "k,r=map(int,input().split())\r\ni=k\r\nans=1\r\nwhile i%10!=0 and i%10!=r:\r\n i+=k\r\n ans+=1\r\nprint(ans)", "k, r = input().split()\r\n\r\nk, r = int(k), int(r)\r\n\r\nfor i in range(1, 11):\r\n if k*i % 10 in [0, r]:\r\n print(i)\r\n break", "a,b=map(int,input().split())\r\ni=1\r\nwhile True:\r\n \r\n if ((a*i)-b)%10==0 or (a*i)%10==0:\r\n break\r\n else:\r\n i+=1\r\nprint(i)", "a = list(map(int,input().split()))\r\nb = 1\r\nwhile(True):\r\n c = a[0]*b\r\n if c%10==0:\r\n print(b)\r\n break\r\n elif (c-a[1])%10==0:\r\n print(b)\r\n break\r\n b = b + 1", "a,b=map(int,input().split())\r\ns=1\r\nwhile(s*a-b)%10!=0 and(s*a)%10!=0:\r\n s+=1\r\nprint(s)", "k,r = map(int,input().split())\r\ns = 1\r\nt = k\r\nwhile t % 10 != 0 and (t % 10)- r != 0:\r\n s += 1\r\n t = s * k\r\nprint(s)", "k, r = map(int, input().split(\" \"))\r\ncnt = 1\r\nflg = False\r\nwhile flg is not True:\r\n if (cnt*k) % 10 == 0:\r\n flg = True\r\n elif (cnt*k) % 10 == r:\r\n flg = True\r\n else:\r\n cnt += 1\r\nprint(cnt)\r\n", "k,r=input().split()\r\nk=int(k);r=int(r)\r\ni=1\r\nwhile True:\r\n mul=k*i\r\n if(mul%10 ==0 or mul%10 ==r):\r\n print(i)\r\n break\r\n i+=1\r\n", "z=[*map(int, input().split())]\r\nfor i in range(1,10): \r\n if ((z[0]*i)-z[1])%10==0 or (z[0]*i)%10==0 : break\r\nprint (min(10,i))", "k, r = [int(x) for x in input().split()]\n# n=int(input())\n\nnew_k = k\nans = -1\n\nfor i in range(1, 10):\n if k % 10 == 0 or (k-r) % 10 == 0:\n ans = i\n break\n else:\n k += new_k\n\nif ans == -1:\n print(10)\nelse:\n print(ans)\n\n\t \t\t \t\t\t \t\t\t \t\t \t \t\t", "a,b=map(int, input().split())\r\n\r\nfor i in range(1,10):\r\n x=(a*i)%10\r\n \r\n if (a*i)%10==0 or x==b:\r\n print(i)\r\n break\r\n else:\r\n pass", "\r\nc=list(map(int,input().split()))[:2]\r\ns=0\r\nm=c[0]%10\r\nfor x in range(1000):\r\n if m == c[1]:\r\n s=1\r\n break\r\n elif m!=c[1]:\r\n s+=1\r\n v=m*(x+1)\r\n if v%10==c[1] or v%10==0:\r\n break\r\nprint(s)", "price , coins=map(int,input().split())\r\nx=1\r\nsums=10\r\nnum=0\r\nwhile x<=10:\r\n if(price *x)%10==0:\r\n y=(price*10)%2\r\n else:\r\n y = ((price*x)-coins)%10\r\n if y<sums and y==0:\r\n sums=y\r\n num=x\r\n x+=1\r\nprint(num)\r\n\r\n", "r=input().split(' ')\r\nk,n=int(r[0]),int(r[1])\r\n\r\nfor i in range(1,11):\r\n if (k*(i)-n)%10==0 or (k*(i))%10==0:\r\n break\r\nprint(i)", "a,b = map(int,input().split())\nmink=0\nif(a%10==0):\n mink=a/10\n print(1)\nelse:\n for i in range(1,1000):\n prod=a*i\n if(prod%10==0):\n mink=prod/10\n print(i)\n break\n else:\n diff=prod-b\n if(diff%10==0):\n print(i)\n break\n\t\t\t \t\t\t\t \t\t \t \t \t\t \t \t\t\t\t\t", "k, n = map(int, input().split())\r\nres = 1\r\nwhile (k * res) % 10 != 0 and (k * res) % 10 != n:\r\n res += 1\r\n\r\nprint(res)", "def Buy_shovels(k,r):\r\n n = 0\r\n \r\n for i in range(1,10):\r\n if((k*i)%10==r or (k*i)%10==0):\r\n \r\n n=i\r\n break\r\n return n\r\n \r\n\r\n \r\nk,r = map(int, input().split())\r\nprint(Buy_shovels(k,r))", "c , r = map(int,input().split())\r\nres = 1\r\nc = c%10\r\nwhile c%10 !=r and c%10 != 0:\r\n res+=1\r\n c /= res-1\r\n c *= res\r\nprint(res)", "k, r = map(int, input().split())\r\nshovels = 1\r\n\r\nwhile (shovels * k - r) % 10 != 0 and shovels * k % 10 != 0:\r\n shovels += 1\r\n\r\nprint(shovels)", "k,r=map(int,input().split());i=1\r\nwhile i*k%10!=r and i*k%10!=0:\r\n i+=1\r\nprint(i)", "a,b=tuple(map(int,input().split()))\r\nc=0\r\ncount=0\r\nwhile count%10!=b:\r\n c=c+1\r\n count=a*c\r\n if count%10==0:\r\n break\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, 11):\r\n if a * i % 10 == b or a * i % 10 == 0:\r\n print(i)\r\n break\r\n", "def split(string, sep=\" \"):\n prev = 0\n for i, char in enumerate(string):\n if char == sep:\n if i != prev:\n yield string[prev:i]\n prev = i + 1\n\n ret = string[prev:]\n if ret:\n yield ret\n\nk, r = map(int, input().split())\n\ni = 1\nwhile not (i * k) % 10 in (0, r):\n i += 1\n\nprint(i)", "a = [int(x) for x in input().split()]\r\ni=1\r\nwhile (((a[0]*i)%10 !=0) and ((a[0]*i-a[1])%10 !=0)):\r\n i+=1\r\n\r\n\r\nprint(i)", "k,r=map(int,input().split())\r\ni=1\r\nwhile True:\r\n key=k*i\r\n if key%10==0:\r\n break\r\n elif key%10==r:\r\n break\r\n i+=1\r\nprint(i)\r\n", "n,k = map(int, input().split())\r\ns=1\r\nd = n\r\nwhile (n%10!=k and n%10!=0):\r\n n+=d\r\n s+=1\r\nprint(s)\r\n", "x,y=map(int,input().split())\r\nc=0\r\ni=1\r\nwhile(1):\r\n c+=1\r\n if((i * x) % 10 == y or (i * x) % 10 == 0):\r\n break\r\n i+=1\r\nprint(c)", "k, r = map(int, input().split())\r\n\r\nx = 1\r\ny = k\r\nwhile k % 10 != 0 and k % 10 != r:\r\n x += 1\r\n k += y\r\n\r\nprint(x)\r\n", "k, r = map(int,input().split())\r\n\r\ni = 1\r\n\r\nwhile 0!= i * k % 10 != r:\r\n i += 1\r\nprint(i)", "a,b = [int(i) for i in input().split()]\r\nc = 1\r\nwhile True:\r\n if ((a*c)-b)%10==0:\r\n print(c)\r\n break\r\n elif (a*c)%10==0:\r\n print(c)\r\n break\r\n c+=1\r\n", "Info = input()\r\nInfo = Info.split(\" \")\r\nCount = 1\r\nAnswer = False\r\n\r\nwhile Answer != True:\r\n if (int(Info[0]) * Count) % 10 == 0 or ((int(Info[0]) * Count) - int(Info[1])) % 10 == 0:\r\n Answer = True\r\n \r\n Count = Count + 1\r\n\r\nprint(Count - 1)\r\n", "k,r=map(int,input().split())\nl1=[]\nfor i in range (1,10):\n l1.append(k*i)\nfor i in range(len(l1)):\n if l1[i]%10==0:\n i=i+1\n break\n elif l1[i]%10==r:\n i=i+1\n break\nprint(i)\n\t \t\t\t\t\t \t\t\t \t \t \t \t\t \t", "import sys\r\n\r\nk, r = list(map(int, sys.stdin.readline().strip().split()))\r\n\r\nfor i in range(1, 10):\r\n remainder = (k * i) % 10\r\n if remainder == 0 or remainder == r:\r\n break\r\n\r\nprint(i)\r\n", "s,w,l=input(),'',[]\ns+=' '\nfor i in s:\n if(i!=' '):\n w+=i\n else:\n l.append(int(w))\n w=''\nx,y=int(l[0])%10,l[1]\nl1=[]\nfor i in range(1,11):\n z=i*x\n z=str(z)\n z=z[::-1]\n if(z[0]==str(y)):\n l1.append(i)\n break\nfor i in range(1,11):\n z=i*x\n if z%10==0:\n l1.append(i)\n break\nprint(min(l1))\n\n \t \t\t \t\t \t \t \t\t \t \t\t \t\t", "k,r = map(int, input().split())\r\n\r\ns = 1 \r\n\r\nwhile 0 != (s*k) % 10 != r:\r\n s +=1 \r\nprint(s)\r\n ", "l = list(map(int, input().split()))\nif l[0]%10!=0:\n if (l[0]-l[1])%10==0:\n print(1)\n else:\n for i in range(1,10):\n if l[0]*i%10==0 or ((l[0]*i)-l[1])%10==0:\n print(i)\n break\nelse:\n print(1)", "k,r=map(int,input().split())\r\nfor i in range(1,11):\r\n if (k*i)%10==0:\r\n print(i)\r\n break\r\n if ((k*i)//10)*10+r==k*i:\r\n print(i)\r\n break", "k,r=map(int,input().split())\r\nfor i in range(1,30):\r\n if k*i%10==r:\r\n print(i)\r\n break\r\n elif k*i%10==0:\r\n print(i)\r\n break", "k,r = map(int, input().split())\r\n\r\ni = 0\r\nprice = 0\r\nwhile True:\r\n price += k\r\n i += 1\r\n if price % 10 == 0 or (price-r) % 10 == 0:\r\n break\r\n \r\nprint(i)", "import math\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\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\nk, r = readarray(int)\r\n\r\ncurr = k\r\n\r\nans = 1\r\n\r\nwhile (curr-r) % 10 != 0:\r\n if curr % 10 == 0:\r\n break\r\n ans += 1\r\n curr += k\r\n\r\nprint(ans)\r\n", "shovel_price, nominal = map(int, input().split())\r\n\r\nfor count_shovel in range(1, 1000):\r\n if count_shovel * shovel_price % 10 == 0:\r\n print(count_shovel)\r\n break\r\n elif count_shovel * shovel_price % 10 == nominal:\r\n print(count_shovel)\r\n break\r\n", "a=[int(s) for s in input().split()]\r\nk=a[0]\r\nr=a[1]\r\ni=1\r\nwhile i<=10:\r\n if k%10==0:\r\n print(1)\r\n break\r\n if i*k%10==0:\r\n print(i)\r\n break\r\n if i*k%10==r:\r\n print(i)\r\n break\r\n i+=1\r\n", "k,r=map(int,input().split())\r\ncount=1\r\nK=k\r\nwhile K%10!=r and K%10!=0:\r\n count+=1\r\n K+=k\r\nprint(count)", "a,b=map(int,input().split())\r\ncnt=1;r=a;\r\nwhile a%10!=0 and a%10!=b:\r\n cnt+=1\r\n a+=r\r\nprint(cnt)", "money = list(map(int, input().split(' ')))\r\nm = money[0]\r\nsercle = 1\r\nwhile True:\r\n if (money[0] % 10) - money[1] == 0 or money[0] % 10 == 0:\r\n print(sercle)\r\n break\r\n else:\r\n sercle += 1\r\n money[0] += m", "import sys, math\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom itertools import *\r\ninput = sys.stdin.readline\r\n\r\nII = lambda: map(int, input().split())\r\nL = lambda: list(II())\r\nSL = lambda: sorted(L())\r\nYES = lambda: print(\"YES\")\r\nNO = lambda: print(\"NO\")\r\nOK = lambda: print(\"OK\")\r\n\r\n\r\ndef solve():\r\n n, r = II()\r\n for i in range(1, 11):\r\n p = n*i\r\n if (p%10 == r)or(p%10 == 0):\r\n print(i)\r\n break\r\n #print(p)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n #for testcase in range(int(input())):\r\n # solve()\r\n", "a,b=map(int,input().split())\r\nq=1\r\nd=a\r\nwhile (a-b)%10!=0 and a%10!=0:\r\n \r\n a+=d\r\n q+=1\r\nprint(q) ", "k, r = [int(x) for x in input().split()]\r\n\r\nx = 1\r\n\r\nwhile(True):\r\n if (k * x) % 10 == 0 or (k * x - r) % 10 == 0:\r\n print(x)\r\n break\r\n x += 1\r\n", "a,b = map(int,input().split())\n\n\nfor i in range(1,11):\n c= a*i\n if (c-b)%10 ==0 or c%10==0:\n print(i)\n quit()", "k, r=map(int,input().split())\nfor i in range(1, 11):\n if (i * k) % 10 == 0 or (i * k - r) % 10 == 0:\n print(i)\n break\n\t \t \t \t\t\t \t \t\t \t \t\t\t", "a,b=map(int,input().split())\r\nfor i in range(1,11):\r\n if (a*i-b)%10==0 or (a*i)%10==0:\r\n print(i);break", "'''\r\n#list(map(int,input().split()))'''\r\nk,r=list(map(int,input().split()));mul=1\r\nwhile 1:\r\n if k*mul%10==0 or ((k*mul)-r)%10==0:print(mul);break\r\n mul+=1\r\n", "k, r = map(int, input().split())\r\nresult = 0\r\nfor i in range(1, 11):\r\n if (k*i - r) % 10 == 0 or k*i % 10 == 0:\r\n result = i\r\n break\r\nprint(result)\r\n ", "k, r = map(int,input().split())\r\ni = 1\r\nm = 0\r\nf = 0\r\nwhile(i>0):\r\n m = k*i\r\n if(m%10 == 0 or m%10 == r):\r\n f = i\r\n break\r\n i = i + 1\r\nprint(f)", "def buy_a_showel(k,r):\r\n if k % 10 == 0 or k % 10 == r:\r\n print(1)\r\n return\r\n i = 2\r\n while True:\r\n if (k*i) % 10 == 0 or (k*i) % 10 == r:\r\n print(i)\r\n return\r\n i+=1\r\n\r\n\r\nk,r = map(int,input().split())\r\nbuy_a_showel(k, r)", "k,r = map(int,input().split())\r\ni=1\r\nwhile True:\r\n if (i*k)%10 == 0 or (i*k)%10 == r:\r\n print(i)\r\n break\r\n i+=1", "x=input().split(\" \")\r\ni=0; b=True\r\nwhile b:\r\n i+=1\r\n if (int(x[0])*i) % 10 == 0 or ((int(x[0])*i - int(x[1])) % 10) == 0 :\r\n b=False\r\nprint(i)\r\n", "lis = list(map(int, input().split()))\r\nr = lis[1]\r\nshovel = lis[0]\r\ncounter = 1\r\nshovels = shovel\r\n\r\nwhile (shovels % 10) != 0 and (shovels % 10) - r != 0:\r\n counter += 1\r\n shovels += shovel\r\n\r\nprint(counter)", "st=input()\nw=st.split(' ')\nk=int(w[0])\nr=int(w[1])\ni=1\n# print(k,r)\nwhile(True):\n if((k*i)%10!=0 and ((k*i)-r)%10!=0):\n i=i+1\n else:\n break\n # print(i)\nprint(i)\n\t\t \t\t \t\t \t\t \t\t \t\t", "k,r=map(int,input().split())\r\nn=0\r\nans=0\r\nwhile True:\r\n if n!=0 and (10*n)%k==0:\r\n ans=(10*n)//k\r\n break\r\n if (10*n+r)%k==0:\r\n ans=(10*n+r)//k\r\n break\r\n n=n+1\r\nprint(ans)", "k,r = map(int,input().split())\r\nn=1\r\nwhile True:\r\n if((k*n)%10==r or (k*n)%10==0):\r\n print(n)\r\n break\r\n n+=1\r\n", "k,r = map(int,input().split())\r\nd = []\r\ndd = []\r\nf = []\r\nfor i in range(1,100+1):\r\n d += [i*k]\r\ns = 0\r\nfor j in d:\r\n if (j - r) % 10 == 0 or j % 10 == 0:\r\n print(j//k)\r\n break\r\n", "k, r = map(int, input().split())\r\n\r\nfor i in range(1, 11):\r\n total_price = i * k\r\n if (total_price % 10 == r) or (total_price % 10 == 0):\r\n print(i)\r\n break\r\n", "k,r = map(int,input().split())\r\nfor a in range(0,1000):\r\n if (a * 10 + r) % k == 0:\r\n print((a * 10 + r) // k)\r\n break\r\n if (a * 10) % k == 0 and a > 0:\r\n print((a * 10) // k)\r\n break\r\n", "n,r=map(int,input().split())\r\nf=0\r\ni=1\r\nwhile f==0:\r\n if (n*i)%10==0 or (n*i-r)%10==0:\r\n print(i)\r\n f=1\r\n i+=1", "k, r = map(int, input().split())\r\nc= 1\r\nwhile True:\r\n if ((c* k) % 10 == 0) or ((c * k) % 10 == r):\r\n break\r\n c += 1\r\n\r\nprint(c)", "k, r = map(int, input().split())\r\nc = 1\r\nwhile True:\r\n if k * c % 10 == 0 or (k * c - r) % 10 == 0:\r\n break\r\n else:\r\n c += 1\r\nprint(c)\r\n", "n=list(map(int,input().split(\" \")))\r\nq=n[0]\r\nw=n[1]\r\ne=n[0]\r\ny=1\r\nwhile q%10!=0:\r\n\tif (q-w)%10==0:break\r\n\tq=q+e\r\n\ty=y+1\r\nprint(y)", "k,r=map(int,input().split())\r\nfor i in range(1,1001):\r\n if k*i%10==0 or (k*i-r)%10==0:\r\n print(i)\r\n break", "price,uniqcoin=map(int,input().split())\nshovels=1\nwhile True:\n if ((price*shovels)%10==0):\n break\n elif ((price*shovels)%10==uniqcoin):\n break\n shovels+=1\nprint(shovels)\n\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\na = 1\r\nfor i in range(1000):\r\n x2 = str(a * x)\r\n if x2[-1] == str(y) or int(x2)%10==0:\r\n print(a)\r\n break\r\n else:\r\n a += 1\r\n", "k, r = map(int, input().split())\r\nans = 1\r\nwhile ans*k % 10 != r and ans*k % 10 != 0:\r\n ans += 1\r\nprint(ans)", "k,r=map(int,input().split())\r\nk1=k\r\ni=1\r\nwhile(True):\r\n if k%10==0 or k%10==r:\r\n print(i)\r\n break\r\n else:\r\n i+=1\r\n k+=k1", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nk,r=map(int,input().split())\r\nfor i in range(1,11):\r\n\ttemp=k*i\r\n\tif temp%10==0 or str(temp)[-1]==str(r):\r\n\t\tprint(i)\r\n\t\tbreak", "k,r = list(map(int,input().split()))\r\nm,s,i = k,0,1\r\nwhile True:\r\n if m%10==r or m%10==0:\r\n break\r\n else:\r\n m=k*i ; i+=1 ; s+=1\r\nprint(s+1 if s==0 else s)\r\n", "k,r = map(int,input().split())\r\nx=1\r\nwhile True:\r\n if (((k*x)-r)%10 ==0) or (((k*x)-0)%10 ==0) :\r\n min((((k*x)-r)%10 ==0) , (((k*x)-0)%10 ==0))\r\n print(x)\r\n break\r\n x+=1", "k, r = map(int, input().split())\r\n\r\nn = 1\r\nwhile (n * k) % 10 != 0 and (n * k) % 10 != r:\r\n n += 1\r\n\r\nprint(n)", "inp = list(map(int, input().split()))\r\nprice = inp[0]\r\nchange = inp[1]\r\nshovels = 0\r\npay = price\r\n\r\ndef burls(x) :\r\n while x % 10 != 0 :\r\n x -= 1\r\n return x\r\n\r\nwhile True :\r\n if price % 10 == 0 :\r\n shovels += 1\r\n break\r\n elif burls(price) + change == price :\r\n shovels += 1\r\n break\r\n else :\r\n shovels += 1\r\n price += pay\r\n continue\r\n \r\nprint(shovels)", "k,r =map(int,input().split())\r\nfor i in range(1,20):\r\n n = k*i\r\n if (n%10) == r or (n%10) == 0:\r\n print(i)\r\n break", "import sys\r\n\r\nprice, single_burel = [int(x) for x in sys.stdin.readline().split()]\r\n\r\ntotal = 1\r\ntotal_price = price\r\n\r\nwhile (total_price - single_burel) % 10 != 0 and total_price % 10 != 0:\r\n total += 1\r\n total_price = total_price + price\r\n \r\nprint(total)", "k, r = (int(j) for j in input().split(\" \"))\ni = 1\nwhile True:\n if ((k*i) % 10 == r or (k*i) % 10 == 0 ):\n print(i)\n exit()\n i += 1\n", "n, r = map(int, input().split())\r\ncnt = 1\r\nwhile cnt <= 10:\r\n if (cnt * n - r) % 10 == 0 or cnt * n % 10 == 0:\r\n break\r\n cnt += 1\r\nif cnt >= 11:\r\n cnt = 10\r\nprint(cnt)", "k, r = map(int, input().split())\r\n\r\ntotal_cost = k\r\ncoins_used = 1\r\n\r\nwhile True:\r\n # check if the total cost can be paid with the coins used so far\r\n if total_cost % 10 == 0 or total_cost % 10 == r:\r\n break\r\n\r\n # add one more shovel to the total cost and update the coins used\r\n total_cost += k\r\n coins_used += 1\r\n\r\nprint(coins_used)", "k,r=map(int,input().split())\r\ni=1\r\nwhile ((k*i)-r)%10!=0 and (k*i)%10!=0:\r\n i+=1\r\nprint(i)\r\n", "x, y = map(int, input().split())\r\nc = 1\r\n\r\nwhile (x * c - y) % 10 != 0 and (x * c) % 10 != 0:\r\n c += 1\r\n\r\nprint(c)\r\n", "k, r = map(int, input().split())\r\nshovel_count = 1\r\nwhile (shovel_count * k) % 10 != r and (shovel_count * k) % 10 != 0:\r\n shovel_count += 1\r\nprint(shovel_count)\r\n", "import math\nn,k=input().split()\nn=int(n)\nk=int(k)\nlist1=[]\nfor i in range(1,10):\n if(i*n)%10 == 0 or (i*n-k)%10==0:\n list1.append(i)\nprint(min(list1))\n \t\t\t \t\t\t \t \t\t \t\t \t\t \t \t \t", "k,r=[int(i) for i in input().split()]\r\nfor x in range(1,10000000000):\r\n if (k*x)%10==0 or (k*x)%10==r:\r\n print(x)\r\n break", "k,r=map(int,input().split())\r\nshovels=1\r\nwhile (shovels*k)%10!=r and (shovels*k)%10!=0:\r\n shovels+=1\r\nprint(shovels)", "def f():\r\n n=input()\r\n n=n.split(\" \")\r\n n=map(int,n)\r\n n=list(n)\r\n k=n[0]\r\n r=n[1]\r\n i=1\r\n temp=k\r\n while True:\r\n remainder=temp%10\r\n if remainder==0:\r\n return i\r\n if remainder-r!=0:\r\n i=i+1\r\n temp=k*i\r\n else:\r\n return i\r\n\r\nprint(f())\r\n \r\n", "# We subtracte the value of the coin and the then implement the code twice, one with the coin and one without it,\r\n# then print the one that requires less shovels to be bought.\r\nk, r = map(int, input().split(\" \"))\r\n\r\ntotal1 = k - r\r\ncount1 = 1\r\n\r\nwhile (total1%10 != 0):\r\n total1 += k\r\n count1 += 1\r\n if count1 == 10:\r\n break\r\n\r\ntotal2 = k\r\ncount2 = 1\r\n\r\nwhile (total2%10 != 0):\r\n total2 += k\r\n count2 += 1\r\n if count2 == 10:\r\n break\r\nprint(min(count1, count2))", "temp = list(map(int,input().split(' ')))\r\nk = temp[0]\r\nr = temp [1]\r\n\r\nx = 1\r\n\r\nwhile True:\r\n if ((k*x))%10 == 0: break\r\n elif ((k*x)-r)%10 == 0 : break\r\n x+=1\r\n\r\nprint(x)", "n,m=map(int,input().split())\r\nm=str(m)\r\nfor i in range(1,11):\r\n x=str(n*i)\r\n if(x[-1]==m or x[-1]==\"0\"):\r\n print(i)\r\n break\r\n", "p, r = [int(x) for x in input().split()]\r\ns = 1\r\n# turn into infinite while\r\nwhile True:\r\n if ((p*s)-r)%10==0: print(s); exit()\r\n elif (p*s)%10==0: print(s); exit()\r\n else: s+=1", "k,r = map(int,input().split())\r\ncount=1\r\ni=k\r\nwhile k%10!=0 and (k-r)%10!=0:\r\n count+=1\r\n k+=i\r\n \r\nprint(count)\r\n", "p,q=input (). split ()\r\n\r\n\r\np=int(p)\r\nq=int(q)\r\ni=0\r\n\r\nwhile 1:\r\n \r\n i=i+1\r\n r=p*i\r\n #print(r)\r\n if r%10==0:\r\n break\r\n elif (r-q)%10==0:\r\n break\r\n \r\n#print(r)\r\nprint (i)", "# A - Buy a Shovel\r\n\r\nk, r = [int(i) for i in input().split()]\r\nquantity = 1\r\ncost = k\r\n\r\nwhile(cost % 10 != 0 and (cost - r) % 10 != 0):\r\n cost += k\r\n quantity += 1\r\n\r\nprint(quantity)", "k , r = map(int,input().split())\r\n\r\nshovels = 1 \r\n\r\ntotal_cost = k \r\n\r\nwhile total_cost %10 !=0 and total_cost %10 != r:\r\n\r\n shovels += 1\r\n total_cost += k\r\n\r\n\r\nprint(shovels)", "k, r = map(int, input().split())\r\n\r\nx=k%10\r\n\r\n\r\nfor y in range(1,10):\r\n if ((x*y)%10 == r) or (x*y)%10==0:\r\n print(y)\r\n break\r\nelse:\r\n print(10)", "k,m=map(int,input().split());i=1\r\nwhile 0!=i*k%10!=m:i+=1\r\nprint(i)", "k,r = map(int,input().split())\r\nbib=k\r\nwhile True:\r\n if bib%10==0:\r\n print(bib//k)\r\n exit()\r\n if bib%10==r:\r\n print(bib//k)\r\n exit()\r\n bib+=k\r\n", "\r\nvalue = 0\r\nprice_made = 0\r\n\r\nk, r = map(int, input().split())\r\nflag = True\r\n\r\nwhile flag:\r\n if price_made % 10 == 0 and price_made != 0 or price_made % 10 == r:\r\n break\r\n value += 1\r\n price_made += k\r\n\r\nprint(value)\r\n", "count , r = list(map(int,input().split()))\r\nfor i in range(1 , 10) :\r\n if (count * i) % 10 == 0 or ((count * i) % 10 == r) : quit(print(i))\r\nprint(1)", "k, r = map(int, input().split(' '))\r\n\r\nk1 = k % 10\r\n\r\nfor i in range(1, 10):\r\n if i * k1 % 10 == r or i * k1 % 10 == 0:\r\n print(i)\r\n break\r\nelse:\r\n print(10)", "\r\ndef solve():\r\n k, r = map(int, input().split())\r\n for n in range(1, 11):\r\n if ((n * k) % 10 == 0) or ((n * k) % 10 == r):\r\n return n\r\n\r\n\r\nprint(solve())\r\n", "k,r = map(int,input().split())\r\ncnt = 1\r\nwhile (k*cnt)%10 != 0 and (k*cnt)%10 != r:\r\n cnt+=1\r\nprint(cnt)", "k,r = map(int,input().split())\r\ncount = 1\r\nwhile True:\r\n if (k*count) % 10 == 0 or (k*count - r) % 10 == 0:\r\n break\r\n count += 1\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\nn=n%10\r\ni=1\r\nwhile True:\r\n if (n*i)%10==m or (n*i)%10==0:\r\n i+=1\r\n break\r\n i+=1\r\nprint(i-1)", "str1 = input().split()\r\nlist1 = []\r\nfor x in str1 :\r\n list1.append(int(x))\r\nsum = 1\r\nsum2 = 0\r\nfor x in range(15) :\r\n sum2 += list1[0]\r\n if sum2 % 10 == 0 :\r\n break\r\n elif (sum2-list1[1]) % 10 == 0 :\r\n break\r\n else :\r\n sum+=1\r\nprint(sum)", "k,r = input().split()\nk=int(k)\nr=int(r)\nfor n in range(1,11):\n if((n*k-r)%10==0 or (n*k)%10==0):\n print(n)\n break\n \t\t\t\t \t\t\t\t \t\t\t\t \t \t\t \t \t\t\t", "h, a = map(int, input().split())\r\n\r\nshovels = 1\r\n\r\nwhile True:\r\n\r\n if (shovels*h - a)%10 == 0 or (shovels*h)%10 == 0:\r\n break\r\n shovels +=1\r\n\r\nprint(shovels)", "k,r=list(map(int,input().split()))\r\nc=0\r\ni=1\r\nwhile True:\r\n if k*i==((k*i)//10)*10+r or k*i==((k*i)//10)*10:\r\n c+=1\r\n print(c)\r\n break\r\n\r\n else:\r\n i+=1\r\n c+=1", "k, r = input().split()\r\nk = int(k) #цена лопаты\r\nr = int(r) #монета в кармане\r\nn = 0 #иск. значение\r\nfor i in range (1,1000):\r\n if (i*k)%10 == 0:\r\n n=i\r\n break\r\n elif ((i*k)-r)%10 == 0:\r\n n=i\r\n break\r\nprint (n)", "a,b=input().split(' ')\r\na=int(a)\r\nb=int(b)\r\nfor i in range(1,11):\r\n if((a*i)%10==b or (a*i)%10==0):\r\n print(i)\r\n break\r\n \r\n", "k, r = map(int,input().split())\r\ns = 1\r\n\r\nwhile True:\r\n count = s * k\r\n if count % 10 == 0:\r\n break\r\n elif count % 10 == r:\r\n break\r\n s += 1\r\nprint(s)\r\n", "n=input().split()\r\n\r\nk=int(n[0])\r\nr=int(n[1])\r\n\r\ni=1\r\ncount=0\r\n\r\nwhile True:\r\n count+=1\r\n if k%10==0:\r\n break\r\n elif (k*i)%10==0:\r\n break\r\n elif ((k*i)-r)%10==0:\r\n break\r\n i+=1\r\n\r\nprint(count)\r\n\r\n\r\n\r\n", "v,v1=map(int,input().split());c=1\r\nwhile 0!=c*v%10 !=v1:\r\n c+=1\r\nprint(c)", "k,r = [int(x) for x in input().split()]\r\nif k % 10 == r:\r\n print(1)\r\nelse:\r\n a = k\r\n i = 1\r\n while ((a % 10) != r) and ((a % 10) != 0):\r\n a = k * i\r\n i+=1\r\n print(a//k)", "input_ = input().split()\r\nk, r = int(input_[0]), int(input_[1])\r\n\r\nn = 1\r\nwhile True:\r\n\tif ((k%10)*n)%10 == r:\r\n\t\tprint(n)\r\n\t\tbreak\r\n\tif (n*k) % 10 == 0:\r\n\t\tif k % 5 == 0:\r\n\t\t\tprint(n)\r\n\t\t\tbreak\r\n\t\tif (k % 10 % 2 == 0 and r % 2 == 1) or (k % 10 % 2 == 1 and r % 2 == 0):\r\n\t\t\tprint(n)\r\n\t\t\tbreak\r\n\tn += 1", "k,r=map(int,input().split())\r\ni=1\r\nwhile 0 != i * k % 10 != r:\r\n i+=1\r\nprint(i)", "k,r = input().split()\r\n\r\nk = int(k)\r\nr = int(r)\r\ntmp = k\r\ni = 1\r\nwhile k%10 != 0 and (k%10)-r != 0:\r\n i += 1\r\n k += tmp\r\nprint(i)", "price_of_each_shovel, that_one_coin = map(int, input().split())\r\nshovels = 1\r\n\r\nwhile (shovels * price_of_each_shovel) % 10 != 0 and (shovels * price_of_each_shovel) % 10 != that_one_coin:\r\n shovels += 1\r\n\r\nprint(shovels)\r\n", "def main():\r\n \r\n\tfrom sys import stdin, stdout\r\n\t\r\n\tkopam,rat= tuple(map(int, stdin.read().split()))\r\n\r\n\tnop= 0\r\n\t\r\n\tapple= int()\r\n\r\n\twhile True:\r\n\t \r\n\t\tif nop!= 0 and (10*nop) % kopam== 0:\r\n\t\t \r\n\t\t\tapple= (10 * nop) // kopam\r\n\t\t\t\r\n\t\t\tbreak\r\n\t\t\t\r\n\t\tif (10 * nop+rat) % kopam== 0:\r\n\t\t \r\n\t\t\tapple= (10 * nop+rat) // kopam\r\n\t\t\t\r\n\t\t\tbreak\r\n\t\t\t\r\n\t\tnop+= 1\r\n\r\n\tstdout.write(str(apple) + '\\n')\r\n\r\nif __name__ == '__main__':\r\n \r\n\tmain()", "\r\np,r=map(int,input().split());i=1\r\nwhile 0!=i*p%10!=r:i+=1\r\nprint(i)", "k, r = map(int,input().split()); i=1\r\nwhile 0!=i*k%10!=r:i+=1\r\nprint(i)", "#Buy a Shovel\r\n\r\nshowel_price_actual, burles = [int(x) for x in input().split(\" \")]\r\n#print(type(showel))\r\n\r\n\r\nshowel_count = 0\r\nmuliplier = 1\r\nloopCount = 0\r\nshowel_price = showel_price_actual\r\nwhile(1):\r\n\tloopCount = loopCount + 1\r\n\tif(showel_price%10==0):\r\n\t\tshowel_count = showel_count+1\r\n\t\t#print(\"Hello\")\r\n\t\t\r\n\telse:\r\n\t\trem_shovel = showel_price%10\r\n\t\tif(rem_shovel == burles):\r\n\t\t\tshowel_count = showel_count + 1\r\n\t\t\t#print(\"Hi\")\r\n\r\n\t\r\n\r\n\tif(showel_count >=1):\r\n\t\tbreak\r\n\telse:\r\n\t\tmuliplier = muliplier + 1\r\n\t\tshowel_price = showel_price_actual * muliplier\r\n\t\t# print(showel_count)\r\n\t\t# print(rem_shovel)\r\n\t\t# print(\"-----\")\r\n\t\t# print(showel_price)\r\n\t\r\n\r\n\r\nprint(loopCount)", "n,m=map(int,input().split())\r\ni=1\r\np=n\r\nj=i\r\nwhile (n%10!=0 and n%10!=m):\r\n i+=1\r\n n=p*i\r\n j=i\r\nprint(j)", "k,r=map(int,input().split())\r\nfor i in range(1,10):\r\n if (k*i)%10==0 or (k*i)%10==r:\r\n print(i)\r\n break", "x,y = map(int,input().split())\r\nc = 1\r\nk = x\r\nwhile k%10!=y and k%10!=0:\r\n c+=1\r\n k= x*c\r\nprint(c)", "a,b=map(int,input().split())\r\ncounter=0\r\nrep=a\r\nwhile True:\r\n a=rep\r\n counter+=1\r\n a*=counter\r\n if a%10==0:\r\n break\r\n a-=b\r\n if a%10==0:\r\n break\r\nprint(counter)", "k, r = map(int, input().split())\r\nx = k\r\nb = True\r\nbr = 1\r\n\r\nwhile b:\r\n if k % 10 == 0:\r\n b = False\r\n print(br)\r\n elif k % 10 == r:\r\n b = False\r\n print(br)\r\n else:\r\n k += x\r\n br += 1\r\n\r\n", "k, r = map(int, input().split())\r\nf = True\r\ns = 1\r\nd = k\r\nwhile f:\r\n if k % 10 == r or k % 10 == 0:\r\n f = False\r\n else:\r\n k += d\r\n s += 1\r\nprint(s)", "a, b = list(map(int, input().split()))\r\n\r\ncount = 1\r\n\r\nwhile a:\r\n temp = a * count\r\n if temp % 10 == 0 or temp % 10 == b:\r\n print(count)\r\n break\r\n else:\r\n count += 1", "a,b = map(int, input().split())\r\ni = 1\r\nc = a\r\nwhile True:\r\n if (a % 10) == 0:\r\n break\r\n elif (a % 10) - b != 0:\r\n i += 1\r\n a = c * i\r\n else:\r\n break\r\nprint(i)", "k, r = map(int, input().split())\r\nn = 1\r\nwhile True:\r\n if k * n % 10 == 0 or k * n % 10 == r:\r\n break\r\n n += 1\r\nprint(n)", "k, r = map(int, input().split())\r\n\r\nshovels = 1\r\ntotal_price = k\r\n\r\nwhile total_price % 10 != 0 and total_price % 10 != r:\r\n shovels += 1\r\n total_price += k\r\n\r\nprint(shovels)\r\n", "x,y=map(int,input().split())\nn=1\nwhile(True):\n total_price=x*n#t=15*1\n total_price_1=(total_price-y)%10\n z=total_price%10\n if(total_price_1==0 or z==0):\n break\n n+=1\nprint(n)\n \t \t\t\t \t\t\t\t\t\t \t \t\t", "k,r = input().split()\r\ncount = 1\r\nwhile True:\r\n value = count* int(k)\r\n if value%10 == 0 or (value-int(r))%10 == 0:\r\n break\r\n count+=1\r\nprint(count)", "k, r = map(int, input().split())\r\nprice_burle = k\r\nshoveles = 1\r\nwhile price_burle % 10 != r and price_burle % 10 != 0:\r\n shoveles += 1\r\n price_burle += k\r\nprint(shoveles)\r\n", "a = list(map(int, input().split()))\r\nboo = True\r\ni = 1\r\nwhile boo:\r\n if ((a[0]*i)-a[1])%10 == 0 or (a[0]*i)%10 == 0:\r\n print(i)\r\n boo = False\r\n i += 1", "t,r=map(int,input().split())\r\nt1=t\r\ncou=1\r\nwhile True:\r\n if t%10!=0 and t%10!=r:\r\n cou+=1\r\n t+=t1\r\n else:\r\n break\r\nprint(cou)", "k,r=list(map(int,input().strip().split()))\r\nans=10\r\nfor i in range(1,10):\r\n if (k*i)%10==0 or (k*i-r)%10==0:\r\n ans=i\r\n break\r\nprint(ans)", "k, r = map(int,input().split())\r\ni = 1\r\nwhile True:\r\n if i * k % 10 != 0 and i * k % 10 != r:\r\n i += 1\r\n else:\r\n break\r\nprint(i)", "k, r = map(int, input().split())\r\nx = 1\r\nwhile not (k * x % 10 == 0 or k * x % 10 == r):\r\n x += 1\r\nprint(x)\r\n", "a,b = map(int,input().split())\r\nc = a\r\nk = 1\r\nwhile(str(a)[len(str(a))-1] != str(b)):\r\n if a%10==0:\r\n break\r\n k+=1\r\n a+=c\r\nprint(k)", "n,r = input().split()\r\nr = int(r)\r\nn = int(n)\r\ncnt = 1\r\ns = n\r\nwhile s %10 and (s-r) % 10:\r\n s += n\r\n cnt += 1\r\nprint(cnt)", "import math\r\nk,r = map(int,input().split())\r\nn = 1\r\nwhile n<10:\r\n mul = k * n\r\n if mul % 10 == r:\r\n print(n)\r\n break\r\n n += 1\r\nelse:\r\n print(math.lcm(k,10)//k)\r\n ", "k,r=map(int,input().split())\r\nx=1 \r\nwhile (k*x)%10!=r and (k*x)%10!=0:\r\n x+=1 \r\nprint(x)", "k, r= map(int,input().split())\ncount = 1\nsum=k\n\nfor i in range(1000):\n if sum%10==0:\n break\n elif (sum-r)%10==0:\n break\n else:\n sum += k\n count += 1\nprint (count)", "num_list = input().split(' ')\r\nnum1 = int(num_list[0]) % 10\r\nnum2 = int(num_list[1])\r\nfor i in range(1,10):\r\n if (str(num1*i)[-1] == str(num2)) or (str(num1*i)[-1] == '0'):\r\n break\r\nprint(i)", "k, r = [int(i) for i in input().split()]\r\n\r\nfor i in range(1, 10):\r\n if k * i % 10 == r:\r\n print(i)\r\n break\r\n if k * i % 10 == 0:\r\n print(i)\r\n break\r\n ", "k,r=map(int,input().split())\r\ni=1\r\nx=k\r\nwhile i>=1:\r\n if k%10==0:\r\n print(i)\r\n break\r\n elif (k-r)%10==0:\r\n print(i)\r\n break\r\n else:\r\n i+=1\r\n k=i*x\r\n\r\n", "n,k=input(\"\").split()\r\nn=int(n)\r\nt=n\r\nk=int(k)\r\nm=2\r\ncount=1\r\nwhile(True):\r\n if (n%10==0 or n%10==k):\r\n break\r\n else:\r\n count+=1\r\n n=t*(count)\r\n \r\nprint(count)", "k,r=map(int,input().split())\r\ns=1\r\nwhile (k*s)%10!=r and (k*s)%10!=0:\r\n s+=1\r\nprint(s)", "# cook your dish here\r\n\r\nK,R=map(int,input().split())\r\nN=1\r\nwhile N<10:\r\n if ((K*N)/10)%1:\r\n if not(((K*N-R)/10)%1):\r\n break\r\n else:\r\n break\r\n N+=1\r\nprint(N)", "k,r=map(int,input().split());res=0;i=0\r\nwhile True:\r\n i+=1\r\n t=k*i\r\n m=t%10\r\n if m==0 or m==r:\r\n res+=1\r\n break\r\n res+=1\r\nprint(res)\r\n", "k, r = map(int, input().split())\r\nshovels = 1\r\nprice = k \r\nwhile price % 10 != 0 and price % 10 != r:\r\n shovels += 1\r\n price = k * shovels\r\n\r\nprint(shovels)", "x1, x2 = [int(x) for x in input().split()]\r\nq = x1\r\nwhile (str(q)[-1] != '0') and (str(q)[-1] != str(x2)):\r\n q += x1\r\nelse:\r\n print(q // x1)", "a=list(map(int,input().split()))\r\nfor i in range(1,10):\r\n if (a[0]*i)%10==a[1] or (a[0]*i)%10==0:\r\n print(i)\r\n break\r\n", "k,r = map(int, input().split())\r\ncounting = True\r\ncount =1\r\nwhile(counting):\r\n if(k*count%10 == 0):\r\n counting = False\r\n elif(k*count%10==r):\r\n counting = False\r\n count = count+1\r\nprint(count-1)", "a, b = [int(i) for i in input().split()]\r\ni = 1\r\nwhile (a * i) % 10 != b and (i * a) % 10 != 0:\r\n i += 1\r\nprint(i)", "#H - Buy a Shovel\nx, y = input().split()\nx= int(x)\ny= int(y)\ncounter=1\nwhile True :\n if (x*counter)%10== y or (x*counter)%10==0:\n break\n else:\n counter+=1\n \nprint(counter)\n\n\n \t\t \t\t \t \t \t\t\t \t\t \t\t\t", "def main():\r\n\tfrom sys import stdin, stdout\r\n \r\n\t# stdin = open(\"input.txt\", \"r\")\r\n \r\n\tk, r = tuple(map(int, stdin.read().split()))\r\n \r\n\tn = 0\r\n\tans = int()\r\n \r\n\twhile True:\r\n\t\tif n != 0 and (10*n) % k == 0:\r\n\t\t\tans = (10 * n) // k\r\n\t\t\tbreak\r\n\t\tif (10 * n + r) % k == 0:\r\n\t\t\tans = (10 * n + r) // k\r\n\t\t\tbreak\r\n\t\tn += 1\r\n \r\n\tstdout.write(str(ans) + '\\n')\r\n \r\nif __name__ == '__main__':\r\n\tmain()", "k1, r1 = map(int, input().split())\r\n\r\nshovels1 = 1 # Start with buying one shovel\r\nwhile (shovels1 * k1) % 10 != 0 and (shovels1 * k1) % 10 != r1:\r\n shovels1 += 1\r\n\r\nprint(shovels1)\r\n", "k, r = map(int, input().split())\r\n\r\nshovels = 1\r\nwhile True:\r\n total_cost = shovels * k\r\n if total_cost % 10 == 0 or total_cost % 10 == r:\r\n break\r\n shovels += 1\r\n\r\nprint(shovels)\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "b, r = map(int, input().split())\r\nsum = 0\r\nj = 0\r\n\r\nwhile True:\r\n sum += b\r\n j = j + 1\r\n if (sum % 10 == 0) or (sum % 10 == r):\r\n print(j)\r\n break\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nx=1\r\nz=10\r\nc=0\r\nfor i in range(9):\r\n if x*a%10==b and c==0 or x*a%10==0 and c==0:\r\n print(x)\r\n c=1\r\n else:\r\n x=x\r\n x=x+1\r\nif x==10 and c==0:\r\n print(10)", "def main(k, r):\r\n i = 1\r\n\r\n while True:\r\n if (k * i - r) % 10 == 0 or (k * i) % 10 == 0:\r\n return i\r\n\r\n i += 1\r\n\r\nif __name__ == \"__main__\":\r\n k, r = map(int, input().split())\r\n\r\n print(main(k, r))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk, r = map(int, input().split())\r\nans = 0\r\nx = 0\r\nfor _ in range(20):\r\n x += k\r\n ans += 1\r\n if x % 10 == r or not x % 10:\r\n break\r\nprint(ans)", "def main():\n k, r = (int(_) for _ in input().split())\n\n for i in range(1, 10):\n word = str(k * i)\n if word[-1] == \"0\" or word[-1] == str(r):\n print(i)\n break\n\n\nif __name__ == \"__main__\":\n main()\n", "a,b=map(int,input().split())\r\nif a%10 ==b:\r\n print(1)\r\nelse:\r\n for i in range(1,10):\r\n if (a*i)%10==0 or (a*i)%10==b:\r\n print(i)\r\n break", "n, k = map(int, input().split())\r\nfor i in range(1, 11):\r\n t = n * i\r\n if t % 10 == 0 or (t-k) % 10 == 0:\r\n print(i)\r\n break", "a, b = map(int, input().split())\r\ni = 1\r\nwhile True:\r\n if (a * i)%10 == 0 or ((a * i) - b)%10 == 0:\r\n print(i)\r\n break\r\n else:\r\n i+=1", "k, r = map(int, input().split())\r\nans = 1\r\nwhile not(ans * k % 10 == 0 or (ans *k - r) % 10 == 0):\r\n ans += 1\r\nprint(ans)", "# https://codeforces.com/problemset/problem/732/A\r\n\r\nshovel_cost, extra_coin = map(int, input().split())\r\nresult = None\r\nresult_found = False\r\n\r\nfor i in range(1, 11):\r\n if result_found:\r\n break\r\n required_amount = i * shovel_cost\r\n\r\n coins_num = 0\r\n coins_value = 0\r\n while coins_value <= required_amount and not result_found:\r\n coins_num += 1\r\n coins_value += 10\r\n if required_amount % coins_value == 0 or (required_amount - extra_coin) % coins_value == 0:\r\n result = i\r\n result_found = True\r\n\r\nprint(result)\r\n", "num = input()\nn = (num.split(\" \"))\ni = 1\nwhile 1:\n if (int(n[0])*i) % 10 == 0:\n print(i)\n break\n elif ((int(n[0])*i)-int(n[1])) % 10 == 0:\n print(i)\n break\n else:\n i += 1\n\n\t \t\t\t\t \t\t\t \t\t \t\t\t \t \t\t\t \t \t", "str=input()\nl=str.split(\" \")\np1=int(l[0])\np2=int(l[1])\n\n\nnew = p1 % 10\nans=0\nfor j in range(1,11):\n if((new*j)%10 == p2 or ((p1 * j) % 10) == 0):\n ans=j\n break\n \nprint(ans)\n\n \t \t \t \t \t\t\t\t\t\t \t\t", "k,r = map(int,input().split())\r\ncount = 0\r\nfor i in range(1,10):\r\n d = i*k\r\n count+=1\r\n f = str(d)\r\n if d%10==0 or f[-1]==str(r):\r\n break\r\n else:\r\n d = 0\r\n\r\nprint(count)\r\n", "a=input().split()\r\nprice=int(a[0])\r\ncoin=int(a[1])\r\n\r\nx=1\r\n\r\nwhile x>=1:\r\n if price*x % 10 == coin or price*x % 10 == 0 :\r\n print(x)\r\n break\r\n x+=1", "def main():\r\n shopper=input()\r\n price=int(shopper.split()[0])\r\n burles=int(shopper.split()[1])\r\n remainder=price%10\r\n if(remainder==0):\r\n print(\"1\")\r\n return\r\n number=1\r\n while(True):\r\n if(remainder*number%10==0 or remainder*number%10==burles ):\r\n break\r\n number+=1\r\n \r\n print(number)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "k,r=input().split()\r\nl=int(k[-1])\r\nf=int(r[-1])\r\nk,r=int(k),int(r)\r\nfor i in range(1,10):\r\n if int(str(l*i)[-1])%10==0:\r\n print(i)\r\n break\r\n elif int(str(l*i)[-1])==f:\r\n print(i)\r\n break", "a, b = map(int, input().split())\r\nc = 0\r\ni = 1\r\nwhile True:\r\n v = (a * i) - (((a * i) // 10) * 10)\r\n\r\n\r\n if v == b or v%10==0:\r\n if v >= b:\r\n\r\n c = v // b\r\n else:\r\n c += v\r\n break\r\n else:\r\n i += 1\r\n\r\nprint(i)", "a,b = (input().split(' '))\r\na,b = int(a),int(b)\r\n\r\ncnt = 1\r\nwhile True:\r\n \r\n if (a * cnt) % 10 == 0 or (a * cnt - b) % 10 == 0:\r\n print(cnt)\r\n break\r\n cnt += 1", "k,r = map(int,input().split())\r\ncount = 0 \r\nn = 0\r\nwhile True:\r\n\t\tif n != 0 and (10*n) % k == 0:\r\n\t\t\tcount = (10 * n) // k\r\n\t\t\tbreak\r\n\t\tif (10 * n + r) % k == 0:\r\n\t\t\tcount = (10 * n + r) // k\r\n\t\t\tbreak\r\n\t\tn += 1\r\n\r\nprint(count)", "# Read the input\r\nk, r = map(int, input().split())\r\n\r\n# Initialize the number of shovels\r\nshovels = 1\r\n\r\n# Find the minimum number of shovels\r\nwhile (shovels * k) % 10 != r and (shovels * k) % 10 != 0:\r\n shovels += 1\r\n\r\n# Print the result\r\nprint(shovels)\r\n", "def main():\r\n k, r=input().split()\r\n k=int(k)\r\n r=int(r)\r\n NoOfShovel=shovel(k,r)\r\n print(NoOfShovel)\r\n\r\n\r\n\r\ndef shovel(K,R):\r\n i=1\r\n while(True):\r\n if (i*K)%10 == R or (i*K)%10 == 0:\r\n return i\r\n else:\r\n i+=1\r\n\r\n\r\nif __name__=='__main__':\r\n main()", "s = input().split()\r\n\r\nk = int(s[0])\r\n\r\nf = int(s[1])\r\n\r\nfor i in range(1, 11):\r\n\r\n\tif (k*i)%10==f or (k*i)%10==0:\r\n\r\n\t\tprint(i)\r\n\r\n\t\tbreak", "k , r = map(int,input().split())\r\nnum=1\r\nwhile (k*num)%10 != 0 and ((k*num)-r)%10 != 0 :\r\n num+=1\r\nprint(num)", "from sys import stdin\r\nk,r=map(int,stdin.readline().split())\r\na=1\r\nwhile 0!=a*k%10!=r:\r\n a+=1\r\nprint(a)\r\n", "k,r = map(int,input().split())\r\nfor i in range(1,11):\r\n if (k * i) % 10 == 0 or (k * i - r) % 10 == 0:\r\n print(i)\r\n break", "l1 = input().split()\r\nprice = int(l1[0])\r\nr = int(l1[1])\r\nhowmany = 0\r\nc = 1\r\nwhile True:\r\n add = price * c\r\n howmany += 1\r\n if (add -r) % 10 == 0:\r\n break\r\n elif add % 10 == 0:\r\n break\r\n c += 1\r\nprint(howmany)", "def shovel():\r\n for i in range(1):\r\n k, r = map(int, list(input().split(' ')))\r\n flag = False\r\n for j in range(1,10):\r\n if not flag:\r\n if ((k*j - r) % 10 == 0) or (k*j % 10 == 0):\r\n flag = True\r\n print(j)\r\n if not flag:\r\n print(10)\r\n\r\nshovel()\r\n ", "price, m = map(int, input().split())\r\ni=1\r\np = price\r\nwhile price%10 not in (m, 0):\r\n price+=p\r\n i+=1\r\nprint(i)", "k,r = map(int , input().split())\r\nfor i in range(1,1000):\r\n if i * k % 10 == 0 or i * k % 10 == r:\r\n print(i)\r\n break", "input_int = [int(n) for n in input().split()]\nk, r = input_int[0], input_int[1]\n\nn = 1\nwhile True:\n\tif ((k%10)*n)%10 == r:\n\t\tprint(n)\n\t\tbreak\n\tif (n*k) % 10 == 0:\n\t\tif abs((k % 10 % 2)-(r % 2)) == 1 or k % 5 == 0:\n\t\t\tprint(n)\n\t\t\tbreak\n\tn += 1", "k,r =map(int, input().split())\r\n\r\nshovels =1\r\n\r\nwhile True:\r\n total_price = k*shovels\r\n if total_price % 10 ==0 or total_price%10 ==r:\r\n break\r\n shovels +=1\r\n \r\nprint(shovels)", "k,r=map(int,input().split())\r\nc=1\r\nwhile (c*k-r)%10!=0 and (c*k)%10!=0:\r\n c+=1\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nc=0\r\nv=0\r\nwhile True:\r\n v+=a\r\n c+=1\r\n if v%10==0 or v%10==b:\r\n break\r\nprint(c)", "price,coin = [int(i) for i in input().split()]\r\nstore = []\r\nnewprice = price\r\ni = 1\r\nwhile True:\r\n newprice = price * i\r\n if newprice % 10 == 0:\r\n store.append(i)\r\n if (newprice - coin) % 10 == 0 or newprice - coin == 0:\r\n print(i)\r\n break\r\n if i > 10:\r\n print(min(store))\r\n break\r\n i += 1", "k, r = map(int, input().split())\r\ns = 0\r\nd = k\r\nwhile True:\r\n if k%10-r==0 or k%10==0:\r\n s += 1\r\n break\r\n else:\r\n k += d\r\n s += 1\r\nprint(s)\r\n", "i,m=map(int,input().split()); j=1\r\nwhile 0!= j*i%10!=m:j+=1\r\nprint(j)", "n,c = map(int , input().split())\r\nminumum = False\r\ni = 0\r\ncost =0 \r\nwhile not minumum:\r\n i+=1\r\n cost = i*n\r\n if cost % 10 == c or cost%10 ==0:\r\n minumum = True\r\n \r\nprint(i)", "x,y=map(int,input().split())\nn=1\nwhile(True):\n if (x*n)% 10 == 0:\n print(n)\n break\n if (x*n-y) % 10 == 0:\n print(n)\n break\n n+=1\n \n\t\t \t\t \t\t\t \t\t\t\t\t \t\t \t", "k, r = map(int, input().split())\r\nans = 1\r\nwhile ans * k % 10 != 0 and ans * k % 10 != r and ans != 10:\r\n ans += 1\r\nprint(ans)\r\n", "\n\n\n\n# Press the green button in the gutter to run the script.\nfrom builtins import input\n\nif __name__ == '__main__':\n my_input = list(map(int, input().split(\" \")))\n price = my_input[0]\n r = my_input[1]\n\n for i in range(1,9999):\n if(price*i % 10 == 0):\n print(i)\n break\n elif(price*i % 10 == r):\n print(i)\n break\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "k,r=map(int,input().split())\r\nl=[]\r\nfor i in range(1,101):\r\n total=(i*k)-r\r\n total2=(i*k)\r\n if total%10==0 or total2%10==0:\r\n l.append(i)\r\n break\r\nprint(l[0])", "k,r = tuple(map(int,input().strip(\" \").split(\" \")))\r\n\r\nc = 1 \r\nwhile c < 10:\r\n\tif (c*k) % 10 == 0 or (k*c) % 10 == r:\r\n\t\tbreak\r\n\tc += 1\r\nprint(c)", "cost_of_shovel,r=[int(x) for x in input().split()]\ntotal_costs=[]\nfor i in range(1,11):\n total_costs.append(cost_of_shovel*i)\npossible=[]\nfor j in total_costs:\n if j%10==0 and j//cost_of_shovel!=10:\n possible.append(j)\n if j%10==r and j//cost_of_shovel!=10:\n possible.append(j)\n else:\n possible.append(10*cost_of_shovel)\nprint(min(possible)//cost_of_shovel)", "k, r = map(int, input().split())\r\nx = k\r\ncnt = 1\r\nwhile x%10 != r and x%10 != 0:\r\n cnt += 1\r\n x += k\r\nprint(cnt)\r\n", "price, extra = map(int,input().split())\n\ntoBuy = 1\nwhile (toBuy*price) % 10 != 0 and ((toBuy*price) - extra )% 10 != 0:\n toBuy += 1\nprint(toBuy)", "k,r=list(map(int,input().split()))\r\ns=0\r\nfor i in range(1,100):\r\n s=s+k\r\n if s%10==0 or s%10==r:\r\n print(i)\r\n break\r\n", "k,r=map(int,input().split())\r\ni=1\r\nfor i in range(1,11):\r\n if (k*i)%10==r or (i*k)%10==0:\r\n print(i)\r\n break\r\n", "k,r = map(int,input().split())\r\ni=1\r\nwhile True:\r\n v = i * k\r\n if v % 10==r or v%10==0:\r\n break\r\n else:\r\n i+=1\r\n v=0\r\nprint(i)", "k, r = [int(x) for x in input().split()]\r\nfor i in range(1,11):\r\n if( (k*i)%10 == r or (k*i)%10 == 0):\r\n print(i)\r\n break\r\n ", "k, r = map(int, input().split())\r\nans = 1\r\nfor i in range (10):\r\n if (ans*k) % 10 == 0 or (ans*k) %10== r:\r\n break\r\n ans += 1\r\nprint(ans)", "k, r = map(int, input().split())\r\ncount = 1\r\nc = k\r\n\r\nwhile k % 10 != 0 and (k % 10) - r != 0:\r\n count += 1\r\n k += c\r\nprint(count)", "a,b=map(int,input().split())\r\nfor i in range(1,11):\r\n if((a*i)%10==b): break\r\n elif((a*i)%10==0): break\r\n\r\nprint(i)" ]

[ "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\ndiv=[[] for i in range(10**5+1)]\r\n\r\n\r\nfor i in range(1,10**5+1):\r\n for j in range(1,10**5//i+1):\r\n div[i*j].append(i)\r\n\r\nn=I()\r\nlast=[-1]*(10**5+1)\r\n\r\n\r\nfor j in range(n):\r\n x,y=R()\r\n ans=0\r\n for i in div[x]:\r\n if last[i]<j-y:\r\n ans+=1\r\n\r\n last[i]=j\r\n\r\n\r\n print(ans)", "entrada = int(input())\ntemporario = [-1] * 100005\ni=1\nwhile(i<=entrada): \n resposta=0 \n x,y = input().split()\n x = int(x)\n y = int(y) \n j = 1\n while(j*j<=x): \n if (x%j==0): \n if (i-temporario[j]>y):\n resposta += 1 \n if (x-j*j and i-temporario[int(x/j)]>y): \n resposta += 1 \n temporario[j]=temporario[int(x/j)]=i\n j += 1 \n print(resposta)\n i += 1 \n \t\t\t\t \t\t \t\t\t \t\t \t\t \t \t\t\t", "maxn=100000\r\ndiv=[0]*(maxn+1)\r\nlast=[-maxn]*(maxn+1)\r\n\r\n#Inicializa con lista vacía cada posición\r\nfor i in range(maxn+1):\r\n div[i]=list()\r\n\r\n#Guarda en div[j] la lista de divisores de j\r\nfor i in range(2,maxn+1):\r\n for j in range(i,maxn+1,i):\r\n div[j].append(i)\r\n\r\n#Resuelve cada caso de prueba\r\nt=int(input())\r\nfor k in range(0,t):\r\n #Parsea\r\n x,y = input().split(\" \")\r\n x=int(x)\r\n y=int(y)\r\n\r\n if y==0:\r\n print((len(div[x])+1)) #Cantidad de Divisores contando al 1\r\n else:\r\n #La cantidad de divisores que cumplen que el último múltiplo\r\n #de ellos que apareció entre los casos fue antes del caso en la posición\r\n #actual-y\r\n print((sum(1 for v in div[x] if last[v]<k-y))) \r\n\r\n #Actualiza la posición del último caso que fue múltiplo de los calores pasando\r\n #por cada divisor de este\r\n for d in div[x]:\r\n last[d]=k\r\n", "import sys\r\nimport collections as cc\r\ninput=sys.stdin.buffer.readline\r\nI=lambda:list(map(int,input().split()))\r\nprev=cc.defaultdict(int)\r\nfor tc in range(int(input())):\r\n\tx,y=I()\r\n\tdiv=set()\r\n\tfor i in range(1,int(x**0.5)+1):\r\n\t\tif x%i==0:\r\n\t\t\tdiv.add(i)\r\n\t\t\tdiv.add(x//i)\r\n\tans=0\r\n\tnow=tc+1\r\n\tfor i in div:\r\n\t\tif now-prev[i]>y:\r\n\t\t\tans+=1\r\n\t\tprev[i]=now\r\n\tprint(ans)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef divisor(i):\r\n s = []\r\n for j in range(1, int(i ** (1 / 2)) + 1):\r\n if i % j == 0:\r\n s.append(i // j)\r\n s.append(j)\r\n return sorted(set(s))\r\n\r\nn = int(input())\r\nl = pow(10, 5) + 5\r\nla = [-1] * l\r\nans = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n s = divisor(x)\r\n ans0 = 0\r\n for j in s:\r\n if not i - y <= la[j]:\r\n ans0 += 1\r\n la[j] = i\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "def calculate_smallest_factor(n):\r\n from math import sqrt\r\n for prime in range(2,int(sqrt(n+1))+1):\r\n if smallest_factor[prime]==prime:\r\n for factor in range(prime*prime,n+1,prime):\r\n if smallest_factor[factor] == factor:\r\n smallest_factor[factor] = prime\r\n return smallest_factor\r\n\r\ndef calculate_freq_of_prime_factors(n):\r\n factors = {}\r\n while n!=1:\r\n factor = smallest_factor[n]\r\n factors[factor] = factors.get(factor,0)+1\r\n n//=factor\r\n return factors\r\n\r\ndef calculate_all_divisiors(freq):\r\n ans = [1]\r\n for prime_factor in freq:\r\n count = freq[prime_factor]\r\n curr = prime_factor\r\n new = []\r\n for j in range(count):\r\n for divisor in ans:\r\n new.append(divisor*curr)\r\n curr*=prime_factor\r\n ans.extend(new)\r\n return ans\r\n \r\n \r\nn = int(input())\r\nN = 10**5\r\nsmallest_factor = [i for i in range(N+1)]\r\ncalculate_smallest_factor(N)\r\nlast_index_with_divisor = [-1 for i in range(N+1)]\r\nfor i in range(n):\r\n x,y = [int(i) for i in input().strip().split()]\r\n divisors = calculate_all_divisiors(calculate_freq_of_prime_factors(x))\r\n count = 0\r\n for divisor in divisors:\r\n if i-last_index_with_divisor[divisor]>y:\r\n count+=1\r\n last_index_with_divisor[divisor] = i\r\n print(count)\r\n ", "from math import sqrt,ceil\r\nn=int(input())\r\nl=[[] for i in range(n)]\r\nans=0\r\nd=dict()\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n ans=0\r\n for j in range(1,ceil(sqrt(a))+1):\r\n if a%j==0:\r\n j2=a//j\r\n if j!=j2:\r\n if not j in d:\r\n d[j]=i\r\n ans+=1\r\n else:\r\n t=d[j]\r\n if i-b>t:\r\n ans+=1\r\n d[j]=i\r\n \r\n if not j2 in d:\r\n d[j2]=i\r\n ans+=1\r\n else:\r\n t=d[j2]\r\n if i-b>t:\r\n ans+=1\r\n d[j2]=i\r\n else:\r\n if not j in d:\r\n d[j]=i\r\n ans+=1\r\n else:\r\n t=d[j]\r\n if i-b>t:\r\n ans+=1\r\n d[j]=i\r\n \r\n print(ans)\r\n\r\n\r\n", "#!/usr/bin/env python3\n\nfrom math import sqrt\n\nn = int(input())\n\nlatest = {}\nfor i in range(1, n+1):\n x, y = map(int, input().split())\n cnt = 0\n for d in range(1, int(sqrt(x))+1):\n if x % d != 0:\n continue\n if latest.get(d, 0) < i - y:\n cnt += 1\n latest[d] = i\n q = x // d\n if q == d:\n continue\n if latest.get(q, 0) < i - y:\n cnt += 1\n latest[q] = i\n\n print(cnt)\n" ]

[ "import sys\nimport math\n\nN = int(sys.stdin.readline().strip())\nmoods = sys.stdin.readline().strip().split()\n\ndef check(N, moods):\n regular = False\n for k in range(3,(N+1)):\n if N%k==0:\n regular = True\n for start in range(0,int(N/k)):\n regular = True\n for i in range(start,N,int(N/k)):\n if moods[i]!='1':\n regular = False\n break\n if regular:\n return True\n return False\n\nif check(N, moods):\n print(\"YES\")\nelse:\n print(\"NO\")", "def sol(c) : \r\n for i in div : \r\n for cc in c: \r\n s = 0; m = n//i\r\n for j in range(cc, n, m) : \r\n if arr[j] != 1 : break \r\n s += 1\r\n else : \r\n if s == i and i > 2: return 1 \r\n return 0 \r\nn = int(input()); arr = list(map(int, input().split())) \r\ndiv = [i for i in range(2, int(n**0.5)+1) if not n%i]; div += [n//i for i in div if n//i != i] \r\nif 1 not in arr : print('NO')\r\nelif arr.count(1) == n : print('YES')\r\nelse : \r\n c = [i for i in range(n) if arr[i]]\r\n if sol(c) : print('YES')\r\n else : print('NO')", "# @author: leonid_perminov\r\n\r\nimport math, sys\r\n\r\nfrom collections import deque\r\n\r\nstr_in = sys.stdin.readline\r\n\r\n\r\ndef yes():\r\n print('YES')\r\n\r\n\r\ndef no():\r\n print('NO')\r\n\r\n\r\ndef int_in():\r\n return int(input())\r\n\r\n\r\ndef float_in():\r\n return float(input())\r\n\r\n\r\ndef mass_in():\r\n return [int(el) for el in input().split()]\r\n\r\n\r\ndef mass_out(v):\r\n for el in v:\r\n print(el, end=\" \")\r\n\r\n\r\ndef solve():\r\n n = int_in()\r\n a = mass_in()\r\n g = 0\r\n for i in range(3, n + 1):\r\n if (n - i) % i == 0:\r\n for x in range((n - i) // i + 1):\r\n if set(a[x::(n - i) // i + 1]) == {1}:\r\n g = 1\r\n if g:\r\n yes()\r\n else:\r\n no()\r\n\r\n\r\ndef main():\r\n # for T in range((int_in())):\r\n solve()\r\n\r\n\r\nmain()\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\n\r\nfor k in range(1,N+1):\r\n if N%k:continue\r\n if N//k<3:break\r\n \r\n for i in range(k):\r\n ok = True\r\n #print('i',i,k)\r\n for j in range(i,N,k):\r\n #print(j)\r\n if not A[j]:\r\n ok = False\r\n break\r\n if ok:\r\n break\r\n if ok:break\r\n\r\nif ok:\r\n exit(print('YES'))\r\nelse:\r\n exit(print('NO'))\r\n\r\n" ]

[ "#!/usr/bin/env python3\n\nif __name__ == '__main__':\n N = int(input())\n a = list(map(int, input().split()))\n\n res = 0\n used = set()\n for c in sorted(a, reverse=True):\n while c and c in used:\n c -= 1\n if c:\n used.add(c)\n res += c\n print(res)\n", "if __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n line.sort(reverse=True)\r\n for i in range(1, n):\r\n line[i] = max(0, min(line[i - 1] - 1, line[i]))\r\n print(sum(line))\r\n", "n = input()\nv = input().split()\nv = map(int, v)\nv = list(v)\n\noc = {}\ns = 0\nfor i, vi in enumerate(v):\n while(oc.get(vi,0) and vi > 0):\n vi -= 1\n oc[vi] = oc.get(vi, 0) + 1\n s += vi\nprint(s)\n", "\r\nn = int(input())\r\nl_n = list(map(int, input().split()))\r\n\r\nd = {}\r\nt = 0\r\nfor n in l_n:\r\n while n in d and n > 0:\r\n n -= 1\r\n d[n] = \"\"\r\n t += n\r\n\r\nprint(t)", "n = int(input())\r\nd = [int(i) for i in input().split()]\r\nd = sorted(d, reverse=True)\r\nfor i in range(1, len(d)):\r\n d[i] = max(0, min(d[i - 1] - 1, d[i]))\r\nprint(sum(d))", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn = I()\r\na = IL()\r\na = sorted(a, reverse=True)\r\nfor i in range(1, n):\r\n if a[i] >= a[i-1]:\r\n a[i] = max(a[i-1] - 1, 0)\r\n\r\nprint(sum(a))", "n = int(input())\na = list(map(int, input().split()))\na.sort(reverse = True)\nans, cur = 0, a[0]\nfor k in a:\n\tcur = min(cur, k)\n\tans += cur\n\tcur -= 1\n\tif(cur == 0):\n\t break\nprint(ans)\n\t\t \t \t \t\t\t\t\t \t \t \t\t \t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\na = reversed(a)\r\nans = 0;\r\nprev = 1000000001;\r\nfor num in a:\r\n num = max(min(num, prev - 1),0)\r\n prev = num;\r\n ans +=num\r\nprint(ans)", "n = int(input())\r\nc = list(map(int, input().split()))\r\nret = set()\r\nfor x in c:\r\n for y in range(x, -1, -1):\r\n if y not in ret:\r\n ret.add(y)\r\n break\r\nprint(sum(ret))\r\n", "n=int(input())\r\nl=sorted(map(int,input().split()))[::-1]\r\nfor i in range(1,n):\r\n if l[i]>=l[i-1]:\r\n l[i]=l[i-1]-1 #line of the code..\r\n #print(*l)\r\nfor i in range(n):\r\n if l[i]<0:\r\n l[i]=0\r\nprint(sum(l))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nfor i in range(1,n):\r\n l[i]=min(l[i-1]-1,l[i])\r\n if(l[i]<0):\r\n l[i]=0\r\nprint(sum(l))", "input()\nr, v = 0, set()\nfor a in map(int, input().split()):\n for b in range(a, 0, -1):\n if b not in v:\n v.add(b)\n r += b\n break\nprint(r)", "\r\n\r\n\r\nn = int(input())\r\n\r\nt = list(map(int,input().split()))\r\nf=[]\r\nu=0\r\nfor j in t:\r\n if j not in f:\r\n u+=j\r\n f.append(j)\r\n else:\r\n while True:\r\n if j-1 not in f:\r\n a = max(0,j-1)\r\n u+=a\r\n f.append(a)\r\n break\r\n else:\r\n j-=1\r\n \r\n\r\nprint(u)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort(reverse = True)\r\ncheck = set()\r\nans = 0\r\nfor i in l:\r\n x = i\r\n while x in check:\r\n x -= 1\r\n if x < 0:\r\n continue\r\n ans += x\r\n check.add(x)\r\nprint(ans)", "n = int(input())\na = [int(x) for x in input().split()]\n\nocc = set()\na.sort(reverse=True)\nfor i in range(len(a)):\n while a[i] in occ and a[i] > 0:\n a[i] -= 1\n occ.add(a[i])\n\nprint(sum(a))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set()\r\nfor i in range(n):\r\n\twhile a[i] in s:\r\n\t\tif a[i]>0:\r\n\t\t\ta[i]-=1\r\n\t\telse:\r\n\t\t\tbreak\r\n\ts.add(a[i])\r\nans=sum(s)\r\nprint(ans)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nc=l[0]\r\nfor i in range(1,n):\r\n while l[i] in l[:i] and l[i]>0: l[i]-=1\r\n c+=l[i]\r\nprint(c)", "def f():\r\n\tinput()\r\n\ta = list(map(int,input().split(' ')))\r\n\ta.sort()\r\n\tt = 10**9+1\r\n\tr = 0\r\n\tfor i in reversed(a):\r\n\t\tt = i if i < t else t - 1\r\n\t\tif t == 0:\r\n\t\t\tbreak\r\n\t\tr += t\r\n\tprint(r)\r\nf()", "#624B\n\nn = int(input())\narr = list(map(int, input().split(\" \")))\n\nnumbers = sorted(arr)\ncarr = []\ncount = 0\n\nfor i in range(len(numbers)):\n\ta = numbers[i]\n\twhile a > 0:\n\t\tif a in carr:\n\t\t\ta -= 1\n\t\telse:\n\t\t\tcarr.append(a)\n\t\t\tcount += a\n\t\t\ta = 0\n\nprint(count)\n", "from sys import stdin,stdout\r\nn = stdin.readline()\r\n# input the array \r\nais=[int(x) for x in stdin.readline().split()]\r\nres=[]\r\nsu=0\r\nfor item in ais:\r\n cur=item\r\n while cur in res and cur>0:\r\n cur=cur-1\r\n res.append(cur)\r\n su=su+cur\r\nstdout.write(str(su))", "n=int(input())\r\n\r\nl=input().split()\r\nfor i in range(n):\r\n l[i]=int(l[i])\r\nl.sort()\r\ni=n-1\r\ns=0\r\nwhile(i>=0):\r\n if(i==n-1):\r\n temp=l[i]\r\n s+=temp\r\n i-=1\r\n continue\r\n if(temp==0):\r\n break\r\n if(temp<=l[i]):\r\n s+=temp-1\r\n temp-=1\r\n else:\r\n s+=l[i]\r\n temp=l[i]\r\n i-=1\r\n\r\nprint(s)", "n = int(input())\r\n\r\nhehe = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n while hehe.count(hehe[i])>1 and hehe[i]>0:\r\n hehe[i] -= 1\r\n \r\nprint (sum(hehe))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort(reverse=True)\r\nres = 0\r\ncurM = lst[0] + 1\r\nfor x in lst:\r\n if x < curM:\r\n res += x\r\n curM = x\r\n else:\r\n y = curM - 1\r\n if y > 0:\r\n res += y\r\n curM = y\r\n else:\r\n break\r\nprint(res)", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nsu=a[0];m=a[0];k=a[0]\r\nfor i in range(1,n):\r\n if a[i]==k:\r\n if m>0:\r\n while (m) in a:\r\n m-=1\r\n su+=m;a[i]=m\r\n else:\r\n su+=a[i];m=k=a[i]\r\nprint(su)", "n, a, s, v = int(input()), sorted(map(int, input().split()), reverse=True), set(), 0\r\nfor ai in a:\r\n while ai and ai in s:\r\n ai -= 1\r\n s.add(ai)\r\n v += ai\r\nprint(v)", "n = int(input())\na = [int(x) for x in input().split()]\na.sort()\na.reverse()\nS = set()\nfor x in a:\n while x in S and x > 0: x -= 1\n if x: S.add(x)\nprint(sum(S))\n", "#!/usr/bin/python3\n\nn = int(input())\na = list(map(int, input().split()))\n\nused = set()\nreversed(sorted(a))\ni = 0\nwhile i < n:\n if a[i] == 0:\n i += 1\n else:\n if a[i] not in used:\n used.add(a[i])\n i += 1\n else:\n a[i] -= 1\nprint(str(sum(a)))\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\na.sort(reverse=True)\r\np=c=a[0]\r\nfor i in range(1,n):\r\n if a[i]<p:\r\n c+=a[i]\r\n p=a[i]\r\n elif a[i]==p:\r\n if p>1:\r\n c+=p-1\r\n p=p-1\r\n else:\r\n break\r\n else:\r\n if p>1:\r\n c+=p-1\r\n p=p-1\r\n else:\r\n break\r\nprint(c)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr=sorted(arr)\r\narr.reverse()\r\ns=set()\r\nsum=0\r\nflag=0\r\nfor i in range(n):\r\n temp=arr[i]\r\n while temp in s:\r\n temp=temp-1\r\n if temp==0:\r\n flag=1\r\n break\r\n sum+=temp\r\n s.add(temp)\r\n if flag==1:\r\n break\r\nprint(sum)", "n = int(input())\r\n \r\narr = list(map(int, input().split()))\r\n \r\narr.sort(reverse=True)\r\n \r\ncurr = arr[0]\r\ncnt = 0\r\n \r\nfor item in arr:\r\n curr = min(curr, item)\r\n cnt += curr\r\n curr -= 1\r\n curr = max(curr, 0)\r\n \r\n \r\nprint(cnt)\r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nnumbers = sorted(arr)\r\ncarr = []\r\ncount = 0\r\n\r\nfor i in range(len(numbers)):\r\n\ta = numbers[i]\r\n\twhile a > 0:\r\n\t\tif a in carr:\r\n\t\t\ta -= 1\r\n\t\telse:\r\n\t\t\tcarr.append(a)\r\n\t\t\tcount += a\r\n\t\t\ta = 0\r\n\r\nprint(count)\r\n", "n = input()\r\nn = int(n)\r\n\r\n\r\nq = input().split()\r\nm = {}\r\nd = []\r\ns = 0\r\nfor i in range(n):\r\n temp = int(q[i])\r\n if temp not in m:\r\n m[temp] = 1\r\n s += temp\r\n else:\r\n d.append(temp)\r\n\r\nif len(d) > 0:\r\n d.sort()\r\n it = len(d) - 1\r\n while it >= 0:\r\n x = d[it]\r\n while x > 0:\r\n if x not in m:\r\n s += x\r\n m[x] = 1\r\n break\r\n x-=1\r\n it-=1\r\nprint(s)\r\n", "n=int(input())\r\na=[int(i) for i in input().split(' ')]\r\ncnum=set([])\r\nfor i in range(n):\r\n if a[i] not in cnum:\r\n cnum.add(a[i])\r\n else:\r\n for j in range(a[i]-1,-1,-1):\r\n if j not in cnum:\r\n cnum.add(j)\r\n break\r\na=list(cnum)\r\ns=0\r\nfor i in a:\r\n s+=i\r\nprint(s)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\nans = a[0]\r\nlast = a[0]\r\nfor i in range(1,len(a)):\r\n last = min(a[i],last-1)\r\n if last==0:\r\n break\r\n ans+=last\r\n \r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\n\r\ndone = set()\r\n\r\nnb = 0\r\nfor x in a:\r\n while x>0:\r\n if not (x in done):\r\n done.add(x)\r\n nb += x\r\n break\r\n else:\r\n x-=1\r\n\r\nprint(nb)\r\n", "n = int(input())\r\ns=input()\r\ns=s.split()\r\na=[]\r\nfor i in range(n):\r\n a.append(int(s[i]))\r\nsu=0\r\nd={}\r\na.sort(reverse=True)\r\nfor i in range(len(a)):\r\n if a[i] not in d:\r\n su+=a[i]\r\n d[a[i]]=1\r\n else:\r\n t=a[i]-1\r\n while t>=1 and t in d:\r\n t-=1\r\n su+=t\r\n d[t]=1\r\n \r\nprint(su)\r\n \r\n", "import sys\r\nn = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\narr.sort(reverse=True)\r\nfor idx in range(1, n):\r\n if arr[idx - 1] <= arr[idx]:\r\n arr[idx] = arr[idx - 1] - 1\r\n if arr[idx] == 0:\r\n print(sum(arr[:idx]))\r\n sys.exit()\r\n \r\nprint(sum(arr))", "from sys import stdin as fin\n# fin = open(\"wfr2016a.in\", \"r\")\n\nn = int(fin.readline())\nabc = tuple(map(int, input().split()))\ncnt = set()\nresult = 0\nfor sym in abc:\n while sym and sym in cnt:\n sym -= 1\n result += sym\n cnt.add(sym)\n\nprint(result)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse = 1)\r\nfor i in range(1, n):\r\n if l[i] >= l[i-1]:\r\n l[i] = l[i-1]-1\r\n if l[i] < 0: l[i] = 0\r\n \r\nprint(sum(l))\r\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nanswer = 0\r\nfor i in range(n):\r\n if data.count(data[i]) == 1:\r\n answer += data[i]\r\n else:\r\n while data[i] > 0:\r\n if data.count(data[i]) == 1:\r\n answer += data[i]\r\n break\r\n else:\r\n data[i] -= 1\r\nprint(answer)", "n = int(input())\nl = list(map(int, input().rstrip().split()))\nl.sort(reverse=True)\nlast = l[0]\nfor i in range(1, n):\n if l[i] >= last:\n if last > 0:\n l[i] = last - 1\n last -= 1\n else:\n l[i] = 0\n else:\n last = l[i]\nprint(sum(l))", "# print(\"Input n\")\nn = int(input())\n\n# print(\"Input the n values\")\na = [int(x) for x in input().split()]\n\na.sort(reverse = True)\nanswer = a[0]\ncurrent = a[0]\nfor i in range(1, len(a)):\n if a[i] >= current:\n current = current - 1\n if current < 0:\n current = 0\n else:\n current = a[i]\n answer += current\n\nprint(answer)\n", "n = int(input())\r\na = list(sorted(map(int, input().split()), reverse=True))\r\nfor i in range(n - 1):\r\n a[i + 1] = max(0, min(a[i] - 1, a[i + 1]))\r\nprint(sum(a))", "a = int(input())\r\nb = list(map(int, input().split(' ')))\r\nb.sort()\r\nb.reverse()\r\nfor i in range(1, len(b)):\r\n if b[i] >= b[i-1]:\r\n b[i] = b[i-1] - 1\r\n\r\namor = 0\r\nfor i in b:\r\n if i > 0:\r\n amor += i\r\n\r\nprint(amor)\r\n", "n = int(input())\r\na = sorted([int(i) for i in input().split()], reverse = True)\r\nfor i in range(1, n): \r\n if a[i] >= a[i-1]: \r\n a[i] = max(0, a[i-1]-1)\r\nprint(sum(a))", "import sys\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort(reverse=True)\r\narr2=[]\r\nfor i in range(0,n):\r\n item=arr[i]\r\n if item not in arr2:\r\n arr2.append(item)\r\n else:\r\n while item in arr2:\r\n if(item > 0):\r\n item -= 1\r\n else:\r\n break\r\n arr2.append(item)\r\nprint (sum(arr2))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\n\r\nmi = a[0]\r\nfor i in range(1, n):\r\n if mi == 0:\r\n a[i] = 0\r\n elif a[i] >= mi:\r\n a[i] = mi - 1\r\n mi = a[i]\r\n\r\nprint(sum(a))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort(reverse = True)\r\nsum = a[0]\r\nfor i in range (1,n):\r\n\twhile a[i] in a[:i]:\r\n\t\tif(a[i]!=0):\r\n\t\t\ta[i] = a[i] - 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tsum += a[i]\r\nprint (sum)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nwhile True:\r\n l.sort()\r\n for i in range(len(l) - 1):\r\n if l[i] == l[i + 1]:\r\n l[i] -= 1\r\n break\r\n else:\r\n break\r\nprint(sum([x for x in l if x > 0]))\r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort(key=None, reverse=True)\r\nres = a[0];\r\nfor i in range(1,n):\r\n while a[i] >= a[i - 1]:\r\n a[i] -= 1\r\n if a[i] > 0:\r\n res += a[i]\r\nprint(res)", "import os\r\nimport sys\r\nimport random\r\nli=[]\r\nn=int(input())\r\nli=list(map(int,input().split()))\r\n#split those numbers with space( becomes ['2','3','6','6','5']) and then map every element into int (becomes [2,3,6,6,5])\r\nans=[]\r\nfor i in li:\r\n while i in ans and i>0:\r\n i-=1\r\n ans.append(i)\r\nprint(sum(ans))", "n = int(input())\r\nm = list(map(int, input().split()))\r\nm.sort(reverse = True)\r\nans = m[0]\r\nlast = m[0]\r\nfor i in range(1, len(m)):\r\n last = max(min(last - 1, m[i]), 0)\r\n ans += last \r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nc=0\r\nx=max(a)\r\nfor i in range(n):\r\n\tif(x<0):\r\n\t\tbreak\r\n\tc=c+min(x,a[i])\r\n\tx=min(x,a[i])-1\r\nprint(c)", "import sys\r\n\r\nn = int(input())\r\nar = list(map(int, input().split()))\r\nar.sort(reverse = True)\r\nans, x = ar[0], ar[0]\r\nfor i in range(1, n):\r\n\tif(x <= ar[i]):\r\n\t\tx -= 1\r\n\telse:\r\n\t\tx = ar[i]\r\n\tif x <= 0:\r\n\t\tbreak\r\n\tans += x\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nll=[]\r\nfor i in l:\r\n while(i>0 and i in ll):\r\n i-=1\r\n ll.append(i)\r\nprint(sum(ll))\r\n", "nums=input().split()\r\n\r\nn=int(nums[0])\r\n\r\nb = list(map(int, input().split()))\r\nb.sort()\r\ns=0;\r\ns=s+b[n-1];\r\ni=n-2;\r\nwhile(i>-1):\r\n j=i+1;\r\n if(b[i]<b[j]):\r\n s=s+b[i];\r\n else:\r\n b[i]=b[j]-1;\r\n s=s+b[i];\r\n if(b[i]==0):\r\n i=-1;\r\n \r\n \r\n i=i-1;\r\n \r\nprint(s);\r\n\r\n \r\n", "n = int(input())\narr = list(map(int, input().split()))\narr.sort()\narr = arr[::-1]\nans = [arr[0]]\nfor i in range(1, n):\n\tif(arr[i] < ans[-1]):\n\t\tans.append(arr[i])\n\telse:\n\t\tans.append(max(0, ans[-1] - 1))\nprint(sum(ans))", "n=int(input())\r\nl=sorted([int(i) for i in input().split()],reverse=True)\r\nl1=[0]*n\r\nl1[0]=l[0]\r\ns=l[0]\r\nfor i in range(1,n):\r\n k=min(l[i],l1[i-1]-1)\r\n s+=k\r\n l1[i]=k\r\n if(k==0):\r\n break\r\nprint(s)", "n = int(input())\r\nrng = [int(t) for t in input().split()]\r\n\r\nans = 0\r\nwhile len(rng) != 0:\r\n mx = max(rng)\r\n\r\n if mx <= 0:\r\n break\r\n\r\n ans += mx\r\n\r\n rng.remove(mx)\r\n for i in range(len(rng)):\r\n if rng[i] == mx:\r\n rng[i] -= 1\r\n\r\nprint(ans)", "n = input()\na_in = list(map(int, input().split()))\na = list(reversed(sorted(a_in)))\nprev = 1000000001\nans = 0\nfor c in a:\n if c >= prev:\n c = prev - 1\n if c <= 0:\n break\n ans += c\n prev = c\nprint(ans)\n", "def main():\n\tn = int(input())\n\ta = list(map(int, input().split()))\n\ta.sort()\n\ta.reverse()\n\td = []\n\tfor i in range(n):\n\t\twhile (a[i] > -1):\n\t\t\tif a[i] not in d :\n\t\t\t\td.append(a[i])\n\t\t\t\tbreak\n\t\t\ta[i] -= 1\n\tprint(sum(d))\n\n\t\t\n\n\nif __name__ == '__main__':\n\tmain()", "def calc():\r\n n = int(input())\r\n tab = [int(i) for i in input().split()]\r\n ans = 0\r\n while not max(tab) == 0:\r\n curMax = max(tab)\r\n ans += curMax\r\n tab[tab.index(curMax)] = 0\r\n for i in range(0, n):\r\n if tab[i] == curMax:\r\n tab[i] -= 1;\r\n print(ans)\r\n \r\n\r\ncalc()\r\n", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\na=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nk=l[a-1]+1\r\nl.reverse()\r\nsum=0\r\nfor i in l:\r\n k-=1\r\n if(i>k):\r\n i=k\r\n sum+=max(i,0)\r\n k=i\r\nprint(sum)\r\n", "n =int(input())\r\nar = list(map(int,input().split()))\r\nar.sort(reverse = True)\r\na = set()\r\ns = ar[0]\r\nfor i in range(1,n):\r\n ar[i] = min(ar[i-1]-1,ar[i])\r\n if ar[i]<0:\r\n ar[i] = 0\r\nprint(sum(ar))", "n = int(input())\r\na = [int(s) for s in input().split()]\r\n\r\na.sort()\r\nb = 10**9 + 1\r\nsum = 0\r\nfor i in range(n-1, -1, -1):\r\n if min(a[i], b - 1) < 1:\r\n break\r\n sum += min(a[i], b - 1)\r\n b = min(a[i], b - 1)\r\n\r\nprint(sum)\r\n", "def adjust(x,limit):\r\n if x == 0:\r\n return 0\r\n\r\n if x <= limit:\r\n return x-1\r\n\r\n return limit\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a.sort(key=lambda x:-x)\r\n #print(a)\r\n\r\n for i in range(1,n):\r\n a[i] = adjust(a[i-1],a[i])\r\n\r\n print( sum(a) )", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n\twhile a.count(a[i])>1:\r\n\t\tif a[i]==0:\r\n\t\t\tbreak\r\n\t\ta[i]-=1\r\nprint(sum(a))", "n = int(input())\r\nA = list(map(int, input().split()))\r\nans = []\r\nfor i in range(n):\r\n if A[i] in ans:\r\n for j in range(A[i] - 1, 0, -1):\r\n if j not in ans:\r\n ans.append(j)\r\n break\r\n else:\r\n ans.append(A[i])\r\nprint(sum(ans)) \r\n", "n = int(input())\nl = list(map(int,input().split()))\nl.sort(reverse = True)\np = []\ni = 0\nwhile(i < n):\n k = l[i]\n m = 1\n while(m == 1):\n if(k == 0):\n m = 0\n\n elif(k in p) == True:\n k = k-1\n\n elif(k in p) == False:\n p.append(k)\n m = 0\n\n i = i+1\n\nj = sum(p)\nprint(j)\n", "# tested by Hightail - https://github.com/dj3500/hightail\r\nfrom sys import stdin, stdout\r\nimport math\r\n\r\n#Start of Program\r\ndef calculate(N,AI):\r\n mxlen = sum(AI)\r\n \r\n AX = list()\r\n \r\n for val in AI:\r\n \r\n val = int(val)\r\n \r\n if not val in AX:\r\n AX.append(val) \r\n continue\r\n \r\n while True:\r\n val = val - 1\r\n if val <= 0:\r\n break\r\n if not val in AX:\r\n AX.append(val)\r\n break\r\n \r\n milen = sum(AX)\r\n \r\n return min(milen,mxlen)\r\n \r\n#Print Output Result\r\n\r\nn = stdin.readline().rstrip()\r\nai = list([int(x) for x in stdin.readline().rstrip().split()]) \r\n\r\nans = calculate(n,ai)\r\n \r\nstdout.write( str(ans) + \"\\n\" )", "n = int(input())\r\nA = sorted(map(int, input().split()), reverse=True)\r\n\r\nfor i in range(1, n):\r\n if A[i-1] <= A[i]:\r\n A[i] = max(0, A[i-1]-1)\r\n\r\nprint(sum(A))", "n = int(input())\na = map(int, input().split(' '))\ninf = 1000000001\n\ndef f(s, m):\n if s == [] or m == 0:\n return 0\n c = min(s[0], m)\n return c + f(s[1:], c - 1)\n\nprint(f(sorted(a, reverse=True), inf))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nfor i in range(n - 2, -1, -1):\r\n a[i] = max(min(a[i], a[i + 1] - 1), 0)\r\nprint(sum(a))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nc=l[0]\r\nSum=0\r\nfor i in range(n):\r\n c=max(0,min(c,l[i]))\r\n Sum+=c\r\n c-=1\r\nprint(Sum)", "n = int(input())\nl = list(map(int, input().split()))\nl = sorted(l)[-1::-1]\n\n\nfor i in range(1, n):\n\tif l[i] >= l[i-1]:\n\t\tl[i] = l[i-1] - 1\n\tif l[i] < 0:\n\t\tl[i] = 0\nprint(sum(l)) \n\n", "from string import*\r\nn = int(input())\r\n#n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\ns = list(ascii_lowercase)[:n]\r\nres = ''\r\nans = 0\r\ncnt = 0\r\na.sort()\r\nwhile 1:\r\n ans = 0\r\n for i in range(n):\r\n x = a.count(a[i])\r\n if x>1:\r\n a[i]-=min((x-1),a[i])\r\n for i in range(n):\r\n ans+=a[i]\r\n if cnt==ans:\r\n break\r\n cnt = ans\r\nprint(ans)", "N = int(input())\r\nletters = list(map(int, input().split()))\r\nletters.sort()\r\nlennow = 0\r\nfor i in range(len(letters) - 2, -1, -1):\r\n letters[i] = max(0, min(letters[i + 1] - 1, letters[i]))\r\nprint(sum(letters))", "n = int(input())\r\ndata = list(map(int, input().split()))\r\ndata.sort()\r\nhigh = data[-1]\r\nret = 0\r\nfor i in range(n-1, -1, -1):\r\n\tchosen = min(data[i], high)\r\n\tret += max(chosen, 0)\r\n\thigh = chosen-1\r\nprint(ret)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsorted(a)\r\n\r\ns = 0\r\nfor i in range(n):\r\n h = a[i]\r\n k = True\r\n for j in range(i):\r\n if h == a[j] and k:\r\n k = False\r\n if k:\r\n s += h\r\n else:\r\n j = i - 1\r\n while j >= 0 and h > 0:\r\n if h == a[j]:\r\n h -= 1\r\n j = i\r\n j -= 1\r\n if h >= 0:\r\n s += h\r\n a[i] = h\r\nprint(s)\r\n", "n = int(input())\na = sorted([(int(x), i) for i,x in enumerate(input().split())], key=lambda x: x[0])\nused = set()\nu = [0 for i in range(n)]\n\nfor l in a:\n c, i = l\n while c in used and c > 0: c = c-1\n if c > 0:\n used.add(c)\n u[i] = c\nprint(sum(u))\n", "n = int(input())\r\narr = [int(x) for x in input().split(' ')]\r\narr = sorted(arr, reverse=True)\r\ncurr_max = arr[0]\r\nans =arr[0]\r\nfor i in range(1, n):\r\n arr[i] = min(curr_max-1, arr[i])\r\n if arr[i] <= 0:\r\n break\r\n ans += arr[i]\r\n curr_max = arr[i]\r\nprint(ans)\r\n", "input()\r\nd={}\r\ns=0\r\nfor i in map(int,input().split()):\r\n while i in d and i:i-=1\r\n d[i]=1\r\n s+=i\r\nprint(s)", "n = input()\na = [int(each) for each in input().split()]\na.sort(reverse=True)\nlen0 = len(a)\nres = a[0]\nfor i in range(1, len0):\n if a[i] > a[i - 1] - 1:\n a[i] = a[i - 1] - 1\n if a[i] == 0:\n break\n res += a[i]\nprint(res)\n\n\n\t\t\t \t\t\t \t \t \t \t\t\t\t \t\t \t\t\t\t \t", "n = int(input())\r\n\r\nf = list(map(int, input().split()))\r\n\r\nf.sort(reverse = True)\r\n\r\n#print(f)\r\n\r\nd = set()\r\n\r\nn = 0\r\n\r\nfor i in range(len(f)):\r\n if f[i] not in d:\r\n n += f[i]\r\n d.add(f[i])\r\n else:\r\n while f[i] != 0 and f[i] in d:\r\n f[i] -= 1\r\n d.add(f[i])\r\n n += f[i]\r\n #print(n, d)\r\n\r\nprint(n)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort(reverse=True)\r\nans=arr[0]\r\npre=arr[0]\r\nfor i in range(1,len(arr)):\r\n\twhile arr[i]!=0 and arr[i]>=arr[i-1]:\r\n\t\tarr[i]-=1\r\n\tans+=arr[i]\r\nprint(ans)", "n=eval(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nl=sorted(l)\r\nwhile(i<n-1):\r\n if(l[i]==l[i+1]):\r\n l[i+1]-=1\r\n i=0\r\n l=sorted(l)\r\n else:\r\n i+=1\r\nsum=0\r\ni=0\r\nwhile(i<n):\r\n if(l[i]>0):\r\n sum+=l[i]\r\n i+=1\r\nprint(sum) \r\n", "n=int(input())\nL=[int(x) for x in input().split()]\nL.sort()\nL=L[::-1]\nans=0\ndis=L[0]+1\nfor i in L:\n ans+=max(0,min(dis,i))\n dis=min(dis,i)-1\nprint(ans)\n", "n = int(input())\r\ntab = [int(i) for i in input().split()]\r\nans = 0\r\nwhile not max(tab) == 0:\r\n curMax = max(tab)\r\n ans += curMax\r\n tab[tab.index(curMax)] = 0\r\n for i in range(0, n):\r\n if tab[i] == curMax:\r\n tab[i] -= 1;\r\nprint(ans)", "import sys\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort(reverse=True)\r\nsum = arr[0]\r\nfor i in range(1,n):\r\n if arr[i] >= arr[i-1] :\r\n arr[i] = 0 if arr[i-1] - 1 < 0 else arr[i-1] - 1\r\n sum += arr[i];\r\nprint (sum)", "num = int(input())\r\narr = sorted(map(int, input().split()), reverse=True)\r\n\r\nans = 0\r\n\r\nseen = set()\r\n\r\nfor num in arr:\r\n if num in seen:\r\n while num in seen and num > 0:\r\n num -= 1\r\n ans += num\r\n seen.add(num)\r\n else:\r\n ans += num\r\n seen.add(num)\r\n\r\nprint(ans)\r\n", "n = input();sum=0\r\nli = sorted(map(int,input().split()))[::-1]\r\na=max(li)\r\nfor i in li:\r\n\tif a<0:break\r\n\tsum+=min(a,i)\r\n\ta=min(a,i)-1\r\nprint(sum)", "def f():\r\n global data\r\n for i in range(len(data)):\r\n for j in range(len(data)):\r\n if data[i] == data[j] and i != j:\r\n data[i] -= 1\r\n return True\r\n return False\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\nhelp = 0\r\ndata.sort()\r\nanswer = 0\r\nwhile f():\r\n answer = 0\r\nfor i in range(n):\r\n if data[i] > 0:\r\n answer += data[i]\r\nprint(answer)", "n = int(input())\r\ns = set()\r\nfor i in map(int, input().split()):\r\n while i in s and i > 0:\r\n i -= 1\r\n s.add(i)\r\nprint(sum(s))\r\n", "N = int(input())\r\nSize = 0\r\n \r\nX = sorted(list(map(int, input().split())), reverse=True)\r\nMin = X[0]\r\nfor i in X:\r\n Size += min(i, Min)\r\n Min = min(Min, i) - 1\r\n if Min==0:\r\n break\r\nprint(Size)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort(reverse = True)\r\nres = 0\r\ncur = 1001001001\r\nfor x in a:\r\n\tif cur > x:\t\r\n\t\tres += x\r\n\t\tcur = x\r\n\telse:\r\n\t\tcur = max(cur-1, 0)\r\n\t\tres += cur\r\nprint(res)\r\n\r\n\r\n\r\n", "def main():\n input()\n res, visited = 0, set()\n for a in map(int, input().split()):\n for a in range(a, 0, -1):\n if a not in visited:\n visited.add(a)\n res += a\n break\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "R = lambda : map(int, input().split())\nn = int(input())\na = sorted(list(R()), reverse=True)\n\ns = set()\nt = 0\nl = 10**19\nfor ai in a:\n if ai < l:\n t += ai; l = ai\n elif l == 1:\n break\n else:\n t += l-1; l -= 1\n\nprint(t)\n \n\n", "n=int(input())\r\n\r\nmas=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n while mas.count(mas[i])>1 and mas[i]>0:\r\n mas[i]-=1\r\nprint(sum(mas))", "\r\nn=int(input())\r\n#print(n)\r\nmas=input().split()\r\nmas=[int(x) for x in mas]\r\nmas.sort()\r\np=mas[-1]\r\nk=p\r\nfor i in range(2,n+1):\r\n if k<1:\r\n break\r\n if mas[-i]>= k:\r\n k-=1\r\n p+=k\r\n else:\r\n p+=mas[-i]\r\n k=mas[-i]\r\n\r\nprint(p)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nd = {}\r\nlst.sort(reverse = True)\r\nd[lst[0]] = True\r\ns = lst[0]\r\nfor i in range(1, n):\r\n k = lst[i]\r\n if lst[i] in d and d[lst[i]]:\r\n \r\n while k > 0 and k in d:\r\n k -= 1\r\n d[k] = True\r\n s += k\r\n \r\nprint(s)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()), reverse=True)\r\nfor i in range(1, n):\r\n if w[i] >= w[i-1]:\r\n w[i] = max(0, w[i-1] - 1)\r\nprint(sum(w))", "# -*- coding: utf-8 -*-\r\n# @Time : 2019/6/5 13:21\r\n# @Author : yuggu\r\n# @Site :\r\n# @File : test.py\r\n# @Software: PyCharm\\\r\n\r\n\r\nn = int(input())\r\n\r\nmas = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n while mas.count(mas[i]) > 1 and mas[i] > 0:\r\n mas[i] -= 1\r\nprint(sum(mas))", "clist={}\r\nn = int(input())\r\nalist = map(int,input().split())\r\nfor a in alist:\r\n while a>0 and a in clist.keys():\r\n a-=1\r\n clist[a]=a\r\nsum=0\r\nfor i in clist.keys():\r\n sum+=i\r\nprint(sum) \r\n\r\n ", "#!/usr/bin/python3\n\ndef main():\n\tn = int(input())\n\tnums = [int(i) for i in input().split()]\n\n\t# print(sol1(nums))\n\tprint(sol2(nums))\n\t\ndef test():\n\tN = 10000\n\n\timport random\n\n\tfor i in range(N):\n\t\tnums = []\n\t\tn = 24\n\t\tfor j in range(n):\n\t\t\tnums.append(random.randrange(1, 1E9))\n\n\t\tans2 = sol2(nums)\n\n\tprint('Completed')\n\ndef sol1(_nums):\n\tnums = reversed(sorted(_nums))\n\n\ttop = None\n\ts = 0\n\tfor num in nums:\n\t\t# print('Processing', num)\n\t\t# print('Sum before:', s)\n\t\t# print('Top before:', top)\n\n\t\tif top == 0:\n\t\t\tbreak\n\n\t\tif top is None:\n\t\t\ttop = num\n\t\t\ts += num\n\t\t\tcontinue\n\n\t\tif num == top:\n\t\t\ts += num - 1\n\t\t\ttop -= 1\n\t\telif num < top:\n\t\t\ts += num\n\t\t\ttop = num\n\n\treturn s\n\ndef sol2(nums):\n\ts = 0\n\tused = []\n\tfor num in nums:\n\t\tn = num\n\t\twhile n in used and n > 0:\n\t\t\tn -= 1\n\t\tused.append(n)\n\t\ts += n\n\n\treturn s\n\nif __name__ == '__main__':\n\tmain()", "N = int(input())\nans = 0\nused = set()\nfor c in sorted([int(x) for x in input().split()], reverse=True):\n while c > 0 and c in used:\n c -= 1\n ans += c\n used.add(c)\nprint(ans)\n", "n=int(input())\r\ni=0 \r\na=[int(i) for i in input().split()]\r\nseen={} \r\na.sort() \r\nfor i in range(0,n-1):\r\n if a[i]==a[i-1]:\r\n a[i]-=1 \r\n while a[i]!=0 and a[i] in seen:\r\n a[i]-=1 \r\n seen[a[i]]=1 \r\ni=n-1 \r\nwhile a[i]!=0 and a[i] in seen:\r\n a[i]-=1 \r\nseen[a[i]]=1 \r\n#print(a)\r\nprint(sum(a))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def make_s(lst):\r\n while True:\r\n lst.sort()\r\n for i in range(len(lst) - 1):\r\n if lst[i] == lst[i + 1]:\r\n lst[i] -= 1\r\n break\r\n else:\r\n break\r\n return sum([x for x in lst if x > 0])\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(make_s(a))", "input()\r\ncounts = [int(i) for i in input().split()]\r\ncounts.sort()\r\nlength = 0\r\nadded = set()\r\nfor count in counts[-1::-1]:\r\n while count in added:\r\n count -=1\r\n if count > 0:\r\n length += count\r\n added.add(count)\r\nprint(length)", "def maximum_possible_string_length(a):\r\n a.sort()\r\n a = a[::-1]\r\n \r\n pre_max = a[0]\r\n res = a[0]\r\n \r\n for i in range(1, len(a)):\r\n if pre_max == 0:\r\n break\r\n res += min(a[i], pre_max - 1)\r\n pre_max = min(a[i], pre_max - 1)\r\n \r\n return res\r\n \r\n \r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n print(maximum_possible_string_length(a))\r\n" ]

[ "import sys, functools, bisect, collections, string, math\r\nfrom math import gcd\r\ninput = sys.stdin.readline\r\n\r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\n\r\nINF = 10**18\r\nMOD = 10**9+7\r\nN = 1502\r\n\r\n\r\n\r\ndp = [[0]*N for _ in range(26)]\r\n \r\n \r\n\r\ntest_case = 1\r\nfor _ in range(test_case):\r\n n = ri()\r\n s = rs()\r\n q = ri()\r\n for chr in range(26):\r\n for i in range(n):\r\n cnt = 0\r\n for j in range(i,n):\r\n cnt += int(ord(s[j]) - ord('a') != chr)\r\n dp[chr][cnt] = max(dp[chr][cnt], j - i + 1)\r\n \r\n for k in range(1,N):\r\n dp[chr][k] = max(dp[chr][k], dp[chr][k-1])\r\n \r\n for _ in range(q):\r\n x, c = input().split()\r\n x = int(x)\r\n print(dp[ord(c) - ord('a')][x])\r\n\r\n ", "n = int(input())\r\ns = input()\r\ndp = [[-1]*(n+1) for x in range(26)]\r\n\r\nfor c in range(26):\r\n for l in range(n):\r\n n_c = 0 \r\n for r in range(l, n):\r\n if s[r] == chr(ord('a') + c):\r\n n_c += 1\r\n dp[c][r-l+1-n_c] = max(dp[c][r-l+1-n_c], r-l+1)\r\n\r\nall_res = []\r\nfor i in range(int(input())):\r\n m, c = input().split()\r\n m = int(m)\r\n idx = ord(c) - ord('a')\r\n all_res.append(dp[idx][m] if dp[idx][m] != -1 else n)\r\n\r\nprint('\\n'.join(map(str, all_res)))\r\n", "import sys\r\nfrom math import log2,floor,ceil,sqrt\r\n# import bisect\r\n# from collections import deque\r\n\r\nRi = lambda : [int(x) for x in sys.stdin.readline().split()]\r\nri = lambda : sys.stdin.readline().strip()\r\n \r\ndef input(): return sys.stdin.readline().strip()\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\r\ndef ceil(x, y=1): return int(-(-x // y))\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\r\ndef Yes(): print('Yes')\r\ndef No(): print('No')\r\ndef YES(): print('YES')\r\ndef NO(): print('NO')\r\nINF = 10 ** 18\r\nMOD = 10**9+7\r\n\r\nn = int(ri())\r\nst = ri()\r\nst = [ord(st[i])-ord('a') for i in range(len(st))]\r\n\r\ndp = list2d(26,n+1,0)\r\nfor i in range(0,26):\r\n for j in range(n):\r\n cnt= 0\r\n for k in range(j,n):\r\n if st[k] != i:\r\n cnt+=1\r\n dp[i][cnt] = max(k-j+1,dp[i][cnt])\r\n\r\nfor i in range(26):\r\n for j in range(1,n+1):\r\n dp[i][j] = max(dp[i][j-1],dp[i][j])\r\n\r\n# print(dp)\r\n\r\nqq = int(ri())\r\nfor i in range(qq):\r\n temp= ri().split()\r\n ch = ord(temp[1])-ord('a')\r\n # print(dp[ch])\r\n m = int(temp[0])\r\n if m > n:\r\n m = n\r\n # print(ch,m)\r\n print(dp[ch][m])\r\n", "import sys\r\nn=int(input())\r\ns=input()\r\npfs=[[0 for _ in range(n+1)]for _ in range(26)]\r\nfor i in range(n):\r\n ch=ord(s[i])-ord('a')\r\n for j in range(26):\r\n if j==ch:pfs[j][i+1]=pfs[j][i]+1\r\n else:pfs[j][i+1]=pfs[j][i]\r\n#print(pfs)\r\ndp=[[0 for _ in range(n+1)]for _ in range(26)]\r\nfor c in range(26):\r\n for l in range(n+1):\r\n for r in range(l,n+1):\r\n tc=r-l-(pfs[c][r]-pfs[c][l])\r\n dp[c][tc]=max(dp[c][tc],r-l)\r\n for i in range(1,n+1):\r\n dp[c][i]=max(dp[c][i],dp[c][i-1])\r\n\r\n#print(dp)\r\nA=[]\r\nfor q in range(int(input())):\r\n m,c=sys.stdin.readline().split()\r\n m=int(m)\r\n c=ord(c)-ord('a')\r\n ans=dp[c][m]\r\n print(ans)\r\n", "import string\r\nimport bisect\r\nimport sys\r\n \r\ndef main():\r\n lines = sys.stdin.readlines()\r\n n = int(lines[0])\r\n s = lines[1]\r\n \r\n vals = {}\r\n for c in string.ascii_lowercase:\r\n a = [i for i, ch in enumerate(s) if ch == c]\r\n m = len(a)\r\n b = [0]\r\n for length in range(1, m + 1):\r\n best = n\r\n for i in range(m - length + 1):\r\n j = i + length - 1\r\n best = min(best, (a[j] - j) - (a[i] - i))\r\n b.append(best)\r\n vals[c] = b\r\n q = int(lines[2])\r\n r = []\r\n idx = 3\r\n while q > 0:\r\n q -= 1\r\n query = lines[idx].split()\r\n idx += 1\r\n m = int(query[0])\r\n c = query[1]\r\n i = bisect.bisect_right(vals[c], m)\r\n r.append(str(min(n, i + m - 1)))\r\n print('\\n'.join(r))\r\n \r\nmain()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()\r\nq = int(input())\r\nd = [[0]*26 for _ in range(0,1507)]\r\nfor i in range(1,n+1):\r\n for j in range(0,26):\r\n l = cnt = ans = 0\r\n for k in range(0,n):\r\n cnt += ((ord(s[k]) - ord('a'))!=j)\r\n while(cnt > i):\r\n cnt -= ((ord(s[l]) - ord('a'))!=j)\r\n l += 1\r\n ans = max(ans,k-l+1)\r\n d[i][j] = ans\r\n\r\nfor i in range(0,q):\r\n m,c = input().split()\r\n m = int(m)\r\n print(d[m][ord(c)-ord('a')])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nS = input()\r\n\r\nlib = [defaultdict(int) for _ in range(26)]\r\nfor c in range(26):\r\n i = c\r\n c = chr(c+ord('a'))\r\n for k in range(1,N+1):\r\n t = k-S[:k].count(c)\r\n lib[i][t] = max(lib[i][t], k)\r\n \r\n for j in range(k,N):\r\n if S[j-k]==c:\r\n t+=1\r\n if S[j]==c:\r\n t-=1\r\n lib[i][t] = max(lib[i][t], k)\r\n\r\n#print(lib[ord('o')-ord('a')])\r\nfor _ in range(int(input())):\r\n m,c = input().split()\r\n m=int(m)\r\n \r\n if m in lib[ord(c)-ord('a')]:\r\n print(lib[ord(c)-ord('a')][m])\r\n else:\r\n print(N)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nN = int(input())\r\nS = list(map(lambda x: ord(x) - ord(\"a\"), list(input())[: -1]))\r\nres = [[0] * (N + 1) for _ in range(26)]\r\nfor c in range(26):\r\n for l in range(N):\r\n x = 0\r\n for r in range(l + 1, N + 1):\r\n x += S[r - 1] != c\r\n res[c][x] = max(res[c][x], r - l)\r\n for i in range(N): res[c][i + 1] = max(res[c][i + 1], res[c][i])\r\nfor _ in range(int(input())):\r\n x, s = input().split()\r\n x = int(x)\r\n s = ord(s) - ord(\"a\")\r\n print(res[s][x])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nans = [[-1]*(n+1) for _ in range(26)]\r\n\r\nfor c in range(26):\r\n for i in range(n):\r\n cnt = 0\r\n \r\n for j in range(i, n):\r\n if ord(s[j])-ord('a')!=c:\r\n cnt += 1\r\n \r\n ans[c][cnt] = max(ans[c][cnt], j-i+1)\r\n \r\nfor c in range(26):\r\n for i in range(1, n+1):\r\n ans[c][i] = max(ans[c][i], ans[c][i-1])\r\n\r\nfor _ in range(int(input())):\r\n m, c = input().split()\r\n print(ans[ord(c)-ord('a')][int(m)])", "import sys\ninput = sys.stdin.readline # fast cin\n\nn = int(input())\ns = input().strip()\nq = int(input())\n\ndp = {}\nfor ch in map(chr, range(ord(\"a\"), ord(\"z\") + 1)):\n # not strictly necessary but a free optimization to skip a lot of work\n if ch not in s:\n continue\n best = [0]*(n + 1)\n table = [[0]*(n + 1) for _ in range(n + 1)]\n for i in range(n - 1, -1, -1):\n skip = int(s[i] != ch)\n for m in range(skip, n + 1):\n table[i][m] = 1 + table[i + 1][m - skip]\n # we only check +m from each starting point because of overlap\n best[m] = max(best[m], table[i][m])\n dp[ch] = best\n\nfor _ in range(q):\n m, c = input().split()\n m = int(m)\n print(dp[c][m] if c in dp else m)\n\n", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\nn, s = int(input()), input()\r\nmem, coun = [[0] * (n + 1) for _ in range(26)], [0] * 26\r\nfor i in s:\r\n coun[ord(i) - 97] += 1\r\n\r\nfor ch in range(26):\r\n for i in range(n):\r\n cur = 0\r\n for j in range(i, n):\r\n if s[j] != chr(97 + ch):\r\n cur += 1\r\n mem[ch][cur] = max(mem[ch][cur], j - i + 1)\r\n\r\nfor i in range(int(input())):\r\n x, ch = input().split()\r\n ch = ord(ch) - 97\r\n x = min(int(x), n - coun[ch])\r\n print(mem[ch][x])\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * (n + 1) + v\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nl = 26 * (n + 1)\r\nx = [i % (n + 1) for i in range(l)]\r\nfor i in range(n):\r\n cnt = [0] * 26\r\n for j in range(i, n):\r\n cnt[s[j] - 97] += 1\r\n for k in range(26):\r\n u = f(k, j - i + 1)\r\n x[u] = min(x[u], j - i - cnt[k] + 1)\r\nfor i in range(l):\r\n if i % (n + 1):\r\n x[i] = max(x[i], x[i - 1])\r\ny = [0] * l\r\nfor i in range(26):\r\n for j in range(n + 1):\r\n u = f(i, x[f(i, j)])\r\n y[u] = max(y[u], j)\r\nfor i in range(l):\r\n if i % (n + 1):\r\n y[i] = max(y[i], y[i - 1])\r\nq = int(input())\r\nans = []\r\nfor _ in range(q):\r\n m, c = input().rstrip().decode().split()\r\n ans0 = y[f(ord(c) - 97, int(m))]\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "import sys\r\nii = lambda: sys.stdin.readline().strip()\r\nidata = lambda: [int(x) for x in ii().split()]\r\n\r\n# Ввод данных\r\nn = int(ii())\r\ns = ii()\r\n\r\n# Будем считать, что \"сет\" - подотрезок, состоящий из одинаковых букв\r\n# Далее создание словаря и внесение в него данных:\r\nslov = {}\r\n# В данном словаре на каждую букву есть два списка, в первом находятся\r\n# числа, которые сообщают нам размеры \"сетов\", а второй\r\n# список - расстояния между \"сетами\" (первый и\r\n# последний элементы этого списка - расстояние между началом всей строки и первым\r\n# \"сетом\" и расстояние между концом всей строки и последним \"сетом\")\r\nfor i in range(97, 97 + 26):\r\n slov[chr(i)] = [[], [1]]\r\nslov[s[0]] = [[1], [0, 0]] # Первый элемент обозначим вне цикла, чтобы позже не маяться с неточностями\r\n\r\nfor j in range(1, n):\r\n if slov[s[j]][1][-1] == 0: # То есть, если нет расстояния между данной буквой и предыдущим \"сетом\"\r\n slov[s[j]][0][-1] += 1\r\n else: # Добавление нового \"сета\"\r\n slov[s[j]][0] += [1]\r\n slov[s[j]][1] += [0]\r\n\r\n # Следующий for - увеличение расстояний между \"сетами\" для всех остальных букв\r\n for i in range(97, 97 + 26):\r\n if chr(i) != s[j]:\r\n slov[chr(i)][1][-1] += 1\r\n\r\n# Пошла жара. Здесь обработка планов Надеко\r\nfor t in range(int(ii())):\r\n m, c = ii().split()\r\n m = int(m)\r\n a, b = slov[c]\r\n if sum(b) <= m:\r\n print(n)\r\n else:\r\n if not bool(a): # Если нет \"сетов\" с данной буквой\r\n print(m)\r\n elif len(a) == 1: # Если такой \"сет\" всего один\r\n print(a[0] + m)\r\n else:\r\n l, r = 0, 0\r\n ans = 0 # Максимальный ответ\r\n summ_a, summ_b = 0, 0\r\n used = 0 # Количество букв, которые мы заменили\r\n b1 = b[::]\r\n b1[0], b1[-1] = 0, 0\r\n count = 0 # Количество \"сетов\", которые мы используем на данный момент\r\n while r != len(a):\r\n if summ_b + b1[r] <= m:\r\n summ_b += b1[r]\r\n summ_a += a[r]\r\n r += 1\r\n ans = max(ans, m + summ_a)\r\n else:\r\n summ_a -= a[l]\r\n l += 1\r\n summ_b -= b1[l]\r\n print(ans)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nd = [[1]*n for i in range(26)]\r\nf = [[n]*n for i in range(26)]\r\nfor i, j in enumerate(s):\r\n d[ord(j)-97][i] = 0\r\nfor x in range(26):\r\n w = d[x]\r\n b = 0\r\n for i in range(n):\r\n b += w[i]\r\n a = b\r\n f[x][i] = min(f[x][i], a)\r\n for j in range(n-i-1):\r\n a -= w[j]\r\n a += w[j+i+1]\r\n f[x][i] = min(f[x][i], a)\r\nq = [defaultdict() for i in range(26)]\r\nfor x in range(26):\r\n for i in range(n):\r\n q[x][f[x][i]] = i+1\r\nfor i in range(int(input())):\r\n a, b = input()[:-1].split()\r\n a = int(a)\r\n if a not in q[ord(b)-97]:\r\n print(n)\r\n else:\r\n print(q[ord(b)-97][a])", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import log2\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, = gil()\r\ns = [ord(ch)-97 for ch in g()]\r\nq, = gil()\r\n\r\nans = [[0 for _ in range(n+1)] for _ in range(26)]\r\nprev, new = [0]*n, [0]*n\r\n\r\nfor ch in range(26):\r\n maxi = 0\r\n for i in range(n):\r\n prev[i] = (1 if s[i] == ch else 0) + (prev[i-1] if i and s[i]== ch else 0) \r\n maxi = max(prev[i], maxi)\r\n ans[ch][0] = maxi\r\n\r\n for mi in range(1, n+1):\r\n maxi = 0 \r\n for i in range(n):\r\n aprev, sprev = prev[i-1] if i else 0, new[i-1] if i else 0\r\n if ch == s[i]:\r\n new[i] = sprev + 1\r\n else:\r\n new[i] = aprev + 1\r\n maxi = max(maxi, new[i])\r\n ans[ch][mi] = maxi\r\n prev, new = new, prev\r\n\r\nfin = []\r\n\r\nfor _ in range(q):\r\n mi, ch = gl()\r\n fin.append(str(ans[ord(ch)-97][int(mi)]))\r\n\r\nprint('\\n'.join(fin))", "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\ndef getCons(string, m, c):\r\n n = len(string)\r\n\r\n ans = 0\r\n st, end = 0, 0\r\n \r\n while end < n:\r\n if string[end] == c:\r\n end += 1\r\n elif m:\r\n m -= 1\r\n end += 1\r\n else:\r\n while st < end and string[st] == c:\r\n st += 1\r\n st += 1\r\n m += 1\r\n ans = max(ans, end-st)\r\n\r\n return ans \r\n \r\n\r\nt = 1\r\n\r\nwhile t:\r\n t -= 1\r\n\r\n n = int(input())\r\n s = input().strip()\r\n\r\n dp = {}\r\n\r\n\r\n q = int(input())\r\n for _ in range(q):\r\n m, c = input().split()\r\n if (m, c) in dp:\r\n print(dp[(m, c)])\r\n continue\r\n\r\n dp[(m, c)] = getCons(s, int(m), c)\r\n print(dp[(m, c)])\r\n" ]

[ "def main():\r\n s = input()\r\n if len(s) % 2 == 1:\r\n print('-1')\r\n return\r\n\r\n cnt = {'L':0,'R':0,'U':0,'D':0}\r\n for c in s:\r\n cnt[c] += 1\r\n \r\n reduce1 = abs(cnt['L'] - cnt['R'])\r\n reduce2 = abs(cnt['U'] - cnt['D'])\r\n print((reduce1 + reduce2) // 2)\r\n\r\nif __name__ == '__main__':\r\n main()", "if __name__ == '__main__':\r\n h = v = 0\r\n line = str(input())\r\n for it in line:\r\n if it == 'R':\r\n h += 1\r\n elif it == 'L':\r\n h -= 1\r\n elif it == 'U':\r\n v += 1\r\n elif it == 'D':\r\n v -= 1\r\n distance = abs(abs(h) - abs(v))\r\n if distance % 2 > 0:\r\n print(-1)\r\n else:\r\n print(distance // 2 + min(abs(h), abs(v)))\r\n", "s = input()\r\nif len(s) % 2 == 1:\r\n print(-1)\r\nelse:\r\n print((abs(s.count('L') - s.count('R')) + abs(s.count('U') - s.count('D'))) // 2)\r\n", "s = input()\n\nu = s.count(\"U\")\nd = s.count(\"D\")\nr = s.count(\"R\")\nl = s.count(\"L\")\n\n\nif len(s)%2==1:\n print(-1)\n exit()\n \nprint((abs(u-d)+abs(r-l))//2)\n", "n = input()\r\nif len(n) % 2 == 1 :\r\n print(-1)\r\nelse :\r\n f1, f2 = '', ''\r\n count = 0\r\n L,D,U,R = 0,0,0,0\r\n for i in n :\r\n if i == 'L' :\r\n L += 1\r\n elif i == 'D' :\r\n D += 1\r\n elif i =='U' :\r\n U += 1\r\n elif i == 'R' :\r\n R += 1\r\n t = L-R\r\n flag = 0\r\n if t% 2 == 0 :\r\n count += abs(t)\r\n else :\r\n count += abs(t) + 1\r\n flag = 1\r\n t = abs(U-D) - flag\r\n #if t % 2 == 0 :\r\n count += abs(t)\r\n print(count//2)\r\n", "import math\r\nstep = input()\r\nif(len(step)%2!=0):\r\n print(\"-1\")\r\nelse:\r\n dic = {\"L\":0, \"R\":0, \"U\":0, \"D\":0}\r\n for i in step:\r\n dic[i]+=1\r\n a = abs(dic[\"L\"]-dic[\"R\"])\r\n b = abs(dic[\"U\"]-dic[\"D\"])\r\n print(int((a+b)/2))", "n=input()\r\nz=abs(abs(n.count('U')-n.count('D'))+abs(n.count('R')-n.count('L')))\r\nprint([z//2,-1][z%2])\r\n \r\n \r\n \r\n", "s = input()\r\nans = 0\r\n\r\nif len(s) % 2 != 0:\r\n print(-1)\r\nelse:\r\n u = s.count('U')\r\n d = s.count('D')\r\n r = s.count('R')\r\n l = s.count('L')\r\n if abs(u - d) % 2 == 0 and abs(r-l) % 2 == 0:\r\n ans = abs(u - d) // 2 + abs(r-l) // 2\r\n else:\r\n ans = abs(u - d) // 2 + abs(r-l) // 2 + 1\r\n print(ans)", "s = input()\r\nif len(s)%2==1: print('-1')\r\nelse:\r\n L = s.count('L')\r\n R = s.count('R')\r\n U = s.count('U')\r\n D = s.count('D')\r\n print(int(abs(L-R)/2+abs(U-D)/2))", "s=input()\r\nC=str.count\r\na=abs(C(s,'R')-C(s,'L'))+abs(C(s,'U')-C(s,'D'))\r\nprint([-1,a//2][a%2==0])", "s=input()\r\nif(len(s)%2!=0):\r\n print(-1)\r\nelse:\r\n r=s.count(\"R\")\r\n l=s.count(\"L\")\r\n u=s.count(\"U\")\r\n d=s.count(\"D\")\r\n re=min(abs(r-l),abs(u-d))\r\n re+=abs(abs(r-l)-abs(u-d))//2\r\n print(re)", "ch=input()\r\nif len(ch)%2:\r\n print(-1)\r\nelse:\r\n h=v=s=0\r\n ar=list(ch)\r\n for x in range(len(ar)):\r\n if ar[x]=='U':\r\n v+=1 \r\n elif ar[x]=='D':\r\n v-=1 \r\n elif ar[x]=='R':\r\n h+=1 \r\n elif ar[x]=='L':\r\n h-=1 \r\n v=abs(v)\r\n h=abs(h)\r\n s+=v//2\r\n v-=2*(v//2)\r\n s+=h//2\r\n h-=2*(h//2)\r\n if (v+h)%2==0:\r\n s+=(v+h)//2\r\n print(s)\r\n else:\r\n print(-1)", "s = input()\nif len(s)&1:\n print('-1')\n exit(0)\nprint((abs(s.count('U') - s.count('D')) + abs(s.count('L') - s.count('R')))//2)\n", "s=input()\r\nx=0\r\ny=0\r\nif len(s)%2==1:\r\n print(\"-1\")\r\nelse:\r\n for i in range(len(s)):\r\n if s[i]=='U':\r\n x+=1\r\n elif s[i]=='D':\r\n x-=1\r\n elif s[i]=='R':\r\n y+=1\r\n elif s[i]=='L':\r\n y-=1\r\n print((abs(x)+abs(y))//2)\r\n", "s = str(input())\r\nif len(s)%2 == 1:\r\n print(-1)\r\nelse:\r\n u = 0\r\n d = 0\r\n r = 0\r\n l = 0\r\n while len(s) > 0:\r\n if s[0] == \"U\":\r\n u += 1\r\n elif s[0] == \"D\":\r\n d += 1\r\n elif s[0] == \"R\":\r\n r += 1\r\n else:\r\n l += 1\r\n s = s[1:]\r\n print(int((abs(u-d)+abs(r-l))/2))", "s = input()\r\nx = 0\r\ny = 0\r\nfor i in s:\r\n if i == 'L':\r\n x -= 1\r\n elif i == 'R':\r\n x += 1\r\n elif i == 'U':\r\n y += 1\r\n else:\r\n y -= 1\r\nif len(s) % 2 != 0:\r\n print('-1')\r\nelse:\r\n print((abs(x)+abs(y))//2)", "string = input()\r\nlength = len(string)\r\n\r\nif length % 2 == 1:\r\n print(-1)\r\nelse:\r\n freq = {\"U\": 0,\r\n \"D\": 0,\r\n \"L\": 0,\r\n \"R\": 0}\r\n\r\n for x in string:\r\n freq[x] += 1\r\n\r\n steps = abs(freq[\"U\"] - freq[\"D\"]) + \\\r\n abs(freq[\"L\"] - freq[\"R\"])\r\n print(int(steps/2))\r\n", "s = input()\r\na = 0; b = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'U':\r\n a += 1\r\n if s[i] == 'D':\r\n a -= 1\r\n if s[i] == 'R':\r\n b += 1\r\n if s[i] == 'L':\r\n b -= 1\r\nif len(s) % 2 == 1:\r\n print(-1)\r\nif len(s) % 2 == 0:\r\n print((abs(a)+abs(b))//2)\r\n", "import math\n\ns = input()\nans = 0\nu = 0\nd = 0\nl = 0\nr = 0\nif len(s)%2!=0:\n print('-1')\nelse:\n for i in s:\n # print(i)\n if i == 'D':\n d += 1\n elif i == 'U':\n u += 1\n elif i == 'L':\n l += 1\n elif i == 'R':\n r += 1\n # print(u)\n # print(d)\n # print(r)\n # print(l)\n # print(abs(r-l))\n # print(abs(u-d))\n print(int((abs(r-l)+abs(u-d))/2))", "a,x,y=input(),0,0\r\nif(len(a)%2==1):print(-1)\r\nelse:\r\n for i in a:\r\n if i=='U':y+=1\r\n elif i=='D':y-=1\r\n elif i=='L':x-=1\r\n elif i=='R':x+=1\r\n print(int((abs(x)+abs(y))/2))", "a=input()\r\nr=a.count('R')\r\nu=a.count('U')\r\nd=a.count('D')\r\nl=a.count('L')\r\n\r\nif len(a)%2:\r\n print(-1)\r\nelse:\r\n print((abs(r-l)+abs(u-d))//2)\r\n", "s = input()\r\nif len(s) % 2 != 0:\r\n print(-1)\r\nelse:\r\n a=s.count('R')\r\n b=s.count('U')\r\n c=s.count('L')\r\n d=s.count('D')\r\n cnt = 0\r\n if a > c:\r\n cnt = cnt + a - c\r\n else:\r\n cnt = cnt + c - a\r\n if b > d:\r\n cnt = cnt + b - d\r\n else:\r\n cnt = cnt + d - b\r\n cnt = cnt // 2\r\n print(cnt)", "s = input()\r\nl = [0]*2\r\nfor el in s:\r\n if el == 'L':\r\n l[0]+=1\r\n if el == 'R':\r\n l[0]-=1\r\n if el == 'U':\r\n l[1]+=1 \r\n if el == 'D':\r\n l[1]-=1 \r\nl[0] = abs(l[0])\r\nl[1] = abs(l[1])\r\nif sum(l)%2!=0:\r\n print(-1)\r\nelse:\r\n print(sum(l)//2)\r\n \r\n", "s = input()\r\n\r\nif len(s) % 2 == 1:\r\n print(-1)\r\n exit()\r\n\r\nhorizontal = 0\r\nvertical = 0\r\n\r\nfor k in s:\r\n if k == 'L':\r\n horizontal += 1\r\n elif k == 'R':\r\n horizontal -= 1\r\n elif k == 'U':\r\n vertical += 1\r\n elif k == 'D':\r\n vertical -= 1\r\n\r\nhorizontal = abs(horizontal)\r\nvertical = abs(vertical)\r\n\r\nprint((horizontal+vertical)//2)", "s = input()\r\nif len(s)%2:\r\n print(-1)\r\nelse:\r\n x, y = 0, 0\r\n for l in s:\r\n if l==\"L\":\r\n x -= 1\r\n elif l==\"R\":\r\n x += 1\r\n elif l==\"D\":\r\n y -= 1\r\n elif l==\"U\":\r\n y += 1\r\n print((abs(y)+abs(x))//2)", "The_string=input()\r\nif len(The_string)%2==1:\r\n print(-1)\r\nelse:\r\n\r\n The_list=[0]*4\r\n for i in range(len(The_string)):\r\n if The_string[i]==\"U\":\r\n The_list[0]+=1\r\n if The_string[i]==\"D\":\r\n The_list[1]+=1\r\n if The_string[i]==\"R\":\r\n The_list[2]+=1\r\n if The_string[i]==\"L\":\r\n The_list[3]+=1\r\n\r\n vertical=abs(The_list[0]-The_list[1])\r\n horizontal=abs(The_list[2]-The_list[3])\r\n\r\n answer=vertical//2+horizontal//2 +vertical%2\r\n print(answer)", "def find_minimum_change():\n instruction = input()\n\n if len(instruction) % 2 == 1:\n print(\"-1\")\n else:\n horizen_distance = vertical_distance = 0\n for character in range(0, len(instruction)):\n if instruction[character] == 'L':\n horizen_distance += 1\n elif instruction[character] == 'R':\n horizen_distance -= 1\n elif instruction[character] == 'U':\n vertical_distance += 1\n else:\n vertical_distance -= 1\n number_of_changes = (abs(vertical_distance) + abs(horizen_distance)) / 2\n print(int(number_of_changes))\n\n\nfind_minimum_change()\n", "def solve(ins) :\r\n if len(ins)%2 != 0 :\r\n return -1\r\n else :\r\n half = len(ins)//2\r\n ans = 0\r\n canceled = 0\r\n refer = {\"U\" : 0 , \"D\" : 0 , \"L\": 0 , \"R\" : 0 }\r\n cross = {\"U\" : \"D\" , \"D\" : \"U\" , \"L\" : \"R\" , \"R\" : \"L\"}\r\n for x in ins :\r\n refer[x] += 1\r\n \r\n canceled += min(refer[\"U\"],refer[\"D\"])*2\r\n canceled += min(refer[\"L\"],refer[\"R\"])*2\r\n \r\n ans = (len(ins) - canceled) // 2\r\n\r\n return ans\r\n \r\n \r\n \r\n\r\n\r\nprint (solve(input()))", "s = input()\nl = len(s)\nif l % 2 == 1:\n print(-1)\nelse:\n u = s.count('U')\n d = s.count('D')\n l = s.count('L')\n r = s.count('R')\n\n ud = abs(u - d) // 2;\n v1 = abs(u - d) % 2;\n rl = abs(l - r) // 2;\n v2 = abs(l - r) % 2;\n\n total = ud + rl;\n\n total += (v1 + v2) // 2\n\n print(total)\n", "t=input()\r\nt=list(t)\r\nx,y=0,0\r\nfor i in range(0,len(t)):\r\n if(t[i]=='U'):\r\n x+=1\r\n if(t[i]=='D'):\r\n x-=1\r\n if(t[i]=='L'):\r\n y+=1\r\n if(t[i]=='R'):\r\n y-=1\r\nif(x<0):\r\n x*=-1\r\nif(y<0):\r\n y*=-1\r\nif(len(t)%2!=0):\r\n print(-1)\r\nelse:\r\n print((x+y)//2)\r\n", "s = input()\r\nx = 0\r\ny = 0\r\nfor i in range(len(s)):\r\n if (s[i] == 'R'):\r\n x += 1\r\n if (s[i] == 'L'):\r\n x -= 1\r\n if (s[i] == 'U'):\r\n y += 1\r\n if (s[i] == 'D'):\r\n y -= 1\r\nif (abs(x) % 2 == 1 and abs(y) % 2 == 1):\r\n print(abs(x) // 2 + abs(y) // 2 + 1)\r\nelif (abs(x) % 2 == 1):\r\n print(-1)\r\nelif abs(y) % 2 == 1:\r\n print(-1)\r\nelse:\r\n print(abs(x) // 2 + abs(y) // 2)\r\n", "import sys\r\n\r\ns = input()\r\n\r\nif len(s) % 2 != 0:\r\n print(-1)\r\n sys.exit(0)\r\n\r\nx = 0\r\ny = 0\r\nfor c in s:\r\n if c == \"L\": x -= 1\r\n if c == \"R\": x += 1\r\n if c == \"U\": y += 1\r\n if c == \"D\": y -= 1\r\n\r\nprint((abs(x) + abs(y)) // 2)\r\n", "vert=0\r\nhor=0\r\ns=input()\r\nfor i in s:\r\n if i=='U':\r\n vert+=1\r\n elif i=='D':\r\n vert-=1\r\n elif i=='R':\r\n hor+=1\r\n elif i=='L':\r\n hor-=1\r\nif len(s)%2==0:\r\n print((abs(vert)+abs(hor))//2)\r\nelse:\r\n print(-1)\r\n", "def f():\n a = input()\n if len(a) % 2 != 0:\n return -1\n l = r = u = d = 0\n mini = (10000,)\n for i in a:\n if i == 'L':\n l += 1\n elif i == 'R':\n r += 1\n elif i == 'U':\n u += 1\n else:\n d += 1\n for i in range(len(a)//2 + 1):\n r1 = l1 = i\n u1 = d1 = (len(a))//2 - i\n if abs(r - r1) + abs(l - l1) + abs(u - u1) + abs(d - d1) < sum(mini):\n mini = (abs(r - r1) , abs(l - l1) , abs(u - u1) , abs(d - d1))\n return sum(mini)//2\nprint(f())", "s=input()\r\nif len(s)%2!=0:\r\n print(-1)\r\nelse:\r\n l,r,u,d=0,0,0,0\r\n for i in range(len(s)):\r\n if s[i]=='U':\r\n u+=1\r\n elif s[i]=='D':\r\n d+=1\r\n elif s[i]=='R':\r\n r+=1\r\n else:\r\n l+=1\r\n print((abs(l-r)+abs(u-d))//2)\r\n", "# You lost the game.\ns = str(input())\nn = len(s)\nr = 0\nif n % 2:\n print(-1)\nelse:\n U = D = L = R = 0\n for i in range(n):\n if s[i] == \"L\":\n L += 1\n elif s[i] == \"R\":\n R += 1\n elif s[i] == \"U\":\n U += 1\n else:\n D += 1\n if (U + D) % 2:\n r = 1\n if U > D:\n D += 1\n if R > L:\n R -= 1\n else:\n L -= 1\n else:\n U += 1\n if R > L:\n R -= 1\n else:\n L -= 1\n print(r+abs(U-D)//2+abs(R-L)//2)\n \n\n", "def mover(pos,mov):\n if mov == 'L':\n pos[0] += 1\n elif mov == 'R':\n pos[0] -= 1\n elif mov == 'U':\n pos[1] += 1\n else:\n pos[1] -= 1\n\nmovimientos = list(input())\nposicion = [0,0]\nfor i in movimientos:\n mover(posicion,i)\n\nmovimientos_malos = abs(posicion[0]) + abs(posicion[1])\nif movimientos_malos%2 == 0:\n print(abs(movimientos_malos//2))\nelse:\n print(-1)\n\t \t \t \t \t\t \t\t\t\t \t", "s=input().strip()\r\nup,down,left,right=0,0,0,0\r\nif(len(s)%2!=0):\r\n print(-1)\r\nelse:\r\n for i in s:\r\n if(i==\"U\"):\r\n up+=1\r\n elif(i=='D'):\r\n down+=1\r\n elif(i==\"L\"):\r\n left+=1\r\n elif(i==\"R\"):\r\n right+=1\r\n d1=abs(up-down)\r\n d2=abs(left-right)\r\n if((d1+d2)%2==0):\r\n print((d1+d2)//2)\r\n else:\r\n print(-1)", "string = input()\r\nif len(string) % 2 != 0:\r\n print(-1)\r\nelse:\r\n if string == len(string)*string[0]:\r\n print(int(len(string) / 2))\r\n else:\r\n c = list(map(string.count, [\"U\", \"D\", \"R\", \"L\"]))\r\n v1 = abs(c[0] - c[1])\r\n v2 = abs(c[2] - c[3])\r\n if v1 == v2:\r\n print(v1)\r\n else:\r\n ans = int((v1 + v2) / 2)\r\n print(ans)\r\n ", "a = input()\r\n\r\nu = 0\r\nd = 0\r\nl = 0\r\nr = 0\r\n\r\nfor i in a:\r\n\tif i == \"U\":\r\n\t\tu += 1\r\n\telif i == \"D\":\r\n\t\td += 1\r\n\telif i == \"R\":\r\n\t\tr += 1\r\n\telse:\r\n\t\tl += 1\r\n\r\nx = abs(r - l)\r\ny = abs(u - d)\r\n\r\n\r\nprintar = 0\r\n\r\nwhile x > 0 and y > 0:\r\n printar += 1\r\n x -= 1\r\n y -= 1\r\n\r\nif x == 0 and y == 0:\r\n print(printar)\r\nelif x % 2 == 0 and y % 2 == 0:\r\n\tprintar += x/2 + y/2\r\n\tprint(int(printar))\r\nelse:\r\n\tprint(-1)", "s = input()\r\n\r\nc = [0]*4\r\n\r\nif len(s)%2 !=0:\r\n print(\"-1\")\r\nelse:\r\n for x in range(len(s)):\r\n if s[x] == 'U':\r\n c[0]+=1\r\n elif s[x] == 'D':\r\n c[1]+=1\r\n elif s[x] == 'L':\r\n c[2]+=1\r\n elif s[x] == 'R':\r\n c[3]+=1\r\n \r\n [u,l] = [abs(c[0]-c[1]), abs(c[2]-c[3])]\r\n ans = min([u,l]) + (max([u,l])-min([u,l]))/2\r\n print(int(ans))\r\n", "dic = {'U' : 0, 'D' : 0, 'L' : 0, 'R' : 0}\r\n\r\ndata = input()\r\n\r\nfor x in data:\r\n dic[x] = dic[x] + 1\r\n\r\nif len(data) % 2 == 1:\r\n print('-1')\r\nelse:\r\n print((abs(dic['U'] - dic['D']) + abs(dic['L'] - dic['R'])) >> 1)", "from math import*\r\nA=input()\r\nb=len(A)\r\nif (b%2)>0:\r\n print(\"-1\")\r\nelse:\r\n itoga=list(range(4))\r\n for i in range(4):\r\n itoga[i]=0\r\n for i in range (b):\r\n if A[i]==\"U\":\r\n itoga[0]+=1\r\n if A[i]==\"D\":\r\n itoga[1]+=1\r\n if A[i]==\"L\":\r\n itoga[2]+=1\r\n if A[i]==\"R\":\r\n itoga[3]+=1\r\n zad1=abs(itoga[0]-itoga[1])\r\n zad2=abs(itoga[2]-itoga[3])\r\n if zad1!=0 and zad2!=0:\r\n if (zad1)==(zad2):\r\n print(zad1)\r\n if (zad1)>(zad2):\r\n print((zad2)+int(((zad1)-(zad2))/2))\r\n if (zad2)>(zad1):\r\n print((zad1)+int(((zad2)-(zad1))/2))\r\n else:\r\n if zad1!=0: print(int(zad1/2))\r\n else: print(int(zad2/2))\r\n \r\n", "s = input()\r\n\r\nif len(s) % 2 == 1:\r\n print(-1)\r\nelse:\r\n r = 0\r\n l = 0\r\n u = 0\r\n d = 0\r\n res1 = 0\r\n res2 = 0\r\n for i in range(len(s)):\r\n if (s[i] == \"L\"):\r\n l += 1\r\n elif (s[i] == \"R\"):\r\n r += 1\r\n elif (s[i] == \"D\"):\r\n d += 1\r\n else:\r\n u += 1\r\n res1 = abs(d - u)\r\n res2 = abs(r - l)\r\n c = 0\r\n if (res1 % 2 == 0):\r\n c += res1 // 2\r\n c += res2 // 2\r\n else:\r\n c += res1 // 2\r\n c += res2 // 2\r\n c += 1\r\n\r\n print(c)", "import collections\n\ndef main():\n s = input()\n\n if len(s) % 2 == 1:\n print(-1)\n return\n\n ct = collections.Counter(s)\n print( (abs(ct['L'] - ct['R']) + abs(ct['U'] - ct['D']))//2 )\n\nmain()\n", "# your code goes here\r\nstr=input()\r\nif(len(str)%2==1):\r\n\tprint(-1)\r\nelse:\r\n\tver=0\r\n\thor=0\r\n\tfor i in str:\r\n\t\tif(i=='L'):\r\n\t\t\thor+=1\r\n\t\tif(i=='R'):\r\n\t\t\thor-=1\r\n\t\tif(i=='U'):\r\n\t\t\tver+=1\r\n\t\tif(i=='D'):\r\n\t\t\tver-=1\r\n\tprint((abs(hor)+abs(ver))//2)\r\n\t\t", "# print(\"Input the string\")\nst = input()\n\nif len(st) % 2 == 1:\n print(-1)\nelse:\n lrcount = 0\n udcount = 0\n for ch in st:\n if ch == \"L\":\n lrcount -= 1\n elif ch == \"R\":\n lrcount += 1\n elif ch == \"U\":\n udcount += 1\n else: # ch == \"D\"\n udcount -= 1\n print ((abs(lrcount) + abs(udcount))//2)\n \n", "s = input()\nd = {'L':0,'D':0,'U':0,'R':0}\n\nif len(s)%2 != 0:\n\tprint(-1)\nelse:\n\tfor i in s:\n\t\td[i] += 1\n\tprint((abs(d['L'] - d['R']) + abs(d['U'] - d['D']))//2)", "way=list(input())\r\nif len(way)%2==1:\r\n print (-1)\r\nelse:\r\n rast=0\r\n bala=0\r\n for i in way :\r\n if i ==\"R\":rast-=1\r\n elif i =='L':rast+=1\r\n elif i =='D':bala+=1\r\n else :bala-=1\r\n if rast<0:rast=-rast\r\n if bala <0:bala=-bala\r\n t=rast//2 + bala//2 +rast%2\r\n print (t)", "n = input()\r\nr = 0\r\nc = 0\r\nif len(n) % 2 == 1:\r\n print('-1')\r\nelse:\r\n for i in n:\r\n if i == 'U':\r\n c += 1\r\n elif i == 'D':\r\n c -= 1\r\n elif i == 'L':\r\n r += 1\r\n else:\r\n r-= 1\r\n print((abs(r) + abs(c)) // 2)", "s=input()\r\na=[0,0,0,0]\r\nfor S in s:\r\n if(S=='U'): \r\n a[0]+=1\r\n if(S=='R'): \r\n a[1]+=1\r\n if(S=='D'): \r\n a[2]+=1\r\n if(S=='L'): \r\n a[3]+=1\r\nif (len(s)%2==1):\r\n print(-1)\r\nelse :\r\n print((abs(a[0]-a[2])+abs(a[1]-a[3]))//2)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/712/B\r\n\r\nd_s = {}\r\nd_s[\"L\"] = 0\r\nd_s[\"R\"] = 0\r\nd_s[\"U\"] = 0\r\nd_s[\"D\"] = 0\r\n\r\ns = input()\r\n\r\nfor c in s:\r\n d_s[c] += 1\r\n \r\nif abs(d_s[\"L\"] - d_s[\"R\"]) % 2 == abs(d_s[\"U\"] - d_s[\"D\"]) % 2:\r\n print((abs(d_s[\"L\"] - d_s[\"R\"]) + abs(d_s[\"U\"] - d_s[\"D\"])) // 2)\r\nelse:\r\n print(-1)", "# link: https://codeforces.com/problemset/problem/712/B\r\nif __name__ == \"__main__\":\r\n s = input()\r\n if len(s) % 2 != 0:\r\n print(-1)\r\n exit(0)\r\n x = 0\r\n y = 0\r\n for i in s:\r\n if i == 'R':\r\n x += 1\r\n if i == 'L':\r\n x -= 1\r\n if i == 'U':\r\n y += 1\r\n if i == 'D':\r\n y -= 1\r\n minimum_changes = (abs(x) + abs(y)) // 2\r\n print(minimum_changes) \r\n\r\n ", "def compute():\r\n\ts = input()\r\n\tif len(s)%2 == 1:return -1\r\n\td = {'R':0,'L':0,'U':0,'D':0}\r\n\tfor x in s:d[x] += 1\r\n\treturn (abs(d['L']-d['R']) + abs(d['U']-d['D']))//2\r\nprint(compute())\r\n\t\r\n\r\n", "s=input()\r\nif(len(s)%2!=0):\r\n print(-1)\r\nelse:\r\n llist=[0,0,0,0]\r\n for i in s:\r\n if(i=='U'):\r\n llist[0]+=1\r\n if(i=='D'):\r\n llist[1]+=1\r\n if(i=='L'):\r\n llist[2]+=1\r\n if(i=='R'):\r\n llist[3]+=1\r\n print((abs(llist[0]-llist[1])+abs(llist[2]-llist[3]))//2)", "m = input()\nr = 0\nl = 0\nu = 0\nd = 0\nfor char in m:\n\tif char == \"R\":\n\t\tr+=1\n\telif char == \"L\":\n\t\tl+=1\n\telif char == \"U\":\n\t\tu+=1\n\telif char == \"D\":\n\t\td += 1\nif (u+d+r+l)%2 == 1:\n\tprint(-1)\nelse:\n\tud = abs(u-d)\n\trl = abs(r-l)\n\tprint((ud+rl)//2)", "cmd = input()\r\nif len(cmd) % 2 == 1:\r\n print(-1)\r\nelse:\r\n u = 0\r\n d = 0\r\n l = 0\r\n r = 0\r\n for c in cmd:\r\n if c == 'U':\r\n u += 1\r\n if c == 'D':\r\n d += 1\r\n if c == 'L':\r\n l += 1\r\n if c == 'R':\r\n r += 1\r\n print(int((abs(u - d) + abs(r - l)) / 2))\r\n", "s = input()\r\nans = -1\r\nif len(s)%2 == 0:\r\n UD = abs(s.count('U') - s.count('D'))\r\n LR = abs(s.count('L') - s.count('R'))\r\n\r\n ans = (UD + LR)//2\r\n\r\nprint(ans)", "s = input()\r\nd1 = 0\r\nd2 = 0\r\nfor i in s:\r\n if i==\"L\":\r\n d1 +=1\r\n elif i==\"R\":\r\n d1-=1\r\n elif i==\"U\":\r\n d2+=1\r\n else:\r\n d2-=1\r\n\r\nt = abs(d1)+abs(d2)\r\n\r\nif t%2!=0:\r\n print(-1)\r\nelse:\r\n print(t//2)", "s = input()\r\nn = len(s)\r\nans = 0\r\nif n % 2 == 1:\r\n print(\"-1\")\r\nelse:\r\n p = 0\r\n q = 0\r\n for i in range(0, n):\r\n if s[i] == \"R\":\r\n p += 1\r\n elif s[i] == \"U\":\r\n q += 1\r\n elif s[i] == \"L\":\r\n p -= 1\r\n elif s[i] == \"D\":\r\n q -= 1\r\n if p % 2 == 0:\r\n ans = abs(p // 2) + abs(q // 2)\r\n else:\r\n ans1 = min(abs(p - 1), abs(p + 1))\r\n ans2 = min(abs(q - 1), abs(q + 1))\r\n ans = (ans1 + ans2) // 2 + 1\r\n print(ans)\r\n", "l=input()\r\nif(len(l)%2!=0):\r\n\tprint(-1)\r\nelif(l.count('R')==l.count('L') and l.count('U')==l.count('D')):\r\n\tprint(0)\r\nelse:\r\n\ts=0\r\n\ta=max(l.count('R'),l.count('L'))-min(l.count('R'),l.count('L'))\r\n\tb=max(l.count('U'),l.count('D'))-min(l.count('U'),l.count('D'))\r\n\tif(a>b):\r\n\t\ta-=b\r\n\t\ts+=b\r\n\t\tif(a%2!=0):\r\n\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\tprint(s+a//2)\r\n\telse:\r\n\t\tb-=a\r\n\t\ts+=a\r\n\t\tif(b%2==0):\r\n\t\t\tprint(s+b//2)\r\n\t\telse:\r\n\t\t\tprint(-1)", "import math\r\n\r\n\r\ndef main_function():\r\n s = input()\r\n n = len(s)\r\n\r\n if n % 2 == 1:\r\n print(-1)\r\n else:\r\n u = 0\r\n d = 0\r\n r = 0\r\n l = 0\r\n counter = 0\r\n for i in s:\r\n if i == \"R\":\r\n r += 1\r\n if i == \"U\":\r\n u += 1\r\n if i == \"D\":\r\n d += 1\r\n if i == \"L\":\r\n l += 1\r\n z = max(r, l) - min(r, l)\r\n y = max(u, d) - min(u, d)\r\n counter += min(z, y)\r\n p = max(z, y) - min(z, y)\r\n counter += p // 2\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "s = input()\r\nx, y = 0, 0\r\n\r\nfor i in s:\r\n if i == \"R\":x+=1\r\n if i==\"L\":x-=1\r\n if i == \"U\":y+=1\r\n if i == \"D\":y-=1\r\n\r\nif x==y==0:\r\n print(0)\r\n quit()\r\nif len(s) % 2:\r\n print(-1)\r\n quit()\r\nfrom math import ceil\r\nax, ay = abs(x), abs(y)\r\nprint(min(ax,ay) + (max(ax,ay)-min(ax,ay))//2)", "import collections\n\nmove = input()\ncnt = collections.Counter()\nfinal=0\n\nif len(move) %2 == 1:\n print(-1)\n\nelse:\n for i in range(len(move)):\n cnt[move[i]] += 1\n print(int(abs(cnt[\"L\"]-cnt[\"R\"])/2 + abs(cnt[\"U\"]-cnt[\"D\"])/2))\n\n", "w=list(input())\r\nif len(w)%2==1:\r\n print('-1')\r\nelse:\r\n r=0\r\n u=0\r\n for i in w:\r\n if i=='R':\r\n r=r-1\r\n elif i=='L':\r\n r=r+1\r\n elif i=='D':\r\n u=u+1\r\n else:\r\n u=u-1\r\n if r<0:\r\n r=-r\r\n if u<0:\r\n u=-u\r\n k=r//2+u//2+r%2\r\n print(k)\r\n", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nx=y=0\nfor d in input():\n\tif'L'==d:x-=1\n\telif'R'==d:x+=1\n\telif'D'==d:y-=1\n\telse:y+=1\ny=abs(x)+abs(y)\nprint(-1 if 1&y else y>>1)\n", "from sys import stdin\r\ns=stdin.readline().strip()\r\nif len(s)%2!=0:\r\n print(-1)\r\n exit(0)\r\nr=0\r\nu=0\r\nd=0\r\nl=0\r\nfor i in s:\r\n if i==\"R\":\r\n r+=1\r\n elif i==\"U\":\r\n u+=1\r\n elif i==\"D\":\r\n d+=1\r\n else:\r\n l+=1\r\nans=0\r\n\r\nif abs(r-l)%2!=0:\r\n if u>d:\r\n u-=1\r\n else:\r\n d-=1\r\n if l>r:\r\n l-=1\r\n else:\r\n r-=1\r\n \r\n ans+=1\r\n\r\nprint(abs(r-l)//2+abs(u-d)//2+ans) \r\n", "u, r= 0, 0\r\nfor i in input():\r\n if i == 'U': u += 1\r\n elif i == 'D': u -= 1\r\n elif i == 'R': r += 1\r\n else: r -= 1\r\nif not((abs(u)%2)^(abs(r)%2)): print((abs(u) + abs(r))//2)\r\nelse: print(-1)", "s = input()\nn = len(s)\ncnt = [0 for i in range(4)]\n# L, R, U, D\nfor i in range(n):\n\tif(s[i]=='L'):\n\t\tcnt[0]+=1\n\telif(s[i]=='R'):\n\t\tcnt[1]+=1\n\telif(s[i]=='U'):\n\t\tcnt[2]+=1\n\telse:\n\t\tcnt[3]+=1\n\nif(n%2!=0):\n\tprint(-1)\nelse:\n\tdiff1=abs(cnt[0]-cnt[1])\n\tdiff2=abs(cnt[2]-cnt[3])\n\tif(diff1==0 and diff2==0):\n\t\tprint(0)\n\telse:\n\t\tif(diff1%2==0):\n\t\t\tprint(int(diff1/2)+int(diff2/2))\n\t\telse:\n\t\t\tprint(int(diff1/2)+int(diff2/2)+1)\t\n", "L = 0\nR = 0\nU = 0\nD = 0\n\nxs = input()\n\nif len(xs) % 2 == 1:\n print (-1)\nelse:\n for x in xs:\n if x == 'L':\n L += 1\n elif x == 'R':\n R += 1\n elif x == 'U':\n U += 1\n else:\n D += 1\n\n x = R - L\n y = U - D\n sol = (abs(x) + abs(y)) // 2\n\n print(sol)\n", "s = str(input())\r\nhor, ver = 0, 0\r\nfor j in range(len(s)):\r\n if s[j] == 'L':\r\n hor -= 1\r\n elif s[j] == 'R':\r\n hor += 1\r\n elif s[j] == 'U':\r\n ver += 1\r\n else:\r\n ver -= 1\r\nval = abs(hor) + abs(ver)\r\nif val % 2 == 0:\r\n print(int(val / 2))\r\nelse:\r\n print(-1)\r\n", "s=input()\r\n\r\nif len(s)%2==1:\r\n print(-1)\r\n \r\nelse:\r\n#q=[0]*4 \r\n d={\"D\":0,\"U\":0,\"L\":0,\"R\":0}\r\n for i in s:\r\n d[i]+=1\r\n \r\n \r\n #print(d)\r\n print(((abs(d['U']-d['D'])+abs(d['L']-d['R']))//2))\r\n\r\n", "s = input()\r\n\r\nd = {'R': 'L', 'L': 'R', 'U': 'D', 'D': 'U'}\r\nl_r = 0\r\nu_d = 0\r\nl = len(s)\r\n\r\nif l&1:\r\n print(\"-1\")\r\nelse:\r\n ans = 0\r\n for i in range(l):\r\n if s[i] == \"R\":\r\n l_r += 1\r\n elif s[i] == \"L\":\r\n l_r -= 1\r\n elif s[i] == \"U\":\r\n u_d += 1\r\n else:\r\n u_d -= 1\r\n t = abs(u_d)+abs(l_r)\r\n print(t//2)\r\n \r\n", "from math import ceil\r\ndef main():\r\n mys = input()\r\n\r\n l = mys.count('L')\r\n r = mys.count('R')\r\n u = mys.count('U')\r\n d = mys.count('D')\r\n\r\n if len(mys) % 2:\r\n print(-1)\r\n return\r\n \r\n ans = abs(d-u)\r\n ans2 = abs(l-r)\r\n ans3 = min(ans, ans2)\r\n ans4 = (max(ans, ans2)-ans3)//2\r\n print(ans3+ans4)\r\n\r\nmain()", "s=input()\r\n\r\nif (len(s)%2)==1:\r\n\tprint(-1)\r\n\texit()\r\n\r\nleft_right=abs(s.count(\"L\")-s.count(\"R\"))\r\nup_down=abs(s.count(\"U\")-s.count(\"D\"))\r\nmin=(left_right//2)+(up_down//2)\r\nif (left_right%2)==1:\r\n\tmin+=1\r\nprint(min)", "r,l,u,d = 0,0,0,0\r\nfor c in input():\r\n if(c=='R'):\r\n r += 1\r\n elif(c=='L'):\r\n l += 1\r\n elif(c=='U'):\r\n u += 1\r\n elif(c=='D'):\r\n d += 1\r\nc = abs(r-l)+abs(u-d)\r\nif(c%2==0):\r\n print(c//2)\r\nelse:\r\n print(-1)", "s = input()\r\nud = lr = 0\r\nfor ch in s:\r\n if(ch=='R'):\r\n lr = lr+1\r\n if(ch=='L'):\r\n lr = lr-1\r\n if(ch=='U'):\r\n ud = ud+1\r\n if(ch=='D'):\r\n ud = ud-1\r\n\r\nif((abs(lr) + abs(ud))%2==1):\r\n print(-1)\r\nelse:\r\n print(int((abs(lr) + abs(ud))/2))\r\n\r\n", "n = input().upper()\na = [0, 0]\nl = [i for i in n]\nfor j in l:\n if j=='U':\n a[0] += 1\n elif j=='D':\n a[0] -= 1\n elif j=='R':\n a[1] += 1\n else :\n a[1] -= 1\nif len(n)%2 != 0:\n print(-1)\nelse:\n ans = abs(a[0])+abs(a[1])\n print(int(ans/2))", "s=input()\r\nif len(s)%2==1:\r\n print('-1')\r\n exit(0)\r\nleft=0\r\nright=0\r\nup=0\r\ndown=0\r\nfor c in s:\r\n if c=='L':\r\n left+=1\r\n elif c=='R':\r\n right+=1\r\n elif c=='U':\r\n up+=1\r\n else:\r\n down+=1\r\nx=abs(left-right)\r\ny=abs(up-down)\r\nif x>y:\r\n print(y+(x-y)//2)\r\nelse:\r\n print(x+(y-x)//2)", "s = input()\r\nif len(s) % 2 != 0:\r\n print(-1)\r\nelse:\r\n pos = (0, 0)\r\n d = {'U': (0, 1), 'D': (0, -1), 'R': (1, 0), 'L': (-1, 0)}\r\n for c in s:\r\n pos = (pos[0] + d[c][0], pos[1] + d[c][1])\r\n print((abs(pos[0]) + abs(pos[1])) // 2)", "def solve(s):\r\n a=0\r\n b=0\r\n for i in s:\r\n if i=='U':\r\n a+=1\r\n elif i=='D':\r\n a-=1\r\n elif i=='L':\r\n b-=1\r\n elif i=='R':\r\n b+=1\r\n if (a+b)%2==1:\r\n return -1\r\n ans=(abs(a)+abs(b))//2\r\n return ans\r\n\r\ns=input()\r\nprint(solve(s))\r\n", "s=input()\r\nx=abs(s.count('L')-s.count('R'))\r\ny=abs(s.count('U')-s.count('D'))\r\nprint(-1 if len(s)&1>0 else (x+y)>>1)", "'''input\nDDDD\n'''\ns = input()\nif len(s) % 2 == 1:\n\tprint(-1)\nelse:\n\tprint((abs(s.count(\"R\")-s.count(\"L\"))+abs(s.count(\"U\")-s.count(\"D\")))//2)\n", "import math\r\nimport sys\r\nimport re\r\n\r\ndef func(s):\r\n if len(s)%2 != 0:\r\n return -1\r\n else:\r\n a = abs(s.count('U')-s.count('D'))\r\n b = abs(s.count('L') - s.count('R'))\r\n return (a+b)//2\r\n\r\ns = input()\r\nprint(func(s))", "s = input()\r\nli = s.count(\"L\")\r\nri = s.count(\"R\")\r\nui = s.count(\"U\")\r\ndi = s.count(\"D\")\r\nn = len(s)\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n print((abs(li-ri)+abs(di-ui))//2)\r\n", "s=str(input())\r\nn=len(s)\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n l=s.count('L')\r\n r=s.count('R')\r\n u=s.count('U')\r\n d=s.count('D')\r\n if l==r:\r\n print(abs(u-d)//2)\r\n elif u==d:\r\n print(abs(l-r)//2)\r\n else:\r\n if (l-r)%2==0 and (u-d)%2==0:\r\n print(abs(l-r)//2+abs(u-d)//2)\r\n else:\r\n print(1+abs(l-r)//2+abs(u-d)//2)\r\n", "\r\nif __name__ == '__main__':\r\n\ts = input()\r\n\tn = len(s)\r\n\tif n % 2 != 0:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\td = {x:0 for x in \"LRUD\"}\r\n\t\tfor c in s:\r\n\t\t\td[c] += 1\r\n\t\tprint((abs(d['R']-d['L'])+abs(d['U']-d['D'])) // 2)\r\n\r\n", "s=input()\r\nr,l,d,u=s.count('R'),s.count('L'),s.count('U'),s.count('D')\r\na,b=abs(r-l),abs(d-u)\r\nif((a+b)%2==1):\r\n print(-1)\r\nelse:\r\n print(int(abs(a-b)+(a+b-2*abs(a-b))/2))\r\n", "def main():\r\n s = input()\r\n R = s.count('R')\r\n L = s.count('L')\r\n U = s.count('U')\r\n D = s.count('D')\r\n ans = -1\r\n if((R+L+U+D)%2 == 0):\r\n if((R==L) and (U==D)):\r\n print(\"0\")\r\n else:\r\n ans = (abs(R-L) + abs(U-D))//2\r\n print(ans)\r\n else:\r\n print(\"-1\")\r\nif __name__ == '__main__':\r\n main()", "line = input()\nif len(line) % 2:\n print(-1)\nelse:\n x = abs(line.count('U')-line.count('D'))\n y = abs(line.count('R')-line.count('L'))\n print((x + y) // 2)", "s = input()\nif len(s) % 2 == 1:\n print('-1')\n exit()\na = abs(s.count('U') - s.count('D'))\nb = abs(s.count('L') - s.count('R'))\nprint(a + b >> 1)\n\n\t\t \t \t \t\t\t\t \t \t\t\t \t\t\t\t\t\t\t\t\t", "s = str(input())\r\nS = [str(i) for i in s]\r\nx = 0\r\ny =0 \r\nif len(S) % 2 != 0:\r\n print(-1)\r\nelse: \r\n for i in S:\r\n if i == \"U\":\r\n y += 1\r\n if i == \"D\":\r\n y -= 1\r\n if i == \"R\":\r\n x += 1\r\n if i == \"L\":\r\n x -= 1\r\n if x < 0:\r\n x = x - 2*x\r\n if y < 0:\r\n y = y - 2*y\r\n print( int((x + y) / 2))\r\n \r\n\r\n", "a=str(input())\r\nb=len(a)\r\nc=0\r\nd=0\r\nif b%2==1:\r\n print(-1)\r\n exit()\r\nfor i in range (b):\r\n if a[i]=='R':\r\n c+=1\r\n if a[i]=='L':\r\n c-=1\r\n if a[i]=='U':\r\n d+=1\r\n if a[i]=='D':\r\n d-=1\r\nprint((abs(c)+abs(d))//2)\r\n\r\n", "s = input()\r\nif len(s) % 2:\r\n print(-1)\r\n exit()\r\nx = 0\r\ny = 0\r\nfor i in s:\r\n if i == 'L':\r\n x -= 1\r\n if i == 'R':\r\n x += 1\r\n if i == 'U':\r\n y += 1\r\n if i == 'D':\r\n y -= 1\r\nx = abs(x)\r\ny = abs(y)\r\nprint(x // 2 + y // 2 + max(x % 2, y % 2))", "from math import *\r\ns=input()\r\nx = len(s)\r\nz = 0\r\nc = 0\r\nfor i in range(x):\r\n if(s[i]==\"L\"):c+=1\r\n if(s[i]==\"R\"):c-=1\r\n if(s[i]==\"U\"):z+=1\r\n if(s[i]==\"D\"):z-=1\r\nfor i in range(1):\r\n if(x%2!=0):\r\n print(\"-1\")\r\n else:\r\n c=abs(c)+abs(z)\r\n c=int(c/2)\r\n print(abs(c))\r\n", "s = input()\r\nlength = len(s)\r\nu,d,l,r=0,0,0,0\r\nsteps = 0\r\nfor i in range(length):\r\n if s[i]==\"L\":\r\n l +=1\r\n if s[i]==\"R\":\r\n r +=1\r\n if s[i]==\"U\":\r\n u +=1\r\n if s[i]==\"D\":\r\n d +=1\r\n\r\nif l>=r:\r\n steps += l-r\r\n\r\nif r>l:\r\n steps +=r-l\r\n\r\nif u>=d:\r\n steps += u-d\r\n\r\nif d>u:\r\n steps += d-u\r\n\r\nif length%2 !=0:\r\n print(-1)\r\nelse:\r\n print(int(steps/2))\r\n", "mod = 10 ** 9 + 7\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\ns=si()\r\nsm=abs(s.count('R')-s.count('L'))+abs(s.count('U')-s.count('D'))\r\nprint([-1,sm//2][not sm&1])", "s = input()\r\nu, d, l, r = 0, 0, 0, 0\r\nfor i in s:\r\n if i == 'U':\r\n u += 1\r\n elif i == 'D':\r\n d += 1\r\n elif i == 'R':\r\n r += 1\r\n else:\r\n l += 1\r\nif (r + l + u + d) % 2 != 0:\r\n print(-1)\r\nelse:\r\n print((abs(r - l) + abs(u - d)) // 2)", "s=input()\r\na=abs(str.count(s,'R')-str.count(s,'L'))+abs(str.count(s,'U')-str.count(s,'D'))\r\nprint([-1,a//2][a%2==0])", "s=input()\r\ns=list(s)\r\nu1=s.count('U')\r\nd1=s.count('D')\r\nl1=s.count('L')\r\nr1=s.count('R')\r\nk1=abs(u1-d1)\r\nk2=abs(l1-r1)\r\nif (k1+k2)%2==0:\r\n print((k1+k2)//2)\r\nelse:\r\n print('-1')\r\n \r\n \r\n ", "big_string = input()\n\nif len(big_string) % 2:\n print(-1)\n \nelse:\n lefts = 0\n ups = 0\n downs = 0\n rights = 0\n \n for letter in big_string:\n if letter == \"L\":\n lefts += 1\n elif letter == \"R\":\n rights += 1\n elif letter == \"U\":\n ups += 1\n else:\n downs += 1\n \n right_left_dif = abs(lefts - rights)\n up_down_dif = abs(ups - downs)\n \n print((right_left_dif + up_down_dif) // 2)\n \t\t \t\t \t\t\t \t \t\t\t\t\t \t \t \t\t \t", "n=input()\r\nif len(n)%2==1:\r\n print(-1)\r\nelse:\r\n y=0;x=0\r\n for i in n:\r\n if i=='U':y+=1\r\n elif i=='D':y-=1\r\n elif i=='L':x+=1\r\n elif i=='R':x-=1\r\n print((abs(x)+abs(y))//2)", "a = input()\r\nL, R, U, D = 0, 0, 0, 0\r\nfor i in a:\r\n if i == 'L':\r\n L += 1\r\n elif i == 'R':\r\n R += 1\r\n elif i == 'U':\r\n U += 1\r\n elif i == 'D':\r\n D += 1\r\nUD = abs(U - D)\r\nLR = abs(L - R)\r\nif len(a) % 2 != 0:\r\n print(\"-1\")\r\nelif UD == 0 and LR == 0:\r\n print('0')\r\nelse:\r\n x = UD + LR\r\n if x % 2 != 0:\r\n print(\"-1\")\r\n else:\r\n print(x // 2)", "A = input()\r\ncntu = 0; cntr = 0\r\nfor x in A:\r\n if(x == 'R'): cntr += 1\r\n elif(x == 'L'): cntr -= 1\r\n elif(x == 'U'): cntu += 1\r\n else: cntu -= 1\r\ncntu = abs(cntu); cntr = abs(cntr)\r\nif(cntu % 2 and cntr % 2):\r\n cntu -= 1\r\n cntr += 1\r\nif(cntu % 2 or cntr % 2): print(-1)\r\nelse: print(cntu // 2 + cntr // 2)\r\n", "a=input()\r\nx=abs(a.count('U')-a.count('D'))\r\nx+=abs(a.count('R')-a.count('L'))\r\nprint([x//2,-1][x%2])", "s = input()\r\n\r\nif len(s)%2:\r\n print(-1)\r\nelse:\r\n a = s.count('U')\r\n b = s.count('D')\r\n c = s.count('L')\r\n d = s.count('R')\r\n\r\n x = abs(a - b)\r\n y = abs(c - d)\r\n\r\n if((x+y) % 2): print(-1)\r\n else: print((x+y)//2)", "str = input()\r\nif len(str) % 2:\r\n print(-1)\r\nelse:\r\n x, y = 0, 0\r\n for i in str:\r\n if i == 'R':\r\n x += 1\r\n elif i == 'L':\r\n x -= 1\r\n elif i == 'U':\r\n y += 1\r\n else:\r\n y -= 1\r\n print((abs(x) + abs(y)) // 2)\r\n", "s = input()\n\nans = -1\n\nif len(s) % 2 == 0:\n\tUD = abs(s.count(\"U\")-s.count(\"D\"))\n\tLR = abs(s.count(\"L\")-s.count(\"R\"))\n\t\n\tans = (UD+LR)//2\n\nprint(ans)", "move=input()\r\nif len(move)%2!=0:\r\n print(-1)\r\nelse:\r\n l=move.count('L')\r\n r=move.count('R')\r\n u=move.count('U')\r\n d=move.count('D')\r\n print((abs(u-d)+abs(l-r))//2)", "s=input()\r\nr=l=d=u=0\r\nfor i in s:\r\n if i=='R':\r\n r+=1\r\n if i=='L':\r\n l+=1\r\n if i=='D':\r\n d+=1\r\n if i=='U':\r\n u+=1\r\nif (u+d+r+l)%2==0:\r\n #print(\"u={},r={},l={},d={}\".format(u,r,l,d))\r\n if u==d and r==l:\r\n print(\"0\")\r\n else:\r\n print((abs(r-l)+abs(u-d))//2)\r\nelse:\r\n print(\"-1\")\r\n", "path = input()\r\n\r\nU = 0\r\nD = 0\r\nL = 0\r\nR = 0\r\n\r\nfor c in path:\r\n if c == 'U':\r\n U += 1\r\n elif c == 'D':\r\n D += 1\r\n elif c == 'L':\r\n L += 1\r\n else:\r\n R += 1\r\n\r\nif (U + D + L + R) % 2 == 1:\r\n print(-1)\r\n exit()\r\n\r\nm = min(U, D)\r\nU -= m\r\nD -= m\r\n\r\nm = min(L, R)\r\nL -= m\r\nR -= m\r\n\r\nprint(int((U + D + L + R) / 2))\r\n", "s = input()\r\nif len(s)%2 != 0:\r\n print('-1')\r\n exit()\r\nL = 0\r\nR = 0\r\nU = 0\r\nD = 0\r\nfor a in s:\r\n if a == 'L':\r\n L+=1\r\n elif a == 'R':\r\n R+=1\r\n elif a == 'D':\r\n D+=1\r\n else:\r\n U+=1\r\nrem_L_R = abs(L-R)\r\nrem_U_D = abs(U-D)\r\nprint(int(rem_U_D/2 + rem_L_R/2))", "s = input()\r\n\r\nif len(s) & 1:\r\n print(-1)\r\nelse:\r\n r = s.count('R')\r\n l = s.count('L')\r\n u = s.count('U')\r\n d = s.count('D')\r\n\r\n print((abs(r - l) + abs(u - d)) // 2)", "s=input()\r\nlen_s=len(s)\r\n\r\nif (len_s%2)==1:\r\n\tprint(-1)\r\n\texit()\r\n\r\ndirection=\"LRUD\"\r\ncounts=[0]*4\r\nfor i in s:\r\n\tcounts[direction.index(i)]+=1\r\nleft_right=abs(counts[0]-counts[1])\r\nup_down=abs(counts[2]-counts[3])\r\nmin=(left_right//2)+(up_down//2)\r\nif (left_right%2)==1:\r\n\tmin+=1\r\nprint(min)", "s=input()\r\nif(len(s)&1):\r\n\tprint(\"-1\")\r\nelse:\r\n\tL=s.count('L')\r\n\tR=s.count('R')\r\n\tU=s.count('U')\r\n\tD=s.count('D')\r\n\tprint(int(abs(L-R)/2+abs(U-D)/2))\r\n", "s = input()\r\nx = s.count(\"R\")-s.count(\"L\")\r\ny = s.count(\"U\")-s.count(\"D\")\r\nif x%2==0 and y%2==0 or x%2!=0 and y%2!=0:\r\n print((abs(x)+abs(y))//2)\r\nelse:\r\n print(-1)\r\n", "inp = input()\n\ndef left(coord):\n\treturn (coord[0]-1,coord[1])\n\ndef right(coord):\n\t return (coord[0]+1,coord[1])\n\ndef up(coord):\n return (coord[0],coord[1]+1)\n\ndef down(coord):\n return (coord[0],coord[1]-1)\n\ncoord = (0,0)\n\nif len(inp)%2!=0:\n\tprint('-1')\nelse:\n\tfor move in inp:\n\t\tif move == \"L\":\n\t\t\tcoord=left(coord)\n\t\tif move == \"R\":\n \tcoord=right(coord)\n\t\tif move == \"U\":\n\t\t\tcoord=up(coord)\n\t\tif move == \"D\":\n\t\t\tcoord=down(coord)\n\tprint(int((abs(coord[0])+abs(coord[1]))/2))\n", "s = input()\r\nif len(s) % 2:\r\n print(-1)\r\n exit()\r\nli = {'U': 0, 'D': 1, 'L': 2, 'R': 3}\r\ndr, dc = [1, - 1, 0, 0], [0, 0, -1, 1]\r\nr, c = 0, 0\r\nfor ch in s:\r\n r += dr[li[ch]]\r\n c += dc[li[ch]]\r\nprint((abs(r) + abs(c)) // 2)", "A = input()\r\nAL = []\r\n\r\nfor a in A:\r\n AL.append(a)\r\n\r\nL = AL.count('L')\r\nR = AL.count('R')\r\nD = AL.count('D')\r\nU = AL.count('U')\r\n\r\n\r\n\r\nif len(A) % 2 == 1:\r\n print('-1')\r\nelse:\r\n if L == R and D == U:\r\n print('0')\r\n else:\r\n if D > U:\r\n x = D - U\r\n else:\r\n x = U - D\r\n if L > R:\r\n y = L - R\r\n else:\r\n y = R - L\r\n\r\n print(int((x+y)/2))", "x=input()\r\nif(len(x)%2==1):\r\n print('-1')\r\nelse:\r\n print((abs(x.count('R')-x.count('L'))+abs(x.count('U')-x.count('D')))//2)\r\n", "from collections import Counter\r\n\r\ns = input()\r\n\r\nif len(s) % 2:\r\n print(-1)\r\nelse:\r\n c = Counter(s)\r\n print((abs(c['L'] - c['R']) + abs(c['U'] - c['D'])) // 2)", "S = input()\nu = 0\nd = 0\nr = 0\nl = 0\nfor s in S:\n if s == 'U':\n u += 1\n elif s == 'D':\n d += 1\n elif s == 'R':\n r += 1\n elif s == 'L':\n l += 1\nif len(S) % 2 != 0:\n print(-1)\n exit()\nans = 0\nans += (abs(u - d)) // 2\nans += (abs(r - l)) // 2\nif abs(u - d) % 2 != 0:\n ans += 1\nprint(ans)\n", "from math import ceil\r\n\r\np = input()\r\nif len(p) % 2 == 1:\r\n print(-1)\r\n exit()\r\nu = p.count(\"U\")\r\nd = p.count(\"D\")\r\nl = p.count(\"L\")\r\nr = p.count(\"R\")\r\nx, y = abs(r - l), abs(u - d)\r\nprint(ceil(x / 2 + y / 2))\r\n", "way=list(input())\r\nif len(way)%2==1:\r\n print (-1)\r\nelse:\r\n rast=0\r\n bala=0\r\n for i in way :\r\n if i ==\"R\":\r\n rast-=1\r\n elif i =='L':\r\n rast+=1\r\n elif i =='D':\r\n bala+=1\r\n else :\r\n bala-=1\r\n rast = abs(rast)\r\n bala = abs(bala)\r\n t= rast//2 + bala//2 +rast%2\r\n print (t)", "def memory(s):\r\n if len(s) % 2 == 1:\r\n return -1\r\n else:\r\n return (abs(s.count('R') - s.count('L')) + abs(s.count('U') - s.count('D'))) // 2\r\n\r\n\r\nt = input()\r\nprint(memory(t))\r\n", "s = input()\r\nif len(s) % 2 == 1:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n l, r = sorted([s.count(\"L\"), s.count(\"R\")])\r\n u, d = sorted([s.count(\"U\"), s.count(\"D\")])\r\n if (l+r) % 2 == 0:\r\n ans += ((l+r) // 2 - l) + ((u+d) // 2 - u)\r\n else:\r\n ans += ((l+r+1) // 2 - l) + ((u+d-1) // 2 - u)\r\n print(ans)", "commands = input()\r\nif len(commands) % 2 != 0:\r\n print(-1)\r\nelse:\r\n left_right = 0\r\n top_bot = 0\r\n for i in commands:\r\n if i == \"R\":\r\n left_right += 1\r\n elif i == \"L\":\r\n left_right -= 1\r\n elif i == \"U\":\r\n top_bot += 1\r\n elif i == \"D\":\r\n top_bot -= 1\r\n print((abs(top_bot) + abs(left_right))// 2)", "n = input()\r\nif len(n) % 2 == 1:\r\n print(-1)\r\nelse:\r\n u = n.count('U')\r\n d = n.count('D')\r\n l = n.count('L')\r\n r = n.count('R')\r\n if u > d:\r\n u -= d\r\n d = 0\r\n else:\r\n d -= u\r\n u = 0\r\n if r > l:\r\n r -= l\r\n l = 0\r\n else:\r\n l -= r\r\n r = 0\r\n rl = r+l\r\n up = u+d\r\n if rl % 2 == 0 and up % 2 == 0:\r\n print((rl+up)//2)\r\n else:\r\n print((rl//2)+up//2 + 1)\r\n ", "def main():\n arrow = input()\n l, r, u, d = 0, 0, 0, 0\n\n for char in arrow:\n if char == 'L':\n l += 1\n elif char == 'R':\n r += 1\n elif char == 'U':\n u += 1\n elif char == 'D':\n d += 1\n\n if (l + r + d + u) % 2 != 0:\n print(-1)\n return\n\n change = (abs(l - r) + abs(u - d)) // 2\n print(change)\n\n\nmain()", "\r\ns=input()\r\nx,y=0,0\r\nfor i in s:\r\n if i=='L':\r\n x+=1\r\n elif i=='R':\r\n x-=1\r\n elif i=='U':\r\n y+=1\r\n else:\r\n y-=1\r\nif (abs(x)+abs(y))%2!=0:\r\n print(-1)\r\nelse:\r\n print((abs(x)+abs(y))//2)", "s = list(input())\r\nver=hor=0\r\nfor i in range(len(s)):\r\n if s[i]=='U':\r\n ver+=1\r\n elif s[i]=='D':\r\n ver-=1\r\n elif s[i]=='L':\r\n hor+=1\r\n else:\r\n hor-=1\r\nif (abs(ver)+abs(hor))%2!=0:\r\n print(-1)\r\nelse:\r\n ans = (abs(ver)+abs(hor))//2\r\n print(ans) ", "s = input()\r\nif len(s) % 2 != 0:\r\n print(-1)\r\n exit()\r\nu, r = 0, 0\r\nfor i in range(len(s)):\r\n if s[i] == 'U':\r\n u += 1\r\n elif s[i] == 'D':\r\n u -= 1\r\n elif s[i] == 'R':\r\n r += 1\r\n else:\r\n r -= 1\r\n\r\nr = abs(r)\r\nu = abs(u)\r\nq = max(r, u) - min(r, u)\r\nmi = min(r, u)\r\nprint(q // 2 + mi)\r\n", "s = input()\r\nif len(s)%2==0:\r\n\td = {'R':0,'L':0,'U':0,'D':0}\r\n\tfor i in s:\r\n\t\td[i]+=1\r\n\r\n\tprint((abs(d['L']-d['R']) + abs(d['D']-d['U']))//2)\r\nelse:\r\n\tprint(-1)", "s = input()\r\nif len(s)%2 != 0 :\r\n print(-1)\r\nelse :\r\n l = s.count(\"L\")\r\n r = s.count(\"R\")\r\n u = s.count(\"U\")\r\n d = s.count(\"D\")\r\n m = abs(l-r)\r\n mm = abs(u-d)\r\n print(int(m/2+mm/2))", "cnt = []\r\nms = input()\r\ncnt+=[ms.count('U')]\r\ncnt+=[ms.count('D')]\r\ncnt+=[ms.count('R')]\r\ncnt+=[ms.count('L')]\r\nans = abs(cnt[0]-cnt[1])+abs(cnt[2]-cnt[3])\r\nif ans%2==1:\r\n print(-1)\r\nelse:\r\n print(ans//2)", "\r\ns=input()\r\ni=0\r\nx=0\r\ny=0\r\nwhile i<len(s):\r\n if s[i]==\"R\":\r\n x=x+1\r\n if s[i]==\"L\":\r\n x=x-1\r\n if s[i]==\"U\":\r\n y=y+1\r\n if s[i]==\"D\":\r\n y=y-1\r\n i=i+1\r\ni=-1\r\nif x<0:\r\n x=-x\r\nif y<0:\r\n y=-y\r\nx=x+y\r\nif x%2==0:\r\n print(x//2)\r\nelse:\r\n print(i)\r\n\r\n \r\n", "R, L, U, D = 0, 0, 0, 0\n\nfor c in input():\n if c == 'R':\n R += 1\n elif c == 'L':\n L += 1\n elif c == 'U':\n U += 1\n elif c == 'D':\n D += 1\n\ndiff_RL = abs(R-L)\ndiff_UD = abs(U-D)\n\nif (diff_RL % 2 == 0 and diff_UD % 2 == 0) or (diff_RL % 2 == 1 and diff_UD % 2 == 1):\n print((diff_RL+diff_UD) // 2)\nelse:\n print(-1)", "s=input()\r\nif len(s)%2:\r\n print(-1)\r\n exit()\r\nu=d=l=r=0\r\nfor i in range(len(s)):\r\n if s[i]=='U':\r\n u+=1\r\n elif s[i]=='D':\r\n d+=1\r\n elif s[i]=='L':\r\n l+=1\r\n else:\r\n r+=1\r\nif u<d:\r\n t=u\r\n u=d\r\n d=t\r\nif r<l:\r\n t=r\r\n r=l\r\n l=t\r\nif (u-d)%2:\r\n u+=1\r\n r-=1\r\nprint((u-d)//2+(r-l)//2)\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\ns = input()\r\nn = len(s)\r\nif n%2 != 0:\r\n print('-1')\r\n exit(0)\r\n\r\nx = 0\r\ny = 0\r\nfor i in range(n):\r\n if s[i] == 'U':\r\n y += 1\r\n elif s[i] == 'R':\r\n x += 1\r\n elif s[i] == 'D':\r\n y -= 1\r\n elif s[i] == 'L':\r\n x -= 1\r\nd = abs(x)+abs(y)\r\nprint(int(d/2))", "s = input()\r\nu,d,l,r = [s.count(x) for x in 'UDLR']\r\n\r\nud = abs(u-d)\r\nlr = abs(l-r)\r\nif len(s)%2:\r\n print (-1)\r\nelse:\r\n print (ud//2 + lr//2 + ud%2)", "s = input()\r\ncountr = 0\r\ncountu = 0\r\nfor i in s:\r\n\tif i == 'U':\r\n\t\tcountu += 1\r\n\telif i == 'D':\r\n\t\tcountu -= 1\r\n\telif i == 'R':\r\n\t\tcountr += 1\r\n\telse:\r\n\t\tcountr -= 1\r\nif (countr + countu) % 2 == 1:\r\n\tprint(-1)\r\nelse:\r\n\tprint((abs(countr) + abs(countu)) // 2)", "#!/usr/bin/python3\n\ns = input()\n\nif len(s) % 2 != 0:\n print(-1)\nelse:\n dy = s.count('U') - s.count('D')\n dx = s.count('R') - s.count('L')\n print((abs(dx) + abs(dy)) // 2)\n", "s=input()\nu=d=l=r=0\nfor i in range(len(s)):\n\tif(s[i]=='U'):\n\t\tu+=1\n\telif(s[i]=='D'):\n\t\td+=1\n\telif(s[i]=='L'):\n\t\tl+=1\n\telse:\n\t\tr+=1\nt1=abs(l-r)\nt2=abs(d-u)\nif((t1+t2)%2==0):\n\tprint((t1+t2)//2)\nelse:\n\tprint(\"-1\")\n", "s = input()\n\nif len(s)%2 == 0:\n x, y = 0, 0\n for ch in s:\n if ch == \"L\":\n x -= 1\n elif ch == \"R\":\n x += 1\n elif ch == \"U\":\n y += 1\n else:\n y -= 1\n print((abs(x)+abs(y))//2)\nelse:\n print(-1)\n\n\t\t \t \t \t \t \t\t \t\t\t \t \t \t\t \t \t\t", "import math\r\ns=str(input())\r\nif(len(s)%2!=0):\r\n print(-1)\r\nelse:\r\n count=0\r\n l=[]\r\n l[:0]=s\r\n p_1=l.count('R')\r\n p_2=l.count('L')\r\n p_3 = l.count('D')\r\n p_4 = l.count('U')\r\n print((abs(p_1-p_2)+abs(p_3-p_4))//2)\r\n\r\n\r\n", "'''\r\ndef main():\r\n from sys import stdin,stdout\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#10/9/22016-370.2\r\n#2\r\ndef main():\r\n from sys import stdin,stdout\r\n s=stdin.readline().strip().lower()\r\n if len(s) & 1:\r\n stdout.write('-1')\r\n else:\r\n x=0\r\n y=0\r\n for i in s:\r\n if i=='l':\r\n x-=1\r\n elif i=='r':\r\n x+=1\r\n elif i=='u':\r\n y+=1\r\n elif i=='d':\r\n y-=1\r\n stdout.write(str((abs(x)+abs(y))//2))\r\n \r\nif __name__=='__main__':\r\n main()\r\n", "data = input()\n[u, d, l, r] = [data.count(x) for x in [\"U\", \"D\", \"L\", \"R\"]]\n\nif len(data) % 2 != 0:\n print(\"-1\")\n exit()\n\nydiff = abs(u-d)\nxdiff = abs(l-r)\n\nprint ((ydiff + xdiff) // 2)", "s=list(input())\r\nd=s.count('D')\r\nl=s.count('L')\r\nr=s.count('R')\r\nu=s.count('U')\r\nif(len(s)%2!=0):\r\n print('-1')\r\nelse:\r\n print(int(abs(l-r)/2+abs(u-d)/2))\r\n", "s = input()\r\nl = 0\r\nr = 0\r\nu = 0\r\nd = 0\r\n\r\nif len(s) % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in s:\r\n if i == 'L':\r\n l += 1\r\n elif i == 'R':\r\n r += 1\r\n elif i == 'U':\r\n u += 1\r\n else:\r\n d += 1\r\n \r\n print(int((abs(l - r) + abs(u - d)) / 2))", "s=input()\r\nn=len(s)\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n a=s.count('U')\r\n b=s.count('D')\r\n c=s.count('L')\r\n d=s.count('R')\r\n if (a+b)%2==0:\r\n print(abs(a-b)//2+abs(c-d)//2)\r\n else:\r\n print(abs(a - b) // 2 + abs(c - d) // 2+1)", "def sol(s):\r\n if len(s) % 2 != 0:\r\n return -1\r\n lr = 0\r\n ud = 0\r\n for c in s:\r\n if c == 'L':\r\n lr -= 1\r\n elif c == 'R':\r\n lr += 1\r\n elif c == 'U':\r\n ud += 1\r\n elif c == 'D':\r\n ud -= 1\r\n return (abs(lr) + abs(ud)) // 2\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n print(sol(s))\r\n", "s=list(input())\r\nu=d=l=r=0\r\nfor x in s:\r\n if x=='R': r+=1\r\n if x=='U': u+=1\r\n if x=='L': l+=1\r\n if x=='D': d+=1\r\nud=abs(u-d)\r\nlr=abs(l-r)\r\nif (ud+lr)%2: print(-1)\r\nelse:\r\n if ud%2:\r\n print(ud//2+lr//2+1)\r\n else:\r\n print(ud//2+lr//2)", "l= list(input())\r\nu = abs(l.count('R') - l.count('L'))\r\nd = abs(l.count('U') - l.count('D'))\r\nt = 0\r\nt += min(u,d)\r\nif abs(u-d) %2 == 0:\r\n print(int(t+(abs(u-d)/2)))\r\nelse: print(-1)", "commands = input()\n\nnl = commands.count('L')\nnr = commands.count('R')\nnu = commands.count('U')\nnd = commands.count('D')\n\nif len(commands) % 2 != 0:\n print(-1)\nelse:\n dh = abs(nl - nr)\n dv = abs(nu - nd)\n if dh + dv == 0:\n print(0)\n elif dh % 2 == 0:\n print(dh // 2 + dv // 2)\n else:\n if dh < dv:\n dh, dv = dv, dh\n print((dh - 1) // 2 + (dv - 1) // 2 + 1)\n", "s=input()\r\nl=0\r\nu=0\r\nif len(s)%2==0:\r\n for i in range (len(s)):\r\n if(s[i]=='L'):\r\n l+=1\r\n if(s[i]=='R'):\r\n l-=1\r\n if(s[i]=='U'):\r\n u+=1\r\n if(s[i]=='D'):\r\n u-=1\r\n ans=abs(u)+abs(l)\r\n print (ans//2)\r\nelse:\r\n print (-1)\r\n ", "import sys\r\n\r\nf = sys.stdin\r\n#f = open(\"path.in\", 'r')\r\ns = f.readline().strip()\r\nif len(s) % 2 == 1:\r\n print(-1)\r\nelse:\r\n r,u = 0,0\r\n for c in s:\r\n if c == 'U':\r\n u += 1\r\n elif c == 'D':\r\n u -= 1\r\n elif c == 'R':\r\n r += 1\r\n else:\r\n r -= 1\r\n sum = abs(r) + abs(u)\r\n print(sum // 2)\r\n", "from math import *\r\n\r\ndef co(s,c):\r\n t=0\r\n for i in s:\r\n if c==i:\r\n t+=1\r\n return t\r\n\r\ns=input()\r\nif len(s)%2:\r\n print(-1)\r\nelse:\r\n\ta=co(s,\"D\")\r\n\tb=co(s,\"U\")\r\n\tc=co(s,\"R\")\r\n\td=co(s,\"L\")\r\n\tif (a-b)%2:\r\n\t\tprint(int(fabs(a-b)//2+fabs(c-d)//2+1))\r\n\telse:\r\n\t\tprint(int(fabs(a-b)//2+fabs(c-d)//2))", "s = input()\r\nhSum, vSum = 0, 0\r\nh, v = 0, 0\r\nfor i in s:\r\n if i == \"R\":\r\n hSum += 1\r\n h += 1\r\n elif i == \"L\":\r\n hSum -= 1\r\n h += 1\r\n elif i == \"U\":\r\n vSum += 1\r\n v += 1\r\n else:\r\n vSum -= 1\r\n v += 1\r\n\r\nprint(-1 if (h + v) % 2 else (abs(hSum) + abs(vSum)) // 2)\r\n", "s=input()\r\nlc=s.count(\"L\")\r\nrc=s.count(\"R\")\r\ndc=s.count(\"D\")\r\nuc=s.count(\"U\")\r\nx=abs(lc-rc)+abs(uc-dc)\r\nif x&1:\r\n print(\"-1\")\r\nelse:\r\n print(x//2)", "s=input()\r\nif len(s)%2==1:print(-1)\r\nelse:\r\n u,d,r,l=s.count('U'),s.count('D'),s.count('R'),s.count('L')\r\n ud=u-d if u-d>0 else d-u\r\n rl=r-l if r-l>0 else l-r\r\n print((ud+rl)//2)", "\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\ns = STR()\r\n\r\nr = s.count('R')\r\nl = s.count('L')\r\nu = s.count('U')\r\nd = s.count('D')\r\n\r\nif r == l and u == d :\r\n print('0')\r\n exit(0)\r\n\r\nif len(s) % 2 != 0 :\r\n print('-1')\r\n exit(0)\r\n\r\ncnt = 0\r\n\r\nx = min(r , l)\r\nr-= x\r\nl-=x\r\n\r\ny = min(u , d)\r\nu-=y\r\nd-=y\r\n\r\nz = l + r + d + u\r\ncnt += z // 2\r\n\r\nprint(cnt)\r\n\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip().decode())\r\nif len(s) % 2:\r\n ans = -1\r\n print(ans)\r\n exit()\r\nu = list(\"LRUD\")\r\nd = dict()\r\nfor i in range(4):\r\n d[u[i]] = i\r\ncnt = [0] * 4\r\nfor i in s:\r\n cnt[d[i]] += 1\r\nfor i in range(2):\r\n c = min(cnt[2 * i], cnt[2 * i + 1])\r\n cnt[2 * i] -= c\r\n cnt[2 * i + 1] -= c\r\nans = sum(cnt) // 2\r\nprint(ans)", "S = input()\r\nl = 0\r\nr = 0\r\nu = 0\r\nd = 0\r\nif len(S)%2!=0:\r\n print(-1)\r\nelse:\r\n for i in S:\r\n if i=='L':\r\n l+=1\r\n elif i=='R':\r\n r+=1\r\n elif i=='U':\r\n u+=1\r\n else:\r\n d+=1\r\n lr = abs(l-r)\r\n ud = abs(u-d)\r\n print(int((lr+ud)/2))\r\n", "s = input()\nif len(s) % 2 == 1:\n print(-1)\nelse:\n l = s.count('L')\n r = s.count('R')\n u = s.count('U')\n d = s.count('D')\n\n #print(l, r, u, d)\n\n\n tmp = min(l, r)\n l -= tmp\n r -= tmp\n\n tmp = min(u,d)\n d -= tmp\n u -= tmp\n\n count = 0\n\n for i in [l, r]:\n if i:\n count += i // 2\n if i%2:\n count += 1\n for i in [u, d]:\n if i:\n count += i//2\n\n print(count)\n\n\n\n\n\n \t \t \t \t \t\t \t\t \t \t \t\t" ]

[ "MOD = 10**9 + 7\n\ndef fast_power(b, k):\n if k == 1:\n return b\n if k == 0:\n return 1\n\n hk = k // 2\n half = fast_power(b, hk)\n\n if k % 2 == 0:\n return (half * half) % MOD\n else:\n return (half * half * b) % MOD\n\ndef mod_inv(a, m):\n return fast_power(a, m - 2)\n\ndef solve():\n X, K = map(int, input().split())\n\n if K == 0:\n return (X * 2) % MOD\n if X == 0:\n return 0\n\n tk = fast_power(2, K)\n\n tot = (tk * 2 * X - tk + 1)\n\n return tot % MOD\n\nif __name__ == \"__main__\":\n print(solve())\n\n", "x,k=map(int,input().split())\r\nrem=1000000007\r\nif(x==0):\r\n print(0)\r\nelse:\r\n print(((pow(2,k+1,rem)*(x%rem))%rem-(pow(2,k,rem)-1%rem)%rem)%rem)", "x,k = input().split(' ')\r\nx = int(x)\r\nk = int(k)\r\nif x == 0:\r\n print(0)\r\nelse:\r\n print((pow(2,k+1,1000000007)*x-pow(2,k,1000000007)+1)%1000000007)", "x,k=list(map(int,input().split()))\r\nmd=1000000007\r\nprint((pow(2,k+1,md)*x-pow(2,k,md)+1)%md if x>0 else 0)", "X, K = map(int, input().split())\r\nmod = 1000000007\r\nres = X*pow(2, K+1, mod)-pow(2, K, mod)+1;\r\nwhile(res < 0):\r\n res += mod\r\nif(X == 0):\r\n print(0)\r\nelse:\r\n print(res%mod)", "x,k=map(int,input().split())\r\nm=10**9+7\r\nprint((x*pow(2,k+1,m) -pow(2,k,m) +1) %(m)) if x >0 else print(0)", "MOD = 10**9 + 7\r\nx,k=map(int,input().split())\r\nif x!=0:\r\n a1=pow(2,k+1,MOD)\r\n b1=pow(2,k,MOD)\r\n print((a1*x - b1 +1)%MOD)\r\nelse :\r\n print(0)", "x, k = (int(x) for x in input().split())\nmod = 10 ** 9 + 7\nif x == 0:\n print(0)\n exit()\nif k == 0:\n print(2 * x % mod)\n exit()\n\n# twopow = pow(2, k, mod)\nans = pow(2, k + 1, mod)\nans *= x\nans %= mod\nans -= pow(2, k, mod)\nans += 1\nans %= mod\nans += mod\nans %= mod\n\nprint(ans)\n", "def main():\r\n x, k = list(map(int, input().split()))\r\n if x == 0:\r\n print(0)\r\n return 0\r\n def helper(n):\r\n if n == 0:\r\n return 1\r\n p = 1\r\n ret = 2\r\n while n >= 2 * p:\r\n p *= 2\r\n ret = (ret ** 2) % 1000000007\r\n return ret * helper(n - p)\r\n x = x % 1000000007\r\n k = k % 1000000006\r\n a = helper(k)\r\n print((2 * a * x - a + 1) % 1000000007)\r\n return 0\r\nmain()\r\n", "mod = 10**9+7\r\nx,k = [int(x) for x in input().split()]\r\nif x ==0:\r\n print(0)\r\nelse:\r\n T = [1]\r\n for j in range(1024):\r\n T.append((2*T[-1])%(mod))\r\n L = [1]\r\n for i in range(10**6):\r\n L.append(((T[1024])*L[-1])%(mod))\r\n \r\n k =k % (mod-1)\r\n \r\n t1 = (k)%(1024)\r\n t2 =(k+1)%(1024)\r\n \r\n q1 = k//(1024)\r\n q2 =(k+1)//(1024)\r\n \r\n A = (L[q2]*T[t2])%(mod)\r\n A *= x\r\n A = A % (mod)\r\n \r\n B = (L[q1]*T[t1])%(mod)\r\n \r\n print((A-B+1)%(mod))\r\n", "M = 1000000007\r\nx, k = map(int,input().split())\r\nif x==0:\r\n print(0)\r\nelse:\r\n print(((pow(2,k+1,M)*x)%M - pow(2,k,M) +1 ) % M) \r\n", "from sys import stdin\r\nx, k = map(int, stdin.readline().split())\r\nif x == 0:\r\n\tprint(0)\r\nelse:\r\n\tmod = 1000000007\r\n\ta = pow(2,k,mod)%mod\r\n\tb = (2*a)%mod\r\n\tprint((((((x%mod)*(b%mod))%mod)-(a%mod)+1)+mod)%mod)", "mod = 1000000000+7\r\ndef fp(x ,y):\r\n if y == 1:\r\n return x\r\n if y == 0:\r\n return 1\r\n t = fp(x,y//2)%mod\r\n if y%2 == 1:\r\n return (t*t*x)\r\n else:\r\n return (t*t)\r\n\r\ndef inv(x):\r\n return fp(x%mod,mod-2)%mod\r\n\r\nn,k=list(map(int,input().split()))\r\nif not n:\r\n print(0)\r\n exit()\r\nif not k:\r\n print( (2*n)%mod )\r\n exit()\r\nnumberOfPro =fp(2,k)\r\nlast = n*numberOfPro\r\nfirst = (n-1)*numberOfPro+1\r\nsumOfLast = (last)*(last+1)*inv(2)\r\nsumOfFirst = first*(first-1)*inv(2)\r\nnum = 2*(sumOfLast - sumOfFirst)*inv(numberOfPro)\r\nprint(num%mod)\r\n", "x, k = map(int, input().split())\r\nmod = 10 ** 9 + 7\r\nans = pow(2, k, mod) * (2 * x - 1) + 1\r\nprint(ans % mod if x else 0)", "n,k = map(int,input().split())\r\nM = 1000000007\r\nif(n == 0):\r\n print(0)\r\nelse:\r\n ans = 2*n - 1\r\n x = pow(2,k,M)\r\n print((((ans * x) % M) + 1) % M)", "x,k=map(int,input().split())\r\nif x==0:print(\"0\")\r\nelse:\r\n ans=(x*pow(2,k+1,10**9+7)-pow(2,k,10**9+7)+1)%(10**9+7)\r\n print(ans)\r\n", "import math\r\nx, k = list(map(int, input().split()))\r\nmod = 10**9 + 7\r\nprint((pow(2, k+1, mod)*x - pow(2, k, mod) + 1) % mod if x > 0 else 0)\r\n", "x, k = list(map(int, input().split()))\r\nmod = 1000000007\r\nprint((pow(2, k+1, mod) * x - pow(2, k, mod) + 1) % mod if x > 0 else 0)", "x,k = map(int, input().split())\r\nmod = 1000000007\r\nflag = True\r\nif x==0:\r\n flag=False\r\nif flag:\r\n print((pow(2,k+1,mod)*x-pow(2,k,mod)+1+mod)%mod)\r\nelse:\r\n print(0)\r\n", "x, k = map(int, input().split())\r\nmod = 10**9+7\r\nif x==0:\r\n print(0)\r\nelse:\r\n p = pow(2, k, mod)\r\n res = (((2*x)%mod + mod - 1)%mod)\r\n res = ((res*p)%mod + 1)%mod\r\n print(res)\r\n", "x,k = map(int, input().strip().split())\r\nc = False\r\nif x == 0:\r\n print (0)\r\n c = True\r\nm = 1000000007\r\nx = x % m\r\np = pow(2,k,m)\r\nx = x*p\r\ny = (x-p+1)%m\r\nx = x%m\r\nif c == False:\r\n print((x+y)%m)", "MOD = 10**9 + 7\n\nx, k = map(int, input().split())\n\nif not x:\n print(0)\n\nelse:\n aux = pow(2, k, MOD)\n resp = (aux * 2 * x) - aux + 1\n \n print(resp % MOD)\n# 1536880544792\n", "import io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\ndef power(a,b,z):\r\n if b==0:\r\n return 1\r\n temp=power(a,b//2,z)\r\n if b%2==0:\r\n return (temp*temp)%z\r\n return (a*temp*temp)%z\r\nx,k=list(map(int,input().split()))\r\nif x==0:\r\n print(0)\r\nelse:\r\n z=(10**9)+7\r\n n=(power(2,k+1,z)*x)%z\r\n m=power(2,k,z)\r\n print((n-m+1)%z)", "x, k = list(map(int,input().split()))\r\nm = 10**9 + 7\r\nif x==0:\r\n print(0)\r\nelse:\r\n print((pow(2,k+1,m)*x - pow(2,k,m)+1) % m)", "\r\nx,k = map(int,input().split())\r\nm = 10**9 + 7\r\nif x == 0:\r\n print(0)\r\n exit()\r\nprint(((pow(2,k,m)*((x-1)%m))%m+(pow(2,k,m)*(x)%m)%m + 1%m)%m)\r\n\r\n\r\n\r\n", "x,k=map(int,input().split())\r\nprint(((pow(2,k,1000000007)*((2*x-1)%1000000007))%1000000007+1)%1000000007 if x!=0 else 0)\r\n", "MOD=1000000007\n\ndef subtract(a, b):\n\tif b>a: \n\t\ta+=MOD\n\treturn (a-b)%MOD\n\ndef multiply(a, b):\n\treturn (a * b) % MOD\n\ndef mpow(a, b):\n\tret = 1\n\twhile b is not 0:\n\t\tif b & 1: \n\t\t\tret = multiply(ret, a)\n\t\ta = multiply(a, a)\n\t\tb = b >> 1\n\treturn ret\n\ni=input('')\n[x, k]=[int(z) for z in i.split(' ')]\nif x is 0: \n\tprint(0)\nelse:\n\tans = multiply(x, mpow(2, k+1))\n\ttemp = mpow(2, k)\n\ttemp = subtract(temp, 1)\n\tans = subtract(ans, temp)\n\tprint(int(ans))", "x, k = map(int,input().split())\r\nprint((1+(2*x-1)*pow(2,k,10**9+7))%(10**9+7) if x>0 else 0)", "import sys\r\nMOD = int(1e9+7)\r\nx, k = map(int, input().split())\r\nif x == 0:\r\n print(x)\r\n sys.exit()\r\nx = pow(2,k+1,MOD)*x - pow(2,k,MOD) + 1 \r\nx %= MOD\r\nprint(x)" ]

[ "n = int(input())\r\narr = (map(int, input().split()))\r\nres = 0\r\nfor x in arr:\r\n res = res + x % 2\r\n \r\nfinalres = min(n - res, res)\r\nres = res - finalres\r\nfinalres = finalres + res // 3\r\nprint(finalres)", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\noddd = 0\r\nevend = 0\r\n\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n oddd += 1\r\n else:\r\n evend += 1\r\nif evend == 0:\r\n print(0)\r\nelse:\r\n if oddd == 0:\r\n print(evend // 3)\r\n else:\r\n if oddd < evend:\r\n print(oddd + (evend - oddd) // 3)\r\n else:\r\n print(evend)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nq = [0] * 2\r\n\r\nfor i in range(n):\r\n q[a[i] % 2] += 1\r\n\r\nx = min(q[0], q[1])\r\n\r\nq[0] -= x\r\nq[1] -= x\r\n\r\nprint(x + q[1] // 3)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nodd = [0, 0]\r\nfor i in range(n):\r\n odd[a[i] % 2] += 1\r\nans = min(odd)\r\nans += int((odd[1] - ans) / 3)\r\nprint(ans)", "n = u = o = 0\r\ncnt=0\r\nn = int(input())\r\ni = 0\r\nx = input()\r\nx=x+' ';\r\nwhile (cnt<n):\r\n if(x[i] is ' '):\r\n i+=1;\r\n continue\r\n else:\r\n a = int(x[i])\r\n if (x[i+1]is' '):\r\n if(a%2==0):\r\n u+=1\r\n else:\r\n o+=1\r\n cnt+=1\r\n i+=1\r\nans = min(u,o)\r\nu-=ans\r\no-=ans\r\nans+=int(o/3)\r\nprint(ans)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nfor i in range(n):\r\n if l[i]%2==1:\r\n odd+=1\r\n else:\r\n even+=1\r\n \r\nif even>=odd:\r\n print(odd)\r\nelse:\r\n print(even+(odd-even)//3)", "n = int(input())\r\nf = list(map(int, input().split()))\r\n \r\ncnt1 = 0\r\ncnt2 = 0\r\n \r\nfor i in range(n):\r\n if (f[i]%2!=0):\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\n \r\nif (cnt1 <= cnt2):\r\n print(cnt1)\r\nelse:\r\n print(cnt2 + (cnt1-cnt2)//3)", "a=int(input())\r\ni=0\r\ncnta=0\r\ncntb=0\r\nb=input().split( )\r\nwhile i < a:\r\n b[i]=int(b[i])\r\n if (b[i]%2==0):\r\n cnta+=1\r\n else:\r\n cntb+=1\r\n i+=1\r\nif (cnta<cntb):\r\n print(int(cnta+(cntb-cnta)/3))\r\nelse:\r\n print(cntb)", "input()\na = [int(i) % 2 for i in input().split()]\no, e = a.count(1), a.count(0)\nprint(e+(o-e)//3 if o and o>e else o)\n", "import sys\r\n\r\nnum = int(sys.stdin.readline())\r\nfl = map(int, sys.stdin.readline().split())\r\n\r\nodd = 0\r\neven = 0\r\n\r\nfor f in fl:\r\n if (f % 2):\r\n odd += 1\r\n else:\r\n even += 1\r\n\r\nres = min(even, odd)\r\nodd -= even\r\nif (odd > 0):\r\n res += odd // 3\r\n\r\nprint(res)\r\n", "n=input()\r\nlis=input().split()\r\nans=0\r\ncnt=0\r\ncnt1=0\r\ncnt2=0\r\nfor i in range(len(lis)):\r\n lis[i]=int(lis[i])\r\n if lis[i]%2==0:\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\n \r\n \r\nif cnt1==0:\r\n ans=int(cnt2/3)\r\nelif cnt2==0:\r\n ans=0\r\nelse:\r\n if cnt1>=cnt2:\r\n ans=cnt2\r\n else:\r\n ans=cnt1\r\n cnt2-=cnt1\r\n ans+=int(cnt2/3)\r\n \r\nprint(ans)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\no,e=0,0\r\nfor i in arr:\r\n if i%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\nif e>=o:\r\n print(o)\r\nelse:\r\n o-=e\r\n print(e+o//3)\r\n ", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput = stdin.readline\r\n# ~ T = int(input())\r\nT = 1\r\nfor t in range(1,T + 1):\r\n\tn = int(input())\r\n\t_input = list(map(int,input().split()))\r\n\teven_count = 0; odd_count = 0\r\n\tfor i in _input:\r\n\t\teven_count += (i % 2 == 0)\r\n\t\todd_count += (i & 1)\r\n\tprint(int(min(even_count,odd_count) + ((odd_count - min(even_count,odd_count)) / 3)))\r\n", "def solve_task7():\r\n n = int(input())\r\n flowers = [int(el) for el in input().split(\" \")]\r\n divisible = 0\r\n non_divisible = 0\r\n for el in flowers:\r\n if el % 2 == 0:\r\n divisible += 1\r\n else:\r\n non_divisible += 1\r\n return min(divisible, non_divisible) if divisible >= non_divisible else divisible + (\r\n (non_divisible - divisible) // 3)\r\n\r\n\r\nresult = solve_task7()\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nodd = even = 0\r\nfor number in a:\r\n odd += number % 2\r\neven = len(a) - odd\r\nprint(min(odd, even) + (odd - min(odd, even)) // 3)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\nfor i in range(n):\r\n if (a[i]%2 == 1):\r\n odd += 1\r\n else:\r\n even += 1\r\nmaxcount = 0\r\nfor i in range(n):\r\n currCount = odd\r\n if even < odd:\r\n currCount = even\r\n if currCount > maxcount:\r\n maxcount = currCount\r\n odd -= 2\r\n even += 1\r\nprint(maxcount)", "import math\r\nn=int(input())\r\nval = list(map(int, input().split()))\r\neven=int(0)\r\nodd=int(0)\r\nfor i in range (n):\r\n if(val[i]%2==0):\r\n even+=1\r\n else :\r\n odd+=1\r\nans=int(0)\r\nans+=min(even,odd)\r\ntt=min(even,odd)\r\neven-=tt\r\nodd-=tt\r\nif(odd>=3):\r\n ans+=(int(odd/3))\r\nprint(ans)\r\n", "while True:\r\n n=int(input())\r\n flowers=input().split()\r\n\r\n odds=0\r\n evens=0\r\n\r\n for x in flowers:\r\n if int(x)%2 == 0:\r\n evens+=1\r\n\r\n else:\r\n odds+=1\r\n\r\n if evens>=odds:\r\n\r\n print(odds)\r\n\r\n else:\r\n\r\n print(evens + (odds-evens)//3)\r\n\r\n break\r\n\r\n## so easy but already submitted a python solution ...\r\n", "import sys\r\nread = lambda: sys.stdin.readline().strip()\r\nreadi = lambda: map(int, read().split())\r\nfrom collections import *\r\n\r\nn = int(read())\r\nnums = list(readi())\r\n\r\nodds = 0\r\nfor num in nums:\r\n if num & 1 == 1:\r\n odds += 1\r\n\r\nans = 0\r\nans += min(odds, n - odds)\r\nodds -= ans\r\n\r\nans += odds // 3\r\n\r\nprint(ans)", "odd = [ ]\r\neven = [ ]\r\nx = int(input())\r\nli = list(map(int,input().split()))\r\nfor i in li:\r\n if i % 2 : odd.append(i)\r\n else: even.append(i)\r\nlnodd , lneven = len(odd) , len(even)\r\nif lnodd > lneven: \r\n odd2 = lnodd - lneven \r\n odd2 = odd2//3\r\n print(lneven+odd2)\r\nelse: print(lnodd)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = 0\r\nc = 0\r\nfor i in a:\r\n if i % 2 == 0:\r\n b += 1\r\n else:\r\n c += 1\r\nd = min(b, c)\r\nb -= d\r\nc -= d\r\nif c <= 0:\r\n print(d)\r\nelse:\r\n f=c//3\r\n d+=f\r\n print(d)", "n = int(input())\r\na = list(map(int,input().split()))\r\neven =0\r\nodd =0\r\nfor v in a:\r\n if v&1:\r\n odd+=1\r\n else:\r\n even +=1\r\n\r\nans = min(even,odd)\r\nif odd>even:\r\n odd-=even\r\n ans += odd//3\r\nprint(ans)", "import math\r\nfrom typing import List, Any\r\n\r\nn = input()\r\narr = input().split(\" \")\r\nodd = 0\r\neven =0\r\nfor i in range(len(arr)):\r\n if int(arr[i])%2 != 0 :\r\n odd+=1\r\n else:\r\n even+=1\r\nmn = min(odd,even)\r\nr = mn\r\neven-=mn\r\nodd-=mn\r\nr+=math.floor(odd/3)\r\nprint(math.floor(r))\r\n", "N = input()\r\n\r\nB = [int(i) for i in input().split()]\r\n\r\na, b = 0, 0\r\n\r\nfor i in B:\r\n\tif i % 2 == 0:\r\n\t\tb = b + 1\r\n\telse:\r\n\t\ta = a + 1\r\n\r\n\r\nif a <= b:\r\n\tprint(a)\r\nelse:\r\n\ta = a - b\r\n\tprint(b + a//3)", "n = int(input())\r\no = sum([ int(x) % 2 for x in input().split() ])\r\nz = n - o\r\n\r\nprint(min(o, z) + (o - min(o, z)) // 3)\r\n", "n=int (input())\r\na = list(map(int, input().split()))\r\nk=0\r\nd=0\r\nfor i in range(n):\r\n if a[i]%2==1:\r\n k+=1\r\n else:\r\n d+=1\r\n if k<d:\r\n ma=k\r\n else:\r\n ma=d\r\nwhile (k>2):\r\n k-=2\r\n d+=1\r\n if (k<d):\r\n if k>ma:\r\n ma=k\r\n else:\r\n if d>ma:\r\n ma=d\r\nprint(ma)", "n=int(input())\r\na=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nc=0\r\nfor i in a:\r\n if i%2==0:\r\n even+=1\r\n elif i%2==1:\r\n odd+=1\r\n if odd >=1 and even >=1:\r\n c+=1\r\n odd-=1\r\n even-=1\r\nwhile odd >=3:\r\n odd-=3\r\n c+=1\r\nprint(c)\r\n\r\n", "s=0;\r\nq=0;\r\nn = int(input());\r\nqq=0;\r\nw = str(input());\r\nw1=w.split()\r\n\r\nwhile qq<n:\r\n qwe=int(w1[qq]);\r\n if (qwe%2==0):\r\n s=s+1;\r\n else:\r\n q=q+1\r\n qq = qq + 1;\r\n\r\nif q<=s:\r\n print(q);\r\nelse:\r\n print(s+(q-s)//3)", "R = lambda:list(map(int,input().split()))\r\nR()\r\na = R()\r\no=0\r\ne=0\r\nans=0\r\nfor x in a:\r\n if x%2 == 0:\r\n e+=1\r\n if x%2 == 1:\r\n o+=1\r\nif o <= e:\r\n print(o)\r\nelse:\r\n while o-e>1:\r\n o-=2\r\n e+=1\r\n if o <= e:\r\n e=o\r\n print(e)", "n = int(input())\r\nodd = 0\r\neven = 0\r\nt = input().split(' ')\r\n\r\nfor i in range(0, n):\r\n x = int(t[i])\r\n if x % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nans = min(odd, even)\r\nodd -= ans\r\nans += odd // 3\r\nprint(ans)\r\n", "n = int(input())\ncnt = [0] * 2\nfor a in input().split():\n cnt[int(a)%2] += 1\nans = min(cnt[0], cnt[1])\ncnt[0] -= ans\ncnt[1] -= ans\nans += cnt[1] // 3\nprint(ans)\n", "n = int(input())\no = sum(map(lambda x: int(x) & 1, input().split()))\ne = min(n - o, o)\no -= e\nprint(e + o // 3)\n", "n=int(input())\r\ns=input().split()\r\nc1=0\r\nfor i in s:\r\n el=int(i)\r\n c1+=el&1\r\nc2=n-c1\r\nres=min(c1,c2)\r\nwhile(c1>=2):\r\n c1-=2\r\n c2+=1\r\n res=max(res,min(c1,c2))\r\nprint(res)\r\n", "def min(a, b):\r\n if a >= b:\r\n return b\r\n else:\r\n return a\r\n\r\nb = 0\r\nn = int(input())\r\na = input().split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n b += 1\r\nc = n - b\r\nans = min(b, c)\r\nif b < c:\r\n ans += ((c - b) // 3)\r\nprint(ans)\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\nodds = 0\r\nfor a in A:\r\n if a%2:\r\n odds+=1\r\nif N-odds>=odds:\r\n exit(print(odds))\r\n\r\nans = N-odds\r\nans+=(odds-ans)//3\r\nprint(ans)\r\n \r\n", "input()\na = [int(i) % 2 for i in input().split()]\nodd, even = a.count(1), a.count(0)\nif odd and odd>even:\n\tprint(even+(odd-even)//3)\nelse:\n\tprint(odd)\n", "n = int(input())\r\nflowers = input().split()\r\nodd = 0\r\nott = 0\r\nfor val in flowers:\r\n if int(val) % 2 == 0:\r\n odd += 1\r\n else:\r\n ott += 1\r\n\r\nwhile ott > odd + 2:\r\n ott -= 2\r\n odd += 1\r\n \r\nprint(min(odd, ott))\r\n", "n = int(input())\r\narr = [int(z) for z in input().split()]\r\n\r\no, e = 0, 0\r\nfor i in arr:\r\n if i % 2:\r\n o += 1\r\n else:\r\n e += 1\r\n\r\nb = min(o, e)\r\n\r\nb += max(0, o - e) // 3\r\n\r\nprint(b)\r\n", "n = int(input())\r\nch = 0\r\nnech = 0\r\nline = input().split(' ')\r\nfor i in range(0, n):\r\n\ttemp = int(line[i])\r\n\tif temp % 2 == 0:\r\n\t\tch+=1\r\n\telse:\r\n\t\tnech+=1\r\nan = 0\r\nif ch < nech:\r\n\tan = ch\r\nelse:\r\n\tan = nech\r\nnech -= an\r\nan += int(nech/3)\r\nprint(an)", "n = int(input())\r\n\r\nlst = [int(i) % 2 for i in input().split()]\r\n\r\ns = sum(lst)\r\n\r\nif s <= n - s:\r\n print(s)\r\nelse:\r\n print(n - s + (2 * s - n) // 3)\r\n", "N = int(input())\r\nA = list(map(int,input().split()))\r\na,b = 0,0\r\n\r\nfor i in A:\r\n if i%2==0:\r\n a+=1\r\n else:\r\n b+=1\r\nans=min(a,b)\r\nb-=min(a,b)\r\nprint(ans+b//3)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\nfor x in nums:\r\n if(x%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\nres = min(odd, even)\r\nodd -= res\r\neven -=res\r\nres += odd//3\r\nprint(res)", "m=int(input())\r\neven=0\r\nodd=0\r\nans=0\r\nstr=input()\r\nnum = [int(n) for n in str.split()]\r\nfor i in range(m):\r\n if num[i]%2==1:\r\n odd+=1\r\n else:\r\n even+=1\r\nwhile odd>0:\r\n if even==0:\r\n ans+=odd//3\r\n odd=0\r\n elif odd>even:\r\n ans+=even\r\n odd-=even\r\n even=0\r\n else:\r\n ans+=odd\r\n odd=0\r\nprint (ans)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\nodd = 0\r\nfor x in a:\r\n if x % 2 == 1:\r\n odd += 1\r\n\r\neven = n - odd\r\nres = min(odd, even)\r\nres += (odd - res) // 3\r\n\r\nprint(res)", "n = int(input())\r\nmas = map(int, input().split())\r\n\r\nodd = 0\r\neven = 0\r\nfor i in mas:\r\n if i%2 == 0:\r\n even = even+1\r\n else:\r\n odd = odd+1\r\n\r\nans = min(odd, even)\r\nodd = odd - ans\r\nans+= int(odd/3)\r\nprint(ans)", "n = int(input())\r\nq = 0\r\na = input().split(' ')\r\nfor i in range(0, n):\r\n b = int(a[i])\r\n if (b % 2 == 1):\r\n q = q + 1\r\np = n - q\r\nans = q\r\nif q > p:\r\n ans = p;\r\n q -= p;\r\n ans += q // 3;\r\nprint(ans)\r\n", "x = int(input())\r\narr = list(map(int,input().split()))\r\nodd,even= 0,0\r\nfor i in arr:\r\n if i%2:\r\n odd+=1\r\n else:\r\n even+=1\r\nif (odd and even) or odd//3:\r\n if even<=odd:\r\n ans = even\r\n odd-=even\r\n ans +=odd//3\r\n else:\r\n ans = odd\r\n print(ans)\r\nelse:\r\n print(0)", "n = int(input())\ne = sum(~int(i)&1 for i in input().split())\nprint(e+(n-e-e)//3 if n-e and n>e+e else (n-e))\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nev=0\r\nod=0\r\nfor i in lis:\r\n if i%2==0:\r\n ev+=1\r\n else:\r\n od+=1\r\nout=min(od,ev)+(od-min(od,ev))//3\r\nprint(out)\r\n", "import math\r\n\r\nn = int(input())\r\na = input().split()\r\nodd = 0\r\neven = 0\r\nans = 0\r\n\r\nfor i in range (n):\r\n if int(a[i]) % 2 == 1:\r\n odd = odd + 1\r\n else:\r\n even = even + 1\r\n \r\nif even > odd:\r\n print(odd)\r\nelse:\r\n print((even) + math.floor((odd - even)/3))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nx = 0 \r\nfor i in range(0, n):\r\n\tif a[i] % 2==1:\r\n\t\tx = x + 1\r\ncnt = n - x\r\nif cnt > x: \r\n\tcnt=x\r\nx = x - (n - x)\r\nif x > 0:\r\n\tcnt += int(x / 3)\r\nprint (cnt)", "n = int(input(\"\"))\neven = 0\nodd = 0\nls = map(int, input(\"\").split(' '))\nfor i in ls:\n if i % 2 == 0:\n even += 1\n else:\n odd += 1\nans = 0\nwhile even > 0 and odd > 0:\n ans += 1\n even -= 1\n odd -= 1\nans += int(odd / 3);\nprint(ans)", "from math import *\r\nn = int(input())\r\nc=0;\r\nnc=0;\r\nk = input().split(\" \")\r\nfor i in range(n):\r\n if (int(k[i]) % 2 == 0):\r\n c = c + 1\r\n else:\r\n nc = nc + 1\r\ntt = min(c, nc) + max(0, nc - min(c, nc))//3\r\nprint(tt)", "n = input()\nflowers = input().split(\" \")\nodd = 0 \neven = 0\nfor i in flowers :\n\tif (int(i)%2 == 0) :\n\t\teven += 1\n\telse :\n\t\todd += 1\nif (even < odd) :\n\tprint(int(even + ((odd-even)/3)))\nelse :\n\tprint(odd)\n", "n = input()\r\nodd = 0\r\neven = 0\r\nfor a in map(int, input().split()):\r\n if a % 2 == 1:\r\n odd += 1\r\n else:\r\n even += 1\r\nif even > odd:\r\n print(odd)\r\nelse:\r\n print(even + (odd - even) // 3)\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nodd, even = 0, 0\r\nfor number in numbers:\r\n if number%2==0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nans = min(odd, even)\r\nodd -= ans\r\neven -= ans\r\n\r\nans += odd // 3\r\n\r\nprint(ans)", "n = int(input())\neven = 0\nodd = 0\narr = input()\nl = list(map(int, arr.split(' ')))\nfor x in l:\n if (x % 2 == 0):\n even += 1\n else:\n odd += 1\n\nrs = min(even, odd)\neven -= rs\nodd -= rs\nrs += int(odd / 3)\n\nprint(rs) \n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nr1 = [i for i in mas if i % 2 == 0]\r\nr2 = [i for i in mas if i % 2 != 0]\r\nr1 = len(r1)\r\nr2 = len(r2)\r\nif min(r1, r2) == r2:\r\n k = r2\r\nelse:\r\n k = r1 + ( (r2 - r1) //3)\r\nprint(k)", "nec=c=ans=0\ndef Sort(x):\n global c, nec\n s = int(x) % 2 == 0\n if s: c += 1\n else: nec += 1\n return s\n\na = input()\nList=list(map(Sort,input().split()))\n\n\nif nec:\n if not c:\n print(nec//3) \n else:\n n = min(nec, c)\n ans += n\n nec -= n\n c -= n\n if nec:\n ans += nec//3\n print(ans)\n else:\n print(ans)\n \nelse:\n print(0)", "n=int(input())\r\na = [int(i) % 2 for i in input().split()]\r\nodd, even = a.count(1), a.count(0)\r\nif odd and odd>even:\r\n\tprint(even+(odd-even)//3)\r\nelse:\r\n\tprint(odd)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = ans1 = 0\r\nfor number in a:\r\n if(number % 2 == 0):\r\n ans += 1\r\n else:\r\n ans1 += 1\r\nprint(max(min(ans, ans1) + (ans1 - min(ans, ans1)) // 3, ans1 // 3 + min(ans1 % 3, ans)))\r\n" ]

[ "sym_trans = [1, 3, 10, 37, 151, 674, 3263, 17007, 94828, 562595, 3535027, 23430840, 163254885, 192059216, 97183539, 384727153, 211932162, 665362848, 415709078, 654959364, 894067657, 839120000, 627072923, 586774033, 440165789, 840647542, 118441546, 505992682, 607243387, 93527420, 378847836, 948139661, 770183251, 365355663, 989344183, 548640276, 317289217, 997901123, 159164073, 843138878, 532150136, 738186543, 903861313, 682196381, 973969945, 132955760, 252975343, 448800686, 260473966, 172364334, 974776377, 897990701, 517201033, 576838003, 99444281, 227668527, 276751933, 925606182, 183971202, 872834804, 675567482, 485151063, 90425806, 573944639, 319383684, 228218188, 853465612, 413776522, 234312776, 696953174, 561359388, 614568659, 310760116, 308156021, 643857743, 130527569, 21545623, 861347933, 160875480, 265384023, 880663120, 642768069, 283279971, 101569565, 642645431, 549146203, 962813505, 943728849, 409246814, 285130248, 71857567, 876844125, 639794356, 718486712, 669604188, 215716321, 617971855, 139675728, 757688910, 320249104, 621227957, 8420956, 210511678, 237853303, 571777940, 124824068, 554160360, 861653403, 682637480, 231939767, 18101111, 899784402, 38539461, 459245274, 133368830, 794361288, 845364734, 411437479, 295388712, 946233522, 770525146, 9117720, 552920178, 575589233, 372629731, 386010446, 840661218, 620900095, 139503115, 511927381, 578357362, 64025286, 334338018, 50447285, 600060973, 463521109, 603848757, 124677320, 384555440, 124916527, 185672381, 489919006, 909579381, 138193225, 265871589, 754007856, 931017925, 530042754, 776962350, 693701991, 697550026, 65897729, 925178446, 524529822, 282186556, 906408203, 423821527, 235677618, 198401842, 739841724, 445468199, 551132246, 282892517, 598818617, 713743768, 323922897, 386628568, 474046790, 302658513, 783562521, 701916176, 482177632, 681588349, 266655423, 743351863, 319498248, 426746288, 89678205, 500650748, 546473898, 223152283, 841147627, 688890488, 901303731, 788610629, 829394955, 750389455, 745439788, 809252095, 287863106, 297473389, 52881575, 679729868, 61954094, 593572313, 142142337, 87045414, 702643022, 32976555, 517206126, 380236389, 828797589, 845005051, 422842060, 260455358, 651230866, 488177154, 982371716, 172307030, 994127208, 259014259, 84243868, 148694890, 313032650, 79750143, 628177536, 256112757, 535578122, 7516872, 660259410, 862246837, 942873362, 525515969, 353458202, 517016061, 146128173, 615658629, 171576507, 313485249, 756862637, 740107237, 450464972, 698608957, 380461701, 788065795, 235055502, 488339779, 625468897, 81218153, 752562624, 954468821, 388408427, 220000770, 962611398, 138488797, 232824743, 623588948, 89320450, 5174417, 444171924, 539838147, 184946963, 829706030, 250353513, 837334003, 192637869, 954980409, 989726944, 503629638, 246128748, 144252879, 869972346, 159483785, 38149548, 399002531, 139867042, 702866700, 566004753, 303913805, 946274118, 352063038, 148918236, 344908939, 925123896, 175513960, 888310551, 233700316, 237128991, 80142095, 627539989, 30420961, 108486126, 993957197, 940173780, 407371015, 13694119, 969064311, 945245210, 515586500, 834646464, 210959252, 766474958, 237866830, 520123316, 83961446, 97878509, 896040082, 51406202, 612079312, 569120595, 325712093, 979110226, 72296197, 169538467, 506717757, 990725778, 888153398, 884672580, 747447278, 989585067, 197205447, 997554253, 162606658, 612854211, 585638351, 300385030, 648581707, 24645691, 142364491, 87271224, 656248353, 311752536, 345078260, 862509279, 749617553, 148690167, 255207879, 937517648, 692740850, 188651194, 442080602, 285711119, 523391595, 806719830, 122802835, 948147156, 825684063, 120090726, 465071065, 216239633, 955952822, 254936196, 818273287, 582823720, 838683603, 211078726, 609268949, 539236132, 461048619, 931162689, 575599737, 702129707, 929755292, 3165024, 932095281, 371965629, 560082406, 915331279, 404247953, 119029625, 650026279, 33911127, 542568006, 737311646, 839818392, 121381063, 81776121, 264049814, 428758250, 935258956, 524814024, 827629225, 159677867, 208903802, 254070037, 334398982, 852112879, 205126265, 581086872, 289728727, 749733927, 825622969, 203314518, 313219470, 714203321, 966360246, 415028559, 441541100, 64736522, 135298651, 311340818, 724308321, 852861846, 567399501, 818780718, 445445536, 185482874, 890679335, 117928565, 212566203, 217299615, 125999181, 478432188, 642522487, 657976604, 462229383, 930237021, 202402571, 859794210, 821285303, 193707191, 139635308, 949631508, 581555701, 493872210, 253862710, 156423352, 756876608, 453019810, 540238248, 525374182, 395165149, 552059946, 666018027, 218650948, 316154754, 567824223, 718412883, 959027290, 327709825, 416281152, 860382344, 503677292, 449112827, 426967024, 595415467, 755716122, 910210918, 495279146, 453103898, 539903326, 104084806, 171428406, 629857538, 238805628, 522091539, 904850095, 831383119, 364871289, 59654563, 188523918, 418555114, 248860166, 832365397, 779188603, 392396445, 763896392, 993974548, 375970645, 176183947, 455296206, 826990889, 44758036, 495683674, 791719842, 655621264, 658939366, 735144599, 275667277, 655999018, 965639168, 676574799, 346864447, 379511514, 459854791, 905913554, 604918364, 6920002, 652092992, 597377405, 920491194, 562313297, 482675638, 955706031, 63469748, 417878805, 240441437, 990705174, 289937758, 842452102, 258265727, 995663867, 792673745, 608833565, 729570088, 316539671, 559104003, 153929272, 607988017, 245598088, 490462484, 935463414, 309255995, 733478384, 499515550, 689830722, 849692817, 311550442, 635474783, 127169195, 910162202, 556279594, 843716880, 644338672, 555172441, 515997236, 135709697, 79038893, 557695690, 600886859, 838036451, 688243460, 80967535, 608159856, 174858889, 422157947, 441973358, 506853336, 687223249, 123283931, 645920250, 839276153, 765041805, 409869914, 291531081, 819585362, 902467908, 477747296, 528122783, 145373134, 454099129, 741569333, 626092036, 479879088, 369907895, 230044569, 505385342, 714902613, 875040101, 190473063, 872158769, 408884988, 455015252, 472359859, 31983119, 493209943, 310194407, 220499597, 452995259, 135106373, 178201213, 847019301, 990806426, 376403818, 58273490, 281675800, 520754800, 348121405, 425884587, 2386009, 487763288, 337156970, 997180386, 417075508, 864730872, 42921994, 871322813, 840211325, 364063966, 22525422, 600235, 193819034, 893790438, 426792415, 487326644, 543061001, 282015176, 157152541, 994468078, 884492307, 713444307, 579253748, 768509697, 992424572, 146763641, 846399754, 258078009, 128093022, 747576202, 755784458, 775371259, 738049893, 408147951, 30228860, 298205559, 841396697, 479705709, 89724340, 910693466, 917842511, 772248726, 925394143, 423016364, 940794131, 589937656, 12439416, 817505576, 5766321, 207335208, 205400856, 372008708, 188964921, 55224741, 517371213, 384078369, 338366732, 664331412, 865275333, 827065831, 804972385, 178748961, 191743352, 403004296, 927564052, 823868740, 257622825, 717878335, 446887176, 322169470, 269834524, 843929114, 27272298, 50378784, 522410690, 596183878, 451906315, 172190807, 733947210, 259460885, 833852491, 616714123, 951537680, 926805258, 813388867, 443303026, 291977683, 599670158, 238152294, 445689856, 936327374, 196240693, 364266010, 190436954, 155125524, 802286442, 86247911, 746915367, 812149761, 386697017, 156862662, 999227446, 614061595, 430319410, 14310047, 905615597, 730967460, 839536767, 566459999, 528830445, 488205273, 155119197, 977792541, 733620069, 789944551, 854917887, 212864273, 919407613, 737497548, 675470363, 478932389, 246699156, 251877523, 53345644, 261274483, 760124865, 50090062, 854981767, 791955534, 691459974, 389774782, 465159470, 569088844, 418118310, 342684204, 596536636, 249320348, 606857878, 713420778, 226131359, 388575274, 21911539, 474258973, 93797243, 644078757, 453826534, 403801164, 363533678, 992826772, 507750910, 373503532, 616791236, 264372059, 183581261, 750221171, 878155094, 936703585, 6652074, 251020568, 992659897, 368462422, 891650074, 750721486, 610629516, 709514492, 685833760, 579428558, 50900893, 773008170, 385305515, 823673055, 953225968, 603314440, 728148979, 232809574, 855455002, 295582086, 553846325, 476981256, 332957653, 63715908, 224273587, 51891906, 346473784, 104448776, 460060855, 136026344, 661137664, 469259167, 290470382, 86264866, 625481264, 739844065, 704844076, 372478787, 496577830, 165971165, 39385643, 676697182, 190393622, 920720064, 150178227, 939373600, 854086304, 830730341, 370885785, 789942972, 765401747, 766283645, 416945039, 523371177, 322970857, 646425052, 511694855, 736905288, 953415053, 560704652, 648860447, 428694301, 894447856, 841850834, 272571430, 678430160, 346541448, 767049503, 36077574, 679246151, 466003799, 733592729, 207171878, 650255964, 550391662, 53825240, 889883963, 12600784, 641017311, 291148361, 554976793, 797024191, 85490633, 229960755, 15970020, 565598371, 192019037, 703223903, 195449229, 64719321, 934602250, 799142123, 251430165, 887594806, 421911384, 545506631, 493870301, 996132354, 610717221, 171323729, 912266937, 320567831, 578485179, 307129662, 433491047, 21559367, 270948717, 441179537, 802388729, 910301331, 384072750, 536953724, 835860980, 839011086, 312337042, 763106402, 967665058, 924323916, 79578586, 765754762, 832689130, 913917411, 898560484, 792084326, 348091988, 462841747, 38010959, 392737993, 3009449, 350831771, 912199630, 425134703, 775020717, 647997584, 741356698, 166278460, 869663083, 647072939, 745625861, 225232692, 772550810, 97926046, 158274643, 639954960, 993664685, 948581315, 42923854, 497120441, 472948622, 671591547, 481449061, 804758853, 579280044, 496884109, 7385548, 654808800, 859416940, 503726762, 626537115, 408793283, 645016533, 420812424, 673499997, 373272687, 544266494, 719819823, 952799809, 980437016, 79869262, 746105457, 555042166, 300365589, 314262330, 775547898, 319195, 862064506, 247861214, 539457472, 891181651, 739899313, 856325939, 474792389, 646142824, 425012348, 464504884, 175255790, 645189570, 994342074, 388145377, 758485776, 644299470, 938620234, 523460486, 696845537, 146251274, 765755555, 211765723, 406209862, 262334486, 314682323, 238926155, 380293812, 793306827, 695934971, 41797572, 164125639, 734295601, 957006629, 28334704, 805752965, 247692986, 455019269, 674818780, 640914235, 498334463, 328997275, 98728370, 94303005, 330407573, 622176072, 902724011, 502359677, 365755512, 33774623, 314570757, 644858120, 319084859, 585531096, 555979614, 20241404, 171234266, 134211500, 178834316, 623478011, 775898740, 847141991, 679004596, 888241786, 304501225, 547356433, 9982489, 987046099, 186943448, 13253947, 765250104, 958448902, 814200319, 837071048, 676888072, 296152354, 217946267, 972702366, 775412130, 658068164, 156404376, 926912470, 443555522, 250919597, 317855456, 915909293, 284399659, 453799011, 5105713, 790891033, 792297210, 710028002, 618142770, 364287620, 331045396, 687384881, 424599451, 630174112, 867937200, 769346042, 484475224, 70419182, 622020019, 256886187, 38456691, 715189368, 370106296, 264780551, 292186988, 90417925, 143278292, 573568020, 714660817, 287022466, 572214539, 829167149, 697488315, 72368017, 368199605, 262908146, 163077668, 455674471, 748843401, 751645251, 884369638, 689084763, 672847687, 163891792, 461395492, 302226377, 664625974, 577809015, 941674562, 131401399, 309794389, 316433861, 667752638, 284189888, 968220163, 584810471, 201754740, 563353811, 500121861, 515294445, 431344283, 551453151, 676839106, 482675182, 27141974, 225531211, 417545520, 577032155, 777262421, 543846497, 202834963, 870266166, 757772475, 863416480, 815999208, 987758583, 902266565, 262072884, 489557494, 35642385, 322610818, 454671220, 846664545, 339165468, 167841816, 41792934, 816030258, 8374123, 472924553, 590410784, 812622874, 821815806, 686549685, 586496957, 573983725, 526279493, 937875240, 586272615, 79980609, 817572098, 49577869, 988672744, 562171392, 646881269, 147215121, 616796113, 644886645, 597791310, 683978339, 723580327, 317239670, 839871962, 979469695, 451512661, 52049196, 468819589, 293585610, 841365638, 433463909, 635115970, 697627677, 875593849, 94609155, 306000460, 324881773, 882169936, 773246242, 483441793, 582334856, 731323053, 661390729, 859812401, 59690028, 578797844, 969394600, 24581744, 639171654, 741500461, 703531323, 912447409, 118816459, 817192281, 450086895, 391818462, 425676138, 40537340, 262670821, 27903141, 51470642, 850558030, 147747791, 917072134, 344989983, 562182867, 500804337, 902729830, 141473653, 45035817, 609220152, 538387348, 712397127, 553791286, 292908483, 188425885, 346444658, 193186312, 824573033, 747471409, 780772400, 757551785, 172848355, 845254480, 686129156, 785048012, 622014500, 872720038, 102455473, 867474927, 919250514, 666141143, 588427128, 852369363, 445940559, 209574792, 886466250, 646346449, 615807900, 796805074, 266036928, 442383386, 387820339, 804624621, 58065519, 293123937, 197148648, 895594288, 161078475, 187577644, 91985993, 869252687, 312427344, 749359694, 411989786, 44617848, 685631848, 875391712, 225073610, 725783885, 684055221, 938696718, 923112084, 96102386, 713974845, 87920864, 91300316, 298972718, 321470346, 82847310, 821083006, 109063493, 963694457, 335333188, 419415126, 432269906, 78620389, 256059592, 507183168, 74360590, 476674075, 950776969, 556452274, 116536558, 410412816, 80018638, 654087452, 643902773, 997473904, 613296730, 816349021, 763840061, 279014728, 108603031, 962582510, 583034826, 897098978, 509902642, 91571272, 855903910, 683065640, 845807965, 627864237, 96631038, 526748163, 39991977, 300823348, 967751668, 350518688, 51422069, 960456532, 376432318, 568316522, 145000168, 899364689, 617820153, 421613081, 998545497, 360765423, 24182861, 25348536, 99470730, 253205483, 487623243, 394440419, 709415547, 383872230, 89782724, 320034586, 403979873, 36254775, 549581568, 667943168, 758068193, 841054201, 582451650, 942588073, 769830863, 823609178, 926649294, 727177359, 555879723, 894378844, 652545994, 298053594, 527144937, 744884670, 12805690, 667149698, 124493325, 978511736, 514821512, 357286698, 311246498, 210888954, 965502937, 932798317, 516157069, 598235900, 544198300, 859692452, 27345953, 619090787, 274825224, 615935803, 705193548, 668826398, 37937406, 450774711, 127774649, 852917560, 50350371, 665237495, 27432758, 281981773, 801697925, 591798383, 197023576, 406358042, 794373745, 296697434, 681939405, 761832978, 460217048, 516575812, 894110038, 12714620, 380931876, 693323854, 687959690, 218747110, 262307021, 644569801, 695911453, 750070814, 862942697, 92391829, 576645388, 562020314, 6919284, 946901348, 796844815, 423491488, 564231467, 904886290, 173404833, 555546106, 322929877, 212033996, 786025744, 131528823, 555356730, 714333280, 202915220, 809672717, 426216935, 725895468, 81980077, 199937721, 360816765, 360743125, 75430894, 576563708, 230788709, 553965955, 434610707, 488343014, 131594574, 699299319, 15360664, 295603119, 965115179, 835169275, 336188722, 675847471, 123084178, 289371284, 172644148, 851254725, 954115681, 208852926, 400285368, 272949949, 949307749, 406417372, 637108773, 311628969, 54347186, 555094378, 760775792, 675727049, 559758729, 410594967, 413513368, 662013397, 137994376, 587222931, 214336967, 192984205, 454673826, 653529057, 711347536, 669749496, 542510893, 784865748, 479436555, 702243551, 474714996, 284344106, 732211466, 695618554, 552387743, 215971257, 26190178, 431885789, 584120993, 192812458, 629286056, 346268824, 387322399, 95878083, 725347537, 972804693, 120163634, 683361823, 587682969, 389954764, 960382014, 251659367, 265701780, 744584852, 420703965, 313783197, 199437853, 103151198, 860216940, 827873811, 741106764, 892866403, 317880376, 651598950, 62520065, 601324769, 163877813, 743532086, 475524842, 305649653, 636019709, 520070197, 214412475, 604267039, 634178293, 767845835, 470370244, 405458485, 890829842, 606046026, 471095166, 27555972, 67624609, 995492251, 321607727, 393733625, 558658479, 620823036, 85516904, 347164978, 826672619, 350270030, 297068674, 561311695, 359062471, 475755187, 863804484, 255614584, 749626475, 340977869, 469594424, 212703887, 257501249, 162823755, 306023706, 241125417, 142710998, 776584824, 650831226, 473016565, 89562361, 29352481, 480103617, 412034701, 613572861, 60642647, 178587486, 567344870, 80944003, 482005028, 222170219, 142318034, 556699736, 373084842, 752988211, 814839792, 871387412, 620386607, 602064240, 108189774, 702036287, 278260815, 231701765, 951549235, 626545807, 445966287, 712350716, 500124640, 188171399, 676125371, 371394647, 837298960, 939336022, 438031036, 186714880, 216111716, 186044002, 581620230, 340599528, 101017623, 954534105, 995780074, 618882019, 418147528, 767131494, 301425635, 413745436, 962385176, 988626008, 137028715, 583626729, 374502874, 129245417, 783696635, 516244019, 166701302, 395998250, 899091379, 185147981, 888020140, 214258254, 830884306, 291227991, 600383262, 836705371, 150117498, 22802471, 69557681, 875092333, 498794258, 369675284, 941672774, 245715055, 351032507, 745046885, 808550199, 76081612, 247926676, 620593330, 454226637, 124999051, 997605209, 309479695, 223505774, 30851595, 796149915, 234214672, 698950772, 634482949, 657440469, 680685934, 622581826, 471407126, 641364582, 439880604, 828662127, 710328881, 854337730, 218954183, 308890346, 696883741, 704295352, 23756660, 692821843, 759054630, 223276561, 816528545, 805470409, 321576509, 507647022, 959763181, 959047512, 71355150, 867173786, 570650020, 763468490, 454668170, 461222603, 770001770, 552268482, 365360958, 764911700, 677237544, 440328283, 984549649, 259844284, 75262068, 503143712, 838297266, 105854139, 202662940, 683355886, 363265848, 555867076, 887916417, 766236164, 129769218, 260030095, 376298724, 956523327, 899221952, 33538203, 917822505, 692713873, 268868540, 480130178, 308269358, 37693909, 258466510, 300897318, 587896924, 278096281, 191534712, 919963415, 565641621, 320019586, 879837320, 908684471, 23870521, 479525399, 523797789, 364351125, 761922216, 427454498, 272480994, 531892568, 292110048, 28298126, 163923066, 144435894, 463928498, 878941514, 432095463, 874023827, 449729638, 637204414, 825970062, 643921799, 835275561, 752031673, 957571344, 784924485, 289472366, 8843335, 972907389, 328534344, 957382231, 222481914, 512123613, 255687739, 321672181, 106614581, 149991666, 483357223, 454175825, 745448720, 274635425, 313232453, 374663650, 677756092, 632611936, 22070680, 339269657, 132455542, 338802685, 718343286, 603452480, 699756846, 802026382, 630527452, 896151723, 939566225, 258401424, 853392870, 880194524, 792827319, 403695464, 109462351, 962558728, 135069793, 549142905, 983579550, 110815829, 909786301, 182557229, 226845651, 200705606, 497560256, 193529259, 308570479, 329947007, 189498630, 193994069, 898161342, 260293498, 537724486, 162722279, 972018154, 150488640, 485488569, 797202722, 828096899, 629742190, 221961319, 338535225, 581622427, 521477026, 528640359, 597216559, 922488813, 730878735, 205255505, 474388932, 989429410, 502110503, 673876242, 185798899, 902302522, 501809075, 233065479, 356452765, 541073672, 847051360, 538785072, 862803293, 409689476, 625279470, 513414045, 868495308, 330682429, 586751803, 508454254, 619218542, 533898619, 341736407, 646062216, 89216946, 19220297, 949573988, 655460326, 308240372, 695484802, 880739242, 573500002, 231169478, 64651173, 35122460, 131988165, 544955859, 769857172, 185393273, 886747610, 615162473, 889794879, 337973379, 106604658, 386386085, 191341291, 878552432, 469859981, 171378318, 2481856, 272586583, 832406872, 960328858, 336146912, 281053957, 934376162, 646820844, 536944351, 364814113, 117742167, 247184801, 561613760, 293317830, 469232799, 791091533, 954321146, 805541161, 709574499, 898284542, 959570285, 682922905, 301875364, 719438718, 279592170, 46864067, 358224301, 92060233, 672795876, 587715426, 106552713, 88983953, 597426475, 297706732, 111408834, 78355372, 115919434, 156681874, 739661478, 624419128, 785595407, 405130433, 6754034, 737909746, 281114344, 773967075, 286197545, 307581135, 555742349, 810716297, 685375889, 750925961, 421118058, 767308669, 713093101, 240592908, 443827005, 713587241, 441373998, 342424531, 425926014, 622764455, 947687630, 790195536, 790596210, 375395089, 932221511, 25492365, 241669632, 606391370, 846261543, 918436478, 737745508, 820405158, 703149588, 99985859, 859425550, 554220631, 340069979, 312586014, 985226374, 527441942, 838574536, 541207768, 284030480, 220471415, 961393295, 871333307, 663187660, 790456052, 34901253, 535484514, 722947227, 714448394, 109574819, 19083719, 220125251, 417603431, 976429984, 422222053, 899493832, 100004706, 553764858, 417966897, 437366073, 189674298, 736512985, 780253223, 113871537, 156225764, 556827261, 240680090, 501566432, 877565262, 472725289, 107264391, 808323093, 55779840, 689987671, 328867116, 497001013, 594887013, 333410113, 631186472, 840294215, 840269203, 191671281, 730328264, 87906040, 579860294, 706516137, 375706875, 212905817, 636563737, 371574188, 104784815, 659682247, 721582469, 298892685, 555695643, 389864, 190911396, 529299213, 410894675, 332730574, 61493176, 735084536, 324332495, 935432983, 572785934, 417828425, 536668260, 283506957, 181386007, 930770260, 41654507, 397364759, 661712266, 957704561, 467366674, 981360437, 543341704, 842942688, 66309450, 657579216, 450738922, 729231551, 364401688, 892809238, 321255591, 981613019, 182078766, 287581910, 257912053, 212562074, 773918106, 591994316, 862205103, 230201619, 203483751, 554022956, 789565117, 929049349, 826235646, 656610099, 382055716, 318638158, 781052879, 921113281, 155317942, 673723416, 867221883, 67089512, 281422729, 46554513, 59547294, 621947885, 655132643, 582394463, 947220742, 242129262, 306394898, 102190889, 384049370, 25418591, 961962222, 420193998, 240418005, 720679455, 944550734, 738288403, 75630516, 542181891, 387422652, 55350584, 974846223, 28240417, 779310231, 385549603, 323848720, 403791424, 690839156, 198854843, 817953072, 272671381, 464511161, 462716461, 355374728, 692776041, 463320052, 157246267, 628326792, 251820723, 234400901, 489608588, 144560185, 702925828, 784090797, 957419811, 656164198, 960640940, 180203837, 96415507, 998579916, 462456354, 182396132, 904589630, 730357039, 575175399, 237891572, 318282504, 974204841, 506217462, 850372570, 449312032, 237173071, 677473176, 310432426, 517350609, 519164751, 694276927, 448982641, 64685419, 974975446, 820353901, 120704072, 349187066, 694049966, 811386207, 533414583, 962820706, 844007880, 665402350, 651284026, 539865261, 789989017, 101356214, 611202047, 8168715, 489388533, 935941692, 509840506, 582373452, 238216312, 630014017, 446025706, 891751537, 130209415, 299560121, 976614524, 378434897, 574178431, 231132738, 992472749, 909426304, 116377349, 162162272, 245648474, 549686534, 179141462, 692075007, 723182056, 645909658, 14361269, 617087262, 221974377, 552612255, 188092602, 755557517, 587768898, 490498711, 2518894, 715336312, 617125067, 409501829, 148222348, 722287756, 508186616, 528470793, 627551947, 899326934, 634401256, 327358565, 78436810, 826493637, 684726740, 956508730, 891606217, 24526892, 634647594, 647963390, 214891455, 196610805, 452841546, 356077803, 4323457, 367511689, 991876200, 633457395, 378659254, 278694471, 670724606, 433109360, 739295420, 209242515, 386770185, 550529210, 904322367, 527416662, 814136345, 373111996, 365234797, 151071261, 685657738, 53651484, 931164748, 93186558, 555823348, 111861661, 776517468, 598181114, 619236678, 548386249, 600525000, 378050148, 33611038, 905478451, 470705373, 304656170, 860612697, 82680671, 865826222, 106558866, 254293989, 779341172, 318337985, 295779765, 407502933, 57702521, 699658590, 660049600, 829841368, 880536179, 883869765, 432693983, 106831719, 148045131, 53887459, 184474494, 145351750, 35022472, 141036939, 262960580, 456944085, 115872927, 608860422, 682610474, 115500378, 482559979, 121898583, 861532144, 765811000, 880101873, 905483679, 907172730, 333143286, 761140231, 807972606, 138875294, 418648634, 676227013, 598926412, 375313855, 715298791, 296012865, 655324878, 355854564, 152052376, 511527571, 417942243, 173805349, 545508711, 344954037, 34947151, 804917160, 537477802, 751857389, 185026438, 350419106, 834011373, 567123736, 22361163, 181073787, 543764704, 680150069, 710782765, 955531522, 973001971, 669741659, 675655237, 511270945, 480581735, 615498095, 170682731, 523408699, 821654522, 709032736, 252522089, 904554520, 654102893, 131097076, 221302521, 927279810, 923491368, 86616826, 687201950, 554754405, 878915101, 511529829, 43413539, 407864622, 116006459, 239702197, 596618750, 916490891, 969731953, 921601053, 92532785, 398398256, 453697426, 798979828, 574852861, 216671430, 300870037, 996615050, 258063469, 654525871, 619017586, 145506046, 270193064, 426684029, 385546407, 777211607, 951807402, 339223774, 621988781, 269055691, 625486075, 361791045, 448311220, 961238575, 535553496, 666417665, 444784348, 389373972, 57979066, 475494691, 659372113, 123635917, 889415462, 575193533, 780578990, 785468049, 771405474, 613682881, 127399906, 40840472, 434189404, 735173309, 474310924, 981025742, 324247277, 557857531, 368189481, 412319831, 261993377, 453538551, 242879395, 711877703, 569702475, 818774366, 979498092, 600728728, 224291451, 926126921, 104464452, 857191057, 91724657, 774437499, 612971479, 158509683, 370833131, 991090250, 385951656, 919657018, 580717489, 807463113, 710456090, 172460066, 854955598, 672811723, 63379882, 553030831, 511444696, 691004658, 959690501, 781368219, 712682648, 360602535, 929177297, 508814672, 234330508, 744377515, 847436226, 422589793, 950782861, 443011305, 168735043, 616630620, 28827177, 119244586, 594431974, 771026430, 189931400, 832335061, 220429978, 302134071, 658579350, 847038139, 583311124, 747025673, 171830470, 238775552, 207300957, 950749926, 203259769, 697647495, 128172635, 263602646, 185283993, 883638538, 327150593, 36041829, 517790834, 132288416, 37902014, 21518231, 610392590, 475220766, 384626212, 191096660, 194550893, 909644220, 953413272, 971006951, 179787731, 908308219, 396757903, 824774664, 876150410, 986286831, 308140727, 540781658, 926767129, 533278162, 722573342, 56026574, 611604893, 109919736, 437683625, 200315749, 770598688, 609721024, 700604695, 261566604, 166939092, 9959186, 201831074, 595061292, 716505318, 848609482, 366086462, 46606148, 524463360, 990603495, 112642505, 353389331, 735898752, 443800922, 441382435, 971945462, 329506788, 411143669, 324276788, 318585069, 208516192, 200608203, 224584870, 82693343, 784863891, 661703374, 242587918, 683527198, 442136238, 221100691, 388720469, 828745928, 137123829, 528521241, 201099308, 269232369, 467440755, 965962321, 193320515, 171891902, 449277917, 970822335, 365374472, 591997015, 966483437, 628994597, 787763358, 127630923, 949533138, 216462626, 562230620, 200631051, 362321298, 721627745, 714766892, 961744988, 901768295, 898563073, 764651347, 141780402, 188914501, 158235464, 883243234, 176525028, 100365645, 314270174, 228867607, 768389484, 571272970, 603649195, 579276176, 825191730, 567181599, 748431239, 914375200, 852618562, 575487237, 593162547, 350346189, 878396876, 760161766, 581974874, 959210169, 794481973, 840309244, 21974649, 796688439, 733961890, 308266398, 696203370, 232620986, 229886292, 592712649, 224241626, 184071301, 946358352, 473972071, 237884640, 746378118, 974017758, 830094222, 658012251, 260535440, 164193446, 544067513, 408074471, 116687148, 831857844, 872792999, 507482941, 628269783, 32578063, 232950483, 355650966, 568486961, 113984103, 702455271, 934743803, 194569320, 179424579, 673308764, 178380019, 900476812, 552570043, 829917162, 477479926, 681610623, 238757801, 23840226, 726267959, 696057438, 574677282, 186381880, 35485698, 889222427, 539179043, 821951783, 511698146, 171449150, 306487594, 927560548, 177983126, 212306916, 494296811, 896705972, 976896293, 732382445, 621422605, 979355458, 802200321, 571346343, 946088899, 940072333, 525327115, 582233281, 677737200, 543326340, 286785472, 133019909, 738261012, 727900737, 310131795, 841315981, 427990858, 462400646, 732466357, 777501341, 656856278, 836604083, 828195985, 395025599, 102692137, 603174275, 85844851, 188945295, 857464733, 670624315, 226531488, 416736089, 896956498, 987691169, 639227198, 147949944, 374797132, 178150646, 48999152, 839075399, 510992241, 560735414, 864160045, 119678346, 631224380, 750339888, 930673449, 900385260, 790107707, 743746671, 973743118, 818491268, 389353522, 808802015, 939386039, 670345979, 729437156, 87208405, 320910710, 882349386, 464047143, 62705137, 646621257, 116748804, 917896345, 123887811, 988238488, 955533834, 210758100, 240071640, 382851200, 592070556, 320863411, 960031749, 783694175, 393071961, 748270549, 964296637, 954789954, 959569135, 610934717, 602197819, 672310953, 805672385, 242036374, 974231469, 73317689, 707495636, 812385954, 152586963, 718789308, 816234642, 17031169, 799805135, 68043121, 378715813, 101997531, 370724951, 379199558, 118109713, 995929225, 431341092, 750709870, 670219199, 182709465, 892362356, 933232431, 848800901, 511329206, 802284988, 574599681, 704877501, 86538070, 950231489, 915552654, 332057375, 203789714, 40465807, 272825608, 327341856, 65871676, 737006797, 564001606, 117271754, 42366756, 559314887, 72080910, 16332576, 518496681, 178460080, 922835669, 85853831, 289844495, 114678009, 888735061, 636817795, 994800442, 634170402, 81387460, 389851236, 385318248, 616434278, 164064665, 58527489, 899289944, 780921080, 746492224, 321201262, 774927097, 331355371, 323578389, 464788611, 439530943, 381191621, 307493928, 544419454, 189115951, 888179722, 56027054, 400162259, 492572749, 570922540, 50044808, 215440608, 939002974, 722116659, 506389393, 522781470, 577382527, 975750661, 196920209, 110476437, 378088881, 602038543, 843360858, 248647300, 20368720, 694617749, 70673631, 36350582, 105955049, 625577110, 626598387, 795310078, 887715330, 349947783, 686546994, 25161376, 125463051, 652276150, 662037486, 595549690, 718629428, 781857227, 435085264, 355204932, 469209929, 121108565, 797128380, 955454823, 818408085, 882286707, 437088869, 418580397, 389415090, 366167084, 344077692, 866730359, 406913407, 766604223, 751773745, 455849570, 218126777, 673152505, 545689875, 847077339, 637717539, 701057595, 466037197, 381085766, 57548409, 594551854, 530621083, 690872937, 920194031, 423902550, 959482076, 921554933, 859646318, 730912936, 644586671, 440798612, 580905887, 900883897, 627969908, 7224353, 710662547, 951043097, 178313806, 799487853, 587235700, 362545847, 969286261, 835552372, 557893781, 713002969, 638126879, 348209223, 611703675, 356160228, 473805793, 891795539, 626114561, 521722743, 696652030, 743632248, 737132059, 533440828, 687481424, 130327262, 707480981, 37477429, 738084106, 49372472, 959286577, 903360150, 76895080, 644809401, 274597234, 173910265, 425631910, 46188770, 657727345, 176228111, 811963776, 270654659, 19177072, 977422478, 324751345, 452452633, 712043546, 478047692, 948121659, 875206020, 215136857, 54756708, 704283961, 569515206, 317180497, 196343809, 80152929, 231235994, 652206552, 860988182, 339891870, 990648286, 46638763, 509149276, 541939348, 355904452, 431325298, 357549879, 549943697, 474564051, 162716659, 963090407, 647842561, 772624310, 369470387, 84034776, 592879970, 951519687, 953129351, 88447823, 355811270, 262410819, 122874675, 324874139, 427752611, 966515031, 89544957, 490043087, 514702039, 593866856, 168367087, 644950238, 234858331, 120499562, 727750147, 300432587, 358531606, 837951330, 555717474, 833618568, 749833609, 687809699, 594318929, 382324387, 922817996, 752791004, 138103251, 493853550, 72041429, 300412849, 811511206, 524951630, 444956540, 657742723, 41964071, 115222465, 18151787, 503137364, 742459967, 290436603, 291850913, 707084680, 845615216, 544193854, 838816685, 820365504, 64821808, 958641055, 521245547, 626401031, 826921769, 376015807, 23365585, 127208963, 222201708, 397679385, 704521093, 398003266, 367632312, 560201311, 959095835, 518490388, 782459134, 85411514, 363544205, 898645481, 642423170, 356964076, 218770908, 101398744, 149838090, 847676333, 658844131, 66455878, 967449330, 921735030, 608517334, 501977444, 370764256, 932365136, 842116001, 2414808, 363210962, 468920751, 163861001, 885803673, 639058145, 446132418, 402067874, 794603245, 321367393, 633937175, 752437584, 89831570, 777480614, 1875666, 446948540, 607778609, 895163736, 654319771, 56282607, 953825487, 322366231, 857703755, 40904649, 611285125, 973715621, 685339249, 58869526, 750073307, 286265907, 174980597, 937499408, 885979049, 169542536, 859733362, 993160596, 36179133, 99723628, 300577098, 119273185, 895361237, 321883362, 666141940, 241183990, 611545116, 598039345, 942688158, 648305554, 976484452, 909040395, 639505417, 717880425, 258364578, 177731935, 331433241, 644072879, 835125078, 437946030, 732730195, 263084996, 227710431, 634360769, 949793998, 673705291, 929116367, 780620265, 396385982, 636792029, 981415232, 534698667, 605385771, 446440726, 846286425, 170393385, 865408351, 535702043, 91059914, 396396595, 978353795, 909026952, 193229763, 332588600, 947659377, 659231379, 21658695, 908909731, 930701976, 169444090, 242105422, 211346541, 280700862, 419568817, 565028991, 410179813, 947115493, 162947610, 353283845, 440000302, 555403642, 967699788, 939284378, 26563328, 808244694, 628818450, 464570707, 613515466, 816227814, 798592997, 139960087, 611289279, 84099181, 767531938, 309790621, 725213859, 101876198, 339117512, 560452243, 695943492, 482097635, 696268438, 33261687, 549042129, 227726089, 324472676, 889008129, 433042127, 121540726, 256202561, 466427373, 253057484, 582185803, 12967232, 365976221, 1001525, 843332554, 557829538, 816545092, 17260454, 45247051, 117768503, 97334544, 142496898, 511333733, 432449646, 539910489, 752822850, 319965495, 857056169, 748503998, 709859995, 43212619, 215123872, 763386790, 167320288, 584036346, 431950841, 657125650, 47836908, 931587780, 624620056, 214312432, 650854133, 138350471, 695691723, 818005740, 800549557, 453278187, 704208506, 161679109, 21228857, 24799573, 523890408, 644772103, 703815094, 273840418, 255182503, 451051671, 765402838, 276461433, 817763339, 311617014, 56463857, 173174288, 985489261, 364879760, 260289777, 866138754, 444165753, 814280531, 665038276, 301803455, 959789371, 700429559, 566854653, 152240081, 211426797, 960298, 230714841, 36233184, 269379666, 489824611, 914246569, 385971337, 351582326, 588477371, 891226054, 658857137, 819038771, 551105910, 907928307, 409262069, 270013431, 94369267, 383868816, 550427912, 563194105, 462941349, 484982153, 904457766, 192247167, 381460272, 970265030, 481977727, 31384204, 550046603, 922412185, 814116989, 722990797, 245899471, 637663524, 160142774, 468353543, 438206607, 772758812, 544546780, 544896635, 116902729, 711349637, 991251853, 994312234, 957097261, 412924284, 175915003, 689039777, 818561243, 741321533, 538140579, 281833152, 679071114, 57304296, 833699278, 707474921, 62014389, 120960628, 172686671, 848769176, 927259833, 589949390, 807541116, 181697612, 334825796, 986129478, 59148373, 119891371, 73571388, 74981386, 827459594, 634033443, 904106237, 805784045, 42592013, 13913474, 335897837, 481916336, 598553686, 218288615, 420595899, 842333638, 105897102, 275003777, 283689245, 218844471, 756122698, 252407474, 829890821, 653416861, 368228913, 59776635, 531136583, 47966437, 827773479, 904112376, 898657123, 115622291, 743558, 8828680, 860518048, 777455376, 971624304, 635482863, 511862704, 639631999, 438768263, 901901225, 196727914, 228846332, 683559026, 314126432, 1806760, 214540782, 658500415, 214746490, 608268120, 158011813, 934741554, 940540029, 155900422, 939640865, 651516855, 620660513, 386136335, 745327884, 184835166, 788977403, 243849317, 935550155, 377688755, 32165748, 172100122, 755822381, 999829632, 354024371, 949379942, 411448871, 895625714, 875439951, 926343731, 221188948, 544617857, 290381100, 878249839, 843386003, 120327277, 599441531, 626324309, 222677418, 284201958, 54461302, 576857817, 459925304, 239808803, 254268736, 112223863, 23598162, 687569821, 898753792, 250518185, 143988237, 47361625, 861946417, 779538942, 459568395, 136709445, 556023371, 207252924, 283891715, 777970421, 601703155, 268933499, 562239349, 644182771, 790868861, 383170492, 819558870, 161660156, 71891404, 868527522, 221592101, 545660152, 741329109, 492560139, 333418180, 435874670, 747603335, 289108386, 748335689, 149258814, 947775920, 305799873, 691745662, 859773837, 107234823, 956564497, 619391212, 703591889, 938772236, 739299002, 85626843, 429657017, 880977489, 480485548, 262991906, 6951837, 169090857, 52743047, 668398208, 189604863, 792261239, 245121057, 351830780, 475786287, 298968521, 854649380, 841402304, 705058352, 643408174, 451190291, 106238922, 905773250, 556348580, 833422618, 660705083, 321237184, 837596708, 612787020, 472721787, 312244517, 616099679, 518429803, 244784641, 258499452, 36214998, 60302259, 133990319, 360391216, 503581979, 672913924, 583093439, 550942660, 250979125, 940247510, 652858459, 675878546, 797466841, 370674995, 907745476, 588883865, 987383089, 218448226, 449737002, 955307454, 585163662, 699903733, 105920007, 731369808, 740798623, 732815063, 955069657, 912907186, 197692808, 955042514, 945946070, 849264882, 370954232, 838048808, 299015263, 472283529, 79267470, 314511120, 164725792, 389039359, 173690840, 816568260, 483994943, 820870927, 376726741, 251514316, 51302942, 615552918, 877972951, 860217092, 843254111, 673189570, 27294194, 673071999, 795723031, 758712484, 935436811, 338815770, 883286020, 37036329, 817487284, 363687397, 501326546, 406242075, 412047561, 466907683, 521730345, 887830119, 645973608, 572743108, 627707705, 639840156, 652240338, 640176912, 825286131, 371748226, 535745681, 760583377, 383534127, 366576210, 849032156, 398519118, 755697805, 230126756, 873857996, 596624149, 313413445, 917211514, 268976357, 940260428, 184998150, 343332488, 895030555, 16762969, 293942000, 61558881, 102830492, 276975461, 171586002, 255821416, 397765975, 465541436, 942936259, 901676852, 166714611, 392758236, 685709975, 805075316, 587042608, 808975676, 446219613, 924221182, 717855804, 15861100, 644071222, 797042841, 247404499, 716210868, 160723295, 402081695, 469917635, 28585240, 653821167, 10364285, 208063293, 102556082, 540148245, 666014613, 667552029, 822004563, 166994102, 334528303, 122406032, 697720617, 316059644, 972708995, 726071977, 462361745, 224085543, 572856784, 15957789, 963335493, 927695057, 176379245, 383462849, 865550856, 810104898, 289052741, 20714571, 35324294, 832466091, 743055358, 790404115, 80236396, 795827061, 395369878, 252255602, 184874192, 23530816, 506336207, 658529903, 592654716, 556715519, 822615331, 809520025, 787957548, 139736444, 548229608, 666322128, 72657315, 992131036, 916436220, 768152482, 120580894, 349515729, 528627236, 449845586, 460148110, 371078849, 605223863, 752665040, 1624779, 644242679, 985944307, 858571182, 461684752, 810675957, 993351100, 382520483, 250821716, 977534286, 508168386, 246241034, 609693247, 743320473, 146607662, 998445214, 431759341, 343673635, 640794075, 262660065, 878625869, 897437609, 516489488, 23659927, 759999147, 655412155, 503783506, 667819834, 551718218, 605276486, 57914865, 419059158, 46776049, 804175213, 960309116, 623584323, 753818347, 91180671, 886695514, 802544874, 178110089, 143529344, 505623920, 720477855, 80630633, 63261778, 317677628, 454032332, 240724484, 186782768, 536920726, 899201547, 923187729, 845529381, 295331561, 895582663, 595645523, 82038737, 267747183, 796913715, 122804438, 49897344, 362714249, 862665025, 396997686, 604625458, 37112088, 976519680, 446432499, 748095242, 429003830, 291811017, 677603270, 505978357, 9432426, 387257732, 739252457, 905769562, 480866202, 114477162, 910290154, 964097748, 975047101, 558505018, 397606795, 320449623, 674423851, 567300118, 96600383, 149970539, 81408680, 943126359, 618538215, 902294691, 538833948, 516910200, 175195207, 164991807, 613271994, 282270752, 195159923, 182691277, 893377616, 350962890, 378185065, 165520304, 736097983, 104275527, 107760395, 496223166, 392774298, 339005193, 6415884, 852198248, 869760630, 57337377, 328642311, 313491466, 473943256, 761334845, 163974456, 805443890, 454791777, 655688589, 217832409, 48206873, 250729512, 650171495, 668474483, 645785673, 828763867, 638317152, 787083774, 304210226, 761376754, 998417863, 114437701, 179152011, 856498178, 895998969, 375283462, 756451234, 63585213, 746100628, 352262217, 685049322, 41368875, 185621781, 193116004, 704542713, 613788001, 712282785, 133675350, 36342676, 127889371, 885675751, 150684097, 935926548, 457679454, 908239676, 46086256, 363721489, 148164239, 493754728, 991370249, 574494584, 10015428, 949112564, 670563791, 506987577, 373557253, 422937350, 707248469, 738375556, 170359517, 504522488, 822839646, 971251884, 14295245, 6364559, 829528560, 31902055, 509183036, 190031100, 209870102, 452967833, 456964275, 743009770, 951211379, 933702078, 78834235, 324014730, 139963002, 928413345, 526681054, 322007744, 800710829, 525191165, 830508742, 525334945, 99767615, 190439097, 150011682, 869931254, 195895108, 642716041, 472372818, 845969378, 891314830, 756420050, 48906613, 622902626, 55143732, 131611764, 37731551, 299498677, 640694188, 842798821, 526134613, 706085903, 187560670, 871101937, 458380397, 376491783, 258403652, 497475041, 92698088, 58099292, 798700283, 160237119, 420795881, 715071206, 382414136, 647275638, 598995012, 116058943, 342151526, 611720254, 575486020, 397160465, 573871310, 804763794, 855872322, 662992488, 811636563, 484712697, 785331707, 394682840, 540399090, 628990032, 459093333, 905606245, 300709259, 285160187, 107113222, 57562713, 785917963, 944928720, 215790782, 159729073, 314679186, 484363600, 220810932, 193756864, 176113742, 653956340, 385162015, 613321758, 655032622, 595475307, 963064968, 575934821, 565366446, 339412611, 420269925, 853822178, 621890905, 341799536, 730085337, 669687144, 43038664, 190723760, 520007694, 397191752, 242741101, 295273112, 911553855, 420256891, 134534726, 229041960, 288039667, 912665239, 952930369, 420783608, 759505883, 355080139, 13776242, 725047982, 766014613, 348574940, 279003328, 249479481, 895297500, 190353452, 999650409, 673605968, 308743105, 923509648, 610816753, 868217020, 502437344, 785101081, 683997286, 190190426, 14850091, 628445902, 441409418, 361000413, 482358408, 402504037, 416870733, 249891590, 406197948, 221484197, 989497991, 210224657, 35396951, 560021235, 76667846, 849870082, 830692370, 990522851, 183760025, 844165424, 799741184, 751900362, 312616925, 845225615, 371369299, 912379072, 977692978, 464715793, 272736508, 409713958, 661250225, 355611695, 602025484, 655098052, 791858343, 935074244, 363351667, 660633695, 830681132, 207979827, 766178018, 314428742, 291425335, 249769039, 382582132, 176838020, 531553490, 339637176, 171182908, 867642857, 564528401, 750769745, 600414104, 894717790, 100220991, 558039019, 986383097, 729964739, 105290652, 584230942, 928474519, 731654431, 704603911, 359730029, 568522294, 752842834, 632601136, 5043193, 663508854, 927237848, 469651192, 496701127, 750913782, 564220277, 26335023, 523313806, 906775254, 972081105, 77997445, 356067959, 448714422, 714021267, 864595306, 865545519, 612006278, 769170204, 155531347, 410127755, 951372818, 594730385, 248994712, 771421275, 185158093, 499376011, 662863317, 413001393, 805887756, 473324595, 921297057, 18735813, 386934464, 146972891, 560627347, 903669593, 967094539, 386758849, 737091463, 755426664, 220579995, 435711349, 887741198, 883209694, 478560592, 9832118, 930618930, 163415091, 240446492, 132759678, 134081914, 702601410, 909768461, 660176441, 680440363, 57179043, 900412868, 646477707, 534303308, 997628154, 282709724, 402700228, 997064274, 785650024, 436878044, 977972319, 780587881, 124834909, 341934157]\nn = int(input())\nprint(sym_trans[n-1])\n", "mod = 10 ** 9 + 7\r\nn = int(input())\r\na = [[0] * (n + 1) for i in range(n + 1)]\r\na[0][0] = 1\r\nfor i in range(1, n + 1):\r\n a[i][0] = a[i - 1][i - 1]\r\n for j in range(1, i + 1):\r\n a[i][j] = (a[i][j - 1] + a[i - 1][j - 1]) % mod\r\nprint(a[n][n - 1])", "MOD = 10**9 + 7\r\nn = int(input())\r\nc = [[0] * (n + 1) for _ in range(n + 1)]\r\nc1 = [0] * (n + 1)\r\nc2 = [0] * (n + 1)\r\nc[0][0] = 1\r\nfor i in range(1, n + 1):\r\n c[i][0] = 1\r\n for j in range(1, i + 1):\r\n c[i][j] = (c[i-1][j] + c[i-1][j-1]) % MOD\r\nc1[0] = 1\r\nfor i in range(n):\r\n for j in range(1, n - i + 1):\r\n c1[i+j] = (c1[i+j] + c1[i] * c[n-i-1][j-1]) % MOD\r\nc2[0] = 1\r\nfor i in range(n):\r\n for j in range(1, n - i + 1):\r\n c2[i+j] = (c2[i+j] + c2[i] * c[n-i-1][j-1]) % MOD\r\n c2[i+1] = (c2[i+1] + c2[i]) % MOD\r\nprint((c2[n] - c1[n] + MOD) % MOD)# 1691350750.2614996", "from math import factorial\r\ncat = [1, 1]\r\np = 10**9 + 7\r\nn = int(input())\r\nans = 0\r\nfac = [1]\r\nmat = [[0 for i in range(n + 1)] for j in range(n + 1)]\r\n\r\n\r\nmat[0][0] = 1\r\nfor i in range(1, n + 1):\r\n mat[i][0] = mat[i - 1][i - 1]\r\n for j in range(i):\r\n mat[i][j + 1] = (mat[i][j] + mat[i - 1][j]) % p\r\n\r\nprint(mat[n][n - 1] % p)\r\n", "mod = 10**9 + 7 \r\nn = int(input())\r\nf = [0]*(n+1)\r\nf[0] = 1\r\ncount = 1\r\nfor i in range(1, n+1):\r\n for j in range (0, i):\r\n f[(count + j + n + 1)% (n+1)] = (f[(count - i + j + n + 1) % (n+1)] + f[(count + j +n) % (n+1)]+ mod)% mod\r\n count = (count + i + n +1) %(n+1)\r\nprint(f[(count -1 +n)%(n+1)]) ", "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\n\r\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)*y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,p,e=1):\r\n self.p=p\r\n self.e=e\r\n self.mod=self.p**self.e\r\n\r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert 10**8>=N>=0\r\n self.factorial=[1]\r\n self.cnt=[0]*(N+1)\r\n for i in range(1,N+1):\r\n ii=i\r\n self.cnt[i]=self.cnt[i-1]\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.cnt[i]+=1\r\n self.factorial.append((self.factorial[-1]*ii)%self.mod)\r\n self.factorial_inv=[None]*(N+1)\r\n self.factorial_inv[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n ii=i+1\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.factorial_inv[i]=(self.factorial_inv[i+1]*ii)%self.mod\r\n\r\n def Fact(self,N):\r\n return self.factorial[N]*pow(self.p,self.cnt[N],self.mod)%self.mod\r\n\r\n def Fact_Inv(self,N):\r\n if self.cnt[N]:\r\n return None\r\n return self.factorial_inv[N]\r\n\r\n def Comb(self,N,K,divisible_count=False):\r\n if K<0 or K>N:\r\n return 0\r\n retu=self.factorial[N]*self.factorial_inv[K]*self.factorial_inv[N-K]%self.mod\r\n cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K]\r\n if divisible_count:\r\n return retu,cnt\r\n else:\r\n retu*=pow(self.p,cnt,self.mod)\r\n retu%=self.mod\r\n return retu\r\n\r\ndef Bell_Numbers(N,mod,prime=False):\r\n bell_numbers=[0]*(N+1)\r\n bell_numbers[0]=1\r\n MD=MOD(mod)\r\n if prime:\r\n MD.Build_Fact(min(mod-2,N-1))\r\n for i in range(1,min(mod,N+1)):\r\n bell_numbers[i]=sum(bell_numbers[j]*MD.Comb(i-1,j) for j in range(i))%mod\r\n for i in range(mod,N+1):\r\n bell_numbers[i]=(bell_numbers[i-mod+1]+bell_numbers[i-mod])%mod\r\n else:\r\n MD.Build_Fact(N-1)\r\n for i in range(1,N+1):\r\n bell_numbers[i]=sum(bell_numbers[j]*MD.Comb(i-1,j) for j in range(i))%mod\r\n return bell_numbers\r\n\r\nN=int(readline())\r\nmod=10**9+7\r\nMD=MOD(mod)\r\nMD.Build_Fact(N)\r\nbell=[1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678570, 4213597, 27644437, 190899322, 382958538, 480142077, 864869230, 76801385, 742164233, 157873304, 812832668, 706900318, 546020311, 173093227, 759867260, 200033042, 40680577, 159122123, 665114805, 272358185, 365885605, 744733441, 692873095, 463056339, \r\n828412002, 817756178, 366396447, 683685664, 681586780, 840750853, 683889724, 216039853, 954226396, 858087702, 540284076, 514254014, 647209774, 900185117, \r\n348985796, 609459762, 781824096, 756600466, 654591160, 171792186, 748630189, 848074470, 75742990, 352494923, 278101098, 462072300, 334907097, 10474572, 495625635, 586051441, 159996073, 479379757, 707597945, 561063550, 974840072, 209152841, 906106015, 467465396, 82034048, 392794164, 700950185, 344807921, 475335490, 496881113, 358229039, 519104519, 784488542, 665151655, 307919717, 591199688, 692769253, 335414677, 884560880, 847374378, 791103220, 200350027, 485480275, 557337842, 434181960, 73976309, 792463021, 462067202, 677783523, 295755371, 435431099, 193120002, 513369106, 134597056, 143018012, 353529690, 591382993, 163160926, 287984994, 842145354, 703798750, 386436223, 618375990, 636477101, 536261496, 574800957, 34046224, 167415054, 961776342, 807141069, 218578541, 513967253, 460200768, 230725907, 239843627, 792763805, 368353031, 740982762, 126993201, 967654419, 588554507, 728057622, 239984996, 818342358, 882367644, 216705655, 267152940, 867213913, 330735015, 934583772, 59261085, 443816525, 568733052, 754405433, 244324432, 153903806, 292097031, 557968620, 311976469, 242994387, 773037141, 549999484, 243701468, 941251494, 7149216, 932327662, 456857477, 739044033, 645452229, 69273749, 304951367, 503353209, 243194926, 688663125, 239795364, 522687881, 121506491, 835250259, 159173149, 545801717, 19848500, 322507013, 106069527, 807985703, 290163328, 971751677, 238407093, 981758956, 301257197, 728003485, 817681690, 318332431, 864806329, 87958605, 929106232, 617996713, 519300437, 307911059, 137306007, 887695462, 633135243, \r\n442387331, 730250437, 27723819, 80605394, 760335262, 822289356, 415861662, 558003999, 645049413, 347692428, 380668983, 897875109, 278111491, 106909073, 951914124, 374756177, 635211535, 286442394, 774619548, 756991257, 929298287, 923425488, 182439740, 266683608, 415378498, 728411148, 808161291, 436338820, 692451577, 228029692, 235546564, 895805974, 758052804, 700926159, 226442121, 579900323, 96916377, 243044550, 858703179, 30279679, 343764928, 100627558, 840734795, 291199760, 989808717, 370270411, 158336199, 393391701, 881731480, 507200370, 588418523, 340981140, 295449954, 683858381, 903859151, 866470542, 4959332, 237784075, 861373023, 950693473, 955867890, 400039807, 939877954, 124824910, 954530940, 204884446, 42218442, 234856311, 189836713, 179563650, 683193288, 929322036, 73574908, 943547254, 103031032, 141180580, 540183111, 680050153, 382916846, 948921599, 252835397, 199109508, 551172546, 700090782, 44999714, 970123610, 145637563, 33948107, 267648423, 504777414, 584919509, 212459491, 242880452, 351366578, 345323768, 285497541, 692868556, 706562675, 675626979, 620872182, 136458675, 971105139, 182064384, 948539342, 186406165, 706529481, 790490927, 888369436, 784409511, 835815713, 447895018, 17015606, 342727699, \r\n321837918, 394134115, 563672582, 70390332, 61116103, 949269501, 833942074, 581389345, 570974405, 768179852, 765734098, 928340756, 541194960, 126833304, 427218334, 75800034, 100445725, 242810216, 330081440, 986329793, 298082322, 643160582, 505669854, 255287400, 403977567, 659185446, 596703087, 289443930, 478095124, 920175726, 205886838, 729278433, 535998256, 658801091, 606948240, 432632296, 552723022, 17794080, 234033713, 189986528, 444922724, 263196004, 846019724, 684703320, 895782046, 505050988, 44287113, 505335732, 436498414, 12098144, 714227851, 643983136, 647148160, 579243434, 951209063, 511291462, 426622734, 830870687, 949900312, 599926584, 633837711, 176405710, 913717356, 753535741, 874916804, 956692925, 220742732, 649500982, 584759931, 109573948, 937203173, 96881033, 305784835, 559854872, 894253854, 746366726, 951492991, 532579856, 822308583, 572042503, 397665465, 600979983, 914199453, 628402767, 594763006, 9791558, 451332658, 516069180, 651367831, 962708649, 687016963, 539878802, 107278296, 926059014, 371504543, 556987417, 447666745, 565595310, 778161513, 995461128, 121460302, 599892490, 242414970, 900391574, 362620950, 292857964, 495260535, 355054738, 176340034, 370047225, 509682533, 459314034, 40869728, 534741938, 788604648, 945028000, 701904601, 154924404, 695162652, 220536827, 615701976, 167761915, 833779942, 52430883, 368585637, 936409860, 654822736, \r\n613850019, 941559844, 357840989, 218223326, 721900618, 171013438, 597980462, 193395922, 949112044, 859322955, 354602094, 807705992, 347609311, 451694117, \r\n623122523, 252980054, 491785682, 13877214, 918727309, 750110421, 114981703, 174636266, 363160184, 781715298, 30575457, 862940854, 642129450, 34525888, 798422280, 792396821, 168367459, 344551406, 799847612, 626838494, 671596530, 167280197, 959000039, 614621296, 273560655, 8705247, 284372524, 940371542, 906010703, 582585495, 929449942, 308961449, 768816240, 674729787, 279648144, 286568146, 938661138, 536038536, 456529723, 18843013, 501518651, 457224675, 520694423, 938573228, 179014658, 169719825, 459657583, 302109678, 560375405, 556039265, 348713003, 957546568, 687116649, 3656313, 562760316, 716689588, 324677598, 570275686, 60738163, 996201577, 305457565, 38935942, 538451492, 228282207, 77975017, 389525459, 25000235, 152169430, 62331625, 618611219, 462328092, 106666757, 661839198, 177836427, 313546124, 392585017, 950280707, 551167559, 389204003, 77447456, 158414991, 766574847, 941433736, 363591676, 805565034, 312418363, 999641612, 122925536, 768845786, 608121932, 373163730, 783033644, 74564718, 894150080, 796617981, 274365270, 802488053, 947861187, 401960309, 143529635, 769621671, 249500752, 619408647, 849453216, 354838551, 69741157, 944781258, 135254314, 7413076, 416298064, 871313316, 343673168, 375656287, 868866230, 179060630, 399560227, 852555486, 987661859, 165863065, 12882359, 3688778, 380092596, 438366086, 720041886, 240796679, 588918084, 14802664, 17188673, 504951961, 842108931, 839289310, 256364811, 121095676, 164017670, 35340476, 875551801, 239615760, 262141182, 262741417, 456560451, 350350882, 777143297, 264469934, 807530935, 89546104, 246698645, 241166716, 125659016, 839103323, 418357064, 186866754, 179291319, 326054960, 172454707, 430532716, 558625738, 306201933, 61986384, 837357643, 575407529, 983555480, 13784333, 311989892, 153386582, 633092291, 722816631, 633510090, 551352594, 323601313, 248995449, 672011813, 612805937, 202743586, 215183002, 32688571, 38454892, 245790100, 451190956, 823199664, 12164578, 67389319, 584760532, 968838901, 307205626, 971537038, 836812364, 663878188, 468850566, 647599527, 839342879, 242347168, 169911213, 993779953, 251402771, 969281106, 416168275, 738337745, 8172262, 852101376, \r\n879373674, 929752458, 452163141, 48347012, 500253327, 672444134, 406391337, 665852222, 499704706, 116418822, 67956495, 994761753, 808150613, 251453632, 543431315, 143101466, 381253760, 826943616, 763270983, 959511676, 323777679, 514214633, 669340157, 471626592, 557874503, 304789863, 116939617, 503636634, 660499296, 659726735, 273788323, 704107733, 718417780, 624033370, 355000823, 194537583, 760997582, 289828020, 778033293, 933152490, 910945024, 644565086, 434509630, 289427510, 502291783, 421699389, 159196930, 834667293, 313599675, 560298831, 812176354, 865521998, 126796474, 886921339, 937011401, 791993161, 583948688, 275408655, 665183437, 130342900, 699431744, 117550047, 460234251, 56770880, 306091228, 912949106, 626369877, 852501236, 241076503, 262988042, 737247015, 831044258, 475123008, 928949542, 332750699, 696284377, 689111142, 196862045, 570365577, 187156806, 451528865, 635110126, 385331290, 263486377, 200189955, 206842029, 457862597, 450522487, 818984909, 710634976, 461356455, 71985964, 781500456, 467334209, 46762760, 97663653, 870671823, 255977331, 79650379, 32876340, 636190780, 364339752, 597149326, 452604321, 748186407, 302032725, 779013981, 111971627, 175687535, 399961122, 451853028, 798326812, 902775588, 362836436, 498862780, 160000437, 629259604, 919729986, 5994845, 631476109, 371320167, 76164236, 448643023, 945220853, 111192011, 150577654, 827274836, \r\n17668451, 938388515, 88566735, 27940328, 882026632, 712756966, 83642744, 873585716, 638987456, 405271094, 822216133, 345587303, 668558160, 314983205, 826678060, 563583341, 516998387, 77703032, 726563479, 155257773, 49705622, 891556456, 164127879, 842558039, 189099480, 956148983, 992226557, 671472701, 137476493, 871069222, 78241093, 728497057, 278888712, 332713952, 222597908, 235198692, 876216003, 167364357, 722341150, 519365334, 604855967, 834816722, 850786742, 416385106, 608404143, 311628039, 507077268, 571796589, 506398832, 305540948, 556971113, 444565912, 866477296, 411983920, 905854221, 901986568, 512703782, 684027511, 596294441, 916862272, 495347444, 802477106, 235968146, 257527513, 528476230, 969655767, 772044489, 682345813, 66418556, 603372280, 439233253, 278244332, 590581374, 353687769, 321352820, 245676729, 325255315, 91010070, 923699200, 837616604, 736177081, 528261400, 876353388, 339195128, 377206087, 769944080, 772953529, 123785293, 35984916, 461119619, 236140329, 884137913, 625494604, 791773064, 661436140, 308509072, 54134926, 279367618, 51918421, 149844467, 308119110, 948074070, 941738748, 890320056, 933243910, 430364344, 903312966, 574904506, 56353560, 861112413, 440392450, 937276559, 944662107, 599470900, 458887833, 962614595, 589151703, 997944986, 642961512, 63773929, 737273926, 110546606, 654813100, 374632916, 327432718, 307869727, 387738989, 133844439, 688886605, 989252194, 303514517, 79062408, 79381603, 941446109, 189307316, 728764788, 619946432, 359845738, 216171670, 690964059, 337106876, 762119224, 226624101, 401879891, 47069454, 41411521, 429556898, 188042667, 832342137, 770962364, 294422843, 991268380, 137519647, 903275202, 115040918, 521250780, 783585266, 98267582, 337193737, 717487549, 510794369, 206729333, 248526905, 412652544, 146948138, 103954760, 132289464, 938042429, 185735408, 640754677, 315573450, 956487685, 454822141, 783819416, 882547786, 976850791, 307258357, 929434429, 832158433, 334518103, 700273615, 734048238, 48618988, 693477108, 12561960, 598093056, 154072663, 174314067, 345548333, 479759833, 658594149, 282072153, 57970886, 905112877, 584117466, 472359245, 776860470, 324216896, \r\n334199385, 321245477, 508188925, 521442872, 286692969, 245141864, 59342176, 896413224, 573301289, 869453643, 87399903, 60102262, 835514392, 493582549, 649986925, 576899388, 20454903, 271374500, 589229956, 505139242, 789538901, 243337905, 248443618, 39334644, 831631854, 541659849, 159802612, 524090232, 855135628, 542520502, 967119953, 597294058, 465231251, 234577286, 719052510, 789471692, 411491704, 668377891, 706834582, 422023943, 792130239, 56910783, 349097771, 439515696, 582793988, 156362001, 871022818, 158045277, 730259816, 559426958, 256915266, 329283283, 697482888, 960391034, 123468695, 579143166, 327986560, 79631804, 964001442, 653086198, 325933878, 489825670, 951221162, 253447532, 918073506, 495882514, 437557069, 568958468, 878752857, 195186711, 862939349, 147129230, 115349386, 700159857, 901914597, 465268401, 965390262, 480684700, 912028983, 463482127, 140321226, 622996408, 650138382, 875669593, 293215106, 870247261, 647509675, 191356165, 394191128, 264457287, 22229755, 885646235, 701645436, 689404012, 591670570, 853743454, 343300941, 378943326, 701554144, 156225357, 2889895, 342055363, 509897179, 551690113, 367720364, 376094487, 849019040, 439429817, 252052684, 73868483, 760418168, 346915118, 920898843, \r\n447178329, 385053562, 971326177, 51306779, 868878877, 918456746, 907129483, 469300868, 116182130, 263397251, 880193364, 525080002, 122871305, 806849644, 530429964, 847669634, 687541589, 667011277, 118523931, 170573127, 639392716, 932978326, 774343957, 207807859, 842923829, 540551499, 416145341, 510754496, 816754956, 141636722, 23806651, 797052893, 280494679, 862829535, 594152581, 255543303, 115355697, 175045725, 753843569, 723238162, 747819906, 386991553, 128492007, 832023330, 744470732, 863287191, 680479465, 130566353, 522384815, 948060953, 988598293, 251269107, 279172248, 330642890, 181200913, 328948704, 246020831, 591010814, 153193674, 653998011, 556727834, 698201487, 743237304, 352457449, 890844797, 603241917, 157033196, 449941679, 638367564, 984812222, 177998527, 2571553, 750042962, 530815355, 288367133, 461215488, 306469961, 992599117, 777647122, 399661615, 272381646, 374837119, 242312039, 161562546, 827703689, 416130810, 268500166, 714440725, 924015517, 810481760, 456828202, 72636095, 869441169, 135478090, 577861476, 965681815, 770306429, 828371948, 121495878, 318644526, 214238807, 375317282, 562894926, 654880919, 524133599, 836560943, 585920630, 997910416, 42528257, 728160105, 603551810, 828625420, 554409298, 238464512, 177161223, 100273300, 196375686, 910350531, 998271395, 89571704, 388544422, 710014768, 792862078, 613945077, 723008570, 686703020, 22036201, 441451327, 873721233, 952341622, 208401207, 715584375, 789944965, 266619033, 217395995, 773848269, 890384827, 300797636, 380816274, 34903719, 678806492, 676280389, 289577112, 105926126, 869766187, 148780908, 257383939, 219966442, 803001268, 700100239, 210002874, 301574146, 157478049, 840543689, 686351647, 314215877, 410846915, 937595078, 977587055, 278410396, 246162057, 596680745, 648102814, 608559339, 984991657, 553308172, 698308340, 597673022, 215493168, 637106249, 635651739, 996417162, 20600016, 45948552, 145419282, 398624765, 886248008, 280688420, 990103967, 373976190, 463758914, 783793500, 187773366, \r\n224028141, 773609709, 441552870, 199621056, 40675250, 623126900, 565714966, 335545822, 159154993, 85804280, 812981639, 368861355, 263240192, 915786186, 213839773, 740984710, 485869373, 498675063, 165824754, 290318079, 268829808, 783651320, 140938011, 452184509, 663073463, 628576393, 561374703, 77531765, 675767665, 219965958, 79658403, 107004356, 726095143, 920360, 616856163, 322049704, 990876102, 28813501, 479588212, 607362861, 460280414, 510630785, 175868273, 203301031, 485282804, 286980722, 878779105, 75802674, 482160716, 276534454, 573231888, 255171286, 17004257, 477221305, 993797117, 887907148, 900621768, 281553637, 974877491, 662837174, 881584284, 143891298, 788461099, 484372545, 234443352, 97386042, 189777871, 766423259, 328443566, 335362850, 282264191, \r\n79108999, 502600487, 66831947, 971718237, 145123063, 700669169, 23599039, 235633035, 21658772, 153187595, 708544325, 422877598, 625792818, 435465528, 861682463, 587577924, 669558001, 869495722, 230312480, 591055605, 666486499, 243050200, 473838909, 27804857, 462415564, 950758578, 82353145, 781652464, 797013128, 92616240, 57731412, 892900687, 229089402, 904936873, 28021044, 317392328, 490036476, 341291194, 295406868, 504259794, 904545162, 177495104, 126802846, 533220218, 170328984, 481957953, 536305139, 91399510, 852175302, 527902344, 87661066, 498256033, 911769401, 573782791, 711777167, 299000091, 513337058, \r\n706321263, 160995082, 814524139, 525871668, 195621157, 738132050, 522997791, 2434339, 704677890, 179392879, 463736985, 195948444, 891566998, 443954734, 659925991, 686116169, 118001951, 702122944, 894935402, 524221451, 870490275, 257812667, 353690750, 79038280, 51842966, 172006600, 855368423, 443051385, 833006149, 793388156, 45047516, 310749296, 55334141, 476038106, 789821303, 989259156, 92410347, 952627287, 780501091, 521607848, 414474244, 732354620, 383953563, 446473628, 47798390, 211676203, 955208289, 430733124, 736382777, 372402479, 892472676, 106885144, 711152183, 345330469, 113176297, 583546541, 989005026, 879834861, 485880880, 956976046, 984532018, 52156620, 47648864, 369256591, 762990216, 321648688, 942471724, 27988621, 375153599, 201826211, 552096241, \r\n849164915, 410476603, 769539074, 245294254, 109098731, 364713315, 114339783, 455317652, 924912076, 137615956, 395117205, 557940960, 863964666, 105090076, \r\n247801074, 24385891, 675217117, 148233675, 237796036, 267148517, 747252134, 159286828, 772859689, 833502336, 12089815, 579434685, 660378688, 142383709, 364553928, 506871962, 63571691, 436656533, 189644737, 4484522, 875871934, 496258534, 98322767, 206512541, 908548828, 186809636, 418511401, 370060629, 996606436, 442572716, 154923425, 655048065, 843219464, 519344828, 890739475, 728038428, 667374443, 105405472, 292120352, 508232068, 694276070, 275896293, 616495821, 717513444, 672047542, 667827609, 286709621, 704857149, 471988636, 773414271, 187159700, 149544869, 138170870, 275199585, 858826314, 233329181, 362574598, 146271226, 662515245, 829216547, 225214790, 124306162, 309454143, 197474276, 411732530, 242616829, 533844820, 134228075, 970933446, 121050937, 143853408, 213411089, 88503415, 587297673, 956972957, 898645724, 144360772, 495393279, 240440157, 48990349, 125071961, 372998637, 993591967, 447818597, 572817648, 570422850, 879902545, 103408312, 134259907, 930409822, 164624487, 863575259, 498058201, 155498663, 836184597, 458766416, 930173542, 571538117, 11418714, 840080841, 550409715, 404747438, 623701621, 932591967, 629475701, 333771046, 357527706, 50349542, 809404172, 32680726, 849209271, 654679673, 976256182, \r\n483903197, 443666371, 402713876, 474069026, 341242805, 911892825, 675361308, 130029471, 591252074, 361253837, 913522319, 278883270, 43794963, 721032507, 161360783, 145910425, 405754709, 481016777, 984160489, 822457748, 928311887, 130974820, 814330706, 177596547, 733463623, 621380033, 387616190, 517385408, 777415503, 153714220, 110237540, 9459485, 42997688, 960820193, 653534059, 922402599, 402532770, 710802128, 748496037, 6962540, 307859858, 895756782, 173853056, 365387768, 285351176, 850992797, 171012376, 50849689, 959534160, 983404681, 462930073, 986727862, 351078980, 113001189, 540455687, 812936681, 344829242, 636939290, 665237416, 829160482, 973596376, 437524867, 316466374, 748561837, 622585657, 72315288, 709519702, 535489757, 179411549, 14687103, 766718776, 724290113, 509214591, 798686957, 807530292, 780437674, 108972011, 66354235, 288836149, 800959762, 56647494, 378319675, 484934256, 634925922, 118283138, \r\n572458963, 317907676, 592543101, 905775554, 280439197, 958195289, 590807218, 612877898, 952147555, 84603090, 423405775, 141749054, 745201534, 444958373, 246984748, 877512200, 773663916, 713230134, 971631558, 825024421, 705218938, 498046250, 901741714, 11204058, 973762786, 108832572, 657975477, 641555020, 752370849, 662157143, 844714372, 71560016, 272265622, 769825878, 963355137, 271925609, 601872616, 791371246, 985365315, 883526650, 143820141, 681544627, 844266906, 816285053, 966773693, 452262255, 249464970, 77561862, 707304052, 929265371, 267800589, 849423016, 370900035, 899540394, 496756946, 419245752, 150124480, 355379985, 829768917, 819198320, 321308816, 995185058, 180983950, 83286465, 585095540, 818161019, 174613777, 715687449, 562738802, 101523867, 964327160, 374016629, 999296099, 512710137, 381205438, 711887867, 298639663, 807093917, 426312452, 960211071, 301947471, 948009687, 37226626, 56446923, 6020904, 661481230, 969721602, 665206397, 545945632, 119445627, 350615105, 415266278, 450388738, 582376903, 127332755, 897189927, 82583193, 969330803, 584493269, 474288141, 812261520, 918866178, 305252256, 496593547, 375145972, 845005953, 16384264, 18866120, 291452703, 123859568, 84188419, 420335331, 701389288, 635765443, 282586280, 819530631, 184344737, 302086904, 549271705, 110885458, 404203288, 873436087, 664527613, 618848752, 424389906, 133964398, 32248933, 991819218, 674742116, 976617480, 696056191, 975648361, 22512421, 380736722, 472796955, 145592824, 733308250, 839860963, 928844916, 526271384, 823978116, 935386950, 13742315, 129661749, 286343623, 26005094, 650424222, 436019622, 841150055, 847904089, 585813828, 866928172, 640895240, 927092785, 234673913, 790416262, 601132552, 286508434, 37434388, 458552446, 225861108, 938954209, 179547110, 623374115, 336961349, 778335347, 120759871, 546685885, 169450333, 117137956, 907333492, 697929695, 73324777, 5546281, 31038646, 272708278, 879099648, 725361184, 643797655, 381543156, 201948307, 905097895, 5083747, 864509297, 418729921, 758799900, 71385907, 56612274, 584054216, 422628745, 963836513, 247866986, 468338401, 429731689, 301064989, 964252649, 754708694, 789609947, 325094454, 48041674, 762490068, 872064887, 891148606, 111273850, 528877281, 505307258, 927529311, 827023136, 927027842, 480792693, 898759590, 336125656, 525799954, 262312932, 42566148, 156437685, 312663449, 869490710, 110170793, 611737225, 489302480, 962027769, 69292153, 877615246, 933395086, 623382750, 952249866, 449250872, 44137878, 377547991, 8734456, 849028671, 689297867, 880969148, 611297405, 699203445, 279063732, 985579869, 361286737, 574192554, 210756284, 582330472, 687115287, 346797527, 68379989, 367272674, 922968317, 923358181, 114269570, 643568783, 54463451, 387194025, 448687201, 183771730, 508104225, 443537201, 16323128, 434151553, 970819813, 254326763, 435712770, 366483023, 408137530, 805502289, 467214548, 424919102, 892285776, 873646206, 416987903, 259930584, 326240034, 983819250, 434558165, 163789709, 528191397, 421000628, 742256219, 723869231, 905947997, 193529900, 451441953, 664004027, 437922126, 29916435, 892121538, 122323150, 325806901, 879829857, 669394967, 598444309, 424679948, 81290040, 463345756, 781983914, 563036786, 484150060, 639468002, 313191411, 180413287, 247502799, 528925528, 575480041, 635027335, 256975213, 912107856, 494502312, 441723047, 683852309, 990247207, 92438089, 476487459, 501906050, 463868265, 884062263, 124480261, 845159716, 789710443, 527998839, 603629355, 145811239, 533233891, 588584475, 563430691, 591671108, 370981332, 756530935, 80379648, 484171072, 175010221, 373865064, 191818129, 464489510, 929000671, 391717125, 747091853, 439867887, 903187939, 60434199, 688760991, 940581714, 174982608, 664591196, 809151381, 512077202, 296167992, 253587796, 909751994, 870392927, 50596757, 147012264, 145592173, 608048527, 790444659, 695034282, 425391314, 566706, 238458278, 556740782, 530945616, 37163071, 887535641, 336847666, 574020737, 251493906, 561926332, 79276934, 598441685, 292718605, 741701246, 806386665, 781362104, 601715998, 722420070, 71607129, 765657095, 577043295, 110457871, 73278570, 917286450, 582688793, 233972812, 773838073, 563827083, 665183297, 276385337, 284554052, 773942585, 709884270, 219724769, 802098221, 40314526, 670328543, 116354242, 8105772, 138315187, 437875308, 414489825, 792924722, 367103146, 598235884, 590708626, 500134923, 616512272, 778674544, 24323011, 574009545, 753151007, 445226007, 168408056, 814317714, 828678983, 445766238, 667740615, 220352863, 408445465, 164002975, 751771873, 242270577, 244789471, 960125783, 577250843, 986752672, 134975013, 857262769, 365449378, 893920171, 521472111, 420799038, 55200287, 382558852, 460995662, 287489292, 972216032, 928724755, 820330965, 844857857, 479505444, 127468827, 342360282, 538971087, 991812633, 347890429, 352213886, 719725575, 711601768, 345059156, 723718410, 2412874, 673137480, 106246833, 845542253, 54784761, 441554946, 992084156, 896406516, 423823171, 237959509, 611071505, 976306302, 127377556, 813035294, 866686778, 797851519, 891038077, 446861418, 558723079, 335240540, 933421654, 552658325, 101044567, 701569567, 79619708, 113230746, 18709190, 489414563, 794070733, 654683423, 737364094, 603190309, 709749175, 964043164, 743384329, 61722307, 357502072, 765005005, 822707526, 522366109, 182415702, 12257063, 892793242, 776663000, 209356976, 316188695, 464233826, 518121285, 702595779, 847947529, 882970001, 24006933, 286967513, 743911598, 859784525, 468644940, 151255407, 266755785, 749315764, 871214347, 732746484, 498557477, 378659343, 284143015, 191315738, 524459024, 285599248, 93571847, 232447141, 651095775, 327322781, 926249193, 301563041, 16861825, 312874690, 968199568, 324054125, 476106501, 987634072, 405576308, 579381657, 124890361, 469844398, 504791549, 309708702, 847186504, 599043886, 784070324, 134489423, 968500796, 535624525, 557985688, 739059475, 282824172, 962974241, 673756999, 629288514, 602290478, 272032130, 947687367, 458958305, 939540040, 555038128, 725720859, 249129551, 70784066, 779816802, 32338884, 936893404, 590996290, 722093366, 943395887, 870675690, 794167051, 880783877, 567985820, 122740218, 1655312, 513185141, 556598680, 964463302, 80469754, 320171951, 916790701, 833281585, 803013531, 724614577, 817147362, 215545611, 669243037, 468222858, 43075712, 259747142, 560617179, 557232222, 815295691, 469821555, 88839134, 234345180, 504538244, 931222273, 316768673, 93980273, 45787668, 385011442, 7000216, 276055907, 901541982, 263333020, 711644240, 672882808, 208436297, 874853962, 319638303, 709012275, 766991341, 242486025, 901858138, 25494048, 914909510, 490103036, 270682019, 56150061, 827555535, 441238409, 568638315, 609478787, 43668184, 778841493, 253152410, 234178145, 558425422, 116282946, 484472427, 896792258, 158785628, \r\n612324179, 855203574, 567081270, 136783738, 955558104, 935056189, 535784910, 760076361, 686203275, 790667727, 647858777, 739583434, 514020926, 126992398, \r\n285502081, 656335212, 647425455, 33377104, 953034122, 533751604, 341214710, 51670793, 224130859, 79086450, 751898173, 815278055, 368308879, 879753575, 570758226, 530448720, 311816932, 24499573, 385102108, 314279398, 823094070, 57424571, 801802086, 649238305, 71828091, 22610945, 465622250, 634357293, 250987906, 279815083, 399059669, 993491643, 764518066, 954449466, 786784520, 7214491, 309348562, 967927912, 814966044, 398277161, 145302827, 317133297, 555908849, 763209806, 713959725, 917219494, 614866982, 743039617, 6642256, 191926249, 75564780, 402715373, 438757202, 956548036, 88836445, 126738459, 148256690, 758649280, 233870039, 618496251, 809592911, 4143797, 913788017, 867201282, 838208226, 17995950, 926304169, 323062065, 147836722, 23987125, 10273949, 318414676, 859196334, 785963456, 319241611, 41814946, 97841520, 709446413, 819366149, 257049767, 457365516, 227964197, 837685221, 538289909, 799856513, 966795605, 976754791, 178585858, 773647150, 490152461, 338761936, 704848398, 751454546, 275917899, 266521387, 379163892, 732553223, 468451968, 912252890, 353635318, 325580773, 655087561, 66231223, 390508011, 709093080, 917609272, 118217468, 342802338, 425495681, 210359565, 872062939, 114650850, 798178048, 240314279, 461414970, 850135439, 678881360, 816005189, 344526423, 545625731, 814858100, 282298848, 248261162, 441581677, 613473579, 62751489, 33573817, 398948289, 990945304, 957428734, 586423324, 374186675, 501817598, 451350729, 667813355, 230043968, 430675019, 792996317, 514624055, 229390940, 191135921, 92904209, 991467282, 756118622, 897899024, 86813518, 245048982, 128292209, 304817237, 405182882, 719453056, 948320663, 716710140, 287983103, 891632298, 470908467, 296100190, 863281789, 611713021, 526088214, 378706769, 954194006, 547356546, 897702735, 776099604, 536261363, 118236230, 77446392, 871928365, 712237602, 734212251, 530900683, 264862566, 573128964, 269332327, 501953313, 731839605, 324552247, 548793873, 732865174, 679223519, 153195583, 391080223, 137458334, 111476085, 941570307, 599582551, 860117991, 24311430, 568378943, 976453414, 93140555, 924998399, 797791391, 305274325, 933544108, 966122171, 199072647, 554723613, 123210567, 237194670, 939649941, 874393737, 68963050, 248387629, 921696393, 100076405, 553210, 553123253, 383040408, 860520334, 542130950, 780888751, 804728977, 530996929, 227054360, 801731642, 988113522, 23599213, 912821640, 452000676, 273952452, 785650598, 957099748, 263587335, 191147876, 369131002, \r\n581437918, 75734722, 972440694, 949336980, 681719418, 303142016, 282497467, 84697781, 656044124, 602133016, 542205342, 67532450, 649765731, 327502924, 870829264, 157614729, 290634638, 28895643, 756796380, 66928168, 908244149, 336235000, 798635646, 531101996, 308603330, 965459608, 802063684, 630259662, 25285254, 127977391, 731151666, 816996517, 5941805, 863406538, 534030846, 760562334, 177298416, 74254907, 61946069, 701173267, 849123211, 223920336, 402070982, 451070134, 290145526, 801137767, 361873174, 226033212, 345711558, 976935938, 727275819, 657949261, 558334514, 348442214, 92188878, 65931989, 884423257, 273776772, 82578780, 21964812, 692310791, 421747940, 508956345, 829867055, 712216434, 176263570, 238968707, 885589964, 2338761, 920235106, 44122910, 32361391, 987895225, 198653318, 438724958, 821576158, 413646707, 734510118, 694541860, 478236028, 871307989, 619578531, 583875161, 538665108, 498234236, 109168946, 711366765, 383677711, 189350089, 431386463, 405617925, 478935614, 186431243, 998817197, 151404153, 870193461, 686428096, 703459265, 503264393, 571307514, 950023327, 52020851, 422745802, 801945360, 920055073, 915984291, 347325376, 98035239, 768254438, 950963903, 843326252, 776558676, 625359570, 136688769, 938973757, 513573431, 218450925, 304988995, 255220477, 170773124, 502830499, 706620213, 747086020, 19911621, 347253477, 413125153, 150131943, 714133549, 831405303, 873772059, 433086939, 505167849, 521500425, 39997099, 218457179, 141292841, 227146672, 516991167, 631669176, 520404230, 157222018, 152022453, \r\n786192855, 867580315, 257431544, 642749792, 259184063, 423248728, 481776217, 381066154, 161987227, 908479451, 229680706, 4607796, 335963167, 659541556, 124330160, 563861103, 945052724, 252546645, 796966099, 986082050, 874261765, 930288819, 330451071, 823023820, 393946353, 443991161, 659431769, 598434736, 320551388, 826940781, 349722244, 927104771, 902855425, 99775627, 210252064, 588340945, 190379481, 33740332, 282387632, 302756352, 997374101, 68047725, 104398307, 210353356, 835930466, 462528846, 257838917, 145554240, 495502023, 182049010, 207210386, 332673437, 984949587, 646987066, 242536749, 961166177, 743023397, 178108654, 533313586, 2523508, 123632073, 920760453, 876215269, 694623347, 576910047, 13998909, 432579306, 821994396, 188161473, 532239165, 398969517, 805882924, 572487140, 324260878, 780110448, 998237225, 671389723, 217079591, 64156923, 701874462, 402932050, 868969247, 250055006, 307603415, 902155269, 432776345, 123649275, 43843299, 467745849, 427227918, 348782844, 208429155, 939342091, 583928755, 24727360, 605633247, 506517137, 134487038, 141711391, \r\n852373938, 803417028, 981730834, 781218680, 368454373, 731000220, 700286474, 535838839, 93732613, 806735582, 444862454, 793071677, 404775345, 760935573, 234741359, 126536891, 752651452, 274374188, 971026218, 714658459, 451790511, 985231339, 672712756, 803040018, 510520992, 547998421, 286082520, 335454992, 294741562, 198101705, 274996785, 919806186, 194403413, 368313678, 793945588, 840134358, 497861696, 674089807, 486053576, 756708235, 775885307, 753307778, 78059116, 530511749, 242555288, 720602980, 668724632, 543930645, 759067502, 813824210, 518108164, 87623363, 404803860, 601147669, 681300598, 912536592, 564743137, 425731312, 765623182, 756271461, 802910224, 312059493, 853998841, 209903286, 641228584, 998778463, 548722153, 23286197, 186002856, 149093256, 796935817, 569560120, 939030507, 23065276, 615945246, 567464926, 520594270, 609042093, 964853363, 227264175, 350138850, 675012989, 102765593, 69280617, 158825574, 648868661, 163570693, 757437549, 925804636, 570754867, 805613198, 926112760, 653862900, 954295487, 312827086, 150778409, 706495883, 540114444, 289948046, 977757745, 572076667, 954401054, 877219043, 630010040, 768113291, 261966834, 334008263, 634421112, 445932311, 970883941, 415840474, 73583190, 115547261, 230769726, 248921513, 752058877, 494518837, 784955440, 76806346, 783891026, 629506235, 173700082, 12516760, 832882264, 897704072, 856345120, 377590660, 3991684, 830913453, 206929253, 230294838, 357503801, 579705509, 977384894, 681905980, 79909239, 447541551, 7742855, 966838690, 485329071, 267788198, 353199712, 716743917, 615389391, 257812554, 614776630, 833547538, 934946282, 84784365, 932460698, 591304822, 657760700, 625210023, 546945046, 155462373, 657439817, 28204066, 960569202, 802685196, 805100004, 168310959, 637231710, 801092711, 686896377, 325954515, 772086933, 174154800, 968758045, 290125431, 924062606, 676500183, 766331753, 543812360, 545688026, 992636566, 600415168, 495578897, 149898661, 206181268, 160006748, 482372979, 340076727, 380981376, 992266501, 965982115, 651321357, 710190883, 460264183, 746530090, 921510687, 859010088, 744989130, 914531666, 774265021, 767425610, 803604743, 903328371, 203905462, 323178647, 218539877, 540423239, 206565172, 447749162, 59294271, 657333616, 600021767, 248327314, 224811759, 133852147, 773357564, 491237982, 749602560, 927334495, 258767729, 902840608, 737965679, 175911702, 908641897, 171726886, 399437317, 33798079, 983592077, 657297361, 586413721, 367033979, 763419961, 400211983, 381627208, 916325875, 521711639, 968152365, 814438783, 984832168, 850240512, 385942548, 477002462, 873399057, 851752845, 760779790, 954009553, 286598146, 234257516, 893488895, 915147590, 824057314, 754759283, 924203373, 166308788, 377655329, 658356191, 77925001, 642953992, 53133798, 249284, 163196894, 516480739, 956481041, 511884676, 479584457, 418868828, 445432156, 253676843, 882495293, 347065993, 960581459, 776809266, 575402256, 715362343, 326651615, 410750796, 178282727, 488073348, 213287200, 315163398, 654280910, 214733146, 910676638, 392774266, 89042697, 122304384, 671346513, 899072602, 223545271, 112553393, 545595520, 667136246, 923338807, 389766173, 642823657, 225009453, 237976685, 603952906, 604954431, 448286978, 6116509, 822661601, 839922055, 885169106, 2937602, 100272146, 242769044, 754102777, 186552416, 726462905, 479285748, 799251243, 656307405, 404811396, 114671384, 157884003, 373007875, 136394658, 303714946, 887751292, 319702126, 976827776, 24664677, 956252457, 580872506, 795184938, 446039064, 584389535, 280081251, 98086984, 898636541, 351914721, 56123220, 217802329, 239031186, 263830759, 787721167, 432493263, 136308350, 410148768, 665331271, 116382935, 881785773, 158247199, 976010538, 287627545, 344091402, 517265690, 502754944, 867634704, 127924474, 994063228, 438228974, 252509498, 917547774, 219351222, 179140586, 879570145, 446424791, 598664872, 810091669, 811051967, 41766801, 77999985, 347379651, 837204262, 751450824, 137422154, 489004480, 77481844, 968707898, 627565028, 446603792, 997709702, 905638002, 314900064, 584913495, 679282762, 63151571, 613579483, 176773581, 639714930, 124697076, 29154835, 221402002, 602862274, 573127297, 55105017, 86489221, 636535824, 558948002, 373064984, 96055774, 341955245, 979618769, 139761536, 608115079, 46321679, 819080491, 363627264, 908523899, 25426621, 736776258, 728028104, 722340331, 679437585, 92361862, 268276865, 957316642, 775877878, 517199404, 55339976, 337173128, 16244235, 73548531, 907247809, 614722723, 676737112, 797697740, 970384411, 819153580, 746413406, 336362789, 143903898, 325601510, 660427306, 646556777, 705705150, 825596521, 899167909, 974149295, 801608882, 435642318, 339748548, 145532586, 188124599, 202038073, 537935910, 19852239, 618405925, 836694540, 257290432, 99624063, 205521165, 480524942, 764214187, 983058658, 739181349, 991588823, 821479637, 474896491, 843125404, 902902039, 434038615, 482005052, 309778524, 213890893, 112548009, 228170300, 228913858, 237742538, 98260579, 875715955, 847340252, 482823108, 994685812, 634317804, 73086060, 974987285, 171715192, 400561524, 84120543, 398246975, 400053735, 614594517, 273094925, 487841415, 96109528, 254121341, 188862888, 129402910, 285303332, 224944190, 876461045, 497121551, 883257886, 628585763, 813420929, 602398325, 846247642, 781797790, 159486538, 191652286, 363752408, 119574782, 119404407, 473428778, 422808713, 834257584, 729883291, 605323235, 531666959, 752855907, 297473757, 587854857, 466104689, 309490685, 429817962, 29259486, 655583795, 878261213, 162463164, 216924466, 793782283, 253707580, 493516383, 747785119, 860008982, 883607144, 571176958, 469930743, 720448928, 864437165, 911798790, 773745200, 553284135, 12852523, 149561968, 705585339, 912838263, 196729971, 974700392, 576403540, 845337039, 407576381, 51759145, 842628006, 225798491, 45357354, 207017510, 278908914, 147436429, 369028530, \r\n914688682, 656017784, 148577916, 481996096, 917870766, 665474094, 954582480, 702918162, 852176976, 799952889, 105752755, 797498417, 657272247, 764507070, \r\n721071560, 340462765, 44054647, 982826883, 722125878, 807752721, 237409731, 118387213, 598872761, 861864667, 868816504, 37907354, 90650401, 759048609, 948653472, 740914704, 986035761, 337866534, 813652821, 112621335, 967270715, 808673012, 513731357, 157139524, 608329815, 714568737, 620341980, 176690553, 10113164, 670818247, 992055431, 829652132, 442439145, 915160932, 227405442, 843505121, 361934917, 606719558, 865219010, 901434008, 961736267, 95726579, 456117795, 959699774, 632613691, 215707123, 766649783, 17628901, 957876411, 610734863, 286613402, 84080236, 454755231, 362500700, 951384565, 938767647, 157215866, 606952868, 562260315, 147423970, 847327703, 953247710, 684617511, 425416127, 158231183, 113300833, 26208012, 223900820, 178943327, 124889390, 974154272, 345108497, 183157298, 482172561, 954456090, 33723553, 348234673, 512960465, 901999824, 75690657, 892258917, 376253853, 197124773, 573851514, 825365830, 876668772, 492221683, 370194627, 230411712, 73665816, 746855386, 774149580, 447221572, 242944596, 1657073, 937093884, 275909647, 159195660, 196231989, 13719266, 377406663, 878733209, 284975277, 697022838, 163930514, 685660859, 573490971, 219464572, 792207680, 419915378, 59755527, 711995865, 352172770, 177458894, 549207120, 84952794, 845536171, 229070291, 595646501, 444678650, 843197768, 598895566, 829022322, 702880311, 299504453, 612917898, 530129405, 799105762, 739366183, 924364333, 267696814, 162727362, 179490331, 473432331, 534991212, 637821704, 914797165, 86383160, 342204576, 739970551, 205511980, 148448232, 50125077, 216839688, 609597924, 295307892, 100383201, 687425809, 496401478, 942621091, 866842266, 584698063, 600559163, 244630378, 41673212, 289077711, 5288572, 166011867, 568093562, 38011190, 66596430, 720417597, 730781882, 938845175, 41401250, 581549495, 247564101, 915116130, 737120686, 904114788, 238643084, 361049116, 58769726, 374829370, 347538358, 73610328, 535972073, 760057616, 332914393, 348872182, 312207668, 239902718, 416281963, 799744812, 665295661, 475400552, 764453293, 785167864, 820492158, 652958242, 396013593, 186417701, 266654097, 62481151, 457851029, 710106631, 894980823, 918511639, 424847839, 83377735, 676032451, 232747963, 55363287, 864883312, 652840853, 792577297, 340806898, 7129019, 79786334, 71917363, 988353583, 756506058, 877086952, \r\n226602674, 755229910, 205075489, 665223599, 36302441, 641526304, 394191337, 395816116, 40058788, 26003088, 884574270, 346259015, 156934965, 150286058, 532806541, 783628257, 761162536, 269330915, 515571949, 125265189, 868585662, 15193317, 13638524, 445397865, 789071500, 429865568, 692525633, 571151495, 468589097, 985078585, 8738505, 768737652, 424149800, 927933306, 595753133, 147471344, 752747830, 810662695, 229721846, 276497895, 80673101, 40982210, 664566533, 418384873, 509565544, 396261051, 198805918, 376916007, 520445351, 26069264, 746547119, 827177752, 890439530, 208117151, 662149483, 902873967, 89656728, \r\n626577454, 525778994, 448966716, 294496090, 589827651, 485410307, 81055823, 163094560, 430841743, 227755451, 350559889, 400457233, 763171482, 625836500, 22834179, 627459637, 664571725, 641091398, 87523890, 835619132, 264622955, 556433972, 234037235, 740015592, 749448018, 136705743, 875958200, 781727755, 262593950, 377071112, 287361259, 251459000, 226506094, 785011112, 182617900, 503067523, 177491367, 744791485, 841391868, 991362407, 72771080, 15897432, 634435647, 536730331, 75564272, 592474472, 767669679, 932661486, 545933473, 828204225, 23364141, 206055418, 99433027, 450395917, 828580982, 994101286, 730199262, 834474789, 942235184, 438458343, 831232641, 170237827, 176653711, 28851952, 898612582, 955949959, 284592263, 598083729, 72026978, 833361823, 997336279, 802780162, 257571932, 913260521, 131092923, 179299796, 430029308, 80200796, 748675279, 394460945, 223224805, 861541957, 648625724, 952835950, 714212697, \r\n712630553, 827068254, 6220258, 862718436, 758717398, 134000853, 890452087, 954037300, 700137921, 52400131, 737449453, 778818328, 964440109, 157556106, 862098819, 475886813, 188169591, 321844941, 358187617, 486076988, 371752732, 522436829, 458363370, 916042824, 824282493, 870368749, 234090231, 382254470, 876009198, 867379440, 441874017, 451889445, 401002002, 71565786, 578553363, 952110616, 375047959, 82296421, 820671977, 991031494, 495553975, 318393614, 289645491, 303940736, 310305295, 139833848, 171735903, 680918939, 870950039, 80820134, 533787967, 990752242, 733762005, 684973377, 618675448, 697509683, 21524406, 161487408, 89900746, 616581800, 938589544, 739300366, 264491524, 95000259, 620335204, 720102819, 910541916, 60553591, 930484845, 126379946, 769095987, 241468798, 87438169, 978752999, 735173042, 784079655, 406982274, 462126006, 593737770, 631469321, 930967998, 571662179, 414460993, 940595606, 646681502, \r\n834242172, 705344102, 163724492, 540216275, 798619927, 296094961, 388793049, 446892341, 245592617, 405829736, 826625617, 541696816, 924110952, 571386583, \r\n170381588, 286440531, 628592057, 240312304, 815798324, 212958782, 786830092, 591593879, 447466194, 110458675, 922095238, 406807928, 192139628, 586822468, \r\n127221551, 756211583, 215304909, 120911147, 421620406, 706780593, 813893815, 871456528, 657374484, 602303197, 818093979, 977823052, 292502231, 776865831, \r\n997676763, 191433620, 367547362, 21503695, 406665710, 19987461, 675020083, 270495383, 233560344, 809495165, 374861604, 714274215, 134544133, 988366311, 610257209, 952056745, 682142075, 351829212, 394867876, 585591636, 105599323, 502791075, 745532176, 40805281, 952359136, 372616020, 507150746, 736192706, 24232366, 936897605, 889827967, 310611568, 70117444, 425197583, 438973825, 164021800, 930036413, 278611346, 557614674, 807094155, 702391648, 892745100, 892395502, 566001463, 874744568, 798254209, 409070955, 277287968, 779725312, 564826386, 248823665, 439014091, 453864182, 82310077, 523719495, 884719908, 367078309, 769582346, 186453072, 436344662, 842542610, 64026800, 53524784, 263749441, 299146392, 859167627, 935835473, 785705548, 616397911, 606920755, 790680780, 634846197, 434587374, 186487729, 499104654, 344330262, 715699561, 628078626, 605771597, 70487383, 343223891, 752937849, 414188067, 769799762, 371825239, 26923284, 818781627, 753855864, 117207524, 777841219, 608522344, 816502171, 582680182, 897108924, 188534252, 438303291, 820885423, 997723443, 529276926, 868914102, 40097003, 907739860, 472268254, 223037992, 823452096, 718169879, 818390870, 376429882, 362812972, 92777704, 198068356, 782299298, 710773810, 442428234, 147032138, 506762167, 75284454, 828127288, 460728417, 465771610, 129280457, 56518298, 526169490, 22870610, 773784392, 338004662, 364339685, 887653491, 794428738, 766509836, 844507281, 200575233, 649289655, 363310915, 227906214, 93451726, 705458004, 474628201, 630159548, 40287296, 991660114, 586390492, 835385204, 606806472, 791964565, 291340569, 954203886, 367205272, 173093021, 646417616, 567714666, 586450479, 973384943, 120357827, 680985174, 584654760, 551749292, 938508141, 675599597, 431026254, 651606249, 87317591, 975058789, 858268476, 336829061, 346661179, 277280102, 440695193, 681141685, 813901363, 947983277, 650584680, 560353134, 220529568, 900969931, 958148974, 858561835, 505039535, 39342836, 36970983, 319680707, 722380935, 719445202, 505095219, 941973263, 919945575, 700533449, 825368358]\r\nans=0\r\nMD.Build_Fact(N)\r\nfor i in range(N):\r\n ans+=MD.Comb(N,i)*bell[i]\r\n ans%=mod\r\nprint(ans)\r\n" ]

[ "from bisect import bisect_left\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor k in set(a):\r\n r = sum(n - bisect_left(a, j) for j in range(k, a[-1] + 1, k))\r\n ans = max(ans, k * r)\r\nprint(ans)", "import sys\r\nfrom itertools import accumulate\r\n\r\ndef main():\r\n n = int(sys.stdin.readline().strip())\r\n a = list(map(int, sys.stdin.readline().split()))\r\n max_val = max(a)\r\n C = [0] * (max_val + 1)\r\n for x in a:\r\n C[x] += 1\r\n ans=0\r\n C_sum = list(accumulate(C))\r\n for x in set(a):\r\n cnt = 0\r\n for i in range(x, max_val + 1, x):\r\n l = C_sum[i - 1] if i - 1 >= 0 else 0\r\n r = C_sum[min(i + x - 1, max_val)]\r\n cnt += i * (r - l)\r\n ans = max(ans, cnt)\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()# 1690380579.9107695" ]

[ "s=input().rstrip()\r\nif '.' in s:\r\n neg=0\r\n if '-' in s:\r\n neg=1\r\n s=[s[i] for i in range(1,len(s))]\r\n s=''.join(s)\r\n b=s.split('.')\r\n \r\n if len(b[1])==1:\r\n postfix=b[1]+'0'\r\n else:\r\n postfix=b[1][0:2]\r\n prefix=''\r\n y=0\r\n\r\n for i in range(len(b[0])-1,-1,-1):\r\n if y==2:\r\n prefix=','+b[0][i]+prefix\r\n y=0\r\n else:\r\n y+=1\r\n prefix=b[0][i]+prefix\r\n \r\n prefix=[i for i in prefix]\r\n if prefix[0]==',':\r\n prefix.pop(0)\r\n prefix=''.join(prefix)\r\n ans='$'+prefix+'.'+postfix\r\n if neg==1:\r\n ans='('+ans+')'\r\n print(ans)\r\n \r\nelse:\r\n neg=0\r\n if '-' in s:\r\n neg=1\r\n s=[s[i] for i in range(1,len(s))]\r\n s=''.join(s)\r\n b=s.split('.')\r\n prefix=''\r\n y=0\r\n for i in range(len(b[0])-1,-1,-1):\r\n if y==2:\r\n prefix=','+b[0][i]+prefix\r\n y=0\r\n else:\r\n y+=1\r\n prefix=b[0][i]+prefix\r\n prefix=[i for i in prefix]\r\n if prefix[0]==',':\r\n prefix.pop(0)\r\n prefix=''.join(prefix)\r\n ans='$'+prefix+'.'+'00'\r\n if neg==1:\r\n ans='('+ans+')'\r\n print(ans)\r\n \r\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n\r\ndef solve(x):\r\n if \".\" not in x:\r\n x+=\".00\"\r\n a,b=x.split(\".\")\r\n if len(b)<2:\r\n b+=\"0\"*(2-len(b))\r\n b=b[:2]\r\n a=a[::-1]\r\n s=\"\"\r\n for i in range(len(a)):\r\n s+=a[i]\r\n if i%3==2 and i!=len(a)-1:\r\n s+=\",\"\r\n s=s[::-1]\r\n return \"$\"+s+\".\"+b\r\ns=input()\r\nans=\"\"\r\nif s[0]==\"-\":\r\n ans=\"(\"+solve(s[1:])+\")\"\r\nelse:\r\n ans=solve(s)\r\nprint(ans)", "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\ns = [char for char in input()]\r\n\r\nans = []\r\n\r\nif '.' not in s:\r\n\ts.reverse()\r\n\ti = 0\r\n\tl = len(s)\r\n\t\r\n\tif '-' in s:\r\n\t\tl-=1\r\n\r\n\twhile(i<l):\r\n\t\tj = 0\r\n\t\twhile(j<3 and i<l):\r\n\t\t\tans.append(s[i])\r\n\t\t\ti+=1\r\n\t\t\tj+=1\r\n\t\tif (i<l):\r\n\t\t\tans.append(',')\r\n\t\r\n\tif '-' not in s:\r\n\t\tprint('$' + \"\".join(list(reversed(ans))) + '.00')\r\n\telse:\r\n\t\tprint('($' + \"\".join(list(reversed(ans))) + '.00)')\r\n\r\nelse:\r\n\tfrac = s[s.index('.')+1:]\r\n\ts = s[:s.index('.')]\r\n\t\r\n\ts.reverse()\r\n\ti = 0\r\n\tl = len(s)\r\n\t\r\n\tif '-' in s:\r\n\t\tl-=1\r\n\r\n\twhile(i<l):\r\n\t\tj = 0\r\n\t\twhile(j<3 and i<l):\r\n\t\t\tans.append(s[i])\r\n\t\t\ti+=1\r\n\t\t\tj+=1\r\n\t\tif (i<l):\r\n\t\t\tans.append(',')\r\n\t\r\n\tres = \"\".join(list(reversed(ans))) + '.'\r\n\tf = len(frac)\r\n\r\n\tif f==1:\r\n\t\tres+=(frac[0] + '0')\r\n\telse:\r\n\t\tres+=(frac[0] + frac[1])\t\r\n\t\r\n\tif '-' not in s:\r\n\t\tprint('$' + res)\r\n\telse:\r\n\t\tprint('($' + res + ')')", "\ndef solve() :\n integ = x\n ext=['','']\n if x[0]=='-':\n integ=integ[1:]\n ext=['(',')']\n if '.' in integ :\n ind=integ.find('.')\n dec= integ[ind+1:ind+3]\n if len(dec)==1:\n dec=dec+'0'\n integ=integ[:ind]\n else:\n dec='00'\n newin=''\n c=1\n for i in range(len(integ)-1,-1,-1):\n newin=integ[i] + newin\n if c%3==0 :\n newin=','+newin\n c+=1\n if newin[0]==',':\n newin=newin[1:]\n\n return ext[0]+'$'+newin+'.'+dec+ext[-1]\n\n\n\n\n\n\nfrom sys import stdin\ninput = stdin.readline\n\n\n\n\nx=input().strip()\nprint(solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "import math\r\nimport sys\r\nimport collections\r\n\r\n\r\n# imgur.com/Pkt7iIf.png\r\n\r\ndef getdict(n):\r\n d = {}\r\n if type(n) is list:\r\n for i in n:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n else:\r\n for i in range(n):\r\n t = ii()\r\n if t in d:\r\n d[t] += 1\r\n else:\r\n d[t] = 1\r\n return d\r\ndef cdiv(n, k): return n // k + (n % k != 0)\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef lcm(a, b): return abs(a * b) // math.gcd(a, b)\r\n\r\ns = input()\r\nt = s.split('.') if '.' in s else [s, '']\r\na, b = t[0], t[1]\r\nb += '00'\r\nneg = False\r\nif a[0] == '-':\r\n neg = True\r\n a = a[1:]\r\nr = []\r\nfor i in range(len(a), 0, -3):\r\n r.append(a[max(0, i-3):i])\r\nr.reverse()\r\nres = ','.join(r) + '.' + b[0:2]\r\nprint(f'(${res})') if neg else print(f'${res}')", "n = input()\r\n\r\ntry: op_index = n.index('.')\r\nexcept: pass\r\n\r\n\r\ntry: n = n[:op_index+3]\r\nexcept: pass\r\n\r\ntry: part1 =int(n[:op_index])\r\nexcept: part1 = int(n)\r\n\r\nif part1<0: part1 *= -1\r\n\r\ntry: part2 = n[op_index:]\r\nexcept: part2 = '.00'\r\n\r\npart2 = part2+'0'*(3-len(part2))\r\n\r\nif n[0]=='-':\r\n print('(', end = '')\r\n\r\nprint('${:,}'.format(part1), end = '')\r\nprint(part2, end = '')\r\n\r\nif n[0]=='-':\r\n print(')', end = '')", "n = input()\r\nif \".\" not in n:\r\n n = n+\".00\"\r\ndeci, frac = n.split(\".\")\r\ncount = 1\r\nupdated = \"\"\r\nfor c in deci[-1::-1]:\r\n if c==\"-\":\r\n break\r\n if count == 4:\r\n count = 1\r\n updated += \",\"\r\n updated += c\r\n count += 1\r\nnew_deci = updated[-1::-1]\r\nfrac += \"00\"\r\nfrac = frac[:2]\r\nif deci[0]==\"-\":\r\n print(f\"(${new_deci+'.'+frac})\")\r\nelse:\r\n print(f\"${new_deci+'.'+frac}\")\r\n", "s = input()\r\nf = 0\r\nif s[0] == '-':\r\n f = 1\r\n s = s[1:]\r\n\r\nif '.' not in s:\r\n s += '.'\r\n\r\ns += \"000\"\r\nk = s.find('.')\r\nt = \"\"\r\nl = 0\r\n\r\nfor i in range(k - 1, -1, -1):\r\n l += 1\r\n t = s[i] + t\r\n if l == 3 and i > 0:\r\n t = ',' + t\r\n l = 0\r\n\r\nfor i in range(k, k + 3):\r\n t += s[i]\r\n\r\nt = '$' + t\r\n\r\nif f:\r\n t = '(' + t + ')'\r\n\r\nprint(t)", "def readln(): return tuple(map(int, input().split()))\n\nd = input().split('.')\nif len(d) == 1:\n d.append('00')\nelif len(d[1]) == 0:\n d[1] = '00'\nelif len(d[1]) == 1:\n d[1] += '0'\nelse:\n d[1] = d[1][:2]\nout = '$%s.%s'\nif d[0].startswith('-'):\n out = '($%s.%s)'\n d[0] = d[0][1:]\nif len(d[0]) % 3:\n t = [d[0][:len(d[0]) % 3]]\nelse:\n t = []\nfor i in range(len(d[0]) % 3, len(d[0]), 3):\n t.append(d[0][i:i + 3])\nd[0] = ','.join(t)\nprint(out % tuple(d))\n", "\r\ns=input().strip()\r\na=[]\r\nif s[0]=='-':\r\n p='($'\r\n s=s[1:]\r\nelse:\r\n p='$'\r\nj=0\r\nt='.'\r\nn=len(s)\r\nwhile j<(n):\r\n if s[j]=='.':\r\n t=t+s[j+1]\r\n if j+2<n:\r\n t=t+s[j+2]\r\n else:\r\n t=t+'0'\r\n break\r\n else:\r\n j=j+1\r\nif t=='.':\r\n t='.00'\r\nu=0\r\nfor k in range(j-1,-1,-1):\r\n u=u+1\r\n if u==3:\r\n a.append(s[k])\r\n if k-1>=0:\r\n a.append(',')\r\n u=0\r\n else:\r\n a.append(s[k])\r\na=p+''.join(a[::-1])+t\r\nif a[0]=='(':\r\n a=a+')'\r\nprint(a)\r\n ", "a,b=input(),\"00\"\r\nif \".\" in a:\r\n a,b=a.split(\".\")\r\n if len(b)>=2:\r\n b=b[:2]\r\n else:\r\n b+=\"0\"\r\nflag=False\r\nif a[0]==\"-\": a,flag=a[1:],True\r\ni,z=1,\"\"\r\nfor c in a[::-1]:\r\n z+=c\r\n if i % 3==0 and i!=len(a):\r\n z+=\",\"\r\n i+=1\r\nz=\"$\"+z[::-1]+\".\"+b\r\nif flag:\r\n z=\"(\"+z+\")\"\r\nprint(z)\r\n \r\n \r\n", "import re\nimport itertools\nfrom collections import Counter\n\nclass Task:\n number = \"\"\n answer = \"\" \n\t\n def getData(self):\n self.number = input()\n #self.x, self.y = [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 matcher = re.match('[^\\d]*(\\d*)[^\\d]*(\\d*)', self.number)\n integerPart = matcher.group(1)\n fractionPart = matcher.group(2)\n \n newIntegerPart = '$' + re.sub(r'(\\d{3})(?=\\d)', r'\\1,', \\\n integerPart[::-1])[::-1]\n newFractionPart = fractionPart[0:2] if len(fractionPart) >= 2 \\\n else fractionPart + '0' * (2 - len(fractionPart))\n self.answer = newIntegerPart + '.' + newFractionPart\n if self.number[0] == '-':\n self.answer = '(' + self.answer + ')'\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", "s=input()\r\nit=[]\r\ndm=[]\r\nif \".\" in s:\r\n n=s.index(\".\")\r\n for i in range(len(s)):\r\n if i<n and s[i]!=\"-\":\r\n it.append(s[i])\r\n if i>n:\r\n dm.append(s[i])\r\nelse:\r\n for i in s:\r\n if i!=\"-\":\r\n it.append(i)\r\nit2=[]\r\nif len(it)>3:\r\n count=0\r\n for i in range(1,len(it)+1):\r\n if count%3==0 and count!=0:\r\n it2.append(\",\")\r\n it2.append(it[-i])\r\n count=count+1\r\n else:\r\n it2.append(it[-i])\r\n count = count + 1\r\n it2=it2[::-1]\r\nif len(dm)>=2:\r\n dm=dm[0:2]\r\nelse:\r\n if len(dm)==1:\r\n dm.append(\"0\")\r\n if len(dm)==0:\r\n dm.append(\"0\")\r\n dm.append(\"0\")\r\nif len(it2)>0:\r\n integer=\"\".join(it2)\r\nelse:\r\n integer=\"\".join(it)\r\ndecimal=\"\".join(dm)\r\nans=(\"$\"+integer+\".\"+decimal)\r\nif s[0]==\"-\":\r\n print(\"(\"+ans+\")\")\r\nelse:\r\n print(ans)\r\n", "s=input()\r\nl=[]\r\na='0'\r\nb='0'\r\nx=0\r\nif s[0]=='-':\r\n x=1\r\nfor i in range(x,len(s)):\r\n if s[i]=='.':\r\n if i+1<len(s):\r\n a=s[i+1]\r\n if i+2<len(s):\r\n b=s[i+2]\r\n break\r\n l.append(s[i])\r\n \r\nans=''\r\nfor i in range(1,len(l)+1):\r\n if i%3==0 and i<len(l):\r\n ans=str(l[-i])+ans\r\n ans=','+ans\r\n else:\r\n ans=str(l[-i])+ans\r\n \r\nans+='.'+a+b\r\nans='$'+ans\r\nif s[0]=='-':\r\n ans='('+ans+')'\r\nprint(ans)\r\n ", "s = input()\nstart = 1 if s[0] == \"-\" else 0\nanswer = \"\"\n\nfloat_start = 0\ntry:\n float_start = s.index(\".\")\nexcept:\n float_start = len(s)\n\nif float_start == len(s):\n answer += \"00.\"\nelse:\n answer += s[float_start+1:float_start+3][::-1] + \".\"\n\nif float_start + 2 >= len(s):\n answer = \"0\" + answer[0] + \".\"\n\ncurrent = 0\nfor i in range(float_start - 1, start-1, -1):\n current += 1\n answer += s[i]\n if current == 3 and i != start:\n answer += \",\"\n current = 0\nanswer += \"$\"\n\nif start == 1:\n print(f\"({answer[::-1]})\")\nelse:\n print(answer[::-1])", "n=input()\r\nstr2=''\r\nstr1=''\r\nind=0\r\nflag=0\r\nif '.' in n:\r\n flag=1\r\n ind=n.index('.')\r\n if len(n[ind+1:len(n)])==1:\r\n str2=str2+'.'+n[ind+1]+'0'\r\n elif len(n[ind+1:len(n)])>2:\r\n str2=str2+'.'+n[ind+1:ind+3]\r\n else:\r\n str2=str2+'.'+n[ind+1:len(n)]\r\nif flag==1:\r\n i=ind-1\r\nelse:\r\n i=len(n)-1\r\n str2='.00'\r\ncount=3\r\nflag=0\r\nif n[0]=='-':\r\n flag=1\r\nwhile i>=0 and n[i]!='-':\r\n if count==0:\r\n str1=','+str1\r\n count=3\r\n str1=n[i]+str1\r\n i=i-1\r\n count=count-1\r\nif flag==1:\r\n print('($'+str1+str2+')')\r\nelse:\r\n print('$'+str1+str2)\r\n\r\n ", "def main():\r\n s = input()\r\n neg = False\r\n if s[0] == '-':\r\n neg = True\r\n s = s[1:]\r\n pointPos = s.find('.')\r\n if pointPos == -1:\r\n pointPos = len(s)\r\n intPart = s[:pointPos]\r\n fraPart = s[pointPos + 1:pointPos + 3]\r\n for i in range(2 - len(fraPart)):\r\n fraPart += '0'\r\n a = []\r\n i = 0\r\n rev = intPart[::-1]\r\n while i < len(rev):\r\n a.append(rev[i:i + 3])\r\n i += 3\r\n ans = '$' + ','.join(a)[::-1] + '.' + fraPart\r\n if neg:\r\n ans = '(' + ans + ')'\r\n print(ans)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n#2019-02-22 13:06:01.034", "def main():\n s = input()\n if s.find('.') != -1:\n d, f = s.split('.')\n else:\n d = s\n f = []\n\n neg = d[0] == '-'\n if neg:\n d = d[1:]\n output = \"\"\n for i, e in enumerate(d[::-1]):\n if i != 0 and i % 3 == 0:\n output += ','\n output += e\n output = output[::-1]\n output += '.'\n if len(f) >= 2:\n output += f[0]\n output += f[1]\n elif len(f) == 1:\n output += f[0]\n output += '0'\n else:\n output += '00'\n if neg:\n print(f'(${output})')\n else:\n print(f'${output}')\n\nif __name__ == \"__main__\":\n main()\n", "x = input()\r\ni = 0\r\n\r\n# Determine if positive/negative\r\nif x[i] == '-':\r\n negative = True\r\n i += 1\r\nelse:\r\n negative = False\r\n \r\n# Get dollars\r\nif x.find('.') != -1:\r\n dollars = x[i:x.find('.')]\r\n i = x.find('.')+1\r\nelse:\r\n dollars = x[i:]\r\n i = len(x)+1\r\ndollars = int(dollars)\r\n\r\n# Get cents\r\nif i < len(x):\r\n cents = x[i:i+2]\r\nelse:\r\n cents = '00'\r\nif len(cents) == 1:\r\n cents += '0'\r\n\r\n# Put it all together\r\nif negative:\r\n print('(${0:,}.{1:s})'.format(dollars, cents))\r\nelse:\r\n print('${0:,}.{1:s}'.format(dollars, cents))", "s = input().split('.')\r\nt = ''\r\nif(s[0][0] == '-'):\r\n\tt += '($'\r\nelse:\r\n\tt += '$'\r\nif(len(s[0]) > 3):\r\n\tx = s[0][::-1]\r\n\tif(x[-1] == '-'):\r\n\t\tx = x[:-1]\r\n\tp = ''\r\n\ti = -1\r\n\tfor i in range(2,len(x),3):\r\n\t\tp += x[i-2:min(i+1,len(x))] + ','\r\n\tp += x[i+1:]\r\n\tif(p[-1] == ','):\r\n\t\tp = p[:-1]\r\n\tp = p[::-1]\r\n\t\r\n\tt += p\r\nelse:\r\n\tif(s[0][0] == '-'):\r\n\t\tt += s[0][1:]\r\n\telse:\r\n\t\tt += s[0]\r\n\t\r\nif(len(s) == 1):\r\n\tt += '.00'\r\nelse:\r\n\tif(len(s[1]) == 1):\r\n\t\tt += '.' + s[1] + '0'\r\n\telse:\r\n\t\tt += '.'+s[1][:2]\r\n\r\nif(t[0] == '('):\r\n\tt += ')'\r\n\r\nprint(t)\r\n\r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n s = input().strip()\r\n no = s.split(\".\")\r\n ans = \"\"\r\n neg = False\r\n if no[0][0] == \"-\":\r\n neg = True\r\n no[0] = no[0][1:]\r\n i, ct = len(no[0]) - 1, 0\r\n while i >= 0:\r\n if ct == 3:\r\n ans += \",\"\r\n ct = 0\r\n ct += 1\r\n ans += no[0][i]\r\n i -= 1\r\n # print(no, ans)\r\n if len(no) == 2:\r\n frac = no[1]\r\n if len(frac) >= 2:\r\n ans = frac[:2][::-1] + \".\" + ans\r\n elif len(frac) == 1:\r\n ans = \"0\" + frac + \".\" + ans\r\n else:\r\n ans = \"00\" + \".\" + ans\r\n\r\n if neg:\r\n print(\"($\" + ans[::-1] + \")\")\r\n else:\r\n print(\"$\" + ans[::-1])", "def parse_int(num:int):\r\n to_str=str(num)\r\n count=0\r\n sumstr=''\r\n for one_str in to_str[::-1]:\r\n count += 1\r\n if count %3==0 and count != len(to_str):\r\n one_str = ',' + one_str\r\n sumstr = one_str + sumstr\r\n else:\r\n sumstr = one_str + sumstr\r\n return sumstr\r\n\r\nn = input()\r\nn1 = n.split(\".\")[0]\r\nn2 = \"\"\r\nn1 = parse_int(abs(int(n1))) \r\nif n.count('.')>0:\r\n n2 = n.split('.')[1][:2]\r\n if len(n2)<2:\r\n n2=n2+\"0\"\r\n n2 = \".\"+n2\r\nelse:\r\n n2 = \".00\"\r\nif n[0] == '-':\r\n print(\"($\"+n1+n2+\")\", end=\"\")\r\nelse:\r\n print(\"$\"+n1+n2, end=\"\")", "import math\r\nfrom collections import Counter\r\nL=lambda:list(map(int,input().split()))\r\nM=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nIN=lambda:input()\r\nmod=10**9+7\r\ndef s(a):\r\n print(\" \".join(list(map(str,a))))\r\n#______________________-------------------------------_____________________#\r\nn=IN()\r\nf=1\r\nif n[0]==\"-\":\r\n f=0\r\n n=n[1:]\r\nx=n.split('.')\r\nif len(x)==2:\r\n if len(x[1])==1:\r\n s2=x[1]+\"0\"\r\n else:\r\n s2=x[1][:2]\r\nelse:\r\n s2=\"00\"\r\nl=len(x[0])\r\nb=l%3\r\ns=x[0][:b]\r\nfor i in range(b,l,3):\r\n if len(s)>0:\r\n s+=','\r\n s+=x[0][i:i+3]\r\nif f==1:\r\n print('$'+s+'.'+s2)\r\nelse:\r\n print('($'+s+'.'+s2+')')\r\n \r\n \r\n \r\n", "import sys\r\nfrom os import path\r\nif(path.exists('Input.txt')):\r\n sys.stdin = open(\"Input.txt\",\"r\")\r\n sys.stdout = open(\"Output.txt\",\"w\")\r\nimport math\r\nimport heapq\r\nfrom collections import *\r\nfrom queue import PriorityQueue as prq\r\nfrom collections import deque as deq\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter as cnt\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom math import gcd, floor, sqrt, log, ceil, inf\r\nfrom itertools import permutations, combinations\r\nfrom heapq import heapify, heappush, heappop, nlargest, nsmallest, heappushpop, heapreplace\r\n# l = sorted(l, key = lambda x: x[0], reverse = True)\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 st(): return str(input())\r\ndef strip(): return list(sys.stdin.readline().strip())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\ndef prlist(a): print(\"\".join(a))\r\nmod = 1000000007\r\nmaximum, minimum = float('inf'), float('-inf')\r\nbi=lambda n: bin(n).replace(\"0b\", \"\") \r\nyes=lambda : print(\"YES\") ; no=lambda : print(\"NO\")\r\n\r\nimport operator as op\r\nfrom functools import reduce\r\n\r\ndef ncr(n,r):\r\n r=min(r,n-r)\r\n numer=reduce(op.mul,range(n,n-r,-1),1)\r\n denom=reduce(op.mul,range(1,r+1),1)\r\n return numer//denom\r\n\r\ndef ncrmod(n,r,mod):\r\n p,q=1,1\r\n if n-r<r:\r\n r=n-r\r\n if r!=0:\r\n while r:\r\n p*=n\r\n k*=r\r\n m=gcd(p, k)\r\n p//=m\r\n k//=m\r\n n-=1\r\n r-=1\r\n p%=mod\r\n else:\r\n p=1\r\n return p\r\n \r\ndef fact(n):\r\n\treturn math.factorial(n)\r\n\t\r\ndef perfect(n):\r\n\treturn floor(sqrt(n))==ceil(sqrt(n))\r\n\t\r\ndef lcm(a,b):\r\n return a*b//gcd(a, b)\r\n\r\ndef dectobin(n):\r\n return bin(n).replace(\"0b\", \"\")\r\n\r\ndef bintodec(n):\r\n return int(n,2)\r\n\t# can be used for converting number of any base to 10\r\n \r\ndef binarysearch(array,target,start,end):\r\n while start<=end:\r\n mid=(start+end)//2\r\n if array[mid]==target:\r\n return mid\r\n elif array[mid]>target:\r\n end=mid-1\r\n else:\r\n start=mid+1\r\n return -1\r\n \r\ndef isprime(n):\r\n\tif (not n%2 and n!=2) or n<2:\r\n\t return False\r\n\ti=3\r\n\twhile i*i<=n:\r\n\t if n%i==0:\r\n\t return False\r\n\t i+=2\r\n\treturn True\r\n\t\r\ndef expo(a, n, M):\r\n ans=1\r\n while n>0:\r\n last_bit=n&1\r\n if(last_bit):\r\n ans=(ans*a)%M\r\n a=(a*a)%M\r\n n=n>>1\r\n return ans\r\n\r\ndef sequence(a):\r\n n=len(a)\r\n g,k,x=[a[0]],[1],0\r\n for i in range(1,n):\r\n if a[i]==a[i-1]:\r\n k[x]+=1\r\n else:\r\n g.append(a[i])\r\n k.append(1)\r\n x+=1\r\n return g,k\r\n\r\ndef checkgcd(a):\r\n if len(a)==1:\r\n return a[0]\r\n n=len(a)\r\n k=gcd(a[0],a[1])\r\n for i in range(2,n):\r\n k=gcd(k,a[i])\r\n return k\r\n \r\ndef prefix(a):\r\n p,s=[a[0]],a[0]\r\n for i in range(1,len(a)):\r\n s+=a[i]\r\n p.append(s)\r\n return p\r\n \r\ndef combo(n, n_list):\r\n if n<=0:\r\n yield []\r\n return\r\n for i in range(len(n_list)):\r\n c_num = n_list[i:i+1]\r\n for a_num in combo(n-1, n_list[i+1:]):\r\n yield c_num + a_num\r\n \r\n # res=combo(number of elements, list)\r\n # for i in res: u.append(i)\r\n # u contains all combinations in 2D list\r\n \r\ndef primefactors(n):\r\n ans=[]\r\n while not n%2:\r\n ans.append(2)\r\n n//=2\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n while not n%i:\r\n ans.append(i)\r\n n//=i\r\n if n>2:\r\n ans.append(n)\r\n return ans\r\n\r\ndef check(d):\r\n s=str(d)\r\n r=s[::-1]\r\n x,n=0,len(s)\r\n ans=\"\"\r\n for i in range(n):\r\n x+=1\r\n ans+=r[i]\r\n if x%3==0:\r\n ans+=\",\"\r\n if ans[-1]==\",\":\r\n d=ans[::-1]\r\n return d[1:]\r\n else:\r\n return ans[::-1]\r\n \r\ndef solve():\r\n s=input()\r\n if \".\" not in s:\r\n post=\".00\"\r\n if s[0]==\"-\":\r\n flag=1\r\n dot=s[1:]\r\n else:\r\n flag=0\r\n dot=s[:]\r\n d=int(dot)\r\n pre=\"$\"+check(d)\r\n if flag:\r\n ans=\"(\"+pre+post+\")\"\r\n else:\r\n ans=pre+post\r\n print(ans)\r\n else:\r\n r=s.index(\".\")\r\n post=s[r:r+3]\r\n if len(post)!=3:\r\n for i in range(3-len(post)):\r\n post+=\"0\"\r\n if s[0]==\"-\":\r\n flag=1\r\n dot=s[1:r]\r\n else:\r\n flag=0\r\n dot=s[:r]\r\n d=int(dot)\r\n pre=\"$\"+check(d)\r\n if flag:\r\n ans=\"(\"+pre+post+\")\"\r\n else:\r\n ans=pre+post\r\n print(ans)\r\n\r\nfor pratyush in range(1):\r\n\tsolve()", "a=input()\r\n\r\nflag = 0\r\nb='00'\r\n\r\nif '-'in a:\r\n flag=1\r\n a=a[1:]\r\n\r\nif '.'in a:\r\n a,b=a.split('.')\r\n if len(b)>2:b=b[:2]\r\n if len(b)<2:b+='0'\r\n\r\na=a[::-1]\r\nr=''\r\nfor i in range(0,len(a),3):\r\n r+=','+a[i:i+3]\r\n\r\nr='$'+r[1:][::-1]+'.'+b\r\n\r\nif flag:\r\n r='('+r+')'\r\nprint(r)\r\n", "\nif __name__ == '__main__':\n num = input()\n\n neg = False\n if num[0] == '-':\n neg = True\n num = num[1:]\n\n if '.' in num:\n integer_part, mantise = str(num).split('.')\n else:\n integer_part = num\n mantise = ''\n mantise = mantise[:2]\n\n mantise = mantise + '0' * (2 - len(mantise))\n\n integer_part = list(reversed(integer_part))\n integer_part = [integer_part[i:i+3] for i in range(0, len(integer_part), 3)]\n integer_part = list(reversed([''.join(x[::-1]) for x in integer_part]))\n\n num = '$' + ','.join(integer_part) + '.' + mantise\n\n if neg:\n num = '(' + num + ')'\n\n print(num)\n", "string = input()\r\nif \".\" in string:\r\n if \"-\" in string:\r\n at1 = string.index(\".\")\r\n p1 = string[1:at1]\r\n p2 = string[at1+1:]\r\n num = \"\"\r\n k1 = len(p1) - 1 \r\n chance = 0\r\n while k1 >= 0:\r\n if chance == 3:\r\n num = p1[k1] + \",\" + num \r\n chance = 1\r\n else:\r\n num = p1[k1] + num\r\n chance += 1\r\n k1 -= 1 \r\n if len(p2) >= 2: \r\n print(\"($\"+num+\".\"+p2[0]+p2[1]+\")\")\r\n elif len(p2) == 1:\r\n print(\"($\"+num+\".\"+p2[0]+\"0)\")\r\n else:\r\n print(\"($\"+num+\".\"+\"00)\")\r\n \r\n \r\n else:\r\n at1 = string.index(\".\")\r\n p1 = string[:at1]\r\n p2 = string[at1+1:]\r\n num = \"\"\r\n k1 = len(p1) - 1 \r\n chance = 0\r\n while k1 >= 0:\r\n if chance == 3:\r\n num = p1[k1] + \",\" + num \r\n chance = 1\r\n else:\r\n num = p1[k1] + num\r\n chance += 1\r\n k1 -= 1 \r\n if len(p2) >= 2: \r\n print(\"$\"+num+\".\"+p2[0]+p2[1]+\"\")\r\n elif len(p2) == 1:\r\n print(\"$\"+num+\".\"+p2[0]+\"0\")\r\n else:\r\n print(\"$\"+num+\".\"+\"00\")\r\n \r\nelse:\r\n if \"-\" in string:\r\n p1 = string[1:]\r\n num = \"\"\r\n k1 = len(p1) - 1 \r\n chance = 0\r\n while k1 >= 0:\r\n if chance == 3:\r\n num = p1[k1] + \",\" + num \r\n chance = 1\r\n else:\r\n num = p1[k1] + num\r\n chance += 1\r\n k1 -= 1 \r\n print(\"($\"+num+\".\"+\"00)\") \r\n \r\n \r\n else:\r\n p1 = string\r\n num = \"\"\r\n k1 = len(p1) - 1 \r\n chance = 0\r\n while k1 >= 0:\r\n if chance == 3:\r\n num = p1[k1] + \",\" + num \r\n chance = 1\r\n else:\r\n num = p1[k1] + num\r\n chance += 1\r\n k1 -= 1 \r\n print(\"$\"+num+\".00\") \r\n ", "from decimal import Decimal\r\n\r\nmoney = input()\r\n\r\nif '.' in money:\r\n int_part, fract_part = money.split('.')\r\n money = '.'.join((int_part, fract_part[:2]))\r\n\r\nmoney, neg = money.replace('-', ''), '-' in money\r\ns = '${:,.2f}'.format(Decimal(money))\r\n\r\nprint('(' + s + ')' if neg else s)", "# / *\r\n#\r\n# / \\ | | / \\ | | | |\r\n# / __\\ | | / __\\ |--| | |\r\n# / \\ |__ | __ / \\ | | \\__ /\r\n#\r\n# __ __\r\n# / \\ | / | ) / \\ | )\r\n# / __\\ |< |-< / __\\ |-<\r\n# / \\ | \\ |__) / \\ | \\\r\n#\r\n# * /\r\nfrom itertools import combinations\r\n\r\ndef main():\r\n\r\n s = input()\r\n if '.' not in s:\r\n s += '.00'\r\n\r\n num, frac = s.split('.')\r\n for i in range(2 - len(frac)):\r\n frac += \"0\"\r\n if num[0] == '-':\r\n num = num[:0:-1]\r\n num = ','.join([num[i:i+3] for i in range(0, len(num), 3)])\r\n num = num[::-1]\r\n print(\"($\"+num+\".\"+frac[:2]+\")\")\r\n else:\r\n\r\n num = num[::-1]\r\n num = ','.join([num[i:i+3] for i in range(0, len(num), 3)])\r\n num = num[::-1]\r\n print(\"$\"+num+\".\"+frac[:2])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "t = input()\r\nx, y, d = '', '', '.00'\r\nif t[0] == '-': x, y = '(', ')'\r\nk = t.find('.')\r\nif k > 0: d = (t[k: ] + '00')[: 3]\r\nelse: k = len(t)\r\nj = len(x)\r\nu = t[j: j + (k - j) % 3]\r\nj += len(u)\r\nif u and k > j: u += ','\r\n\r\nprint(x + '$' + u + ','.join(t[i: i + 3] for i in range(j, k, 3)) + d + y)", "def format_string(str):\n\tstr = str[::-1]\n\tnewstr = \"\"\n\ti = 0;\n\tfor l in str:\n\t\tif i%3==0 and i != 0:\n\t\t\tnewstr+=','\n\t\tnewstr+=l\n\t\ti= i+1\n\treturn newstr[::-1]\n\n\nstr = input()\nneg = True if str[0]=='-' else False\n\nif neg:\n\tstr = str[1:]\nidx = str.find('.')\n# print(str)\n\nfr = \"\"\nif idx == -1:\n\tfr = format_string(str);\nelse:\n\tfr = format_string(str[:idx])\naf = '.00' if (idx == -1) else '.'+str[idx+1:idx+3]\nif len(af) < 3 :\n\taf +='0'*(3-len(af))\nprint(f'${fr}{af}' if not neg else f'(${fr}{af})')\n\n\n\n\n\n\n\n\n", "import sys\r\n\r\nn = sys.stdin.readline().strip()\r\n\r\ndef formatN(n):\r\n formated = '$'\r\n if '-' in n:\r\n addSc = True\r\n formated = '(' + formated\r\n n = n[1:]\r\n else:\r\n addSc = False\r\n n = n.split('.')\r\n leftPart = n[0]\r\n pos = len(leftPart)%3\r\n if pos==0:\r\n pos = 3\r\n #fullRanks = [leftPart[0:pos]]\r\n formated = formated+leftPart[0:pos]\r\n for i in range(pos,len(leftPart),3):\r\n formated = formated+',' + leftPart[i:i+3]\r\n #fullRanks.append(leftPart[i:i+3])\r\n formated = formated+'.'\r\n if len(n)>1:\r\n rightPart = n[1]\r\n formated = formated+rightPart[0:2]\r\n if len(rightPart)<2:\r\n formated = formated + '0'*(2-len(rightPart))\r\n else:\r\n formated = formated+'00'\r\n\r\n if addSc:\r\n formated = formated + ')' \r\n return formated\r\n\r\nprint(formatN(n))\r\n \r\n \r\n \r\n", "a = input()\r\ncheck = False\r\nif a[0] == \"-\":\r\n check = True\r\n a = a[1:]\r\nb = a.split(\".\")\r\nif len(b[0]) > 3:\r\n v = b[0][::-1]\r\n new = [v[i:i+3][::-1] for i in range(0, len(v), 3)]\r\n new.reverse()\r\n b[0] = \",\".join(new)\r\n\r\ntry:\r\n b[1] = b[1][:2].ljust(2, \"0\")\r\nexcept IndexError:\r\n b.append(\"00\")\r\nres = \"$\" + \".\".join(b)\r\nif check:\r\n res = f\"({res})\"\r\nprint(res)\r\n", "s=input()\r\nco=True\r\nif(s[0]==\"-\"):\r\n co=False\r\n s=s[1:]\r\n \r\nn=len(s)\r\nans=\"\"\r\nk=0\r\nwhile(k<n and s[k]!=\".\"):\r\n k+=1\r\nif(k==n):\r\n i=n-1\r\n count=0\r\n while(i>=0):\r\n if(count==3):\r\n ans=\",\"+ans\r\n count=0\r\n ans=s[i]+ans\r\n count+=1\r\n i-=1\r\n if co:\r\n print(\"$\"+ans+\".00\")\r\n else:\r\n print(\"($\"+ans+\".00)\")\r\nelse:\r\n pre=s[:k]\r\n post=s[k+1:]+\"00\"\r\n i=k-1\r\n count=0\r\n while(i>=0):\r\n if(count==3):\r\n ans=\",\"+ans\r\n count=0\r\n ans=pre[i]+ans\r\n count+=1\r\n i-=1\r\n if(co):\r\n print(\"$\"+ans+\".\"+post[:2])\r\n else:\r\n print(\"($\"+ans+\".\"+post[:2]+\")\")", "from re import T\r\n\r\n\r\ns = input()\r\n\r\nans = \"\"\r\nif s[0] == '-':\r\n s = s[1:]\r\n if s.count('.') == 1:\r\n temp = s.split('.')\r\n p1 = temp[0]\r\n p2 = temp[1][:2]\r\n p2 = p2 if len(p2) == 2 else p2 + '0'\r\n t=\"\"\r\n p1 = p1[::-1]\r\n for i in range(0,len(p1), 3):\r\n t += p1[i:i+3]\r\n t += ','\r\n \r\n t = t[:-1]\r\n t = t[::-1]\r\n ans += '(' + '$' + t + '.' + p2 + ')'\r\n else: \r\n t=\"\"\r\n s = s[::-1]\r\n for i in range(0,len(s), 3):\r\n t += s[i:i+3]\r\n t += ','\r\n \r\n t = t[:-1]\r\n t = t[::-1]\r\n ans += '(' + '$' + t + '.00' + ')'\r\nelse:\r\n if s.count('.') == 1:\r\n temp = s.split('.')\r\n p1 = temp[0]\r\n p2 = temp[1][:2]\r\n p2 = p2 if len(p2) == 2 else p2 + '0'\r\n t=\"\"\r\n p1 = p1[::-1]\r\n for i in range(0,len(p1), 3):\r\n t += p1[i:i+3]\r\n t += ','\r\n \r\n t = t[:-1]\r\n t = t[::-1]\r\n ans += '$' + t + '.' + p2 \r\n else:\r\n t=\"\"\r\n s = s[::-1]\r\n for i in range(0,len(s), 3):\r\n t += s[i:i+3]\r\n t += ','\r\n \r\n t = t[:-1]\r\n t = t[::-1]\r\n ans += '$' + t + '.00' \r\n\r\nprint(ans)", "string = input()\r\nanswer = string\r\nfraction=string.find('.')\r\n\r\nif fraction!=-1:\r\n answer= string[:fraction]\r\n fraction= string[fraction+1:]\r\n\r\n\r\nif string[0]=='-':\r\n print('($', end=\"\")\r\n answer = answer[1:]\r\nelse:\r\n print('$', end=\"\")\r\n\r\n\r\nfor i in range(0, answer.__len__()%3):\r\n print(answer[i], end=\"\")\r\n if answer.__len__()>3 and i==(answer.__len__()%3) -1:\r\n print(',', end=\"\")\r\n\r\nfor i in range(answer.__len__()%3, answer.__len__()-2, 3):\r\n print(answer[i]+answer[i+1]+answer[i+2], end=\"\")\r\n if i+3< answer.__len__()-2:\r\n print(',', end=\"\")\r\n\r\nprint('.', end=\"\")\r\nif fraction==-1:\r\n print(\"00\", end=\"\")\r\nelif fraction.__len__()==1:\r\n print(str(fraction)+\"0\", end=\"\")\r\nelse:\r\n print(str(fraction[0])+str(fraction[1]), end=\"\")\r\n\r\nif string[0]=='-':\r\n print(')', end=\"\")\r\n", "a=input()\r\nn=0\r\nb='00'\r\nif '-'in a:n=1;a=a[1:]\r\nif '.'in a:\r\n a,b=a.split('.')\r\n if len(b)>2:b=b[:2]\r\n if len(b)<2:b+='0'\r\na=a[::-1]\r\nr=''\r\nfor i in range(0,len(a),3):r+=','+a[i:i+3]\r\nr='$'+r[1:][::-1]+'.'+b\r\nif n:r='('+r+')'\r\nprint(r)", "n = input()\r\nif '-' in n:\r\n n = n[1:]\r\n if '.' in n:\r\n a, b = n.split('.')\r\n if len(b) >= 2:\r\n b = b[:2]\r\n else:\r\n b += '000'\r\n b = b[:2]\r\n if len(a) <= 3:\r\n print('($' + a + '.' + b + ')')\r\n #\r\n else:\r\n A = list(a)\r\n a = ''\r\n l = len(A)\r\n counter = 0\r\n for i in A:\r\n if (l - counter) % 3 == 0:\r\n a += ','\r\n a += i\r\n counter += 1\r\n if a[0] == ',':\r\n print('(' + '$' + a[1:] + '.' + b + ')')\r\n #\r\n else:\r\n print('(' + '$' + a + '.' + b + ')')\r\n #\r\n else:\r\n if len(n) <= 3:\r\n print('(' + '$' + n + '.00)')\r\n #\r\n else:\r\n A = list(n)\r\n a = ''\r\n l = len(A)\r\n counter = 0\r\n for i in A:\r\n if (l - counter) % 3 == 0:\r\n a += ','\r\n a += i\r\n counter += 1\r\n if a[0] == ',':\r\n print('(' + '$' + a[1:] + '.00' + ')')\r\n #\r\n else:\r\n print('(' + '$' + a + '.00' + ')')\r\n #\r\nelse:\r\n if '.' in n:\r\n a, b = n.split('.')\r\n if len(b) >= 2:\r\n b = b[:2]\r\n else:\r\n b += '000'\r\n b = b[:2]\r\n if len(a) <= 3:\r\n print('$' + a + '.' + b)\r\n #\r\n else:\r\n A = list(a)\r\n a = ''\r\n l = len(A)\r\n counter = 0\r\n for i in A:\r\n if (l - counter) % 3 == 0:\r\n a += ','\r\n a += i\r\n counter += 1\r\n if a[0] == ',':\r\n print('$' + a[1:] + '.' + b)\r\n #\r\n else:\r\n print('$' + a + '.' + b)\r\n #\r\n else:\r\n if len(n) <= 3:\r\n print('$' + n + '.00')\r\n #\r\n else:\r\n A = list(n)\r\n a = ''\r\n l = len(A)\r\n # print(l)\r\n counter = 0\r\n for i in A:\r\n # print(l - counter)\r\n if (l - counter) % 3 == 0:\r\n a += ','\r\n a += i\r\n counter += 1\r\n if a[0] == ',':\r\n print('$' + a[1:] + '.00')\r\n #\r\n else:\r\n print('$' + a + '.00')\r\n #\r\n", "# Problem Link: https://codeforces.com/problemset/problem/143/B\r\n# Problem Status:\r\n# ---------------------- SEPARATOR ----------------------\r\ndef TheAmazingFunction(S: str):\r\n Answer = \"\"\r\n # ------------- SEPARATOR -------------\r\n Count = 0\r\n if S.find('.') != -1:\r\n for i in range(S.find('.')-1, -1, -1):\r\n if S[i] == '-':\r\n break\r\n if Count == 3:\r\n Answer = ',' + Answer\r\n Count = 0\r\n Answer = S[i] + Answer\r\n Count += 1\r\n if S.find('.') <= len(S)-3:\r\n Answer += '.' + S[S.find('.')+1] + S[S.find('.')+2]\r\n else:\r\n Temp = \"\"\r\n i = S.find('.') + 1\r\n while i <= len(S)-1:\r\n Temp += S[i]\r\n i += 1\r\n if len(Temp) == 1:\r\n Temp += '0'\r\n Answer += '.' + Temp\r\n else:\r\n for i in range(len(S)-1, -1, -1):\r\n if S[i] == '-':\r\n break\r\n if Count == 3:\r\n Answer = ',' + Answer\r\n Count = 0\r\n Answer = S[i] + Answer\r\n Count += 1\r\n Answer += \".00\"\r\n # ------------- SEPARATOR -------------\r\n Answer = '$' + Answer\r\n # ------------- SEPARATOR -------------\r\n if S[0] == '-':\r\n Answer = '(' + Answer + ')'\r\n # ------------- SEPARATOR -------------\r\n return Answer\r\n\r\n\r\n# ---------------------- SEPARATOR ----------------------\r\nText = input()\r\nprint(TheAmazingFunction(Text))\r\n# ---------------------- SEPARATOR ----------------------\r\n", "def main():\r\n s=input();\r\n ans=\"\"\r\n if(s[0]=='-'):\r\n ans+=')';\r\n i=len(s)-1\r\n x=-1\r\n while(i>=0):\r\n if(s[i]=='.'):\r\n x=i\r\n if(i+2<len(s)):\r\n ans+=s[i+2];\r\n else:\r\n ans+=\"0\"\r\n if (i + 1 < len(s)):\r\n ans += s[i + 1];\r\n else:\r\n ans += \"0\"\r\n ans+='.'\r\n break\r\n i-=1\r\n if(x==-1):\r\n ans+=\"00.\"\r\n x=len(s)\r\n i=x-1\r\n c=1\r\n while(i>=0):\r\n if(s[i]=='-'):\r\n break\r\n ans+=s[i]\r\n if(c%3==0 and i>0 and s[i-1]!='-'):\r\n ans+=\",\"\r\n c+=1\r\n i-=1\r\n ans+=\"$\"\r\n if(ans[0]==')'):\r\n ans+=\"(\"\r\n if(s==\"0\"):\r\n print(\"$0.00\")\r\n else:\r\n print(ans[::-1])\r\nif __name__ == '__main__':main()", "s, neg = input(), False\r\nif s[0] == '-':\r\n s, neg = s[1:], True\r\n\r\np = s.find('.')\r\nif p == -1:\r\n s += '.00'\r\nelif len(s) - p == 2:\r\n s += '0'\r\nelif len(s) - p > 3:\r\n s = s[:p + 3]\r\n\r\nd = s.split('.')[0] + ','\r\nwhile d.find(',') > 3:\r\n c = d.find(',') - 3\r\n d = d[:c] + ',' + d[c:]\r\nd = d[:-1]\r\n\r\nprint('(' * neg + '$' + d + s[-3:] + ')' * neg)", "t = input()\r\na, b = int(t[0] == '-'), t.find('.')\r\nif b < 0:\r\n b = len(t)\r\n t += '.'\r\nc = (b - a) % 3\r\nprint('(' * a + '$' + t[a: a + c] + ',' * (b - a > 2 and c > 0) + \r\n','.join(t[i: i + 3] for i in range(a + c, b, 3)) \r\n+ (t[b:] + '00')[: 3] + ')' * a)", "s = input()\n\ns = (s + \".\") if \".\" not in s else s\ns1, s2 = s.split(\".\")\n\nneg = 0\ns2 = s2[:2]\n\nif s1[0] == '-':\n\ts1 = s1[1:]\n\tneg = 1\n\nif len(s2) == 0:\n\ts2 = \"00\"\nelif len(s2) == 1:\n\ts2 += \"0\"\n\ns1 = s1[::-1]\nret = \"\"\n\nfor i in range(len(s1)):\n\tif i and i % 3 == 0:\n\t\tret += ','\n\tret += s1[i]\n\nret = ret[::-1]\n\nans = \"\"\nif neg:\n\tans += '('\nans += '$' + ret + '.' + s2\nif neg:\n\tans += ')'\n\nprint(ans)\n\n\n\n\n\n\n\t\t\t\t \t \t \t \t\t \t \t \t\t \t\t\t", "num = list(input())\r\n\r\nif num[0] == '-':\r\n minus = True\r\n num = num[1:]\r\nelse:\r\n minus = False\r\n \r\nif '.' not in num:\r\n num += '.'\r\n\r\nnum +='000'\r\nnum = num[:num.index('.') + 3]\r\n\r\n\r\ns = ''\r\nk = len(num)%3 - 1\r\nfor i in range(0,len(num)):\r\n s += num[i]\r\n \r\n if (i-k) % 3 == 0 and i < len(num) - 4: s += ','\r\n \r\nif minus: s = '($' + s + \")\"\r\nelse: s = \"$\" + s\r\n\r\nprint(s)", "n = input().split(\".\")\r\n\r\nip=''\r\ndp=''\r\nbrac=False\r\nif len(n)==1:\r\n dp='00'\r\nelse:\r\n dp = n[-1][:2]\r\nif len(dp)==1:\r\n dp+='0'\r\nif n[0][0]=='-':\r\n brac=True\r\n n[0] = n[0][1:]\r\n\r\np = n[0][::-1]\r\nfor i in range(0, len(p), 3):\r\n ip+=p[i:min(i+3 , len(p))] + ','\r\nip = '$' + ip[:-1][::-1]\r\nans = ip + '.'+dp\r\nif brac==True:\r\n ans = '(' + ans + ')'\r\nprint(ans)", "n=input()\r\nif n[0]=='-':\r\n neg=True\r\n n=n.replace('-','')\r\nelse: \r\n neg=False\r\n \r\nend=''\r\nfront=''\r\nif '.' in n:\r\n i=n.index('.')\r\n front=n[:i]\r\n l=len(n[i+1:])\r\n if l==1:\r\n end=n[i+1]+'0'\r\n else:\r\n end=n[i+1]+n[i+2]\r\nelse:\r\n front=n\r\n end='00'\r\n\r\nfront=front[::-1]\r\nk=''\r\nfor i in range(len(front)):\r\n if i and i%3==0:\r\n k+=','\r\n k+=front[i]\r\nans='$'+k[::-1]+'.'+end\r\nif neg:\r\n print('('+ans+')')\r\nelse:\r\n print(ans)\r\n", "\"\"\"\r\n Template written to be used by Python Programmers.\r\n Use at your own risk!!!!\r\n Owned by enraged(rating - 5 star at CodeChef and Specialist at Codeforces).\r\n\"\"\"\r\nimport sys\r\nimport bisect\r\nimport heapq\r\nfrom math import *\r\nfrom collections import defaultdict as dd # defaultdict(<datatype>) Free of KeyError.\r\nfrom collections import deque # deque(list) append(), appendleft(), pop(), popleft() - O(1)\r\nfrom collections import Counter as c # Counter(list) return a dict with {key: count}\r\nfrom itertools import combinations as comb\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\n# sys.setrecursionlimit(2*pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(var)\r\ndef l(): return list(map(int, data().split()))\r\ndef sl(): return list(map(str, data().split()))\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [[val for i in range(n)] for j in range(m)]\r\n\r\n\r\ns = data()\r\ndecimal = -1\r\nbracket = False\r\nfor i in range(len(s)):\r\n if s[i] == '.':\r\n decimal = i+1\r\n break\r\nif decimal == -1:\r\n p1, p2 = list(s), ['0', '0']\r\nelse:\r\n p1, p2 = list(s[:decimal-1]), list(s[decimal:])\r\nif len(p2) < 2:\r\n while len(p2) < 2:\r\n p2.append('0')\r\nelse:\r\n while len(p2) > 2:\r\n p2.pop()\r\nif p1[0] == '-':\r\n p1.pop(0)\r\n bracket = True\r\ncomma = len(p1) // 3\r\nmod = len(p1) % 3\r\nfirst = [mod]\r\nfor i in range(comma-1):\r\n first.append(first[len(first)-1]+3)\r\nif bracket:\r\n out(\"(\")\r\nout(\"$\")\r\nfor i in range(len(p1)):\r\n if i in first and i > 0:\r\n out(\",\")\r\n out(p1[i])\r\nout(\".\")\r\nfor i in p2:\r\n out(i)\r\nif bracket:\r\n out(\")\")\r\n", "# GOD\r\nimport sys, re\r\n\r\ns = sys.stdin.readline().strip()\r\n\r\nm = re.match(r'^(\\-?)(\\d+)(\\.?)(\\d*)$', s)\r\n\r\ns = '$' + format(int(m.group(2)), ',') + '.' + (m.group(4)+'00')[0:2]\r\n\r\nif m.group(1) == '-':\r\n s = '(' + s + ')'\r\n\r\nprint(s)", "__author__ = 'NIORLYS'\r\n\r\n\r\ndef financial_format_integer(number):\r\n if len(number) <= 3:\r\n return number\r\n r = []\r\n for i in range(1, len(number) + 1):\r\n r.append(number[-i])\r\n if i % 3 == 0 and i < len(number):\r\n r.append(',')\r\n r.reverse()\r\n return r\r\n\r\n\r\nn = list(input())\r\nif '.' in n:\r\n dot_index = n.index('.')\r\n if len(n) - 1 - dot_index == 1:\r\n n.append('0')\r\n elif len(n) - 1 - dot_index > 2:\r\n k = len(n) - 1 - dot_index - 2\r\n while k:\r\n n.pop()\r\n k -= 1\r\n decimal_part = ''.join(n[dot_index: len(n)])\r\n if n[0] != '-':\r\n integer_part = ''.join(financial_format_integer(n[0:dot_index]))\r\n print('$' + integer_part + decimal_part)\r\n else:\r\n integer_part = ''.join(financial_format_integer(n[1:dot_index]))\r\n print('(' + '$' + integer_part + decimal_part + ')')\r\nelse:\r\n decimal_part = '.00'\r\n if n[0] != '-':\r\n integer_part = ''.join(financial_format_integer(n))\r\n print('$' + integer_part + decimal_part)\r\n else:\r\n integer_part = ''.join(financial_format_integer(n[1:len(n)]))\r\n print('(' + '$' + integer_part + decimal_part + ')')\r\n\r\n\r\n", "# import sys\n# sys.stdin = open('_input.txt')\n\ninp = list(input().split('.'))\nans = ['', '', '.', '00', '']\n\nans[0] = '$' if inp[0][0]!='-' else '($'\nans[4] = '' if inp[0][0]!='-' else ')'\n\nans[1] = inp[0] if inp[0][0]!='-' else inp[0][1:]\nans[1] = ''.join(reversed(ans[1]))\nfor i, j in zip(range(3, len(ans[1]), 3), range(len(ans[1]))):\n ans[1] = ans[1][:i+j] + ',' + ans[1][i+j:]\nans[1] = ''.join(reversed(ans[1]))\nif len(inp)==2:\n if len(inp[1]) < 2: ans[3] = inp[1][0] + '0'\n else: ans[3] = inp[1][:2]\n\nprint(''.join(ans))", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\nA = input()\r\ntry:\r\n intger,fraction = A.split(\".\")\r\nexcept:\r\n intger = A\r\n fraction = \"00\"\r\nif len(fraction) >=2:\r\n fraction = fraction[:2]\r\nelse:\r\n fraction = fraction + \"0\"*(2-len(fraction))\r\nif A[0] == '-':\r\n intger = intger[1:]\r\ncount = 0\r\nstr = ''\r\nfor i in range(len(intger)-1,-1,-1):\r\n if count == 2 and i != 0:\r\n str = \",\"+intger[i] + str\r\n count = 0\r\n else:\r\n str = intger[i] + str\r\n count += 1\r\nans = \"$\" + str + \".\" + fraction\r\nif A[0] == '-':\r\n ans = \"(\" + ans + \")\"\r\nprint(ans)\r\n\r\n\r\n", "n=input()\r\n\r\nb,c=0,0\r\nif n[0]=='-':\r\n c=1\r\nn=list(n)\r\nif c==1:\r\n n.remove(n[0])\r\ntry:\r\n a=n.index('.')\r\nexcept:\r\n b=1\r\n \r\nif b==1:\r\n end='.00'\r\n n.append(end)\r\n \r\nelse:\r\n if (a+2)>=len(n):\r\n n.append('0')\r\n else:\r\n n=n[:(a+3)]\r\n \r\nn=''.join(n)\r\nq=n[:-3]\r\nlenq=len(q)\r\nif c==1:\r\n print('($',end='')\r\nelse:\r\n print('$',end='')\r\n\r\n\r\nif lenq>3:\r\n if lenq%3==0:\r\n print(n[:3],end='')\r\n w=3\r\n elif lenq%3==1:\r\n print(n[:1],end='')\r\n w=1\r\n elif lenq%3==2:\r\n print(n[:2],end='')\r\n w=2\r\n while w<lenq:\r\n print(','+n[w:(w+3)],end='')\r\n w+=3\r\n print(n[-3:],end='')\r\nelse:\r\n print(n,end='')\r\n\r\nif c==1:\r\n print(')') ", "\nnum=input()\nm=False\nif num[0]==\"-\":\n m=True\n num=num[1:]\ni=num.find(\".\")-1\nif i<0:i=len(num)-1\nd=num[i+2:i+4]\nif len(d)==1:d+=\"0\"\nelif len(d)==0:d+=\"00\"\nans=str()\nc=0\nwhile i>=0:\n if not c%3:ans+=','\n ans+=num[i]\n i-=1\n c+=1\nfin=ans[::-1][:-1]+\".\"+d\nif not fin:\n print(\"$\"+fin)\nelif m:\n print(\"($\"+fin+\")\")\nelse:print(\"$\"+fin)", "# import sys\n\n# sys.stdout = open('output.txt', 'w')\n# sys.stdin = open('input.txt', 'r')\n\ndef solve():\n a = input()\n x = a.split('.')\n\n neg = False\n if x[0][0] == '-':\n neg = True\n x[0] = x[0][1:]\n\n b = x[0]\n b = b[::-1]\n\n c = []\n res = '$'\n\n ct = 0\n i = 0\n j = 3\n\n while j < len(b):\n c.append(b[i:j])\n i += 3\n j += 3\n c.append(b[i:])\n \n for s in c[::-1]:\n res += s[::-1] + ','\n\n res = res[0:len(res)-1]\n res += '.'\n \n if len(x) == 1:\n res += '00'\n elif len(x[1]) >= 2:\n res += x[1][0]\n res += x[1][1]\n elif len(x[1]) == 1:\n res += x[1][0]\n res += '0'\n\n if neg == True:\n print(f'({res})')\n else:\n print(res)\n\nt = 1\n# t = int(input())\n\nwhile t > 0:\n solve()\n t -= 1", "amt = input()\r\nisNegative = (amt[0]=='-')\r\namt = amt.replace('-','')\r\nhasDecimal = amt.find('.')\r\nans='$'\r\nif hasDecimal>=0:\r\n temp = amt.split('.')\r\n firstp_r = temp[0][::-1]\r\n secondp = temp[1]\r\n firstp = ''\r\n for i in range(len(firstp_r)):\r\n if(i%3==0) and i!=0:\r\n firstp = firstp_r[i]+','+firstp\r\n else:\r\n firstp = firstp_r[i]+firstp\r\n ans+=firstp+'.'\r\n if(len(secondp)>=2):\r\n ans+=secondp[:2:]\r\n else:\r\n ans+=secondp+'0'\r\n if isNegative:\r\n ans = '('+ans+')'\r\n print(ans)\r\nelse:\r\n firstp_r = amt[::-1]\r\n firstp = ''\r\n for i in range(len(firstp_r)):\r\n if(i%3==0) and i!=0:\r\n firstp = firstp_r[i]+','+firstp\r\n else:\r\n firstp = firstp_r[i]+firstp\r\n ans+=firstp+'.00'\r\n if isNegative:\r\n ans = '('+ans+')'\r\n print(ans)" ]

[ "n, p = int( input() ) + 1, [0] + list( map( int, input().split() ) )\ns = '_' + input()\nans = sum( p[i] for i in range(n) if s[i] == 'B' )\nf1 = [0]\nfor i in range(1, n):\n f1.append(f1[-1] + ( 0 if s[i] == 'A' else p[i] ))\nf1 += [0]\nf2 = [0]\nfor i in reversed(range(1, n)):\n f2.append(f2[-1] + ( 0 if s[i] == 'A' else p[i] ) )\nf2 += [0]\nf2.reverse()\nac = 0\nfor i in range(1, n):\n if s[i] == 'A': ac += p[i]\n ans = max(ans, ac + f2[i + 1])\nac = 0\nfor i in reversed( range(1, n) ):\n if s[i] == 'A': ac += p[i]\n ans = max(ans, ac + f1[i - 1])\nprint(ans)\n", "def solve(n, arr, s):\r\n\r\n suff1, suff2 = [0] * (n + 1), [0] * (n + 1)\r\n pref1, pref2 = [0] * (n + 1), [0] * (n + 1)\r\n\r\n for i in range(n):\r\n if s[i] == 'B':\r\n pref1[i+1] += arr[i]\r\n else:\r\n pref2[i+1] += arr[i]\r\n\r\n if s[-i-1] == 'B':\r\n suff1[-i-2] += arr[-i-1]\r\n else:\r\n suff2[-i-2] += arr[-i-1]\r\n \r\n pref1[i+1] += pref1[i]\r\n pref2[i+1] += pref2[i]\r\n\r\n suff1[-i-2] += suff1[-i-1]\r\n suff2[-i-2] += suff2[-i-1]\r\n mx = -1e99\r\n for i in range(n+1):\r\n mx = max(mx, pref1[i]+suff2[i], pref2[i]+suff1[i])\r\n return str(mx)\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\ns = input()\r\nprint(solve(n, arr, s))", "n = int(input())\r\np = input().split()\r\na = input()\r\nsumA=0\r\nsumB=0\r\nfor i in range (n) :\r\n p[i] = int(p[i])\r\n #if a[i]==\"A\" :\r\n # sumA+=p[i]\r\n if a[i]==\"B\" :\r\n sumB+=p[i]\r\nresult = [sumB]\r\nsumBLast = sumB\r\nfor i in range (n) :\r\n if a[i]==\"A\" :\r\n #sumA-=p[i]\r\n sumB+=p[i]\r\n if a[i]==\"B\" :\r\n sumB-=p[i]\r\n if a[n-i-1]==\"A\" :\r\n sumBLast+=p[n-i-1]\r\n if a[n-i-1]==\"B\" :\r\n sumBLast-=p[n-i-1]\r\n result.append(sumB)\r\n result.append(sumBLast)\r\nprint(max(result))\r\n", "n = input()\ns = [int(x) for x in input().split(' ')]\ng = input()\nA = 0\nB = 0\nfor i in range(len(g)):\n\tif g[i] == 'A':\n\t\tA += s[i]\n\telse:\n\t\tB += s[i]\n\nstartA, startB = A, B\nmaximum = B\n\nfor i in range(len(g)):\n\tif g[i] == 'A':\n\t\tA -= s[i]\n\t\tB += s[i]\n\telse:\n\t\tA += s[i]\n\t\tB -= s[i]\n\tif B > maximum:\n\t\tmaximum = B\n\nA, B = startA, startB\n\nfor i in reversed(range(len(g))):\n\tif g[i] == 'A':\n\t\tA -= s[i]\n\t\tB += s[i]\n\telse:\n\t\tA += s[i]\n\t\tB -= s[i]\n\tif B > maximum:\n\t\tmaximum = B\n\nprint(maximum)", "#!/usr/bin/python3\n\nn = int(input())\nstrength = [int(i) for i in input().split()]\ns = input()\n\ntotal = 0\nfor i in range(n):\n\tif s[i] == 'B':\n\t\ttotal += strength[i]\nprefix = [0]*n\nsuffix = [0]*n\nfor i in range(n):\n\tif s[i] == 'A':\n\t\tif i == 0:\n\t\t\tprefix[i] = 0 + strength[i]\n\t\telse:\n\t\t\tprefix[i] = prefix[i-1] + strength[i]\n\telse:\n\t\tif i == 0:\n\t\t\tprefix[i] = 0 - strength[i]\n\t\telse:\n\t\t\tprefix[i] = prefix[i-1] - strength[i]\n\nfor i in range(n-1, -1, -1):\n\tif s[i] == 'A':\n\t\tif i == n-1:\n\t\t\tsuffix[i] = 0 + strength[i]\n\t\telse:\n\t\t\tsuffix[i] = suffix[i+1] + strength[i]\n\telse:\n\t\tif i == n-1:\n\t\t\tsuffix[i] = 0 - strength[i]\n\t\telse:\n\t\t\tsuffix[i] = suffix[i+1] - strength[i]\nx = 0\nfor i in range(n):\n\tif prefix[i] > x:\n\t\tx = prefix[i]\nfor i in range(n):\n\tif suffix[i] > x:\n\t\tx = suffix[i]\n#print(str(total))\n#print(str(x))\ntotal += x\nprint(str(total))\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nb = input()\r\nans = 0\r\nper = 0\r\nstart = 0\r\nfor i in range(n):\r\n if b[i] == 'B':\r\n start += A[i]\r\nfor i in range(n):\r\n if b[i] == 'A':\r\n per += A[i]\r\n else:\r\n per -= A[i]\r\n ans = max(per, ans)\r\n\r\nper = 0\r\nfor i in range(n-1, -1,-1):\r\n if b[i] == 'A':\r\n per += A[i]\r\n else:\r\n per -= A[i]\r\n ans = max(per, ans)\r\nprint(start+ans)", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n input()\r\n pieces = tuple(zip(map(int, input().split()), input()))\r\n return Bob_sMaxStrength(pieces)\r\n\r\n\r\ndef Bob_sMaxStrength(pieces):\r\n pScore = sScore = pMaxScore = sMaxScore = sum(piece[0] for piece in pieces if piece[1] == 'B')\r\n\r\n for piece in pieces:\r\n if piece[1] == 'A':\r\n pScore += piece[0]\r\n if pScore > pMaxScore:\r\n pMaxScore = pScore\r\n else:\r\n pScore -= piece[0]\r\n\r\n for i in range(len(pieces)-1, -1, -1):\r\n if pieces[i][1] == 'A':\r\n sScore += pieces[i][0]\r\n if sScore > sMaxScore:\r\n sMaxScore = sScore\r\n else:\r\n sScore -= pieces[i][0]\r\n\r\n if pMaxScore > sMaxScore:\r\n return pMaxScore\r\n\r\n return sMaxScore\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "\n\n\n\ndef f(n, parr, assign):\n total = 0\n for i in range(n): \n total = total + parr[i] if assign[i] == 'B' else total\n max_v = total\n copy_total = total\n for i in range(n):\n if assign[i] == 'A': \n total += parr[i]\n else:\n total -= parr[i] \n max_v = max(max_v, total)\n \n total = copy_total\n for i in range(n-1, -1, -1):\n if assign[i] == 'A': \n total += parr[i]\n else:\n total -= parr[i] \n max_v = max(max_v, total)\n \n print(max_v)\n \n\nif __name__ == '__main__':\n n = int(input())\n parr = [int(v) for v in input().split(\" \")]\n assign = input()\n f(n, parr, assign)", "n = int(input())\r\nP = list(map(int, input().split()))\r\ns = list(str(input()))\r\n\r\nA = [0]*(n+1)\r\nB = [0]*(n+1)\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n A[i+1] += P[i]\r\n else:\r\n B[i+1] += P[i]\r\nfrom itertools import accumulate\r\nA = list(accumulate(A))\r\nB = list(accumulate(B))\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n ans = max(ans, A[i]+B[-1]-B[i])\r\n\r\nP.reverse()\r\ns.reverse()\r\n\r\nA = [0]*(n+1)\r\nB = [0]*(n+1)\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n A[i+1] += P[i]\r\n else:\r\n B[i+1] += P[i]\r\nA = list(accumulate(A))\r\nB = list(accumulate(B))\r\nfor i in range(n+1):\r\n ans = max(ans, A[i]+B[-1]-B[i])\r\nprint(ans)\r\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN=int(readline())\r\nP=list(map(int,readline().split()))\r\nS=readline().rstrip()\r\nans=sum(p for p,s in zip(P,S) if s==\"B\")\r\ncumsum_P=[0]+[p if s==\"A\" else -p for p,s in zip(P,S)]\r\nfor i in range(1,N+1):\r\n cumsum_P[i]+=cumsum_P[i-1]\r\nans=max(ans+max(cumsum_P),ans+(cumsum_P[N]-min(cumsum_P)))\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = input()\r\nl = 0\r\nb = []\r\nfor i in range(n):\r\n if s[i]==\"B\":\r\n l+=a[i]\r\np = 0\r\nb.append(l)\r\nfor i in range(n):\r\n if s[i]==\"B\":\r\n l=l-a[i]\r\n else:\r\n p+=a[i]\r\n b.append(l+p)\r\nl = 0\r\nfor i in range(n):\r\n if s[i]==\"B\":\r\n l+=a[i]\r\np = 0\r\nfor i in range(n-1,-1,-1):\r\n if s[i]==\"B\":\r\n l=l-a[i]\r\n else:\r\n p+=a[i]\r\n b.append(l+p)\r\nprint(max(b))\r\n", "# _\r\n#####################################################################################################################\r\n\r\nfrom itertools import accumulate\r\n\r\n\r\ndef main():\r\n input()\r\n pieces = tuple(value(strength, team) for strength, team in zip(map(int, input().split()), input()))\r\n return Bob_sMaxStrength(pieces)\r\n\r\n\r\ndef value(strength, team):\r\n if team == 'A':\r\n return strength\r\n\r\n return -strength\r\n\r\n\r\ndef Bob_sMaxStrength(pieces):\r\n pMaxScore = max(accumulate(pieces))\r\n sMaxScore = max(accumulate(pieces[::-1]))\r\n\r\n if pMaxScore < 0 and sMaxScore < 0:\r\n return -sum(piece for piece in pieces if piece < 0)\r\n\r\n if pMaxScore > sMaxScore:\r\n return pMaxScore - sum(piece for piece in pieces if piece < 0)\r\n\r\n return sMaxScore - sum(piece for piece in pieces if piece < 0)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\ns = list(input().rstrip())\r\nm = 0\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n m += p[i]\r\nans = m\r\nc = m\r\nfor i in range(n):\r\n if s[i] == \"A\":\r\n c += p[i]\r\n else:\r\n c -= p[i]\r\n ans = max(ans, c)\r\nc = m\r\nfor i in range(n - 1, -1, -1):\r\n if s[i] == \"A\":\r\n c += p[i]\r\n else:\r\n c -= p[i]\r\n ans = max(ans, c)\r\nprint(ans)", "n = int(input())\r\nP = list(map(int, input().split()))\r\nS = input()\r\nresult = 0\r\nfor c in 'AB':\r\n sum = 0\r\n for s, p in zip(S, P):\r\n if s == c:\r\n sum += p\r\n for s, p in zip(S, P):\r\n if s == c:\r\n sum -= p\r\n else:\r\n sum += p\r\n result = max(result, sum)\r\nprint(result)\r\n", "#!/usr/bin/env python3\n\nN = int(input())\narr = list(map(int, input().split()))\nteams = input()\n\ninitial = sum(arr[i] for i in range(N) if teams[i] == 'B')\nbest = initial\n\n# prefixes\ncur = initial\nfor i in range(N):\n if teams[i] == 'B':\n cur -= arr[i]\n else:\n cur += arr[i]\n if cur > best:\n best = cur\n\n# suffixes\ncur = initial\nfor i in range(N-1, -1, -1):\n if teams[i] == 'B':\n cur -= arr[i]\n else:\n cur += arr[i]\n if cur > best:\n best = cur\n\nprint(best)\n", "import collections\r\nimport math\r\n\r\n#n, p = map(int, input().split())\r\nn = int(input())\r\np = list(map(int, input().split()))\r\ns = input()\r\n\r\ndef solve(p, s):\r\n a, b = [0] * n, [0] * n\r\n m = 0\r\n if s[0] == 'B':\r\n b[0] = p[0]\r\n m += p[0]\r\n else:\r\n a[0] = p[0]\r\n for i in range(1, n):\r\n if s[i] == 'B':\r\n b[i] += p[i]\r\n m += p[i]\r\n else:\r\n a[i] += p[i]\r\n a[i] += a[i - 1]\r\n b[i] += b[i - 1]\r\n ans = m\r\n for i in range(n):\r\n if m - b[i] + a[i] > ans:\r\n ans = m - b[i] + a[i]\r\n return ans\r\nprint(max(solve(p, s), solve(p[::-1], s[::-1])))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = input()[:-1]\r\nx = 0\r\nx = sum(w[i] for i in range(n) if s[i] == 'B')\r\n\r\nc = d = x\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n c += w[i]\r\n else:\r\n c -= w[i]\r\n x = max(c, x)\r\n\r\nfor i in range(n-1, -1, -1):\r\n if s[i] == 'A':\r\n d += w[i]\r\n else:\r\n d -= w[i]\r\n x = max(d, x)\r\n\r\nprint(x)\r\n", "n = int(input())\nps = list(map(int, input().split()))\nqs = input()\n\nB = 0\nfor i in range(n):\n if qs[i] == 'B':\n B += ps[i]\n\nmaxi = B\nb = B\nfor i in range(n):\n if qs[i] == 'A':\n b += ps[i]\n elif qs[i] == 'B':\n b -= ps[i]\n maxi = max(maxi, b)\n\nb = B\nfor i in range(n-1, -1, -1):\n if qs[i] == 'A':\n b += ps[i]\n elif qs[i] == 'B':\n b -= ps[i]\n maxi = max(maxi, b)\n\nprint(maxi)\n", "def main():\n input()\n pp = list(map(int, input().split()))\n mask = [c == 'B' for c in input()]\n s = t = sum(p for p, m in zip(pp, mask) if m)\n res = [s]\n for p, m in zip(pp, mask):\n if m:\n s -= p\n else:\n s += p\n res.append(s)\n pp.reverse()\n mask.reverse()\n for p, m in zip(pp, mask):\n if m:\n t -= p\n else:\n t += p\n res.append(t)\n print(max(res))\n\n\nif __name__ == '__main__':\n main()\n", "n,t=int(input()),list(map(int,input().split()))\r\nb=[q*(d=='B')for q,d in zip(t,input())]\r\nv=sum(b)\r\nu=sum(t)-v\r\ns=max(u,v)\r\nfor i,j in zip(b,t):\r\n u+=2*i-j\r\n v+=j-2*i\r\n s=max(u,v,s)\r\nprint(s)", "n, t = int(input()), list(map(int, input().split()))\r\nb = [q * (d == 'B') for q, d in zip(t, input())]\r\nv = sum(b)\r\nu = sum(t) - v\r\ns = max(u, v)\r\nfor i in range(n):\r\n u += 2 * b[i] - t[i]\r\n v += t[i] - 2 * b[i]\r\n s = max(u, v, s)\r\nprint(s)", "n=int(input())+2 \r\narr=[0]+list(map(int,input().split()))+[0]\r\ns='x'+input()+'x'\r\naprfx=[0]*n \r\nprfx=[0]*n\r\nfor i in range(1,n-1):\r\n prfx[i]=prfx[i-1]+arr[i] \r\n if s[i]=='A':\r\n aprfx[i]+=arr[i]\r\n aprfx[i]+=aprfx[i-1] \r\nans=prfx[n-2]-aprfx[n-2]\r\nfor i in range(n-1):\r\n ans=max(ans,aprfx[i]+prfx[n-2]-prfx[i]-(aprfx[n-2]-aprfx[i]),prfx[i]-aprfx[i]+(aprfx[n-2]-aprfx[i]))\r\nprint(ans) \r\n \r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\ns = input()\r\ntotal = 0\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n total += p[i]\r\nans = total\r\ncur = total\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n cur += p[i]\r\n else:\r\n cur -= p[i]\r\n ans = max(ans, cur)\r\n\r\ncur = total\r\nfor i in reversed(range(n)):\r\n if s[i] == 'A':\r\n cur += p[i]\r\n else:\r\n cur -= p[i]\r\n ans = max(ans, cur)\r\n\r\nprint(ans)\r\n", "N = int(input())\r\nP = list(map(int, input().split()))\r\nS = input()\r\nS = [0 if S[i] == 'A' else 1 for i in range(N)]\r\n\r\nres = strength = sum(P[i] * S[i] for i in range(N))\r\n\r\nfor i in range(N):\r\n strength += (-1)**S[i] * P[i]\r\n res = max(res, strength)\r\n\r\nstrength = sum(P[i] * S[i] for i in range(N))\r\n\r\nfor i in range(N)[::-1]:\r\n strength += (-1)**S[i] * P[i]\r\n res = max(res, strength)\r\n\r\nprint(res)", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = input()\r\nmaxSuff = 0\r\ncnt = 0\r\nfor i in range(n):\r\n if s[i]==\"A\":\r\n maxSuff+=a[i]\r\n else:\r\n cnt += a[i]\r\nsuff = []\r\nsuff.append(maxSuff)\r\n\r\nfor i in range(1,n):\r\n if s[i-1]==\"A\":\r\n suff.append(suff[i-1]-a[i-1])\r\n else:\r\n suff.append(suff[i-1]+a[i-1])\r\n\r\nmaxPref = 0\r\ns = s[::-1]\r\na = a[::-1]\r\n\r\nfor i in range(n):\r\n if s[i]==\"A\":\r\n maxPref += a[i]\r\n\r\npref = []\r\npref.append(maxPref)\r\nfor i in range(1,n):\r\n if s[i-1]==\"A\":\r\n pref.append(pref[i-1]-a[i-1])\r\n else:\r\n pref.append(pref[i-1]+a[i-1])\r\nprint(max(max(max(pref),max(suff)),cnt))", "n = int(input())\r\np = list(map(int, input().split()))\r\ns = input()\r\n\r\nans = bob1 = bob2 = 0\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n ans += p[i]\r\n bob1 += p[i]\r\n bob2 += p[i]\r\n\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n bob1 += p[i]\r\n else:\r\n bob1 -= p[i]\r\n ans = max(ans, bob1)\r\n\r\nfor i in reversed(range(n)):\r\n if s[i] == 'A':\r\n bob2 += p[i]\r\n else:\r\n bob2 -= p[i]\r\n ans = max(ans, bob2)\r\n\r\nprint(ans)", "n, t = int(input()), list(map(int, input().split()))\r\nb = [q * (d == 'B') for q, d in zip(t, input())]\r\ny = v = sum(b)\r\nx = u = sum(t) - v\r\nfor i in range(n):\r\n u += 2 * b[i] - t[i]\r\n x = max(x, u)\r\n v += t[i] - 2 * b[i]\r\n y = max(y, v)\r\nprint(max(x, y))", "n = int(input())\r\np = [int(x) for x in input().split()]\r\ns = input()\r\n\r\ndef get_pref(c):\r\n pref = [0]*n\r\n pref[0] = p[0] if s[0] == c else 0\r\n for i in range(1, n):\r\n pref[i] = pref[i-1]\r\n pref[i] += p[i] if s[i] == c else 0\r\n return pref\r\n\r\ndef get_suff(c):\r\n suff = [0]*n\r\n suff[-1] = p[-1] if s[-1] == c else 0\r\n for i in reversed(range(0, n-1)):\r\n suff[i] = suff[i+1]\r\n suff[i] += p[i] if s[i] == c else 0\r\n return suff\r\n\r\npref_flip = get_pref('A')\r\npref_keep = get_pref('B')\r\nsuff_flip = get_suff('A')\r\nsuff_keep = get_suff('B')\r\n\r\nans = max(\r\n pref_flip[-1], suff_flip[0],\r\n pref_keep[-1], suff_keep[0]\r\n)\r\n\r\nfor i in range(n-1):\r\n ans = max(\r\n ans,\r\n pref_flip[i] + suff_keep[i+1],\r\n pref_keep[i] + suff_flip[i+1]\r\n )\r\nprint(ans)", "class CodeforcesTask632BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.strengths = []\n self.teams = ''\n\n def read_input(self):\n self.n = int(input())\n self.strengths = [int(x) for x in input().split(\" \")]\n self.teams = input()\n\n def process_task(self):\n a_score = 0\n b_score = 0\n for x in range(self.n):\n if self.teams[x] == \"A\":\n a_score += self.strengths[x]\n else:\n b_score += self.strengths[x]\n mx_chng = 0\n res = 0\n resback = 0\n for for_mv in range(self.n):\n if self.teams[for_mv] == \"A\":\n res += self.strengths[for_mv]\n else:\n res -= self.strengths[for_mv]\n mx_chng = max(mx_chng, res)\n for back_mv in range(self.n - 1, 0, -1):\n if self.teams[back_mv] == \"A\":\n resback += self.strengths[back_mv]\n else:\n resback -= self.strengths[back_mv]\n mx_chng = max(mx_chng, resback)\n self.result = str(mx_chng + b_score)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask632BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\np = list(map(int, input().split())) \ns = input()\n\na = [0]\nb = [0]\nfor i in range(n):\n\tif s[i] == 'A':\n\t\ta.append(a[-1] + p[i])\n\t\tb.append(b[-1])\n\telse:\n\t\tb.append(b[-1] + p[i])\n\t\ta.append(a[-1])\nrs = 0\nfor i in range(1, n + 1):\n\trs = max(rs, a[n] - a[i] + b[i], b[n] - b[i] + a[i])\nprint(rs)\n", "import sys\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\na = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\ns = sys.stdin.buffer.readline().decode('utf-8').rstrip()\r\n\r\nbob = 0\r\nfor i, c in enumerate(s):\r\n if c == 'B':\r\n bob += a[i]\r\n\r\nans = bob\r\n\r\nacc = 0\r\nfor i, c in enumerate(s):\r\n acc += a[i] * (1 if c == 'A' else -1)\r\n ans = max(ans, bob + acc)\r\n\r\nacc = 0\r\nfor i, c in zip(range(n-1, -1, -1), reversed(s)):\r\n acc += a[i] * (1 if c == 'A' else -1)\r\n ans = max(ans, bob + acc)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\npowers = [int(i) for i in input().split()]\r\nteams = input()\r\n\r\norg_power = 0\r\nfor i in range(n):\r\n if teams[i] == 'B':\r\n org_power += powers[i]\r\nmax_power, power = org_power, org_power\r\nfor i in range(n):\r\n if teams[i] == 'A':\r\n power += powers[i]\r\n max_power = max(max_power, power)\r\n else:\r\n power -= powers[i]\r\npower = org_power\r\nfor i in range(n - 1, -1, -1):\r\n if teams[i] == 'A':\r\n power += powers[i]\r\n max_power = max(max_power, power)\r\n else:\r\n power -= powers[i]\r\nprint(max_power)", "n=int(input())\r\narr=list(map(int,input().split()));s=input()\r\nif n==1:print(arr[0]);exit()\r\n#\r\npref_A=[]\r\npref_B=[]\r\nsumm=0\r\nfor i in range(n):\r\n if s[i]=='A':summ+=arr[i];pref_A.append(summ)\r\n else:pref_A.append(summ)\r\nsumm=0\r\nfor i in range(n):\r\n if s[i]=='B':summ+=arr[i];pref_B.append(summ)\r\n else:pref_B.append(summ)\r\n#\r\nsuff_B=[];suff_A=[]\r\nsumm=0\r\nfor i in range(n-1,-1,-1):\r\n if s[i]=='A':summ+=arr[i];suff_A.append(summ)\r\n else:suff_A.append(summ)\r\nsumm=0\r\nfor i in range(n-1,-1,-1):\r\n if s[i]=='B':summ+=arr[i];suff_B.append(summ)\r\n else:suff_B.append(summ)\r\nsuff_A=suff_A[::-1]\r\nsuff_B=suff_B[::-1]\r\n#choose an prefix\r\nans=0\r\n\r\nfor i in range(n):\r\n if i+1==n:ans=max(ans,pref_A[i])\r\n else:ans=max(ans,suff_B[i+1]+pref_A[i])\r\n#print(ans)\r\n#choose the suffix\r\n#print(pref_B)\r\n#print(suff_A)\r\nfor i in range(n-1,-1,-1):\r\n if i-1==-1:ans=max(ans,suff_A[i])\r\n else:ans=max(ans,suff_A[i]+pref_B[i-1])\r\n# print(ans,i)\r\nans=max(ans,max(pref_B),max(suff_B))\r\nprint(ans)\r\n", "if __name__ == '__main__':\r\n n = eval(input())\r\n p = list(map(int, input().split()))\r\n s = input()\r\n temp1 = temp2 = sum(p[i] for i in range(n) if s[i] == 'B')\r\n ans = temp1\r\n for i in range(n):\r\n if s[i] == 'A':\r\n temp1 += p[i]\r\n else:\r\n temp1 -= p[i]\r\n j = n - i - 1\r\n if s[j] == 'A':\r\n temp2 += p[j]\r\n else:\r\n temp2 -= p[j]\r\n ans = max(temp1, temp2, ans)\r\n print(ans)", "n = int(input())\np = list(map(int, input().split()))\ns = input()\nogmx = 0\npremx = [0] * (n+1)\nsufmx = [0] * (n+1)\n# score if no change\nfor i in range(n):\n if s[i] == 'B':\n ogmx += p[i]\n# prefix scores\npremx[0] = ogmx\nfor i in range(n):\n if s[i] == 'B':\n premx[i+1] = premx[i] - p[i]\n elif s[i] == 'A':\n premx[i+1] = premx[i] + p[i]\n# suffix scores\nsufmx[n] = ogmx\nfor i in range(n-1,-1,-1):\n if s[i] == 'B':\n sufmx[i] = sufmx[i+1] - p[i]\n elif s[i] == 'A':\n sufmx[i] = sufmx[i+1] + p[i]\n#print(ogmx)\n#print(premx)\n#print(sufmx)\nprint(max(max(premx), max(sufmx)))\n", "from itertools import accumulate\nimport math\n\nn = int(input())\np = [int(x) for x in input().split()]\nS1 = sum(p)\nd = [x == 'A' for x in input()]\nfor i in range(n):\n if d[i]: p[i] = -p[i]\nprefix = list(accumulate([0] + p))\nS = prefix[-1]\nm, M = min(prefix), max(prefix)\nprint((S1 + max(S - 2*m, 2*M - S)) // 2)\n", "import itertools\r\n\r\ndef magic(lst):\r\n lst1,lst2=lst[0],lst[1]\r\n g=itertools.accumulate\r\n v=[-x if y == 'B' else x for x,y in zip(lst1,lst2)]\r\n s=sum(lst1[i] if lst2[i] == 'B' else 0 for i in range(n))\r\n ans=(s+max(0, max(g(v)), max(g(v[::-1]))))\r\n return ans\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=input()\r\nprint(magic([a,b]))\r\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=input()\r\nans=0\r\nfor i in range(n):\r\n if s[i]=='A':\r\n ans+=a[i]\r\n\r\ndef calc(a,s):\r\n mx=0\r\n tmp=0\r\n for i in range(n):\r\n if s[i]=='A':\r\n tmp-=a[i]\r\n else:\r\n tmp+=a[i]\r\n mx=max(mx,tmp)\r\n return mx\r\n\r\nprint(ans+max(calc(a,s),calc(a[::-1],s[::-1])))", "n = int(input())\r\np = list(map(int, input().split()))\r\ns = input();\r\n\r\nstreng = 0;\r\nfor i in range(0, len(s)):\r\n if(s[i] == 'B'):\r\n streng += p[i]\r\n\r\nb = 0;\r\na = 0;\r\nans = streng\r\nfor i in range(0, len(s)):\r\n if(s[i] == 'B'):\r\n b +=p[i]\r\n else:\r\n a += p[i]\r\n curStren = streng - b + a;\r\n if curStren > ans:\r\n ans = curStren\r\na = 0;\r\nb = 0;\r\nfor i in range(1, len(s) + 1):\r\n if(s[-i] == 'B'):\r\n b +=p[-i]\r\n else:\r\n a += p[-i]\r\n curStren = streng - b + a;\r\n if curStren > ans:\r\n ans = curStren\r\n\r\nprint(ans)\r\n \r\n", "n = int(input())\r\np = [int(_) for _ in input().split()]\r\ns = input()\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n ans += p[i]\r\ntmp = 0\r\nmx = 0\r\nfor i in range(n):\r\n tmp += p[i] if s[i] == 'A' else -p[i]\r\n mx = max(tmp, mx)\r\ntmp = 0\r\nfor i in range(n)[::-1]:\r\n tmp += p[i] if s[i] == 'A' else -p[i]\r\n mx = max(tmp, mx)\r\nans += mx\r\nprint(ans)\r\n", "import sys\r\nimport itertools\r\n \r\nf = sys.stdin\r\ng = itertools.accumulate\r\n \r\nn = int(f.readline())\r\np = list(map(int, f.readline().split()))\r\nc = f.readline()\r\n \r\nv = [-x if y == 'B' else x for x,y in zip(p,c)]\r\ns = sum(p[i] if c[i] == 'B' else 0 for i in range(n))\r\nprint(s+max(0, max(g(v)), max(g(v[::-1]))))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=input()\r\ndef m(s,a):\r\n q,w=0,0\r\n for i in range(n):\r\n if s[i]==\"A\":q+=a[i]\r\n else:w+=a[i]\r\n r=w\r\n for i in range(n):\r\n if s[i]==\"A\":w+=a[i];q-=a[i]\r\n else:q+=a[i];w-=a[i]\r\n r=max(r,w)\r\n return r\r\nprint(max(m(s,a),m(s[::-1],a[::-1])))", "n = int(input())\r\npowers = [int(n) for n in input().split()]\r\nmarks = input()\r\nBob_power = sum([powers[i] for i in range(n) if marks[i] == 'B'])\r\nmax_Bob_power = Bob_power\r\nstart_Bob_power = Bob_power\r\nfor i in range(n):\r\n Bob_power += powers[i]*(1 if marks[i] == 'A' else -1)\r\n if max_Bob_power < Bob_power:\r\n max_Bob_power = Bob_power\r\nBob_power = start_Bob_power\r\nfor i in range(1, n + 1):\r\n Bob_power += powers[-i]*(1 if marks[-i] == 'A' else -1)\r\n if max_Bob_power < Bob_power:\r\n max_Bob_power = Bob_power\r\nprint(max_Bob_power)", "n = input()\r\nstrength = input()\r\nchars = input()\r\n\r\nstrength = strength.split(\" \")\r\ncost = 0\r\nfor k in range(0 , int(n)):\r\n if chars[k] == 'B':\r\n cost += int(strength[k])\r\ntemp = cost\r\ntemp_cost = temp\r\n\r\nfor j in range(0,int(n)):\r\n if chars[j] == 'A':\r\n temp_cost += int(strength[j])\r\n else :\r\n temp_cost -= int(strength[j])\r\n cost = max(cost,temp_cost)\r\n\r\ntemp_cost = temp\r\n\r\nfor j in range(int(n) - 1 , 0 , -1):\r\n if chars[j] == 'A':\r\n temp_cost += int(strength[j])\r\n else :\r\n temp_cost -= int(strength[j])\r\n cost = max(cost,temp_cost)\r\n\r\n\r\nprint(cost)", "n = input()\r\ns = [int(x) for x in input().split(' ')]\r\ng = input()\r\nA = 0\r\nB = 0\r\nfor i in range(len(g)):\r\n if g[i] == 'A':\r\n A += s[i]\r\n else:\r\n B += s[i]\r\n\r\nstartA, startB = A, B\r\nmaximum = B\r\n\r\nfor i in range(len(g)):\r\n if g[i] == 'A':\r\n A -= s[i]\r\n B += s[i]\r\n else:\r\n A += s[i]\r\n B -= s[i]\r\n if B > maximum:\r\n maximum = B\r\n\r\nA, B = startA, startB\r\n\r\nfor i in reversed(range(len(g))):\r\n if g[i] == 'A':\r\n A -= s[i]\r\n B += s[i]\r\n else:\r\n A += s[i]\r\n B -= s[i]\r\n if B > maximum:\r\n maximum = B\r\n\r\nprint(maximum)", "from itertools import accumulate\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\ns = input().rstrip()\r\n\r\nsm = [i*(1 - 2*(x == \"B\")) for i, x in zip(arr, s)]\r\n\r\nacc1 = [0] + list(accumulate(sm))\r\nacc2 = [0] + list(accumulate(sm[::-1]))\r\nt = max(max(acc1), max(acc2))\r\n\r\nprint(sum(i* (x==\"B\") for i, x in zip(arr, s)) + t)", "n = int(input())\r\nP = list(map(int, input().split()))\r\nS = list(input())\r\na_sum = 0\r\nb_sum = 0\r\nfor i in range(n):\r\n if S[i] == 'A':\r\n a_sum += P[i]\r\n else:\r\n b_sum += P[i]\r\n\r\nmax_b = b_sum\r\nb_sum_copy = b_sum\r\nfor i in range(n):\r\n if S[i] == 'A':\r\n b_sum += P[i]\r\n else:\r\n b_sum -= P[i]\r\n max_b = max(max_b, b_sum)\r\n\r\nb_sum = b_sum_copy\r\nfor i in range(n-1,-1,-1):\r\n if S[i] == 'A':\r\n b_sum += P[i]\r\n else:\r\n b_sum -= P[i]\r\n max_b = max(max_b, b_sum)\r\nprint(max_b)", "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\nn = ni()\r\na = [0]+na()\r\ns = input()\r\nb = [0] * (1+n)\r\n\r\nfor i in range(n):\r\n a[i+1] += a[i]\r\n if s[i] == \"A\":\r\n b[i+1] += b[i] + a[i+1]-a[i]\r\n else:\r\n b[i+1] += b[i]\r\nans = 0\r\nfor i in range(n+1):\r\n ans = max(a[i]-b[i]+b[-1]-b[i], ans)\r\n ans = max(b[i]+ (a[-1]-a[i])-(b[-1]-b[i]), ans)\r\n\r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.readline\n\nn=int(input())\nnums = list(map(int, input().split()))\ncat = input()\nqot = 0\nfor i in range(n):\n if cat[i] == 'A':\n nums[i] *= -1\n else:\n qot+=nums[i]\nprefix = [nums[0]]\nfor i in range(1,n):\n prefix.append(prefix[i-1] + nums[i])\nnums.reverse()\nsuffix = [nums[0]]\nfor i in range(1,n):\n suffix.append(suffix[i-1] + nums[i])\n\npre = min(prefix)\nsuf = min(suffix)\npresuf = min(pre,suf)\nif presuf < 0:\n qot -= presuf\n print(qot)\nelse:\n print(qot)\n\n\t\t\t\t\t\t \t\t \t \t\t\t\t \t \t \t", "n=int(input())\np=list(map(int,input().split()))\ns=input()\nmaxi=0\ntemp=0\nlocal=-1\nfor i in range(n):\n if s[i]=='A':\n temp+=p[i]\n else:\n temp-=p[i]\n if temp>maxi:\n local=i\n maxi=temp\nans=0\n\nfor i in range(local+1):\n if s[i]=='A':\n ans+=p[i]\n\n\nfor i in range(local+1,n):\n if s[i]=='B':\n ans+=p[i]\n\nmaxi=0\ntemp=0\nlocal=-1\np=list(reversed(p))\ns=s[::-1]\nfor i in range(n):\n if s[i]=='A':\n temp+=p[i]\n else:\n temp-=p[i]\n if temp>maxi:\n local=i\n maxi=temp\nans1=0\nfor i in range(local+1):\n if s[i]=='A':\n ans1+=p[i]\nfor i in range(local+1,n):\n if s[i]=='B':\n ans1+=p[i]\n\nprint(max(ans,ans1))\n", "def cnt(step):\r\n temp_total, ans = total, 0\r\n for i in range(N)[::step]:\r\n if chars[i] == 'A':\r\n temp_total += strengths[i]\r\n else:\r\n temp_total -= strengths[i]\r\n ans = max(temp_total, ans)\r\n return ans\r\n\r\nN = int(input())\r\nstrengths = [int(_) for _ in input().split()]\r\nchars = list(input())\r\n\r\n\r\ntotal = 0\r\nfor i, c in enumerate(chars):\r\n if c == 'B':\r\n total += strengths[i]\r\n\r\nprint(max([total, cnt(1), cnt(-1)]))", "n = int(input())\r\nstrength = list(map(int, input().split()))\r\npieces = input()\r\n\r\nbob = 0\r\n\r\nfor pos, p in enumerate(pieces):\r\n if p == \"B\":\r\n bob += strength[pos]\r\n\r\n\r\nbest_flip = 0\r\ncur_flip = 0\r\n\r\nfor st, p in zip(strength, pieces):\r\n if p == \"A\":\r\n cur_flip += st\r\n else:\r\n cur_flip -= st\r\n\r\n best_flip = max(best_flip, cur_flip)\r\n\r\ncur_flip = 0\r\nfor st, p in zip(reversed(strength), reversed(pieces)):\r\n if p == \"A\":\r\n cur_flip += st\r\n else:\r\n cur_flip -= st\r\n\r\n best_flip = max(best_flip, cur_flip)\r\n\r\nprint(bob + best_flip)", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n input()\r\n pieces = tuple(value(strength, team) for strength, team in zip(map(int, input().split()), input()))\r\n return Bob_sMaxStrength(pieces)\r\n\r\n\r\ndef value(strength, team):\r\n if team == 'A':\r\n return strength\r\n\r\n return -strength\r\n\r\n\r\ndef Bob_sMaxStrength(pieces):\r\n pScore = sScore = pMaxScore = sMaxScore = -sum(piece for piece in pieces if piece < 0)\r\n\r\n for piece in pieces:\r\n pScore += piece\r\n if piece > 0 and pScore > pMaxScore:\r\n pMaxScore = pScore\r\n\r\n for i in range(len(pieces)-1, -1, -1):\r\n sScore += pieces[i]\r\n if pieces[i] > 0 and sScore > sMaxScore:\r\n sMaxScore = sScore\r\n\r\n if pMaxScore > sMaxScore:\r\n return pMaxScore\r\n\r\n return sMaxScore\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "n = int(input())\r\nP = list(map(int, input().split()))\r\ns = input()\r\nres = sum(P[i] for i in range(n) if s[i] == 'B')\r\nmaxdiff = 0\r\nsuma = 0\r\nsumb = 0\r\nfor i in range(n):\r\n if(s[i] == 'A'):\r\n suma += P[i]\r\n else:sumb += P[i]\r\n if(suma - sumb > maxdiff):\r\n maxdiff = suma - sumb\r\n\r\nsuma = 0\r\nsumb = 0\r\nfor i in range(n)[::-1]:\r\n if(s[i] == 'A'):\r\n suma += P[i]\r\n else:sumb += P[i]\r\n if(suma - sumb > maxdiff):\r\n maxdiff = suma - sumb\r\n\r\nprint(res + maxdiff)\r\n", "n = int(input())\r\nL = list(map(int,input().split()))\r\ns = input()\r\n\r\nprefixe = [None for i in range(n)]\r\nsuffixe = [None for i in range(n)]\r\nsumA = 0\r\nsumB = 0\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n sumB += L[i]\r\n else:\r\n sumA += L[i]\r\nsum = max(sumA,sumB)\r\nfor i in range(n):\r\n if s[i] == \"A\":\r\n sumA -= L[i]\r\n sumB += L[i]\r\n else:\r\n sumA += L[i]\r\n sumB -= L[i]\r\n sum = max(sum,max(sumA,sumB))\r\n\r\nprint(sum)", "from sys import stdin\nimport operator\n\nN = int(stdin.readline())\n\np = list(map(int, stdin.readline().strip().split(\" \")))\nteams = list(map(lambda x: 1 if x == \"B\" else -1, stdin.readline().strip()))\n\nvalues = list(map(operator.mul, p, teams))\n\nstart = sum(filter(lambda x: max(x, 0), values))\n# print(start)\n\ntotal = start\nbest = start\nfor i in values:\n\ttotal -= i\n\tbest = max(total, best)\n\ntotal = start\nfor i in reversed(values):\n\ttotal -= i\n\tbest = max(total, best)\n\n# print(p, teams, values, best)\nprint(best)\n", "#import sys\r\n#sys.stdin = open('in', 'r')\r\nn = int(input())\r\np = [int(x) for x in input().split()]\r\n#n,m = map(int, input().split())\r\ns = input()\r\ninitB = 0\r\nlmax = 0\r\nrmax = 0\r\n\r\ncurdifl = 0\r\ncurdifr = 0\r\nfor i in range(n):\r\n initB += p[i] if s[i] == 'B' else 0\r\n curdifl += p[i] if s[i] == 'A' else -p[i]\r\n if curdifl > lmax:\r\n lmax = curdifl\r\n curdifr += p[-i-1] if s[-i-1] == 'A' else -p[-i-1]\r\n if curdifr > rmax:\r\n rmax = curdifr\r\n\r\nprint (initB + (max(lmax, rmax) if lmax > 0 or rmax > 0 else 0))\r\n", "n = int(input())\r\nprices = list(map(int, input().split()))\r\nwho = input()\r\nbasic = 0\r\nfor i in range(len(who)):\r\n if who[i] == \"B\":\r\n basic += prices[i]\r\nmax = basic\r\nnow = basic\r\nfor i in range(len(who)):\r\n if who[i] == \"A\":\r\n now += prices[i]\r\n else:\r\n now -= prices[i]\r\n if now > max:\r\n max = now\r\nnow = basic\r\nfor i in range(len(who) - 1, -1, -1):\r\n if who[i] == \"A\":\r\n now += prices[i]\r\n else:\r\n now -= prices[i]\r\n if now > max:\r\n max = now\r\nprint(max)", "import sys\ninput=sys.stdin.readline\nn=int(input())\npowers=list(map(int,input().strip().split()))\nteams=list(input().strip())\nlefts=[0]\nrights=[0]\nwithout=0\nfor i in range(n):\n \n if teams[i]=='A':\n lefts.append(lefts[-1]+powers[i])\n else:\n lefts.append(lefts[-1]-powers[i])\n without+=powers[i]\n if teams[n-i-1]=='A':\n rights.append(rights[-1]+powers[n-i-1])\n else:\n rights.append(rights[-1]-powers[n-i-1])\nprint(without+max(max(lefts),max(rights)))\n\t\t \t\t \t \t\t\t\t\t\t\t \t", "n = int(input())\r\npi = list(map(int,input().split()))\r\nab = input()\r\n\r\nnumi = [0]*n\r\nnumi2 = [0]*n\r\nif ab[0] == \"B\":\r\n numi[0] = pi[0]\r\nelse:\r\n numi2[0] = pi[0]\r\n \r\nfor i in range(1,n):\r\n if ab[i] == \"B\":\r\n numi[i] = numi[i-1] + pi[i]\r\n numi2[i] = numi2[i-1]\r\n else:\r\n numi2[i] = numi2[i-1] + pi[i]\r\n numi[i] = numi[i-1]\r\nn2 = n-1\r\nmaxi = numi[n2] \r\nfor i in range(n):\r\n maxi = max(maxi,numi[n2] - numi[i] + numi2[i])\r\nfor i in range(n-2,-1,-1):\r\n maxi = max(maxi,numi[i] + numi2[n2] - numi2[i])\r\nprint(maxi)\r\n", "import sys\r\nimport math\r\n# sys.stdin = open('input.txt')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef main():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n s = input()\r\n prefa = [0] * n\r\n prefb = [0] * n\r\n for i in range(n):\r\n if i != 0:\r\n prefa[i] = prefa[i - 1]\r\n prefb[i] = prefb[i - 1]\r\n if s[i] == 'A':\r\n prefa[i] += p[i]\r\n else:\r\n prefb[i] += p[i]\r\n suffa = [0] * n\r\n suffb = [0] * n\r\n for i in reversed(range(n)):\r\n if i != n - 1:\r\n suffa[i] = suffa[i + 1]\r\n suffb[i] = suffb[i + 1]\r\n if s[i] == 'A':\r\n suffa[i] += p[i]\r\n else:\r\n suffb[i] += p[i]\r\n maxa = suffb[0]\r\n for i in range(n):\r\n t1 = prefa[i]\r\n if i != n - 1:\r\n t1 += suffb[i + 1]\r\n t2 = suffa[i]\r\n if i != 0:\r\n t2 += prefb[i - 1]\r\n maxa = max([maxa, t1, t2])\r\n print(maxa)\r\n\r\nmain()", "import itertools\r\n\r\ndef magic(lst):\r\n lst1,lst2=lst[0],lst[1]\r\n c=itertools.accumulate\r\n a=[-i if j=='B' else i for i,j in zip(lst1,lst2)]\r\n b=sum(lst1[i] if lst2[i] == 'B' else 0 for i in range(n))\r\n ans=b+max(0, max(c(a)), max(c(a[::-1])))\r\n return ans\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=input()\r\nprint(magic([a,b]))\r\n", "n = int(input())\np = list(map(int, input().split()))\ns = input()\nans = 0\n\ncur_orig = 0\nfor i in range(0, len(s)):\n if s[i] == 'B': cur_orig += p[i]\n\ncur = cur_orig\nans = cur_orig\n\nfor i in range(0, len(s)):\n if s[i] == 'A':\n cur += p[i]\n ans = max(ans, cur)\n else:\n cur -= p[i]\n\ncur = cur_orig\n\nfor i in range(len(s) - 1, -1, -1):\n if s[i] == 'A':\n cur += p[i]\n ans = max(ans, cur)\n else:\n cur -= p[i]\n\nprint(ans)\n", "#632B\r\nmaxChange = 0\r\nn = int(input())\r\nstrList = list(map(int,input().split()))\r\nassignment = input()\r\ncurrStr = 0\r\nchangeStrPre = 0\r\nchangeStrSuf = 0\r\nfor x in range(n):\r\n if assignment[x] == \"B\":\r\n currStr += strList[x]\r\n changeStrPre -= strList[x]\r\n else:\r\n changeStrPre += strList[x]\r\n maxChange = max(maxChange, changeStrPre)\r\n if assignment[n-1-x] == \"B\":\r\n changeStrSuf -= strList[n-1-x]\r\n else:\r\n changeStrSuf += strList[n-1-x]\r\n maxChange = max(maxChange, changeStrSuf)\r\nprint(currStr + maxChange)\r\n", "#a = list(map(int, input().strip().split()))\r\n# from sys import stdout stdout.flush()\r\n\r\nn = int(input())\r\na = list(map(int, input().strip().split()))\r\ns = str(input())\r\n\r\nq = 0\r\nm = 0\r\nsu = 0\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n q += a[i] \r\n m = max(m, q)\r\n else:\r\n su += a[i]\r\n q -= a[i]\r\n\r\nq = 0\r\n\r\nfor i in range(n-1,-1,-1):\r\n if s[i] == 'A':\r\n q += a[i]\r\n m = max(m, q)\r\n else:\r\n q -= a[i]\r\n \r\nprint(su + m)", "n = int(input())\r\npower = list(map(int, input().split()))\r\ns = input()\r\ncnt = 0\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n cnt += power[i]\r\nans = cnt\r\nk = cnt\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n k -= power[i]\r\n else:\r\n k += power[i]\r\n ans = max(ans, k)\r\n \r\nk = cnt\r\nfor i in range(n - 1, -1, -1):\r\n if s[i] == 'B':\r\n k -= power[i]\r\n else:\r\n k += power[i]\r\n ans = max(ans, k)\r\nprint(ans)", "def main():\n input()\n l = [(p, c == 'B') for p, c in zip(map(int, input().split()), input())]\n s = t = sum(p for p, m in l if m)\n res = [s]\n for p, m in l:\n if m:\n s -= p\n else:\n s += p\n res.append(s)\n for p, m in reversed(l):\n if m:\n t -= p\n else:\n t += p\n res.append(t)\n print(max(res))\n\n\nif __name__ == '__main__':\n main()\n", "n, t = int(input()), list(map(int, input().split()))\r\nb = [q * (d == 'B') for q, d in zip(t, input())]\r\nv = sum(b)\r\nu = sum(t) - v\r\ns = max(u, v)\r\nfor i, j in zip(b, t):\r\n u += 2 * i - j\r\n v += j - 2 * i\r\n s = max(u, v, s)\r\nprint(s)" ]

[ "def DFS(x):\n\n for i in range(x):\n\n if(Seen[i][x]):\n\n continue\n\n if(Rem[i]>=C[x]):\n\n if(Rem[i]==C[x] and len(Children[i])==0):\n\n continue\n\n Rem[i]-=C[x]\n\n Parent[x]=i\n\n Children[i].append(x)\n\n return True\n\n for i in range(x):\n\n if(Seen[i][x]):\n\n continue\n\n Y=[]\n\n for j in range(len(Children[i])):\n\n \n\n child=Children[i][j]\n\n if(Seen[i][child]):\n\n continue\n\n Parent[child]=-1\n\n Rem[i]+=C[child]\n\n Seen[i][child]=True\n\n Seen[child][i]=True\n\n if(DFS(child)):\n\n Seen[i][child]=False\n\n Seen[child][i]=False\n\n continue\n\n Seen[i][child]=False\n\n Seen[child][i]=False\n\n Parent[child]=i\n\n Rem[i]-=C[child]\n\n Y.append(child)\n\n Children[i]=list(Y)\n\n if(Rem[i]>=C[x]):\n\n if(Rem[i]==C[x] and len(Children[i])==0):\n\n continue\n\n Rem[i]-=C[x]\n\n Children[i].append(x)\n\n Parent[x]=i\n\n return True\n\n return False\n\n \n\n \n\n\n\n\n\n\n\n\n\nn=int(input())\n\n\n\nC=list(map(int,input().split()))\n\nRem=[-1]*n\n\nParent=[-1]*n\n\nChildren=[]\n\nSeen=[]\n\nfor i in range(n):\n\n Seen.append([False]*n)\n\nC.sort(reverse=True)\n\n\n\nif(C[0]!=n or C.count(2)>0):\n\n print(\"NO\")\n\n\n\nelse:\n\n for i in range(n):\n\n Rem[i]=C[i]-1\n\n Children.append([])\n\n Parent[0]=0\n\n Ans=\"YES\"\n\n for i in range(1,n):\n\n if(DFS(i)==False):\n\n Ans=\"NO\"\n\n break\n\n for i in range(n):\n\n if(Rem[i]!=0 and C[i]!=1):\n\n Ans=\"NO\"\n\n break\n\n print(Ans)\n\n \n\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "# Read Time\r\nimport sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nh = list(map(int, input().split()))\r\n\r\np = list(map(int, input().split()))\r\n\r\n# minimmum time for h_i to cover all p_s...p_e\r\ndef min_t(h_i, p_s, p_e):\r\n return min(abs(h[h_i]-p[p_s]),abs(h[h_i]-p[p_e])) + (p[p_e]-p[p_s])\r\n\r\n# if all the heads can read all the tracks in <= mx_t time\r\n# we use greedy :)\r\ndef check(mx_t):\r\n h_i = 0\r\n p_i = 0\r\n while p_i < m and h_i < n:\r\n p_j = p_i\r\n while p_j+1 < m and min_t(h_i, p_i, p_j+1) <= mx_t:\r\n p_j += 1\r\n\r\n if min_t(h_i, p_i, p_j) <= mx_t:\r\n p_i = p_j+1\r\n\r\n h_i += 1\r\n\r\n return p_i == m\r\n\r\nl = 0\r\nr = 10**11\r\nwhile l != r:\r\n mt = (l+r)//2\r\n\r\n if check(mt):\r\n r = mt\r\n else:\r\n l = mt+1\r\n\r\nprint(l)\r\n", "n,m=map(int,input().split())\r\nhrr=list(map(int,input().split()))\r\nread=list(map(int,input().split()))\r\ndef check(t):\r\n i=0\r\n j=0\r\n while i<n and j<m:\r\n # print(i,j)\r\n if hrr[i]<=read[j]:\r\n # print(\"yes\",i,j)\r\n while j<m and t>=read[j]-hrr[i]:\r\n j+=1\r\n else:\r\n p=max((t-(hrr[i]-read[j]))//2,t-2*(hrr[i]-read[j]),0)\r\n if hrr[i]-read[j]>t:\r\n return False\r\n while j<m and hrr[i]>=read[j]:\r\n j+=1\r\n while j<m and p>=read[j]-hrr[i]:\r\n j+=1\r\n i+=1\r\n if j<m:\r\n return False\r\n return True\r\n \r\n \r\n# print(check(2)) \r\nlow=0\r\nhigh=10**15\r\nwhile low<=high:\r\n mid=(low+high)//2\r\n if check(mid):\r\n ans=mid\r\n high=mid-1\r\n else:\r\n low=mid+1\r\nprint(ans)", "import sys\r\nimport threading\r\n# input=sys.stdin.readline\r\nfrom collections import Counter,defaultdict,deque\r\nfrom heapq import heappush,heappop,heapify\r\n#threading.stack_size(10**8)\r\n#sys.setrecursionlimit(10**6)\r\n\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\ndef main():\r\n\tn,m=rl()\r\n\th=rl()\r\n\tp=rl()\r\n\trt=10**15\r\n\tlt=0\r\n\twhile rt>lt:\r\n\t\tmid=(rt+lt)//2\r\n\t\tpos=True\r\n\t\tj=0\r\n\t\tfor i in range(n):\r\n\t\t\tl=max(0,h[i]-p[j])\r\n\t\t\tif l>mid:\r\n\t\t\t\tpos=False\r\n\t\t\t\tbreak\r\n\t\t\twhile j<m and p[j]<h[i]:\r\n\t\t\t\tj+=1\r\n\t\t\twhile j<m:\r\n\t\t\t\tr=p[j]-h[i]\r\n\t\t\t\tif min(l,r)*2+max(l,r)>mid:\r\n\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tj+=1\r\n\t\t\tif j==m:\r\n\t\t\t\tbreak\r\n\t\tif pos and j==m:\r\n\t\t\trt=mid\r\n\t\telse:\r\n\t\t\tlt=mid+1\r\n\tprint(lt)\r\n\tpass\r\n\r\nmain()\r\n#threading.Thread(target=main).start()\r\n", "def f(x):\r\n l = 0\r\n for i in range(n):\r\n r = l\r\n res = abs(p[r] - p[l]) + min(abs(p[l] - h[i]), abs(p[r] - h[i]))\r\n while r < m and res <= x:\r\n r += 1\r\n if(r >= m): break\r\n res = abs(p[r] - p[l]) + min(abs(p[l] - h[i]), abs(p[r] - h[i]))\r\n l = r\r\n if r >= m: return True\r\n return False\r\nn, m = map(int, input().split())\r\nh = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nl = 0\r\nr = 10**12\r\nwhile l + 1 < r:\r\n mid = (l + r) // 2\r\n if f(mid): \r\n r = mid\r\n else: \r\n l = mid\r\nif f(l):\r\n print(l)\r\nelse:\r\n print(r)# 1691396973.7224364" ]

[ "numbers = {'0':0,'1':1,'2':2,'3':3,'4':4,'5':5,'6':6,'7':7,'8':8,'9':9,'A':10,'B':11,'C':12,'D':13,'E':14,'F':15,'G':16,'H':17,'I':18,'J':19,'K':20,'L':21,'M':22,'N':23,'O':24,'P':25,'Q':26,'R':27,'S':28,'T':29,'U':30,'V':31,'W':32,'X':33,'Y':34,'Z':35}\r\ncharacters = {0:'0',1:'1',2:'2',3:'3',4:'4',5:'5',6:'6',7:'7',8:'8',9:'9',10:'A',11:'B',12:'C',13:'D',14:'E',15:'F',16:'G',17:'H',18:'I',19:'J',20:'K',21:'L',22:'M',23:'N',24:'O',25:'P',26:'Q',27:'R',28:'S',29:'T',30:'U',31:'V',32:'W',33:'X',34:'Y',35:'Z'}\r\n\r\ndef ConvertToDecimal(number, base):\r\n\tnewnumber = 0\r\n\tfor digit in range(-1,(0-len(number))-1,-1):\r\n\t\tif(numbers[number[digit]] >= int(base)):\r\n\t\t\treturn -1\r\n\t\tnewnumber += numbers[number[digit]]*(int(base)**(0-digit-1))\r\n\treturn newnumber\r\n\t\r\ndef ConvertToBase(number, base):\r\n\tnewnumber = ''\r\n\tif(number == 0):\r\n\t\treturn '0'\r\n\twhile number > 0:\r\n\t\tnewnumber = characters[number%base] + newnumber\r\n\t\tnumber = number//base\r\n\treturn newnumber\r\n\t\r\ndef ConvertToRoman(number):\r\n\tnewnumber = ''\r\n\tfor i in range(4,0,-1):\r\n\t\tcurrentnumber = (number%(10**i) - number%(10**(i-1)))//(10**(i-1))\r\n\t\tif(currentnumber > 0):\r\n\t\t\tif(i==4):\r\n\t\t\t\tnewnumber += 'M'*currentnumber\r\n\t\t\telif(i==3):\r\n\t\t\t\tif(currentnumber == 9):\r\n\t\t\t\t\tnewnumber += 'CM'\r\n\t\t\t\telif(currentnumber>=5):\r\n\t\t\t\t\tnewnumber += 'D' + 'C'*(currentnumber-5)\r\n\t\t\t\telif currentnumber == 4:\r\n\t\t\t\t\tnewnumber += 'CD'\r\n\t\t\t\telse:\r\n\t\t\t\t\tnewnumber += 'C'*currentnumber\r\n\t\t\telif(i==2):\r\n\t\t\t\tif(currentnumber == 9):\r\n\t\t\t\t\tnewnumber += 'XC'\r\n\t\t\t\telif(currentnumber>=5):\r\n\t\t\t\t\tnewnumber += 'L' + 'X'*(currentnumber-5)\r\n\t\t\t\telif currentnumber == 4:\r\n\t\t\t\t\tnewnumber += 'XL'\r\n\t\t\t\telse:\r\n\t\t\t\t\tnewnumber += 'X'*currentnumber\r\n\t\t\telif(i==1):\r\n\t\t\t\tif(currentnumber == 9):\r\n\t\t\t\t\tnewnumber += 'IX'\r\n\t\t\t\telif(currentnumber>=5):\r\n\t\t\t\t\tnewnumber += 'V' + 'I'*(currentnumber-5)\r\n\t\t\t\telif currentnumber == 4:\r\n\t\t\t\t\tnewnumber += 'IV'\r\n\t\t\t\telse:\r\n\t\t\t\t\tnewnumber += 'I'*currentnumber\r\n\treturn newnumber\r\n\t\r\na,b = [x for x in input().split()]\r\nc = input()\r\n\r\nif b == 'R':\r\n\tprint(ConvertToRoman(ConvertToDecimal(c,int(a))))\r\nelse:\r\n\tprint(ConvertToBase(ConvertToDecimal(c,int(a)),int(b)))", "import string\ndigs = string.digits + string.ascii_uppercase\n\ndef int2base(x, base):\n if x < 0:\n sign = -1\n elif x == 0:\n return digs[0]\n else:\n sign = 1\n\n x *= sign\n digits = []\n\n while x:\n digits.append(digs[int(x % base)])\n x = int(x / base)\n\n if sign < 0:\n digits.append('-')\n\n digits.reverse()\n\n return ''.join(digits)\na, b = input().split()\nc = input()\nR = {1:'I', 5:'V', 10:'X', 50:'L', 100:'C', 500:'D', 1000:'M'}\ns = int(c, int(a))\nif b != 'R':\n print(int2base(s, int(b)))\nelse:\n s = int(int2base(s, 10))\n M = s//1000\n s -= 1000 * M\n C = s // 100\n s -= 100 * C\n X = s // 10\n s -= 10 * X\n I = s\n r = ''\n if M:\n r+=M*'M'\n if C:\n if C <= 3: r+=C*'C'\n elif C == 4: r+='CD'\n elif C >= 5 and C < 9: r+='D'+'C'*(C - 5)\n elif C == 9: r+='CM'\n if X:\n if X <= 3: r+=X*'X'\n elif X == 4: r+='XL'\n elif X >= 5 and X < 9: r+='L'+'X'*(X - 5)\n elif X == 9: r+='XC'\n if I:\n if I <= 3: r+=I*'I'\n elif I == 4: r+='IV'\n elif I >= 5 and I < 9: r+='V'+'I'*(I - 5)\n elif I == 9: r+='IX'\n print(r)\n", "system_1, system_2 = input().split()\r\ninteger = int(input(), base = int(system_1))\r\nif system_2 == '10' or integer == 0:\r\n print(integer)\r\n exit(0)\r\ndigits = []\r\nalphabet = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\nif system_2 != 'R':\r\n system_2 = int(system_2)\r\n while integer != 0:\r\n if system_2 < 10:\r\n digits.append(str(integer%system_2))\r\n else:\r\n if integer%system_2 < 10: digits.append(str(integer%system_2))\r\n else: digits.append(alphabet[integer%system_2 - 10])\r\n integer = integer//system_2\r\n print(''.join(digits[::-1]))\r\nelse:\r\n roman = [1000,'M',900,'CM',500,'D',400,'CD',100,'C',90,'XC',50,'L',40,'XL',10,'X',9,'IX',5,'V',4,'IV',1,'I']\r\n ans = \"\"\r\n while integer != 0:\r\n for i in range(len(roman)//2):\r\n if integer>=roman[2*i]:\r\n ans = ans + roman[2*i + 1]\r\n integer = integer - roman[2*i]\r\n break\r\n print(ans)", "digs = [chr(c) for c in range(ord('0'),ord('9')+1)]\n\ndigs += [chr(c) for c in range(ord('A'),ord('Z')+1)]\n\n\n\ndef int2base(x, base):\n\n if x < 0: sign = -1\n\n elif x == 0: return digs[0]\n\n else: sign = 1\n\n x *= sign\n\n digits = []\n\n while x:\n\n digits.append(digs[x % base])\n\n x //= base\n\n if sign < 0:\n\n digits.append('-')\n\n digits.reverse()\n\n return ''.join(digits)\n\n\n\ndef int2roman(x):\n\n ints = (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)\n\n nums = ('M', 'CM', 'D', 'CD','C', 'XC','L','XL','X','IX','V','IV','I')\n\n result = \"\"\n\n for i in range(len(ints)):\n\n count = int(x / ints[i])\n\n result += nums[i] * count\n\n x -= ints[i] * count\n\n return result\n\n\n\nx = input().split()\n\na = int(x[0])\n\nroman = False\n\nb = x[1]\n\nif b[0] == 'R':\n\n roman = True\n\nelse:\n\n b = int(b)\n\n\n\nna = int(input(),a)\n\n\n\nif roman :\n\n print(int2roman(na))\n\nelse:\n\n print(int2base(na,b))\n\n\n\n\n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "a, b = input().strip().split(' ')\r\nc = input()\r\na = int(a)\r\ndef conv(num,b):\r\n convStr = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n if num < b:\r\n return convStr[num]\r\n else:\r\n return conv(num//b,b) + convStr[num % b]\r\n \r\ndef write_roman(num):\r\n val = [\r\n 1000, 900, 500, 400,\r\n 100, 90, 50, 40,\r\n 10, 9, 5, 4,\r\n 1\r\n ]\r\n syb = [\r\n \"M\", \"CM\", \"D\", \"CD\",\r\n \"C\", \"XC\", \"L\", \"XL\",\r\n \"X\", \"IX\", \"V\", \"IV\",\r\n \"I\"\r\n ]\r\n roman_num = ''\r\n i = 0\r\n while num > 0:\r\n for _ in range(num // val[i]):\r\n roman_num += syb[i]\r\n num -= val[i]\r\n i += 1\r\n return roman_num\r\nt = int(c.lower(),a)\r\nif b != 'R':\r\n print(conv(t,int(b)))\r\nelse:\r\n print(write_roman(t)) \r\n", "num_one = [\"\", \"I\", \"II\", \"III\", \"IV\", \"V\", \"VI\", \"VII\", \"VIII\", \"IX\"]\r\nnum_two = [\"\", \"X\", \"XX\", \"XXX\", \"XL\", \"L\", \"LX\", \"LXX\", \"LXXX\", \"XC\"]\r\nnum_three = [\"\", \"C\", \"CC\", \"CCC\", \"CD\", \"D\", \"DC\", \"DCC\", \"DCCC\", \"CM\"]\r\nnum_four = [\"\", \"M\", \"MM\", \"MMM\", \"MMMM\"]\r\n\r\nnumbers = \"0123456789ABCDEFGHIJKLMNOPQ\"\r\n\r\n\r\ndef to_roman(x):\r\n x = int(x)\r\n ans = \"\"\r\n\r\n ans += num_four[x // 1000]\r\n x -= (x // 1000) * 1000\r\n\r\n ans += num_three[x // 100]\r\n x -= (x // 100) * 100\r\n\r\n ans += num_two[x // 10]\r\n x -= (x // 10) * 10\r\n\r\n ans += num_one[x]\r\n x -= x\r\n\r\n return ans\r\n\r\n\r\ndef to_base(x, b):\r\n x = int(x)\r\n ans = \"\"\r\n\r\n while x >= b:\r\n ans += numbers[x % b]\r\n x = x // b\r\n\r\n if x > 0:\r\n ans += numbers[x]\r\n\r\n return ans[::-1]\r\n\r\n\r\ndef to_ten(x, b):\r\n x = str(x)\r\n x = x[::-1]\r\n ans = 0\r\n\r\n for i in range(len(x)):\r\n ans += (b ** i) * numbers.index(x[i])\r\n\r\n return ans\r\n\r\n\r\na, b = input().split()\r\na = int(a)\r\nc = to_ten(input(), a)\r\n\r\nif c == 0:\r\n print(0)\r\nelif b == \"R\":\r\n print(to_roman(c))\r\nelse:\r\n print(to_base(c, int(b)))\r\n" ]

[ "n=int(input())\r\na=list(map(int,input().split()))\r\na+=a\r\ns,f=map(int,input().split())\r\nd=f-s\r\nx=sum(a[:d])\r\nMAX=x\r\nans_time=s\r\ntime=s\r\nfor i in range(d,2*n):\r\n if i-d>=n:\r\n break\r\n x+=a[i]\r\n x-=a[i-d]\r\n time=(time+n-1)%n or n\r\n if MAX<x or (MAX==x and time<ans_time):\r\n MAX=x\r\n ans_time=time\r\nprint(ans_time)", "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\ns, f = map(int, input().split())\r\nc = f - s\r\nu = [0]\r\nfor i in a:\r\n u.append(u[-1] + i)\r\nfor i in a:\r\n u.append(u[-1] + i)\r\nans, m = 0, 0\r\nfor i in range(n):\r\n if m < u[i + c] - u[i]:\r\n m = u[i + c] - u[i]\r\n x = (s - i) % n\r\n if not x:\r\n x = n\r\n ans = x\r\n elif m == u[i + c] - u[i]:\r\n x = (s - i) % n\r\n if not x:\r\n x = n\r\n ans = min(ans, x)\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns,f=map(int,input().split())\r\ns-=1\r\nf-=1\r\nm=10**9\r\nbest_sum=sum(arr[s:f+1])\r\ncur=best_sum\r\nbest_i=0\r\nfor i in range(1,n):\r\n cur+=arr[(s-i)%n]\r\n cur-=arr[(f-i)%n]\r\n if cur>best_sum:\r\n best_sum=cur\r\n best_i=i\r\nprint(best_i+1) ", "n = int(input())\r\na = list(map(int, input().split()))\r\ns, f = list(map(int, input().split()))\r\nmaxi = sum(a[s-1:f-1])\r\ncur = maxi\r\nidx = 0\r\nfor i in range(n):\r\n cur = cur - a[(s-1+i) % n] + a[(f-1+i) % n]\r\n if cur >= maxi:\r\n maxi = cur\r\n idx = i\r\nprint(n - idx)# 1690710377.5274422", "N = 100007\r\nA = [0] * N\r\nn = int(input())\r\nnum = list(map(int, input().split()))\r\ns, f = map(int, input().split())\r\nfor i in range(1, n + 1):\r\n A[i % n] = num[i - 1]\r\nmx = 0\r\na = 0\r\nres = 0\r\nfor i in range(1, n):\r\n l = (s - i + n) % n\r\n r = (f - i + n) % n\r\n mx = mx + A[l] - A[r]\r\n if mx > res:\r\n res = mx\r\n a = i\r\nprint(a + 1)# 1698505354.4515154", "'''\r\n1 2 3 4|5 6 7 8|\r\n'''\r\n\r\ndef f(a,start,end):\r\n\tstart-=1\r\n\tend-=1\r\n\tn=len(a)\r\n\taa=[0]*(2*len(a)+10)\r\n\tfor i in range(len(a)):\r\n\t\taa[n+i]=a[i]\r\n\t\taa[i]=a[i]\r\n\tss=0\r\n\tfor i in range(start,end):\r\n\t\tss+=aa[i]\r\n\tans=max(ss,0)\r\n\tfin=float(\"inf\")\r\n\tcur=1\r\n\ti=start\r\n\tj=end\r\n\twhile j<2*n:\r\n\t\tss-=aa[i]\r\n\t\tss+=aa[j]\r\n\t\ti+=1\r\n\t\tj+=1\r\n\t\tcur-=1\r\n\t\tif cur==0:\r\n\t\t\tcur=n\r\n\t\tif ss>=ans:\r\n\t\t\tfin=min(cur,fin)\r\n\t\t\tans=ss\r\n\treturn fin\r\n'''\r\n2\r\n5072 8422\r\n1 2\r\n\r\n10\r\n7171 2280 6982 9126 9490 2598 569 6744 5754 1855\r\n7 9\r\n\r\n\r\n'''\r\n\r\nn=input()\r\nl=list(map(int,input().strip().split()))\r\nstart,end=map(int,input().strip().split())\r\nprint(f(l,start,end))" ]

[ "n=int(input())\r\nx=0\r\ny=0\r\nz=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if(a>b):\r\n x=x+1\r\n elif(a<b):\r\n y=y+1\r\n elif(a==b):\r\n z=z+1\r\nif(x>y):\r\n print(\"Mishka\")\r\nelif(x<y):\r\n print(\"Chris\")\r\nelif(x==y or z>0):\r\n print(\"Friendship is magic!^^\")", "intGamess = int(input())\r\n\r\nmishkWins = 0\r\nchrWins = 0\r\n\r\nfor i in range(intGamess):\r\n currResult = input().split(\" \")\r\n mishkResult = int(currResult[0])\r\n chrResult = int(currResult[1])\r\n\r\n if(mishkResult > chrResult):\r\n mishkWins += 1\r\n elif(chrResult > mishkResult):\r\n chrWins += 1\r\n\r\nif(mishkWins > chrWins):\r\n print(\"Mishka\")\r\nelif(chrWins > mishkWins):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "# Read the number of game rounds\r\nn = int(input())\r\n\r\n# Initialize counters for Mishka and Chris\r\nmishka_wins = 0\r\nchris_wins = 0\r\n\r\n# Process each round\r\nfor _ in range(n):\r\n # Read the values on dice upper face for Mishka and Chris\r\n mi, ci = map(int, input().split())\r\n # Compare the values and update the counters\r\n if mi > ci:\r\n mishka_wins += 1\r\n elif ci > mi:\r\n chris_wins += 1\r\n\r\n# Determine the result of the game\r\nif mishka_wins > chris_wins:\r\n print(\"Mishka\")\r\nelif chris_wins > mishka_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nmishka_Wins = 0\r\nchris_Wins = 0\r\nfor _ in range(n):\r\n mi, ci = map(int, input().split())\r\n if mi > ci:\r\n mishka_Wins += 1\r\n elif ci > mi:\r\n chris_Wins += 1\r\nif mishka_Wins > chris_Wins:\r\n print(\"Mishka\")\r\nelif chris_Wins > mishka_Wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "q=0\r\nw=0\r\nfor _ in range(int(input())):\r\n z,x=map(int,input().split())\r\n if z>x:\r\n q+=1\r\n elif x>z:\r\n w+=1\r\nif q>w:\r\n print(\"Mishka\")\r\nelif w>q:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nmishka = 0\r\nchris = 0\r\n\r\nfor i in range(n):\r\n mish, chri = map(int,input().split())\r\n if mish > chri:\r\n mishka = mishka + 1\r\n elif chri > mish:\r\n chris = chris + 1\r\n \r\n \r\nif chris == mishka:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n if chris > mishka:\r\n print(\"Chris\")\r\n elif mishka > chris:\r\n print(\"Mishka\")", "#https://codeforces.com/problemset/problem/703/A\r\nt = int(input())\r\nt2 = t\r\nwinM=0\r\nwinC=0\r\ndraw=0\r\nwhile t > 0:\r\n m, c = map(int, input().split())\r\n if (m > c) :\r\n winM += 1\r\n elif (m < c):\r\n winC += 1\r\n elif (m == c):\r\n draw += 1\r\n t -= 1\r\n\r\nif(draw== t2 or winM==winC):\r\n print(\"Friendship is magic!^^\")\r\nelif(winM>winC) :\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n=int(input())\r\ns,s1=0,0\r\nfor i in range(n):\r\n l,m=map(int,input().split())\r\n if l>m:\r\n s+=1\r\n elif l<m:\r\n s1+=1\r\nif s>s1:\r\n print('Mishka')\r\nelif s<s1:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "a = 0\r\ns = 0\r\nfor i in range(int(input())):\r\n ls = [int(s) for s in input().split()]\r\n if ls[0] > ls[1]:\r\n a += 1\r\n elif ls[0] < ls[1]:\r\n s += 1\r\nif a > s:\r\n print('Mishka')\r\nelif s > a:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "a = int(input())\r\nl = []\r\nd = []\r\nm = 0\r\nc = 0\r\nz = 0\r\nfor x in range(0, a):\r\n r = input()\r\n w = r.split()\r\n l.append(w[0])\r\n d.append(w[1])\r\nfor y in range(0, a):\r\n if l[y] > d[y]:\r\n m += 1\r\n elif l[y] < d[y]:\r\n c += 1\r\n else:\r\n z += 1\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n nn=[int(x) for x in input().split()]\r\n if nn[0]>nn[1]:\r\n m+=1\r\n elif nn[1]>nn[0]:\r\n c+=1\r\nif m>c:\r\n print(\"Mishka\")\r\nelif c>m:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\") ", "n=int(input())\r\nsm=0\r\nsc=0\r\nfor i in range(1,n+1):\r\n g=input().split()\r\n if int(g[0])>int(g[1]):\r\n sm+=1\r\n if int(g[0])<int(g[1]):\r\n sc+=1\r\nif sm==sc:\r\n print('Friendship is magic!^^')\r\nif sm>sc:\r\n print('Mishka')\r\nif sm<sc:\r\n print('Chris')\r\n", "n = int(input())\r\nmishkaCounter = 0\r\nchrisCounter = 0\r\nfor i in range(n):\r\n x , y = map(int,input().split())\r\n if x > y:\r\n mishkaCounter += 1\r\n elif y > x:\r\n chrisCounter += 1\r\n\r\nif mishkaCounter > chrisCounter:\r\n print(\"Mishka\")\r\nelif chrisCounter > mishkaCounter:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nm = 0\r\nk = 0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n m+=1\r\n elif a<b:\r\n k+=1\r\nif m>k:\r\n print(\"Mishka\")\r\nelif m<k:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "mishka = int(0)\nchris = int(0)\nfor i in range (int(input())):\n a, b = [int(x) for x in input().split()] \n if (a>b):\n mishka += 1\n elif (a<b):\n chris += 1\nif (chris>mishka):\n print('Chris') \nelif (mishka>chris):\n print('Mishka') \nelse :\n print(\"Friendship is magic!^^\")\n\t \t \t\t \t\t\t\t \t \t\t\t \t\t \t \t", "m,c=0,0\r\nfor _ in range(0,int(input())):\r\n a=list(map(int,input().split(' ')))\r\n if(a[0]>a[1]):\r\n m+=1\r\n elif(a[0]<a[1]):\r\n c+=1\r\nif(m>c):\r\n print(\"Mishka\")\r\nelif(m<c):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "m = 0\r\nfor i in range(int(input())):\r\n x = [int(i) for i in input().split()]\r\n m+=1 if x[0] > x[1] else -1 if x[0] < x[1] else 0\r\nprint(\"Mishka\") if m > 0 else print(\"Chris\") if m<0 else print(\"Friendship is magic!^^\")", "a=0\r\nb=0\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n if(x>y):\r\n a+=1\r\n elif(y>x):\r\n b+=1\r\nif(a==b):\r\n print(\"Friendship is magic!^^\")\r\nelif(a>b):\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\r\nm, c = 0, 0\r\nfor i in range(n):\r\n arr = [int(i) for i in input().split()]\r\n if arr[0] > arr[1]:\r\n m += 1\r\n elif arr[0] < arr[1]:\r\n c += 1\r\nif (m>c):\r\n print(\"Mishka\")\r\nelif(m<c):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nwinM = 0\r\nwinC = 0\r\nfor i in range(n):\r\n m, c = [int(i) for i in input().split()]\r\n if m > c:\r\n winM += 1\r\n elif c > m:\r\n winC += 1\r\nif winC < winM: print(\"Mishka\")\r\nelif winC > winM: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nc = 0\r\nv = 0\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n if a[0] > a[1]:\r\n c+=1\r\n \r\n elif a[0] < a[1]:\r\n v+=1\r\n \r\n \r\nif c > v:\r\n print('Mishka')\r\n\r\nelif c < v:\r\n print('Chris')\r\n \r\nelse:\r\n print('Friendship is magic!^^')\r\n ", "n = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n if x>y:\r\n m = m+1\r\n elif x<y:\r\n c = c+1\r\nif (m>c):\r\n print(\"Mishka\")\r\nelif m<c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nx = []\r\nz = []\r\nfor i in range(n):\r\n M, K = map(int, input().split())\r\n if M > K:\r\n x.append(1)\r\n elif M < K:\r\n z.append(1)\r\nif sum(x) > sum(z):\r\n print(\"Mishka\")\r\nelif sum(x) < sum(z):\r\n print(\"Chris\")\r\nelif sum(x) == sum(z):\r\n print(\"Friendship is magic!^^\")", "p=int(input())\r\nk1=0\r\nk2=0\r\nfor l in range(p):\r\n \r\n m,n=map(int,input().split())\r\n if m>n:\r\n k1 +=1\r\n elif m<n:\r\n k2+=1\r\n else:\r\n pass\r\n\r\nif k1>k2:\r\n print (\"Mishka\")\r\nelif k1<k2:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "def solve():\r\n x = int(input())\r\n m, c = 0, 0\r\n for i in range(x):\r\n a, b = map(int, input().split())\r\n m += a > b\r\n c += b > a\r\n print('Chris' if c > m else 'Mishka' if m > c else 'Friendship is magic!^^')\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\nblist=[]\r\ncount1=0\r\ncount2=0\r\nfor i in range(n):\r\n y=input()\r\n alist=[int(x) for x in y.split()]\r\n if alist[0]>alist[1]:\r\n count1+=1\r\n elif alist[1]>alist[0]:\r\n count2+=1\r\nif count1>count2:\r\n print(\"Mishka\")\r\nelif count2>count1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\nmishka,chris=0 ,0\r\nfor i in range(t):\r\n m,c=map(int,input().split())\r\n if(m>c):\r\n mishka+=1\r\n elif(c>m):\r\n chris+=1\r\n else:\r\n mishka+=1\r\n chris+=1\r\nif(mishka>chris):\r\n print(\"Mishka\")\r\nelif(mishka<chris):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "N = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range (N):\r\n m1,c1 = map(int, input().split())\r\n if (m1>c1):\r\n m += 1\r\n if (m1<c1):\r\n c += 1\r\nif m<c:\r\n print(\"Chris\")\r\nif c<m:\r\n print(\"Mishka\")\r\nif c==m:\r\n print(\"Friendship is magic!^^\")", "import sys\n\ninput = sys.stdin.readline\nprint = sys.stdout.write\n\nn = int(input())\n\nm, c = 0, 0\n\nfor _ in range(n):\n mi, ci = map(int, input().split())\n if mi > ci:\n m += 1\n\n elif mi < ci:\n c += 1\n\n else:\n continue\n\nif m > c:\n print(\"Mishka\")\n\nelif m < c:\n print(\"Chris\")\n\nelse:\n print(\"Friendship is magic!^^\")\n", "m = 0\r\nc = 0\r\n\r\nfor _ in range(int(input())):\r\n x, y = [int(x) for x in input().split()]\r\n if x > y:\r\n m = m + 2\r\n elif x < y:\r\n c = c + 2\r\n elif x == y:\r\n m = m + 1\r\n c = c + 1\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelif m == c:\r\n print(\"Friendship is magic!^^\")", "number = int(input())\r\nmishka = 0\r\nchris = 0\r\nfor i in range(number):\r\n elem = [int(el) for el in input().split(\" \")]\r\n if elem[0] > elem[1]:\r\n mishka += 1\r\n if elem[1] > elem[0]:\r\n chris += 1\r\n else:\r\n chris += 1\r\n mishka += 1\r\nif chris > mishka:\r\n print(\"Chris\")\r\nelif mishka > chris:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\nq=0\r\np=0\r\nfor i in range(a):\r\n a,b=map(int,input().split())\r\n q+=a>b\r\n p+=b>a\r\nif q==p:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('MCihsrhiksa'[q<p::2])", "t=int(input())\r\ncount_mishka=0\r\ncount_chris=0\r\nfor tc in range(t):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n count_mishka+=1\r\n elif a<b:\r\n count_chris+=1\r\nif count_mishka>count_chris:\r\n print(\"Mishka\")\r\nelif count_mishka<count_chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nm , c = 0,0\r\nfor i in range(n):\r\n a = [int(x) for x in input().split()]\r\n if a[0] > a[1]:\r\n m += 1\r\n elif a[1] > a[0]:\r\n c += 1\r\n else:\r\n continue\r\nif m > c:\r\n print(\"Mishka\")\r\nelif c > m:\r\n print(\"Chris\")\r\nelif m == c:\r\n print(\"Friendship is magic!^^\")\r\n\r\n", "n = int(input())\r\nx = y = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n if a > b:\r\n x += 1\r\n elif b >a:\r\n y += 1\r\nif x>y:\r\n print(\"Mishka\")\r\nelif y > x:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\r\nc1=c2=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n c1=c1+1\r\n elif a<b:\r\n c2=c2+1\r\n else:\r\n pass\r\nif c1>c2:\r\n print(\"Mishka\")\r\nelif c1==c2:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "def main():\r\n n = int(input())\r\n sumM = 0\r\n sumC = 0\r\n while(n>0):\r\n m,c = map(int,input().split())\r\n if(m>c):\r\n sumM+=1\r\n elif(m<c):\r\n sumC+=1\r\n n=n-1\r\n if(sumM > sumC):\r\n print(\"Mishka\")\r\n elif(sumM<sumC):\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nsm=0\r\nsc=0\r\nfor i in range(n):\r\n m,c=list(map(int,input().split()))\r\n if m>c:\r\n sm+=1\r\n if c>m:\r\n sc+=1\r\nif sm>sc:\r\n print('Mishka')\r\nif sc>sm:\r\n print('Chris')\r\nif sm==sc:\r\n print('Friendship is magic!^^')\r\n", "\r\nn = int(input())\r\ngames = []\r\nfor i in range(n) : \r\n games.append(list (int(num) for num in input().split())) \r\n\r\n\r\ndef solve():\r\n winner = 0\r\n for i in range(len(games)):\r\n if games[i][0] > games[i][1] :\r\n winner +=1\r\n elif games[i][0] < games[i][1]:\r\n winner -=1 \r\n return winner\r\n \r\ndef print_winner():\r\n winner = solve()\r\n if winner > 0:\r\n print('Mishka')\r\n elif winner < 0: \r\n print('Chris')\r\n else :\r\n print('Friendship is magic!^^')\r\n \r\nprint_winner()", "n= int(input())\r\nkola = 0\r\nkolb = 0\r\nfor i in range(n):\r\n p = input().split()\r\n a = int(p[0])\r\n b = int(p[1])\r\n if a > b:\r\n kola+=1\r\n if b>a:\r\n kolb +=1\r\nif kola == kolb:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n if kola>kolb:\r\n print(\"Mishka\")\r\n else:\r\n print(\"Chris\")", "a=int(input())\r\nn=0\r\nv=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if b>c:\r\n n+=1\r\n elif c>b:\r\n v+=1\r\n \r\nif n>v:\r\n print(\"Mishka\")\r\nelif v>n:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\ncounter = [0,0]\r\n\r\nfor i in range(n):\r\n\r\n [a,b] = list(map(int,input().split(' ')))\r\n \r\n counter[0] += 1 if a > b else 0\r\n counter[1] += 1 if b > a else 0\r\n \r\nprint(\"Mishka\" if counter[0] > counter[1] else (\"Chris\" if counter[0] < counter[1] else \"Friendship is magic!^^\"))", "count_rounds = int(input())\r\nwin_m, win_c = 0, 0\r\nfor i in range(count_rounds):\r\n res_m, res_c = map(int, input().split())\r\n if res_m > res_c:\r\n win_m += 1\r\n elif res_m < res_c:\r\n win_c += 1\r\n else:\r\n continue\r\nif win_m > win_c:\r\n print('Mishka')\r\nelif win_c > win_m:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n \r\n", "# https://codeforces.com/problemset/problem/703/A\r\nnum_cases = int(input())\r\nmishka = 0\r\nchris = 0\r\nfor i in range(num_cases):\r\n a, b = list(map(int, input().split()))\r\n if a > b:\r\n mishka += 1\r\n if a < b:\r\n chris += 1\r\n if a == b:\r\n continue\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif chris > mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\r\ncount1=0\r\ncount2=0\r\nfor i in range(0,n):\r\n a,b=[int(i) for i in input().split()]\r\n if a>b:\r\n count1+=1 \r\n elif b>a:\r\n count2+=1 \r\nif(count1>count2):\r\n print(\"Mishka\")\r\nelif(count1<count2):\r\n print(\"Chris\")\r\nelif(count1==count2):\r\n print(\"Friendship is magic!^^\")\r\n ", "n = int(input())\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(0,n):\r\n n = str(input()).split()\r\n if(n[0]>n[1]):\r\n count1 = count1+1\r\n elif(n[0]<n[1]):\r\n count2 = count2+1\r\n \r\nif (count1>count2):\r\n print(\"Mishka\")\r\nelif(count1<count2):\r\n print(\"Chris\")\r\nelif(count1==count2):\r\n print(\"Friendship is magic!^^\")", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\nt=int(input())\r\nm=c=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n m+=1\r\n elif b>a:\r\n c+=1\r\nif m>c:\r\n print('Mishka')\r\nelif m<c:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "it = int(input())\r\nM = 0\r\nC = 0\r\nfor i in range(it):\r\n inp = input().split()\r\n a = [int(num) for num in inp]\r\n if(a[0] > a[1]):\r\n M+=1\r\n elif(a[0]< a[1]):\r\n C+=1\r\nif(M > C):\r\n print(\"Mishka\")\r\nelif(M < C):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\nans1=0\r\nans2=0\r\nwhile(t!=0):\r\n a,b=map(int,input().split())\r\n if(a>b):\r\n ans1= ans1+1\r\n if(b>a):\r\n ans2= ans2+1\r\n t=t-1\r\nif(ans1>ans2):\r\n print(\"Mishka\")\r\nif(ans2>ans1):\r\n print(\"Chris\")\r\nif(ans1==ans2):\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if x > y:\r\n cnt += 1\r\n elif x < y:\r\n cnt -= 1\r\nif cnt > 0:\r\n print(\"Mishka\")\r\nelif cnt < 0:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\nc1=0\r\nc2=0\r\n\r\nfor i in range(a):\r\n b=list(map(int,input().split()))\r\n\r\n if b[0]>b[1]:\r\n c1+=1\r\n elif b[1]>b[0]:\r\n c2+=1\r\n \r\nif c1>c2 :\r\n print(\"Mishka\")\r\nelif c2>c1 :\r\n print(\"Chris\")\r\nelif c1==c1:\r\n print(\"Friendship is magic!^^\")", "result = []\r\nn = int(input())\r\nfor i in range(n):\r\n m, c = list(map(int,input().split(\" \")))\r\n if(m>c):\r\n result.append(\"M\")\r\n elif(c>m):\r\n result.append(\"C\")\r\n\r\nif(result.count(\"M\") > result.count(\"C\")):\r\n print(\"Mishka\")\r\nelif(result.count(\"C\") == result.count(\"M\")):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")\r\n", "mr=0\r\ncr=0\r\nfor _ in range(int(input())):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n mr+=1\r\n if c>m:\r\n cr+=1\r\nif mr>cr:\r\n print('Mishka')\r\nelif mr<cr:\r\n print('Chris')\r\nelse :\r\n print('Friendship is magic!^^')", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=int(input())\nm1,c1=0,0\nfor i in range(n):\n m,c=map(int,input().split())\n if m > c:\n m1 += 1\n elif c > m:\n c1 += 1\nif m1 > c1:\n print(\"Mishka\")\nelif c1 > m1:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n ", "n=int(input())\r\nm=0\r\nk=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n m+=1\r\n elif b>a:\r\n k+=1\r\nif m>k:\r\n print('Mishka')\r\nelif k>m: \r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "c1,c2 = 0,0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if(a>b): c1+=1\r\n elif(a<b): c2+=1\r\nif c1==c2:\r\n print(\"Friendship is magic!^^\")\r\nelif c1>c2:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")\r\n ", "n=int(input())\r\nv1=0\r\nv2=0\r\nfor i in range(n):\r\n m,c=list(map(int,input().split()))\r\n if m>c:\r\n v1+=1\r\n elif c>m:\r\n v2+=1\r\n else:\r\n continue\r\nif v1>v2:\r\n print(\"Mishka\")\r\nelif v1<v2:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "\r\nn = int(input()) # количество раундов\r\nm_win = 0 # количество побед Мишки\r\nc_win = 0 # количество побед Криса\r\n\r\nfor i in range(n):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n m_win += 1\r\n elif c > m:\r\n c_win += 1\r\n\r\nif m_win > c_win:\r\n print(\"Mishka\")\r\nelif c_win > m_win:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "from decimal import *\r\nfrom gc import *\r\nfrom heapq import *\r\nfrom math import *\r\nfrom random import *\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom types import *\r\ndef isPrime(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\ndef lcm(a, b): return (a * b) // gcd(a, b)\r\n\r\ndef mip(): return map(int, input().split())\r\n\r\ndef lmpi(): return list(map(int, input().split()))\r\n\r\ndef lmps(): return list(map(str, input().split()))\r\n\r\ndef ipn(): return int(input())\r\n\r\n# ******************************************************#\r\n# ******************************************************#\r\n# **************** code starts here ********************#\r\n# ******************************************************#\r\n# ******************************************************#\r\nmish=chish=0\r\nfor _ in range(ipn()):\r\n a,b=mip()\r\n if a==b:\r\n mish+=1\r\n chish+=1\r\n elif a<b:\r\n chish+=1\r\n else:\r\n mish+=1\r\nif mish>chish:print('Mishka')\r\nelif mish==chish:print('Friendship is magic!^^')\r\nelse:\r\n print('Chris')", "a = int(input())\r\n\r\nq = 0\r\nc = 0\r\n\r\nfor i in range(a):\r\n n , m = map(int , input().split())\r\n \r\n if n > m:\r\n q += 1\r\n elif n < m:\r\n c += 1\r\n\r\nif q > c:\r\n print('Mishka')\r\nif q < c:\r\n print('Chris')\r\nif q == c:\r\n print('Friendship is magic!^^')", "t=int(input())\r\nc_count = 0\r\nm_count = 0\r\nfor i in range(t):\r\n m,c = list(map(int,input().split()))\r\n if m>c:\r\n m_count+=1\r\n elif m<c:\r\n c_count+=1\r\n else : \r\n c_count+=1\r\n m_count+=1\r\nif m_count > c_count:\r\n print(\"Mishka\")\r\nelif m_count < c_count:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "m = 0\nc = 0\nfor i in range(int(input())):\n s = [int(i) for i in input().split()]\n if s[0] > s[1]:\n m += 1\n elif s[0] < s[1]:\n c += 1\nif m > c:\n print('Mishka')\nelif m < c:\n print('Chris')\nelse:\n print('Friendship is magic!^^')", "n=int(input())\r\nmish=0\r\nchris=0\r\nfor _ in range(n):\r\n l=list(map(int,input().strip().split()))\r\n if l[0]>l[1]:\r\n mish=mish+1\r\n elif l[1]>l[0]:\r\n chris=chris+1\r\nif mish==chris:\r\n print(\"Friendship is magic!^^\")\r\nelif mish>chris:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "# n: number of rounds\r\n# Dice have 6 sides.\r\n# highest number wins.\r\n# if tie, nobody wins any points.\r\n# The winner is the one who has the highest total of wins out of all the rounds played. It's like a best-of.\r\n# There doesn't have to be a winner, draws are allowed.\r\n\r\n# M's dice are the first number.\r\n# C's dice are the second number.\r\n\r\n# If Mishka wins, print Mishka\r\n# If Chris wins, print Chris.\r\n# If the games result in draw, Friendship is magic!^^\r\n\r\n# To solve we can iterate over each game and determine a win, a loss, or a draw.\r\n\r\n# The winner will have more wins than the opponent.\r\n\r\nrounds = int(input())\r\n\r\nmWins = 0\r\ncWins = 0\r\ndraws = 0\r\n\r\nfor x in range(rounds):\r\n\r\n rolls = [int(i) for i in input().split()]\r\n \r\n mRoll = rolls[0]\r\n cRoll = rolls[1]\r\n \r\n if mRoll > cRoll:\r\n mWins += 1\r\n elif mRoll < cRoll:\r\n cWins += 1\r\n else:\r\n draws += 1\r\n\r\nif mWins > cWins:\r\n output = \"Mishka\"\r\nelif mWins < cWins:\r\n output = \"Chris\"\r\nelse:\r\n output = \"Friendship is magic!^^\"\r\n\r\nprint(output)\r\n \r\n \r\n ", "t=int(input())\r\nx=0\r\ny=0\r\nwhile t>0:\r\n a,b=map(int,input().split())\r\n if a>b:\r\n x+=1\r\n if b>a:\r\n y+=1\r\n \r\n t-=1\r\nif x>y:\r\n print(\"Mishka\")\r\nelif y>x:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "n=int(input())\r\na=0\r\nb=0\r\nfor i in range(n):\r\n m1,c1=input().split()\r\n m=int(m1)\r\n c=int(c1)\r\n if m>c:\r\n a+=1\r\n elif m<c:\r\n b+=1\r\n else:\r\n continue\r\nif a>b:\r\n print(\"Mishka\")\r\nelif a<b:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nm, c = 0, 0\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n if a>b:\r\n m+=1\r\n elif b>a:\r\n c+=1\r\nif m>c:\r\n print('Mishka')\r\nelif m==c:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('Chris')", "n = int(input())\r\nmishka = 0\r\nchris = 0\r\nfor _ in range(n):\r\n a, b = map(int,input().split())\r\n if a > b:\r\n mishka += 1\r\n elif a < b:\r\n chris += 1\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif chris > mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n if(a>b):\r\n m=m+1\r\n elif(a<b):\r\n c=c+1\r\nif(m>c):\r\n print(\"Mishka\")\r\nelif(c>m):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "k1=0;k2=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:k1+=1\r\n elif b>a:k2+=1 \r\nif k1>k2:print(\"Mishka\")\r\nelif k2>k1:print(\"Chris\")\r\nelse:print(\"Friendship is magic!^^\")", "#Представте себя в яблонинивем саду лежашем на траве, слева обдувает прохладный ветерок, а ты в ожидании своего нового вертолёта# \r\nn=int(input())\r\nk=0\r\nl=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if a[0]>a[1]:\r\n k=k+1\r\n elif a[0]<a[1]:\r\n l=l+1 \r\nif k>l:\r\n print(\"Mishka\")\r\nelif k<l:\r\n print(\"Chris\") \r\nelse:\r\n print(\"Friendship is magic!^^\") ", "x = 0\r\ny = 0\r\nfor _ in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a > b:\r\n x += 1\r\n elif b > a:\r\n y += 1\r\nif x == y:\r\n print(\"Friendship is magic!^^\")\r\nelif x > y:\r\n print(\"Mishka\")\r\nelif y > x:\r\n print(\"Chris\")", "n=int(input())\r\na=0\r\nb=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m>c:a=a+1\r\n elif m<c:b=b+1\r\nif a>b:print(\"Mishka\")\r\nelif a<b: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nmr = 0\r\ncr = 0\r\nwhile(n):\r\n n -= 1\r\n mi, ci = map(int, input().split())\r\n if mi > ci: mr += 1\r\n elif mi < ci: cr += 1\r\nif mr > cr: print(\"Mishka\")\r\nelif mr < cr: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")", "n = int(input())\r\ncm=0\r\ncc=0\r\nfor i in range(0,n):\r\n m,c = map(int, input().split())\r\n if m >c :\r\n cm= cm+1\r\n i +=1 \r\n elif m < c:\r\n cc +=1\r\n i+=1\r\n \r\nif cm > cc:\r\n print(\"Mishka\")\r\nelif cc >cm:\r\n print (\"Chris\")\r\nelse :\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\nck=0\r\nmk=0\r\nfor x in range(t):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n mk+=1\r\n elif c>m:\r\n ck+=1\r\n else:\r\n ck+=0\r\n mk+=0\r\nif ck>mk:\r\n print('Chris')\r\nelif mk>ck:\r\n print('Mishka')\r\nelse:\r\n print('Friendship is magic!^^')\r\n ", "a, Mishka, Chris = int(input()), 0, 0\r\nfor i in range(0, a):\r\n b = input()\r\n b = b.split()\r\n c = int(b[1])\r\n b = int(b[0])\r\n if b > c:\r\n Mishka += 1\r\n elif b < c:\r\n Chris += 1\r\n\r\nif Mishka == Chris:\r\n print(\"Friendship is magic!^^\")\r\nelif Mishka > Chris:\r\n print(\"Mishka\")\r\nelif Mishka < Chris:\r\n print(\"Chris\")", "a = int(input())\n\n\ncount = 0\n\ntotal = 0\nwhile count != a:\n i,j = map(int, input().split())\n if i > j:\n total += 1\n if j > i:\n total -= 1\n count += 1\n\nif total > 0:\n print('Mishka')\nelif total < 0:\n print('Chris')\nelse:\n print('Friendship is magic!^^')", "# import math\r\n# count = 0\r\n# t = int(input())\r\n# while t > 0:\r\n# n = int(input())\r\n# a = []\r\n \r\n# a.append([int(i) for i in input()])\r\n# a.append([int(i) for i in input()])\r\n# st = set()\r\n# count = 0\r\n# for i in range(n):\r\n \r\n# if a[1][i] == 1:\r\n \r\n# if (i-1)>=0 and a[0][i-1] == 1 and (0,i-1) not in st:\r\n# count += 1\r\n# st.add((0,i-1))\r\n# elif a[0][i] == 0 and (0,i) not in st:\r\n# count += 1\r\n# st.add((0,i))\r\n# elif i+1 < n and a[0][i+1] == 1 and (0,i+1) not in st:\r\n# count += 1\r\n# st.add((0,i+1))\r\n# print(count) \r\n# t -= 1\r\n\r\n\r\nn = int(input())\r\nres = 0\r\nwhile n > 0:\r\n \r\n a,b = input().split()\r\n a,b = int(a), int(b)\r\n \r\n if a > b:\r\n res += 1\r\n elif a < b:\r\n res -= 1\r\n \r\n n -= 1\r\n\r\nif res == 0:\r\n print(\"Friendship is magic!^^\")\r\nelif res > 0:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "t = int(input())\r\nm = 0\r\nc = 0\r\nwhile t>0:\r\n x,y = [int(i) for i in input().split()]\r\n if(x>y):\r\n m+=1\r\n elif(x<y):\r\n c+=1\r\n t-=1\r\nif(m>c):\r\n print(\"Mishka\\n\\n\")\r\nelif(m<c):\r\n print(\"Chris\\n\\n\")\r\nelse:\r\n print(\"Friendship is magic!^^\\n\\n\")", "n = int (input ())\r\nx = 0 \r\ny = 0 \r\nfor i in range(n):\r\n h = list(map(int , input().split()))\r\n if h[1] > h[0]:\r\n x += 1 \r\n elif h[1] < h[0]:\r\n y += 1 \r\nif x < y : \r\n print(\"Mishka\")\r\nelif x > y :\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "def determine_winner(rounds):\n mishka_score = 0\n chris_score = 0\n\n for m, c in rounds:\n if m > c:\n mishka_score += 1\n elif m < c:\n chris_score += 1\n\n if mishka_score > chris_score:\n return \"Mishka\"\n elif mishka_score < chris_score:\n return \"Chris\"\n else:\n return \"Friendship is magic!^^\"\n\n\nn = int(input())\n\nrounds = []\nfor _ in range(n):\n m, c = map(int, input().split())\n rounds.append((m, c))\n\nresult = determine_winner(rounds)\nprint(result)\n \t\t\t\t\t\t \t\t \t \t \t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 31 16:25:39 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\nx,y=0,0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n x=x+1 if m>c else x\r\n y=y+1 if m<c else y\r\n \r\nif x>y:\r\n print(\"Mishka\")\r\nelif x<y:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "# Read the number of game rounds\r\nn = int(input())\r\n\r\n# Initialize counters for Mishka and Chris\r\nmishka_wins = 0\r\nchris_wins = 0\r\n\r\n# Iterate through each round\r\nfor _ in range(n):\r\n # Read the results of the round\r\n m, c = map(int, input().split())\r\n\r\n # Update the counters\r\n if m > c:\r\n mishka_wins += 1\r\n elif c > m:\r\n chris_wins += 1\r\n\r\n# Determine the winner or if it's a draw\r\nif mishka_wins > chris_wins:\r\n print(\"Mishka\")\r\nelif chris_wins > mishka_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "\r\nx = int(input())\r\nj = 0\r\nk = 0\r\nfor i in range(x):\r\n\ta,b = map(int,input().split())\r\n\tif a>b:\r\n\t\tj = j + 1\r\n\tif b>a:\r\n\t\tk = k + 1\r\nif j>k:\r\n\tprint(\"Mishka\")\r\nelif k>j:\r\n\tprint(\"Chris\")\r\nelse:\r\n\tprint(\"Friendship is magic!^^\")", "count_rounds = int(input())\r\nMishka = 0\r\nChris = 0\r\nresult = ''\r\nChris_wins = 0\r\nMishka_wins = 0\r\nfor i in range(count_rounds):\r\n result = input()\r\n if int(result[0]) < int(result[2]):\r\n Chris_wins += 1\r\n elif int(result[0]) == int(result[2]):\r\n continue\r\n else:\r\n Mishka_wins += 1\r\nif Mishka_wins == Chris_wins:\r\n print(\"Friendship is magic!^^\")\r\nelif Mishka_wins > Chris_wins:\r\n print('Mishka')\r\nelse:\r\n print('Chris')\r\n \r\n", "t = int(input())\r\nm = 0\r\nc = 0\r\nwhile t > 0:\r\n x,y = map(int,input().split())\r\n if x == y:\r\n pass\r\n elif x > y:\r\n m += 1\r\n else:\r\n c += 1\r\n t -= 1\r\nif m == c:\r\n print(\"Friendship is magic!^^\")\r\nelif m > c:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "cm, ck = 0, 0\r\nfor _ in range(int(input())):\r\n vm, vk = map(int, input().split())\r\n if vm > vk:\r\n cm += 1\r\n else:\r\n ck += 1 if vk > vm else 0\r\nprint(\"Mishka\" if cm > ck else (\"Chris\" if ck > cm else \"Friendship is magic!^^\"))", "games = int(input())\nmishka, chris = 0, 0\nfor i in range(games):\n\tm, c = map(int, input().split())\n\tif m > c: mishka += 1\n\tif m < c: chris += 1\nif mishka > chris: print('Mishka')\nelif mishka < chris: print('Chris')\nelse: print('Friendship is magic!^^')\n \t\t\t\t\t\t\t \t \t\t \t \t\t \t \t\t\t\t", "mp = 0\r\nfor ti in range(int(input())):\r\n m, c = map(int, input().split())\r\n if m > c: mp += 1\r\n elif c > m: mp -= 1\r\nif mp > 0: print('Mishka')\r\nelif mp < 0: print('Chris')\r\nelse: print('Friendship is magic!^^')\r\n", "import sys\r\ns = sys.stdin.read()\r\nm = s.split(\"\\n\")\r\nm.pop()\r\nm.pop(0)\r\n\r\nmishka = 0\r\nchris = 0\r\n\r\nfor item in m:\r\n n = item.split(\" \")\r\n if int(n[0]) > int(n[1]):\r\n mishka = mishka + 1\r\n elif int(n[0]) == int(n[1]):\r\n mishka = mishka + .5\r\n chris = chris + .5\r\n elif int(n[0]) < int(n[1]):\r\n chris = chris + 1\r\n\r\nif mishka > chris:\r\n print(\"Mishka\")\r\n\r\nelif mishka < chris:\r\n print(\"Chris\")\r\n \r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "ms = 0\r\ncs = 0\r\nfor _ in range(int(input())):\r\n m, c = map(int, input().split())\r\n if m < c:\r\n cs += 1\r\n elif m > c:\r\n ms += 1\r\n else:\r\n continue\r\n\r\nif ms > cs:\r\n print(\"Mishka\")\r\nelif cs > ms:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "m = 0\r\nc = 0\r\nfor n in range(int(input())):\r\n a, b= map(int, input().split())\r\n if(a>b):\r\n m += 1\r\n elif(b>a):\r\n c += 1\r\nif(m>c):\r\n print(\"Mishka\")\r\nelif(c>m):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\ns=0\nd=0\nfor i in range(n):\n a,b=map(int,input().split())\n if a>b:\n s+=1\n elif a<b:\n d+=1\nif s>d:\n print('Mishka')\nelif s<d:\n print('Chris')\nelse:\n print('Friendship is magic!^^')\n \t\t \t \t \t\t \t \t\t\t\t \t\t\t\t \t", "n = int(input())\nm2 = 0\nc2 = 0\nfor i in range(n):\n m, c = map(int, input().split())\n if m > c:\n m2+=1\n elif c > m:\n c2+=1\n\nif m2 > c2:\n print(\"Mishka\")\nelif c2 > m2:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\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\nMishka = 0\r\nChris = 0\r\nfor i in range(a):\r\n m, c = map(int, input().split())\r\n if m>c:\r\n Mishka += 1\r\n elif c>m:\r\n Chris +=1\r\n\r\nif Mishka == Chris:\r\n print('Friendship is magic!^^')\r\nelif Mishka > Chris:\r\n print('Mishka')\r\nelif Chris> Mishka:\r\n print('Chris')", "n=int(input())\r\nMishka=0\r\nChris=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n Mishka=Mishka+1\r\n elif a<b:\r\n Chris=Chris+1\r\nif Mishka>Chris:\r\n print('Mishka')\r\nelif Chris>Mishka:\r\n print('Chris')\r\nelif Mishka==Chris:\r\n print('Friendship is magic!^^')", "def Mishka_and_Game(mishka, chris):\r\n if mishka > chris :\r\n return 1,0\r\n elif chris > mishka:\r\n return 0,1\r\n else :\r\n return 0,0\r\n \r\nrounds =int(input())\r\nmishka_c, chris_c = 0,0\r\n\r\nfor i in range(rounds):\r\n mishka, chris = map(int, input().split())\r\n m , c = Mishka_and_Game(mishka, chris)\r\n mishka_c+=m\r\n chris_c +=c\r\n \r\nif mishka_c > chris_c :\r\n print('Mishka')\r\nelif mishka_c < chris_c :\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "res = 0\r\nfor _ in range(int(input())):\r\n a = [int(i) for i in input().split()]\r\n if a[0] > a[1]:\r\n res += 1\r\n elif a[0] < a[1]:\r\n res -= 1\r\nif res > 0:\r\n print('Mishka')\r\nelif res < 0:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^ ')", "numofgames=int(input())\r\nm1=0\r\nc1=0\r\nfor i in range(numofgames):\r\n mishka,chris=map(int,input().split())\r\n if mishka > chris:\r\n m1+=1\r\n elif mishka < chris:\r\n c1+=1\r\n \r\nif m1 == c1:\r\n print(\"Friendship is magic!^^\")\r\nelif m1 < c1 :\r\n print (\"Chris\")\r\nelif m1 > c1 :\r\n print(\"Mishka\")", "t = int(input())\r\nm = 0 \r\nc = 0\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n if a<b:\r\n c = c+1 \r\n elif a>b:\r\n m = m+1 \r\nif m<c:\r\n print(\"Chris\")\r\nelif m>c:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "\"\"\"\nA. Mishka and Game: implementation\n\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nMishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates.\nOnce in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game.\nRules of the game are very simple: at first number of rounds n is defined.\nIn every round each of the players throws a cubical dice with distinct numbers from 1 to 6 written on its faces.\nPlayer, whose value after throwing the dice is greater, wins the round. In case if player dice values are equal, no one of them is a winner.\nIn average, player, who won most of the rounds, is the winner of the game. In case if two players won the same number of rounds, the result of the game is draw.\nMishka is still very little and can't count wins and losses, so she asked you to watch their game and determine its result. Please help her!\n\nInput\nThe first line of the input contains single integer n n (1 ≤ n ≤ 100) — the number of game rounds.\nThe next n lines contains rounds description. i-th of them contains pair of integers mi and ci (1 ≤ mi, ci ≤ 6) — values on dice upper face after Mishka's and Chris' throws in i-th round respectively.\n\nOutput\nIf Mishka is the winner of the game, print \"Mishka\" (without quotes) in the only line.\nIf Chris is the winner of the game, print \"Chris\" (without quotes) in the only line.\nIf the result of the game is draw, print \"Friendship is magic!^^\" (without quotes) in the only line.\n\"\"\"\n\ndef mishka_and_game():\n n = int(input())\n m = 0\n c = 0\n for i in range(n):\n mi, ch = map(int, input().split(' '))\n if mi > ch:\n m += 1\n elif mi < ch:\n c += 1\n\n if m > c:\n print('Mishka')\n elif m < c:\n print('Chris')\n else:\n print('Friendship is magic!^^')\n\nif __name__ == '__main__':\n mishka_and_game()", "def solve(): \r\n m_cnt, c_cnt = 0, 0 \r\n n = int(input()) \r\n \r\n for _ in range(n): \r\n a,b = map(int, input().split())\r\n if a > b: \r\n m_cnt += 1\r\n elif b > a: \r\n c_cnt += 1\r\n \r\n if m_cnt > c_cnt: print(\"Mishka\")\r\n elif c_cnt > m_cnt: print(\"Chris\")\r\n else: print(\"Friendship is magic!^^\")\r\n\r\nsolve()", "m1 = 0\r\nc1 = 0\r\nfor _ in range(int(input())) :\r\n m ,c = map(int,input().split())\r\n if m > c :\r\n m1+=1\r\n elif c > m :\r\n c1 +=1\r\n else :\r\n continue\r\nif m1 > c1 :\r\n print(\"Mishka\")\r\nelif c1 > m1 :\r\n print(\"Chris\") \r\nelse :\r\n print(\"Friendship is magic!^^\") \r\n ", "#703A\r\nn=int(input())\r\nc=0\r\nc2=0\r\nfor i in range(n):\r\n m,n=(map(int,input().split()))\r\n if m>n:\r\n c+=1\r\n elif m<n:\r\n c2+=1\r\n else:\r\n continue\r\nif c>c2:\r\n print(\"Mishka\")\r\nelif c==c2:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")\r\n", "n = int(input())\r\ncm = 0\r\ncc= 0\r\nce = 0\r\nfor i in range(n):\r\n a,b = [int(x) for x in input().split()]\r\n if a>b:\r\n cm+=1\r\n elif b>a:\r\n cc +=1\r\n else:\r\n cc+=1\r\n cm+=1\r\n\r\nif cm>cc:\r\n print(\"Mishka\")\r\nelif cc>cm:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n\r\n\r\n\r\n", "n = int(input())\r\nx, y = 0, 0\r\n\r\nfor i in range(n):\r\n a, b = input().split()\r\n if a == b:\r\n pass\r\n elif a > b:\r\n x+=1\r\n else:\r\n y+=1\r\nif x == y:\r\n print(\"Friendship is magic!^^\")\r\nelif x > y:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")\r\n", "c = 0\nm = 0\nfor _ in range(int(input())):\n a,b = map(int, input().split())\n if a>b:\n m+=1\n elif a<b:\n c+=1\nif m>c:\n print('Mishka')\nelif m<c:print('Chris')\nelse:print('Friendship is magic!^^')", "n = int(input())\r\nm = 0\r\nc = 0\r\n\r\nfor x in range(n):\r\n temp = input().split()\r\n temp = [int(i) for i in temp]\r\n i, j = temp\r\n if i > j:\r\n m += 1\r\n if j > i:\r\n c += 1\r\n\r\nif m > c:\r\n print('Mishka')\r\nelif c > m:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n \r\n ", "t = int(input())\nfirst = 0\nsecond = 0\nfor ii in range(t):\n a, b = input().split()\n a = int(a)\n b = int(b)\n if a > b:\n first += 1\n if b > a:\n second += 1\n \nif first > second:\n print(\"Mishka\")\nelif second > first:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\t \t \t \t\t\t\t\t\t\t\t \t\t\t \t \t \t \t \t", "t = int(input())\r\nmishka = 0\r\nchris = 0\r\nwhile(t):\r\n a,b = list(map(int, input().split()))\r\n if a>b:\r\n mishka = mishka+1\r\n if b>a:\r\n chris = chris+1\r\n t = t - 1\r\nif mishka>chris:\r\n print(\"Mishka\")\r\nif chris>mishka:\r\n print(\"Chris\")\r\nif chris==mishka:\r\n print(\"Friendship is magic!^^\")", "def main():\r\n \r\n cnt = 0\r\n for s in [*open(0)][1:]:\r\n a=[*map(int,s.split())]\r\n if a[0] > a[1]:\r\n cnt += 1\r\n if a[0] < a[1]:\r\n cnt -= 1\r\n if cnt > 0:\r\n print(\"Mishka\")\r\n elif cnt < 0:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")\r\n \r\n \r\n\r\nmain()", "n = int(input())\nnum1=0\nnum2=0\nfor i in range(n):\n m, c = input().split()\n m = int(m)\n c = int(c)\n if m<c:\n num1+=1\n if c<m:\n num2+=1\nif num1<num2:\n print(\"Mishka\")\nelif num2<num1:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n \t \t\t \t\t \t\t\t \t \t\t \t\t\t\t", "c1=c2=0\r\nfor i in range(int(input())):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n c1+=1\r\n if c>m:\r\n c2+=1\r\nprint([['Chris','Mishka'][c1>c2],'Friendship is magic!^^'][c1==c2])", "n=int(input())\r\nmc=0\r\ncc=0\r\nfor i in range(n):\r\n m,c=[int(x) for x in input().split()]\r\n if m>c:\r\n mc+=1\r\n elif c>m:\r\n cc+=1\r\n\r\nif cc>mc:\r\n print(\"Chris\")\r\n\r\nelif cc<mc:\r\n print(\"Mishka\")\r\n\r\nelif cc==mc:\r\n print(\"Friendship is magic!^^\" )\r\n", "import math\r\nfrom sys import stdin, stdout\r\n\r\nmishka_point = 0\r\nchris_point = 0\r\nfor i in range(0, int(input()), 1):\r\n m, c = [int(x) for x in stdin.readline().split()]\r\n\r\n if m > c:\r\n mishka_point += 1\r\n if c > m:\r\n chris_point +=1\r\nif mishka_point > chris_point:\r\n print('Mishka')\r\nelif chris_point > mishka_point:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "a= int(input())\r\nm=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if b>c: \r\n m+=1\r\n elif c>b:\r\n m-=1\r\nif m>0:\r\n print(\"Mishka\")\r\nelif m<0:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\") \r\n ", "n = int(input())\r\ncount_m, count_k = 0, 0\r\nfor i in range(n):\r\n k_m, k_k = map(int, input().split())\r\n if k_m > k_k:\r\n count_m += 1\r\n elif k_m < k_k:\r\n count_k += 1\r\n else:\r\n count_m += 1\r\n count_k += 1\r\nif count_m > count_k:\r\n print(\"Mishka\")\r\nelif count_m == count_k:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "if __name__ == \"__main__\":\r\n rounds = int(input())\r\n cMishka = 0\r\n cChris = 0\r\n for i in range(rounds):\r\n a, b = map(int, input().split(\" \"))\r\n if (a>b):\r\n cMishka += 1\r\n if (b>a):\r\n cChris += 1\r\n if cMishka > cChris:\r\n print(\"Mishka\")\r\n elif cMishka < cChris:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")\r\n", "n= int(input())\r\nmishkac= chrisc = 0\r\nfor i in range(n):\r\n mishka, chris = map(int, input().split())\r\n if mishka > chris:\r\n mishkac += 1\r\n elif chris > mishka:\r\n chrisc+= 1\r\nif mishkac> chrisc:\r\n print(\"Mishka\")\r\nelif chrisc> mishkac:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nm = c = 0\r\nfor i in range(0,n):\r\n x, y= map(int,input().split())\r\n if(y>x):\r\n c = c + 1\r\n elif(x>y):\r\n m = m + 1\r\nif(c>m):\r\n print(\"Chris\")\r\nelif(m>c):\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "mi = ch = 0\r\nfor _ in range(int(input())):\r\n m, c = map(int, input().split())\r\n mi += m > c\r\n ch += m < c\r\nprint('Mishka' if mi > ch else 'Chris' if ch > mi else 'Friendship is magic!^^')", "t=int(input())\r\ncount=0\r\nflag=0\r\nc=0\r\nwhile(t!=0):\r\n X,Y=map(int,input().split())\r\n if(X>Y):\r\n flag=flag+1\r\n elif(X<Y):\r\n count=count+1\r\n else:\r\n c=c+1\r\n\r\n t=t-1\r\nif(flag>count):\r\n print(\"Mishka\")\r\nelif(flag<count):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nc = 0\r\nm = 0\r\nfor i in range (n):\r\n a, b = [int(x) for x in input().split()]\r\n if (a>b):\r\n m += 1\r\n if (b>a):\r\n c += 1\r\nif (m > c):\r\n print(\"Mishka\")\r\nif (c>m):\r\n print(\"Chris\")\r\nif (c == m):\r\n print(\"Friendship is magic!^^\")", "c=0\r\nb=0\r\nx=int(input())\r\nfor i in range(x):\r\n a=list(map(int,input().split()))\r\n \r\n if a[0]>a[1] :\r\n c+=1\r\n elif a[1]>a[0]:\r\n b+=1\r\nif c==b:\r\n print(\"Friendship is magic!^^\")\r\nelif c>b:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\r\nmishka_wins = 0\r\nchris_wins = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n mishka_wins += 1\r\n elif b > a:\r\n chris_wins += 1\r\nif mishka_wins > chris_wins:\r\n print(\"Mishka\")\r\nelif chris_wins > mishka_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "N = int(input())\r\nmishka_cnt = 0\r\nchris_cnt = 0\r\n\r\nfor _ in range(N):\r\n m, c = map(int, input().split())\r\n\r\n if m > c:\r\n mishka_cnt += 1\r\n elif c > m:\r\n chris_cnt += 1\r\n\r\nif mishka_cnt > chris_cnt:\r\n print(\"Mishka\")\r\nelif chris_cnt > mishka_cnt:\r\n print(\"Chris\")\r\nelse: \r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nl1 = []\r\ncnt1 = cnt2 = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l1.append((a, b))\r\nfor i in l1:\r\n if i[0] > i[1]:\r\n cnt1 += 1\r\n elif i[0] < i[1]:\r\n cnt2 += 1\r\nif cnt1 > cnt2:\r\n print(\"Mishka\")\r\nelif cnt1 < cnt2:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "m=0\r\nc=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if(a > b):\r\n m = m+1 \r\n elif a==b:\r\n continue\r\n else:\r\n c = c+1 \r\nif(m > c):\r\n print(\"Mishka\")\r\nelif(m<c):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "num = int(input())\r\nMishka = 0\r\nChris = 0\r\nfor i in range(num):\r\n a,b = map(int, input().split())\r\n if a>b:\r\n Mishka += 1\r\n elif b>a:\r\n Chris += 1\r\nif Mishka > Chris:\r\n print(\"Mishka\")\r\nelif Chris > Mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\ns1=0\r\ns2=0\r\nfor i in range (n):\r\n\tm,c=map(int,input().split())\r\n\tif m>c :\r\n\t\ts1+=1\r\n\tif m<c :\r\n\t\ts2+=1\r\nif s1>s2 :\r\n\tprint(\"Mishka\")\r\nelif s1<s2 :\r\n\tprint(\"Chris\")\r\nelse : \r\n\tprint (\"Friendship is magic!^^\")", "n = int(input())\r\nmishka = []\r\nchris = []\r\ncount_m = 0\r\ncount_c = 0\r\nfor i in range(n):\r\n a, n = map(int, input().split(\" \"))\r\n if a > n:\r\n count_m += 1\r\n elif a < n:\r\n count_c += 1\r\nif count_m>count_c:\r\n print('Mishka')\r\nelif count_c>count_m:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "nigg = int(input())\r\nm = 0\r\nc= 0\r\nfor i in range(nigg):\r\n n,b = list(map(int, input().split()))\r\n if n>b:\r\n m+= 1\r\n elif b>n:\r\n c+= 1\r\nif m>c:\r\n print(\"Mishka\")\r\nelif c > m:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "# for i in range(1, 10):\r\n# print(i, i**2)\r\n\r\n\r\n# k = 1\r\n# for i in range(1, n + 1):\r\n# k *= i\r\n# print(k)\r\n\r\n\r\n# n = int(input())\r\n# for i in range(n):\r\n# print('hello')\r\n\r\n# from random import randint\r\n# s = 0\r\n# n = int(input())\r\n# for i in range(n):\r\n# a = randint(1, 10)\r\n# s += a\r\n# print(a, end=' ')\r\n# print()\r\n# print(s)\r\n\r\n# for i in range(1, 11):\r\n# print(2**i)\r\n\r\n# n = int(input())\r\n# s = 0\r\n# for i in range(n):\r\n# a = int(input())\r\n# s += a\r\n# print('current s:', s)\r\n# print('total', s)\r\n# print('sr arif:', s / n)\r\n\r\nn = int(input())\r\nmishka = 0\r\nchris = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n mishka += 1\r\n elif a < b:\r\n chris += 1\r\nif mishka > chris:\r\n print('Mishka')\r\nelif mishka < chris:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "n=int(input())\r\nl_m,l_c=[],[]\r\nfor i in range(n):\r\n results=input().split(' ')\r\n if int(results[0])>int(results[1]):l_m.append(1)\r\n elif int(results[0])<int(results[1]):l_c.append(1)\r\nif len(l_m)>len(l_c):print('Mishka')\r\nelif len(l_m)<len(l_c):print('Chris')\r\nelse:print('Friendship is magic!^^')", "n = int(input())\r\nc = 0\r\nm=0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a<b:\r\n c+=1\r\n elif a>b:\r\n m+=1\r\n else:\r\n continue\r\nif c>m:\r\n print(\"Chris\")\r\nelif c<m:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\na = 0\r\nb = 0\r\nwhile n > 0:\r\n move_1, move_2 = [int(x) for x in input().split()]\r\n if move_1 > move_2:\r\n a += 1\r\n elif move_1 < move_2:\r\n b += 1\r\n n -= 1\r\nif a > b:\r\n print(\"Mishka\")\r\nelif a < b:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\ni = 0\r\nb = 0\r\nfor p in range(n):\r\n m, c = [int(x) for x in input().split()]\r\n if m > c:\r\n i += 1\r\n elif m < c:\r\n b += 1\r\n else:\r\n i += 1\r\n b += 1\r\n\r\nif i > b:\r\n print('Mishka')\r\nelif i < b:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n=int(input())\r\ncnt_m,cnt_k=0,0\r\nfor _ in range(n):\r\n sp=[int(i) for i in input().split()]\r\n if sp[0]>sp[1]:\r\n cnt_m+=1\r\n elif sp[1]>sp[0]:\r\n cnt_k+=1\r\nif cnt_m>cnt_k:\r\n print('Mishka')\r\nelif cnt_k>cnt_m:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\ncm = 0\r\ncc = 0\r\nfor i in range(n):\r\n m,c = map(int,input().split())\r\n if m>c:\r\n cm+=1\r\n elif c>m:\r\n cc+=1\r\nif cm>cc:\r\n print(\"Mishka\")\r\nelif cc>cm:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n\r\n", "n=int(input())\r\ns=0\r\ns1=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n s+=1\r\n elif m==c:\r\n s+=1\r\n s1+=1\r\n else:\r\n s1+=1\r\nif s==s1:\r\n print(\"Friendship is magic!^^ \")\r\nelif s>s1:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\nm = 0\nc = 0\n \nfor i in range(n):\n\ta, b = map(int, input().split())\n\t\n\tif a > b:\n\t\tm += 1\n\telif b > a:\n\t\tc += 1\n\t\t\nif m > c:\n\tprint('Mishka')\nelif c > m:\n\tprint('Chris')\nelse:\n\tprint('Friendship is magic!^^')\n\t \t \t \t\t \t \t\t \t \t \t\t \t \t", "m, c = 0,0\r\nfor _ in range(int(input())):\r\n a, b = map(int,input().split())\r\n if a > b:\r\n m += 1\r\n elif a < b:\r\n c += 1\r\n\r\nif m == c:\r\n print(\"Friendship is magic!^^\")\r\nelif m > c:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\r\nmm = cc = 0\r\nfor _ in range(n):\r\n m,c=map(int,input().split(' '))\r\n if m > c:\r\n mm += 1\r\n elif m < c:\r\n cc += 1\r\nif mm > cc:\r\n print('Mishka')\r\nelif mm < cc:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n \r\n \r\n \r\n", "n = int(input())\r\nmishka = 0\r\nchris = 0\r\nwhile n>0:\r\n a = list(map(int, input().split()))\r\n # print(f\"{a[0]} and {a[1]}\")\r\n if a[0]>a[1]:\r\n mishka +=1\r\n elif a[0]<a[1]:\r\n chris +=1\r\n n -= 1\r\n #print(f\"Chris score: {chris} -- Mishka score {mishka}\")\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif chris > mishka:\r\n print(\"Chris\")\r\nelif mishka == chris:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nt = 0\n\nfor _ in range(n):\n i, j = map(int, input().split())\n if i < j:\n t -= 1\n if i > j:\n t += 1\nif t > 0:\n print(\"Mishka\")\nelif t < 0:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n", "n = int(input())\nm = 0\nch = 0\nfor i in range(n):\n a, b = map(int, input().split())\n if (a > b):\n m += 1\n elif (a < b):\n ch += 1\nif (m > ch):\n print('Mishka')\nelif (m < ch):\n print('Chris')\nelse:\n print('Friendship is magic!^^')\n\n \t \t \t \t \t \t \t \t \t\t \t \t \t\t", "n = int(input())\r\na = k = 0\r\nfor i in range(n):\r\n x = input()\r\n x = list(x)\r\n if x[0] == x[2]:\r\n continue\r\n elif x[0] > x[2]:\r\n k += 1\r\n elif x[0] < x[2]:\r\n a += 1\r\nif a < k:\r\n print(\"Mishka\")\r\nelif a > k:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "m=c=0\r\nfor i in [list(map(int, input().split())) for _ in '_'*int(input())]:\r\n if i[0] > i[1]: m+=1\r\n elif i[0] < i[1]: c+=1\r\nif m > c: print(\"Mishka\")\r\nelif c > m: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")\r\n", "a,b=0,0\r\nfor i in range(int(input())):\r\n \r\n n,m=map(int,input().split())\r\n if n>m:\r\n a+=1\r\n elif n<m:\r\n b+=1\r\n else:\r\n a+=1\r\n b+=1\r\nif a>b:\r\n print(\"Mishka\")\r\nelif a<b:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if b > a:\r\n c += 1\r\n elif a > b:\r\n m += 1\r\n\r\nif m == c:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print(['Mishka', 'Chris'][c > m])", "n = int(input())\r\nM = 0\r\nC = 0\r\nfor i in range(n):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n M += 1\r\n elif m < c:\r\n C += 1\r\n \r\nif M > C:\r\n print('Mishka')\r\nelif M < C:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "a, t, c = int(input()), 0, 0\r\nfor i in range(a):\r\n b, d = map(int, input().split())\r\n if b > d:\r\n t += 1\r\n if b < d:\r\n c += 1\r\nif t > c:\r\n print ('Mishka')\r\nif t < c:\r\n print ('Chris')\r\nif t == c:\r\n print ('Friendship is magic!^^')", "n = int(input())\r\nmCount = 0\r\ncCount = 0\r\nfor i in range(n):\r\n listA = list(map(int,input().split(\" \")))\r\n m = listA[0]\r\n c = listA[1]\r\n if m>c:\r\n mCount+=1\r\n elif c>m:\r\n cCount+=1\r\n else:\r\n pass\r\nif mCount>cCount :\r\n print(\"Mishka\")\r\nelif cCount>mCount:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "n = int(input())\r\na, b = 0, 0\r\nfor i in range(n):\r\n j, k = map(int, input().split())\r\n if j > k:\r\n a += 1\r\n elif k > j:\r\n b += 1\r\nif a > b:\r\n print(\"Mishka\")\r\nelif b > a:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "x = int(input())\r\nm = c = 0\r\nfor l in range(x):\r\n y = input()\r\n if int(y[0]) > int(y[2]):\r\n m += 1\r\n else:\r\n if int(y[0]) < int(y[2]):\r\n c += 1\r\nif m > c:\r\n print(\"Mishka\")\r\nelse:\r\n if m < c:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")", "c=0\r\nd=0\r\ne=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a<b:\r\n d+=1\r\n elif a>b:\r\n c+=1\r\n else:\r\n e+=1\r\nif c>d and c>e:\r\n print(\"Mishka\")\r\nelif d>c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nmishika = 0\r\nchris = 0\r\nfor i in range(n):\r\n m,c = map(int,input().split())\r\n if m > c:\r\n mishika += 1\r\n elif m < c:\r\n chris += 1\r\nif mishika > chris:\r\n print(\"Mishka\")\r\nelif chris > mishika:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\ncm , cc = 0, 0\r\nfor i in range(n):\r\n m, c = map(int, input().split())\r\n\r\n if m > c:\r\n cm += 1\r\n elif m < c:\r\n cc += 1\r\nif cm > cc:\r\n print(\"Mishka\")\r\nelif cm < cc:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n \r\n", "n = int(input())\r\nmcount = 0\r\nccount = 0\r\ndcount = 0\r\nfor num in range(n):\r\n m, c = map(int, input().split())\r\n if m>c:\r\n mcount+=1\r\n elif m==c:\r\n dcount+=1\r\n else:\r\n ccount+=1\r\n \r\nif mcount > ccount:\r\n print(\"Mishka\")\r\nelif ccount > mcount:\r\n print('Chris')\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "co1=0\r\nco2=0\r\nfor _ in range(int(input())):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n co1+=1\r\n elif m<c:\r\n co2+=1\r\n else:\r\n co1+=1\r\n co2+=1\r\nif co1>co2:print(\"Mishka\")\r\nif co1<co2:print(\"Chris\")\r\nif co1==co2:print(\"Friendship is magic!^^\")\r\n", "# Input the number of game rounds\r\nn = int(input())\r\n\r\n# Initialize counts for Mishka and Chris\r\nmishka_count = 0\r\nchris_count = 0\r\n\r\n# Process each round\r\nfor _ in range(n):\r\n mi, ci = map(int, input().split())\r\n \r\n # Update counts based on the round result\r\n if mi > ci:\r\n mishka_count += 1\r\n elif mi < ci:\r\n chris_count += 1\r\n\r\n# Determine the winner or if it's a draw\r\nif mishka_count > chris_count:\r\n print(\"Mishka\")\r\nelif mishka_count < chris_count:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "a=int(input())\r\nmish=0\r\nchris=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if b>c:\r\n mish=mish+1\r\n elif b<c:\r\n chris=chris+1\r\nif mish>chris:\r\n print(\"Mishka\")\r\nelif mish<chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "cntM = 0\r\ncntC = 0\r\nfor _ in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a == b:\r\n continue\r\n elif a > b:\r\n cntM += 1\r\n else:\r\n cntC +=1 \r\nif cntM > cntC:\r\n print('Mishka')\r\nelif cntC > cntM:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "x=0\r\nfor i in range(int(input())):\r\n m,c=map(int,input().split())\r\n x+=m>c\r\n x-=c>m\r\nprint([['Chris','Mishka'][x>0],'Friendship is magic!^^'][x==0])", "n = int(input())\nm=0 \nc=0\nfor i in range (0,n):\n x,z=input().split()\n x =int(x)\n z =int(z)\n if x>z:\n m+=1\n elif z>x:\n c+=1 \nif m>c:\n print(\"Mishka\")\nelif m<c:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n \n\n\n\n \t\t \t \t\t\t\t\t \t\t \t \t\t\t \t \t", "n = int(input())\nmwin = 0\ncwin = 0\nfor i in range(0,n) :\n m , c = [int(x) for x in input().split()]\n if m>c:\n mwin += 1\n elif m<c :\n cwin += 1\n\nif mwin > cwin :\n print(\"Mishka\")\nelif cwin > mwin :\n print(\"Chris\")\nelse :\n print(\"Friendship is magic!^^\")\n\t \t \t \t \t \t \t\t \t\t \t", "t =int(input())\r\nl,r =0,0\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n if a>b:\r\n l+=1\r\n if b>a:\r\n r+=1\r\nif l>r:\r\n print('Mishka')\r\nif r>l:\r\n print('Chris')\r\nif l==r:\r\n print('Friendship is magic!^^')", "t=input()\r\nh=0; u=0\r\nwhile int(t)>0:\r\n t=int(t)-1\r\n x,y=input().split()\r\n if int(x)>int(y):\r\n h=int(h)+1\r\n elif int(y)>int(x):\r\n u=int(u)+1\r\n else:\r\n i=0\r\nif int(h)>int(u):\r\n print('Mishka')\r\nelif int(u)>int(h):\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "a=int(input())\r\nmishka=0\r\nchris=0\r\n\r\nfor i in range(a):\r\n b=list(map(int,input().split()))\r\n if b[0]>b[1]:\r\n mishka+=1\r\n elif b[0]<b[1]:\r\n chris+=1\r\n else:\r\n continue\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif mishka < chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nMishka = 0\r\nChris = 0\r\ntie = 0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n if(a>b):\r\n Mishka+=1\r\n elif(a<b):\r\n Chris+=1\r\nif(Mishka>Chris):\r\n print(\"Mishka\")\r\nelif(Mishka<Chris):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n\r\n\r\n", "t = int(input())\r\nmwin = 0\r\ncwin = 0\r\nfor i in range(t):\r\n ch = input().split()\r\n m = int(ch[0])\r\n c = int(ch[1])\r\n if m > c:\r\n mwin += 1\r\n if c > m:\r\n cwin += 1\r\nif mwin > cwin:\r\n print(\"Mishka\")\r\nif cwin > mwin:\r\n print(\"Chris\")\r\nif mwin == cwin:\r\n print(\"Friendship is magic!^^\")\r\n \r\n", "n = int(input())\nm = 0\ng = 0\nfor _ in range(0,n):\n l = input()\n if l.split(\" \")[0]>l.split(\" \")[1]:\n m+=1\n elif l.split(\" \")[0]<l.split(\" \")[1]:\n g+=1\nif m>g:\n print(\"Mishka\")\nelif g>m:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n", "n = int(input())\r\nc = 0\r\nv = 0\r\nfor i in range (n):\r\n a , b = map(int,input().split())\r\n if a > b :\r\n c+=1\r\n elif b > a :\r\n v+=1\r\nif c > v:\r\n print (\"Mishka\")\r\n \r\nelif v>c:\r\n print(\"Chris\")\r\n \r\nelse :\r\n print (\"Friendship is magic!^^\")", "n = int(input())\r\naa =[]\r\nbb =[]\r\nchris = 0\r\nmishka = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n aa.append(a)\r\n bb.append(b)\r\n if aa[i] > bb[i]:\r\n mishka += 1\r\n elif aa[i] < bb[i]:\r\n chris += 1\r\n\r\nif mishka > chris: print(\"Mishka\")\r\nelif mishka < chris: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")\r\n", "\r\nn=int(input())\r\nls=[]\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n ls.append(x)\r\nc=0\r\nd=0\r\nfor i in range(len(ls)):\r\n for j in range(2):\r\n if ls[i][0]>ls[i][1]:\r\n c+=1\r\n elif ls[i][0]<ls[i][1]:\r\n d+=1\r\n else:\r\n c+=1\r\n d+=1\r\nif c>d:\r\n print('Mishka')\r\nelif d>c:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "mis = 0\ncri = 0 \nfor i in range (int(input())):\n x,y = map(int,input().split())\n if (x>y):\n mis+=1 \n elif ( x<y ):\n cri+=1 \nif ( mis > cri ): \n print (\"Mishka\")\nelif mis < cri :\n print(\"Chris\")\nelse :\n print (\"Friendship is magic!^^\")\n \t \t \t\t\t\t \t\t\t \t\t \t\t\t \t \t\t", "from math import *\n\nn = int(input())\n\nm,c=0,0\nfor _ in range(n):\n f=[int(i) for i in input().split()]\n if f[0]>=f[1]:\n m+=1\n else:\n c+=1\n if f[0]==f[1]:\n c+=1\nprint(\"Mishka\" if m>c else \"Chris\" if m<c else 'Friendship is magic!^^')\n\n\t\t\t \t\t\t\t \t\t\t \t \t \t \t\t\t\t \t\t\t", "n = int(input())\r\nc = 0\r\nv = 0\r\nv1 = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n v1.append(a)\r\n \r\n \r\nfor i in range(n):\r\n if v1[i][0] > v1[i][1]:\r\n c+=1\r\n \r\n elif v1[i][0] < v1[i][1]:\r\n v+=1\r\n \r\nif c > v:\r\n print('Mishka')\r\n\r\nelif c < v:\r\n print('Chris')\r\n \r\nelse:\r\n print('Friendship is magic!^^')", "N = int(input())\r\n\r\nM = 0\r\nC = 0\r\n\r\nfor _ in range(N):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n M += 1\r\n elif m < c:\r\n C += 1\r\n\r\nif M > C:\r\n ans = \"Mishka\"\r\nelif M < C:\r\n ans = \"Chris\"\r\nelse:\r\n ans = \"Friendship is magic!^^\"\r\n\r\nprint(ans)", "n = int(input())\r\na= 0\r\nb = 0\r\nfor i in range(n):\r\n m , c = map(int, input().split())\r\n if m>c :\r\n a+=1\r\n if m<c :\r\n b+=1\r\nif a>b :\r\n print(\"Mishka\")\r\nelif b>a :\r\n print(\"Chris\")\r\nelse :\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\ncm=0\r\ncc=0\r\nfor k in range(t):\r\n a,b=map(int,input().split())\r\n if(a>b):\r\n cm+=1\r\n elif(a<b):\r\n cc+=1\r\nif(cm>cc):\r\n print(\"Mishka\")\r\nelif(cm<cc):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "t=int(input())\r\nmi=0\r\nch=0\r\nfor i in range(t):\r\n (m,c)=map(int,input().split())\r\n if(m>c):\r\n mi=mi+1\r\n elif(c>m):\r\n ch=ch+1\r\nif(mi>ch):\r\n print(\"Mishka\")\r\nelif(ch>mi):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n\r\n ", "mi=0\r\nch=0\r\nfor i in range(int(input())):\r\n a=list(map(int,input().split())) \r\n if a[0]>a[1]:\r\n mi+=1\r\n elif a[0]<a[1]:\r\n ch+=1\r\n else:\r\n continue\r\nif mi<ch:\r\n print(\"Chris\")\r\nelif mi>ch:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "cm=0\r\ncc=0\r\nfor t in range(int(input())):\r\n m,c=list(map(int,input().split()))\r\n if(m>c):\r\n cm+=1\r\n elif(c>m):\r\n cc+=1\r\nif(cm>cc):\r\n print(\"Mishka\")\r\nelif(cm<cc):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nnums = []\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n nums.append(a)\r\n nums.append(b)\r\n \r\n \r\n if a > b:\r\n count1 += 1\r\n elif b > a:\r\n count2 += 1\r\n \r\nif (count1 > count2):\r\n print(\"Mishka\")\r\nelif (count2 > count1):\r\n print(\"Chris\")\r\nelif (count1 == count2):\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\nd=0\r\ne=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if b==c:\r\n d+=1\r\n e+=1\r\n elif b<c:\r\n d+=1\r\n else:\r\n e+=1\r\nif d==e:\r\n print('Friendship is magic!^^')\r\nelif d<e:\r\n print('Mishka')\r\nelse:\r\n print('Chris')", "n = int(input())\r\n\r\n# Initialize scores for Mishka and Chris\r\nmishka_score = 0\r\nchris_score = 0\r\n\r\n# Process each round\r\nfor _ in range(n):\r\n mi, ci = map(int, input().split())\r\n if mi > ci:\r\n mishka_score += 1\r\n elif mi < ci:\r\n chris_score += 1\r\n\r\n# Determine the winner\r\nif mishka_score > chris_score:\r\n print(\"Mishka\")\r\nelif mishka_score < chris_score:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "d,e=0,0\r\nfor i in range(int(input())):\r\n a=[int(x) for x in input().split()]\r\n if a[0]>a[1]:\r\n d+=1\r\n elif a[0]<a[1]:\r\n e+=1\r\nif d>e:\r\n print(\"Mishka\")\r\nelif e>d:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n= int(input())\r\nm,k=0,0\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n if a>b:\r\n m+=1\r\n elif b>a:\r\n k+=1\r\nif m>k:\r\n res=\"Mishka\"\r\nelif m==k:\r\n res=\"Friendship is magic!^^\"\r\nelse:\r\n res=\"Chris\"\r\nprint(res)", "a = int(input())\r\ns1 = 0 \r\ns2 = 0\r\nfor i in range(a):\r\n m,c = map(int,input().split())\r\n if m > c:\r\n s1 += 1\r\n if c > m:\r\n s2 += 1\r\nif s1 > s2:\r\n print('Mishka')\r\nif s2 > s1:\r\n print('Chris')\r\nif s1 == s2:\r\n print('Friendship is magic!^^')\r\n", "n = int(input())\r\nmishka_wins = 0\r\nchris_wins =0\r\nfor _ in range(n):\r\n mi,ci = map(int,input().split())\r\n if mi>ci:\r\n mishka_wins += 1\r\n if ci>mi:\r\n chris_wins += 1\r\nif mishka_wins > chris_wins:\r\n print(\"Mishka\")\r\nelif chris_wins > mishka_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "def main(m,c):\r\n global m_p, c_p\r\n if m > c:\r\n m_p +=1\r\n elif m < c:\r\n c_p +=1\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n m_p = 0\r\n c_p = 0\r\n for i in range(n):\r\n m,c = [int(x) for x in input().split()]\r\n main(m,c)\r\n if m_p > c_p:\r\n print(\"Mishka\")\r\n elif m_p < c_p:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\ncounta=0\r\ncountb=0\r\nfor i in range(1,n+1):\r\n a,b=map(int,input().split())\r\n if(a>b):\r\n counta=counta+1\r\n elif(a<b):\r\n countb=countb+1\r\nif(counta>countb):\r\n print(\"Mishka\")\r\nelif(counta<countb):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "co = co1 = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if(b>a):\r\n co1 += 1\r\n if(a>b):\r\n co+= 1\r\nif(co>co1):\r\n print(\"Mishka\")\r\nif(co<co1):\r\n print(\"Chris\")\r\nif(co == co1):\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nmishika = 0\nchris = 0\n\nfor i in range(n):\n\tm = input().split()\n\tif int(m[0]) > int(m[1]):\n\t\tmishika += 1\n\telif int(m[1]) > int(m[0]):\n\t\tchris += 1\nif mishika>chris:\n\tprint('Mishka')\nelif chris>mishika:\n\tprint('Chris')\nelse:\n\tprint('Friendship is magic!^^')\t\t\t\t\t", "b = 0;c = 0\r\nfor i in range(int(input())):\r\n a = list(map(int,input().split()))\r\n if a[0]>a[1]:\r\n b = b + 1\r\n elif a[0]<a[1]:\r\n c = c + 1\r\n elif a[0]==a[1]:\r\n d = 0\r\nif b>c:\r\n print(\"Mishka\")\r\nelif b<c:\r\n print(\"Chris\")\r\nif b==c:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nls=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n ls.append(a)\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n if ls[i][0]>ls[i][1]:\r\n m+=1\r\n elif ls[i][0]<ls[i][1]:\r\n c+=1\r\nif m>c:\r\n print(\"Mishka\")\r\nelif c>m:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "t = int(input())\r\nmishka = 0\r\nchirs = 0\r\nfor _ in range(t):\r\n n,m = list(map(int,input().split()))\r\n if n > m:\r\n mishka+=1 \r\n elif n < m:\r\n chirs+=1\r\nif mishka > chirs:\r\n print(\"Mishka\")\r\nelif chirs > mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a = int(input())\r\nt=0\r\ns=0\r\nfor i in range(a):\r\n m,c = map(int, input().split())\r\n if m > c : \r\n s+=1\r\n elif c > m :\r\n t+=1\r\n elif c == m :\r\n s+=0\r\n t+=0\r\nif s > t :\r\n print(\"Mishka\")\r\nelif t > s :\r\n print(\"Chris\")\r\nelif t == s :\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nMishka=0\r\nChris=0\r\nfor i in range(n):\r\n M,C=list(map(int,input().split()))\r\n if M>C:\r\n Mishka+=1\r\n if C>M:\r\n Chris+=1\r\n else:\r\n pass\r\nif Mishka>Chris:\r\n print('Mishka')\r\n exit()\r\nif Chris>Mishka:\r\n print('Chris')\r\n exit()\r\nif Chris==Mishka:\r\n print('Friendship is magic!^^')", "t=int(input())\r\nm,c=0,0\r\nf=False\r\nfor i in range(t):\r\n a,b=input().split()\r\n if a>b : m+=1\r\n elif b>a :c+=1\r\nprint(\"Mishka\" if m>c else \"Chris\" if c>m else \"Friendship is magic!^^\")", "c=0\r\nr=0\r\nfor i in range(int(input())):\r\n a,b=[int(i) for i in input().split()]\r\n if(a>b):\r\n c+=1\r\n if(b>a):\r\n r+=1\r\nif(c>r):\r\n print(\"Mishka\")\r\nelif(r>c):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "n=int(input())\r\nMishika=0\r\nChris=0\r\nfor q in range(n):\r\n ls=input().split()\r\n if int(ls[0])>int(ls[1]):Mishika+=1\r\n elif int(ls[0])<int(ls[1]): Chris+=1\r\nif Mishika>Chris: print(\"Mishka\")\r\nelif Chris>Mishika: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")", "n = int(input())\nMishika , Chirs = 0,0\ndraw = 0\nfor i in range(n):\n m,c = list(map(int , input().split()))\n if m>c :\n Mishika+=1\n elif m<c :\n Chirs+=1\n elif m==c :\n draw+=1\nif Mishika > Chirs :\n print(\"Mishka\")\nelif Mishika==Chirs or draw==n:\n print(\"Friendship is magic!^^\")\nelse:\n print(\"Chris\")\n\n", "k=0\nfor _ in range(int(input())):\n c,d=map(int,input().split())\n k+=c>d;k-=c<d\nif k>0:\n print(\"Mishka\")\nelse:\n print([\"Friendship is magic!^^\",\"Chris\"][k<0])\n\t\t\t\t \t\t\t\t\t \t \t\t\t \t \t\t\t \t", "def Mishka_Game(list_of_rounds):\r\n Mishka_wins = 0\r\n Chris_wins = 0\r\n for i in range(len(list_of_rounds)):\r\n if list_of_rounds[i][0] > list_of_rounds[i][1]:\r\n Mishka_wins += 1\r\n if list_of_rounds[i][0] < list_of_rounds[i][1]:\r\n Chris_wins += 1\r\n\r\n if Mishka_wins > Chris_wins :\r\n return \"Mishka\"\r\n elif Mishka_wins < Chris_wins:\r\n return \"Chris\"\r\n else :\r\n return \"Friendship is magic!^^\"\r\n\r\n\r\n\r\nif __name__ == \"__main__\" :\r\n list_of_rounds = list()\r\n number_of_game_rounds = int(input())\r\n for i in range(number_of_game_rounds):\r\n Mishka , Chris = map(int , input().split())\r\n list_of_rounds.append([Mishka,Chris])\r\n print(Mishka_Game(list_of_rounds))", "t: int = int(input())\r\n\r\nres1 = 0\r\nres2 = 0\r\n\r\nfor i in range(t):\r\n m, c = map(int, input().split())\r\n if m > c :\r\n res1 += 1\r\n elif m < c:\r\n res2 += 1\r\n else:\r\n res1 += 1\r\n res2 += 1\r\n \r\nif res1 > res2:\r\n print(\"Mishka\")\r\nelif res1 < res2:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n \r\n", "n=int(input())\r\nmishka=0\r\nchris=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n m=max(x,y)\r\n if m==x and m!=y:\r\n mishka=mishka+1\r\n elif m==y and m!=x:\r\n chris=chris+1\r\nif mishka>chris:\r\n print(\"Mishka\")\r\nelif chris>mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nwin_m = 0\nwin_c = 0\nfor i in range(n):\n m, c = list(map(int, input().split()))\n if m < c:\n win_c += 1\n elif m > c:\n win_m += 1\n elif m == c:\n continue \nif win_m > win_c:\n print('Mishka')\nelif win_m < win_c: \n print('Chris')\nelse:\n print('Friendship is magic!^^')", "n = int(input())\r\nMishka = 0\r\nChris = 0\r\nfor i in range(0, n):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n Mishka += 1\r\n\r\n elif c > m:\r\n Chris += 1\r\n\r\nif Mishka > Chris:\r\n print(\"Mishka\")\r\n\r\nelif Chris > Mishka:\r\n print(\"Chris\")\r\n\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a = int(input())\r\np = []\r\nm = 0\r\nk = 0\r\n\r\nfor b in range(a):\r\n p = list(map(int,input().split()))\r\n if p[0] > p[1]:\r\n m += 1\r\n if p[1] > p[0]:\r\n k += 1\r\nif m > k:\r\n print('Mishka')\r\nelif k > m :\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "t=int(input())\r\nc1,c2=0,0\r\nwhile t:\r\n n,m=map(int,input().strip().split())\r\n if n>m:\r\n c1+=1\r\n elif m>n:\r\n c2+=1\r\n t-=1\r\nif c1>c2:\r\n print(\"Mishka\")\r\nelif c2>c1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "sp1=0\r\nsp2=0\r\np1=0\r\np2=0\r\nch=[]\r\nn=int(input(\"\"))\r\nfor i in range(n) :\r\n ch=list(map(int,input().split()))\r\n sp1=ch[0]\r\n sp2=ch[1]\r\n if (sp1>sp2) :\r\n p1=p1+1\r\n elif (sp1<sp2) :\r\n p2=p2+1\r\n\r\nif (p1>p2) :\r\n print(\"Mishka\")\r\nelif (p1<p2) :\r\n print(\"Chris\")\r\nelse :\r\n print(\"Friendship is magic!^^\")\r\n", "\r\nT = int(input().strip())\r\n\r\nres = [0]*2\r\n\r\n\r\nfor _ in range(T):\r\n\tgame = list(map(int, input().strip().split()))\r\n\tif game[0] > game[1]:\r\n\t\tres[0] += 1\r\n\telif game[0] < game[1]:\r\n\t\tres[1] += 1\r\nif res[0] > res[1]:\r\n\tprint(\"Mishka\")\r\nelif res[0] < res[1]:\r\n\tprint(\"Chris\")\r\nelse:\r\n\tprint(\"Friendship is magic!^^\")", "n = int(input())\r\nm=0\r\nc=0\r\nf=0\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n if a[0] > a[1]:\r\n m+=1\r\n elif a[0] < a[1]:\r\n c+=1\r\n else:\r\n f+=1\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "n=int(input())\r\ncount_M=0\r\ncount_C=0\r\nfor _ in range(n):\r\n score=list(map(int,input().split()))\r\n \r\n if score[0]>score[1]:\r\n count_M+=1\r\n elif score[0]<score[1]:\r\n count_C+=1\r\n\r\nif count_M>count_C:\r\n print('Mishka')\r\nelif count_M<count_C:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "T = int(input())\r\nb = 0\r\nk = 0\r\nfor i in range(T):\r\n a = input()\r\n a = a.split()\r\n a = [int(x) for x in a]\r\n if a[0] > a[1]:\r\n b += 1\r\n elif a[1] > a[0]:\r\n k += 1\r\n elif a[0] == a[1]:\r\n continue\r\nif b > k:\r\n print(\"Mishka\")\r\nelif k > b:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nMishka=0\r\nChris=0\r\nfor i in range(n):\r\n\tinp=input().split(' ')\r\n\tm=int(inp[0])\r\n\tc=int(inp[1])\r\n\tif m>c: Mishka+=1\r\n\tif m<c: Chris+=1\r\nif Mishka == Chris :\r\n print(\"Friendship is magic!^^\")\r\nelif Mishka > Chris :\r\n print(\"Mishka\")\r\nelse :\r\n print(\"Chris\")", "stat = [0, 0]\r\nfor i in range(int(input())):\r\n results = input()\r\n if int(results[0]) > int(results[2]):\r\n stat[1] += 1\r\n elif int(results[0]) < int(results[2]):\r\n stat[0] += 1\r\nif stat[0] < stat[1]:\r\n print('Mishka')\r\nelif stat[0] > stat[1]:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(n):\r\n arr = list(map(int, input().split()))\r\n if arr[0] > arr[1]:\r\n c1 += 1\r\n if arr[0] < arr[1]:\r\n c2 += 1\r\nif c1 > c2:\r\n print(\"Mishka\")\r\nif c2 > c1:\r\n print(\"Chris\")\r\nif c1 == c2:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\n\r\nmwins = 0\r\ncwins = 0\r\n\r\nfor _ in range(n):\r\n m, c = map(int, input().split())\r\n \r\n if m > c:\r\n mwins += 1\r\n elif c > m:\r\n cwins += 1\r\n\r\nif mwins > cwins:\r\n print(\"Mishka\")\r\nelif cwins > mwins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nmishka, chris = 0, 0\r\nfor i in range(n):\r\n s = input().split(' ')\r\n if int(s[0]) > int(s[1]):\r\n mishka += 1\r\n elif int(s[0]) < int(s[1]):\r\n chris += 1\r\n \r\nif chris == mishka:\r\n print('Friendship is magic!^^')\r\nelif chris < mishka:\r\n print('Mishka')\r\nelse:\r\n print('Chris')", "n = int(input())\r\nnum = [[int(i) for i in input().split()] for j in range(n)]\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in num:\r\n if i[0] == i[1]:\r\n continue\r\n elif i[0] > i[1]:\r\n count1 += 1\r\n else:\r\n count2 += 1\r\nif count1 == count2:\r\n print(\"Friendship is magic!^^\")\r\nelif count1 > count2:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "x=int(input())\nm=0\nc=0\nfor i in range (x):\n a , b = input().split()\n a=int(a)\n b=int(b)\n if a > b:\n m += 1\n elif b > a:\n c += 1\nif m > c :\n print('Mishka')\nelif c > m :\n print('Chris')\nelse :\n print('Friendship is magic!^^')\n\t\t\t\t\t \t \t \t \t\t\t \t \t \t\t\t", "n=int(input())\r\ncount1=0\r\ncount2=0\r\nnums=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n nums.append(a)\r\n nums.append(b)\r\n if a>b:\r\n count1+=1\r\n elif b>a:\r\n count2+=1\r\nif count1>count2:\r\n print(\"Mishka\")\r\nelif count2>count1:\r\n print(\"Chris\")\r\nelif count1==count2:\r\n print(\"Friendship is magic!^^\")", "t = int(input())\r\nmishka = 0\r\nchris = 0\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n if a>b:\r\n mishka+=1\r\n elif b>a:\r\n chris+=1\r\n else:\r\n continue\r\nif mishka>chris:\r\n print(\"Mishka\")\r\nelif chris>mishka:\r\n print('Chris')\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n a=input().split(' ')\r\n if int(a[0])>int(a[1]):\r\n m=m+1\r\n elif int(a[0])<int(a[1]):\r\n c=c+1\r\nif m>c:\r\n print(\"Mishka\")\r\nelif c>m:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nmishka = []\r\nchris = []\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in range(1, n+1):\r\n a = list(map(int, input().split()))\r\n if a[0]>a[1]:\r\n count1+=1\r\n mishka.append(count1)\r\n elif a[0]<a[1]:\r\n count2+=1\r\n chris.append(count2)\r\n\r\nif len(mishka)>len(chris):\r\n print(\"Mishka\")\r\n \r\nelif len(mishka)<len(chris):\r\n print(\"Chris\")\r\n \r\nelse:\r\n print(\"Friendship is magic!^^\")", "misha=0\r\nkris=0\r\nn=int(input())\r\nfor i in range(n):\r\n m,k=map(int,input().split())\r\n if m>k:\r\n misha+=1\r\n elif k>m:\r\n kris+=1\r\n else:\r\n continue\r\nif misha<kris:\r\n print(\"Chris\")\r\nelif misha>kris:\r\n print(\"Mishka\")\r\nelse:\r\n print('Friendship is magic!^^')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 25 01:01:17 2023\r\n\r\n@author: R I B\r\n\"\"\"\r\n\r\nimport sys\r\nL=[]\r\nfor i in sys.stdin:\r\n L.append(i)\r\nK=[line.rstrip('\\n') for line in L if line]\r\nn=int(K[0])\r\nK=K[1:]\r\na,b=0,0\r\nfor m in range(len(K)):\r\n a+=int(int(K[m].split(' ')[0])>int(K[m].split(' ')[1]))\r\n b+=int(int(K[m].split(' ')[0])<int(K[m].split(' ')[1]))\r\nif a>b:\r\n print('Mishka')\r\nelif b>a:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\nc = 0\r\nb = 0\r\nfor i in range(n):\r\n r,r1 = map(int,input(\"\").split())\r\n if r > r1:\r\n c+=1\r\n if r == r1:\r\n c += 1\r\n b+=1\r\n if r < r1:\r\n b+=1\r\nif c < b:\r\n print(\"Chris\")\r\nif c > b:\r\n print(\"Mishka\")\r\nif c == b:\r\n print(\"Friendship is magic!^^\")\r\n ", "n=int(input())\r\na=0\r\nb=0\r\n\r\nfor i in range(n):\r\n m, c =map(int, input().split())\r\n if m>c :\r\n a+=1\r\n elif c>m :\r\n b+=1\r\n\r\n\r\nif a>b:\r\n print(\"Mishka\")\r\nelif a==b:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris \")", "n = int(input())\r\nmc = 0\r\ncc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n mc += 1\r\n elif a < b:\r\n cc += 1\r\n\r\nif mc > cc:\r\n print('Mishka')\r\nelif mc < cc:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n=int(input())\r\np=q=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n p+=1\r\n elif c>m:\r\n q+=1\r\nif p>q:\r\n print(\"Mishka\")\r\nelif q>p:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nmp = 0\r\ncp = 0\r\nfor _ in range(n):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n mp += 1\r\n elif c > m:\r\n cp += 1\r\nif mp > cp:\r\n print('Mishka')\r\nelif cp > mp:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\nm = []\r\nc = []\r\nwhile n > 0:\r\n a = list(map(int,input().split()))\r\n n -= 1\r\n if a[0] > a[1]:\r\n m.append(1)\r\n elif a[0] < a[1]:\r\n c.append(1)\r\n else:\r\n continue\r\nm1 = sum(m)\r\nc1 = sum(c)\r\nif m1 > c1:\r\n print(\"Mishka\")\r\nelif m1 < c1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "from math import ceil\r\n\r\ndef main():\r\n \r\n n = int(input())\r\n cntm, cntc = 0, 0\r\n\r\n for i in range(n):\r\n m, c = list(map(int, input().split()))\r\n\r\n if m > c:\r\n cntm += 1\r\n elif c > m:\r\n cntc += 1\r\n\r\n if cntm > cntc:\r\n print(\"Mishka\")\r\n elif cntm < cntc:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main() ", "t = int(input())\r\nm_total = 0\r\nc_total = 0\r\n\r\nfor i in range(t):\r\n m, c = list(map(int, input().split()))\r\n if m > c:\r\n m_total += 1\r\n elif c > m:\r\n c_total += 1\r\n else:\r\n m_total = m_total\r\n c_total = c_total\r\n\r\nif m_total > c_total:\r\n print(\"Mishka\")\r\n \r\nelif c_total > m_total:\r\n print(\"Chris\")\r\n \r\nelse:\r\n print(\"Friendship is magic!^^\")", "v=0\r\nfor _ in range(int(input())):\r\n\tm, c = map(int, input().split())\r\n\tif m>c:\r\n\t\tv+=1\r\n\telif m < c:\r\n\t\tv -= 1\r\n\r\nprint(\"Mishka\" if v > 0 else \"Chris\" if v<0 else \"Friendship is magic!^^\")\r\n", "def determine_winner(n, rounds):\r\n mishka_wins = 0\r\n chris_wins = 0\r\n\r\n for i in range(n):\r\n mishka_throw, chris_throw = rounds[i]\r\n\r\n if mishka_throw > chris_throw:\r\n mishka_wins += 1\r\n elif mishka_throw < chris_throw:\r\n chris_wins += 1\r\n\r\n if mishka_wins > chris_wins:\r\n return \"Mishka\"\r\n elif mishka_wins < chris_wins:\r\n return \"Chris\"\r\n else:\r\n return \"Friendship is magic!^^\"\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input()) \r\n rounds = []\r\n\r\n for _ in range(n):\r\n mishka_throw, chris_throw = map(int, input().split()) # Round description\r\n rounds.append((mishka_throw, chris_throw))\r\n\r\n result = determine_winner(n, rounds)\r\n print(result)\r\n", "n = int(input())\r\nmiha = 0\r\nkris = 0\r\n\r\nwhile n > 0:\r\n \r\n xy = input()\r\n x,y = xy.split(\" \")\r\n x = int(x)\r\n y = int(y)\r\n if x > y:\r\n miha += 1\r\n elif y > x:\r\n kris += 1\r\n else:\r\n pass\r\n\r\n\r\n n -= 1\r\nif miha > kris:\r\n print(\"Mishka\")\r\nelif kris > miha:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\") \r\n\r\n", "n=int(input())\r\nl1=[]\r\nfor i in range(n):\r\n l1.append(input().split())\r\nm=0\r\nd=0\r\nc=0\r\nfor i in range(n):\r\n if l1[i][0]>l1[i][1]:\r\n m=m+1\r\n if l1[i][0]==l1[i][1]:\r\n d=d+1\r\n if l1[i][0]<l1[i][1]:\r\n c=c+1\r\nif m<c:\r\n print(\"Chris\")\r\nif m==c:\r\n print(\"Friendship is magic!^^\")\r\nif m>c:\r\n print(\"Mishka\")", "n=int(input())\r\nk=0\r\nl=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n k+=1\r\n elif a<b:\r\n l+=1\r\nif k>l:\r\n print(\"Mishka\")\r\nelif k<l:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\ncntm=0\r\ncntc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n cntm+=1\r\n elif a<b:\r\n cntc+=1\r\nif(cntm>cntc):\r\n print(\"Mishka\")\r\nelif(cntm==cntc):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "m = 0; c = 0\r\nfor i in range(int(input())):\r\n l = [int(x) for x in input().split()]\r\n if l[0] > l[1]:\r\n m += 1\r\n elif l[0] < l[1]:\r\n c += 1\r\nprint('Mishka' if m > c else 'Chris' if m < c else 'Friendship is magic!^^')", "a = int(input())\r\nmishka = 0\r\ncristy = 0\r\nfor i in range(a):\r\n n, m = map(int, input().split())\r\n if n > m :\r\n mishka += 1\r\n if n < m:\r\n cristy += 1\r\nif mishka > cristy:\r\n print('Mishka')\r\nelif mishka < cristy:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n \r\n ", "t=int(input())\r\ncnt1=0\r\ncnt2=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n cnt1+=1\r\n elif b>a:\r\n cnt2+=1\r\nif cnt1>cnt2:\r\n print(\"Mishka\")\r\nelif cnt2>cnt1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\ncounter=0\r\nChris=0\r\nMishka=0\r\nwhile a != counter:\r\n counter+=1\r\n lst=list(map(int,input().split()))\r\n\r\n if lst[0] > lst[1]:\r\n Mishka+=1\r\n elif lst[0] < lst[1]:\r\n Chris+=1\r\n else:\r\n Chris=Chris\r\n Mishka=Mishka\r\n\r\nif Chris > Mishka:\r\n print(\"Chris\")\r\nelif Mishka > Chris:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "s=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n s+=1\r\n elif b>a:\r\n s-=1\r\nif s>0:\r\n print(\"Mishka\")\r\nelif s<0:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "num_rounds = int(input())\r\n\r\nmishka_wins = 0\r\nchris_wins = 0\r\n\r\nfor _ in range(num_rounds):\r\n mishka_score, chris_score = map(int, input().split())\r\n\r\n if mishka_score > chris_score:\r\n mishka_wins += 1\r\n elif mishka_score < chris_score:\r\n chris_wins += 1\r\nif mishka_wins == chris_wins:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('Mishka' if mishka_wins > chris_wins else 'Chris')", "t=int(input())\r\nMishka=0\r\nChris=0\r\nfor i in range(t):\r\n x,y=map(int,input().split())\r\n if(x>y):\r\n Mishka+=1\r\n elif(y>x):\r\n Chris+=1\r\nif Mishka>Chris:\r\n print('Mishka')\r\nelif Chris>Mishka:\r\n print('Chris')\r\nelif Chris==Mishka:\r\n print('Friendship is magic!^^')", "n = int(input())\r\nresult = []\r\ntotalM=0\r\ntotalC=0\r\nfor _ in range(n):\r\n M , C = map(int,input().split(\" \"))\r\n if M > C :\r\n totalM+=1\r\n if C > M :\r\n totalC+=1\r\n\r\nif totalM > totalC :\r\n print(\"Mishka\")\r\nelif totalM < totalC :\r\n print(\"Chris\")\r\nelse: \r\n print(\"Friendship is magic!^^\")", "\"\"\"\r\n=> @auther:Abdallah_Gaber\r\n=> A computer science student\r\n=> AOU University \"Egypt Branch\"\r\n\"\"\"\r\n#S. Max Split\r\np1=0\r\np2=0\r\nfor i in range(int(input())):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n p1+=1\r\n elif m<c:\r\n p2+=1\r\n else:\r\n continue\r\n\r\nif p1>p2:\r\n print('Mishka')\r\nelif p1<p2:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "n = int(input())\r\ni = 0 \r\nm=0\r\nk = 0 \r\nwhile i<n:\r\n a = list(map(int, input().split()))\r\n if(a[0]>a[1]):\r\n m+=1\r\n elif(a[0]<a[1]):\r\n k+=1\r\n i+=1\r\nif(m>k):\r\n print(\"Mishka\")\r\nelif(m<k):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x>y:\r\n m+=1\r\n elif y>x:\r\n c+=1\r\nif m==c:\r\n print(\"Friendship is magic!^^\")\r\nelif m>c:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n=int(input())\r\nms=0\r\nchs=0\r\nfor x in range (0,n):\r\n m, ch=map(int,input().split())\r\n if m>ch:\r\n ms+=1\r\n elif ch>m:\r\n chs+=1\r\n else:\r\n pass\r\nif ms>chs:\r\n print(\"Mishka\")\r\nelif ms<chs:\r\n print(\"Chris\")\r\nelif ms==chs:\r\n print(\"Friendship is magic!^^\")\r\n", "t = int(input())\r\nx = 0\r\ny = 0\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n if(a > b):\r\n x+=1 \r\n elif(a < b):\r\n y+=1 \r\nif(x > y):\r\n print(\"Mishka\")\r\nelif(x < y):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "n = int(input())\r\na, b, s, k = 0, 0, 0, 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n if a>b:\r\n s += 1\r\n if b>a:\r\n k += 1\r\nif s>k:\r\n print(\"Mishka\")\r\nif k>s:\r\n print(\"Chris\")\r\nif s==k:\r\n print(\"Friendship is magic!^^\")", "t = int(input())\r\ncc = 0\r\ncm = 0\r\nfor _ in range(t):\r\n a,b = map(int,input().split())\r\n if a>b:\r\n cm+=1\r\n elif b>a:\r\n cc+=1\r\n\r\nif cc > cm:\r\n print(\"Chris\")\r\nelif cc<cm:\r\n print(\"Mishka\") \r\nelse:\r\n print(\"Friendship is magic!^^\") ", "n = int(input(''))\r\n\r\nMishka_win = 0\r\nChris_win = 0\r\n\r\nfor i in range(0,n):\r\n s = str(input(''))\r\n line = s.split(' ')\r\n Mishka_dice = int(line[0])\r\n Chris_dice = int(line[1])\r\n\r\n if Mishka_dice > Chris_dice:\r\n Mishka_win += 1\r\n elif Mishka_dice < Chris_dice:\r\n Chris_win += 1\r\n \r\nif Mishka_win > Chris_win:\r\n print(\"Mishka\",end='')\r\nelif Mishka_win < Chris_win:\r\n print(\"Chris\",end='')\r\nelse :\r\n print(\"Friendship is magic!^^\",end='')", "m = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a > b: m += 1\r\n elif a < b: m -= 1\r\nif m > 0: print(\"Mishka\")\r\nelif m < 0: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")", "test_cases = int(input())\r\nmishka = 0\r\nchris = 0\r\n\r\nfor _ in range(test_cases):\r\n n, m = map(int, input().split())\r\n if n > m:\r\n mishka += 1\r\n elif m > n:\r\n chris += 1\r\n\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif mishka < chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "k = 0\r\nfor _ in range(int(input())):\r\n c, d = map(int, input().split())\r\n k += c > d\r\n k -= c < d\r\nprint('Mishka' if k > 0 else ['Friendship is magic!^^', 'Chris'][k < 0])", "def main(arr):\r\n a, b = 0, 0\r\n\r\n for i in range(len(arr)):\r\n if arr[i][0] > arr[i][1]:\r\n a += 1\r\n elif arr[i][0] < arr[i][1]:\r\n b += 1\r\n\r\n if a > b:\r\n return \"Mishka\"\r\n elif a < b:\r\n return \"Chris\"\r\n else:\r\n return \"Friendship is magic!^^\"\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n arr = []\r\n\r\n for _ in range(n):\r\n arr.append(list(map(int, input().split())))\r\n\r\n print(main(arr))", "n=int(input())\r\nMis=0\r\nCh=0\r\nfor i in range(n):\r\n m, c = map(int,input().split())\r\n if(m>c):\r\n Mis += 1\r\n elif(m<c):\r\n Ch+= 1\r\nif(Mis>Ch):\r\n print(\"Mishka\")\r\nelif(Mis==Ch):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\r\nx,y = 0,0\r\nfor _ in range(n):\r\n m,n = map(int,input().split())\r\n if m > n:\r\n x += 1\r\n elif m < n:\r\n y += 1\r\nif x > y:\r\n print(\"Mishka\")\r\nelif x < y:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input());ans=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m>c:ans+=1\r\n elif m<c:ans-=1\r\nprint(\"Mishka\") if ans>0 else print(\"Chris\") if ans<0 else print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\n\r\nm = 0\r\nc = 0\r\n\r\nfor i in range(n):\r\n mi, ci = [int(x) for x in input().split()]\r\n \r\n if mi > ci:\r\n m += 1\r\n elif ci > mi:\r\n c += 1\r\n\r\nif m > c:\r\n print(\"Mishka\")\r\nelif c > m:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input()) # Number of game rounds\r\nmishka_wins = 0 # Counter for Mishka's wins\r\nchris_wins = 0 # Counter for Chris' wins\r\n\r\nfor _ in range(n):\r\n m, c = map(int, input().split()) # Dice values for Mishka and Chris in this round\r\n if m > c:\r\n mishka_wins += 1\r\n elif c > m:\r\n chris_wins += 1\r\n\r\nif mishka_wins > chris_wins:\r\n print(\"Mishka\")\r\nelif chris_wins > mishka_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "m, k = 0, 0\r\nfor _ in range(int(input())):\r\n m1, k1 = map(int, input().split())\r\n if m1 > k1: m += 1\r\n elif k1 > m1: k += 1\r\n\r\nprint('Friendship is magic!^^' if m == k else 'Mishka' if m > k else 'Chris')", "n = int(input())\r\n\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n if a > b:\r\n count1 += 1\r\n elif a < b:\r\n count2 += 1\r\nif count1 > count2:\r\n print('Mishka')\r\nelif count1 < count2:\r\n print('Chris')\r\nelif count1 == count2:\r\n print('Friendship is magic!^^')", "from sys import stdin,stdout\r\nr=[0,0]\r\nfor i in range(int(stdin.readline())):\r\n m,c=map(int,stdin.readline().split())\r\n if m==c:\r\n continue\r\n r[c<m]+=1\r\nstdout.write('Friendship is magic!^^' if r[0]==r[1] else 'Mishka' if r[1]>r[0] else 'Chris')\r\n", "a = int(input(''))\r\nm = 0\r\nc = 0\r\nsc = 0\r\nsm = 0 \r\n\r\nfor j in range(a):\r\n t = 0\r\n b = input('')\r\n lista = []\r\n for k in b.split():\r\n lista.append(int(k))\r\n mis = lista[0]\r\n c = lista[1]\r\n \r\n if c > mis:\r\n sc = sc + 1\r\n\r\n elif mis > c:\r\n sm = sm + 1\r\n\r\n elif mis == c:\r\n sc = sc\r\n sm = sm\r\n\r\n\r\nif sc > sm:\r\n print('Chris')\r\n\r\nelif sm > sc:\r\n print('Mishka')\r\n\r\nelif sm == sc:\r\n print('Friendship is magic!^^')\r\n", "t = int(input())\r\nmishka = 0\r\nchris = 0\r\n\r\nfor i in range(t):\r\n x, y = map(int, input().split())\r\n if x > y:\r\n mishka += 1\r\n elif x < y:\r\n chris += 1\r\n\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif mishka < chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "c = 0\r\nm = 0\r\nfor _ in range(int(input())):\r\n a,b = map(int, input().split())\r\n if a>b:\r\n m+=1\r\n elif a<b:\r\n c+=1\r\nif m>c:\r\n print('Mishka')\r\nelif m<c:print('Chris')\r\nelse:print('Friendship is magic!^^')", "\r\nn = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n l = input()\r\n l = [int(i) for i in l.split()]\r\n\r\n if l[0] > l[1]:\r\n m += 1\r\n if l[0] < l[1]:\r\n c += 1\r\n\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nm = 0\nc = 0\n\nfor i in range(n):\n a,b = list(map(int, input().split()))\n if a > b:\n m += 1\n elif a < b:\n c += 1\n \nif m == c:\n print('Friendship is magic!^^')\nelif m > c:\n print('Mishka')\nelse:\n print('Chris')", "n = int(input())\r\nKris = 0\r\nMish = 0\r\nfor i in range(n):\r\n mass = input().split()\r\n fir = int(mass[0])\r\n sec = int(mass[1])\r\n \r\n if fir > sec:\r\n Mish += 1\r\n if fir < sec:\r\n Kris += 1\r\nif Kris > Mish:\r\n print('Chris')\r\nif Kris < Mish:\r\n print(\"Mishka\")\r\nif Kris == Mish:\r\n print(\"Friendship is magic!^^\")", "a = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(0,a):\r\n x,y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n if x>y:\r\n m += 1\r\n elif x<y:\r\n c+=1\r\n\r\nif m>c:\r\n print(\"Mishka\")\r\nelif m<c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "c=0\r\nb=0\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x>y:\r\n c+=1\r\n elif y>x:\r\n b+=1 \r\nif c>b:\r\n print(\"Mishka\") \r\nelif b>c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "mish=chris=0\r\nfor _ in range(int(input())):\r\n n,m=map(int,input().split())\r\n if n>m:\r\n mish+=1\r\n elif n<m:\r\n chris+=1\r\nif mish>chris:\r\n print(\"Mishka\")\r\nelif(chris > mish):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n \r\n\r\n\r\n", "n=int(input())\r\nc=0\r\nm=0\r\nfor i in range(0,n):\r\n game=input()\r\n if int(game[0]) > int(game[2]):\r\n m +=1 \r\n elif int(game[0]) < int(game[2]):\r\n c +=1 \r\n\r\nif m > c : print(\"Mishka\")\r\nelif c > m : print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")", "n=int(input())\r\nmis=0\r\ncris=0\r\nfor i in range(n):\r\n mishka,chris= input().split()\r\n if int(mishka)>int(chris):\r\n mis+=1\r\n elif int(mishka)<int(chris):\r\n cris+=1\r\n else:\r\n pass\r\nif mis>cris:\r\n print(\"Mishka\")\r\nelif cris>mis:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "n=int(input())\nans=0\nsum=0\nfor i in range(n):\n m,l=input().split()\n m=int(m)\n l=int(l)\n if m>l:\n ans+=1\n elif l>m:\n sum+=1\nif ans>sum:\n print(\"Mishka\")\nelif sum>ans:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\" )\n\t \t\t \t\t \t\t \t \t \t\t \t\t \t\t", "t=int(input())\r\nc=0\r\nd=0\r\nwhile t>0:\r\n a,b=map(int,input().split())\r\n if a<b:\r\n c=c+1;\r\n elif a==b:\r\n c=c+1;\r\n d=d+1;\r\n else:\r\n d=d+1;\r\n t=t-1\r\nif c<d:\r\n print(\"Mishka\")\r\nelif c==d:\r\n print(\"Friendship is magic!^^\")\r\n \r\nelse:\r\n print(\"Chris\")\r\n ", "a,b = 0,0\r\nfor i in range(int(input())): \r\n x,y = map(int,input().split())\r\n if x > y:\r\n a += 1\r\n elif y > x:\r\n b += 1\r\n else:\r\n pass\r\nif a > b:\r\n print(\"Mishka\")\r\nelif b > a:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "r = 0\r\nfor i in range(int(input())): \r\n x,y = map(int,input().split())\r\n if x > y: r += 1\r\n elif y > x: r -= 1\r\nif r > 0: print(\"Mishka\")\r\nelif r < 0: print(\"Chris\")\r\nelif r == 0: print(\"Friendship is magic!^^\")", "x,y=0,0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n x+=1\r\n elif a<b:\r\n y+=1\r\nif x==y:print(\"Friendship is magic!^^\")\r\nelif x>y:print(\"Mishka\")\r\nelse:print(\"Chris\")", "M = 0\r\nCh = 0\r\nfor _ in range(int(input())):\r\n points = [int(x) for x in input().split()]\r\n if points[0] > points[1]:\r\n M += 1\r\n elif points[0] < points[1]:\r\n Ch += 1\r\n\r\nif M > Ch:\r\n print('Mishka')\r\nelif M < Ch:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "a=int(input())\r\nc=0\r\nd=0\r\nfor i in range(a):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n if a>b:\r\n c+=1\r\n elif b>a:\r\n d+=1\r\n elif a==b:\r\n c+=1\r\n d+=1\r\nif c>d:\r\n print('Mishka')\r\nelif d>c:\r\n print('Chris')\r\nelif c==d:\r\n print('Friendship is magic!^^')\r\n", "a = int(input())\r\nmis = 0\r\nch = 0\r\nfor i in range(a):\r\n b = list(map(int , input().split()))\r\n if b[0] > b[1]:\r\n mis += 1\r\n elif b[1] > b[0]:\r\n ch += 1\r\nif mis > ch:\r\n print(\"Mishka\")\r\nelif ch > mis:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\ncountm=0\r\ncountc=0\r\nfor i in range(n):\r\n m,c=map(int,input().strip().split())\r\n if m>c:\r\n countm+=1\r\n elif c>m:\r\n countc+=1\r\nif countm>countc:\r\n print(\"Mishka\")\r\nelif countc>countm:\r\n print(\"Chris\")\r\nelif countc==countm:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\n \nm = 0\n \nfor i in range(0,n):\n cm, cc = map(int,input().split())\n if cm > cc:\n m += 1\n elif cm < cc:\n m -= 1\n \nif m > 0:\n print('Mishka')\nelif m < 0:\n print('Chris')\nelse:\n print('Friendship is magic!^^')\n\t \t \t\t \t\t\t\t \t \t\t\t \t\t\t \t\t \t", "# LUOGU_RID: 111435726\nnum = int(input())\r\nmishka = 0\r\nchris = 0\r\nfor i in range(num):\r\n game_result = input().split()\r\n game_result = list(map(int, game_result))\r\n if game_result[0] > game_result[1]:\r\n mishka += 1\r\n elif game_result[1] > game_result[0]:\r\n chris += 1\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif mishka < chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\ncount = 0\r\nfor x in range(n):\r\n m, c = map(int, input().split())\r\n \r\n if m > c: count -= 1\r\n elif m < c: count += 1\r\n \r\nif count > 0: print('Chris')\r\nelif count < 0: print('Mishka')\r\nelif count == 0: print('Friendship is magic!^^')", "mw, cw = 0, 0\r\nfor i in range(int(input())):\r\n m, c = map(int, input().split())\r\n if m>c:\r\n mw += 1\r\n elif c>m:\r\n cw += 1\r\nprint([[\"Chris\",\"Mishka\"][mw>cw], \"Friendship is magic!^^\"][mw == cw])", "t = int(input())\r\n\r\nm_count = 0\r\nc_count = 0\r\n\r\nfor _ in range(t):\r\n\tm, c = map(int, input().split())\r\n\r\n\tif m > c:\r\n\t\tm_count += 1\r\n\telif m < c:\r\n\t\tc_count += 1\r\n\r\nif m_count > c_count:\r\n\tprint('Mishka')\r\nelif c_count > m_count:\r\n\tprint('Chris')\r\nelse:\r\n\tprint('Friendship is magic!^^')\r\n", "def func(n, m):\r\n c = 0\r\n if n > m:\r\n c+=1\r\n if n < m:\r\n c-=1 \r\n if n==m:\r\n c+=0\r\n return c\r\nx = int(input())\r\nc=0\r\nfor i in range(x):\r\n n, m = map(int,input().split())\r\n c+=func(n, m)\r\nif c == 0:\r\n print('Friendship is magic!^^')\r\nif c > 0:\r\n print('Mishka')\r\nif c < 0:\r\n print('Chris')", "n=int(input())\r\nm=0\r\nc=0\r\nfor k in range(n):\r\n a,b=map(int,input().split())\r\n if (a>b):\r\n m+=1\r\n elif (b>a):\r\n c+=1\r\nif (m>c):\r\n print('Mishka')\r\nelif (m<c):\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "inp = lambda:int(input())\nstrng = lambda:input().split()\n\nn = inp()\nmishka = 0\nchris = 0\nfor i in range(n):\n\ta, b = map(int, strng())\n\tif a > b: mishka += 1\n\telif b > a: chris += 1\nif mishka > chris: print('Mishka')\nelif chris > mishka: print('Chris')\nelse: print('Friendship is magic!^^')\n", "# Input the number of game rounds\r\nz = int(input())\r\n\r\n# Initialize counters for Mishka and Chris\r\nmishka_wins = 0\r\nchris_wins = 0\r\n\r\n# Process each round\r\nfor _ in range(z):\r\n mi, ci = map(int, input().split())\r\n if mi > ci:\r\n mishka_wins += 1\r\n elif ci > mi:\r\n chris_wins += 1\r\n\r\n# Determine the winner or declare a draw\r\nif mishka_wins > chris_wins:\r\n print(\"Mishka\")\r\nelif chris_wins > mishka_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\r\na=0\r\nd=0\r\nfor i in range(0,n):\r\n m,c=map(int,input().split())\r\n if m<c:\r\n d=d+1\r\n elif m>c:\r\n a=a+1\r\nif a>d:\r\n print('Mishka')\r\nelif a<d:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\nc = 0\r\nmi = 0\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n if m[0] > m[1]:\r\n mi += 1\r\n elif m[0] < m[1]:\r\n c += 1\r\nif mi > c:\r\n print(\"Mishka\")\r\nelif c > mi:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "t = int(input())\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n \r\n if a>b:\r\n count1 += 1\r\n elif b>a:\r\n count2 += 1\r\n \r\nif count1 > count2:\r\n print(\"Mishka\")\r\nelif count2 > count1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nf = [list(map(int,input().split())) for i in range(n)]\r\nans = 0\r\nans2 = 0\r\nfor i in range(len(f)):\r\n a = f[i][0]\r\n b = f[i][1]\r\n if a > b:\r\n ans += 1\r\n elif b > a:\r\n ans2 += 1\r\nif ans > ans2:\r\n print(\"Mishka\")\r\nelif ans < ans2:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\n\nMishka = 0\nChris = 0\nfor i in range(n):\n a, b = input().split()\n a = int(a)\n b = int(b)\n if(a > b):\n Mishka += 1\n elif(b > a):\n Chris += 1\nif(Mishka > Chris):\n print('Mishka')\nelif(Chris > Mishka):\n print('Chris')\nelse:\n print('Friendship is magic!^^')\n\t \t\t \t \t \t\t \t\t\t \t \t\t\t\t", "a=int(input())\nmw=0\ncw=0\nfor i in range(a):\n m,c=map(int,input().split())\n if m>c:\n mw+=1\n elif c>m:\n cw+=1\nif mw >cw:\n print('Mishka')\nelif mw==cw:\n print('Friendship is magic!^^')\nelse:\n print('Chris')", "def game_result(n, rounds):\r\n mishka_wins = 0\r\n chris_wins = 0\r\n\r\n for m, c in rounds:\r\n if m > c:\r\n mishka_wins += 1\r\n elif c > m:\r\n chris_wins += 1\r\n\r\n if mishka_wins > chris_wins:\r\n return \"Mishka\"\r\n elif chris_wins > mishka_wins:\r\n return \"Chris\"\r\n else:\r\n return \"Friendship is magic!^^\"\r\n\r\n# Read the number of rounds\r\nn = int(input())\r\n\r\n# Read the rounds' descriptions\r\nrounds = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the result of the game\r\nresult = game_result(n, rounds)\r\nprint(result)\r\n", "n = int(input())\r\n\r\ncount_mishka = 0\r\ncount_chris = 0\r\nfor game in range(n):\r\n score_mishka, score_chris = map(int, input().split())\r\n\r\n if score_mishka > score_chris:\r\n count_mishka += 1\r\n elif score_mishka < score_chris:\r\n count_chris += 1\r\n\r\nif count_mishka > count_chris:\r\n print(\"Mishka\")\r\nelif count_mishka < count_chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\ncount=count1=0\r\nfor i in range(t):\r\n x,y=map(int, input().split())\r\n if(x>y):\r\n count+=1\r\n if(y>x):\r\n count1+=1\r\n if(x==y):\r\n count+=1\r\n count1+=1\r\nif(count>count1):\r\n print(\"Mishka\")\r\nif(count1>count):\r\n print(\"Chris\")\r\nif(count==count1):\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\np2w, p1w = 0, 0\r\nfor i in range(n):\r\n p1, p2 = map(int, input().split())\r\n if p1 > p2:\r\n p1w += 1\r\n elif p1 < p2:\r\n p2w += 1\r\nif p2w == p1w:\r\n print(\"Friendship is magic!^^\")\r\nelif p2w > p1w:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Mishka\")", "n=int(input())\r\nmishka=0\r\nchris=0\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n if a>b:\r\n mishka+=1\r\n elif b>a:\r\n chris+=1\r\nif mishka>chris:\r\n print('Mishka')\r\nelif chris>mishka:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n\r\n", "a=int(input())\r\nq=0\r\nw=0\r\nfor i in range(a):\r\n m,k=map(int,input().split())\r\n if m>k:\r\n q+=1\r\n elif k>m:\r\n w+=1\r\nif q==w:\r\n print('Friendship is magic!^^')\r\nelif q>w:\r\n print('Mishka')\r\nelif w>q:\r\n print('Chris')", "a = int(input())\r\ncount1 = 0\r\ncount2 = 0\r\n\r\n\r\nfor i in range(a):\r\n b = list(map(int, input().split()))\r\n if b[0] > b[1]:\r\n count1 += 1\r\n elif b[1] > b[0]:\r\n count2 += 1\r\n\r\n\r\nif count1 == count2:\r\n print('Friendship is magic!^^')\r\n\r\nelif count1 > count2:\r\n print('Mishka')\r\n\r\nelif count2 > count1:\r\n print('Chris')\r\n", "mishka_score = chris_score = 0\r\nfor _ in range(int(input())):\r\n scores = list(map(int, input().split()))\r\n if scores[0] > scores[1]:\r\n mishka_score += 1\r\n elif scores[1] > scores[0]:\r\n chris_score += 1\r\nif mishka_score > chris_score:\r\n print(\"Mishka\")\r\nelif chris_score > mishka_score:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nl = []\r\ns=''\r\nfor i in range(0,n,1):\r\n s = input()\r\n l += s.split()\r\nfor i in range(0,2*n,1):\r\n l[i]=int(l[i])\r\np1 =0\r\np2 =0\r\nfor i in range(0,2*n,2):\r\n if l[i] > l[i+1]:\r\n p1 += 1\r\n elif l[i] < l[i+1] :\r\n p2 +=1\r\nif p1 > p2 :\r\n print(\"Mishka\")\r\nelif p1 < p2 :\r\n print(\"Chris\")\r\nelif p1 == p2 :\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nfirst=0\nsecond=0\nfor i in range(n):\n a,b=input().split()\n a=int(a)\n b=int(b)\n if a>b:\n first+=1\n elif b>a:\n second+=1\nif first>second:\n print(\"Mishka\")\nelif second>first:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n \t \t\t \t \t \t \t\t\t \t \t\t \t\t\t", "n=int(input().strip())\r\na=0\r\nb=0\r\nfor i in range(n):\r\n a1,b1=list(map(int,input().strip().split()))\r\n if a1>b1:\r\n a+=1\r\n elif a1<b1:\r\n b+=1\r\nif a>b:\r\n print('Mishka')\r\nelif a<b:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n=int(input())\r\na=0\r\nb=0\r\nfor i in range(n):\r\n\tx,y=tuple(input().split())\r\n\tif x>y:\r\n\t\ta=a+1\r\n\telif x<y:\r\n\t\tb=b+1\r\nif a>b:\r\n\tprint(\"Mishka\")\r\nelif a==b:\r\n\tprint(\"Friendship is magic!^^\")\r\nelse:\r\n\tprint(\"Chris\")", "x = 0\r\nn = int(input())\r\nfor _ in range(n):\r\n m, c = map(int, input().split())\r\n if m>c:\r\n x += 1\r\n elif m<c:\r\n x -= 1\r\nif x == 0:\r\n print('Friendship is magic!^^')\r\nelif x > 0:\r\n print('Mishka')\r\nelse:\r\n print('Chris')", "a=int(input())\r\nx=0\r\nz=0\r\nfor i in range(a):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n x=x+1\r\n if m<c:\r\n z=z+1\r\nif x>z:\r\n print(\"Mishka\")\r\nelif x<z:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "k=0\r\nk1=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n k=k+1\r\n elif a<b:\r\n k1=k1+1\r\nif k>k1:\r\n print('Mishka')\r\nelif k==k1:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('Chris')\r\n", "n = int(input())\r\nmish = 0\r\nch = 0\r\nwhile n:\r\n n -= 1\r\n m,c = map(int,input().split())\r\n if m > c:\r\n mish += 1\r\n elif c > m:\r\n ch += 1\r\n \r\nif mish > ch:\r\n print(\"Mishka\")\r\nelif ch>mish:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "def main():\r\n a= int(input())\r\n mp, cp = 0, 0\r\n \r\n for _ in range(a):\r\n m, c = [int(i) for i in input().split()]\r\n if m < c:\r\n cp += 1\r\n elif m > c:\r\n mp += 1\r\n if mp == cp:\r\n print(\"Friendship is magic!^^\")\r\n elif mp > cp:\r\n print(\"Mishka\")\r\n else:\r\n print(\"Chris\")\r\n\r\n\r\nmain()", "n = int(input())\r\n\r\nmisha = 0\r\nchrisa = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n\r\n if a > b:\r\n misha += 1\r\n if a < b:\r\n chrisa += 1\r\n\r\nif misha == chrisa:\r\n print('Friendship is magic!^^')\r\nelif misha > chrisa:\r\n print('Mishka')\r\nelif misha < chrisa:\r\n print('Chris')", "def game_result(n, rounds):\r\n mishka_wins = 0\r\n chris_wins = 0\r\n \r\n for round_ in rounds:\r\n mishka, chris = round_\r\n if mishka > chris:\r\n mishka_wins += 1\r\n elif chris > mishka:\r\n chris_wins += 1\r\n \r\n if mishka_wins > chris_wins:\r\n return \"Mishka\"\r\n elif chris_wins > mishka_wins:\r\n return \"Chris\"\r\n else:\r\n return \"Friendship is magic!^^\"\r\n\r\n# Read input from standard input\r\nn = int(input())\r\nrounds = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Compute the result and print to standard output\r\nprint(game_result(n, rounds))\r\n", "num = int(input())\r\ncounter_mishka = 0\r\ncounter_chris = 0\r\nfor i in range(num):\r\n mishka,chris=map(int,input().split())\r\n if mishka > chris:\r\n counter_mishka += 1\r\n elif mishka < chris:\r\n counter_chris += 1\r\nif counter_mishka == counter_chris:\r\n print('Friendship is magic!^^')\r\nelif counter_mishka > counter_chris:\r\n print('Mishka')\r\nelse:\r\n print('Chris')", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn = int(input())\r\nmm = 0\r\ncc = 0\r\nfor i in range(n):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n mm += 1\r\n elif c > m:\r\n cc += 1\r\nif mm > cc:\r\n print(\"Mishka\")\r\nelif cc > mm:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nm_w = 0\r\nc_w = 0\r\n \r\nfor _ in range(n):\r\n mi, ci = map(int, input().split())\r\n if mi > ci:\r\n m_w = m_w + 1\r\n elif mi < ci:\r\n c_w = c_w + 1\r\n \r\nif m_w > c_w:\r\n print(\"Mishka\")\r\nelif c_w > m_w:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "c1,c2 = 0,0\r\nfor _ in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a > b:\r\n c1 += 1\r\n elif b > a:\r\n c2 += 1\r\n\r\nif c1 > c2:\r\n print('Mishka')\r\nelif c2 > c1:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n =int(input())\r\nvm=0\r\nvc=0\r\nni=0\r\nfor i in range(n):\r\n m,c=input().split()\r\n m=int(m)\r\n c=int (c)\r\n if m>c:\r\n vm=vm+1\r\n elif m<c:\r\n vc=vc+1\r\nif vm>vc:\r\n print (\"Mishka\")\r\nelif vm<vc:\r\n print (\"Chris\")\r\nelse:\r\n print (\"Friendship is magic!^^\")", "ma = 0\r\nca = 0\r\nfor i in range(int(input())):\r\n m, c = map(int, input().split())\r\n\r\n if m > c:\r\n ma += 1\r\n elif c > m:\r\n ca += 1\r\n\r\nif ma > ca:\r\n print('Mishka')\r\nelif ca > ma:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\n\r\nwm = 0\r\nwc = 0\r\nd = 0\r\nfor i in range(n):\r\n line = input()\r\n m, c = line.split()\r\n m = int(m)\r\n c = int(c)\r\n if m > c:\r\n wm = wm + 1\r\n if c > m:\r\n wc = wc + 1\r\n if m == c:\r\n d = d + 1\r\n\r\n\r\nif wm == wc:\r\n print(\"Friendship is magic!^^\")\r\nelif wm > wc:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")\r\n", "n=int(input())\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n if a>b:\r\n x=x+1\r\n elif a==b:\r\n x=x+1\r\n y=y+1\r\n else:\r\n y = y + 1\r\n\r\nif x>y:\r\n print(\"Mishka\")\r\nelif x==y:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\nrounds = list()\nfor x in range(n):\n rounds.append(input())\n\nresult = 0\n\nfor x in range(n):\n current_round = rounds[x].split()\n current_round = list(map(int,current_round))\n if current_round[0]>current_round[1]:\n result+=1\n elif current_round[1]>current_round[0]:\n result-=1\n\nif result>0:print(\"Mishka\")\nelif result<0:print(\"Chris\")\nelse:print(\"Friendship is magic!^^\")", "n = int(input())\r\nmw = 0\r\ncw = 0\r\nfor i in range(n):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n mw += 1\r\n elif c > m:\r\n cw += 1\r\nif mw > cw:\r\n print(\"Mishka\")\r\nelif cw > mw:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nmishka = 0\r\nfriend = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n mishka += 1\r\n elif b > a:\r\n friend += 1\r\n \r\nif mishka > friend:\r\n print('Mishka')\r\nelif friend > mishka:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "s=int(input())\r\nMishka=0\r\nChris=0\r\nfor i in range(s):\r\n m =list(map(int,input().split()))\r\n if m[0] > m[1] :\r\n Mishka+=1\r\n\r\n if m[0] < m[1] :\r\n Chris+=1\r\n\r\nif Mishka > Chris :\r\n print(\"Mishka\")\r\nelif Chris > Mishka :\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "c1, c2 = 0, 0\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x > y:\r\n c1 += 1\r\n elif y > x:\r\n c2 += 1\r\nif c1 > c2:\r\n print('Mishka')\r\nelif c1 == c2:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('Chris')", "a = int(input())\r\nm = 0\r\nch = 0\r\nfor i in range(a):\r\n c = list(map(int,input().split()))\r\n if c[0] > c[1]:\r\n m += 1\r\n elif c[0] == c[1]:\r\n ch += 0\r\n m += 0\r\n else:\r\n ch += 1\r\nif m > ch:\r\n print('Mishka')\r\nelif m == ch:\r\n print('Friendship is magic!^^')\r\nelif m < ch:\r\n print('Chris')\r\n\r\n", "n=int(input())\r\nc=0\r\nv=0\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n if x>y:\r\n c+=1\r\n elif y>x:\r\n v+=1\r\nif c>v:\r\n print('Mishka')\r\nelif v>c:\r\n print('Chris')\r\nelif v==c:\r\n print('Friendship is magic!^^')", "n=int(input())\r\nms=0\r\ncs=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if c<m:\r\n ms+=1\r\n elif c>m:\r\n cs+=1\r\n\r\nif ms>cs:\r\n print(\"Mishka\")\r\nelif cs>ms:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "testcase = int(input())\nmishka = 0\nchris = 0\ndraws = 0\n\nwhile(testcase > 0):\n li = list(input().split(\" \"))\n if(li[0] > li[1]):\n mishka = mishka + 1\n elif(li[0] < li[1]):\n chris = chris + 1\n testcase = testcase-1\n\nif(mishka > 0 or chris > 0):\n if(mishka > chris):\n print('Mishka')\n elif(chris > mishka) :\n print('Chris')\n else:\n print('Friendship is magic!^^')\nelse:\n print('Friendship is magic!^^')", "x=int(input())\r\ncount1=0\r\ncount2=0\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n if(a>b):\r\n count1+=1 \r\n if(a<b):\r\n count2+=1 \r\nif(count1>count2):\r\n print(\"Mishka\")\r\nif(count1==count2):\r\n print(\"Friendship is magic!^^\")\r\nif(count1<count2):\r\n print(\"Chris\")", "n=int(input())\r\nmcount=0\r\nccount=0\r\ncount=0\r\nfor i in range(n):\r\n a=input().split(\" \")\r\n m=int(a[0])\r\n c=int(a[1])\r\n if m>c:\r\n mcount+=1\r\n elif c>m:\r\n ccount+=1\r\n else:\r\n count+=0\r\nif mcount>ccount:\r\n print(\"Mishka\")\r\nelif ccount>mcount:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\r\nMishka = 0\r\nchris = 0\r\nfor i in range(n):\r\n m,c = map(int,input().split())\r\n if m > c:\r\n Mishka+=1\r\n elif c > m:\r\n chris +=1\r\nif Mishka > chris:\r\n print(\"Mishka\")\r\nelif chris > Mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nMishka, Chris = 0, 0\nfor i in range(n):\n m, c = [int(x) for x in input().split()]\n if m > c: Mishka += 1\n elif m < c: Chris += 1\n\nif Mishka > Chris: print(\"Mishka\")\nelif Mishka < Chris : print(\"Chris\")\nelse: print(\"Friendship is magic!^^\")\n\t\t \t\t\t\t \t \t \t \t\t \t\t \t", "n = int(input())\r\nx1,x2 = 0,0\r\nfor i in range(n):\r\n x = input().split()\r\n if x[0] > x[1]:\r\n x1 += 1\r\n elif x[0] < x[1]:\r\n x2 += 1\r\n\r\nif x1 > x2:\r\n print(\"Mishka\")\r\nelif x1 < x2:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nwM = 0\r\nwC = 0\r\n\r\nfor i in range(n):\r\n a,b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n\r\n if a>b:\r\n wM+=1\r\n elif a<b:\r\n wC+=1\r\n\r\nif wM>wC:\r\n print(\"Mishka\")\r\nelif wM<wC:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "# https://codeforces.com/problemset/problem/703/A\n\ndef isol(m, c):\n m1 = 0\n c1 = 0\n for i in range(len(m)):\n if m[i] > c[i]:\n m1 += 1\n elif m[i] < c[i]:\n c1 += 1\n if m1 > c1:\n return \"Mishka\"\n elif m1 < c1:\n return \"Chris\"\n else:\n return \"Friendship is magic!^^\"\n\ndef solution():\n n = int(input())\n am = []\n ac = []\n for i in range(n):\n m, c = [int(x) for x in input().split()]\n am.append(m)\n ac.append(c)\n print(isol(am, ac))\n\nsolution()", "t=int(input())\nc_count = 0\nm_count = 0\nfor i in range(t):\n m,c = list(map(int,input().split()))\n if m>c:\n m_count+=1\n elif m<c:\n c_count+=1\n else : \n c_count+=1\n m_count+=1\n\nif m_count > c_count:\n print(\"Mishka\")\n\nelif m_count < c_count:\n print(\"Chris\")\n\nelse:\n print(\"Friendship is magic!^^\")\n\n\t\t\t\t \t\t\t\t\t \t\t \t \t\t", "n = int(input())\r\nMishka = 0\r\nChris = 0\r\nfor i in range(n):\r\n m,c = input().split()\r\n m = int(m)\r\n c = int(c)\r\n if m > c:\r\n Mishka += 1\r\n elif c > m:\r\n Chris += 1\r\n else:\r\n Mishka += 1\r\n Chris += 1\r\nif Mishka > Chris:\r\n print('Mishka')\r\nelif Chris > Mishka:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "m = c = 0\nfor i in range(int(input())):\n a = list(map(int,input().split()))\n if a[1] > a[0]:\n c = c + 1\n elif a[0] > a[1]:\n m = m + 1\n else:\n continue\nif m > c:\n print(\"Mishka\")\nelif c > m:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")", "t = int(input(\"\"))\r\nt1 = t\r\nm1 = 0 \r\nc1 = 0\r\nfor i in range(t):\r\n while t == t1:\r\n m, c = map(int, input().split())\r\n if m > c:\r\n m1 += 1\r\n elif m < c :\r\n c1 += 1\r\n else: m == c\r\n break\r\nif m1 > c1:\r\n print(\"Mishka\")\r\nelif m1 == c1:\r\n print(\"Friendship is magic!^^\")\r\nelif m1 < c1 :\r\n print(\"Chris\") \r\n", "import sys\r\ninput=sys.stdin.readline\r\nt=int(input())\r\ncx,cy=0,0\r\nfor _ in range(t):\r\n x,y=map(int,input().split())\r\n if (x>y):\r\n cx+=1\r\n elif(x<y):\r\n cy+=1\r\n elif (x==y):\r\n cx+=1\r\n cy+=1\r\nif (cx==cy):\r\n print(\"Friendship is magic!^^\")\r\nelif (cx>cy):\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "\r\n\r\nrounds = int(input())\r\n\r\nm, c = 0, 0\r\nfor _ in range(rounds):\r\n\r\n mis, ch = map(int, (input().split()))\r\n if (mis > ch): m += 1\r\n elif (ch > mis): c += 1\r\n\r\nif (m > c): print(\"Mishka\")\r\nelif (c > m): print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\") ", "c1=0\r\nc2=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if(a > b):\r\n c1+=1\r\n elif(a < b):\r\n c2+=1\r\nif(c1 > c2):\r\n print(\"Mishka\")\r\nelif(c1 == c2):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "m, c = 0, 0\r\n\r\nfor _ in range(int(input())):\r\n m1, c1 = map(int,input().split())\r\n if m1 > c1:\r\n m += 1\r\n elif m1 < c1:\r\n c += 1\r\n \r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "N = int(input())\r\na, b = 0, 0\r\nwhile N > 0:\r\n m, c = map(int, input().split())\r\n if m > c: a += 1;\r\n elif m < c: b += 1;\r\n N -= 1\r\nif a > b: print(\"Mishka\")\r\nelif a < b: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")", "n=int(input())\r\ncount_mishka=0\r\ncount_chris=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if(m>c):\r\n count_mishka+=1\r\n if(m<c):\r\n count_chris+=1\r\nif(count_mishka>count_chris):\r\n print('Mishka')\r\nelif(count_mishka<count_chris):\r\n print('Chris')\r\nelse:\r\n print(\"Friendship is magic!^^\")", "####### A. Mishka and Game\r\n\r\nn = int(input())\r\ndescription = [input().split() for _ in range(n)]\r\n# print(description)\r\nMishka = 0\r\nChris = 0\r\nFriendship = 0\r\n\r\nfor i in range(len(description)):\r\n if description[i][0] > description[i][1]:\r\n Mishka += 1\r\n elif description[i][0] < description[i][1]:\r\n Chris += 1\r\n else:\r\n Friendship += 1\r\n\r\nif Mishka > Chris:\r\n print(\"Mishka\")\r\nelif Mishka < Chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "numberOfRounds = int(input())\r\ncM = 0\r\ncC = 0\r\n\r\nfor i in range(numberOfRounds):\r\n m,c = input().split()\r\n m = int(m)\r\n c = int(c)\r\n if(m>c):\r\n cM+=1\r\n elif(c>m):\r\n cC+=1\r\nif(cM>cC):\r\n print(\"Mishka\")\r\nelif(cM<cC):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nm_wins = 0 \r\nc_wins = 0 \r\n\r\nfor i in range(n):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n m_wins += 1\r\n elif c > m:\r\n c_wins += 1\r\n\r\nif m_wins > c_wins:\r\n print(\"Mishka\")\r\nelif c_wins > m_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "M=0\r\nC=0\r\nfor _ in range(int(input())):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n M+=1\r\n elif c>m:\r\n C+=1\r\nif M>C:\r\n print('Mishka')\r\nelif C>M:\r\n print('Chris')\r\nelif M==C:\r\n print('Friendship is magic!^^')", "n = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n mi,ch = input().split()\r\n mi = int(mi)\r\n ch = int(ch)\r\n if mi>ch:\r\n m+=1\r\n elif ch>mi:\r\n c += 1\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\no=0\r\nt=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if b<c:\r\n o+=1\r\n elif b>c:\r\n t+=1\r\nif o>t:\r\n print(\"Chris\")\r\nelif o<t:\r\n print(\"Mishka\")\r\nelif o==t:\r\n print(\"Friendship is magic!^^\")\r\n \r\n\r\n", "import sys\r\nt = int(input())\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(t):\r\n n, m = map(int, input().split())\r\n if n > m:\r\n count1 += 1\r\n elif n < m:\r\n count2 += 1\r\n\r\nif count1 > count2:\r\n print(\"Mishka\")\r\nelif count1 < count2:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n \r\n x,y=map(int,input().split())\r\n if x>y:\r\n m+=1\r\n elif x<y:\r\n c+=1\r\n else:\r\n m+=1\r\n c+=1\r\nif (m>c):\r\n print(\"Mishka\")\r\nelif (c>m):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nm,c = 0,0\nfor i in range(n):\n s = [int(i) for i in input().split()]\n if s[0]>s[1]:\n m+=1\n elif s[0]<s[1]:\n c+=1\nif m>c:\n print(\"Mishka\")\nelif m<c:\n print(\"Chris\")\nelif m==c:\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nc1=0\r\nm1=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m > c:\r\n m1+=1\r\n elif c>m:\r\n c1+=1\r\n\r\nif c1 > m1:\r\n print(\"Chris\")\r\nelif m1 > c1:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nmw = 0\r\ncw = 0\r\nfor _ in range(n):\r\n mi,ci = map(int,input().split())\r\n if mi > ci:\r\n mw += 1\r\n elif mi < ci:\r\n cw += 1\r\nif mw > cw:\r\n print(\"Mishka\")\r\nelif mw < cw:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "def mishka_and_game_a():\r\n x = 0\r\n for _ in range(int(input())):\r\n m,c = map(int,input().split())\r\n if(m!=c):\r\n if(m>c):\r\n x += 1\r\n else:\r\n x -= 1\r\n if(x==0):\r\n print('Friendship is magic!^^')\r\n elif(x>0):\r\n print('Mishka')\r\n else:\r\n print('Chris')\r\n\r\nif __name__ == '__main__':\r\n import math\r\n mishka_and_game_a()", "n = int(input())\r\nic = mc = 0\r\nfor i in range(n):\r\n m,c=map(int, input().split())\r\n i+=1\r\n if m<c:\r\n ic+=1\r\n if m>c:\r\n mc+=1\r\n else:continue\r\nif ic>mc:\r\n print('Chris')\r\nif ic<mc:\r\n print('Mishka')\r\nelif ic==mc:print('Friendship is magic!^^')", "t=int(input())\r\nc=0\r\nd=0\r\nfor i in range(t):\r\n x,y=map(int,input().split())\r\n \r\n if(x>y):\r\n c=c+1\r\n elif(x<y):\r\n d=d+1\r\nif(c>d):\r\n print(\"Mishka\")\r\nelif(c<d):\r\n print(\"Chris\")\r\nelif(c==d):\r\n print(\"Friendship is magic!^^\")\r\n\r\n \r\n \r\n\r\n", "n = int(input())\r\n\r\nmishka_count = 0\r\nchris_count = 0\r\n\r\nfor i in range(n):\r\n mishka, chris = map(int, input().split(\" \"))\r\n\r\n if mishka > chris:\r\n mishka_count += 1 \r\n\r\n elif mishka < chris:\r\n chris_count += 1\r\n\r\n elif mishka == chris:\r\n continue\r\n\r\nif mishka_count > chris_count:\r\n print(\"Mishka\")\r\nelif mishka_count < chris_count:\r\n print(\"Chris\")\r\nelif mishka_count == chris_count:\r\n print(\"Friendship is magic!^^\")", "# URL: https://codeforces.com/problemset/problem/703/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\ntm, tc = 0, 0\nfor _ in range(int(inp())):\n m, c = map(int, inp().split())\n tm += m > c\n tc += m < c\nif tm > tc:\n out(\"Mishka\")\nelif tm < tc:\n out(\"Chris\")\nelse:\n out(\"Friendship is magic!^^\")\n", "n = int(input())\r\nx, y = 0, 0\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n if a>b:\r\n x+=1\r\n elif b>a:\r\n y+=1\r\n\r\nif x>y:\r\n print('Mishka')\r\nelif y>x:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "\"\"\"\r\n ⢰⡖⣶⣆⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣰⣶⣶⡆\r\n⠀⠀⠘⠓⠛⡟⢻⣿⣤⣤⠀⠀⣠⣤⣼⣿⣿⣧⣤⣄⠀⠀⣤⣤⣿⣿⣿⠛⠛⠃\r\n⠀⠀⠀⠀⠀⠉⠉⢹⠈⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠉⠉\r\n⠀⠀⠀⣀⣀⡖⢲⣾⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣶⣶⣀⣀\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⠃⠀⠘⢻⣿⣿⣿⣿⣿⣿⡟⠃⠀⠘⣿⣿⣿⣿⣿⣿⡇\r\n⢰⢲⣾⣷⣿⣿⣿⣿⣿⣆⣀⣰⣾⣿⣿⣿⣿⣿⣿⣷⣆⣀⣰⣿⣿⣿⣿⣿⣿⣷⣶⡆\r\n⢸⢸⣿⠛⠛⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⠛⣿⣿⡇\r\n⢸⢸⣿⠀⠀⠉⠉⠹⠿⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠏⠉⠉⠀⠀⣿⣿⡇\r\n⢸⣸⢿⣀⠀⠀⠀⠀⠀⠀⠛⠛⢻⣿⣿⣿⣿⣿⣿⡟⠛⠛⠀⠀⠀⠀⠀⠀⣀⣿⣿⡇\r\n⠀⢸⢀⣿⣦⣤⡄⠀⠀⠀⠀⠀⠀⠀⠘⠛⠛⠃⠀⠀⠀⠀⠀⠀⠀⢠⣤⣴⣿⣿⡇\r\n⠀⠈⠉⠉⠧⠽⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⠿⠿⠉⠉⠁ ⠀⠀\r\n ⣀⣀⣤⣤⣤⡀\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀ ⣶⣿⣿⣿⣿⣿⠇\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⢀⣸⣿⣿⣿⣿⣿⣿⣿\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣶⣾⣿⣿⣿⣿⣿⡿⠟\r\n ⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣀⣾⣿⣿⣿⣿⣿⣿⠋⠁\r\n ⠀⠀⢸⣿⣿⣿⣤⠀⣤⣿⣿⣿⣿⣿⣿⠛\r\n ⠀⠀⠸⢿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠏⠉\r\n ⠀⠀⠀⠸⠿⣿⣿⣿⣿⣿⣿⣏⣤⣀\r\n ⠀⠀⠀⣤⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿\r\n ⢰⣶⣾⣿⣿⣿⡟⠃⠛⠛⢻⡿⠿⠛\r\n ⢸⣿⣿⣿⣿⠏\r\n ⠈⠛⠛⠉⠉\r\n\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\"\"\"\r\ncount = 0\r\ncount1 = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n count += 1\r\n elif b > a:\r\n count1 += 1\r\nans = ''\r\nif count == count1:\r\n ans = \"Friendship is magic!^^\"\r\nelif count > count1:\r\n ans = \"Mishka\"\r\nelse:\r\n ans = \"Chris\"\r\nprint(str(ans))\r\n", "n = int(input())\r\ncounter = []\r\nfor i in range(n):\r\n m, k = map(int, input().split())\r\n if m > k:\r\n counter.append(1)\r\n if m < k:\r\n counter.append(2)\r\nif counter.count(1) > counter.count(2):\r\n print('Mishka')\r\nif counter.count(1) < counter.count(2):\r\n print('Chris')\r\nif counter.count(1) == counter.count(2):\r\n print('Friendship is magic!^^')", "n = int(input())\r\na = 0\r\nb = 0\r\nfor i in range(n):\r\n p,q = map(int, input().split())\r\n if p > q:\r\n a+= 1\r\n elif p < q:\r\n b += 1\r\n else:\r\n continue\r\nif a > b:\r\n print(\"Mishka\")\r\nelif b > a:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "Mishka=0 \r\nChris=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n Mishka+=1\r\n elif b>a:\r\n Chris+=1\r\nif Mishka > Chris:\r\n print(\"Mishka\")\r\nelif Mishka < Chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\nmish = 0\r\nchr = 0\r\nfor i in range(n):\r\n dices = input().split()\r\n if (int(dices[0]) > int(dices[1])):\r\n mish += 1\r\n elif (int(dices[0]) < int(dices[1])):\r\n chr += 1\r\n \r\nif (mish > chr):\r\n print(\"Mishka\")\r\nelif (chr > mish):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "import sys\r\n\r\na = int(input(\"\"))\r\nc = 0\r\nd = 0\r\nfor i in range(0, a):\r\n b = [int(j) for j in sys.stdin.readline().split()]\r\n if b[0] > b[1]:\r\n c += 1\r\n elif b[0] < b[1]:\r\n d += 1\r\nif c > d:\r\n print(\"Mishka\")\r\nelif d > c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "t = int(input())\r\ncount_a=0\r\ncount_b=0\r\nfor i in range(t):\r\n a,b=list(map(int, input().split()))\r\n if a>b:\r\n count_a+=1\r\n elif b>a:\r\n count_b+=1\r\nif count_a>count_b:\r\n print(\"Mishka\")\r\nelif count_a<count_b:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "def main():\r\n n = int(input())\r\n mishka=0\r\n chris=0\r\n while(n>0):\r\n m,c=map(int,input().split())\r\n if(m>c):\r\n mishka+=1\r\n elif(c>m):\r\n chris+=1\r\n n=n-1\r\n if(mishka == chris):\r\n print(\"Friendship is magic!^^\")\r\n elif(mishka>chris):\r\n print(\"Mishka\")\r\n else:\r\n print(\"Chris\")\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "m=0\r\nc=0\r\nfor i in range(0,int(input())):\r\n\tn=input() \r\n\tm1=int(n.split()[0])\r\n\tc1=int(n.split()[1])\r\n\tif m1>c1:\r\n\t\tm+=1\r\n\telif c1>m1:\r\n\t\tc+=1\r\nif m>c:\r\n\tprint(\"Mishka\")\r\nelif c>m:\r\n\tprint(\"Chris\")\r\nelse:\r\n\tprint(\"Friendship is magic!^^\")\r\n", "n = int(input()) # Number of game rounds\nmishka_wins = 0 # Counter for Mishka's wins\nchris_wins = 0 # Counter for Chris's wins\n\n# Iterate over each round\nfor _ in range(n):\n mi, ci = map(int, input().split()) # Values on dice upper face\n \n # Check the winner of the round\n if mi > ci:\n mishka_wins += 1\n elif ci > mi:\n chris_wins += 1\n\n# Determine the result of the game\nif mishka_wins > chris_wins:\n print(\"Mishka\")\nelif chris_wins > mishka_wins:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n\t\t\t\t\t \t\t\t\t\t \t \t\t\t\t\t\t\t \t\t\t\t\t\t \t", "n=int(input())\r\nmc=0\r\ncc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n mc=mc+1 \r\n elif a<b:\r\n cc=cc+1 \r\nif mc>cc:\r\n print(\"Mishka\")\r\nelif mc==cc:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")\r\n ", "from sys import stdin\r\naCum,b = 0,0\r\n\r\nfor _ in range(int(stdin.readline().strip())):\r\n a = list(map(int,stdin.readline().split()))\r\n if a[0]>a[1]:\r\n aCum+=1\r\n elif a[0]<a[1]:\r\n b += 1\r\n else:aCum+= 1;b+=1\r\nif aCum>b:\r\n print(\"Mishka\")\r\nelif aCum<b:\r\n print(\"Chris\")\r\nelse:print(\"Friendship is magic!^^\")", "n=int(input())\r\n\r\nMishka=0\r\nChris=0\r\nfor i in range(1,n+1):\r\n m=\"\"\r\n m=(input())\r\n \r\n m=m.split(\" \")\r\n if m[0]>m[1]:\r\n Mishka+=1\r\n \r\n \r\n elif m[0]<m[1]:\r\n Chris+=1\r\n \r\n else:\r\n Chris+=1\r\n Mishka+=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 Mishka>Chris:\r\n print(\"Mishka\")\r\nelif Mishka<Chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\" )", "n=int(input())\r\ncount_m=0\r\ncount_c=0\r\ndraw=0\r\nfor i in range (n):\r\n m,c=list(map(int,input().split()))\r\n if m > c:\r\n count_m+=1\r\n elif c > m:\r\n count_c+=1\r\n elif m == c:\r\n draw+=1\r\nif count_m > count_c :\r\n print('Mishka')\r\nelif count_c > count_m :\r\n print('Chris')\r\nelse :\r\n print('Friendship is magic!^^')\r\n \r\n \r\n", "t = int(input())\r\nm=0\r\no=0\r\nfor i in range(t):\r\n \r\n round = list(map(int,input().split()))\r\n if round[0]>round[1]:\r\n m+=1\r\n elif round[0]<round[1]:\r\n o+=1\r\n \r\nif m>o:print('Mishka')\r\nelif m<o:print('Chris')\r\nelse:print('Friendship is magic!^^')\r\n", "c,d = 0,0\r\nfor i in range(int(input())):\r\n a,b = list(map(int,input().split()))\r\n if a > b:\r\n c += 1\r\n if a < b:\r\n d += 1\r\nprint('Mishka' if c > d else 'Chris' if c < d else 'Friendship is magic!^^')", "def compare(listt):\r\n mishka =0\r\n chris = 0 \r\n\r\n for item in listt:\r\n if item[0] > item[1]:\r\n mishka+=1\r\n elif item[0] < item[1]:\r\n chris+=1\r\n \r\n \r\n if mishka > chris:\r\n print(\"Mishka\")\r\n elif mishka < chris:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")\r\n\r\nn = int(input())\r\nlistt = []\r\nfor i in range (n):\r\n first,second = list(map(int,input().split()))\r\n listt.append([first,second])\r\n\r\ncompare(listt) ", "# LUOGU_RID: 101608188\nc = 0\r\nfor s in [*open(0)][1:]:\r\n a, b = map(int, s.split())\r\n if a > b:\r\n c += 1\r\n elif a != b:\r\n c -= 1\r\nprint(c == 0 and 'Friendship is magic!^^' or c < 0 and 'Chris' or 'Mishka')\r\n", "a=int(input())\r\nb=0\r\ncnt=0\r\nfor i in range(a):\r\n x,y=map(int,input().split())\r\n if x>y:\r\n b+=1\r\n elif y>x:\r\n cnt+=1\r\nif b==cnt:\r\n print(\"Friendship is magic!^^\")\r\nelif b>cnt:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "t=int(input ())\r\nn=0\r\nd=0\r\n\r\nfor i in range(t):\r\n m,c=map(int,input().split())\r\n \r\n if m>c:\r\n n+=1\r\n elif m<c:\r\n d+=1\r\n elif m==c:\r\n n+=0\r\n d+=0\r\n \r\nif n>d:\r\n print(\"Mishka\")\r\nelif n<d:\r\n print(\"Chris\")\r\nelif n==d:\r\n print(\"Friendship is magic!^^\")", "n=input()\nn=int(n)\n\nMishka=0\nChris=0\nfor i in range(n):\n m,c=input().split()\n m=int(m)\n c=int(c)\n if m>c :\n Mishka=Mishka+1\n elif c>m:\n Chris=Chris+1\n\nif Mishka>Chris :\n print(\"Mishka\")\nelif Chris>Mishka:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n\n\n\t \t\t \t \t\t\t\t \t \t\t \t \t\t\t", "t = int(input())\r\nt2 = t\r\nM=0\r\nC=0\r\ndraw=0\r\nwhile t > 0:\r\n m, c = map(int, input().split())\r\n if (m > c) :\r\n M += 1\r\n elif (m < c):\r\n C += 1\r\n elif (m == c):\r\n draw += 1\r\n t -= 1\r\n \r\nif(draw== t2 or M==C):\r\n print(\"Friendship is magic!^^\")\r\nelif(M>C) :\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "t=int(input())\r\nnew=[]\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n new.append(\"mishika\")\r\n elif a<b:\r\n new.append(\"chris\")\r\n else:\r\n new.append(\"equal\")\r\nc1=new.count(\"mishika\")\r\nc2=new.count(\"chris\")\r\n\r\nif(c1>c2):\r\n print(\"Mishka\")\r\nelif(c1<c2):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nmisha=0\r\nchris=0\r\nfor i in range(0,n,1):\r\n x,y=map(int,input().split())\r\n if x>y:\r\n misha+=1\r\n elif y>x:\r\n chris+=1\r\nif misha>chris:\r\n print(\"Mishka\")\r\nelif(chris>misha):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nmishka = 0\r\nchris = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n if a<b:\r\n chris = chris + 1\r\n elif a>b:\r\n mishka = mishka + 1\r\nif chris>mishka:\r\n print(\"Chris\")\r\nelif chris == mishka:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Mishka\")", "import math\r\nimport collections\r\n\r\nif __name__ == '__main__':\r\n tc = int(input())\r\n chris = 0\r\n mish = 0\r\n for _ in range(tc):\r\n t = tuple(int(e) for e in input().split(\" \"))\r\n if t[0] > t[1]:\r\n mish+=1\r\n if t[1] > t[0]:\r\n chris+=1\r\n if chris > mish:\r\n print(\"Chris\")\r\n elif mish > chris:\r\n print(\"Mishka\")\r\n else:\r\n print(\"Friendship is magic!^^\")", "import math\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\nn = readint()\r\n\r\nmishka, chris = 0, 0\r\n\r\nfor _ in range(n):\r\n\r\n m, c = readarray(int)\r\n\r\n if m > c:\r\n mishka += 1\r\n elif c > m:\r\n chris += 1\r\n\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif chris > mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nm_score = 0\r\nc_score = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n m_score += 1\r\n elif b > a:\r\n c_score += 1\r\n\r\nif m_score > c_score:\r\n print(\"Mishka\")\r\nelif c_score > m_score:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "def solve():\r\n n = int(input())\r\n m = 0\r\n c = 0\r\n\r\n for i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n if a > b:\r\n m += 1\r\n elif a < b:\r\n c += 1\r\n else:\r\n m += 1\r\n c += 1\r\n\r\n if i == n - 1:\r\n if m > c:\r\n print(\"Mishka\")\r\n elif m < c:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\n\r\nfor _ in range(T):\r\n solve()\r\n", "n = int(input())\nx = 0;\ny = 0\nfor i in range(n):\n mi, ci = input().split()\n mi = int(mi);\n ci = int(ci)\n if mi > ci:\n x += 1\n elif ci > mi:\n y += 1\nif x > y:\n print(\"Mishka\")\nelif y > x:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n\t \t \t \t\t\t\t \t \t\t \t \t\t \t\t\t", "ca,cb = 0,0\r\nt = int(input())\r\nwhile t!=0:\r\n a,b = map(int,input().split())\r\n if a>b:\r\n ca = ca + 1\r\n if b>a:\r\n cb = cb + 1\r\n t-=1\r\nif ca > cb:\r\n print(\"Mishka\")\r\nelif cb > ca:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n s = input()\r\n if s[0] > s[2]:\r\n count += 1\r\n elif s[0] < s[2]:\r\n count -= 1\r\n else:\r\n count += 0\r\nif count > 0:\r\n print('Mishka')\r\nelif count < 0:\r\n print('Chris')\r\nelif count == 0:\r\n print('Friendship is magic!^^')", "z=0\r\nfor _ in[*open(0)][1:]:a,b=map(int,_.split());z+=1*(a>b)or-1*(b>a)\r\nprint([[\"Mishka\",\"Chris\"][z<0],\"Friendship is magic!^^\"][z==0])", "m = 0\nc = 0\n\nn = int(input())\nfor _ in range(n):\n mishka, chris = list(map(lambda x:int(x),input().split(' ')))\n if(mishka>chris):\n m += 1\n elif(mishka<chris):\n c += 1\nif(m>c):\n print('Mishka')\nelif(m<c):\n print('Chris')\nelse:\n print('Friendship is magic!^^')", "n,m = 0,0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if(a==b):\r\n pass\r\n elif(a<b):\r\n m += 1\r\n else:\r\n n += 1\r\nif(n>m):\r\n print(\"Mishka\")\r\nelif(n==m):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\r\na=0\r\nb=0\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n if (x>y):\r\n a=a+1\r\n elif (y>x):\r\n b=b+1\r\nif (a==b):\r\n print(\"Friendship is magic!^^\")\r\nelif (a>b):\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")\r\n\r\n \r\n", "def func2(n,scores):\r\n mishka,chris = 0,0\r\n for score in scores:\r\n if score[0]>score[1]:\r\n mishka+=1\r\n elif score[1]>score[0]:\r\n chris+=1\r\n if mishka>chris:\r\n return \"Mishka\"\r\n elif chris>mishka:\r\n return \"Chris\"\r\n else:\r\n return \"Friendship is magic!^^\"\r\nn = int(input())\r\nscores = []\r\nfor i in range(n):\r\n m,c = map(int,input().split())\r\n scores.append((m,c))\r\nprint(func2(n,scores))", "a = int(input())\r\nb = 0\r\nc = 0\r\nd = 0\r\ne = 0\r\nf = 0\r\nfor i in range(a):\r\n b, c = map(int, input().split())\r\n if b < c:\r\n d += 1\r\n elif b > c:\r\n f += 1\r\nif d > f:\r\n print('Chris')\r\nelif f > d:\r\n print('Mishka')\r\nelse:\r\n print(\"Friendship is magic!^^\")", "m = 0\r\nc = 0\r\nfor n in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a>b:\r\n m+=1\r\n if b>a:\r\n c+=1\r\nif m==c:\r\n print(\"Friendship is magic!^^\")\r\nelif m>c:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n = int(input()) # количество раундов игры\r\n\r\ncounter_mi = 0 # счётчик побед Мишки\r\ncounter_ci = 0 # счётчик побед Криса\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n counter_mi += 1\r\n if a < b:\r\n counter_ci += 1\r\n\r\nif counter_mi > counter_ci:\r\n print('Mishka')\r\nif counter_mi < counter_ci:\r\n print('Chris')\r\nif counter_mi == counter_ci:\r\n print('Friendship is magic!^^')", "n=int(input())\r\nans,sum=0,0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n ans+=1\r\n if a==b:\r\n ans+=0\r\n if a<b:\r\n sum+=1\r\nif ans>sum:\r\n print('Mishka')\r\nelif ans==sum:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('Chris')", "t = int(input())\r\na = 0\r\nb = 0\r\n\r\nc = 0\r\nfor i in range(t):\r\n a, b = input().split()\r\n if a == b:\r\n continue\r\n elif a > b:\r\n c += 1\r\n else:\r\n c -= 1\r\n\r\nif c == 0:\r\n print(\"Friendship is magic!^^\")\r\nelif c > 0:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")\r\n", "t=int(input())\r\nmis=0\r\nchis=0\r\nfor _ in range(t):\r\n a1,b1=input().split()\r\n a=int(a1)\r\n b=int(b1)\r\n if(a>b):\r\n mis=mis+1\r\n elif(a==b):\r\n mis=mis\r\n chis=chis\r\n else:\r\n chis=chis+1\r\n\r\nif(mis>chis):\r\n print(\"Mishka\")\r\nelif(mis==chis):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "n = int(input())\na = 0\nb = 0\nfor i in range(n):\n num1, num2 = input().split()\n num1 = int(num1)\n num2 = int(num2)\n if num1 > num2:\n a += 1\n elif num2 > num1:\n b += 1\n\nif a > b:\n print(\"Mishka\")\nelif b > a:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n \n\t \t \t\t\t \t\t\t \t \t \t\t\t\t \t \t\t", "cm=0\r\ncc=0\r\nfor i in range(int(input())):\r\n\tm,c=map(int,input().split())\r\n\tif m>c:\r\n\t\tcm=cm+1\r\n\telif c>m:\r\n\t\tcc=cc+1\r\n\telse:\r\n\t\tcm=cm+1\r\n\t\tcc=cc+1\r\nif cc>cm:\r\n\tprint(\"Chris\")\r\nelif cm>cc:\r\n\tprint(\"Mishka\")\r\nelse:\r\n\tprint(\"Friendship is magic!^^\")", "m=0\r\nc=0\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if(x>y):\r\n m=m+1\r\n elif(y>x):\r\n c=c+1\r\n\r\nif(m>c):\r\n print(\"Mishka\")\r\nelif(m==c):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "a = int(input())\r\nb, c = 0, 0\r\nfor i in range(a):\r\n d, e = map(int, input().split())\r\n if (max(b, c) < (a/2)+1):\r\n if d > e:\r\n b += 1\r\n elif e > d:\r\n c += 1\r\nif b > c:\r\n print('Mishka')\r\nelif c > b:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\nm_count = 0\r\nc_count = 0\r\nfor i in range(n):\r\n score = list(map(int, input().split()))\r\n if score[0] > score[1]:\r\n m_count += 1\r\n elif score[1] > score[0]:\r\n c_count += 1\r\nif m_count > c_count:\r\n print('Mishka')\r\nelif c_count > m_count:\r\n print('Chris')\r\nelif c_count == m_count:\r\n print('Friendship is magic!^^')", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n b=input().split()\r\n b[0]=int(b[0])\r\n b[1]=int(b[1])\r\n if(b[0]>b[1]):\r\n c=c+1\r\n elif(b[1]>b[0]):\r\n c=c-1\r\nif(c==0):\r\n print(\"Friendship is magic!^^\");\r\nelif(c>0):\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")\r\n", "a=int(input())\r\nm=0\r\nc=0\r\nfor i in range(a):\r\n x,y=map(int,input().split())\r\n if(x>y):\r\n m+=1\r\n elif(x==y):\r\n m+=1\r\n c+=1\r\n else:\r\n c+=1\r\nif(m>c):\r\n print(\"Mishka\")\r\nelif(m==c):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "x=int(input())\r\nc,d=0,0\r\nfor i in range(x):\r\n y=input()\r\n l=y.split(\" \")\r\n a,b=int(l[0]),int(l[1])\r\n if a>b:\r\n c+=1\r\n elif a<b:\r\n d+=1\r\nif c>d:\r\n print(\"Mishka\")\r\nelif c<d:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nM = 0\nC = 0\n\nfor i in range(n):\n f, b = input().split()\n f = int(f)\n b = int(b)\n if f > b:\n M += 1\n elif f < b:\n C += 1\n\nif M > C:\n print(\"Mishka\")\nelif C > M:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n \t \t\t\t\t \t\t\t \t\t \t \t\t\t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n ROUND_RESULTS:list[list[int]] = [list(map(int, input().split())) for _ in range(int(input()))]\r\n\r\n\r\n mishkaWinCount:int = 0\r\n for roundResult in ROUND_RESULTS :\r\n if roundResult[0] > roundResult[1] : mishkaWinCount += 1\r\n elif roundResult[0] < roundResult[1] : mishkaWinCount -= 1\r\n \r\n \r\n message:str = \"\"\r\n if mishkaWinCount == 0 : message = \"Friendship is magic!^^\"\r\n elif mishkaWinCount > 0 : message = \"Mishka\"\r\n else : message = \"Chris\"\r\n\r\n print(message)\r\n \r\nmain()", "n=int(input())\r\nmis=0\r\ncri=0\r\nfor i in range(1, n+1):\r\n m,c=map(int,input().split()) \r\n if m>c:\r\n mis+=1\r\n elif c>m:\r\n cri+=1\r\n elif m==c:\r\n mis+=0\r\n cri+=0\r\nif mis==cri:\r\n print('Friendship is magic!^^')\r\nelif mis>cri:\r\n print('Mishka')\r\nelif cri>mis:\r\n print('Chris')", "n= int(input())\r\nsum=0\r\nfor i in range(n):\r\n x,y =list(map(int,input().split()))\r\n sum+=x>y\r\n sum-=x<y\r\nprint('Mishka' if sum>0 else ['Friendship is magic!^^','Chris'][sum<0])", "n = int(input())\r\ncount_m = 0\r\ncount_c = 0\r\nfor i in range(n):\r\n m , c = input().split()\r\n if m > c:\r\n count_m += 1\r\n elif m < c:\r\n count_c += 1\r\nif count_m > count_c:\r\n print(\"Mishka\")\r\nelif count_m < count_c:\r\n print(\"Chris\")\r\nelif count_m == count_c:\r\n print(\"Friendship is magic!^^\")", "def determine_winner(n, rounds):\r\n mishka_wins = 0\r\n chris_wins = 0\r\n \r\n for m, c in rounds:\r\n if m > c:\r\n mishka_wins += 1\r\n elif c > m:\r\n chris_wins += 1\r\n \r\n if mishka_wins > chris_wins:\r\n return \"Mishka\"\r\n elif chris_wins > mishka_wins:\r\n return \"Chris\"\r\n else:\r\n return \"Friendship is magic!^^\"\r\n\r\n# Read the number of game rounds\r\nn = int(input().strip())\r\n\r\nrounds = []\r\n# Read rounds descriptions\r\nfor _ in range(n):\r\n m, c = map(int, input().strip().split())\r\n rounds.append((m, c))\r\n\r\n# Determine the winner of the game and print the result\r\nprint(determine_winner(n, rounds))", "n=int(input())\r\ncount_a=0\r\ncount_b=0 \r\n\r\nwhile n>0:\r\n\r\n a,b=input().split()\r\n a,b=int(a),int(b)\r\n\r\n if a>b:\r\n count_a+=1 \r\n elif b>a:\r\n count_b+=1\r\n elif b==a:\r\n count_a+=1\r\n count_b+=1\r\n\r\n n-=1 \r\n\r\nif count_a>count_b:\r\n print('Mishka')\r\nelif count_b>count_a:\r\n print('Chris')\r\nelif count_a==count_b:\r\n print('Friendship is magic!^^')", "c=0\r\nr=0\r\n\r\n\r\nfor _ in range(int(input())):\r\n a ,b = map(int,input().split())\r\n \r\n if a > b:\r\n c+=1\r\n if b > a:\r\n r+=1\r\n else:\r\n pass\r\n \r\nif c > r:\r\n print(\"Mishka\")\r\nif r > c:\r\n print(\"Chris\")\r\nif r == c:\r\n print(\"Friendship is magic!^^\" )\r\n ", "t = int(input())\r\nk1,k2 = 0,0\r\nwhile t:\r\n m,c = map(int,input().split())\r\n if m>c:\r\n k1 += 1\r\n elif c>m:\r\n k2 += 1\r\n t -= 1\r\nif k1==k2:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Mishka\" if k1>k2 else \"Chris\")\r\n", "t=int(input())\r\nm=c=0\r\nfor i in range(t):\r\n d,f=map(int,input().split())\r\n if(d>f):\r\n m+=1\r\n elif(d<f):\r\n c+=1\r\n else:\r\n continue\r\nif(m>c):\r\n print(\"Mishka\")\r\nelif(m<c):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\ncnt1=0\r\ncnt2=0\r\nfor _ in range(t):\r\n m,n=map(int,input().split())\r\n \r\n if(m>n):\r\n cnt1+=1\r\n elif(m<n):\r\n cnt2+=1\r\n\r\nif(cnt1>cnt2):\r\n print(\"Mishka\")\r\n \r\nelif(cnt1<cnt2):\r\n print(\"Chris\")\r\n \r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n \r\n ", "from math import *\r\n'''@avtor---NABIEVMEHRUBON---'''\r\nh = 'hello'\r\nf = 'abcdefghijklmnopqrstuvwxyz'\r\nt = int(input())\r\nx = 0\r\ny = 0\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n if a > b: x += 1\r\n elif a == b:\r\n y += 1\r\n x += 1\r\n else:\r\n y += 1\r\nif x == y:print('Friendship is magic!^^')\r\nelif x > y:print('Mishka')\r\nelif x < y:print('Chris')\r\n''' \r\n4 1\r\n2 6\r\n4 2\r\n2 5\r\n5 2\r\n3 5\r\n5 2\r\n1 5\r\n'''\r\n", "mishka = 0\r\nchris = 0\r\nfor c in range(int(input())):\r\n m, c = map(int, input().split())\r\n if m>c : mishka+=1\r\n elif c>m : chris+=1\r\n else: pass\r\nif mishka>chris: print(\"Mishka\")\r\nelif chris>mishka: print(\"Chris\")\r\nelse: print(\"Friendship is magic!^^\")\r\n\r\n", "avg = [0,0]\r\nround = None\r\n\r\nfor _ in range(int(input())):\r\n round = input()\r\n if round[0] > round[-1]:\r\n avg[0] += 1\r\n elif round[0] < round[-1]:\r\n avg[1] += 1\r\n\r\nif avg[0] > avg[1]:\r\n print('Mishka')\r\nelif avg[0] < avg[1]:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\nc=d=0\r\nwhile a>0:\r\n b=list(map(int,input().split()))\r\n if b[0]>b[1]:c+=1\r\n elif b[1]>b[0]:d+=1\r\n a-=1\r\nprint('Mishka') if c>d else print(\"Chris\") if d>c else print(\"Friendship is magic!^^\")", "n = int(input())\r\na = 0\r\nb = 0\r\nfor i in range(n):\r\n c,d = list(map(int,input().split()))\r\n if c > d:\r\n a += 1\r\n elif c < d:\r\n b += 1\r\n else:\r\n a += 1\r\n b += 1\r\nif a > b:\r\n print(\"Mishka\")\r\nelif a == b:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n rounds = int(input().rstrip())\r\n mishka = 0\r\n chris = 0\r\n for i in range(rounds):\r\n m, c = map(int, input().rstrip().split())\r\n if m < c:\r\n chris += 1\r\n if m > c:\r\n mishka += 1\r\n if mishka < chris:\r\n output('Chris')\r\n elif mishka > chris:\r\n output('Mishka')\r\n else:\r\n output('Friendship is magic!^^')\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nMishka = 0\r\nChris = 0\r\nfor i in range(n):\r\n a,b = [int(x) for x in input().split()]\r\n if a > b:\r\n Mishka += 1\r\n elif b > a:\r\n Chris += 1\r\nif Mishka > Chris:\r\n print(\"Mishka\")\r\nelif Chris > Mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\ns1=0\r\ns2=0\r\nfor i in range(n):\r\n m,c = map(int,input().split())\r\n if m>c:\r\n s1+=1\r\n elif c>m:\r\n s2+=1\r\n else:\r\n s1+=1\r\n s2+=1\r\nif s1>s2:\r\n print(\"Mishka\")\r\nelif s2>s1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "xx = 0\r\nyy = 0\r\nfor i in range(int(input())):\r\n x,y = list(map(int,input().split()))\r\n if x>y:\r\n xx+=1\r\n elif x<y:\r\n yy+=1\r\n else:\r\n pass\r\n\r\nif xx>yy:\r\n print(\"Mishka\")\r\nelif xx<yy:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\na=b=c=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x==y:\r\n a+=1\r\n if x>y:\r\n b+=1\r\n if x<y:\r\n c+=1\r\nif b>c:\r\n print('Mishka')\r\nelif b<c:\r\n print('Chris')\r\nelif b==c:\r\n print('Friendship is magic!^^')", "n=int(input())\r\ntong1=0\r\ntong2=0\r\nfor i in range (1,n+1):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n tong1+=1\r\n elif a<b:\r\n tong2+=1\r\nif tong1==tong2 :\r\n print(\"Friendship is magic!^^\")\r\nelif tong1>tong2 :\r\n print(\"Mishka\")\r\nelse :\r\n print(\"Chris\")", "n=int(input())\r\nm1=b1=0\r\nfor i in range(n):\r\n m,b=list(map(int,input().split()))\r\n if m>b:\r\n m1+=1\r\n elif b>m:\r\n b1+=1\r\nif m1>b1:\r\n print('Mishka')\r\nelif b1>m1:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "seize = int(input())\r\nmishka = 0 \r\nchris = 0 \r\nfor leveel in range(seize):\r\n hui, hai = map(int, input().split())\r\n if hui > hai:\r\n mishka += 1\r\n elif hai > hui:\r\n chris += 1\r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif chris > mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n \t \t \t\t \t\t\t \t\t \t\t \t\t\t\t \t \t", "n=int(input())\r\nq=w=0\r\nfor i in range(n):\r\n a=input().split()\r\n b=int(a[0])\r\n c=int(a[1])\r\n if b>c:q+=1\r\n elif c>b:w+=1\r\nif q>w:print(\"Mishka\")\r\nelif w>q:print(\"Chris\")\r\nelse:print(\"Friendship is magic!^^\")", "# https://codeforces.com/problemset/problem/703/A\r\n\r\nm, c = 0, 0\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n m += 1\r\n elif a < b:\r\n c += 1\r\nprint(\"Mishka\" if m > c else \"Chris\" if m < c else \"Friendship is magic!^^\")", "mishka = chris = 0\r\n\r\nfor _ in range(int(input())):\r\n m, c = input().split()\r\n m = int(m)\r\n c = int(c)\r\n\r\n mishka += m > c\r\n chris += c > m\r\n\r\nprint(\"Friendship is magic!^^\" if mishka == chris else \"Chris\" if chris > mishka else \"Mishka\")\r\n", "round=int(input())\r\nwinner=[]\r\nfor i in range(round):\r\n dice=list(map(int,input().split()))\r\n if dice[0]>dice[1]:\r\n winner.append(\"Mishka\")\r\n elif dice[0]<dice[1]:\r\n winner.append(\"Chirs\")\r\n else:\r\n winner.append(\"draw\")\r\nif winner.count(\"Mishka\")>winner.count(\"Chirs\"):\r\n print(\"Mishka\")\r\nelif winner.count(\"Mishka\")<winner.count(\"Chirs\"):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "mishka, chris = 0, 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a > b: mishka += 1\r\n elif b > a: chris += 1\r\nprint('Mishka' if mishka > chris else 'Chris' if chris > mishka else 'Friendship is magic!^^')", "t = int(input())\r\nscore_mishka= 0\r\nscore_chris = 0\r\nfor i in range(t):\r\n m,c= map(int,input().split())\r\n if m > c:\r\n score_mishka+=1\r\n elif m < c:\r\n score_chris +=1\r\n\r\nif score_mishka == score_chris:\r\n print('Friendship is magic!^^')\r\nelif score_mishka>score_chris:\r\n print('Mishka')\r\nelse:\r\n print('Chris')\r\n \r\n\r\n", "a=int(input())\r\nMishka=0\r\nChris=0\r\nfor i in range(a):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n Mishka=Mishka+1\r\n elif m<c:\r\n Chris=Chris+1\r\nif Mishka>Chris:\r\n print(\"Mishka\")\r\nelif Chris>Mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nscore=[0,0]\r\nfor _ in range(n):\r\n m,c=list(map(int,input().split(' ')))\r\n if m>c:\r\n score[0]+=1\r\n elif c>m:\r\n score[1]+=1\r\nif score[0]>score[1]:\r\n print('Mishka')\r\nelif score[1]>score[0]:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "n = int(input())\nm = 0\nc = 0\nfor i in range(n):\n [p1, p2] = map(int, input().split(' '))\n if p1 > p2:\n m += 1\n elif p1 < p2:\n c += 1\n\nif m == c:\n print('Friendship is magic!^^')\nelif m > c:\n print(\"Mishka\")\nelse:\n print('Chris')", "n = int(input())\nmi = 0 ; ch = 0\nfor i in range(n):\n m , c = input().split()\n m = int(m) ; c = int(c)\n if m > c:\n mi+=1\n if c > m:\n ch +=1\nif mi > ch:\n print(\"Mishka\")\nelif ch > mi :\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n\t \t \t\t \t \t \t \t\t \t\t \t \t\t", "a , b = 0,0\r\nfor i in range(int(input())):\r\n x,y = map(int,input().split())\r\n if(x>y):\r\n a+=1\r\n if(y>x):\r\n b+=1\r\nif(a>b):\r\n print('Mishka')\r\nelif(b>a):\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n=int(input())\r\ns=0\r\nd=0\r\ne=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if(x>y):\r\n s=s+1\r\n elif(x==y):\r\n d=d+1\r\n else:\r\n e=e+1\r\nif(s>e):\r\n print(\"Mishka\")\r\nelif(e>s):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n\r\n", "n=int(input())\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n res=list(map(int, input().split()))\r\n if res[0]>res[1]:\r\n m+=1\r\n elif res[1]>res[0]:\r\n c+=1\r\nif m>c:\r\n print('Mishka')\r\nelif c>m:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "x = y = 0\r\nfor _ in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a > b:\r\n x+=1\r\n elif b>a:\r\n y+=1\r\nif x>y:\r\n print(\"Mishka\")\r\nelif x<y:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "ac = 0\r\nbc = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a < b:\r\n bc+=1\r\n elif a==b:\r\n continue\r\n else:\r\n ac+=1\r\n\r\nif ac > bc:\r\n print(\"Mishka\")\r\nelif ac == bc:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "inp = int(input())\r\nli = []\r\nfor i in range(inp):\r\n n = list(map(int, input().split()))\r\n if n[0] > n[1]:\r\n li.append(1)\r\n elif n[0] < n[1]:\r\n li.append(2)\r\n else:\r\n li.append(0)\r\nprint(\"Mishka\" if li.count(1) > li.count(2) else \"Chris\" if li.count(\r\n 1) < li.count(2) else \"Friendship is magic!^^\")\r\n", "def main():\r\n x = int(input())\r\n\r\n m = [0] * (x+1)\r\n c = [0] * (x+1)\r\n Mishka = 0\r\n Cris = 0\r\n\r\n for i in range(1, x+1):\r\n m[i], c[i] = map(int, input().split())\r\n if m[i] > c[i]:\r\n Mishka += 1\r\n elif m[i] < c[i]:\r\n Cris += 1\r\n\r\n if Mishka > Cris:\r\n print(\"Mishka\")\r\n elif Mishka == Cris:\r\n print(\"Friendship is magic!^^\")\r\n else:\r\n print(\"Chris\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nmish = 0\r\nchris = 0\r\n\r\nfor x in range(n):\r\n m,c = map(int, input().split())\r\n if m > c:\r\n mish = mish + 1\r\n elif m < c:\r\n chris = chris + 1\r\n else:\r\n continue\r\n\r\nif mish > chris:\r\n print(\"Mishka\")\r\nelif mish < chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a = int(input())\r\nmiska = 0 \r\nc = 0 \r\nfor i in range(a):\r\n array = [int(i) for i in input().split()]\r\n\r\n if array[0] > array[1]:\r\n miska += 1\r\n elif array[0] < array[1]:\r\n c +=1\r\nif miska > c:\r\n print('Mishka')\r\nelif miska < c:\r\n print('Chris')\r\nelif miska == c:\r\n print('Friendship is magic!^^')\r\n ", "m = int(0)\nc = int(0)\nfor i in range(int(input())):\n p = [int(x) for x in input().split()]\n if (p[0]>p[1]):\n m+=1\n elif (p[0]<p[1]):\n c+=1\nif (m>c):\n print('Mishka')\nelif (m<c):\n print('Chris')\nelse :\n print('Friendship is magic!^^')\n\t\t\t \t \t\t\t\t\t \t \t\t \t\t\t \t \t \t\t", "rounds=int(input())\r\nresults=[]\r\nfor i in range(0,rounds):\r\n results.append(list(map(int,input().split())))\r\nk=0\r\nfor i in results:\r\n k+=(1 if(i[0]>i[1])else 0if(i[0]==i[1])else -1)\r\nprint(\"Mishka\"if(k>0)else\"Chris\"if(k<0)else \"Friendship is magic!^^\")", "n = int(input())\r\nma = 0\r\ncs = 0\r\nfor i in range(n):\r\n m , c = map(int, input().split())\r\n if m > c:\r\n ma += 1\r\n elif c > m:\r\n cs += 1\r\n else:\r\n pass\r\n\r\nif ma>cs:\r\n print('Mishka')\r\nelif cs>ma:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n=int(input())\r\nm1=0\r\nc1=0\r\nd=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n m1=m1+1\r\n elif m<c:\r\n c1=c1+1\r\nif m1>c1 and m1>d:\r\n print(\"Mishka\")\r\nelif c1>m1 and c1>d:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=input()\nn=int(n)\nMishka=0\nChris=0\nfor i in range(0,n,1):\n m,c=input().split()\n m=int(m)\n c=int(c)\n if m>c :\n Mishka=Mishka+1\n elif c>m :\n Chris=Chris+1\nif Mishka>Chris:\n print(\"Mishka\")\nelif Chris>Mishka:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n #MishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishkaMishk\n\t\t\t\t\t\t \t \t \t \t\t\t\t\t\t \t\t \t\t", "n=int(input())\r\nm=c=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a==b:\r\n continue\r\n elif a>b:\r\n m+=1\r\n else:\r\n c+=1\r\nprint((c>m and \"Chris\") or (c<m and \"Mishka\") or (m==c and \"Friendship is magic!^^\"))", "# -*- coding: utf-8 -*-\n\"\"\"Untitled51.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Wn8Wb4kY3YQE5RRN27xSPaK9FS99eA4B\n\"\"\"\n\nm=0\nc=0\nn=int(input())\nfor i in range(0,n):\n\n a=list(map(int,input().split()))\n if a[0]>a[1]:\n m+=1\n elif a[0]<a[1]:\n c+=1\nif m/n>c/n:\n print('Mishka')\nelif m/n<c/n:\n print('Chris')\nelif m/n==c/n:\n print('Friendship is magic!^^')\n\n", "t=int(input())\r\nmis=0\r\nchi=0\r\nfor i in range(t):\r\n s=input().split()\r\n m=int(s[0])\r\n c=int(s[1])\r\n if m>c:\r\n mis+=1\r\n if c>m:\r\n chi+=1\r\nif mis>chi:\r\n print('Mishka')\r\nif chi>mis:\r\n print('Chris')\r\nif mis==chi:\r\n print('Friendship is magic!^^')", "s=int(input())\r\np=0\r\ncount=0\r\nfor i in range(s):\r\n x,y=map(int,input().split())\r\n if x>y:\r\n p+=1\r\n elif y>x:\r\n count+=1\r\nif p==count:\r\n print(\"Friendship is magic!^^\")\r\nelif p>count:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "a,b=0,0\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x>y:\r\n a+=1 \r\n elif y>x:\r\n b+=1 \r\n else:\r\n pass\r\nif a>b:\r\n print(\"Mishka\")\r\nelif a<b:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "v=0\r\nfor i in range(int(input())):b,e=map(int,input().split());v+=b>e;v-=b<e\r\nprint('Mishka' if v>0 else ['Friendship is magic!^^','Chris'][v<0])", "c,d=0,0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:c+=1\r\n elif b>a:d+=1\r\nif c==d:print(\"Friendship is magic!^^\")\r\nelif c>d:print(\"Mishka\")\r\nelse:print(\"Chris\")\r\n", "n=int(input())\r\nmi=0\r\nch=0\r\nfor i in range(n):\r\n m,c=list(map(int,input().split()))\r\n if(m>c):\r\n mi+=1 \r\n elif(m<c):\r\n ch+=1 \r\nif(mi>ch):\r\n print(\"Mishka\")\r\nelif(mi<ch):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n ", "t = int(input())\r\nmi = 0\r\nci = 0\r\nfor te in range(t):\r\n m,c = map(int,input().split())\r\n if m > c:\r\n mi += 1\r\n if c > m:\r\n ci += 1\r\nif mi > ci:\r\n print(\"Mishka\")\r\nif ci > mi:\r\n print(\"Chris\")\r\nif mi == ci:\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\nc1=0\r\nc2=0\r\nfor i in range(t):\r\n l=list(map(int,input().strip().split()))\r\n a=l[0]\r\n b=l[1]\r\n if a>b:\r\n c1+=1\r\n if b>a:\r\n c2+=1\r\nif c1>c2:\r\n print(\"Mishka\")\r\nelif c1<c2:\r\n print(\"Chris\")\r\nelif c1==c2:\r\n print(\"Friendship is magic!^^\")\r\n \r\n \r\n", "n=int(input())\r\nmishka=chris=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:mishka+=1\r\n elif a<b:chris+=1\r\nif mishka>chris:print('Mishka')\r\nelif mishka<chris:print('Chris')\r\nelse:print('Friendship is magic!^^')", "def niceGame(mishka,chris):\r\n Score=0\r\n if mishka > chris:\r\n Score +=1\r\n elif chris > mishka:\r\n Score -=1\r\n return Score\r\n \r\n \r\nrounds = int(input())\r\nfinalScore = 0\r\nfor i in range(rounds):\r\n a,b = map(int , input().split())\r\n finalScore += niceGame(a,b)\r\nif finalScore > 0 : \r\n print(\"Mishka\")\r\nelif finalScore < 0 :\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nm = [list(map(int, input().split())) for _ in range(n)]\nt = []\n\nfor i in range(n):\n if m[i][0] == m[i][1]:\n continue\n elif m[i][0] > m[i][1]:\n t.append(\"M\")\n else:\n t.append(\"C\")\n\nm = t.count(\"M\")\nc = t.count(\"C\")\nif m == c:\n print(\"Friendship is magic!^^\")\nelif m > c:\n print(\"Mishka\")\nelse:\n print(\"Chris\")\n", "inp = int(input())\r\narr = []\r\nfor i in range(inp):\r\n arr.append(str(input()))\r\n\r\nChris = 0\r\nMishka = 0\r\nfor x in arr:\r\n elemnts = x.split(\" \")\r\n if (int(elemnts[0]) > int(elemnts[1])):\r\n Mishka = Mishka + 1\r\n if (int(elemnts[0]) < int(elemnts[1])):\r\n Chris = Chris + 1\r\nif (Mishka > Chris):\r\n print(\"Mishka\")\r\nif (Chris > Mishka):\r\n print(\"Chris\")\r\nif (Mishka == Chris):\r\n print(\"Friendship is magic!^^\") ", "count = int(input())\r\nscore = 0\r\nfor i in range(count):\r\n inp = input().split(\" \")\r\n if inp[0] > inp[1]:\r\n score += 1\r\n elif inp[0] < inp[1]:\r\n score -= 1\r\nif(score > 0):\r\n print(\"Mishka\")\r\nelif (score < 0):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\nm=0\r\nn=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if b>c:\r\n m=m+1\r\n elif b<c:\r\n n=n+1\r\nif m>n:\r\n print(\"Mishka\")\r\nelif m<n:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "M, J = 0,0\r\nfor i in range(int(input())):\r\n x = [int(i) for i in input().split()]\r\n if x[0] > x[1]: M += 1\r\n elif x[1] > x[0]: J += 1\r\nprint(\"Mishka\") if M > J else print(\"Chris\") if J > M else print(\"Friendship is magic!^^\")", "n=int(input())\r\nm1,c1,eq=0,0,0\r\nfor i in range(n):\r\n lst=input().split()\r\n m=lst[0]\r\n c=lst[1]\r\n if(m>c):\r\n m1+=1\r\n elif(c>m):\r\n c1+=1 \r\nif(m1>c1):\r\n print(\"Mishka\") \r\nelif(c1>m1):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nz=0\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n z=z+1\r\n if m<c:\r\n x=x+1\r\n if m==c:\r\n y=y+1\r\nif z>x:\r\n print('Mishka')\r\nelif z<x:\r\n print('Chris')\r\nelif y==y:\r\n print('Friendship is magic!^^')", "n = int(input())\n\nc = 0\nm = 0\nfor _ in range(n):\n\n m_v , c_v = [int(x) for x in input().split()]\n\n if c_v > m_v :\n c += 1\n if m_v > c_v:\n m += 1\n\n\nif c > m :\n print(\"Chris\")\n\nif m > c :\n print(\"Mishka\")\n\nif c == m :\n print(\"Friendship is magic!^^\")", "m1 = 0\r\nc1 = 0 \r\nfor _ in range(int(input())):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n m1 += 1\r\n elif c > m:\r\n c1 += 1\r\nif m1 > c1:\r\n print(\"Mishka\")\r\nelif c1 > m1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input(\"\"))\r\nA = []\r\nB = []\r\nfor i in range (n):\r\n a = [int(p) for p in input(\"\").split()]\r\n A.append(a[0])\r\n B.append(a[1])\r\ncm = 0\r\ncc = 0\r\nfor i in range (n):\r\n m = A[i]\r\n c = B[i]\r\n if m > c:\r\n cm += 1\r\n elif c > m:\r\n cc += 1\r\nif cm > cc:\r\n print(\"Mishka\")\r\nelif cc > cm:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "m=0\r\nc=0\r\nfor i in range(int(input())):\r\n (a,b)=map(int,input().split())\r\n if a>b:\r\n m=m+1\r\n if b>a:\r\n c=c+1\r\nif m>c:\r\n print(\"Mishka\")\r\nif c>m:\r\n print(\"Chris\")\r\nif c==m:\r\n print(\"Friendship is magic!^^\")\r\n ", "x, y = 0, 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a>b:\r\n x+=1\r\n elif b>a:\r\n y+=1\r\nif x>y:\r\n print('Mishka')\r\nelif y>x:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "count_M=0\r\ncount_K=0\r\nn=int(input())\r\nfor i in range(n):\r\n M,K=map(int,input().split())\r\n if M>K:\r\n count_M+=1\r\n elif K>M: \r\n count_K+=1\r\n \r\n \r\nif count_M==count_K:\r\n print('Friendship is magic!^^') \r\nelif count_M<count_K:\r\n print('Chris') \r\n \r\nelse:\r\n \r\n print('Mishka') ", "t = int(input())\r\nmishka = 0\r\nChris = 0\r\nFriend = 0\r\nfor i in range(t):\r\n\ta,b = map(int,input().split())\r\n\tif a > b:\r\n\t\tmishka += 1\r\n\telif b > a:\r\n\t\tChris += 1\r\n\telif a == b:\r\n\t\tFriend += 1\r\nif mishka > Chris:\r\n\tprint(\"Mishka\")\r\nelif Chris > mishka:\r\n\tprint(\"Chris\")\r\nelif Chris == mishka:\r\n\tprint(\"Friendship is magic!^^\")", "n=int(input())\r\ncount_m=0\r\ncount_c=0\r\ncount_f=0\r\nfor i in range(n):\r\n read = list(map(int, input().split()))\r\n if(read[0]>read[1]):\r\n count_m+=1\r\n elif(read[0]<read[1]):\r\n count_c+=1\r\n else: count_f+=1\r\nif(count_m==count_c):\r\n print(\"Friendship is magic!^^\")\r\nelif(count_m>count_c):\r\n print(\"Mishka\")\r\nelse: print(\"Chris\")\r\n\r\n", "a, b = 0, 0\r\nfor _ in range(int(input())):\r\n m, c = map(int, input().split())\r\n if m > c:\r\n a += 1\r\n if m < c:\r\n b += 1\r\nif a > b:\r\n print('Mishka')\r\nif b > a:\r\n print('Chris')\r\nif a == b:\r\n print('Friendship is magic!^^')\r\n\r\n\r\n", "n = int(input())\r\nCounterM = 0\r\nCounterC = 0\r\nfor _ in range(n):\r\n m,c=map(int,input().split())\r\n if m > c:\r\n CounterM += 1 \r\n elif c > m :\r\n CounterC += 1\r\n else:\r\n continue\r\nif CounterM > CounterC:\r\n print('Mishka')\r\nelif CounterM < CounterC:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\nsch_m = 0\nsch_n = 0\nfor i in range(n):\n m, n = map(int, input().split())\n if m > n:\n sch_m += 1\n elif m < n:\n sch_n += 1\nif sch_m > sch_n:\n print(\"Mishka\")\nelif sch_n > sch_m:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n\n", "no_of_games = int(input())\r\nmishka_win_count = chris_win_count = 0\r\nfor i in range(no_of_games):\r\n mishka, chris = map(int, input().split())\r\n if mishka > chris:\r\n mishka_win_count += 1\r\n elif chris > mishka:\r\n chris_win_count += 1\r\nif mishka_win_count > chris_win_count:\r\n print(\"Mishka\")\r\nelif chris_win_count > mishka_win_count:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a = int(input())\r\nmishka_c = 0\r\nchris_c = 0\r\nfor i in range(a):\r\n b = input()\r\n d = b.split(' ')\r\n mishka = int(d[0])\r\n chris = int(d[1])\r\n if mishka>chris:\r\n mishka_c+=1\r\n elif chris>mishka:\r\n chris_c+=1\r\nif mishka_c>chris_c:\r\n print('Mishka')\r\nelif chris_c>mishka_c:\r\n print('Chris')\r\nelif mishka_c == chris_c:\r\n print('Friendship is magic!^^')", "t=int(input())\ns=0\ns1=0\nfor i in range(t):\n a,b=map(int,input().split())\n if a>b:\n s+=1\n elif a<b:\n s1+=1\nif s<s1:\n print('Chris')\nelif s>s1:\n print('Mishka')\nelse:\n print('Friendship is magic!^^')\n\n\t\t\t\t \t\t\t \t\t\t \t \t\t \t\t\t \t\t", "x = 0\r\nfor _ in range(int(input())):\r\n a,b = map(int,input().split())\r\n if a > b:\r\n x += 1\r\n if a < b:\r\n x -= 1\r\nif x > 0:\r\n print(\"Mishka\")\r\nelif x < 0:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\nmis,cri,mr,cr=0,0,0,0\r\nfor i in range(n):\r\n li=[int(i) for i in input().split()]\r\n mis=mis+li[0]\r\n cri=cri+li[1]\r\n if mis>cri:\r\n mr+=1\r\n if cri>mis:\r\n cr+=1\r\n mis=0\r\n cri=0\r\nif mr>cr:\r\n print(\"Mishka\")\r\nif cr>mr:\r\n print(\"Chris\")\r\nif mr==cr:\r\n print(\"Friendship is magic!^^\")", "mi=0;eq=0;ch=0;\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n mi+=1\r\n elif a==b:\r\n eq+=1\r\n else:\r\n ch+=1\r\nif mi>eq and mi>ch:\r\n print(\"Mishka\")\r\nelif mi==ch:\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")", "n=int(input())\r\nmishka=0\r\nchris=0\r\nfor i in range(n):\r\n mi,ci=map(int,input().split())\r\n if mi>ci:\r\n mishka+=1\r\n elif ci>mi:\r\n chris+=1\r\nif mishka> chris:\r\n print(\"Mishka\")\r\nelif chris>mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "x=int(input())\r\nmishka=0\r\nchris=0\r\nfor i in range (x):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n mishka=mishka+1\r\n if a==b:\r\n continue\r\n if b>a:\r\n chris=chris+1\r\nif mishka>chris:\r\n print(\"Mishka\")\r\nelif chris>mishka:\r\n print(\"Chris\")\r\nelif chris==mishka:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nl = []\r\nm = []\r\nc = []\r\nfor i in range(n):\r\n x = list(map(int,input().split()))\r\n l.append(x)\r\nfor i in l:\r\n if i[0]>i[1]:\r\n m.append(1)\r\n if i[0]<i[1]:\r\n c.append(1)\r\n if i[0]==i[1]:\r\n m.append(1)\r\n c.append(1)\r\nif len(m)>len(c):\r\n print(\"Mishka\")\r\nif len(m)<len(c):\r\n print(\"Chris\")\r\nif len(m)==len(c):\r\n print(\"Friendship is magic!^^\")", "\r\n# это задача 703A\r\nn = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n m = m + 1\r\n elif b > a:\r\n c = c + 1\r\nif m > c:\r\n print(\"Mishka\")\r\nif m < c:\r\n print(\"Chris\")\r\nif m == c:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nsq = [[int(i) for i in input().split()]for t in range(n)]\r\nd = 0\r\nfor i in range(n):\r\n if sq[i][0] > sq[i][1]:\r\n d += 1\r\n elif sq[i][0] < sq[i][1]:\r\n d -= 1\r\n\r\nif d >=1 :\r\n print('Mishka')\r\nelif d < 0:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "miska1=0\r\nchris1=0\r\nfor i in range(int(input())):\r\n miska,chris=map(int,input().split())\r\n if(miska>chris):\r\n miska1+=1\r\n elif(miska==chris):\r\n miska1+=0\r\n chris1+=0\r\n else:\r\n chris1+=1\r\n\r\nif(miska1>chris1):\r\n print('Mishka')\r\nelif(miska1==chris1):\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('Chris')\r\n", "tekrar=int(input())\r\nilk=0\r\nson=0\r\nfor a in range(tekrar):\r\n a,b = (input()).split()\r\n a = int(a)\r\n b = int(b)\r\n if a<b:\r\n son+=1\r\n elif a>b:\r\n ilk+=1\r\nif ilk>son:\r\n print(\"Mishka\")\r\nelif ilk<son:\r\n print(\"Chris\")\r\nelif ilk==son:\r\n print(\"Friendship is magic!^^\")", "t=int(input())\r\ns1,s2=0,0\r\nfor i in range(t):\r\n\r\n mc=list(map(int,input().split()))\r\n if(mc[0]>mc[1]):\r\n s1+=1\r\n elif(mc[0]<mc[1]):\r\n s2+=1\r\nif(s1>s2):\r\n print(\"Mishka\")\r\nelif(s1<s2):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\na=0\r\nb=0\r\nfor i in range(n):\r\n y = list(map(int, input().split()))\r\n if y[0] > y[1]:\r\n a+=1\r\n elif y[0] < y[1]:\r\n b+=1\r\n \r\nif a==b:\r\n print(\"Friendship is magic!^^\")\r\n \r\nelif a > b:\r\n print(\"Mishka\")\r\n \r\nelif a<b:\r\n print(\"Chris\")", "#https://codeforces.com/problemset/problem/703/A\r\n\r\ndef get_answer(difference):\r\n if(difference<0):\r\n return \"Chris\"\r\n elif(difference == 0):\r\n return \"Friendship is magic!^^\"\r\n else:\r\n return \"Mishka\"\r\n\r\nrounds = int(input())\r\nresult = 0\r\nwhile rounds>0:\r\n m, c = (int(x) for x in input().split(\" \"))\r\n if(m > c):\r\n result += 1\r\n elif(c > m):\r\n result -= 1\r\n rounds -= 1\r\nprint(get_answer(result))", "n = int(input())\r\nm = 0\r\na = 0\r\nfor i in range(n):\r\n b,c = list(map(int,input().split()))\r\n if b > c:\r\n m += 1\r\n if c > b:\r\n a += 1\r\nif m > a:\r\n print(\"Mishka\")\r\nif a > m:\r\n print(\"Chris\")\r\nif a == m:\r\n print(\"Friendship is magic!^^\")", "cm=0\r\ncc=0\r\nfor i in range(0,int(input())):\r\n n,k=map(int,input().split())\r\n if(n>k):\r\n cm+=1\r\n elif(k>n):\r\n cc+=1\r\nif(cm>cc):\r\n print(\"Mishka\")\r\nelif(cc>cm):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\r\nm=c=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x<y:\r\n c+=1 \r\n elif y<x:\r\n m+=1\r\nif c<m:\r\n print(\"Mishka\")\r\nelif m<c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "import sys\r\nn = int(sys.stdin.readline().strip())\r\nmw = cw = 0\r\n\r\nfor i in range(n):\r\n m, c = map(int, sys.stdin.readline().strip().split())\r\n if m > c :\r\n mw += 1\r\n elif c > m :\r\n cw += 1\r\n\r\nif mw == cw :\r\n print(\"Friendship is magic!^^\")\r\nelif mw > cw :\r\n print(\"Mishka\")\r\nelse :\r\n print(\"Chris\")", "t = int(input())\nm = 0\nf = 0\nfor _ in range(t):\n a, b = map(int, input().split())\n if a > b: m += 1\n elif a < b: f += 1\n\nif m > f:\n print('Mishka')\nelif f > m:\n print('Chris')\nelse:\n print('Friendship is magic!^^')\n\n", "t=int(input())\r\nm1=0\r\nc1=0\r\nfor _ in range(t):\r\n m,c=map(int,input().split())\r\n if(m>c):\r\n m1+=1\r\n if(m<c):\r\n c1+=1\r\nif(m1>c1):\r\n print(\"Mishka\")\r\nelif(m1<c1):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\nch=0\r\nm=0\r\nfor i in range(a):\r\n b,c=map(int,input().split())\r\n if b<c:\r\n ch+=1\r\n elif b==c:\r\n ch+=1\r\n m+=1\r\n else:\r\n m+=1\r\nif ch>m:\r\n print('Chris')\r\nelif ch==m:\r\n print('Friendship is magic!^^')\r\nelse:\r\n print('Mishka')", "\"\"\"\r\n\r\n/ \\ / | / | / | \r\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\n\r\n# Constants\r\nINF = float('inf')\r\nMOD = 1000000007\r\n\r\n# Faster Input\r\ndef read_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef read_n_int():\r\n return map(int, sys.stdin.readline().split())\r\n\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\n# Faster Output\r\ndef print_yes_no(condition):\r\n print('YES' if condition else 'NO')\r\n \r\ndef print_array(arr, sep=' '):\r\n print(sep.join(map(str, arr)))\r\n\r\n\r\n# Main Function\r\ndef solve():\r\n miska = 0\r\n cris = 0\r\n for i in range(read_int()):\r\n a, b = read_n_int()\r\n if a > b:\r\n miska += 1\r\n elif a < b:\r\n cris += 1\r\n\r\n if miska > cris:\r\n print(\"Mishka\")\r\n elif miska < cris:\r\n print(\"Chris\")\r\n else:\r\n print(\"Friendship is magic!^^\")\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n=int(input())\r\n\r\nmishka=0 \r\nchris=0 \r\n\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n \r\n if m>c:\r\n mishka+=1 \r\n if m<c:\r\n chris+=1 \r\n\r\nif mishka>chris:\r\n print(\"Mishka\")\r\nelif mishka<chris:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "a=int(input())\r\nk=0\r\nl=0\r\nfor i in range(a):\r\n f,g=map(int,input().split())\r\n if f>g:\r\n k+=1\r\n elif f<g:\r\n l+=1\r\nif k>l:\r\n print(\"Mishka\")\r\nelif k<l:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\ncountM=0\r\ncountK=0\r\nwhile n!=0:\r\n a,b=tuple(map(int,input().split()))\r\n\r\n\r\n if a>b:\r\n countM+=1\r\n if b>a:\r\n countK+=1\r\n if a==b:\r\n countM = countM\r\n countK = countK\r\n n -= 1\r\n\r\nif countM>countK:\r\n print('Mishka')\r\nif countM < countK:\r\n print('Chris')\r\nif countM == countK:\r\n print('Friendship is magic!^^')\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ns_m = 0\r\ns_c = 0\r\nfor i in range(n):\r\n tc = [int (i) for i in input().split()]\r\n a = tc[0]\r\n b = tc[1] \r\n if(a>b):\r\n s_m+=1\r\n elif(a==b):\r\n s_m+=0\r\n else:\r\n s_c+=1\r\nif(s_c>s_m):\r\n print(\"Chris\")\r\nelif(s_c<s_m):\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "m = 0\r\nc = 0\r\nfor _ in range(int(input())):\r\n mas = [int(el) for el in input().split()]\r\n if mas[0] > mas[1]:\r\n m+=1\r\n elif mas[0] < mas[1]:\r\n c+=1\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "# Input the number of game rounds\r\nn = int(input())\r\n\r\n# Initialize counters for Mishka and Chris\r\nmishka_score = 0\r\nchris_score = 0\r\n\r\n# Iterate through each round\r\nfor _ in range(n):\r\n mi, ci = map(int, input().split())\r\n if mi > ci:\r\n mishka_score += 1\r\n elif ci > mi:\r\n chris_score += 1\r\n\r\n# Determine the result of the game\r\nif mishka_score > chris_score:\r\n print(\"Mishka\")\r\nelif chris_score > mishka_score:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n = int(input())\r\nasum = 0\r\nbsum = 0\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n asum += 1\r\n continue\r\n if b > a:\r\n bsum += 1\r\n continue\r\n\r\nif asum > bsum:\r\n print(\"Mishka\")\r\nelif bsum > asum:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "x1=0\r\nx2=0\r\nfor _ in range(int(input())):\r\n a,s=map(int,input().split())\r\n if a>s:\r\n x1+=1\r\n elif a<s:\r\n x2+=1\r\nif x1>x2:\r\n print('Mishka')\r\nelif x1<x2:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "m=0\r\nc=0\r\nfor _ in range(int(input())):\r\n mi,ch=map(int,input().split())\r\n if mi>ch:\r\n m+=1\r\n elif ch>mi:\r\n c+=1\r\nif m>c:\r\n print('Mishka')\r\nelif m==c:\r\n print('Friendship is magic!^^')\r\nelif c>m:\r\n print('Chris')", "a=int(input())\r\nk1=0\r\nk2=0\r\nfor x in range(a):\r\n v,b=map(int,input().split())\r\n if v>b:\r\n k1+=1\r\n elif v<b:\r\n k2+=1\r\nif k1>k2:\r\n print('Mishka')\r\nelif k1<k2:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n ", "a,b=0,0\r\nfor _ in range(int(input())):\r\n m,c =map(int,input().split())\r\n if m>c: a+=1\r\n elif m<c: b+=1\r\nprint(\"Mishka\" if a>b else \"Chris\" if a<b else \"Friendship is magic!^^\")", "n=int(input())\r\nmis=0\r\nchris=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if 1<=m<=6 and 1<=c<=6:\r\n if m>c:\r\n mis+=1\r\n elif c>m:\r\n chris+=1\r\nif mis>chris:\r\n print(\"Mishka\")\r\nelif chris>mis:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n \r\n\r\n \r\n", "n = int(input())\r\nmc = 0\r\ncc = 0\r\nfor i in range(n):\r\n m,c = map(int,input().split())\r\n if m > c:\r\n mc += 1\r\n elif m < c:\r\n cc += 1\r\nif mc > cc:\r\n print('Mishka')\r\nelif cc > mc:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "c=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a>b:c+=1\r\n elif a<b:c-=1\r\nif c>0:print('Mishka')\r\nelif c<0:print('Chris')\r\nelse:print('Friendship is magic!^^')", "# Mishka and Game\r\nn = int(input())\r\ndef winner(rounds):\r\n mishka = 0\r\n chris = 0\r\n for roun in rounds:\r\n if roun[0]>roun[1]:\r\n mishka += 1\r\n elif roun[0]<roun[1]:\r\n chris +=1\r\n if mishka > chris:\r\n value = \"Mishka\"\r\n elif mishka < chris:\r\n value = \"Chris\"\r\n else:\r\n value = \"Friendship is magic!^^\"\r\n \r\n return value\r\nrounds = []\r\n\r\nfor i in range(n):\r\n m,c = [int(i) for i in input().split()]\r\n rounds.append((m,c))\r\n \r\nprint(winner(rounds))", "n=int(input())\r\nsum1=0\r\n\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n \r\n if a>b:\r\n sum1 +=1 # Mishka wins\r\n \r\n elif a==b:\r\n sum1 +=0 # Both same\r\n \r\n else:\r\n sum1 -=1 # Chris wins\r\n\r\nif sum1>0:\r\n print(\"Mishka\")\r\nelif sum1<0:\r\n print(\"Chris\")\r\nelif sum1==0:\r\n print(\"Friendship is magic!^^\")", "def mishika(scores):\r\n m, c = 0, 0\r\n for i in scores:\r\n if i[0] > i[1]:\r\n m += 1\r\n elif i[0] < i[1]:\r\n c += 1\r\n else:\r\n m += 1\r\n c += 1\r\n if m > c:\r\n return \"Mishka\"\r\n elif m < c:\r\n return \"Chris\"\r\n else:\r\n return \"Friendship is magic!^^\"\r\n \r\nn = int(input())\r\nscores = []\r\nfor _ in range(n):\r\n scores.append([int(x) for x in input().split()])\r\nprint(mishika(scores))", "k=0;n=int(input())\r\nfor _ in range(n):m,l=map(int,input().split());k=k+(1 if m>l else -1 if m<l else 0 )\r\nprint(\"Mishka\" if k>0 else \"Chris\" if k<0 else \"Friendship is magic!^^\")", "n = int(input())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n k = input()\r\n list1 = k.split(\" \")\r\n if int(list1[0])>int(list1[1]):\r\n m += 1\r\n if int(list1[0]) < int(list1[1]):\r\n c += 1\r\nif m>c:\r\n print(\"Mishka\")\r\nelif c> m:\r\n print(\"Chris\")\r\nelse :\r\n print(\"Friendship is magic!^^\")", "o = int(input())\r\n \r\nmishka = 0\r\nchris = 0\r\n \r\nfor f in range(o):\r\n v, o = list(map(int, input().split()))\r\n if v > o:\r\n mishka += 1\r\n elif v < o:\r\n chris += 1\r\n \r\n \r\nif mishka > chris:\r\n print(\"Mishka\")\r\nelif chris > mishka:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nm=0\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n if a[i][0]>a[i][1]:\r\n m+=1\r\n elif a[i][0]<a[i][1]:\r\n c+=1\r\nif m==c:\r\n print(\"Friendship is magic!^^\")\r\nelif m>c:\r\n print(\"Mishka\")\r\nelse:\r\n print(\"Chris\")", "n = int (input())\nmi = 0 ; ch = 0\nfor i in range (n):\n m ,c = input (). split ()\n m = int (m) ; c = int (c)\n if m >c:\n mi += 1\n if c > m :\n ch += 1\nif mi > ch :\n print (\"Mishka\")\nelif ch > mi:\n print (\"Chris\")\nelse :\n print (\"Friendship is magic!^^\")\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\nn = int(sys.stdin.readline())\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, sys.stdin.readline().split())\r\n if a > b:\r\n m += 1\r\n elif a < b:\r\n c += 1\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\n\nmishka=0\nchris=0\nfor i in range(n):\n m,c=input().split()\n m=int(m)\n c=int(c)\n if(m>c):\n mishka+=1\n elif(c>m):\n chris+=1\n\n\nif(mishka>chris):\n print(\"Mishka\")\nelif(chris>mishka):\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\n\t \t\t \t\t\t \t\t\t\t\t \t \t\t\t \t\t \t\t \t\t \t", "li_m=[]\r\nli_c=[]\r\nfor i in range(int(input())):\r\n m,c=map(int,input().split())\r\n if m>c:\r\n li_m.append(1)\r\n elif m<c:\r\n li_c.append(1)\r\n else:\r\n li_c.append(0)\r\n li_m.append(0)\r\nif sum(li_m)>sum(li_c):\r\n print(\"Mishka\")\r\nelif sum(li_m)<sum(li_c):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "tests = int(input()) \r\nm_wins = 0\r\nc_wins = 0\r\n\r\n\r\nfor i in range(tests):\r\n liste = list(map(int,input().split(\" \")))\r\n if liste[0]>liste[1]:\r\n m_wins += 1\r\n if liste[0]<liste[1]:\r\n c_wins += 1\r\n\r\nif m_wins > c_wins:\r\n print(\"Mishka\")\r\nelif m_wins < c_wins:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")\r\n", "n=int(input())\r\ni=0\r\nm1=0\r\nc1=0\r\nwhile i<n:\r\n m,c=map(int,input().split())\r\n if m>c:\r\n m1+=1\r\n elif c>m:\r\n c1+=1\r\n i+=1\r\nif m1>c1:\r\n print(\"Mishka\")\r\nelif c1>m1:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "m = c = 0 \r\nfor _ in range(int(input())) :\r\n mishka , chris = list(map(int,input().split()))\r\n if mishka > chris : m += 1\r\n elif chris > mishka : c += 1\r\nif m == c : print(\"Friendship is magic!^^\")\r\nelse : print(\"Mishka\" if m > c else \"Chris\")", "x=int(input())\r\na=b=0\r\nfor i in range(x):\r\n y,z=map(int,input().split())\r\n if(y>z):\r\n a=a+1\r\n elif(z>y):\r\n b=b+1\r\nif(a>b):\r\n print(\"Mishka\")\r\nelif(b>a):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = input()\nn = int(n)\n\nmishka = 0\nchris = 0\nfor i in range(n):\n m, c = input().split()\n m = int(m)\n c = int(c)\n if m > c:\n mishka = mishka + 1\n elif c > m:\n chris = chris + 1\n\nif mishka > chris:\n print(\"Mishka\")\nelif chris > mishka:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n\t \t \t \t \t\t\t\t\t \t \t\t \t \t\t", "z=0\r\nfor s in[*open(0)][1:]:a,b=map(int,s.split());z+=1*(a>b) or -1*(b>a)\r\nprint([['Mishka','Chris'][z<0], 'Friendship is magic!^^'][z==0])", "a = 0\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x == y:\r\n continue\r\n a += (-1)**(y > x) or +1**(x > y)\r\nif a != 0:\r\n print([\"Mishka\",\"Chris\"][a < 0])\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "n = int(input())\r\nm=0\r\nc=0\r\n\r\nfor x in range(n):\r\n lst = []\r\n lst = input().split()\r\n a = int(lst[0])\r\n b = int(lst[1])\r\n if a>b:\r\n m=m+1\r\n elif b>a:\r\n c=c+1\r\n\r\nif m>c:\r\n print('Mishka')\r\nelif c>m:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n \r\n ", "n=int(input())\r\nm1=0\r\nc1=0\r\nwhile(n!=0):\r\n m,c=map(int,input().split())\r\n if(m>c):\r\n m1=m1+1\r\n elif(c>m):\r\n c1=c1+1\r\n n=n-1\r\nif(m1>c1):\r\n print(\"Mishka\")\r\nelif(c1>m1):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\nM,C=0,0\r\nfor i in range(n) :\r\n mc = input().split()\r\n m=int(mc[0])\r\n c=int(mc[1])\r\n if m>c :\r\n M+=1\r\n elif c>m :\r\n C+=1\r\n\r\nif M>C :\r\n print(\"Mishka\")\r\nelif C>M :\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "r = int(input())\r\n\r\nm = c = 0\r\n\r\nfor i in range(r):\r\n\r\n s1, s2 = list(map(int, input().split()))\r\n\r\n if s1 > s2: m += 1\r\n elif s2 > s1: c += 1\r\n\r\n\r\nif m > c: print('Mishka')\r\nelif c > m: print('Chris')\r\nelse: print('Friendship is magic!^^')", "n=int(input())\r\nmw=0\r\ncw=0\r\nwhile n>=1:\r\n m,c=map(int,input().split())\r\n if m>c:\r\n mw+=1\r\n elif c>m:\r\n cw+=1\r\n else:\r\n cw+=1\r\n mw+=1\r\n n-=1\r\nif mw>cw:\r\n print('Mishka')\r\nelif cw>mw:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "n = int(input())\r\ncounterC = 0\r\ncounterM = 0\r\nfor i in range(n):\r\n m, c = map(int, input().split())\r\n if c > m:\r\n counterC += 1\r\n elif c < m:\r\n counterM += 1\r\nif counterC > counterM:\r\n print('Chris')\r\nelif counterC < counterM:\r\n print('Mishka')\r\nelse:\r\n print('Friendship is magic!^^')\r\n", "m=0; c=0\nfor i in int(input())*[0]:\n inp=[int(k) for k in input().split()]\n m+=inp[0]>inp[1]\n c+=inp[1]>inp[0]\nif m>c:\n print(\"Mishka\")\nelif m<c:\n print(\"Chris\")\nelse:\n print(\"Friendship is magic!^^\")\n", "n = int(input())\r\nwins = [0, 0]\r\nfor i in range(n):\r\n m, c = map(int,input().split())\r\n if m > c:\r\n wins[0] += 1\r\n elif c > m:\r\n wins[1] += 1\r\nif wins[0] > wins[1]:\r\n print('Mishka')\r\nelif wins[0] < wins[1]:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n = int(input())\r\n\r\ns_m = 0\r\ns_k = 0\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n t_1 = int(s[0])\r\n t_2 = int(s[1])\r\n if t_1 > t_2:\r\n s_m += 1\r\n elif t_1 < t_2:\r\n s_k += 1\r\nif s_m > s_k:\r\n print('Mishka')\r\nelif s_m < s_k:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "m = 0\r\nc = 0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if(a>b):\r\n m=m+1\r\n elif(b>a):\r\n c = c +1 \r\n \r\n \r\nif(m>c):\r\n print(\"Mishka\")\r\nelif(c>m):\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\r\n\r\nmishka = chris = 0\r\n\r\nfor i in range(n):\r\n \r\n x, y = map(int, input().split())\r\n \r\n if x > y:\r\n mishka+=1\r\n elif x < y:\r\n chris+=1\r\n \r\nif mishka == chris:\r\n print('Friendship is magic!^^')\r\nelif mishka > chris:\r\n print('Mishka') \r\nelse:\r\n print('Chris')\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nm=0\r\nc=0\r\nfor i in range(n):\r\n a=input().split()\r\n a[0]=int(a[0])\r\n a[1]=int(a[1])\r\n if(a[0]==a[1]):\r\n continue\r\n if(a[0]>a[1]):\r\n m+=1\r\n continue\r\n c+=1\r\n\r\nif(m>c):\r\n print(\"Mishka\")\r\nelif (m==c):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")\r\n", "num = int(input())\r\nThe_First = 0\r\nThe_Scend = 0\r\nfor x in range(num):\r\n str1 = input().split()\r\n str1 = [int(a) for a in str1]\r\n if str1[0] > str1[1] : The_First += 1\r\n elif str1[1] > str1[0] : The_Scend +=1\r\n\r\nif The_First > The_Scend : print(\"Mishka\")\r\nelif The_Scend > The_First : print(\"Chris\")\r\nelse : print(\"Friendship is magic!^^\")\r\n", "# 코드포스 703A Mishka and Game\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn = int(put())\r\nm = c = 0\r\n\r\nwhile n:\r\n n -= 1\r\n mi, ci = map(int, put().split())\r\n\r\n if mi > ci:\r\n m += 1\r\n elif mi < ci:\r\n c += 1\r\n\r\nif m > c:\r\n print(\"Mishka\")\r\nelif m < c:\r\n print(\"Chris\")\r\nelse:\r\n print(\"Friendship is magic!^^\")", "n = int(input())\nw = 0\nl = 0\nfor i in range(n):\n a,b = map(int,input().split())\n if a>b:\n w+=1\n elif a<b:\n l+=1\nif w>l:\n print('Mishka')\nelif w<l:\n print('Chris')\nelse:\n print('Friendship is magic!^^')\n ", "n1,n2=0,0\r\nfor _ in range(int(input())):\r\n m,c=map(int,input().split())\r\n if(m>c):\r\n n1+=1\r\n if m<c:\r\n n2+=1\r\nif n1>n2:\r\n print('Mishka')\r\nelif(n1<n2):\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "\r\ncol_vo = int(input())\r\nM = 0\r\nC = 0\r\nfor i in range(col_vo):\r\n lis = list(input().split())\r\n lis = [int(x) for x in lis]\r\n if lis[0] > lis[1]:\r\n M+=1\r\n elif lis[1] > lis[0]:\r\n C+=1\r\nif M > C:\r\n print('Mishka')\r\nelif M < C:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "# -*- coding: utf-8 -*-\n\"\"\"703A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1VL-9KhdDhp9SohKC3BDfb29dEq0aWdBZ\n\"\"\"\n\nn = int(input())\nm = 0\nc = 0\nfor i in range(n):\n a,b = [int(i) for i in input().split()]\n if a > b:\n m += 1\n if b > a:\n c += 1\nif m > c:\n print('Mishka')\nif c > m:\n print('Chris')\nif c == m:\n print('Friendship is magic!^^')", "m = 0\r\nc = 0\r\nfor i in range(int(input())):\r\n a,b = map(int, input().split())\r\n if a>b:\r\n m += 1\r\n elif a<b:\r\n c += 1\r\nprint('Mishka' if m>c else ('Friendship is magic!^^' if m==c else 'Chris'))", "n = int(input())\r\ncntm = 0\r\ncntk = 0\r\nfor i in range(n):\r\n m, k = map(int, input().split())\r\n if m > k:\r\n cntm += 1\r\n elif k > m:\r\n cntk += 1\r\nif cntm > cntk:\r\n print('Mishka')\r\nelif cntk > cntm:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')", "n=int(input())\r\nm1=0\r\nc1=0\r\nfor i in range(n):\r\n m,c=map(int,input().split())\r\n if(m>c):\r\n m1=m1+1\r\n elif(m==c):\r\n m1=m1\r\n else:\r\n c1=c1+1\r\nif(m1>c1):\r\n print(\"Mishka\")\r\nelif(m1==c1):\r\n print(\"Friendship is magic!^^\")\r\nelse:\r\n print(\"Chris\")\r\n \r\n " ]

[ "lt = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A' ,'B', 'H']\r\nmajor = [[4,3], [3,5], [5,4]]\r\nminor = [[3,4], [4,5], [5,3]]\r\n\r\nx,y,z = input().split()\r\nind = [lt.index(p) for p in (x,y,z)]\r\nind.sort()\r\ndiff = [ind[1]-ind[0], ind[2]-ind[1]]\r\nif diff in major:\r\n print('major')\r\nelif diff in minor:\r\n print('minor')\r\nelse:\r\n print('strange')", "notes = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n\r\n\r\ndef get_index(s):\r\n for i in range (12):\r\n if notes[i] == s:\r\n return i\r\n return 0\r\n\r\n\r\ndef check(index1, index2, index3):\r\n first_tones = 0\r\n second_tones = 0\r\n\r\n if index2 < index1:\r\n first_tones = index2 + 12 - index1\r\n else:\r\n first_tones = index2 - index1\r\n\r\n if index3 < index2:\r\n second_tones = index3 + 12 - index2\r\n else:\r\n second_tones = index3 - index2\r\n\r\n if first_tones == 4 and second_tones == 3:\r\n return \"major\"\r\n elif first_tones == 3 and second_tones == 4:\r\n return \"minor\"\r\n else:\r\n return \"strange\"\r\n\r\n\r\ns1, s2, s3 = input ().split ()\r\n\r\nindex1 = get_index (s1)\r\nindex2 = get_index (s2)\r\nindex3 = get_index (s3)\r\n\r\ns = []\r\ns.append (check (index1, index2, index3))\r\ns.append (check (index1, index3, index2))\r\ns.append (check (index2, index1, index3))\r\ns.append (check (index2, index3, index1))\r\ns.append (check (index3, index1, index2))\r\ns.append (check (index3, index2, index1))\r\n\r\nfor i in range (6):\r\n if s[i] == \"major\" or s[i] == \"minor\":\r\n print (s[i])\r\n break\r\nelse:\r\n print (\"strange\")", "import itertools\n\ndef diff(a):\n\td = []\n\tfor i, j in list(itertools.combinations(range(3), 2)):\n\t\tc = abs(a[j]-a[i])\n\t\td.append(c)\n\t\td.append(12-c)\n\treturn d\n\ns = input().split()\n\nnote = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\nminor = [[3, 9, 7, 5, 4, 8], [5, 7, 8, 4, 3, 9], [4, 8, 9, 3, 5, 7]]\nmajor = [[4, 8, 7, 5, 3, 9], [5, 7, 9, 3, 4, 8], [3, 9, 8, 4, 5, 7]]\nl = [note.index(n) for n in s]\nl.sort()\nans = diff(l)\n# print(ans)\n\nif ans in major:\n\tprint(\"major\")\nelif ans in minor:\n\tprint(\"minor\")\nelse :\n\tprint(\"strange\")\n\n", "def solve():\r\n def test_major_minor(x, y, z):\r\n # Major chord = {x, y, z} = {x, x +4, x +7}(mod 12).\r\n if (x+4)%12 == y and (y+3)%12 == z:\r\n print('major')\r\n return 1\r\n # Minor chord = {x, y, z} = {x, x+3, x+7}(mod 12).\r\n if (x+3)%12 == y and (y+4)%12 == z:\r\n print('minor')\r\n return 1\r\n return 0\r\n\r\n # define notes\r\n n = ['C','C#','D','D#','E','F','F#','G','G#','A','B','H']\r\n # Read input\r\n x, y, z = map(n.index,input().split())\r\n if test_major_minor(x,y,z) == 1:\r\n return\r\n if test_major_minor(x,z,y) == 1:\r\n return\r\n if test_major_minor(y,x,z) == 1:\r\n return\r\n if test_major_minor(y,z,x) == 1:\r\n return\r\n if test_major_minor(z,x,y) == 1:\r\n return\r\n if test_major_minor(z,y,x) == 1:\r\n return\r\n print('strange')\r\n\r\nsolve()", "li = list(map(str, input().rstrip().split()))\nflag = 0 # Strange 1 - Major 2-Minor\nchords = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\n\ndef getDistance(x, y):\n xi = chords.index(x)\n yi = chords.index(y)\n dist = abs(xi - yi)\n dist = min(dist, 12 - dist)\n return dist\n\ndef checkMajor(x, y, z):\n xi = chords.index(x)\n yi = chords.index(y)\n zi = chords.index(z)\n if yi == (xi + 4) % 12 and zi == (xi + 7) % 12:\n return True\n\n return False\ndef checkMinor(x, y, z):\n xi = chords.index(x)\n yi = chords.index(y)\n zi = chords.index(z)\n if yi == (xi + 3) % 12 and zi == (xi + 7) % 12:\n return True\n return False\n\nif checkMajor(li[0], li[1], li[2]) == True:\n flag = 1\nelif checkMajor(li[0], li[2], li[1]) == True:\n flag = 1\nelif checkMajor(li[1], li[2], li[0]) == True:\n flag = 1\nelif checkMajor(li[1], li[0], li[2]) == True:\n flag = 1\nelif checkMajor(li[2], li[1], li[0]) == True:\n flag = 1\nelif checkMajor(li[2], li[0], li[1]) == True:\n flag = 1\nelif checkMinor(li[0], li[1], li[2]) == True:\n flag = 2\nelif checkMinor(li[0], li[2], li[1]) == True:\n flag = 2\nelif checkMinor(li[1], li[0], li[2]) == True:\n flag = 2\nelif checkMinor(li[1], li[2], li[0]) == True:\n flag = 2\nelif checkMinor(li[2], li[1], li[0]) == True:\n flag = 2\nelif checkMinor(li[2], li[0], li[1]) == True:\n flag = 2\nif flag == 1:\n print(\"major\")\nelif flag == 2:\n print(\"minor\")\nelse:\n print(\"strange\")", "notes = input().split()\r\nnotes_inted = []\r\nfor each in notes:\r\n if each == \"C\":\r\n notes_inted.append(0)\r\n if each == \"C#\":\r\n notes_inted.append(1)\r\n if each == \"D\":\r\n notes_inted.append(2)\r\n if each == \"D#\":\r\n notes_inted.append(3)\r\n if each == \"E\":\r\n notes_inted.append(4)\r\n if each == \"F\":\r\n notes_inted.append(5)\r\n if each == \"F#\":\r\n notes_inted.append(6)\r\n if each == \"G\":\r\n notes_inted.append(7)\r\n if each == \"G#\":\r\n notes_inted.append(8)\r\n if each == \"A\":\r\n notes_inted.append(9)\r\n if each == \"B\":\r\n notes_inted.append(10)\r\n if each == \"H\":\r\n notes_inted.append(11)\r\nnotes_inted = list(sorted(notes_inted))\r\ndef distance(a, b):\r\n if a < b:\r\n return b - a\r\n return 12 - (a-b)\r\ndef solve():\r\n \r\n for i in range(3):\r\n if distance(notes_inted[i], notes_inted[(i+1)%3]) == 3 and distance(notes_inted[i], notes_inted[(i+2)%3]) == 7:\r\n print(\"minor\")\r\n return\r\n if distance(notes_inted[i], notes_inted[(i+1)%3]) == 4 and distance(notes_inted[i], notes_inted[(i+2)%3]) == 7:\r\n print(\"major\")\r\n return\r\n print(\"strange\")\r\n \r\nsolve()", "from itertools import permutations \r\nk,l,m=input().split()\r\na=['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nx=[]\r\nf=0\r\nx.append(a.index(k))\r\nx.append(a.index(l))\r\nx.append(a.index(m))\r\np=list(permutations(x))\r\nfor i in p:\r\n d1=i[1]-i[0] if(i[0]<=i[1]) else i[1]-i[0]+12\r\n d2=i[2]-i[1] if(i[1]<=i[2]) else i[2]-i[1]+12\r\n if(d1==3 and d2==4):\r\n f=1\r\n print(\"minor\")\r\n break\r\n if(d1==4 and d2==3):\r\n f=1\r\n print(\"major\")\r\n break\r\nif(f==0):\r\n print(\"strange\")", "l = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\nl = l*3\r\na,b,c = [str(x) for x in input().split()]\r\ns = [[a,b,c],[c,b,a],[a,c,b],[c,a,b],[b,a,c],[b,c,a]]\r\nfor o in s:\r\n a,b,c = o\r\n for i in range(0,len(l)):\r\n if l[i] == a: \r\n x = i\r\n break\r\n for i in range(x+1,len(l)):\r\n if l[i] == b: \r\n y = i\r\n break\r\n for i in range(y+1,len(l)):\r\n if l[i] == c: \r\n z = i\r\n break\r\n \r\n \r\n if y-x == 4 and z-y == 3:\r\n print(\"major\")\r\n k = False\r\n break\r\n elif y-x == 3 and z-y == 4:\r\n print(\"minor\")\r\n k = False\r\n break\r\n else:\r\n k = True\r\n\r\nif k: print('strange')\r\n", "\r\nfrom itertools import permutations\r\n\r\ndef major(rank,x1,x2,x3):\r\n first=(rank[x2]-rank[x1])%12\r\n second=(rank[x3]-rank[x2])%12\r\n if(first==4 and second==3):\r\n return True\r\n return False\r\n\r\ndef minor(rank,x1,x2,x3):\r\n first=(rank[x2]-rank[x1])%12\r\n second=(rank[x3]-rank[x2])%12\r\n if(first==3 and second==4):\r\n return True\r\n return False\r\n\r\ntriad=input().split()\r\nrank={'C':1,'C#':2,'D':3,'D#':4,'E':5,'F':6,'F#':7,'G':8,'G#':9,'A':10,'B':11,'H':12}\r\ntriad=list(permutations(triad))\r\nco=False\r\nfor each in triad:\r\n if(major(rank,each[0],each[1],each[2]) and not co):\r\n print(\"major\")\r\n co=True\r\n elif(minor(rank,each[0],each[1],each[2]) and not co):\r\n print(\"minor\")\r\n co=True\r\n if(co):\r\n break\r\nif(not co):\r\n print('strange')", "a = input().split(\" \")\r\norder = {\r\n \"C\": 0,\r\n \"C#\": 1,\r\n \"D\": 2,\r\n \"D#\": 3,\r\n \"E\": 4,\r\n \"F\": 5,\r\n \"F#\": 6,\r\n \"G\": 7,\r\n \"G#\": 8,\r\n \"A\": 9,\r\n \"B\": 10,\r\n \"H\": 11\r\n}\r\n\r\ndef diff(a, b):\r\n if (order[a] - order[b]) > 0:\r\n return order[a] - order[b]\r\n else:\r\n return 12 + (order[a] - order[b])\r\n\r\nflag = False\r\nfor i in range(3):\r\n b = a\r\n temp = a[i]\r\n a[i] = a[0]\r\n a[0] = temp\r\n for j in range(2):\r\n if (diff(a[1], a[0]) == 4 and diff(a[2], a[1]) == 3):\r\n print(\"major\")\r\n flag = True\r\n break\r\n if (diff(a[1], a[0]) == 3 and diff(a[2], a[1]) == 4):\r\n print(\"minor\")\r\n flag = True\r\n break\r\n temp = a[1]\r\n a[1] = a[2]\r\n a[2] = temp\r\n\r\nif (flag == False):\r\n print(\"strange\")", "from itertools import permutations\nd = {\"C\": 0, \"C#\": 1, \"D\": 2, \"D#\": 3, \"E\": 4, \"F\": 5,\n \"F#\": 6, \"G\": 7, \"G#\": 8, \"A\": 9, \"B\": 10, \"H\": 11}\ns = input().split()\narr = [d[i] for i in s]\n\n\ndef f(arr):\n for i in permutations(arr):\n x, y, z = i\n a = (y-x) % 12\n b = (z-y) % 12\n if a == 3 and b == 4:\n return \"minor\"\n elif a == 4 and b == 3:\n return \"major\"\n return \"strange\"\n\n\nprint(f(arr))\n", "def perm(x,y,z) :\n d={'C':1, 'C#':2, 'D':3, 'D#':4, 'E':5, 'F':6, 'F#':7, 'G':8, 'G#':9, 'A':10, 'B':11, 'H':12}\n f=d[y]-d[x] if d[y]-d[x]>0 else d[y]-d[x]+12\n f2=d[z]-d[y] if d[z]-d[y]>0 else d[z]-d[y]+12\n \n\n if f==3 and f2==4 :\n return \"minor\"\n if f==4 and f2==3 :\n return \"major\"\n\ndef solve():\n val=perm(x,y,z)\n if val:\n return val\n val=perm(x,z,y)\n if val:\n return val\n val=perm(y,x,z)\n if val:\n return val\n val=perm(y,z,x)\n if val:\n return val\n val=perm(z,y,x)\n if val:\n return val\n val=perm(z,x,y)\n if val:\n return val\n return \"strange\"\n \n\n\n\n\n\n \nfrom sys import stdin\ninput = stdin.readline \n \n \n\nx,y,z= [x for x in input().split()]\nprint(solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([x for x in input().strip()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n'''", "l=['C','C#','D','D#','E','F','F#','G','G#','A','B','H']\na=input().split()\nfor i in range(3):\n a[i]=l.index(a[i])\na.sort()\nb = (a[1] - a[0], a[2] - a[1])\nif b in ((4, 3), (3, 5), (5, 4)):\n print('major')\nelif b in ((3, 4), (4, 5), (5, 3)):\n print('minor')\nelse:\n print('strange')\n \n \t \t \t \t\t \t\t \t\t\t\t\t\t\t\t", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n a = list(\"C,C#,D,D#,E,F,F#,G,G#,A,B,H\".split(\",\"))\r\n\r\n s = list(map(str, input().split()))\r\n s = [a.index(s[i]) for i in range(3)]\r\n\r\n major = False\r\n minor = False\r\n\r\n for p in itertools.permutations(s):\r\n l = [(12 + p[1] - p[0]) % 12, (12 + p[2] - p[1]) % 12]\r\n if l == [4, 3]:\r\n major = True\r\n elif l == [3, 4]:\r\n minor = True\r\n\r\n if not major and not minor:\r\n print(\"strange\")\r\n else:\r\n if major:\r\n print(\"major\")\r\n else:\r\n print(\"minor\")\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "def low(ele,e2,e3,l):\r\n loc1=-1\r\n loc2=-1\r\n for i in range(l.index(ele),12):\r\n if l[i]==e2:\r\n loc1=i\r\n if l[i]==e3:\r\n loc2=i\r\n if loc1==-1:\r\n d1=12-l.index(ele)+l.index(e2)\r\n elif loc1!=-1:\r\n d1=loc1-l.index(ele)\r\n if loc2==-1:\r\n d2=12-l.index(ele)+l.index(e3)\r\n elif loc2!=-1:\r\n d2=loc2-l.index(ele)\r\n return d1,d2\r\nl=['C', 'C#', 'D', 'D#', 'E', 'F','F#', 'G', 'G#', 'A','B', 'H']\r\nX,Y,Z=[str(x) for x in input().split()]\r\n#x is lowest \r\nx1,x2=low(X,Y,Z,l)\r\nif (x1==4 and x2==7) or (x1==7 and x2==4):\r\n print(\"major\")\r\nelif (x1==3 and x2==7) or(x1==7 and x2==3):\r\n print(\"minor\")\r\nelse:\r\n y1,y2=low(Y,X,Z,l)\r\n if (y1==4 and y2==7) or (y1==7 and y2==4):\r\n print(\"major\")\r\n elif (y1==3 and y2==7) or(y1==7 and y2==3):\r\n print(\"minor\")\r\n else:\r\n z1,z2=low(Z,X,Y,l)\r\n if (z1==4 and z2==7) or (z1==7 and z2==4):\r\n print(\"major\")\r\n elif (z1==3 and z2==7) or(z1==7 and z2==3):\r\n print(\"minor\")\r\n else:\r\n print(\"strange\")", "import math\nfrom collections import defaultdict\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:(input())\n\n\"\"\"========main code===============\"\"\"\n\na,b,c=input().split()\nlol= ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\n\nn=len(lol)\nans=[]\nfor i in range(n):\n if(lol[i]==a) and ((lol[(i+4)%n]==b and lol[(i+7)%n]==c) or (lol[(i+4)%n]==c and lol[(i+7)%n]==b)):\n ans.append(\"major\")\n break\n elif(lol[i]==b) and ((lol[(i+4)%n]==a and lol[(i+7)%n]==c) or (lol[(i+4)%n]==c and lol[(i+7)%n]==a)):\n ans.append(\"major\")\n break\n elif(lol[i]==c) and ((lol[(i+4)%n]==b and lol[(i+7)%n]==a) or (lol[(i+4)%n]==a and lol[(i+7)%n]==b)):\n ans.append(\"major\")\n break\nif(len(ans)==0):\n for i in range(n):\n if(lol[i]==a) and ((lol[(i+3)%n]==b and lol[(i+7)%n]==c) or (lol[(i+3)%n]==c and lol[(i+7)%n]==b)):\n ans.append(\"minor\")\n break\n elif(lol[i]==b) and ((lol[(i+3)%n]==a and lol[(i+7)%n]==c) or (lol[(i+3)%n]==c and lol[(i+7)%n]==a)):\n ans.append(\"minor\")\n break\n elif(lol[i]==c) and ((lol[(i+3)%n]==b and lol[(i+7)%n]==a) or (lol[(i+3)%n]==a and lol[(i+7)%n]==b)):\n ans.append(\"minor\")\n break\nif(len(ans)==0):\n print(\"strange\")\nelse:\n print(ans[0])\n \n\t\t \t \t\t\t\t \t \t", "\r\ndef tipo_acorde(nota1, nota2, nota3):\r\n if (((nota1 + 4)%12 == nota2 and (nota2 + 3)%12 == nota3) or\r\n ((nota1 + 4)%12 == nota3 and (nota3 + 3)%12 == nota2)):\r\n return 'major'\r\n elif (((nota1 + 3)%12 == nota2 and (nota2 + 4)%12 == nota3) or \r\n ((nota1 + 3)%12 == nota3 and (nota3 + 4)%12 == nota2)):\r\n return 'minor'\r\n else:\r\n return 'strange'\r\n\r\nescala_musical = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nnota = input().split()\r\nubicacion_nota = []\r\n\r\nfor i in range(3):\r\n j = 0\r\n encontrado = False\r\n while j<12 and (not encontrado):\r\n if nota[i] == escala_musical[j]:\r\n ubicacion_nota.append(j)\r\n encontrado = True\r\n j = j+1\r\n\r\nacorde = 'strange'\r\ni = 0\r\nwhile i<3 and acorde == 'strange':\r\n intento_acorde = tipo_acorde(ubicacion_nota[i], ubicacion_nota[(i+1)%3], ubicacion_nota[(i+2)%3])\r\n if intento_acorde != 'strange':\r\n acorde = intento_acorde\r\n i = i+1\r\n\r\nprint(acorde) \r\n", "def kind(a,b,c):\n\tif a==4 and b==3:\n\t\treturn \"major\"\n\tif a==3 and b==4:\n\t\treturn \"minor\"\n\tif b==4 and c==3:\n\t\treturn \"major\"\n\tif b==3 and c==4:\n\t\treturn \"minor\"\n\tif c==4 and a==3:\n\t\treturn \"major\"\n\tif c==3 and a==4:\n\t\treturn \"minor\"\n\treturn \"strange\"\n\nnote = [n for n in \"C,C#,D,D#,E,F,F#,G,G#,A,B,H\".split(',')]\nd={}\nfor n in range(12):\n\td[note[n]]=n\n\ntri = [d[i] for i in input().split()]\ntri.sort()\nd1 = tri[1]-tri[0]\nd2 = tri[2]-tri[1]\nd3 = 12 - tri[2]+tri[0]\n\nprint(kind(d1,d2,d3))", "def check(A,B,C):\r\n\tx = a.index(A)\r\n\ty = a.index(B)\r\n\tz = a.index(C)\r\n\tif((y-x)%12 == 4 and (z-y)%12 == 3):\r\n\t\tprint(\"major\")\r\n\t\texit(0)\r\n\telif((y-x)%12 == 3 and (z-y)%12 == 4):\r\n\t\tprint(\"minor\")\r\n\t\texit(0)\r\n\r\na = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nA,B,C = input().split()\r\ncheck(A,B,C)\r\ncheck(A,C,B)\r\ncheck(B,A,C)\r\ncheck(B,C,A)\r\ncheck(C,A,B)\r\ncheck(C,B,A)\r\nprint(\"strange\")", "def check_note(check):\r\n out_list = list(); curr = 0\r\n for i in range(len(notes)):\r\n if(notes[i] in check):\r\n out_list.append(i)\r\n for i in range(len(out_list) - 2):\r\n if(out_list[i+1] - out_list[i] == 4 and out_list[i+2] - out_list[i + 1] == 3):\r\n return \"major\"\r\n for i in range(len(out_list) - 2):\r\n if(out_list[i+1] - out_list[i] == 3 and out_list[i + 2] - out_list[i + 1] == 4):\r\n return \"minor\"\r\n return \"strange\"\r\n\r\nnotes = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H', \\\r\n 'C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H', \\\r\n 'C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\n\r\ncheck = input().split();\r\nprint(check_note(check))", "from itertools import permutations\r\n\r\narr = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n\r\ns = input().split()\r\n\r\nfor a, b, c in permutations(s):\r\n oa = arr.index(a)\r\n ob = arr.index(b)\r\n oc = arr.index(c)\r\n\r\n if (ob - oa) % 12 == 3 and (oc - ob) % 12 == 4:\r\n print(\"minor\")\r\n exit(0)\r\n elif (ob - oa) % 12 == 4 and (oc - ob) % 12 == 3:\r\n print(\"major\")\r\n exit(0)\r\n\r\nprint(\"strange\")\r\n", "from itertools import permutations\r\nnotes = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nnotes += notes\r\ndef getDist(a, b):\r\n for i in range(len(notes)):\r\n if notes[i] == a:\r\n for j in range(i + 1, len(notes)):\r\n if notes[j] == b:\r\n return j - i\r\ndef isMajor(a, b, c):\r\n if getDist(a, b) == 4 and getDist(b, c) == 3:\r\n return True\r\n return False\r\ndef isMinor(a, b, c):\r\n if getDist(a, b) == 3 and getDist(b, c) == 4:\r\n return True\r\n return False\r\nx, y, z = input().split()\r\nx, y, z = sorted(list([x, y, z]))\r\np = list(permutations([x, y, z]))\r\nfor perm in p:\r\n a, b, c = perm\r\n if isMajor(a, b, c):\r\n print('major')\r\n exit()\r\n elif isMinor(a, b, c):\r\n print('minor')\r\n exit()\r\n \r\nprint('strange')", "notes = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nlst = input().strip().split()\r\nlst1 = []\r\nfor x in lst:\r\n lst1.append(notes.index(x))\r\nlst1.sort()\r\nlst[0] = lst1[1] - lst1[0]\r\nlst[1] = lst1[2] - lst1[1]\r\nlst[2] = lst1[2] - lst1[0]\r\nif (lst[0], lst[1]) == (3, 4) or (lst[1], lst[2]) == (3, 8) or (lst[2], lst[0]) == (9, 4):\r\n print(\"minor\")\r\nelif (lst[0], lst[1]) == (4, 3) or (lst[1], lst[2]) == (4, 9) or (lst[2], lst[0]) == (8, 3):\r\n print(\"major\")\r\nelse:\r\n print(\"strange\")", "def abs(x,y):\r\n if(y>x):\r\n return y-x\r\n else:\r\n return 12-(x-y)\r\nk=[\"C\", \"C#\" , \"D\" , \"D#\" , \"E\" , \"F\" , \"F#\" , \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\nl=[i for i in input().split()]\r\na=k.index(l[0])\r\nb=k.index(l[1])\r\nc=k.index(l[2])\r\n\r\nx1=abs(a,b)\r\nx2=abs(b,a)\r\ny1=abs(b,c)\r\ny2=abs(c,b)\r\nz1=abs(a,c)\r\nz2=abs(c,a)\r\n\r\nif((x1==3 and y1==4) or (z1==3 and y2==4) or (x2==3 and z1==4) or (y1==3 and z2==4) or (z2==3 and x1==4) or (y2==3 and x2==4)):\r\n print(\"minor\")\r\nelif((x1==4 and y1==3) or (z1==4 and y2==3) or (x2==4 and z1==3) or (y1==4 and z2==3) or (z2==4 and x1==3) or (y2==4 and x2==3)):\r\n print(\"major\")\r\nelse:\r\n print(\"strange\")\r\n", "n = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\ni = sorted(n.index(x) for x in input().split())\r\nc = (i[1] - i[0], i[2] - i[1])\r\nif c in ((4, 3), (3, 5), (5, 4)):\r\n print('major')\r\nelif c in ((3, 4), (4, 5), (5, 3)):\r\n print('minor')\r\nelse:\r\n print('strange')", "l=['C','C#','D','D#','E','F','F#','G','G#','A','B','H']\r\na=input().split()\r\nfor i in range(3):\r\n a[i]=l.index(a[i])\r\na.sort()\r\nb = (a[1] - a[0], a[2] - a[1])\r\nif b in ((4, 3), (3, 5), (5, 4)):\r\n print('major')\r\nelif b in ((3, 4), (4, 5), (5, 3)):\r\n print('minor')\r\nelse:\r\n print('strange')\r\n\r\n\r\n\r\n", "a,b,c=[{'C':1 ,'C#':2 ,'D':3 ,'D#':4 ,'E':5 ,'F':6 ,'F#':7 ,'G':8 ,'G#':9 ,'A':10 ,'B':11 ,'H':12}[i] for i in input().split()]\r\nd=[[(b-a)%12,(c-b)%12],[(c-a)%12,(b-c)%12],[(a-b)%12,(c-a)%12],[(c-b)%12,(a-c)%12],[(a-c)%12,(b-a)%12],[(b-c)%12,(a-b)%12]]\r\nif [4,3] in d:\r\n print('major')\r\nelif [3,4] in d:\r\n print('minor')\r\nelse:\r\n print('strange')", "p = input().split()\r\nt = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nq = sorted([t.index(i) for i in p])\r\nif q[2] - q[0] != 7: q = q[1: ] + [q[0] + 12]\r\nif q[2] - q[0] != 7: q = q[1: ] + [q[0] + 12]\r\nif q[1] - q[0] == 4 and q[2] - q[1] == 3: print('major')\r\nelif q[1] - q[0] == 3 and q[2] - q[1] == 4: print('minor')\r\nelse: print('strange')", "L=list(input().split())\r\nA=['C','C#','D','D#','E','F','F#','G','G#','A','B','H','C','C#','D','D#','E','F','F#','G','G#','A','B','H','C','C#','D','D#','E','F','F#','G','G#','A','B','H']\r\nAns=\"strange\"\r\nfor a in L:\r\n for b in L:\r\n for c in L:\r\n if(a==b or b==c or a==c):\r\n continue\r\n x=A.index(a)\r\n y=A.index(b,x+1)\r\n z=A.index(c,y+1)\r\n if(y-x==4 and z-y==3):\r\n Ans=\"major\"\r\n if(y-x==3 and z-y==4):\r\n Ans=\"minor\"\r\nprint(Ans)\r\n", "notes = {\n \"C\": 0,\n \"C#\": 1,\n \"D\": 2,\n \"D#\": 3,\n \"E\": 4,\n \"F\": 5,\n \"F#\": 6,\n \"G\": 7,\n \"G#\": 8,\n \"A\": 9,\n \"B\": 10,\n \"H\": 11\n}\n\na = list(map(str, input().split()))\nn = len(a)\nv = []\nz = [0]*n\ne = 0\ndef gen():\n global e\n if len(v) == n:\n if (v[1]-v[0])%12 == 4 and (v[2]-v[1])%12 == 3:\n print(\"major\")\n e = 1\n return\n elif (v[1]-v[0])%12 == 3 and (v[2]-v[1])%12 == 4:\n print(\"minor\")\n e = 1\n return\n else:\n for i in range(n):\n if z[i]: continue\n z[i] = 1\n v.append(notes[a[i]])\n gen()\n z[i] = 0\n v.pop()\n\ngen()\nif not e: print(\"strange\") \n", "import itertools\r\ntone = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\nnum = itertools.permutations(input().split())\r\nfor arr in num:\r\n a, b, c = arr\r\n ind_a = tone.index(a)\r\n ind_b = tone.index(b)\r\n ind_c = tone.index(c)\r\n ind_a = ind_a if ind_a < 12 else 12 + ind_a\r\n ind_b = ind_b if ind_b > ind_a else 12 + ind_b\r\n ind_c = ind_c if ind_c > ind_b else 12 + ind_c\r\n if ind_b - ind_a == 4 and ind_c - ind_b == 3:\r\n print(\"major\")\r\n break\r\n elif ind_b - ind_a == 3 and ind_c - ind_b == 4:\r\n print(\"minor\")\r\n break\r\nelse:\r\n print(\"strange\")\r\n", "l=['C','C#','D','D#','E','F','F#','G','G#','A','B','H']\r\nl={l[i]:i+1 for i in range(12)}\r\na=list(map(str, input().split()))\r\ndef perm1(lst):\r\n if len(lst)==0:\r\n return []\r\n elif len(lst)==1:\r\n return [lst]\r\n else:\r\n l=[]\r\n for i in range(len(lst)):\r\n x=lst[i]\r\n xs=lst[:i]+lst[i+1:]\r\n for p in perm1(xs):\r\n l.append([x]+p)\r\n return l\r\nans=[]\r\nfor p in perm1(a):\r\n ans.append(tuple(p))\r\nans1=set(ans)\r\ndef fn(ans1):\r\n for i in ans1:\r\n d1=d2=0\r\n if l[i[1]]-l[i[0]]<0:d1=12+l[i[1]]-l[i[0]]\r\n else:d1=l[i[1]]-l[i[0]]\r\n if l[i[2]]-l[i[1]]<0:d2=12+l[i[2]]-l[i[1]]\r\n else:d2=l[i[2]]-l[i[1]]\r\n if d1==4 and d2==3:return 'major'\r\n elif d1==3 and d2==4:return 'minor'\r\n return 'strange'\r\nprint(fn(ans1))\r\n", "a={\"C\":1, \"C#\":2, \"D\":3, \"D#\":4, \"E\":5, \"F\":6, \"F#\":7, \"G\":8, \"G#\":9, \"A\":10, \"B\":11, \"H\":12}\r\nx,y,z=input().split()\r\nb=sorted([a[x],a[y],a[z]])\r\nc=[b[1]-b[0],b[2]-b[1]]\r\nif c[0]==4 and c[1]==3 or c[0]==3 and c[1]==5 or c[0]==5 and c[1]==4:\r\n print(\"major\")\r\nelif c[0]==3 and c[1]==4 or c[0]==5 and c[1]==3 or c[0]==4 and c[1]==5:\r\n print(\"minor\")\r\nelse:\r\n print(\"strange\")\r\n", "l=[\"C\",\"C#\",\"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\nfrom itertools import permutations\r\na=input().split()\r\ndef distance(x,y):\r\n s=l.index(x);d=0\r\n while True:\r\n try:\r\n if l[s]==y:\r\n break\r\n except:s=-1;d-=1\r\n s+=1;d+=1\r\n return d\r\na=list(permutations(a))\r\nfor i in a:\r\n if distance(i[0],i[1])==4 and distance(i[1],i[2])==3:\r\n print(\"major\");exit()\r\n elif distance(i[0],i[1])==3 and distance(i[1],i[2])==4:\r\n print(\"minor\");exit()\r\nprint(\"strange\")\r\n \r\n", "#-- C, C#, D, D#, E, F, F#, G, G#, A, B, H\na=['C','C#','D','D#','E','F','F#','G','G#','A','B','H']\nc = []\nd = [0,0,0]\nfor x in list(input().split()):c.append(a.index(x))\nc.sort()\nfor x in range(1,3):\n\tif (c[0] + 12) <= (c[-1] + 4):\n\t\tc[0] = c[0] + 12\n\t\tc.sort()\nif (c[1]-c[0])==4 and (c[2]-c[1])==3:\n\tprint('major')\nelif (c[1]-c[0])==3 and (c[2]-c[1])==4:\n\tprint(\"minor\")\nelse:print(\"strange\")", "l1=['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nl2=list(input().split())\r\nl3=[]\r\nfor item in l2:\r\n l3.append(l1.index(item)+1)\r\nl3.sort()\r\na,b,c=l3[0],l3[1],l3[2]\r\nif ((b-a)==3 and (c-b)==4 ) or ( (c-b)==3 and ((a-c)%12)==4) or ( ((a-c)%12)==3 and (b-a)==4):\r\n print(\"minor\")\r\nelif ((b-a)==4 and (c-b)==3 ) or ( (c-b)==4 and ((a-c)%12)==3) or ( ((a-c)%12)==4 and (b-a)==3):\r\n print(\"major\")\r\nelse :\r\n print(\"strange\")", "c=['C','C#','D','D#','E','F','F#','G','G#','A','B','H']\r\nx,y,z=sorted(map(c.index,input().split()))\r\nfor _ in' '*3:\r\n a,b=(y+12-x)%12,(z+12-y)%12\r\n if [a,b]==[4,3]:\r\n print('major')\r\n exit()\r\n if [a,b]==[3,4]:\r\n print('minor')\r\n exit()\r\n x,y,z=y,z,x\r\nprint('strange')", "x,y,z = input().split()\r\nkeys = {\"C\":1, \"C#\":2, \"D\":3, \"D#\":4, \"E\":5, \"F\":6, \"F#\":7,\r\n \"G\":8, \"G#\":9, \"A\":10, \"B\":11, \"H\":12}\r\n\r\ndef dist(x, y):\r\n if keys[y]>=keys[x]:\r\n return keys[y]-keys[x]\r\n return keys[y]+12-keys[x]\r\n\r\n\r\nif (dist(x,y)==4 and dist(y,z)==3 and dist(x,z)==7) or (dist(x,z)==4 and dist(z,y)==3 and dist(x,y)==7) or (dist(y,x)==4 and dist(x,z)==3 and dist(y,z)==7) or (dist(y,z)==4 and dist(z,x)==3 and dist(y,x)==7) or (dist(z,x)==4 and dist(x,y)==3 and dist(z,y)==7) or (dist(z,y)==4 and dist(y,x)==3 and dist(z,x)==7):\r\n print(\"major\")\r\nelif (dist(x,y)==3 and dist(y,z)==4 and dist(x,z)==7) or (dist(x,z)==3 and dist(z,y)==4 and dist(x,y)==7) or (dist(y,x)==3 and dist(x,z)==4 and dist(y,z)==7) or (dist(y,z)==3 and dist(z,x)==4 and dist(y,x)==7) or (dist(z,x)==3 and dist(x,y)==4 and dist(z,y)==7) or (dist(z,y)==3 and dist(y,x)==4 and dist(z,x)==7):\r\n print(\"minor\")\r\nelse:\r\n print(\"strange\")\r\n", "def minor(a, b, c):\r\n x = a\r\n if (b-x)% 12 == 3 and (c-x)% 12 == 7: return True\r\n else: return False\r\n \r\ndef major(a, b, c):\r\n x = a\r\n if (b-x)% 12 == 4 and (c-x)% 12 == 7: return True\r\n else: return False\r\n\r\nxd = {'C':0, 'C#':1, 'D':2, 'D#':3, 'E':4, 'F':5, 'F#':6, 'G':7, 'G#':8, 'A':9, 'B':10, 'H':11}\r\na = list(input().split())\r\nfor i in range(3):\r\n a[i] = xd[a[i]]\r\n \r\nif minor(a[0], a[1], a[2]) or minor(a[0], a[2], a[1]) or minor(a[1], a[0], a[2]) or \\\r\n minor(a[1], a[2], a[0]) or minor(a[2], a[0], a[1]) or minor(a[2], a[1], a[0]):\r\n ans = 'minor'\r\nelif major(a[0], a[1], a[2]) or major(a[0], a[2], a[1]) or major(a[1], a[0], a[2]) or \\\r\n major(a[1], a[2], a[0]) or major(a[2], a[0], a[1]) or major(a[2], a[1], a[0]):\r\n ans = 'major'\r\nelse: ans = 'strange'\r\nprint(ans)", "def check(X, Y, Z):\r\n\torder = {'C': 1, 'C#': 2, 'D': 3, 'D#': 4, 'E': 5, 'F': 6, 'F#': 7, 'G': 8, 'G#': 9, 'A': 10, 'B': 11, 'H': 12}\r\n\r\n\tmajor = False\r\n\tminor = False\r\n\r\n\tX_Y = []\r\n\tif order[X] <= order[Y]:\r\n\t\tX_Y.append(order[Y] - order[X])\r\n\telse:\r\n\t\tX_Y.append(12 + order[Y] - order[X])\r\n\r\n\tY_Z = []\r\n\tif order[Y] <= order[Z]:\r\n\t\tY_Z.append(order[Z] - order[Y])\r\n\telse:\r\n\t\tY_Z.append(12 + order[Z] - order[Y])\r\n\r\n\tif 4 in X_Y and 3 in Y_Z:\r\n\t\tmajor = True\r\n\telif 3 in X_Y and 4 in Y_Z:\r\n\t\tminor = True\r\n\r\n\treturn [major, minor]\r\n\r\ndef main():\r\n\tA, B, C = map(str, input().split())\r\n\r\n\tli = [[A, B, C], [A, C, B], [B, A, C], [B, C, A], [C, A, B], [C, B, A]]\r\n\tfor el in li:\r\n\t\tx, y, z = el\r\n\t\tmj, mn = check(x, y, z)\r\n\t\tif mj:\r\n\t\t\tel.append('major')\r\n\t\telif mn:\r\n\t\t\tel.append('minor')\r\n\r\n\tli = [el for el in li if len(el) == 4]\r\n\r\n\tif not li:\r\n\t\tprint('strange')\r\n\telse:\r\n\t\tif li[0][3] == 'major':\r\n\t\t\tprint('major')\r\n\t\telse:\r\n\t\t\tprint('minor')\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "# LUOGU_RID: 104833791\nA = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\n\r\na, b, c = sorted(map(A.index, input().split()))\r\nx, y = b - a, c - b\r\n\r\nif (x, y) in ((3, 5), (4, 3), (5, 4)):\r\n print('major')\r\nelif (x, y) in ((3, 4), (4, 5), (5, 3)):\r\n print('minor')\r\nelse:\r\n print('strange')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip().split())\r\nm = list(\"C, C#, D, D#, E, F, F#, G, G#, A, B, H\".split(\", \"))\r\nd = dict()\r\nfor i in range(len(m)):\r\n d[m[i]] = i\r\nans = \"strange\"\r\nfor _ in range(2):\r\n for i in range(3):\r\n if (d[s[(i + 1) % 3]] - d[s[i % 3]]) % 12 == 4 and (d[s[(i + 2) % 3]] - d[s[(i + 1) % 3]]) % 12 == 3:\r\n ans = \"major\"\r\n elif (d[s[(i + 1) % 3]] - d[s[i % 3]]) % 12 == 3 and (d[s[(i + 2) % 3]] - d[s[(i + 1) % 3]]) % 12 == 4:\r\n ans = \"minor\"\r\n s[0], s[1] = s[1], s[0]\r\nprint(ans)", "#import math\r\n#n, m = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#n, m, k= input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#k = int (k)\r\n#l = int(l)\r\n#m = int(input())\r\n#s = input()\r\n##t = input()\r\n#a = list(map(char, input().split()))\r\n#a.append('.')\r\n#print(l)\r\n#a = list(map(int, input().split()))\r\n#c = sorted(c)\r\n#x1, y1, x2, y2 =map(int,input().split())\r\n#n = int(input())\r\n#f = []\r\n#t = [0]*n\r\n#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]\r\n#f1 = sorted(t, key = lambda tup: tup[0])\r\ndic = {\"C\":0, \"C#\":1, \"D\":2, \"D#\":3, \"E\":4, \"F\":5, \"F#\":6, \"G\":7, \"G#\":8, \"A\":9, \"B\":10, \"H\":11}\r\nX, Y, Z = input().split()\r\na = [dic[X], dic[Y], dic[Z]]\r\na = sorted(a)\r\nX = a[0]\r\nY = a[1]\r\nZ = a[2]\r\nif ((Y-X == 3 and Z-Y == 4) or (X+12 -Z == 4 and Z -Y == 3) or(Y- X == 4 and X+12-Z == 3)):\r\n print(\"minor\")\r\n\r\nelif ((Y-X == 4 and Z-Y == 3) or (X+12 -Z == 3 and Z -Y == 4) or(Y- X == 3 and X+12-Z == 4)):\r\n print(\"major\")\r\nelse:\r\n print(\"strange\")\r\n", "#!/usr/bin/env python3 \r\n\r\nimport itertools\r\n\r\nnotes = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\n\r\nn = [notes.index(n) for n in input().strip().split()]\r\n\r\nfor (X,Y,Z) in itertools.permutations(n):\r\n d1 = Y-X\r\n if (d1 < 0):\r\n d1+=12\r\n d2 = Z-Y\r\n if (d2 < 0):\r\n d2+=12\r\n if (d1 == 4) and (d2 == 3):\r\n print(\"major\")\r\n exit()\r\n if (d1 == 3) and (d2 == 4):\r\n print(\"minor\")\r\n exit()\r\n\r\nprint(\"strange\")\r\n", "import sys\r\n\r\nstr2 = sys.stdin.read().split()\r\n\r\ns = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\", \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\",\r\n \"A\", \"B\", \"H\", \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n\r\nisMajor = False\r\nisMinor = False\r\narr = [0] * 3\r\nfor a in range(3):\r\n for b in range(3):\r\n if (a != b):\r\n for c in range(3):\r\n if c != a and c != b:\r\n str = [str2[a], str2[b], str2[c]]\r\n last = -1\r\n for i in range(3):\r\n arr[i] = last = s[last + 1:].index(str[i]) + last + 1\r\n if arr[1] - arr[0] == 4 and arr[2] - arr[1] == 3:\r\n isMajor = True\r\n elif arr[1] - arr[0] == 3 and arr[2] - arr[1] == 4:\r\n isMinor = True\r\nif (isMajor == True):\r\n print(\"major\")\r\nelif (isMinor == True):\r\n print(\"minor\")\r\nelse:\r\n print(\"strange\")", "\n\n\nfrom itertools import permutations\n\nli = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\n\n\n\nl = list(map(str,input().split()))\n\nperm = permutations(l,3)\ntemp = 0\nfor i in perm:\n j = list(i)\n # print(j)\n diff1 = li.index(j[1],0,len(li)) - li.index(j[0],0,len(li))\n diff2 = li.index(j[2],0,len(li)) - li.index(j[1],0,len(li))\n if diff1 < 0:\n diff1 = (len(li)-1)- li.index(j[0],0,len(li)) + li.index(j[1],0,len(li)) +1\n if diff2 < 0:\n diff2 = (len(li)-1)- li.index(j[1],0,len(li)) + li.index(j[2],0,len(li)) +1\n\n\n if diff1 == 4 and diff2 == 3:\n temp = 1\n print('major')\n break\n\n elif diff1 == 3 and diff2 == 4:\n temp = 1\n print('minor')\n break\n\n\nif temp == 0:\n print('strange')\n", "Notes = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n\r\nM = input().split()\r\n\r\ndef permu(A, ind):\r\n if ind == len(A) - 1:\r\n P1, P2, P3 = Notes.index(A[0]), Notes.index(A[1]), Notes.index(A[2])\r\n if P2 > P1:\r\n d1 = P2 - P1\r\n else:\r\n d1 = len(Notes) + (P2 - P1)\r\n if P3 > P2:\r\n d2 = P3 - P2\r\n else:\r\n d2 = len(Notes) + (P3 - P2)\r\n \r\n if d1 == 3 and d2 == 4:\r\n return 1\r\n if d1 == 4 and d2 == 3:\r\n return 2\r\n return 0\r\n ans = 0\r\n for i in range(ind, len(A)):\r\n C = A[:]\r\n C[i], C[ind] = C[ind], C[i]\r\n ans |= permu(C, ind+1)\r\n return ans\r\n\r\nif permu(M, 0) == 0:\r\n print(\"strange\")\r\nelif permu(M, 0) == 2:\r\n print(\"major\")\r\nelse:\r\n print(\"minor\")", "all_notes = \"C, C#, D, D#, E, F, F#, G, G#, A, B, H\".split(\", \")\r\n\r\nfrom itertools import permutations as cmbs\r\nfrom functools import lru_cache\r\n\r\nlru_cache(maxsize=128)\r\ndef dist(note_a, note_b):\r\n\tnia, nib = all_notes.index(note_a), all_notes.index(note_b)\r\n\tif nia < nib:\r\n\t\tres = nib - nia\r\n\telse:\r\n\t\tres = 12 - (nia - nib)\r\n\t#print(res)\r\n\treturn res\r\n\r\nassert dist('C', 'E') == 4\r\nassert dist('E', 'C') == 8\r\n\r\n\r\nnotes = input().split()\r\n\r\nst = \"strange\"\r\n\r\nfor comb in cmbs(notes, 3):\r\n\t#print(comb)\r\n\tdst1, dst2 = dist(*comb[:-1]), dist(*comb[1:])\r\n\tif dst1 == 3 and dst2 == 4:\r\n\t\tst = \"minor\"\r\n\t\tbreak\r\n\tif dst1 == 4 and dst2 == 3:\r\n\t\tst = \"major\"\r\n\t\tbreak\r\n\r\nprint(st)\r\n", "I='C C# D D# E F F# G G# A B H'.split()\r\nI+=I\r\nT=list.index\r\nF=lambda x,y:T(I,y,T(I,x))-T(I,x)\r\nR=0,1,2\r\nN=input().split()\r\nr='strange'\r\nfor i in R:\r\n\tfor j in R:\r\n\t\tfor k in R:\r\n\t\t\tif len([i,j,k])>2:\r\n\t\t\t\ty=F(N[i],N[j]),F(N[j],N[k])\r\n\t\t\t\tif y==(3,4):r='minor'\r\n\t\t\t\tif y==(4,3):r='major'\r\nprint(r)", "import math\r\nimport modulefinder\r\nimport string\r\n\r\ndef recursive_function(current_index, final_index, listy, c):\r\n if current_index == final_index - 1:\r\n x = listy.copy()\r\n c.append(x)\r\n else:\r\n for i in range(current_index, final_index):\r\n listy[current_index], listy[i] = listy[i], listy[current_index]\r\n #print(listy)\r\n recursive_function(current_index + 1, final_index, listy, c)\r\n listy[current_index], listy[i] = listy[i], listy[current_index]\r\n\r\n\r\n\r\ndef calculate_chord(h, first, second, third):\r\n index_second = h[second]\r\n index_first = h[first]\r\n index_third = h[third]\r\n if index_second > index_first:\r\n dif_1 = index_second - index_first\r\n else:\r\n dif_1 = len(h) - abs(index_second - index_first)\r\n if index_third > index_second:\r\n dif_2 = index_third - index_second\r\n else:\r\n dif_2 = len(h) - abs(index_second - index_third)\r\n return (dif_1, dif_2)\r\n\r\n\r\ndef main_function():\r\n major = \"major\"\r\n minor = \"minor\"\r\n strange = \"strange\"\r\n is_minor = False\r\n is_major = False\r\n de = input().split(\" \")\r\n l = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n hash_l = {}\r\n len_l = len(l)\r\n for i in range(len(l)):\r\n hash_l[l[i]] = i\r\n current_index = [0, 1, 2]\r\n c = []\r\n is_major = False\r\n is_minor = False\r\n\r\n recursive_function(0, 3, current_index, c)\r\n for i in c:\r\n dif_1, dif_2 = calculate_chord(hash_l, de[i[0]], de[i[1]], de[i[2]])\r\n if dif_1 == 4 and dif_2 == 3:\r\n is_major = True\r\n break\r\n elif dif_1 == 3 and dif_2 == 4:\r\n is_minor = True\r\n break\r\n if is_major:\r\n print(major)\r\n elif is_minor:\r\n print(minor)\r\n else:\r\n print(strange)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import permutations\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nnotes = 'C C# D D# E F F# G G# A B H'.split()\r\na = input().split()\r\nfor x, y, z in permutations(a):\r\n i, j, k = notes.index(x), notes.index(y), notes.index(z)\r\n while i > j:\r\n j += 12\r\n while j > k:\r\n k += 12\r\n if i + 4 == j and j + 3 == k:\r\n print('major')\r\n exit()\r\n if i + 3 == j and j + 4 == k:\r\n print('minor')\r\n exit()\r\nprint('strange')\r\n", "nots={'C':0,'C#':1,'D':2,'D#':3,'E':4,'F':5,'F#':6,'G':7,'G#':8,'A':9,'B':10,'H':11} \r\n\r\nv=list(map(str,input().split(' ')))\r\n\r\nv.sort(key=lambda x: nots[x])\r\n\r\nis_strange=1\r\n\r\nfor c in range(3):\r\n f=nots[v[(c+1)%3]]-nots[v[c]]\r\n if f<0:\r\n f+=12\r\n s=nots[v[(c+2)%3]]-nots[v[(c+1)%3]]\r\n if s<0:\r\n s+=12\r\n if f==4 and s==3:\r\n print('major')\r\n is_strange=0\r\n elif f==3 and s==4:\r\n print('minor')\r\n is_strange=0\r\nif is_strange:\r\n print('strange')\r\n", "import sys\r\ndef distance(x,y):\r\n notes=2*[\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n i=notes.index(x)\r\n j=notes[i+1:].index(y)+i+1\r\n return j-i\r\n\r\ninp=input().split()\r\nfor j in range(2):\r\n for i in range(3):\r\n if distance(inp[0],inp[1])==4 and distance(inp[1],inp[2])==3:\r\n print(\"major\")\r\n sys.exit(0)\r\n if distance(inp[0],inp[1])==3 and distance(inp[1],inp[2])==4:\r\n print(\"minor\")\r\n sys.exit(0)\r\n inp=[inp[1],inp[2],inp[0]]\r\n inp=inp[::-1]\r\nprint(\"strange\")", "note = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\n\r\nk = list(map(str,input().split()))\r\n\r\na,b,c = note.index(k[0]) ,note.index(k[1]),note.index(k[2]) \r\nf=-1\r\nfor i in range(6):\r\n #print(note[a],note[b],note[c])\r\n if (b-a)%12 == 4 and (c-b)%12==3:\r\n f=1\r\n print(\"major\")\r\n break\r\n elif (b-a)%12 == 3 and (c-b)%12==4:\r\n f=2\r\n print(\"minor\")\r\n break\r\n if i%2==0:\r\n b,c=c,b\r\n elif i%2==1:\r\n a,b=b,a\r\nif f==-1:\r\n print(\"strange\")", "if __name__ == '__main__':\r\n cin = input\r\n x, y, z = cin().split()\r\n a = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n x, y, z = a.index(x), a.index(y), a.index(z)\r\n b = [(x, (x + 3) % 12, (x + 7) % 12), (y, (y + 3) % 12, (y + 7) % 12), (z, (z + 3) % 12, (z + 7) % 12)]\r\n c = [(x, (x + 4) % 12, (x + 7) % 12), (y, (y + 4) % 12, (y + 7) % 12), (z, (z + 4) % 12, (z + 7) % 12)]\r\n\r\n for i in range(3):\r\n lb = set([x, y, z]).intersection(set(b[i]))\r\n lc = set([x, y, z]).intersection(set(c[i]))\r\n if len(lc) == 3:\r\n print(\"major\")\r\n break\r\n if len(lb) == 3:\r\n print(\"minor\")\r\n break\r\n else:\r\n print(\"strange\")", "notes = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']*2\nx = [i for i in input().split()]\nx.sort(key = lambda e: notes.index(e))\nx1 = [x[0], x[1], x[2]]\nx2 = [x[1], x[2], x[0]]\nx3 = [x[2], x[0], x[1]]\n\n\nfor i in [x1, x2, x3]:\n\ts1 = notes.index(i[1], notes.index(i[0]) + 1) - notes.index(i[0])\n\ts2 = notes.index(i[2], notes.index(i[1]) + 1) - notes.index(i[1])\n\n\tif s1 == 3 and s2 == 4:\n\t\tprint('minor')\n\t\tbreak\n\telif s1 == 4 and s2 == 3:\n\t\tprint('major')\n\t\tbreak\nelse:\n\tprint('strange')\n\n", "\r\ndef permutations(ss):\r\n s = str(ss).split()\r\n x = s[0]\r\n y = s[1]\r\n z = s[2]\r\n l = []\r\n l.append(str(x+\" \"+y+\" \"+z))\r\n l.append(str(x+\" \"+z+\" \"+y))\r\n l.append(str(y+\" \"+z+\" \"+x))\r\n l.append(str(y+\" \"+x+\" \"+z))\r\n l.append(str(z+\" \"+x+\" \"+y))\r\n l.append(str(z+\" \"+y+\" \"+x))\r\n return l\r\n\r\ndict = {'C': 1, 'G#': 9, 'E': 5, 'A': 10, 'B': 11, 'F': 6, 'D#': 4, 'G': 8, 'C#': 2, 'F#': 7, 'D': 3, 'H': 12}\r\nst = input()\r\nlis = permutations(st)\r\n\r\nmaj = False\r\nmin = False\r\n\r\nfor st in lis:\r\n s = str(st).split()\r\n first = dict[s[1]]-dict[s[0]]\r\n if first<0:\r\n first+=12\r\n second = dict[s[2]]-dict[s[1]]\r\n if second<0:\r\n second+=12\r\n if first == 4 and second==3:\r\n maj = True\r\n elif first==3 and second==4:\r\n min = True\r\n else:\r\n continue\r\n\r\nif maj:\r\n print(\"major\")\r\nelif min:\r\n print(\"minor\")\r\nelse:\r\n print(\"strange\")", "\r\n#\r\n#\r\nx, y, z = list(map(str, input().split()))\r\nnotes = [\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", 'B', \"H\"]\r\nn = len(notes)\r\nnotes = notes*2\r\n\r\n# print(notes)\r\npointers = []\r\ni = 0\r\non = True\r\nwhile i < 2*n and on:\r\n if notes[i] in (x, y, z):\r\n pointers.append(i)\r\n i += 1\r\n# print(pointers)\r\nf = False\r\nfor i in range(len(pointers)-2):\r\n if pointers[i+2] - pointers[i+1] == 4 and pointers[i+1] - pointers[i] == 3:\r\n f = True\r\n print(\"minor\")\r\n break\r\n elif pointers[i+2] - pointers[i+1] == 3 and pointers[i+1] - pointers[i] == 4:\r\n f = True\r\n print(\"major\")\r\n break\r\n\r\nif not f:\r\n print(\"strange\")\r\n\r\n\r\n", "def distance(arr, one, two, three):\r\n cnt1, cnt2 = 0, 0\r\n i = arr.index(one)\r\n while arr[i%12] != two:\r\n cnt1 += 1\r\n i += 1\r\n i = arr.index(two)\r\n while arr[i%12] != three:\r\n cnt2 += 1\r\n i += 1\r\n return [cnt1, cnt2]\r\n\r\narr = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\na, b, c = map(str, input().split())\r\nresult = True\r\nans = 'strange'\r\nif result:\r\n one, two, three = a, b, c\r\n l = distance(arr, one, two, three)\r\n if l[0] == 4 and l[1] == 3:\r\n ans = 'major'\r\n result = False\r\n elif l[0] == 3 and l[1] == 4:\r\n ans = 'minor'\r\n result = False\r\nif result:\r\n one, two, three = a, c, b\r\n l = distance(arr, one, two, three)\r\n if l[0] == 4 and l[1] == 3:\r\n ans = 'major'\r\n result = False\r\n elif l[0] == 3 and l[1] == 4:\r\n ans = 'minor'\r\n result = False\r\nif result:\r\n one, two, three = b, a, c\r\n l = distance(arr, one, two, three)\r\n if l[0] == 4 and l[1] == 3:\r\n ans = 'major'\r\n result = False\r\n elif l[0] == 3 and l[1] == 4:\r\n ans = 'minor'\r\n result = False\r\nif result:\r\n one, two, three = b, c, a\r\n l = distance(arr, one, two, three)\r\n if l[0] == 4 and l[1] == 3:\r\n ans = 'major'\r\n result = False\r\n elif l[0] == 3 and l[1] == 4:\r\n ans = 'minor'\r\n result = False\r\nif result:\r\n one, two, three = c, a, b\r\n l = distance(arr, one, two, three)\r\n if l[0] == 4 and l[1] == 3:\r\n ans = 'major'\r\n result = False\r\n elif l[0] == 3 and l[1] == 4:\r\n ans = 'minor'\r\n result = False\r\nif result:\r\n one, two, three = c, b, a\r\n l = distance(arr, one, two, three)\r\n if l[0] == 4 and l[1] == 3:\r\n ans = 'major'\r\n result = False\r\n elif l[0] == 3 and l[1] == 4:\r\n ans = 'minor'\r\n result = False\r\nprint(ans)", "s = input().split()\r\nchords = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nc1 = chords.index(s[0])\r\nc2 = chords.index(s[1])\r\nc3 = chords.index(s[2])\r\n#print(c1,c2,c3)\r\nprinted = False \r\npossibilities = [[c1,c2,c3],[c2,c1,c3],[c1,c3,c2],[c2,c3,c1],[c3,c1,c2],[c3,c2,c1]]\r\n\r\nfor t in possibilities:\r\n #print(t)\r\n \r\n if (t[0]+4)%12 == t[1] and (t[0] + 7)%12 == t[2] :\r\n print('major')\r\n printed = True\r\n break\r\n \r\n if (t[0]+3)%12 == t[1] and (t[0] + 7)%12 == t[2]:\r\n print('minor')\r\n printed = True\r\n break\r\n \r\nif not printed:\r\n print('strange')\r\n", "def nm(a):\r\n s = list(map(lambda i:a.index(i),input().split()))\r\n for i in range(3):\r\n s.sort()\r\n x,y = abs(s[0] - s[1]),abs(s[1] - s[2])\r\n if [x,y] == [4,3]:\r\n return 'major'\r\n elif [x,y] == [3,4]:\r\n return 'minor'\r\n s[0] += 12\r\n return 'strange'\r\nprint(nm((0,'C','C#','D','D#','E','F','F#','G','G#','A','B','H')))", "acords = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\nlst = sorted(acords.index(x) for x in input().split())\r\ndif = (lst[1] - lst[0], lst[2] - lst[1])\r\nif dif in ((4, 3), (3, 5), (5, 4)):\r\n print('major')\r\nelif dif in ((3, 4), (4, 5), (5, 3)):\r\n print('minor')\r\nelse:\r\n print('strange')\r\n", "import sys\r\n\r\narr = sys.stdin.readline().strip().split()\r\naccords = ['C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#', 'A', 'B', 'H']\r\n\r\ndef whatTheAccord(arr):\r\n global accords\r\n positions = [accords.index(arr[0]),accords.index(arr[1]),accords.index(arr[2])]\r\n \r\n for i in range(len(accords)):\r\n if accords[i] in arr and accords[(i+3)%len(accords)] in arr and accords[(i+7)%len(accords)] in arr: \r\n return 'minor'\r\n for i in range(len(accords)):\r\n if accords[i] in arr and accords[(i+4)%len(accords)] in arr and accords[(i+7)%len(accords)] in arr: \r\n return 'major' \r\n return 'strange' \r\n \r\ndef findDistance(pos1,pos2):\r\n if pos2>pos1:\r\n return pos2-pos1\r\n else:\r\n return pos1-pos2\r\n\r\nprint(whatTheAccord(arr))\r\n", "def check(a,b,c):\r\n a=notes.index(a)\r\n b=notes.index(b)\r\n c=notes.index(c)\r\n\r\n if (a-b)%12==3 and (b-c)%12==4:\r\n print(\"major\")\r\n exit()\r\n elif (a-b)%12==4 and (b-c)%12==3:\r\n print(\"minor\")\r\n exit()\r\na,b,c=(map(str,input().split()))\r\n\r\nnotes=[\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\"]\r\n\r\ncheck(a,b,c)\r\ncheck(a,c,b)\r\ncheck(b,a,c)\r\ncheck(b,c,a)\r\ncheck(c,a,b)\r\ncheck(c,b,a)\r\nprint(\"strange\")\r\n", "a,b,c=map(str,input().split())\r\ndef pos(a,b):\r\n d={\"C\":1, \"C#\":2, \"D\":3, \"D#\":4, \"E\":5, \"F\":6, \"F#\":7, \"G\":8, \"G#\":9, \"A\":10, \"B\":11, \"H\":12}\r\n if d[a]<d[b]:\r\n return d[b]-d[a]\r\n else:\r\n return 12-d[a]+d[b]\r\nl=[[a,b,c],[b,a,c],[a,c,b],[c,a,b],[b,c,a],[c,b,a]]\r\nfor i in l:\r\n if pos(i[0],i[1])==4 and pos(i[1],i[2])==3:\r\n print(\"major\")\r\n exit()\r\n elif pos(i[0],i[1])==3 and pos(i[1],i[2])==4:\r\n print(\"minor\")\r\n exit()\r\nprint(\"strange\")\r\n", "from itertools import *\r\n\r\n\r\ndef inp():\r\n return map(str, input().split())\r\n\r\n\r\ndic = {'C': 1, 'C#': 2, 'D': 3, 'D#': 4, 'E': 5, 'F': 6, 'F#': 7, 'G': 8, 'G#': 9, 'A': 10, 'B': 11, 'H': 12}\r\nx1, x2, x3 = inp()\r\nperm = list(permutations([x1, x2, x3], 3))\r\n\r\nfor i in perm:\r\n arr = [0, 0]\r\n for j in range(1, 3):\r\n if dic[i[j]] < dic[i[j - 1]]:\r\n arr[j - 1] = dic[i[j]] + (12 - dic[i[j - 1]])\r\n else:\r\n arr[j - 1] = dic[i[j]] - dic[i[j - 1]]\r\n\r\n if arr[0] == 3 and arr[1] == 4:\r\n exit(print('minor'))\r\n if arr[0] == 4 and arr[1] == 3:\r\n exit(print('major'))\r\n\r\nprint('strange')", "NOTES = 'C C# D D# E F F# G G# A B H'.split()\r\n \r\na, b, c = sorted(map(NOTES.index, input().split()))\r\nx, y = b-a, c-b\r\n \r\nif (x,y) in ((3,5), (4,3), (5,4)):\r\n print('major')\r\nelif (x,y) in ((3,4), (4,5), (5,3)):\r\n print('minor')\r\nelse:\r\n print('strange')" ]

[ "s=[]\r\ncost,pre,pq=0,0,[]\r\nfrom heapq import heappop, heappush\r\nfor i, c in enumerate(input()):\r\n\tif c=='?':\r\n\t\tc=')'\r\n\t\tx,y=map(int,input().split())\r\n\t\tcost+=y\r\n\t\theappush(pq, (x-y,i))\r\n\ts.append(c)\r\n\tif c=='(': pre+=1\r\n\telse:\r\n\t\tif pre==0:\r\n\t\t\tif not pq:\r\n\t\t\t\tpre=-1\r\n\t\t\t\tbreak\r\n\t\t\tx,y=heappop(pq)\r\n\t\t\tcost+=x\r\n\t\t\ts[y]='('\r\n\t\t\tpre+=1\r\n\t\telse:\r\n\t\t\tpre-=1\r\nif pre: print(-1)\r\nelse:\r\n\tprint(cost)\r\n\tprint(\"\".join(s))\r\n", "# stop tleing or ill murder ntarsis\r\nimport math\r\nimport heapq\r\nfrom sys import stdin\r\nINF = int(1e18)\r\n\r\ns = list(stdin.readline().strip())\r\ndepth = 0\r\npq = []\r\ncost = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n depth += 1\r\n elif s[i] == ')':\r\n depth -= 1\r\n else:\r\n # this is question mark\r\n a, b = map(int, stdin.readline().split())\r\n # lets try to close this bracket\r\n cost += b\r\n heapq.heappush(pq, (a - b, i))\r\n depth -= 1\r\n s[i] = ')'\r\n \r\n if depth < 0:\r\n if not pq:\r\n print(-1)\r\n exit()\r\n \r\n # we can't close this bracket\r\n # choose the one with the biggest profit to reopen\r\n top = heapq.heappop(pq)\r\n cost += top[0] \r\n s[top[1]] = '('\r\n depth += 2\r\n\r\nif depth > 0:\r\n print(-1)\r\n exit()\r\n\r\nprint(cost)\r\nprint(*s, sep = '')", "import heapq as hq\n\ns = list(input().strip())\nn = len(s)\n\nbuc = [0]*n\n\ncount = 0\n\nfor i in range(n):\n if s[i] == '?':\n buc[i] = count\n count += 1\n\na = [0]*count\nb = [0]*count\n\ncur = 0\nans = 0\nqueue = []\nflag = True\nif count:\n for i in range(count):\n a[i], b[i] = map(int, input().split())\nfor i in range(n):\n if s[i] == '(':\n cur += 1\n elif s[i] == ')':\n cur -= 1\n else:\n ans += b[buc[i]]\n s[i] = ')'\n cur -= 1\n hq.heappush(queue, (a[buc[i]]-b[buc[i]], i))\n \n if cur < 0:\n if queue:\n p = hq.heappop(queue)\n ans += p[0]\n s[p[1]] = '('\n cur += 2\n else:\n flag = False\n break\nif not flag or cur != 0:\n print(-1)\nelse:\n print(ans)\n print(''.join(s))\n\n ", "from heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\n\r\ns = list(input())\r\nn = len(s)\r\n\r\nans = 0\r\ncurr = 0\r\nhpq = []\r\nfor i, c in enumerate(s):\r\n if c == '(': curr += 1\r\n elif c == ')': curr -= 1\r\n else:\r\n curr -= 1\r\n a, b = map(int,input().split())\r\n ans += b\r\n heappush(hpq, (a - b, i))\r\n s[i] = ')'\r\n if curr < 0:\r\n if len(hpq) == 0: print(-1); exit()\r\n else:\r\n v, i = heappop(hpq)\r\n ans += v\r\n s[i] = '('\r\n curr += 2\r\n\r\nif curr: print(-1)\r\nelse: print(ans); print(''.join(s))", "# -*-coding:utf-8 -*-\r\nfrom queue import PriorityQueue\r\na=list(input())\r\nn=len(a)\r\nl=[]\r\nq=PriorityQueue()\r\nfor i in range(n):\r\n num1,num2=0,0\r\n if a[i]=='?':\r\n num1,num2=map(int,input().split())\r\n l.append([num1,num2])\r\ncnt=0\r\nans=0\r\nfor i in range(n):\r\n if a[i]=='(':\r\n cnt+=1\r\n elif a[i]==')':\r\n cnt-=1\r\n else:\r\n cnt-=1\r\n q.put((l[i][0]-l[i][1],i))\r\n a[i]=')'\r\n ans+=l[i][1]\r\n while cnt<0:\r\n if q.empty():\r\n print(\"-1\")\r\n exit()\r\n h=q.get()[1]\r\n ans+=l[h][0]-l[h][1]\r\n a[h]='('\r\n cnt+=2\r\nif cnt>0:\r\n print(\"-1\")\r\nelse:\r\n print(ans)\r\n print(''.join(a))\r\n", "from heapq import heappush, heappop\r\nfrom sys import stdin, exit\r\n\r\ntemplate = list(next(stdin).strip())\r\n\r\nn, cost, balance = len(template), 0, 0\r\n\r\nmin_heap = []\r\n\r\nfor i in range(n):\r\n\tif template[i] == '(':\r\n\t\tbalance += 1\r\n\telif template[i] == ')':\r\n\t\tbalance -= 1\r\n\telse:\r\n\t\tcost_left, cost_right = map(int, next(stdin).split())\r\n\t\ttemplate[i] = ')'\r\n\t\tcost += cost_right\r\n\t\tbalance -= 1\r\n\t\theappush(min_heap, (cost_left - cost_right, i))\r\n\tif balance < 0:\r\n\t\tif not min_heap:\r\n\t\t\tprint(-1)\r\n\t\t\texit(0)\r\n\t\tchange_cost, index = heappop(min_heap)\r\n\t\ttemplate[index] = '('\r\n\t\tcost += change_cost\r\n\t\tbalance += 2\r\n\r\nif balance == 0:\r\n\tprint(cost)\r\n\tprint(''.join(template))\r\nelse:\r\n\tprint(-1)\r\n", "from heapq import *\r\n \r\nt, s = 0, []\r\na, h = 0, []\r\nfor i, c in enumerate(input()):\r\n\tif c == '?':\r\n\t\tc = ')'\r\n\t\tx, y = map(int, input().split())\r\n\t\ta += y\r\n\t\theappush(h, (x - y, i))\r\n \r\n\ts.append(c)\r\n\tif c == '(': t += 1\r\n\telse:\r\n\t\tif t == 0:\r\n\t\t\tif not h:\r\n\t\t\t\tt = -1\r\n\t\t\t\tbreak\r\n\t\t\tt = 1\r\n\t\t\tx, y = heappop(h)\r\n\t\t\ta += x\r\n\t\t\ts[y] = '('\r\n\t\telse: t -= 1\r\n \r\nif t:\r\n print(\"-1\")\r\nelse:\r\n\tprint(a)\r\n\tprint(''.join(s))\r\n", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n import sys\r\n stdin = sys.stdin if True else open('data')\r\n from heapq import heappush, heappop\r\n\r\n seq = [c for c in next(stdin).strip()]\r\n n = len(seq)\r\n if n % 2 == 1:\r\n print(-1)\r\n return\r\n\r\n min_heap = []\r\n balance, cost = 0, 0\r\n for i in range(n):\r\n if seq[i] == '(':\r\n balance += 1\r\n elif seq[i] == ')':\r\n balance -= 1\r\n else:\r\n cost_left, cost_right = map(int, next(stdin).split())\r\n seq[i] = ')'\r\n balance -= 1\r\n cost += cost_right\r\n heappush(min_heap, (cost_left - cost_right, i))\r\n\r\n if balance < 0:\r\n if len(min_heap) <= 0:\r\n print(-1)\r\n return\r\n diff, index = heappop(min_heap)\r\n seq[index] = '('\r\n cost += diff\r\n balance += 2\r\n\r\n if balance == 0:\r\n print(cost)\r\n print(''.join(seq))\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "from heapq import heappush, heappop\r\n# heapq gives us implementation of priority queue.\r\nscan = list(input())\r\nn = len(scan)\r\nprice = 0\r\nbalancer = 0\r\nheap = []\r\n\r\nfor i in range(n):\r\n if scan[i] == '(':\r\n balancer += 1\r\n elif scan[i] == ')':\r\n balancer -= 1\r\n else:\r\n current_value_open, current_value_close = map(int, input().split())\r\n price += current_value_close\r\n heappush(heap, (current_value_open - current_value_close, i))\r\n scan[i] = ')'\r\n balancer -= 1\r\n\r\n if balancer < 0:\r\n if len(heap) == 0:\r\n break\r\n value, index = heappop(heap)\r\n price += value\r\n scan[index] = '('\r\n balancer += 2\r\n\r\nif balancer != 0:\r\n print(-1)\r\nelse:\r\n print(price)\r\n print(''.join(scan))" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nx = [[] for _ in range(m + 1)]\r\nfor i in range(n):\r\n x[a[i]].append(i)\r\nans = 0\r\nfor y in x:\r\n if not y:\r\n continue\r\n r = 0\r\n for l in range(len(y)):\r\n while r < len(y) and y[r] - y[l] - (r - l) <= k:\r\n r += 1\r\n ans = max(ans, r - l)\r\nprint(ans)", "from sys import stdin, stdout\r\n\r\nn, q, k = map(int, stdin.readline().split())\r\n\r\ncolours = list(map(int, stdin.readline().split()))\r\nposition = [[] for i in range(q + 1)]\r\ncnt = [[] for i in range(q + 1)]\r\nans = 0\r\n\r\nc, l, r = colours[0], 0, 0\r\nfor i in range(1, n):\r\n if colours[i] != c:\r\n position[c].append([l, r])\r\n c = colours[i]\r\n l, r = i, i\r\n else:\r\n r += 1\r\n \r\nposition[c].append([l, r])\r\n\r\nfor i in range(1, q + 1):\r\n if position[i]:\r\n cnt[i].append((position[i][0][1] - position[i][0][0] + 1, 0))\r\n \r\n for j in range(1, len(position[i])):\r\n cnt[i].append((cnt[i][j - 1][0] + position[i][j][1] - position[i][j][0] + 1, cnt[i][j - 1][1] + position[i][j][0] - position[i][j - 1][1] - 1))\r\n \r\n cnt[i].append((0, 0))\r\n\r\nl = 0\r\nr = n + 1\r\nwhile (r - l > 1):\r\n m = (r + l) // 2\r\n label = 1\r\n mx = 0\r\n \r\n \r\n for i in range(1, q + 1):\r\n if not len(position[i]):\r\n continue\r\n \r\n for j in range(len(position[i])):\r\n \r\n lb, rb = j - 1, len(position[i])\r\n while (rb - lb) > 1:\r\n mb = (rb + lb) // 2\r\n \r\n if cnt[i][mb][1] - cnt[i][j][1] > k:\r\n rb = mb\r\n else:\r\n lb = mb\r\n \r\n \r\n mx = max(cnt[i][lb][0] - cnt[i][j - 1][0], mx)\r\n\r\n\r\n if mx < m:\r\n r = m\r\n else:\r\n l = m\r\n\r\nstdout.write(str(l))", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join([str(i) for i in a]) + end)\r\n \r\nfrom collections import defaultdict as dd\r\ndef bruh():\r\n n, m, k = getf()\r\n a = getf()\r\n col = [[] for i in range(m + 1)]\r\n for i in range(n):\r\n col[a[i]] += [i]\r\n pref_c = [[0] * len(col[i]) for i in range(m + 1)]\r\n for i in range(1, m + 1):\r\n for j in range(1, len(col[i])):\r\n pref_c[i][j] = pref_c[i][j - 1] + col[i][j] - col[i][j - 1] - 1\r\n ans = 1\r\n for i in range(1, m + 1):\r\n r = 1\r\n for j in range(len(col[i])):\r\n while(r < len(col[i]) and pref_c[i][r] - pref_c[i][j] <= k):\r\n r += 1\r\n ans = max(ans, r - j)\r\n put(ans)\r\nbruh()\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfrom collections import defaultdict\r\nmp = defaultdict(list)\r\nfor i in range(n):\r\n mp[a[i]].append(i)\r\nres = 0\r\nfor i in range(n):\r\n val = a[i]\r\n st = 0\r\n l =0\r\n r = len(mp[val])-1\r\n while r-l>=0:\r\n m = r+l>>1\r\n if mp[val][m]<=i:\r\n l = m+1\r\n st = m\r\n else:\r\n r = m-1\r\n tmp = 1\r\n l = 0\r\n r = len(mp[val])-st\r\n while r-l>=0:\r\n mid = r+l>>1\r\n end = min(st+mid,len(mp[val]))\r\n cnt = end-st\r\n total = mp[val][end-1]-mp[val][st]\r\n if total-cnt<k:\r\n l = mid+1\r\n tmp = mid\r\n else:\r\n r = mid-1\r\n res = max(res,tmp)\r\nprint(res)\r\n \r\n ", "R = lambda: map(int, input().split())\r\nn, m, k = R()\r\narr = list(R())\r\narrs = [list() for i in range(m)]\r\nfor i, x in enumerate(arr):\r\n arrs[x - 1].append(i)\r\nres = 1\r\nfor ar in arrs:\r\n l = -1\r\n for r in range(len(ar)):\r\n while r - l + k < ar[r] - ar[l + 1] + 1:\r\n l += 1\r\n res = max(res, r - l)\r\nprint(res)", "from collections import Counter as CT;c=CT()\r\nR,G=lambda:map(int,input().split()),range;n,m,k=R();a=[*R()];z=r=0\r\nfor l in G(n):\r\n while r<n and c[a[l]]+k>=r-l:c[a[r]]+=1;r+=1\r\n z=max(z,c[a[l]]);c[a[l]]-=1\r\nprint(z)" ]

[ "from fractions import gcd\np,q=map(int,input().split())\ngc=gcd(p,q)\np//=gc\nq//=gc\nn=int(input())\na=list(map(int,input().split()))\ndef add(a,b):\n res=[]\n a[0]*=b[1]\n b[0]*=a[1]\n temp=b[1]*a[1]\n top=a[0]+b[0]\n gc=gcd(top,temp)\n temp//=gc\n top//=gc;\n res.append(top)\n res.append(temp)\n return res\ndef go(i):\n res=[]\n if i==n-1:\n res.append(a[i])\n res.append(1)\n return res; \n temp=list(go(i+1))\n temp=temp[::-1]\n ta=[]\n ta.append(a[i])\n ta.append(1)\n temp=add(ta,temp)\n return temp\nres=go(0)\nif(res[0]==p and res[1]==q): print(\"YES\")\nelse:\n print(\"NO\")", "from sys import stdin\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\ndef gcd(a,b): return a if b == 0 else gcd(b, a%b)\r\n\r\ndef simp(a,b):\r\n g = gcd(a,b)\r\n return a//g, b//g\r\n\r\ndef calc(a):\r\n if len(a) == 1:\r\n return a[0], 1\r\n y, x = calc(a[1:])\r\n return simp(a[0]*y+x, y)\r\n \r\n\r\nnum, den = read()\r\nnum, den = simp(num, den)\r\nread()\r\nprint ( \"YES\" if calc(list(read())) == (num,den) else \"NO\" )\r\n", "p, q = list(map(int, input().split()))\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfract1 = []\r\nx, y = p, q\r\nwhile y > 0:\r\n if y == 1:\r\n fract1 += [x - 1, 1]\r\n else:\r\n fract1 += [x // y]\r\n x, y = y, x % y\r\n\r\nfract2 = []\r\nx, y = p, q\r\nwhile y > 0:\r\n fract2 += [x // y]\r\n x, y = y, x % y\r\n\r\n# print(fract1)\r\n# print(fract2)\r\n\r\nif fract1 == a or fract2 == a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from fractions import gcd\n\np, q = [int(x) for x in input().split()]\nn = int(input())\nA = [int(x) for x in input().split()]\ng = gcd(p, q)\np, q = p // g, q // g\nposs = True\nfor a in A:\n if q == 0 or p < a * q:\n poss = False\n break\n p -= a * q\n g = gcd(p, q)\n p, q = q // g, p // g\nprint(\"YES\" if poss and q == 0 else \"NO\")\n", "import math\np,q=map(int,input().split())\nn=int(input())\narr=list(map(int,input().split()))\narr=arr[::-1]\nwhile arr:\n\tif len(arr)==1:\n\t\tif q*arr[-1]==p:\n\t\t\tprint('YES')\n\t\t\texit(0)\n\tp,q=q,p-arr[-1]*q\n\tg=math.gcd(p,q)\n\tp//=g\n\tq//=g\n\tarr.pop()\nprint('NO')\n\n \t\t\t \t\t\t\t\t\t \t \t \t \t\t\t\t\t \t\t\t", "P,Q=map(int,input().split())\nn=int(input())\na = [int(i) for i in input().split()]\np=[]\nq=[]\np.append(a[0])\nq.append(1)\nif (n==1):\n if(p[0]*Q==q[0]*P):\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n p.append(a[1]*a[0]+1)\n q.append(a[1])\n for i in range(2,n):\n p.append(a[i]*p[i-1]+p[i-2])\n q.append(a[i]*q[i-1]+q[i-2])\n if (p[n-1]*Q==q[n-1]*P): \n print(\"YES\")\n else: \n print(\"NO\")\n", "\ndef evaluate (p, q, nums, i, size):\n\n if (i == size): \n if (q == 0) :\n return True; \n return False;\n p -= nums[i] * q;\n\n return evaluate(q, p, nums, i + 1, size);\n\np, q = [int(i) for i in input().split()]\nn = int(input())\nnums = [int(i) for i in input().split()]\nif (evaluate(p, q, nums, 0, n)) :\n print(\"YES\")\nelse: \n print(\"NO\")\n", "#!/usr/local/bin/python3.3 -tt\n\nimport fractions\nimport sys\n\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 pq = fractions.Fraction(next(g), next(g))\n\n n, a = next(g), []\n\n for i in range(n):\n a.append(next(g))\n\n r = fractions.Fraction(a.pop())\n\n while a:\n r = fractions.Fraction(a.pop()) + fractions.Fraction(1, r)\n\n if r == pq:\n print(\"YES\")\n else:\n print(\"NO\")\n", "s = input()\r\na = s.split()\r\np = int(a[0])\r\nq = int(a[1])\r\nn = input()\r\ns = input()\r\nse = s.split()\r\nfor c in se:\r\n e = int(c)\r\n t1 = p-e*q\r\n t2 = q\r\n p = t2\r\n q = t1\r\nif q == 0:\r\n print('YES')\r\nelse :\r\n print('NO')\r\n", "p, q = [int(x) for x in input().split()]\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nx, y = 1, 0\r\nfor i in a[::-1]:\r\n x, y = y+i*x, x\r\nif x * q == y * p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\ndef gcd(a, b):\n\tif (b == 0):\n\t\treturn a\n\telse:\n\t\treturn gcd(b, a % b)\n\np, q = map(int, input().split())\nn = int(input())\nA = list(map(int, input().split()))\ng = gcd(p, q)\np = p // g\nq = q // g\nk = A[n - 1]\nl = 1\nfor i in range(n - 2, -1, -1):\n\tk, l = l, k\n\tk += A[i] * l\n\tg = gcd(k, l)\n\tk = k // g\n\tl = l // g\nif (k == p and q == l):\n\tprint (\"YES\")\nelse:\n\tprint (\"NO\")", "from math import gcd\r\nq,p= map(int,input().split())\r\nn = int(input())\r\na = [*map(int,input().split())]\r\nd = gcd(p,q)\r\np//=d\r\nq//=d\r\nm,b = 1,a[-1]\r\ni = n-2\r\nwhile(i>=0):\r\n m = b*a[i]+m\r\n d = gcd(m,b)\r\n m //=d\r\n b //=d\r\n i-=1\r\n m,b = b,m\r\nprint(\"YES\" if(m==p and b==q) else \"NO\")", "def ratios(p, q, n, lst):\r\n for i in range(n):\r\n if p <= 0:\r\n return \"NO\"\r\n b = q * lst[i]\r\n p -= b\r\n g = p\r\n p = q\r\n q = g\r\n if q == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nP, Q = [int(j) for j in input().split()]\r\nm = int(input())\r\na = [int(x) for x in input().split()]\r\nprint(ratios(P, Q, m, a))\r\n", "from fractions import Fraction\n\np, q = map(int, input().split())\nn = int(input())\nl = list(map(int, input().split()))\n\nl.reverse()\n\ncum = Fraction(l[0], 1)\n\nl = l[1:]\n\nfor a in l:\n cum = Fraction(a, 1) + Fraction(cum.denominator, cum.numerator)\n\nprint(\"YES\" if cum == Fraction(p, q) else \"NO\")", "p, q = map(int, input().split())\r\nn = int(input())\r\na = list(map(int, input().split()))\r\np0 = a[-1]\r\nq0 = 1\r\nfor i in range(n - 2, -1, -1):\r\n p0, q0 = q0 + p0 * a[i], p0\r\nif (p * q0 == q * p0):\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "import sys\r\nimport math\r\n#from queue import *\r\n#import random\r\n#sys.setrecursionlimit(int(1e6))\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\np,q=invr()\r\ng=math.gcd(p,q)\r\np//=g\r\nq//=g\r\n\r\nn=inp()\r\nara=inara()\r\n\r\na=ara[-1]\r\nb=1\r\n\r\nfor i in range(n-2,-1,-1):\r\n\ta,b=b,a\r\n\t\r\n\ta+=b*ara[i]\r\n\t\r\n\tg=math.gcd(a,b)\r\n\ta//=g\r\n\tb//=g\r\n\r\nif p==a and q==b:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\t\r\n\t\t\t\t\r\n", "num,den = [int(x) for x in input().split()]\r\nn = [int(x) for x in input().split()]\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nfor i in range(n[0]-1):\r\n \r\n \r\n num -= (den*arr[i])\r\n num,den = den,num\r\n \r\n\r\nif den and num%den==0:\r\n num = num//den\r\n den=1 \r\n \r\n\r\nif num==arr[n[0]-1] and den==1:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "p, q = map(int,input().split())\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nfor i in l:\r\n if q == 0 or i > p // q:\r\n print('NO')\r\n exit()\r\n p -= i * q\r\n p, q = q, p\r\nprint('YES' if q == 0 else 'NO')", "#!/usr/bin/env python\n#coding:utf-8\n\nfrom fractions import Fraction\n\ndef frac(lis,i):\n if i == len(lis)-1 :\n return lis[i]\n else:\n return lis[i]+1/frac(lis,i+1)\n\ndef main():\n linesp = input().split(\" \")\n p,q = int(linesp[0]),int(linesp[1])\n one = Fraction(p,q)\n\n n = int(input())\n\n A = []\n for s in input().split(\" \"):\n A.append(Fraction(int(s)))\n\n two = frac(A,0)\n if one == two:\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n main()\n", "import sys\n\n\ndef gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\n\n\ndef main():\n p, q = map(lambda x : int(x), sys.stdin.readline().split())\n n = int(sys.stdin.readline())\n a = list(map(lambda x : int(x), sys.stdin.readline().split()))\n b = [1] * n\n\n gg = gcd(p, q)\n p = p // gg\n q = q // gg\n\n while len(a) > 1:\n x = a[-2]\n y = a[-1]\n z = b[-1]\n a = a[:-1]\n b = b[:-1]\n b[-1] = y\n a[-1] = x * y + z\n gg = gcd(b[-1], a[-1])\n a[-1] = a[-1] // gg\n b[-1] = b[-1] // gg\n\n print(\"YES\\n\" if p == a[0] and q == b[0] else \"NO\\n\")\n\n\nif __name__ == '__main__':\n main()\n", "import fractions\r\nF=fractions.Fraction\r\nI=input\r\nT=int\r\nS=str.split\r\np,q=S(I())\r\ns=F(T(p),T(q))\r\nI()\r\na=S(I())\r\np,a=T(a[-1]),a[:-1]\r\nfor x in a[::-1]:p=F(1,p)+F(T(x),1)\r\nprint('YNEOS'[p!=s::2])", "P, Q = [int(x) for x in input().split()]\n\nN = int(input())\nA = [int(x) for x in input().split()]\n\nU, V = 1, 0\nfor x in A[::-1]:\n U, V = V, U\n U, V = V * x + U, V\n\nif U * Q == P * V:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "p,q=[int(x) for x in input().split()]\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\n\r\nx,y,i=1,0,n\r\nwhile n>0:\r\n x,y=y,x\r\n n-=1\r\n x+=y*a[n]\r\n\r\nif x*q==y*p:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "def result(x,y, numbers):\r\n numbers.reverse()\r\n a, b = 1, 0\r\n for number in numbers:\r\n b, a = a, number*a + b\r\n return a*y == b*x\r\n\r\nx, y = [int(item) for item in input().split()]\r\nn = int(input())\r\nnumbers = [int(item) for item in input().split()]\r\n\r\nif result(x, y, numbers):\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/python3\n\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\n\ndef solve(p, q, a):\n if len(a) == 1:\n return q * a[0] == p\n pp = q\n qq = p - q * a[0]\n aa = a[1:]\n g = gcd(pp, qq)\n pp //= g\n qq //= g\n return solve(pp, qq, aa)\n\n\np, q = map(int, input().split())\nn = int(input())\na = list(map(int, input().split()))\n\nif solve(p, q, a):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def s():\r\n\tdef gcd(a,b):\r\n\t\tif a < b:\r\n\t\t\ta, b = b, a\r\n\t\tif b:\r\n\t\t\treturn gcd(b,a%b)\r\n\t\telse:\r\n\t\t\treturn a\r\n\tpq = list(map(int,input().split()))\r\n\tg = gcd(*pq)\r\n\tpq[0] //= g\r\n\tpq[1] //= g\r\n\tinput()\r\n\ta = list(map(int,input().split()))\r\n\tr = [1,0]\r\n\tfor i in reversed(a):\r\n\t\tr[0], r[1] = r[1], r[0]\r\n\t\tr[0] += r[1]*i\r\n\t\tg = gcd(r[0],r[1])\r\n\t\tr[0] //= g\r\n\t\tr[1] //= g\r\n\tprint('YES'if pq == r else 'NO')\r\ns()", "def main():\r\n var_input = input()\r\n my_list = list(var_input.split(' '))\r\n p = int(my_list[0])\r\n q = int(my_list[1])\r\n n = int(input())\r\n var_input = input()\r\n a = list(var_input.split(' '))\r\n for index in range(len(a)):\r\n p -= q*int(a[index])\r\n if index != len(a)-1 and p == 0:\r\n print('NO')\r\n return\r\n p, q = q, p\r\n if q != 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\n\r\ntry:\r\n file = open('input.txt', 'r')\r\n sys.stdin = file\r\n file = open('output.txt', 'w')\r\n sys.stdout = file\r\nexcept:\r\n ...\r\n\r\ns = input().split()\r\np, q = int(s[0]), int(s[1])\r\n\r\nn = int(input())\r\ns = input().split()\r\narr = [int(i) for i in s]\r\n\r\nif n == 1:\r\n if p / q == arr[0]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n d1, d2 = 1, arr[len(arr) - 1]\r\n t = len(arr) - 1\r\n while t > 1:\r\n d1 = arr[t - 1] * d2 + d1\r\n d1, d2 = d2, d1\r\n t -= 1\r\n\r\n d1 = d2 * arr[0] + d1\r\n\r\n if p * d2 == q * d1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def main():\n from fractions import Fraction\n p, q = map(int, input().split())\n _, aa = input(), list(map(int, input().split()))\n x = Fraction(aa.pop())\n while aa:\n x = aa.pop() + 1 / x\n print((\"NO\", \"YES\")[x == Fraction(p, q)])\n\n\nif __name__ == '__main__':\n main()\n", "p,q = map(int, input().split())\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef dfs(i):\r\n if (i==n-1) :\r\n return (1, a[i])\r\n x = dfs(i+1)\r\n return (x[1], a[i]*x[1] + x[0])\r\n\r\nx = dfs(0)\r\nif x[0]*p == x[1]*q:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p, q = map(int, input().split())\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ng = 0\r\n\r\nfor i in range(n):\r\n\tif (p <= 0):\r\n\t\tprint(\"NO\\n\")\r\n\t\texit(0);\r\n\t\r\n\tb = q * a[i]\r\n\tp -= b;\r\n\tg = p\r\n\tp = q\r\n\tq = g\r\n\r\nif (q == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve (p, q, a, st, n):\n\tif st == n-1:\n\t\treturn p == q*a[st]\n\treturn solve(q, p-a[st]*q, a, st+1, n);\n\n\np, q = map(int, input().split())\nn = int(input())\na = list(map(int, input().split()))\n\nif solve(p, q, a, 0, n):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def foo(x, y, z):\r\n # x + y / z\r\n I = []\r\n I.append(z)\r\n I.append(x * z + y)\r\n return I\r\np, q = map(int, input().split())\r\nn = int(input())\r\nda = map(int, input().split())\r\na = []\r\nfor val in da:\r\n a.append(val)\r\na.reverse()\r\nla = len(a)\r\nif la == 1:\r\n if p == (q * a[0]):\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\nelse:\r\n y = 0; z = 1\r\n for idx in range (0, la):\r\n I = foo(a[idx], y, z)\r\n y = I[0]; z = I[1]\r\n if (p * y) == (q * z):\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\n", "from math import gcd\n\np, q = map(int, input().split())\np, q = p // gcd(p, q), q // gcd(p, q)\nn = int(input())\na, b = 1, 0\nfor c in reversed(list(map(int, input().split()))):\n a, b = b, a\n a += b * c\n a, b = a // gcd(a, b), b // gcd(a, b)\nprint('YES' if a == p and q == b else 'NO')\n", "import sys, random, bisect\nfrom collections import deque, defaultdict\nfrom heapq import heapify, heappop, heappush\nfrom itertools import permutations\nfrom math import gcd, log\n\ninput = lambda :sys.stdin.readline().rstrip()\nmi = lambda :map(int, input().split())\nli = lambda :list(mi())\n\np, q = mi()\nn = int(input())\na = li()\n\ng = gcd(p, q)\np, q = p // g, q // g\n\nu, v, id = a[n - 1], 1, n - 2\nwhile id >= 0:\n u, v = v, u\n u = a[id] * v + u\n id = id - 1\n\ng = gcd(u, v)\nu, v = u // g, v // g\n\nif u == p and v == q: print('YES')\nelse: print('NO')\n\n \t\t\t\t\t\t\t \t\t\t \t \t \t\t\t\t \t \t", "\r\narr = [0 for i in range(100)]\r\n\r\ndef gcd(a,b):\r\n if(b == 0): return a\r\n return gcd(b,a%b)\r\n\r\ndef compute(a,b,c):\r\n ret = [a*c[0]+b*c[1],c[0]]\r\n return tuple(ret)\r\n\r\ndef dfs(idx):\r\n if(idx == n-2): return compute(arr[idx],1,tuple([arr[idx+1],1]))\r\n return compute(arr[idx],1,dfs(idx+1))\r\n\r\np,q = list(map(int,input().split()))\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nif(n >= 2): ans = dfs(0)\r\nelse: ans = tuple([arr[0],1])\r\n\r\nd = gcd(ans[0],ans[1])\r\nans = tuple([ans[0]//d,ans[1]//d])\r\n\r\nd = gcd(p,q)\r\nans2 = tuple([p//d,q//d])\r\n\r\nif(ans[0] == ans2[0] and ans[1] == ans2[1]):\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n", "from fractions import Fraction\r\nn,m = map(int,input().split(' '))\r\nk = (int)(input())\r\nn = Fraction(n,m)\r\na = list(map(int,input().split(' ')))\r\nx = Fraction(0,1)\r\na.reverse()\r\nfor i in range(0,k - 1):\r\n x = Fraction(1,a[i] + x)\r\nx += a[k - 1]\r\nif x == n:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "p, q = list(map(int, input().split()))\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nx, y = 1, 0\r\nfor i in range(n - 1, -1, -1):\r\n x, y = a[i] * x + y, x\r\nif x * q == p * y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from fractions import Fraction\r\npq = Fraction(*map(int, input().split()))\r\ninput()\r\na = list(map(int, input().split()))\r\na.reverse()\r\nf = Fraction(a[0], 1)\r\nfor i in a[1:]:\r\n f = i + Fraction(1, f)\r\nif pq == f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from fractions import Fraction\nn,m = map(int,input().split(' '))\nk = (int)(input())\nn = Fraction(n,m)\na = list(map(int,input().split(' ')))\nx = Fraction(0,1)\na.reverse()\nfor i in range(0,k - 1):\n x = Fraction(1,a[i] + x)\nx += a[k - 1]\nif x == n:\n print(\"YES\")\nelse: \n print(\"NO\")\n \t\t \t \t \t \t\t\t \t\t \t \t\t", "import fractions\r\nimport collections\r\n\r\np,q=map(int,input().split())\r\nn=int(input())\r\na=collections.deque(map(int,input().split()))\r\n\r\ndef f(a):\r\n x=a.popleft()\r\n if len(a)==0:\r\n return (x)\r\n else:\r\n return x+fractions.Fraction(1,f(a))\r\nif fractions.Fraction(p,q)==f(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "# some math vlad\r\np,q=map(int,input().split())\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nx,y=a[n-1],1\r\nfor i in range(n-1)[::-1]:x,y=a[i]*x+y,x\r\nprint (['NO','YES'][p*y==q*x])", "def gcd(a,b):\r\n if(b>a):\r\n q=a\r\n a=b\r\n b=q\r\n if(b==0):\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\ndef sokrat(p,q):\r\n d=gcd(p,q)\r\n return p/d,q/d\r\n\r\np,q=map(int, input().split())\r\nn=int(input())\r\na=list(map(int, input().split()))\r\n\r\ng,h=a[n-1],1\r\nfor i in range(2,n+1):\r\n g,h = a[n-i]*g+h, g\r\n\r\nif(p*h == g*q):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!python3\r\n\r\nfrom decimal import *\r\nfrom fractions import Fraction\r\np, q = map(int, input().split())\r\nn = int(input())\r\na = list(map(int, (input().split())))\r\n\r\na = [0]+a;\r\n\r\nans = Fraction(1, a[n])\r\nfor i in range(n-1, 0, -1):\r\n ans += a[i]\r\n ans = Fraction(1, ans);\r\n\r\n# print(Fraction(q, p))\r\n# print(ans)\r\nif(Fraction(q, p) == ans):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p, q = [int(x) for x in input().split()]\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nfor x in a:\r\n\tp -= q*x\r\n\tp,q = q,p\r\n\r\nif(q==0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "p, q = map(int, input().split())\nn = int(input())\nA = list(map(int, input().split()))\n\nfor i in range(n):\n p, q = q, p - A[i] * q\n\nif p != 0 and q == 0:\n print('YES')\nelse:\n print('NO')\n", "# Problem E\r\nimport sys, functools, string\r\nfrom fractions import Fraction\r\ninput = lambda: sys.stdin.readline()[:-1]\r\nget_int = lambda: int(input())\r\nget_int_list = lambda: list(map(int,input().split()))\r\n\r\ndef solve(p,q,n,a):\r\n afinal = Fraction(p,q)\r\n b = Fraction(a[0])\r\n for i in range(1,n):\r\n b = a[i] + 1/b\r\n if afinal == b:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\np,q = get_int_list()\r\nn = get_int()\r\na =get_int_list()\r\nprint(solve(p,q,n,a[::-1]))\r\n", "def gcd(a, b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a + b\r\n\r\np, q = map(int, input().split())\r\ntmp = gcd(p, q)\r\np = p // tmp\r\nq = q // tmp\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ntu = 1\r\nmau = a[n - 1]\r\n\r\nif n == 1:\r\n if p == q * a[0]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n for i in range(n - 1, 1, -1):\r\n tu = tu + a[i - 1] * mau\r\n tu, mau = mau, tu\r\n tu = tu + a[0] * mau\r\n if tu * q == mau * p:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import math\r\nimport sys\r\n\r\ndef gcd(x, y):\r\n if(y == 0):\r\n return x\r\n else:\r\n return gcd(y,x%y)\r\np, q = map(int,sys.stdin.readline().split())\r\nn = int(input())\r\na = [0] * n;\r\nb = map(int,sys.stdin.readline().split())\r\nl = 0\r\nfor i in b: \r\n a[l] = i\r\n l = l + 1\r\nx, y = a[n-1], 1\r\nfor i in range(n-2,-1,-1):\r\n x, y = y, x\r\n x = x + y*a[i]\r\ng1 = gcd(p,q)\r\ng2 = gcd(x,y)\r\np = p // g1\r\nq = q // g1\r\nx = x // g2\r\ny = y // g2\r\nif(x == p and y == q):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "p, q = map(int, input().split())\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nnxt_p, nxt_q = arr[-1], 1\r\nfor i in range(n-2, -1, -1):\r\n nxt_p, nxt_q = nxt_q + nxt_p * arr[i], nxt_p\r\nif (p * nxt_q == q * nxt_p):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from fractions import *\r\nf = Fraction\r\n\r\n\r\np, q = map(int, input().split())\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nres = f(a[0], 1)\r\nfor i in range(1, n):\r\n res = a[i] + 1 / res\r\nprint(\"YES\" if res == f(p, q) else \"NO\")", "#!/usr/bin/env python3\n\nfrom fractions import Fraction\n\nif __name__ == '__main__':\n p, q = map(int, input().split())\n n = int(input())\n l = list(map(int, input().split()))\n\n f = Fraction(l[-1], 1)\n\n for x in l[-2::-1]:\n f = 1 / f\n f += x\n\n print([\"NO\", \"YES\"][f == Fraction(p, q)])\n\n\n", "p,q=list(map(int,input().split()))\r\nn=int(input())\r\nara= list(map(int,input().split()))\r\nb=0\r\na=1\r\nl=0\r\nfor i in ara[::-1]:\r\n l=a\r\n a=(i*a)+b\r\n b=l\r\n#print(a*q,b*p)\r\nif a*q==b*p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from fractions import*\r\nfrom sys import*\r\nfrom copy import*\r\nfrom time import*\r\n\r\n\r\nclass Fraction:\r\n def __init__(self, x = 0, y = 1):\r\n if(type(x) == str):\r\n if x.find('/') != -1:\r\n a = list(map(int, x.split('/')))\r\n else:\r\n a = list(map(int, x.split()))\r\n self.num = a[0]\r\n if len(a) == 1:\r\n self.den = 1\r\n else:\r\n self.den = a[1]\r\n elif(type(x) == Fraction):\r\n self.num, self.den = x.num, x.den\r\n else:\r\n self.num, self.den = x, y\r\n self.reduce()\r\n\r\n def __str__(self):\r\n if self.den == 1:\r\n return str(int(self.num))\r\n return str(int(self.num)) + '/' + str(int(self.den))\r\n\r\n def reduce(self):\r\n d = gcd(abs(self.num), abs(self.den))\r\n if self.den < 0:\r\n self.den, self.num = -self.den, -self.num\r\n self.num, self.den = self.num // d, self.den // d\r\n\r\n def __lt__(self, other):\r\n if type(other) == Fraction:\r\n return self.num * other.den < other.num * self.den\r\n else:\r\n return self.num < self.den * other\r\n\r\n def __le__(self, other):\r\n if type(other) == Fraction:\r\n return self.num * other.den <= other.num * self.den\r\n else:\r\n return self.num <= self.den * other\r\n\r\n def __gt__(self, other):\r\n if type(other) == Fraction:\r\n return self.num * other.den > other.num * self.den\r\n else:\r\n return self.num > self.den * other\r\n\r\n def __ge__(self, other):\r\n if type(other) == Fraction:\r\n return self.num * other.den >= other.num * self.den\r\n else:\r\n return self.num >= self.den * other\r\n\r\n def __eq__(self, other):\r\n if type(other) == Fraction:\r\n return self.num * other.den == other.num * self.den\r\n else:\r\n return self.num == self.den * other\r\n\r\n def __ne__(self, other):\r\n if type(other) == Fraction:\r\n return self.num * other.den != other.num * self.den\r\n else:\r\n return self.num != self.den * other\r\n\r\n def __mul__(self, other):\r\n if(type(other) == float):\r\n return (self.num * other) / self.den\r\n elif type(other) == Poly:\r\n return NotImplemented\r\n else:\r\n other = Fraction(other)\r\n return Fraction(self.num * other.num, self.den * other.den)\r\n\r\n def rmul(self, other):\r\n return other * self\r\n\r\n def __rmul__(self, other):\r\n if(type(other) == float):\r\n return (self.num * other) / self.den\r\n else:\r\n other = Fraction(other)\r\n return Fraction(self.num * other.num, self.den * other.den)\r\n\r\n def __imul__(self, other):\r\n if(type(other) == float):\r\n self = (self.num * other) / self.den\r\n else:\r\n other = Fraction(other)\r\n self.num *= other.num\r\n self.den *= other.den\r\n self.reduce()\r\n return self\r\n\r\n def __truediv__(self, other):\r\n if(type(other) == float):\r\n return self.num / (self.den * other)\r\n else:\r\n other = Fraction(other)\r\n return self * Fraction(other.den, other.num)\r\n\r\n def __rtruediv__(self, other):\r\n if(type(self) == float):\r\n return other.num / (other.den * self)\r\n else:\r\n self = Fraction(self)\r\n return other * Fraction(self.den, self.num)\r\n\r\n def __itruediv__(self, other):\r\n if(type(other) == float):\r\n self = self.num / (self.den * other)\r\n else:\r\n other = Fraction(other)\r\n self = self * Fraction(other.den, other.num)\r\n self.reduce()\r\n return self\r\n\r\n def __pow__(self, other):\r\n if type(other) == Fraction:\r\n return (self.num / self.den) ** (other.num / other.den)\r\n elif type(other) == int:\r\n if other > 0:\r\n return Fraction(self.num ** other, self.den ** other)\r\n else:\r\n return 1 / Fraction(self.num ** (-other), self.den ** (-other))\r\n else:\r\n return (self.num / self.den) ** other\r\n\r\n def __rpow__(self, other):\r\n return other ** (self.num / self.den)\r\n\r\n def __ipow__(self, other):\r\n if other > 0:\r\n self.num **= other\r\n self.den **= other\r\n else:\r\n self.num **= (-other)\r\n self.den **= (-other)\r\n self.num, self.den = self.den, self.num\r\n return self\r\n\r\n def __add__(self, other):\r\n if type(other) == float:\r\n return self.num / self.den + other\r\n elif type(other) == Poly:\r\n return NotImplemented\r\n else:\r\n other = Fraction(other)\r\n return Fraction(self.num * other.den + other.num * self.den, self.den * other.den)\r\n\r\n def __radd__(self, other):\r\n return self + other\r\n\r\n def __iadd__(self, other):\r\n if type(other) == float:\r\n self = self.num / self.den + other\r\n else:\r\n other = Fraction(other)\r\n self.num = self.num * other.den + other.num * self.den\r\n self.den = self.den * other.den\r\n self.reduce()\r\n return self\r\n\r\n def __sub__(self, other):\r\n if type(other) == float:\r\n return self.num / self.den - other\r\n elif type(other) == Poly:\r\n return NotImplemented\r\n else:\r\n other = Fraction(other)\r\n return Fraction(self.num * other.den - other.num * self.den, self.den * other.den)\r\n\r\n def __rsub__(self, other):\r\n if(type(self - other) == Fraction):\r\n return Fraction(-(self - other).num, (self - other).den)\r\n else:\r\n return -(self - other)\r\n\r\n def __isub__(self, other):\r\n if type(other) == float:\r\n self = self.num / self.den - other\r\n else:\r\n other = Fraction(other)\r\n self.num = self.num * other.den - other.num * self.den\r\n self.den = self.den * other.den\r\n self.reduce()\r\n return self\r\n\r\n def __pos__(self):\r\n return self\r\n\r\n def __neg__(self):\r\n return Fraction(-self.num, self.den)\r\n\r\n def __abs__(self):\r\n return Fraction((-self.num) * int(self.num < 0) + (self.num) * (self.num >= 0), self.den)\r\n\r\n def __int__(self):\r\n return self.num // self.den\r\n\r\n def __float__(self):\r\n return self.num / self.den\r\n\r\n def __round__(self, x = 0):\r\n return round(float(self), x)\r\n\r\n\r\nclass Poly:\r\n def __init__(self, s = 0):\r\n if type(s) in [int, float, Fraction]:\r\n self.list = [s]\r\n elif type(s) == str:\r\n self.list, s = [], s.split()\r\n for elem in S:\r\n self.list += eval(elem)\r\n elif type(s) == Poly:\r\n self.list = s.list\r\n else:\r\n self.list = list(s)\r\n\r\n def __str__(self):\r\n P, S, power, first = [chr(8304), chr(185), chr(178), chr(179)] + [chr(i) for i in range(8308, 8314)], \"\", len(self.list) - 1, True\r\n for i in range(len(self.list) - 1, -1, -1):\r\n current = self.list[i]\r\n if current != 0:\r\n if current > 0:\r\n S += \" + \" * int(not first)\r\n else:\r\n S += \" - \" * int(not first) + \"-\" * int(first)\r\n current = abs(current)\r\n if current != 1 or (current == 1 and power == 0):\r\n if type(current) == Fraction:\r\n if current.den == 1:\r\n S += str(int(current.num))\r\n else:\r\n S += \"(\" + str(current) + \")\"\r\n elif type(current) == float:\r\n S += str(round(current, 3))\r\n else:\r\n S += str(current)\r\n S += ('x' * (power != 0))\r\n for elem in str(power):\r\n S += P[int(elem)] * (not(elem in [\"0\", \"1\"] and len(str(power)) == 1))\r\n first = len(S) == 0\r\n power -= 1\r\n if S == \"\":\r\n return \"0\"\r\n return S\r\n\r\n def __neg__(self):\r\n result = []\r\n for elem in self.list:\r\n result.append(-elem)\r\n return Poly(result)\r\n\r\n def __add__(self, other):\r\n result = []\r\n if type(other) == Poly:\r\n for i in range(max(len(self.list), len(other.list))):\r\n if i < len(self.list):\r\n if i < len(other.list):\r\n result.append(self.list[i] + other.list[i])\r\n else:\r\n result.append(self.list[i])\r\n else:\r\n if i < len(other.list):\r\n result.append(other.list[i])\r\n else:\r\n result.append(0)\r\n return Poly(result)\r\n else:\r\n lolka = [self.list[0] + other] + self.list[1:]\r\n return Poly(lolka)\r\n\r\n def __radd__(self, other):\r\n return self + other\r\n\r\n def __iadd__(self, other):\r\n self.list = (self + other).list\r\n return self\r\n\r\n def __sub__(self, other):\r\n result = []\r\n if type(other) == Poly:\r\n for i in range(max(len(self.list), len(other.list))):\r\n if i < len(self.list):\r\n if i < len(other.list):\r\n result.append(self.list[i] - other.list[i])\r\n else:\r\n result.append(self.list[i])\r\n else:\r\n if i < len(other.list):\r\n result.append(-other.list[i])\r\n else:\r\n result.append(0)\r\n return Poly(result)\r\n else:\r\n lolka = [self.list[0] - other] + self.list[1:]\r\n return Poly(lolka)\r\n\r\n def __rsub__(self, other):\r\n return -(self - other)\r\n\r\n def __isub__(self, other):\r\n self.list = (self - other).list\r\n return self\r\n\r\n def __or__(self, other):\r\n if len(self.list) == 1:\r\n return self.list[0]\r\n result = self.list[len(self.list) - 1]\r\n for i in range(len(self.list) - 2, -1, -1):\r\n result = result * other + self.list[i]\r\n return result\r\n\r\n def __mul__(self, other):\r\n result, p = [], Poly(other)\r\n for i in range(len(self.list)):\r\n for j in range(len(p.list)):\r\n if len(result) > i + j:\r\n result[i + j] += self.list[i] * p.list[j]\r\n else:\r\n result += [0] * (i + j - len(result)) + [self.list[i] * p.list[j]]\r\n return Poly(result)\r\n\r\n def __rmul__(self, other):\r\n return self * other\r\n\r\n def __imul__(self, other):\r\n self.list = (self * other).list\r\n return self\r\n\r\n def __pow__(self, other):\r\n if other == 0:\r\n return Poly(1)\r\n if other % 2 == 1:\r\n return Poly((self ** (other - 1)) * self)\r\n else:\r\n lolka = self ** (other // 2)\r\n return Poly(lolka * lolka)\r\n\r\n def __ipow__(self, other):\r\n self.list = (self ** other).list\r\n return self\r\n\r\n def __divmod__(self, other):\r\n result = [0] * 100\r\n p = deepcopy(self.list)\r\n q = Poly(other).list\r\n power1, power2 = len(p) - 1, len(q) - 1\r\n while(power1 > -1 and p[power1] == 0):\r\n power1 -= 1\r\n while(power2 > -1 and q[power2] == 0):\r\n power2 -= 1\r\n while(power1 > -1 and power2 > -1 and power1 >= power2):\r\n minus = [0] * (power1 - power2)\r\n if type(p[power1]) == int and type(q[power2]) == int:\r\n if p[power1] % q[power2] == 0:\r\n current = p[power1] // q[power2]\r\n else:\r\n current = Fraction(p[power1], q[power2])\r\n else:\r\n current = p[power1] / q[power2]\r\n for elem in q:\r\n minus += [elem * current]\r\n for i in range(max(len(p), len(minus))):\r\n if i < len(p):\r\n if i < len(minus):\r\n p[i] -= minus[i]\r\n else:\r\n if i < len(minus):\r\n p.append(-minus[i])\r\n else:\r\n p.append(0)\r\n result[power1 - power2] = current\r\n while(power1 > -1 and p[power1] == 0):\r\n power1 -= 1\r\n while(power2 > -1 and q[power2] == 0):\r\n power2 -= 1\r\n #result += [current]\r\n return (Poly(result), Poly(p))\r\n\r\n def __rdivmod__(self, other):\r\n return divmod(Poly(other), self)\r\n\r\n def __floordiv__(self, other):\r\n return divmod(self, other)[0]\r\n\r\n def __rfloordiv__(self, other):\r\n return divmod(Poly(other), self)[0]\r\n\r\n def __ifloordiv__(self, other):\r\n self.list = (divmod(self, other)[0]).list\r\n return self\r\n\r\n def __mod__(self, other):\r\n return divmod(self, other)[1]\r\n\r\n def __rmod__(self, other):\r\n return divmod(Poly(other), self)[1]\r\n\r\n def __imod__(self, other):\r\n self.list = (divmod(self, other)[1]).list\r\n return self\r\n\r\n#begin = time()\r\np, q = list(map(int, input().split()))\r\nlolka = Fraction(p, q)\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\nAnswer = Fraction(A[-1])\r\nfor i in range(len(A) - 2, -1, -1):\r\n Answer = 1 / Answer\r\n Answer += A[i]\r\nif(Answer == lolka):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n#print(time() - begin)\r\n\r\n", "# some math vlad\np,q=map(int,input().split())\nn=int(input())\na=list(map(int,input().split()))\nx,y=a[n-1],1\nfor i in range(n-1)[::-1]:x,y=a[i]*x+y,x\nprint (['NO','YES'][p*y==q*x])\n\t \t\t\t \t \t \t \t\t\t \t \t \t \t", "from fractions import *\r\np,q = map(int,input().split())\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na = [0] + a\r\nans = Fraction(a[n])\r\nfor i in range(n-1,0,-1):\r\n\tans = Fraction(1,ans)\r\n\tans += Fraction(a[i],1)\r\nprint(\"YES\" if Fraction(p,q) == ans else \"NO\")", "\r\ndef gcd(x,y):\r\n if(y == 0):\r\n return x\r\n else:\r\n return gcd(y,x%y) \r\n\r\np, q = [int(i) for i in input().split()]\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nx, y = 1, 0\r\nfor i in a[::-1]:\r\n x, y = y+i*x, x\r\na, b = gcd(p,q), gcd(x,y)\r\np = p // a;\r\nq = q // a\r\nx = x // b\r\ny = y // b\r\nif x == p and y == q:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def gcd(x, y):\r\n if (x == 0 or y == 0):\r\n return x + y\r\n return gcd(y, x % y)\r\np, q = map(int, input().split())\r\nn = input()\r\na = list(map(int, input().split()))\r\na.reverse()\r\npi, qi = 1, 0\r\nfor i in range(len(a)):\r\n pi, qi = qi + pi * a[i], pi\r\n g = gcd(pi, qi)\r\n pi = pi // g\r\n qi = qi // g\r\ng = gcd(p, q)\r\np = p // g\r\nq = q // g\r\nif p == pi and q == qi:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")# 1690154419.0676935", "#!/usr/bin/python3\n\np, q = tuple(map(int, input().strip().split()))\nn = int(input().strip())\na = list(map(int, input().strip().split()))\na.reverse()\n\ndef gcd(a, b):\n while a:\n a, b = b % a, a\n return b\n\ng = gcd(p, q)\np, q = p // g, q // g\n\nu, v = 0, 1;\n\nfor i in a:\n v, u = v * i + u, v\n g = gcd(u, v)\n u, v = u // g, v // g\nif p == v and q == u:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "p,q=tuple(map(int,input().split()))\nn1=input().split()\nn=int(n1[0])\na=list(map(int,input().split()))\nx=1\ny=a[n-1]\nfor i in range (n-2,-1,-1):\n x1=a[i]*y+x\n x=y\n y=x1\nif p*x==q*y:\n print('YES')\nelse:\n print('NO')\n \n", "p,q = input().split()\r\np = int(p)\r\nq = int(q)\r\nn = int(input())\r\nA = input().split()\r\na = 1\r\nb = int(A[n-1])\r\ni = n-2\r\nwhile( i >= 0 ):\r\n aux = b\r\n b = a + b*int(A[i])\r\n a = aux\r\n i = i-1\r\n\r\nprint (\"YES\" if p*a == q*b else \"NO\" )", "#!/usr/bin/env python3\nimport fractions\np, q = map(int,input().split())\nn = int(input())\na = list(map(int,input().split()))\ny = fractions.Fraction(p, q)\nx = fractions.Fraction(0)\nfor it in reversed(a):\n if x != 0:\n x = 1 / x\n x += it\nprint(['NO','YES'][x == y])\n", "p, q = map(int, input().split())\nn = int(input())\ntry:\n for v in map(int, input().split()):\n if q and p // q == v:\n p, q = q, p % q\n elif q and p // q == v + 1:\n p, q = q, p - q * v\n else:\n raise Exception\n print(\"NO\" if q else \"YES\")\nexcept:\n print(\"NO\")\n", "from fractions import Fraction as fr\r\np,q=[fr(int(e)) for e in input().split()]\r\nn=int(input())\r\na=[fr(int(e)) for e in input().split()]\r\ndef f(i):\r\n if i==n-1:\r\n return a[i]\r\n return a[i]+fr(1)/f(i+1)\r\nprint(\"YES\" if f(0)==fr(p,q) else \"NO\")", "def gcd(a,b):\r\n if(b==0):\r\n return a\r\n return gcd(b,a%b)\r\np,q=map(int,input().split())\r\nN=int(input())\r\nA=list(map(int,input().split()))\r\nznam=1\r\nchisl=A[N-1]\r\n\r\nfor i in range (N-1,0,-1):\r\n chisl,znam=znam,chisl\r\n #print(chisl,znam)\r\n chisl += znam*A[i-1]\r\n #print(chisl,znam)\r\nif(p*znam==q*chisl):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n" ]

[ "n = int(input())\r\nread = list(map(int, input().split()))\r\nread.sort()\r\ncount = {}\r\nexist = set()\r\npoints = [[0] * 100001 for i in range(0, 2)]\r\nfor i in range(0, n):\r\n if not read[i] in count:\r\n count[read[i]] = 1\r\n exist.add(read[i])\r\n else:\r\n count[read[i]] += 1\r\nfor i in range(0, read[n-1] + 1):\r\n if not (i in exist):\r\n points[0][i] = max(points[0][i-1], points[1][i-1])\r\n points[1][i] = points[0][i]\r\n continue\r\n points[0][i] = max(points[0][i-1], points[1][i-1])\r\n points[1][i] = points[0][i-1] + i*count[i]\r\nprint(max(points[0][read[n-1]], points[1][read[n-1]]))\r\n# 荆屹然 化学与分子工程学院 2300011884\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 22 01:12:17 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\ns = [0]*100002\r\nfor i in a:\r\n s[i]+=i\r\nres,b=0,0\r\nfor d in s:\r\n res,b = max(res,b),res+d\r\nprint(res)", "n = int(input())\nvals = list(map(int, input().split(\" \")))\n\noccu = [0 for _ in range(max(vals) + 1)]\nl = [0 for _ in range(max(vals) + 1)]\nfor x in vals:\n occu[x] += 1\ngive = []\nl[1] = occu[1]\nfor i in range(2, len(occu)):\n l[i] = max(l[i-2] + i * occu[i],l[i-1])\nprint(l[-1])", "def max_points(n, a):\r\n frequency = [0] * 100001\r\n for num in a:\r\n frequency[num] += 1\r\n dp = [0] * 100001\r\n dp[0] = 0\r\n dp[1] = frequency[1]\r\n for i in range(2, 100001):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * frequency[i])\r\n\r\n return dp[100000]\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nresult = max_points(n, a)\r\nprint(result)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * 100001\r\nfor num in a:\r\n count[num] += 1\r\n\r\ndp = [0] * 100001\r\ndp[0] = 0\r\ndp[1] = count[1]\r\n\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * count[i])\r\n\r\nprint(dp[100000])\r\n", "input()\r\na = [int(i) for i in input().split()]\r\nnum = dict()\r\ndp = [0]\r\n\r\ndef Add(x):\r\n if x in num:\r\n num[x] += 1\r\n else:\r\n num[x] = 1\r\n\r\ndef dinamic(i):\r\n if i-1 in num:\r\n return max(dp[-1], dp[-2]+i*num[i])\r\n else:\r\n return dp[-1]+i*num[i]\r\n\r\nfor i in range(len(a)):\r\n Add(a[i])\r\n\r\nkeys = list(num.keys())\r\nkeys.sort()\r\n\r\nfor i in keys:\r\n dp.append(dinamic(i))\r\n\r\nprint(dp[-1])\r\n ", "def maxPoints(n, a):\r\n freq = [0] * (max(a) + 2)\r\n for num in a:\r\n freq[num] += 1\r\n \r\n points = [0] * (max(a) + 2)\r\n points[1] = freq[1]\r\n \r\n for i in range(2, max(a) + 2):\r\n points[i] = max(points[i - 1], points[i - 2] + i * freq[i])\r\n\r\n return points[max(a) + 1]\r\n\r\n# Read input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum points\r\nprint(maxPoints(n, a))\r\n", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\ncount = [0] * 100001\r\nfor num in sequence:\r\n count[num] += 1\r\n\r\nprev_key = None\r\nprev_points = 0\r\ncurrent_points = 0\r\n\r\nfor key in range(1, 100001):\r\n if count[key] > 0:\r\n if prev_key is not None and key - prev_key == 1:\r\n current_points, prev_points = max(current_points, prev_points + count[key] * key), current_points\r\n else:\r\n \r\n current_points, prev_points = max(current_points + count[key] * key, prev_points), current_points\r\n\r\n prev_key = key\r\n\r\nprint(current_points)", "from collections import Counter\r\ninput()\r\ns = Counter(map(int,input().split()))\r\nm = max(s)\r\ndp = [0]*(m+1)\r\ndp[1] = s[1]\r\ndp[2] = max(dp[1],2*s[2])\r\nfor i in range(3,m+1):\r\n dp[i] = max(dp[i-2] + i*s[i], dp[i-1])\r\nprint(dp[-1])", "n, arr = int(input()), [int(t) for t in input().split()]\r\nub = max(arr)\r\ncount, dp = [0] * (ub + 1), [0] * (ub + 1)\r\nfor i in arr: count[i] += i\r\ndp[1], dp[2] = count[1], count[2]\r\nfor i in range(3, ub + 1):\r\n dp[i] = count[i] + max(dp[i - 2], dp[i - 3])\r\nprint(max(dp[-1], dp[-2]))", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nm = [0] * (max(a)+1)\r\nfor i in a:\r\n m[i] += 1\r\n\r\ndp = [0,m[1]]\r\nfor i in range(2,max(a)+1):\r\n dp.append(max(dp[i-1],dp[i-2]+m[i]*i))\r\n\r\nprint(dp[max(a)])", "n = int(input())\r\nstring = [-5]+sorted(list(map(int,input().split())))+[-10]\r\nb = [0]*(n+2)\r\nc = {}\r\ne = 1\r\nx = 1\r\nwhile string[x] != -10:\r\n if string[x]==string[x-1]:\r\n e += 1\r\n c[string[x]]=e\r\n string.pop(x)\r\n else:\r\n e = 1\r\n c[string[x]]=e\r\n x += 1\r\nfor i in range(1,len(string)-1):\r\n j = i-1\r\n if string[i-1]==string[i]-1:\r\n j = i-2\r\n b[i] = max(b[i-1],b[j]+string[i]*c[string[i]])\r\nprint(b[len(string)-2])", "n = int(input())\r\nc = [0]*(10**5+1)\r\nfor i in map(int,input().split()):\r\n c[i] +=1\r\ndp = [0]*(10**5+1)\r\nfor i in range(1,100001):\r\n dp[i] = max(dp[i-1],dp[i-2]+i*c[i])\r\nprint(max(dp))", "from collections import Counter\r\n \r\nn = int(input())\r\nf = Counter(map(int, input().split()))\r\nmx = max(f)+1\r\n \r\ndp = [0]*mx\r\ndp[1]=f[1]\r\nfor i in range(2, mx):\r\n dp[i] = max(dp[i-1], dp[i-2] + f[i]*i)\r\n \r\nprint(dp[-1])", "from sys import *\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop, heapify\r\nfrom collections import *\r\nfrom math import *\r\nfrom itertools import *\r\nfrom math import *\r\n# stdin = open(\"input.txt\", \"r\")\r\ninput = stdin.readline\r\ndef getarr():\r\n return list(map(int, input().split()))\r\n \r\ndef getstr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n \r\ndef prli(arr):\r\n stdout.write(\" \".join(map(str, arr)) + \"\\n\")\r\n \r\ndef foo(A):\r\n C = Counter(A)\r\n A = sorted([(v, cnt) for v, cnt in C.items()])\r\n n = len(A)\r\n dp = [0]*(n+1)\r\n dp[1] = A[0][0]*A[0][1]\r\n for r in range(2, n+1):\r\n v, cnt = A[r-1]\r\n pv, _ = A[r-2]\r\n if v > pv+1:\r\n dp[r] = dp[r-1]+v*cnt\r\n continue\r\n dp[r] = max(dp[r-1], dp[r-2]+v*cnt)\r\n return dp[n]\r\n\r\nn = getarr()[0]\r\nA = getarr()\r\nprint(foo(A))", "from collections import defaultdict\r\nn=int(input())\r\narr=[int(i) for i in input().split()]\r\ndata=defaultdict(int)\r\nfor i in arr: \r\n data[i]+=1\r\narr=sorted(data.items())\r\nn=len(arr)\r\n\r\ndp=[[0]*2 for i in range(n)]\r\ndp[0][0]=0\r\ndp[0][1]=arr[0][0]*arr[0][1]\r\n\r\n\r\nfor i in range(1,n):\r\n dp[i][0]=max(dp[i-1][0],dp[i-1][1])\r\n dp[i][1]=arr[i][0]*arr[i][1]+max(dp[i-1][0],dp[i-1][1] if arr[i-1][0]+1!=arr[i][0] else 0)\r\nprint(max(dp[n-1]))", "def maxPoints(n, a):\r\n freq = [0] * (max(a) + 1)\r\n for num in a:\r\n freq[num] += 1\r\n\r\n dp = [0] * (max(a) + 1)\r\n dp[1] = freq[1]\r\n \r\n for i in range(2, max(a) + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * freq[i])\r\n\r\n return dp[max(a)]\r\n\r\n# Read input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum points\r\nprint(maxPoints(n, a))\r\n", "input()\r\na = [int(x) for x in input().split()]\r\nb = [0]*100001\r\nfor i in a:\r\n b[i] += 1\r\nfor i in range(2, 100001):\r\n b[i] = max(b[i-1], b[i-2]+i*b[i])\r\nprint(b[100000])", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\n# Đếm số lần xuất hiện của mỗi số\r\nfreq = [0] * (max(nums) + 1)\r\nfor num in nums:\r\n freq[num] += 1\r\n\r\n# Sử dụng Dynamic Programming để tính tổng lớn nhất\r\ndp = [0] * (max(nums) + 1)\r\ndp[1] = freq[1]\r\nfor i in range(2, max(nums) + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * freq[i])\r\n\r\n# Kết quả là tổng lớn nhất\r\nprint(dp[max(nums)])", "n=int(input())\r\ns=list(map(int,input().split()))\r\ndp=[0]*(max(s)+1)\r\ncount=[0]*(max(s)+1)\r\nfor i in s:\r\n count[i]+=1\r\ndp[0],dp[1]=0,count[1]\r\nfor i in range(2,max(s)+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+count[i]*i)\r\nprint(dp[max(s)])", "# https://codeforces.com/contest/455/problem/A\n\nN = 10**5\nn = int(input())\n\na = [0]*(N+1)\nfor x in map(int, input().split()):\n a[x] += 1\n\n# dp = [0, a[1]] + [0]*(N-1)\n# for i in range(2, N+1):\n# dp[i] = max(dp[i-1], dp[i-2] + a[i]*i)\n# print(dp[-1])\n\np, q = 0, a[1]\nfor i in range(2, N+1):\n r = max(q, p+a[i]*i)\n p, q = q, r\nprint(q)\n", "def max_points(n, sequence):\r\n # Count the frequency of each number in the sequence\r\n freq = [0] * (max(sequence) + 1)\r\n for num in sequence:\r\n freq[num] += 1\r\n \r\n # Calculate the maximum points using dynamic programming\r\n dp = [0] * (max(sequence) + 1)\r\n dp[1] = freq[1]\r\n for i in range(2, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * freq[i])\r\n \r\n return dp[-1]\r\n\r\n# Read input from user\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Call the function and print the result\r\nprint( max_points(n, sequence))", "MAX_N = int(1e5) + 10\n# MAX_N = 4\nn = int(input())\nm = list(map(int, input().split()))\n\nA = [0 for _ in range(MAX_N)]\nDP = [0 for _ in range(MAX_N)]\n\nfor i in m:\n A[i] += 1\n\nDP[1] = A[1]\n\nfor i in range(2, MAX_N):\n DP[i] = max(DP[i - 2] + i * A[i], DP[i - 1])\n # print(f'{i} - {DP[i]}')\n\nprint(DP[MAX_N - 1])\n", "n = int(input())\r\nb = list(map(int, input().split()))\r\nc = []\r\n\r\nfor i in range(100001):\r\n c.append(0)\r\nfor i in range(len(b)):\r\n c[b[i]] += b[i]\r\nfor i in range(3, 100001):\r\n c[i] = max(c[i - 2], c[i - 3]) + c[i]\r\nprint(max(c[100000], c[99999]))\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nm=max(l)\r\na=[0]*(m+1)\r\nfor i in l:\r\n a[i]+=1\r\ndp=[0]*(m+1)\r\ndp[0]=0\r\ndp[1]=a[1]\r\nfor i in range(2,m+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+a[i]*i)\r\nprint(max(dp))", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\nmax_element = max(sequence)\r\ndp = [0] * (max_element + 1)\r\nfrequency = [0] * (max_element + 1)\r\nfor num in sequence:\r\n frequency[num] += 1\r\ndp[1] = frequency[1]\r\nfor i in range(2, max_element + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * frequency[i])\r\nmax_points = max(dp)\r\n\r\n# Print the result\r\nprint(max_points)\r\n", "n = int(input())\r\nmx = 0\r\nf = [0] * 100001\r\na = [0] * 100001\r\nfor s in list(map(int,input().split())):\r\n mx = max(s, mx)\r\n a[s] += 1\r\nf[1] = a[1]\r\nfor i in range(2,mx + 1):\r\n f[i] = max(f[i-1],f[i-2] + a[i] * i)\r\nprint(f[mx])", "def max_points(n, sequence):\r\n # Create a frequency table to count the occurrences of each element in the sequence\r\n freq = [0] * (max(sequence) + 1)\r\n for num in sequence:\r\n freq[num] += 1\r\n\r\n # Initialize two variables to store the maximum points earned for the current and previous elements\r\n dp = [0] * (max(sequence) + 1)\r\n\r\n # Base case: dp[0] = 0, dp[1] = freq[1]\r\n dp[1] = freq[1]\r\n\r\n # Iterate over the frequency table to calculate the maximum points\r\n for i in range(2, len(dp)):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * freq[i])\r\n\r\n # Return the maximum points earned\r\n return dp[-1]\r\n\r\n# Read the input values\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Call the max_points function and print the result\r\nresult = max_points(n, sequence)\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\npoints = [0] * 100001\r\nfor i in a:\r\n points[i] += i\r\n\r\ndp = [0] * 100001\r\ndp[1] = points[1]\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i-1], dp[i-2]+points[i])\r\n\r\nprint(dp[100000])\r\n", "def max_points(n,sequence):\r\n max_value = max(sequence)\r\n freq= [0] * (max_value+1)\r\n for num in sequence:\r\n freq[num] += num\r\n dp = [0] * (max_value+1)\r\n dp[1] = freq[1]\r\n for i in range(2,max_value+1):\r\n dp[i] = max(dp[i-1],dp[i-2]+freq[i])\r\n return dp[max_value]\r\n\r\nn = int(input())\r\nsequence = list(map(int,input().split()))\r\nresult = max_points(n,sequence)\r\nprint(result)", "n = int(input())\r\npoints = [0] * 100005; ans = [0] * 100005\r\nlst = [int(_) for _ in input().split()]\r\nfor i in lst:\r\n points[i] += i\r\n\r\nans[1] = points[1]\r\nfor j in range(2, 100005):\r\n ans[j] = max(ans[j - 1], ans[j - 2] + points[j])\r\nprint(ans[100004])\r\n", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Count the frequency of each number in the sequence\r\nfrequency = [0] * (max(sequence) + 1)\r\nfor num in sequence:\r\n frequency[num] += 1\r\n\r\n# Calculate the maximum points using dynamic programming\r\ndp = [0] * (max(sequence) + 1)\r\ndp[1] = frequency[1] * 1\r\nfor i in range(2, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2] + frequency[i] * i)\r\n\r\n# Print the maximum points\r\nprint(dp[-1])\r\n", "\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nmx = max(a)\r\nmn = min(a)\r\nf = [0]*(mx+1)\r\ndp = [0]*(mx+1)\r\nfor e in a:f[e]+=1\r\ndp[mn] = mn*f[mn]\r\n\r\nfor i in range(mn+1, mx+1):\r\n dp[i] = max(dp[i-1], dp[i-2] + i*f[i])\r\n \r\nprint(dp[mx])\r\n", "# Function to calculate power\r\ndef pow(a, b):\r\n res = 1\r\n while b > 0:\r\n if b & 1:\r\n res *= a\r\n b //= 2\r\n a *= a\r\n return res\r\n\r\n# Read the number of elements\r\nn = int(input().strip())\r\n\r\n# Read the elements into a list\r\nv = list(map(int, input().strip().split()))\r\n\r\n# Initialize maximum element and count array\r\nm = max(v)\r\ncnt = [0] * (100005)\r\n\r\n# Count the occurrences of each element\r\nfor i in range(n):\r\n cnt[v[i]] += 1\r\n\r\n# Initialize dp array for dynamic programming solution\r\ndp = [0] * (100005)\r\ndp[1] = cnt[1]\r\n\r\n# Calculate maximum sum of non-adjacent elements\r\nfor i in range(2, m + 1):\r\n dp[i] = max(dp[i - 1], i * cnt[i] + dp[i - 2])\r\n\r\n# Print the result\r\nprint(dp[m])", "n=int(input())\r\nline=[int(x) for x in input().split()]\r\nline.sort()\r\nnmax=line[-1]\r\nline.append(0)\r\ncishu=0\r\nnum=[0]*(nmax+1)\r\nfor t in range(n):\r\n if line[t]==line[t+1]:\r\n cishu+=1\r\n else:\r\n cishu+=1\r\n num[line[t]]=cishu\r\n cishu=0\r\nscore=[num[1],max(num[1],num[2]*2)]\r\nif nmax>2:\r\n for i in range(3,nmax+1):\r\n you=max(score[i-2],score[i-3]+i*num[i])\r\n score.append(you)\r\nprint(score[-1])", "def max_score(n, a):\n counter = {}\n for num in a:\n if num in counter:\n counter[num] += 1\n else:\n counter[num] = 1\n\n max_value = max(a)\n dp = [0] * (max_value + 1)\n dp[1] = counter.get(1, 0)\n\n for i in range(2, max_value + 1):\n dp[i] = max(dp[i - 1], dp[i - 2] + i * counter.get(i, 0))\n\n return dp[max_value]\n\nn = int(input())\na = list(map(int, input().split()))\nprint(max_score(n, a))\n\n", "from collections import Counter\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\ncount = Counter(sequence)\r\ndp = [0] * (max(sequence) + 1)\r\nfor i in range(1, len(dp)):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * count[i])\r\n\r\nprint(dp[-1])\r\n", "N = int(input())\r\na = list(map(int,input().split()))\r\nm = max(a)+1\r\narr = [0]*m\r\nfor i in a:\r\n\tarr[i] += 1\r\n\t\r\ndp = [0]*m\r\ndp[1] = arr[1]\r\nfor i in range(2,m):\r\n\tdp[i] = max(dp[i-1],dp[i-2]+arr[i]*i)\r\n\t\r\nprint(dp[m-1])\r\n", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Count the frequency of each number in the sequence\r\ncount = [0] * (max(sequence) + 1)\r\nfor num in sequence:\r\n count[num] += 1\r\n\r\n# Initialize a dynamic programming array dp\r\ndp = [0] * (max(sequence) + 1)\r\n\r\n# Base case: dp[i] represents the maximum points for sequence ending at i\r\ndp[1] = count[1]\r\n\r\n# Fill the dp array\r\nfor i in range(2, max(sequence) + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * count[i])\r\n\r\nprint(dp[-1])\r\n", "from collections import Counter\r\ninput();a,b=0,0\r\ns = Counter(map(int,input().split()))\r\nfor i in range(1,max(s.keys())+1):\r\n a,b=max(a,b+s[i]*i),a\r\nprint(a)", "from collections import Counter\r\nn=int(input())\r\na = list(map(int, input().split(' ')))\r\ny=list(set(a))\r\ns=Counter(a)\r\ny.sort()\r\nn=len(y)\r\ndp=[0]*n\r\nfor i in range (0,n):\r\n if i==0:\r\n dp[i]=y[i]*s[y[i]]\r\n elif i==1:\r\n if y[i]==y[i-1]+1:\r\n dp[i]=max(dp[0],y[i]*s[y[i]])\r\n else:\r\n dp[i]=dp[0]+y[i]*s[y[i]]\r\n else:\r\n if y[i]==y[i-1]+1:\r\n dp[i]=max(dp[i-1],y[i]*s[y[i]]+dp[i-2])\r\n else:\r\n dp[i]=dp[i-1]+y[i]*s[y[i]]\r\nprint(dp[-1])\r\n", "# 同一个数字，只有零次和无数次，所以可以先把每个数字总分统计起来\r\n#在总分不为零的连续数中，间隔一个或两个取数，少了矛盾，多了浪费\r\nn = int(input())\r\ndp = [0]*(100000+2)\r\npt = [0]*(100000+2)\r\narr = list(map(int , input().split()))\r\nfor i in range(n):\r\n pt[arr[i]] += arr[i]\r\n#统分完毕\r\ndp[1] = pt[1]\r\nfor i in range(2,100002):\r\n dp[i] = max(dp[i-1] , dp[i-2]+pt[i])\r\nprint(dp[100000])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_value = max(a)\r\n\r\ndp = [0] * (max_value + 1)\r\n\r\ncount = [0] * (max_value + 1)\r\nfor ai in a:\r\n count[ai] += 1\r\n\r\ndp[1] = count[1] * 1\r\nfor i in range(2, max_value + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + count[i] * i)\r\n\r\nprint(max(dp))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Initialize the dp array\r\ndp = [0] * (10**5 + 1)\r\n\r\n# Calculate the maximum points\r\nfor ai in a:\r\n dp[ai] += ai\r\n\r\n# Update the dp array using dynamic programming\r\nfor i in range(2, 10**5 + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + dp[i])\r\n\r\n# Find the maximum points\r\nmax_points = max(dp)\r\n\r\nprint(max_points)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nvisit = [0] * 100005\r\nf = [0] * 100005\r\n\r\nmi = a[0]\r\nma = a[0]\r\n\r\nfor i in range(n):\r\n visit[a[i]] += 1\r\n mi = min(mi, a[i])\r\n ma = max(ma, a[i])\r\n\r\nfor i in range(mi, ma + 1):\r\n f[i] = max(visit[i] * i + f[i - 2], f[i - 1])\r\n\r\nprint(f[ma])\r\n", "n=input()\r\ns=[0]*1000001\r\nfor i in map(int,input().split()):\r\n s[i]+=i\r\na=b=0\r\nfor d in s:\r\n a,b=max(a,b),a+d\r\nprint(a)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\n# 统计每个数字出现的次数\r\ncount = [0] * (max(nums) + 1)\r\nfor num in nums:\r\n count[num] += 1\r\n\r\n# 动态规划\r\ndp = [0] * (max(nums) + 1)\r\ndp[1] = count[1]\r\n\r\nfor i in range(2, max(nums) + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * count[i])\r\n\r\nprint(dp[-1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\n# Создаем словарь, где ключами являются элементы последовательности,\r\n# а значениями - количество вхождений каждого элемента\r\ncount = {}\r\nfor i in a:\r\n if i in count:\r\n count[i] += 1\r\n else:\r\n count[i] = 1\r\n \r\n# Вычисляем максимальное количество очков\r\ndp = [0] * (max(a) + 1)\r\ndp[1] = count.get(1, 0)\r\nfor i in range(2, max(a) + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * count.get(i, 0))\r\n \r\nprint(dp[max(a)])\r\n", "import collections\r\n\r\n\r\ndef task():\r\n _ = input()\r\n arr = list(map(int, input().split()))\r\n cnt = collections.defaultdict(int)\r\n for num in arr:\r\n cnt[num] += 1\r\n dp = [0] * (max(arr) + 1)\r\n dp[0] = 0\r\n dp[1] = cnt[1]\r\n for i in range(2, len(dp)):\r\n dp[i] = max(dp[i - 2] + cnt[i] * i, dp[i - 1])\r\n return dp[-1]\r\n\r\n\r\nif __name__ == '__main__':\r\n print(task())\r\n", "def maxx(n, a):\r\n d = [0] * 100001\r\n for i in range(n):\r\n d[a[i]] += a[i]\r\n for i in range(2, 100001):\r\n d[i] = max(d[i - 1], d[i - 2] + d[i])\r\n return max(d)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(maxx(n, a))", "def solve():\r\n n = int(input())\r\n nums = [int(i) for i in input().split()]\r\n cnt = {}\r\n for i in nums:\r\n if i not in cnt:\r\n cnt[i] = 0\r\n cnt[i] += 1\r\n a = list(cnt.items())\r\n a.sort()\r\n dp = [[0, 0] for i in range(len(a))]\r\n dp[0][1] = a[0][0] * a[0][1]\r\n for i in range(1, len(a)):\r\n dp[i][0] = max(dp[i - 1])\r\n dp[i][1] = max(max(dp[i - 2]) * (i - 2 >= 0), max(dp[i - 1]) * (a[i][0] - a[i - 1][0] > 1)) + a[i][0] * a[i][1]\r\n print(max(dp[-1]))\r\n\r\nsolve()\r\n", "from math import sqrt, ceil, floor\r\n# import sys\r\n# sys.setrecursionlimit(10000)\r\n# s = input()\r\n# n = int(input())\r\n# j = [int(i) for i in input().split(\" \")]\r\n# a, b = [int(i) for i in input().split(\" \")]\r\n# a, b, c = [int(i) for i in input().split(\" \")]\r\nN = 100001\r\nn = int(input())\r\na = [int(i) for i in input().split(\" \")]\r\ncnt = [0 for x in range(N)]\r\nfor i in range(n):\r\n cnt[a[i]] += 1\r\ndp = [0 for x in range(N)]\r\n\r\ndp[0] = 0\r\ndp[1] = cnt[1]\r\nfor i in range(2, N):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + (cnt[i] * i))\r\n\r\n\r\n\r\nprint(dp[N - 1])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ns = max(a)\r\ncount = [0]*(s+1)\r\nfor i in a:\r\n count[i]+=1\r\nans = [0]*(s+1)\r\nans[1] = count[1]\r\nfor i in range(2,s+1):\r\n ans[i] = max(ans[i-1],ans[i-2]+count[i]*i)\r\nprint(max(ans))", "rozm=10**5+1\r\nN=int(input())\r\nL=[0]*(rozm+3)\r\n\r\nfor i in input().split():\r\n L[int(i)]+=int(i)\r\n\r\nS=[0]*(rozm+2)\r\nS[1]=L[1]\r\nuzyt_ost=True\r\nalt=0\r\n\r\nfor i in range(2,rozm+2):\r\n S[i]=max(S[i-1], S[i-2]+L[i])\r\n\r\n#print(L)\r\n#print(S)\r\nprint(S[-1])\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 8 17:16:17 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\naa = sorted(list(set(a)))\r\nlength = len(aa)\r\ncounts = [0]*(max(aa)+1)\r\nfor k in a:\r\n counts[k] += 1\r\ndp = [0]*(length+1)\r\ndp[1] = aa[0] * counts[aa[0]]\r\nfor i in range(2, length+1):\r\n dp[i] = max(dp[i-1], aa[i-1] * counts[aa[i-1]] + dp[i-2 if aa[i-2] == aa[i-1] - 1 else i-1])\r\nprint(dp[length])", "input()\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=max(a)\r\nseq=[0]*(m+1)\r\nfor i in a:\r\n seq[i]+=i\r\n \r\nx=y=0\r\nfor i in seq:\r\n x,y=max(x,i+y),x\r\nprint(x)\r\n\t ", "n=int(input())\r\nl=list(map(int,input().split()))\r\ndp=[]\r\nmx=0\r\nfor i in range(0,100001):\r\n\tdp.append(0)\r\nfor i in range(0,n):\r\n\tdp[l[i]]+=l[i]\r\n\tmx=max(mx,l[i])\r\nfor i in range(2,mx+1):\r\n\tdp[i]=max(dp[i-2]+dp[i],dp[i-1])\r\nans=0\r\nfor i in range(1,mx+1):\r\n\tans=max(ans,dp[i])\r\nprint(ans)\r\n", "n = int(input())\r\na = map(int,input().split())\r\ndp = [0]*100001\r\nfor i in a:\r\n dp[i] += i\r\nx = y = 0\r\nfor j in dp:\r\n x,y = max(x,j+y),x\r\nprint(x)", "A=[0]*100001;a=b=0\r\nfor i in map(int,[*open(0)][1].split()):A[i]+=i\r\nfor i in A:a,b=max(a,b+i),a\r\nprint(a)", "n=int(input())\r\ndic,di={},{}\r\nz=[int(x) for x in input().split()]\r\nfor a in z:\r\n if a not in dic:\r\n dic[a]=0\r\n dic[a]+=1\r\nist=[-2,-1,0]+list(dic.keys())\r\nist.sort(reverse=False)\r\ndi[-2],di[-1],di[0]=0,0,0\r\nfor b in range(3,len(ist)):\r\n if ist[b]-ist[b-1]!=1:\r\n di[ist[b]]=max(di[ist[b-1]],di[ist[b-2]])+dic[ist[b]]*ist[b]\r\n else:\r\n di[ist[b]]=max(di[ist[b-2]],di[ist[b-3]])+dic[ist[b]]*ist[b]\r\nprint(max(list(di.values())))", "# bordom\r\n\r\nn = int(input())\r\ns = [int(x) for x in input().split()]\r\n\r\nvalue_dict = dict()\r\nfor i in s:\r\n if i in value_dict:\r\n value_dict[i] += i\r\n else:\r\n value_dict[i] = i\r\n\r\nmax_idx = max(value_dict.keys())\r\nvalues = [0] * (max_idx + 1)\r\nfor k, v in value_dict.items():\r\n values[k] = v\r\n\r\nmax_value = [0]\r\nfor k in range(1, max_idx + 1):\r\n if k == 1:\r\n max_value.append(values[1])\r\n elif k == 2:\r\n max_value.append(max(values[1], values[2]))\r\n else:\r\n max_value.append(max(max_value[k-2] + values[k], max_value[k-1]))\r\n\r\nprint(max_value[-1])", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = [0] * (1 + max(a))\r\nfor v in a:\r\n c[v] += v\r\nm = len(c)\r\nt = [0] * m\r\nl = [0] * m\r\nfor i, v in enumerate(c):\r\n t[i] = v + l[i - 1]\r\n l[i] = max(l[i - 1], t[i - 1])\r\nprint(max(l[m - 1], t[m - 1]))\r\n\r\n", "n = int(input())\r\nelt = list(map(int, input().split(\" \")))\r\nm = max(elt)\r\nocc = [0 for _ in range(m+1)]\r\n\r\nfor i in elt : \r\n occ[i]+=1 \r\n\r\ndef sol(n, occ) : \r\n tab = [0 for i in range(n+1)]\r\n\r\n for i in range(n+1) : \r\n tab[i] = max(occ[i]*i + tab[i-2], tab[i-1])\r\n \r\n return tab[-1]\r\n\r\nprint(sol(m, occ))", "import sys\r\n\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n d = Counter(a)\r\n dp = [0] * (100001)\r\n for i in range(1, 100001):\r\n take = d[i] * i\r\n if i > 2:\r\n take += max(dp[i - 2], dp[i - 3])\r\n elif i > 1:\r\n take += dp[i - 2]\r\n not_take = dp[i - 1]\r\n if i > 1:\r\n not_take = max(dp[i - 1], dp[i - 2])\r\n dp[i] = max(take, not_take)\r\n print(max(dp))\r\n return\r\n\r\n\r\ndef main():\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndp = [0]*(max(arr) + 1)\r\ncnt = [0]*(max(arr) + 1)\r\nfor each in arr:\r\n cnt[each] += 1\r\ndp[0] = 0\r\ndp[1] = cnt[1]\r\nfor i in range(2, max(arr)+1):\r\n dp[i] = max(dp[i-1], dp[i-2] + cnt[i]*i)\r\nprint(max(dp))", "n = int(input())\r\ns = [0]*100002\r\n\r\nfor i in map(int, input().split()):\r\n s[i] += i\r\n\r\nfor i in range(2, len(s)):\r\n s[i] = max(s[i-1], s[i] + s[i-2])\r\n\r\nprint(s[len(s)-1])\r\n\t \t\t \t \t \t\t \t\t \t \t \t \t\t \t", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\nl=[]\r\nfor i in range(0,max(a)+1):\r\n l+=[0]\r\nfor i in a:\r\n l[i]+=i\r\nans=[]\r\nif(len(l)==1):\r\n print(l[0])\r\nelif(len(l)==2):\r\n print(max(l))\r\nelif(len(l)==3):\r\n print(max(l[1],l[0]+l[2]))\r\n\r\nelse:\r\n for i in range(3,len(l)):\r\n l[i]=l[i]+max(l[i-2],l[i-3])\r\n print(max(l[max(a)],l[max(a)-1]))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "def max_points(n, sequence):\r\n max_value = max(sequence)\r\n freq = [0] * (max_value + 1)\r\n for num in sequence:\r\n freq[num] += num\r\n dp = [0] * (max_value + 1)\r\n dp[1] = freq[1]\r\n for i in range(2,max_value + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + freq[i])\r\n return dp[max_value]\r\nn = int(input())\r\nsequence = list(map(int,input().split()))\r\nresult = max_points(n,sequence)\r\nprint(result)", "n = input()\ndp = [0 for i in range(100001)]\narr = [int(float(i)) for i in input().split()]\nfor i in arr:\n dp[i]+=i\nfor i in range(3,100001):\n dp[i] += max(dp[i-2], dp[i-3])\nprint(max(dp[-2],dp[-1]))", "n = int(input())\r\ns = input().split()\r\nnums = [int(e) for e in s]\r\nvals = [0 for i in range(10**5+1)]\r\nfor el in nums:\r\n vals[el]+= el\r\n\r\nmaxval=[0,vals[1],max(vals[1],vals[2])]\r\n#print(maxval)\r\n\r\nfor i in range(3,10**5+1):\r\n maxval.append(max(maxval[i-1], maxval[i-2]+vals[i]))\r\nprint(maxval[10**5])\r\n", "import sys, math, itertools, functools, collections\r\ninput = sys.stdin.readline\r\n#sys.setrecursionlimit(10**6)\r\n\r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\npa = lambda x: print (\" \".join(map(str, x)))\r\n\r\ntest_case = 1\r\n\r\ndef solve():\r\n freq = [0] * (10**5 + 1)\r\n for num in A:\r\n freq[num] += num\r\n \r\n #print(freq)\r\n skip = 0\r\n take = 0\r\n #[0,2,10,6]\r\n for i in range(1, 10**5 + 1):\r\n take, skip = max(take, skip + freq[i]), take\r\n #print(i, take, skip)\r\n \r\n \r\n return max(skip, take)\r\n\r\n\r\n\r\n pass\r\n\r\nfor _ in range(test_case):\r\n n = ri() \r\n A = ra()\r\n print(solve())", "n = int(input())\r\nnums = [int(num) for num in input().split()]\r\ncount = [0]*100001\r\nprev = 0\r\nprevprev = 0\r\ncur = 0\r\nfor num in nums:\r\n count[num] += 1\r\nfor i in range(1,len(count)):\r\n temp = prev\r\n if count[i] == 0:\r\n continue\r\n elif count[i-1] > 0:\r\n prev = max(count[i]*i + prevprev,prev)\r\n else:\r\n prev = max(count[i]*i + prev,prev)\r\n prevprev = temp\r\nprint(prev)", "from collections import Counter,defaultdict\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\ncou = Counter(arr)\r\nss = sorted(list(set(arr)))\r\ndic = defaultdict(int)\r\nfor cur in range(max(ss)+1):\r\n dic[(cur,1)] = max(dic[(cur-1,0)],dic[(cur-2,0)],dic[(cur-2,1)]) + cur*cou[cur]\r\n dic[(cur,0)] = max(dic[(cur-1,0)],dic[(cur-1,1)])\r\nprint(max(dic.values()))", "from collections import Counter, defaultdict\nimport random\nn = int(input())\n# n = 10**5\narr = list(map(int, input().split(' ')))\n# arr = [random.randrange(1, 10**5) for _ in range(n)] \n\ncnt = Counter(arr)\n# vals = sorted([x for x in cnt], key=lambda x: -x)\nvals = sorted([x for x in cnt])\nm = len(vals)\ndp = defaultdict(int)\nfor i in range(m):\n freq = cnt[vals[i]]\n dp[i] = dp[i-1]\n if cnt[vals[i]-1]:\n dp[i] = max(dp[i], dp[i-2] + vals[i] * freq)\n else:\n dp[i] = max(dp[i], dp[i-1] + vals[i] * freq)\n\ndef solve_fn(i):\n if i >= m: return 0\n\n if dp[i] != -1: return dp[i]\n\n res = 0\n freq = cnt[vals[i]]\n # takes a_k\n if cnt[vals[i]-1]: res = max(res, vals[i]*freq + solve_fn(i+2))\n else: res = max(res, vals[i]*freq + solve_fn(i+1))\n # skip a_k\n res = max(res, solve_fn(i+1))\n\n dp[i] = res\n\n return res \n\n# ans = solve_fn(0)\nans = dp[m-1]\nprint(ans)", "def max_score(n, a):\r\n dp = [0] * 100001\r\n for i in range(n):\r\n dp[a[i]] += a[i]\r\n for i in range(2, 100001):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + dp[i])\r\n return max(dp)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(max_score(n, a))\r\n", "from sys import stdin,stdout \r\n\r\nn = int(stdin.readline())\r\nseq = list(map(int,stdin.readline().split()))\r\n\r\n\r\n\r\nM = max(seq)\r\ncount = (M+1)*[0]\r\nfor i in seq:\r\n count[i] +=1\r\n\r\nbest = (M+1)*[0] #best you can do if you only selct numbers as big as i\r\nbest[1] = count[1]\r\n\r\nfor i in range(2,M+1):\r\n best[i] = max(i*count[i] + best[i-2],best[i-1]) #either take the biggest available, or don't\r\n\r\nprint(best[M])\r\n\r\n\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\nN = int(input())\nA = sorted(list(map(int,input().split())))\n\ndef find(A):\n C = Counter(A)\n A = sorted(set(A))\n N = len(C)\n dp = [0]*N\n for i in range(N):\n dp[i] = C[A[i]]*A[i]\n if i>=2:\n dp[i] = C[A[i]]*A[i]+dp[i-2]\n if i>=3:\n dp[i] = max(C[A[i]]*A[i]+dp[i-3],dp[i])\n return max(dp)\n\nl = [A[0]]\nans = 0 \nfor i in range(1,N):\n if abs(A[i]-l[-1])<=1:\n l.append(A[i])\n else:\n ans+=(find(l))\n l = [A[i]]\nans+=(find(l))\n\nprint(ans)", "task =[0]*100005\r\nfrequ =[0]*100005\r\ndp =[0]*100005\r\nn = int(input())\r\ntask = [int(x) for x in input().split()[:n]]\r\nmaxx = 0\r\nfor i in range(n):\r\n maxx = max(maxx,task[i])\r\n frequ[task[i]]= frequ[task[i]]+task[i]\r\n\r\ndp[0] =0\r\ndp[1] =frequ[1] \r\nfor i in range(2,maxx+5):\r\n dp[i] = max(dp[i -1],dp[i-2]+frequ[i])\r\n\r\nprint(dp[maxx+3]) ", "\r\nfrom collections import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\narr=[0]*100001\r\nfor i in l:\r\n arr[i]+=1\r\nfor i in range(2,100001):\r\n arr[i]=max(arr[i-1],arr[i-2]+arr[i]*i)\r\nprint(arr[-1])\r\n \r\n \r\n \r\n \r\n \r\n\r\n", "# Read the length of the sequence\r\nn = int(input())\r\n\r\n# Read the sequence as a list of integers\r\nsequence = list(map(int, input().split()))\r\n\r\n# Count the occurrences of each element in the sequence\r\ncount = [0] * 100001\r\nfor num in sequence:\r\n count[num] += 1\r\n\r\n# Calculate the maximum number of points\r\ndp = [0] * 100001\r\ndp[1] = count[1] * 1\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + count[i] * i)\r\n\r\n# Print the maximum number of points\r\nprint(dp[100000])\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmax_s = max(s)\r\nd = {}\r\nfor el in s:\r\n d.setdefault(el, 0)\r\n d[el] += 1\r\ndp = [0 for _ in range(max_s + 1)]\r\nd.setdefault(1, 0)\r\ndp[0] = 0\r\ndp[1] = d[1]\r\nfor i in range(2, max_s + 1):\r\n d.setdefault(i, 0)\r\n dp[i] = max(dp[i - 1], dp[i - 2] + d[i] * i)\r\n\r\nprint(dp[-1])", "n=int(input())\r\na,c=[0]*100001,[0]*100001\r\nb=list(map(int,input().split()))\r\nfor item in b:\r\n a[item]+=1\r\ns,ma,c[1]=0,max(b),a[1]\r\nfor i in range(2,ma+1):\r\n c[i]=max(c[i-1],c[i-2]+a[i]*i)\r\nprint(c[ma])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * (10**5+1)\r\nfor i in range(n):\r\n count[a[i]] += a[i]\r\n\r\ndp = [0] * (10**5+1)\r\ndp[1] = count[1]\r\nfor i in range(2, 10**5+1):\r\n dp[i] = max(dp[i-1], dp[i-2]+count[i])\r\n\r\nprint(dp[10**5])\r\n", "n=int(input())\r\na=list(int(i) for i in (input().split()))\r\nd={}\r\nc={}\r\nd[0]=0;d[1]=a.count(1)\r\nc[0]=0;c[1]=a.count(1)\r\nfor i in a:\r\n if i in c:\r\n c[i]+=1\r\n else:\r\n c[i]=1\r\nfor i in range(2,max(a)+1):\r\n if i not in c:\r\n c[i]=0\r\n d[i]=max(d[i-1],d[i-2]+c[i]*i)\r\nprint(d[max(a)])", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n# @Time : 2022/11/27 20:38\r\n# @Author : 雷炜豪\r\n# @Site : \r\n# @File : 1.py\r\n# @Software: PyCharm\r\n\r\n\r\n# import sys\r\n# sys.stdin = open('in.txt', 'r')\r\n# #sys.stdout = open('out.txt', 'w')\r\n# input = sys.stdin.readline\r\n\r\n\r\n\r\n\r\nn = int(input())\r\naList=list(map(int,input().split()))\r\n\r\n# 计数字典统计出现的每个数的次数\r\nsumDic = [0] * 100005\r\n# 统计出现的每个数的次数\r\nfor elem in aList:\r\n sumDic[elem] = sumDic[elem] + 1;\r\n\r\n\r\n# 动态规划数组，dp[0]舍去，从1开始切合题目\r\ndp = [0] * 100005\r\n\r\n# 初始值\r\ndp[1] = sumDic[1]\r\n\r\n# 计算2-10000的时候\r\nfor i in range(2,100001):\r\n # i和i+1不一样则数目和上一次是一样的 没有增加。\r\n dp[i] = max(dp[i - 1], dp[i - 2] + sumDic[i] * i)\r\n\r\nprint(dp[100000])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 16 17:50:35 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn=int(input())\r\narr=[0]*100001\r\nfor num in map(int, input().split()):\r\n arr[num]+=num\r\ndp=[0]*100001\r\nfor i in range(1,100001):\r\n dp[i]=max(dp[i-1],dp[i-2]+arr[i])\r\nprint(max(dp))", "input()\r\nl = [int(n) for n in input().split()]\r\n\r\ndef solve(l):\r\n\t\r\n\tdupL = [0 for _ in range((10**5)+1)]\r\n\tfor val in l:\r\n\t\tdupL[val] += 1\r\n\tres1 = dupL[-1] * (len(dupL)-1)\r\n\tres2 = max(res1, dupL[-2]*(len(dupL)-2))\r\n\tfor i in reversed(range(1,len(dupL)-2)):\r\n\t\tx = res2\r\n\t\tres2 = max(dupL[i] * i + res1, res2)\r\n\t\tres1 = x\r\n\tprint(res2)\r\nsolve(l)\r\n", "length = input()\r\nnumlist = input().split()\r\nscore_value_dict = {}\r\nfor element in numlist:\r\n new_element = int(element)\r\n if new_element in score_value_dict:\r\n score_value_dict[new_element] = score_value_dict[new_element] + new_element\r\n else:\r\n score_value_dict[new_element] = new_element\r\n\r\nanswer_list = [0, 0]\r\nprev_key = -10\r\ncurrent_index = 2\r\nfor key, value in sorted(score_value_dict.items()):\r\n # If prev key is key - 1, add max(answer_list[current_index - 2])\r\n if key < 0:\r\n continue\r\n elif prev_key == key -1:\r\n best_value = max(answer_list[current_index - 2] + value, answer_list[current_index - 1])\r\n else:\r\n best_value = answer_list[current_index - 1] + value\r\n\r\n answer_list.append(best_value)\r\n # Add our value to the next index in answer list\r\n\r\n \r\n prev_key = key\r\n current_index += 1\r\n\r\nprint(answer_list[-1])\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nt = [0] * (max(s) + 1)\r\nfor num in s:\r\n t[num] += num\r\ndp = [0] * (max(s) + 1)\r\ndp[1] = t[1]\r\nfor i in range(2, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2] + t[i])\r\nprint(dp[-1])", "def main() -> None :\r\n array:list[int] = []\r\n #region userInputs() -> list[int]\r\n input()\r\n array = list(map(int, input().split()))\r\n #endregion\r\n\r\n numberCounts:list[int] = []\r\n #region numberCounts(array: list[int]) -> list[int]\r\n numberCounts = [0] * (max(array) + 1)\r\n for num in array :\r\n numberCounts[num] += 1\r\n #endregion\r\n \r\n dp:list[int] = []\r\n #region dp(numberCounts: list[int]) -> list[int]\r\n dp = [0] * len(numberCounts)\r\n dp[1] = numberCounts[1]\r\n \r\n for dp_index in range(2, len(dp)) :\r\n dp[dp_index] = max(dp[dp_index-1], dp[dp_index-2] + numberCounts[dp_index]*dp_index)\r\n #endregion\r\n\r\n print(dp[-1])\r\n\r\nmain()", "n = int(input())\r\nl = list(map(int,input().split()))\r\ndp = [0] * 10**6\r\n# x= 0\r\nfor i in l:\r\n dp[i] +=1\r\nfor i in range(2, 10**6):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + dp[i]*i)\r\nprint(dp[10**6 - 1])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nl = [0]*(10**5+2)\r\nfor i in a:\r\n l[i]+=1\r\ndp = [0] * (10**5+2)\r\ndp[1] = l[1]\r\nfor i in range(2,len(l)):\r\n dp[i] = max(dp[i-2]+i*l[i],dp[i-1])\r\nprint(dp[-1])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * (max(a) + 1)\r\n\r\nfor i in a:\r\n count[i] += 1\r\n\r\ndp = [0] * (max(a) + 1)\r\n\r\nfor i in range(1, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2] + i*count[i])\r\n\r\nprint(dp[-1])\r\n", "from collections import Counter\r\nfrom functools import cache\r\nimport sys\r\n \r\ninput = lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef I(): return input()\r\ndef II(): return int(input())\r\ndef MII(): return map(int, input().split())\r\ndef LI(): return list(input().split())\r\ndef LII(): return list(map(int, input().split()))\r\n \r\ninf = float(\"inf\")\r\nmod = 10**9 + 7\r\n# for _ in range(II()):\r\nn = II()\r\na = LII()\r\nmx = max(a)\r\ncnt = Counter(a)\r\nf = [0] * (mx + 1)\r\nf[1] = cnt[1]\r\nfor i in range(2, mx+1):\r\n f[i] = max(f[i-1], f[i-2] + cnt[i] * i)\r\nprint(f[-1])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Count the frequency of each number\r\nfreq = [0] * (max(a) + 1)\r\nfor x in a:\r\n freq[x] += 1\r\n\r\n# Calculate the maximum score using dynamic programming\r\ndp = [0] * (max(a) + 1)\r\ndp[1] = freq[1]\r\nfor i in range(2, max(a) + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * freq[i])\r\n\r\n# Output the maximum score\r\nprint(dp[max(a)])\r\n", "import math\r\nimport sys\r\nimport collections\r\nimport random\r\ninput = sys.stdin.readline\r\ndef qe():\r\n return int(input())\r\ndef tr():\r\n return [int(_) for _ in input().split()]\r\ndef rt():\r\n return input()\r\nn = qe()\r\na = tr()\r\nb = []\r\nd = {}\r\nfor i in range(n):\r\n if a[i] in d:\r\n d[a[i]] += 1\r\n else:\r\n d[a[i]] = 1\r\n b.append(a[i])\r\nb = sorted(b)\r\nb = b[::-1]\r\ndp = [0 for i in range(len(b))]\r\nif len(dp) == 1:\r\n print(b[0] * d[b[0]])\r\nelse:\r\n dp[0] = b[0] * d[b[0]]\r\n if b[0] - 1 == b[1]:\r\n dp[1] = max(b[1] * d[b[1]], dp[0])\r\n else:\r\n dp[1] = dp[0] + b[1] * d[b[1]]\r\n p = b[1]\r\n for i in range(2, len(b)):\r\n if p - 1 == b[i]:\r\n dp[i] = max(b[i] * d[b[i]] + dp[i-2], dp[i-1])\r\n else:\r\n dp[i] = dp[i-1] + b[i] * d[b[i]]\r\n p = b[i]\r\n print(dp[-1])", "n=int(input()); dic={}\r\nfor a in input().split():\r\n if int(a) not in dic.keys(): dic[int(a)]=1\r\n else: dic[int(a)]+=1\r\nq=max(a for a in dic.keys())\r\ndp=[0]*(q+1)\r\nfor j in range(1,q+1):\r\n if j in dic.keys():\r\n dp[j]=max(dp[j-1],dp[j-2]+j*dic[j])\r\n else:\r\n dp[j]=max(dp[j-1],dp[j-2])\r\nprint(dp[-1])", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nmaximum = max(a)\r\nfrequency = [0] * (maximum + 1)\r\nfor x in a :\r\n frequency[x] += 1\r\n\r\ndp = [[0, 0] for _ in range(maximum + 2)]\r\nfor i in range(maximum + 1) :\r\n dp[i + 1][0] = dp[i][1] + i * frequency[i]\r\n dp[i + 1][1] = max(dp[i])\r\n\r\nprint(max(dp[-1]))\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nvals=[0]*(10**5+1)\r\nma=0\r\nfor i in arr:\r\n vals[i]+=i\r\n if i>ma:\r\n ma=i\r\ntry1=0\r\ntry2=0\r\nfor i in range(ma+1):\r\n buf=try1\r\n try1=max(try1,try2+vals[i])\r\n try2=buf\r\nprint(try1)", "n = input()\r\nd = [0] * 100001\r\nfor i in map(int,input().split()):\r\n d[i] += i\r\na = b = 0\r\nfor i in d:\r\n a,b = max(a,i+b),a\r\nprint(a)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncnt = [0 for _ in range(10**5 + 2)]\r\ndp = [0 for _ in range(10**5 + 2)]\r\n\r\nfor num in arr:\r\n cnt[num] += 1\r\n\r\ndp[1] = cnt[1]\r\nfor i in range(2, 10**5 + 2):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + cnt[i] * i)\r\n\r\nprint(dp[-1])", "# https://codeforces.com/contest/455/problem/A\r\n\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\n# a = list(map(int, input().split()))\r\nitems = sorted(Counter(map(int, input().split())).items())\r\ndp = [0, 0]\r\n# dp[0] : points max sans avoir pris l'item précédent\r\n# dp[1] : points max en ayant pris l'item précédent\r\n\r\nfor k in range(len(items)):\r\n if k > 0 and items[k][0] == items[k - 1][0] + 1:\r\n dp[0], dp[1] = max(dp), dp[0]\r\n else:\r\n dp[0] = dp[1] = max(dp)\r\n dp[1] += items[k][0] * items[k][1]\r\n\r\nprint(max(dp))\r\n", "input()\r\nA=[0]*100001\r\nfor x in map(int,input().split()):\r\n A[x]+=x\r\na=b=0\r\nfor i in A:\r\n a,b=max(a,b+i),a\r\nprint(a)", "import sys\r\nfrom math import *\r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=10**9+7\r\ndef get_ints():return map(int,input().split())\r\ndef get_int():return int(input())\r\ndef get_array():return list(map(int,input().split()))\r\ndef input():return sys.stdin.readline().strip()\r\n\r\n# for _ in range(int(input())):\r\nn=get_int()\r\na=get_array()\r\nd=Counter(a)\r\n# print(d)\r\ns=[0]*(max(a)+1)\r\nfor i in range(len(s)):\r\n s[i]=max(s[i-2]+d[i]*i,s[i-1])\r\nprint(s[-1])\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax_ele = max(arr)\r\ndp = [0] * (max_ele+1)\r\ncounter = [0] * (max_ele+1)\r\nfor a in arr:\r\n counter[a] += 1\r\ndp[1] = counter[1]\r\nfor i in range(2, max_ele+1):\r\n dp[i] = max(dp[i-1], dp[i-2]+counter[i]*i)\r\nprint(max(dp))", "n = int(input())\r\na_lst = list(map(int,input().split()))\r\n# 获取相应数据\r\n\r\ncount = {}\r\nfor num in a_lst:\r\n if num in count:\r\n count[num] += 1\r\n else:\r\n count[num] = 1\r\n# 使用字典存储相应的数字出现次数\r\n\r\nx,y = min(count),max(count)\r\ndp = [0]*(y+1)\r\nfor k in range(x,y+1):\r\n if k in count:\r\n dp[k] = max(dp[k-1],dp[k-2] + k*count[k])\r\n else:\r\n dp[k] = dp[k-1]\r\n# 对于数值进行计算\r\n\r\nprint(dp[-1])", "from collections import defaultdict\r\ndp = [0]*(10**5+1)\r\nfreq = defaultdict(int)\r\nn = int(input())\r\narr = [int(num) for num in input().split(' ')]\r\nfor num in arr:\r\n freq[num]+=1\r\ndp[1] = freq[1]\r\nfor i in range(2, 10**5+1):\r\n dp[i] = max(dp[i-1], dp[i-2]+(freq[i]*i))\r\nprint(dp[-1])", "n=int(input())\r\nst=[int(x) for x in input().split()]\r\ns=[0]*(max(st)+1)\r\nfor i in st:\r\n s[i]+=i\r\na,b=0,0\r\nfor i in s:\r\n a,b=max(a,b+i),a\r\nprint(a)", "from bisect import *\r\nn=int(input())\r\na=[0]+list(map(int,input().split()))\r\npoint=0\r\na.sort()\r\ndp=[0]*(n+1)\r\ndp[1]=a[1]\r\nfor i in range(2,n+1):\r\n dp[i]=max(dp[i-1],a[i]*(bisect_right(a,a[i])-bisect_left(a,a[i]))+dp[bisect_left(a,a[i]-1)-1])\r\nprint(dp[n])\r\n", "# https://codeforces.com/contest/455/problem/A\n\nN = 10**5\nn = int(input())\n\na = [0]*(N+1)\nfor x in map(int, input().split()):\n a[x] += 1\n\ndp = [0, a[1]] \nfor i in range(2, N+1):\n dp.append(max(dp[i-1], dp[i-2] + a[i]*i))\n\nprint(dp[N])\n", "input(); y=[0]*100001\r\nfor j in map(int,input().split()):y[j]+=j\r\nc=0;d=0\r\nfor j in y:c,d=max(c,j+d),c\r\nprint(c)", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Calculate the maximum element in the sequence\r\nmax_element = max(sequence)\r\n\r\n# Initialize a list to store the frequency of each element in the sequence\r\nfreq = [0] * (max_element + 1)\r\nfor num in sequence:\r\n freq[num] += 1\r\n\r\n# Initialize dynamic programming table to store the maximum points for each element\r\ndp = [0] * (max_element + 1)\r\ndp[1] = freq[1] * 1\r\n\r\n# Calculate the maximum points using dynamic programming\r\nfor i in range(2, max_element + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * freq[i])\r\n\r\n# The maximum points that Alex can earn is the value in dp[max_element]\r\nprint(dp[max_element])\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfreq=[0 for i in range(1000001)]\r\nfor i in a:\r\n freq[i]+=1\r\n\r\ndp=[0 for i in range(1000001)]\r\ndp[1]=freq[1]\r\nfor i in range(2,1000001):\r\n dp[i]=max(dp[i-2]+freq[i]*i,dp[i-1])\r\nprint(dp[1000000])\r\n ", "from math import inf\n\ndef solve(n, arr):\n dp = [-inf for _ in range(max(arr) + 1)]\n freq = [0 for _ in range(max(arr) + 1)]\n for i in range(len(arr)):\n freq[arr[i]] += 1\n \n dp[0] = 0\n dp[1] = freq[1]\n for i in range(2, max(arr) + 1):\n dp[i] = max(freq[i] * i + dp[i - 2], dp[i - 1])\n \n return dp[max(arr)]\n\nn = int(input())\narr = list(map(int, input().split()))\nprint(solve(n, arr))\n\n\n\n\n", "from typing import Counter\r\n\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\ndp=[0]*(100000+1)\r\nc=Counter(lst)\r\nprev=0\r\nfor i in range(max(lst)+1):\r\n if i-2>=0:\r\n prev=max(prev,dp[i-2])\r\n dp[i]=i*c[i]+prev\r\nprint(max(dp))", "n=input()\r\na=list(map(int,input().split()))\r\nd=[0]*(max(a)+1)\r\np=[0]*(max(a)+1)\r\nfor i in a:\r\n d[i]+=1\r\np[1]=d[1]\r\nmp=p[0]\r\nfor i in range(2,len(d)):\r\n mp=max(mp,p[i-2])\r\n p[i]+=d[i]*i+mp\r\nprint(max(p))", "n = int(input())\r\nlis = [int(x) for x in input().split()]\r\nlis.sort()\r\ncou = [0]*100001\r\ndp = []\r\nfor x in lis:\r\n cou[x] += 1\r\ng = dg = 0\r\nfor i in range(1,100001):\r\n h = g\r\n g = dg + cou[i]*i\r\n dg = max(dg,h)\r\nprint(max(dg,g))", "n = int(input())\na = list(map(int, input().split()))\nMAX = int(1e5+5)\ndp = [0]*MAX\nsm = [0]*MAX\nfor i in range(len(a)):\n sm[a[i]] += a[i]\ndp[0] = 0\ndp[1] = sm[1]\nfor i in range(2, MAX):\n dp[i]=max(dp[i-1], dp[i-2]+sm[i])\n\nprint(dp[MAX-1])", "import sys; input = sys.stdin.readline\r\nu = int(input())\r\na = list(map(int, input().split()))\r\nc = [0] * 100001\r\nfor i in range(u):\r\n c[a[i]] += 1\r\nd = [0] * 100001\r\nd[1] = c[1]\r\nfor i in range(2, 100001):\r\n d[i] = max(d[i - 2] + c[i] * i, d[i - 1])\r\nprint(d[100000])", "n = int(input())\r\nli = [int(x) for x in input().split()]\r\n\r\nm = max(li)\r\nlt = [0] + [0 for i in range(m)]\r\nfor i in li:\r\n lt[i] += 1\r\n\r\n# Start planning from the initial situation.\r\ndp = [0] * (m+1)\r\ndp[1] = lt[1]\r\n\r\nfor i in range(2, m + 1):\r\n dp[i] = max(dp[i-1], lt[i]*i + dp[i-2])\r\n \r\n#print(dp)\r\nprint(dp[-1])", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\nmax_value = max(sequence)\r\ndp = [0] * (max_value + 1)\r\n\r\nfor num in sequence:\r\n dp[num] += num\r\n\r\nfor i in range(2, max_value + 1):\r\n dp[i] = max(dp[i] + dp[i-2], dp[i-1])\r\n\r\nprint(max(dp))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfreq = [0] * 100005\r\nfor x in a:\r\n freq[x] += 1\r\n\r\ndp = [0] * 100005\r\ndp[1] = freq[1]\r\n\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i-1], dp[i-2] + freq[i] * i)\r\n\r\nprint(dp[100000])\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Count the frequency of each number\r\nfrequency = [0] * (max(numbers) + 1)\r\nfor num in numbers:\r\n frequency[num] += 1\r\n\r\n# Initialize dp array\r\ndp = [0] * (max(numbers) + 1)\r\ndp[1] = frequency[1] * 1\r\n\r\n# Calculate maximum points for each number using dynamic programming\r\nfor i in range(2, max(numbers) + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + frequency[i] * i)\r\n\r\n# Print the maximum points\r\nprint(dp[max(numbers)])\r\n", "# 计算最大积分的函数\r\ndef max_points(n, sequence):\r\n # 找到序列中的最大元素\r\n max_element = max(sequence)\r\n \r\n # 创建一个频率数组，用于存储每个元素的计数\r\n frequency = [0] * (max_element + 1)\r\n \r\n # 计算序列中每个元素的出现次数\r\n for num in sequence:\r\n frequency[num] += 1\r\n \r\n # 初始化两个变量，用于存储当前和前一个元素的最大积分\r\n prev_points = 0\r\n current_points = 0\r\n \r\n # 遍历序列中的每个元素\r\n for num in range(max_element + 1):\r\n # 计算当前元素的积分\r\n current_points = max(prev_points, frequency[num] * num + current_points)\r\n \r\n # 为下一次迭代更新prev_points\r\n prev_points, current_points = current_points, prev_points\r\n \r\n # 最终的答案是两个变量的最大值\r\n return max(prev_points, current_points)\r\n\r\n# 输入\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# 输出\r\nresult = max_points(n, sequence)\r\nprint(result)\r\n", "from collections import defaultdict\n\ndef deleteAndEarn( nums: list[int]) -> int:\n points = defaultdict(int)\n max_number = 0\n # Precompute how many points we gain from taking an element\n for num in nums:\n points[num] += num\n max_number = max(max_number, num)\n\n # Declare our array along with base cases\n max_points = [0] * (max_number + 1)\n max_points[1] = points[1]\n\n for num in range(2, len(max_points)):\n # Apply recurrence relation\n max_points[num] = max(max_points[num - 1], max_points[num - 2] + points[num])\n \n return max_points[max_number]\n\nt = int(input())\narr=[int(s) for s in input().split(' ')]\nans = deleteAndEarn(arr)\nprint(ans)\n", "import math\r\nimport bisect\r\n \r\n \r\ndef sol():\r\n n = int(input())\r\n ar = list(map(int,input().split()))\r\n a = [0] * 100001\r\n for i in ar:\r\n a[i] += 1\r\n \r\n dp = [0] * 100001\r\n dp[1] = a[1]\r\n for i in range(2, 100001):\r\n dp[i] = max(a[i] * i + dp[i-2], dp[i-1])\r\n print(dp[-1])\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\nsol()\r\n", "nums_size = int(input())\r\nnums = list(map(int,input().split(' ')))\r\nscore_dict = {}\r\nfor n in nums:\r\n score_dict.setdefault(n, 0)\r\n score_dict[n] += n\r\ndp = [0] * (max(nums) + 1)\r\ndp[1] = score_dict.get(1, 0)\r\nfor i in range(2, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2]+score_dict.get(i, 0))\r\nprint(dp[-1])", "n = int(input())\r\nd = {}\r\nfor i in input().split():\r\n if int(i) not in d:\r\n d[int(i)] = int(i)\r\n else:\r\n d[int(i)] += int(i)\r\nsorted_keys = sorted(d.keys())\r\nlst = [-1 for i in range(sorted_keys[-1]+1)]\r\nfor i in range(1, sorted_keys[-1]+1):\r\n if i not in d:\r\n lst[i] = 0\r\n else:\r\n lst[i] = d[i]\r\n\r\nif len(lst) <= 3:\r\n print(max(lst))\r\nelse:\r\n a, m, b = lst[2], lst[1], 0\r\n for i in range(len(lst))[3:]:\r\n b = lst[i] + m\r\n m = max(m, a)\r\n a = b\r\n print(max(a, m))\r\n\r\n", "x = int(input())\r\nn = list(map(int, input().split()))\r\nfreq = [0] * (max(n) + 1)\r\nfor a in n:\r\n freq[a] += 1\r\nm = [0] * (max(n) + 1)\r\nm[1] = freq[1]\r\nfor i in range(2, max(n) + 1):\r\n m[i]=max(m[i-1],m[i-2]+i*freq[i])\r\nprint(m[max(n)])", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nx=[0]*(max(s)+1)\r\nfor i in s:\r\n x[i]+=1\r\ndp=[0]*(max(s)+1)\r\ndp[1]=x[1]\r\nfor i in range(2,len(x)):\r\n dp[i]=max(dp[i-1],dp[i-2]+x[i]*i)\r\nprint(max(dp))", "n = int(input())\r\nd = {}\r\nnums = map(int, input().split())\r\nfor num in nums:\r\n d[num] = d.get(num, 0) + 1\r\nnums_modified = sorted(d.items(), key=lambda x: x[0])\r\ndp = [[0, 0] for _ in range(len(nums_modified))]\r\ndp[0][1] = nums_modified[0][0] * nums_modified[0][1]\r\nfor i in range(1, len(nums_modified)):\r\n dp[i][0] = max(dp[i - 1][0], dp[i - 1][1])\r\n dp[i][1] = nums_modified[i][0] * nums_modified[i][1]\r\n if nums_modified[i][0] == nums_modified[i - 1][0] + 1:\r\n dp[i][1] += dp[i - 1][0]\r\n else:\r\n dp[i][1] += max(dp[i - 1][0], dp[i - 1][1])\r\nprint(max(dp[-1][0], dp[-1][1]))", "import sys\r\nfrom collections import Counter\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\nd=Counter(a)\r\nb=[x for x in d]\r\nb.sort()\r\npt,pnt=d[b[0]]*b[0],0\r\nfor i in range(1,len(b)):\r\n if b[i]==b[i-1]+1:\r\n ct=(d[b[i]]*b[i])+pnt\r\n cnt=max(pt,pnt)\r\n else:\r\n ct=(d[b[i]]*b[i])+max(pt,pnt)\r\n cnt=max(pt,pnt)\r\n pt=ct\r\n pnt=cnt\r\n \r\nprint(max(pt,pnt))", "def main ():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n dp = [0] * (max(a) + 1)\r\n for i in a:\r\n dp[i] += i\r\n for i in range(2, len(dp)):\r\n dp[i] = max(dp[i - 2] + dp[i], dp[i - 1])\r\n print(dp[-1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import collections\r\n\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nret=[0]*(10**5+10)\r\nfor i in A:\r\n ret[i]+=1\r\ndp=[0]*(10**5+10)\r\nfor i in range(10**5,-1,-1):\r\n dp[i]=max(dp[i+1],dp[i+2]+ret[i]*i)\r\n# print(dp[:5])\r\nprint(dp[0])\r\n\r\n", "def solve(a,v):\r\n if len(a) == 1:\r\n return v[0]*a[0]\r\n dp = [0 for i in range(len(a))]\r\n dp[-1] = v[-1]*a[-1]\r\n dp[-2] = v[-2]*a[-2]\r\n for i in range(len(a)-3,-1,-1):\r\n dp[i] = dp[i+2]\r\n if i+3 < len(a):\r\n dp[i] = max(dp[i],dp[i+3])\r\n dp[i]+=v[i]*a[i]\r\n \r\n return max(dp)\r\n\r\nn = int(input())\r\nlst1 = list(map(int,input().split()))\r\nlst1 = list(sorted(lst1))\r\ndict1 = {}\r\nfor i in range(len(lst1)):\r\n if lst1[i] in dict1:\r\n dict1[lst1[i]]+=1\r\n else:\r\n dict1[lst1[i]] = 1\r\n\r\nlst2 = []\r\nval2 = []\r\nlst3 = []\r\nval3 = []\r\nfor i in dict1:\r\n if i-1 in dict1:\r\n lst3.append(i)\r\n val3.append(dict1[i])\r\n else:\r\n if lst3 != []:\r\n lst2.append(lst3)\r\n val2.append(val3)\r\n lst3 = [i]\r\n val3 = [dict1[i]]\r\n\r\nlst2.append(lst3)\r\nval2.append(val3)\r\n\r\n# print(lst2)\r\nans = 0\r\nfor i in range(len(lst2)):\r\n ans += solve(lst2[i],val2[i])\r\n\r\nprint(ans)", "input()\r\n\r\nnums = [int(i) for i in input().split()]\r\n\r\ndct = {}\r\n\r\nfor n in nums:\r\n if n in dct:\r\n dct[n] += 1\r\n else:\r\n dct[n] = 1\r\n\r\nnums = sorted(dct.items())\r\n\r\ncache = {}\r\ncache[-1] = 0\r\nfor n in range(len(nums)):\r\n if n == 0:\r\n cache[n] = nums[n][0] * nums[n][1]\r\n else:\r\n leave = cache[n - 1]\r\n take = nums[n][0] * nums[n][1]\r\n if nums[n][0] - 1 == nums[n - 1][0]:\r\n take += cache[n - 2]\r\n else:\r\n take += cache[n - 1]\r\n best = max(take, leave)\r\n cache[n] = best\r\n\r\nprint(cache[len(nums) - 1])\r\n", "input();z=[0]*7**6\nfor i in map(int,input().split()):z[i]+=i\na=b=0\nfor i in z:a,b=max(a,i+b),a\nprint(a)\n\t\t\t\t \t \t \t \t \t\t \t \t", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndp = [0]*(max(arr) + 1)\r\ncnt = [0]*(max(arr) + 1)\r\nfor each in arr: \r\n cnt[each] += 1\r\ndp[0] = 0\r\ndp[1] = cnt[1]\r\nfor i in range( 2, max(arr)+1 ): \r\n dp[i] = max( dp[i-1], dp[i-2] + cnt[i]*i )\r\nprint(max(dp))", "def max_points(n, sequence):\r\n max_num = max(sequence) # Maximum element in the sequence\r\n freq = [0] * (max_num + 1) # Frequency array for each possible number\r\n\r\n for num in sequence:\r\n freq[num] += 1\r\n\r\n prev = 0\r\n curr = 0\r\n\r\n for i in range(1, max_num + 1):\r\n new_curr = max(curr, i * freq[i] + prev)\r\n prev = curr\r\n curr = new_curr\r\n\r\n return curr\r\n\r\n# Read input\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum points\r\nprint(max_points(n, sequence))\r\n", "n = int(input())\r\nlst = [0] + list(map(int,input().split()))\r\n\r\nsum = [0]*7**6\r\ndp = [0]*7**6\r\n\r\nfor i in lst:\r\n sum[i] += i\r\n\r\ndp[1] = sum[1]\r\nfor i in range(2,len(dp)):\r\n dp[i] = max(dp[i-1],dp[i-2] + sum[i])\r\n\r\nprint(max(dp))", "# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡤⢶⣭⢯⣽⣯⣟⣿⣻⣟⡿⣯⣿⣭⣷⣣⢆⣄⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⡀⠀⡀⠄⠀⠀⠀⠀⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠐⠀⠈⢀⠠⠀⠀⠁⠀⠂⠀⠀⣠⢾⡽⣾⣟⣾⢿⣻⣾⣽⡾⣷⣻⣟⣷⢿⣞⣷⢿⣻⣮⣝⢦⡀⠀⠁⠠⠀⠄⠀⠂⢀⠂⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⡀⠀⢀⠀⠀⡀⠠⠀⠀\r\n# ⠀⠀⠀⠀⠀⠂⠀⠄⡀⢀⠂⡁⠐⠀⠠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢂⠀⠄⠡⠀⠂⠌⡀⢁⠐⠀⢡⢾⣽⣻⣟⣷⡿⣯⣿⣻⢮⢷⣿⣻⣽⡾⣯⣿⣻⡾⣟⣯⣟⣯⣷⢯⣲⠈⠄⠁⠀⠁⠂⠄⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠐⠈⠀⠀⠄⠐⠂⡀⠂⢀⠀⠄⠀\r\n# ⠀⠀⠀⠀⠂⠈⠀⢂⠀⠀⠀⠐⠈⢀⠡⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⡀⠈⠠⢁⠀⢀⠠⠐⠀⢈⡰⣯⡿⣯⣷⣿⢯⣟⡷⣯⣗⣯⣟⡾⣽⡎⣿⣳⣟⢳⣿⣻⣽⡾⣯⣟⣿⢳⣗⡠⠀⠄⡈⠀⠄⠐⠠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠂⠈⠀⢃⠀⠂⠀⠠⠁⠂⠠⠀⠀\r\n# ⠀⠀⠀⢁⠀⠂⠁⠤⢈⠐⠤⢁⠈⠀⢀⠠⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⢀⠀⡁⠆⠈⠄⢢⢁⠀⣲⣽⢻⣽⣷⣻⣯⣟⡾⣽⢳⡽⣞⡭⣟⡧⢁⢸⣷⣫⠄⠱⣟⡾⣽⣳⢿⡽⣏⣾⣗⣀⠤⢁⠄⠐⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡐⠀⠁⠈⢄⠢⠐⠨⢄⠁⠀⠄⠐⠀\r\n# ⠀⠀⠀⠀⠈⠀⠁⢀⠀⠠⠀⠂⠂⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠁⠠⠀⠂⢀⠂⠀⢸⣳⣯⢿⣳⣯⡿⣞⣽⢺⡵⣫⢞⡵⣻⠜⠁⠀⠀⢷⣏⡆⠀⠌⢟⡷⢯⣟⣿⢯⡷⣟⡆⡒⠤⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⠀⠀⠀⠀⡀⠀⠐⠈⠐⠂⠀⡀⠡⠌⠐⠂⠐⠈⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠂⢀⠠⠐⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠂⠀⠄⠂⠀⣯⣷⢿⣻⣽⣾⣟⡿⣜⣧⢻⡵⣫⠞⠁⠀⠀⠀⠀⠘⣾⡈⠁⠒⠈⢻⡽⢮⢿⣯⠟⡉⠳⣌⠣⡇⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⠐⠈⠀⠁⠂⢀⠀⠂⠁⠠⠀⠂⠀⠠⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢀⠀⢲⣽⡾⣟⣯⣷⣿⣟⢾⠳⠎⠓⠉⠀⠀⠀⠀⠀⠀⠀⠀⠘⡇⠀⠀⠀⠀⠻⣏⣿⣞⡇⣜⢣⢆⡧⡭⣍⠁⠀⠀⠀⠀⠀⠀⠄⠂⠐⡈⠄⠀⠀⢂⠐⡀⠊⠀⠀⠀⠁⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠄⠀⠄⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡁⠀⠠⢘⣷⣿⣻⣽⡾⡟⠀⢀⡴⠞⠒⠛⠢⠂⠀⠀⠀⠀⠀⠐⠖⠛⠓⠳⢦⠀⠀⢻⢾⡽⣶⣹⢎⡾⣻⡷⡼⡁⠀⠀⠀⠀⠀⠁⢀⠀⠂⡐⠠⢀⡐⡀⠂⠀⡀⢁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⡀⠈⠄⠠⠀⠀⠄⠠⠀⠀⠀⠀⠀⠀⡀⠀⢀⠁⠂⡼⣟⣾⢯⣷⢿⠁⠀⠎⠀⣴⣾⡿⣦⠈⠀⠀⠀⠀⠀⠀⣰⣽⡿⣦⠀⢣⠀⠀⢻⡿⣽⢧⣋⠶⣿⣻⢿⣝⢦⠀⠀⠀⠀⠁⠠⠀⠒⠈⠐⠀⠠⠑⠤⠀⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠌⠠⠀⠄⠁⠀⠡⠐⡀⢂⠀⠀⠀⠀⠀⠀⠀⠠⠐⡀⠈⠀⣿⣻⣽⣟⣯⣿⠀⠀⠀⠀⡷⠌⢳⡠⠀⠀⠀⠀⠀⠀⠀⢫⠜⢱⣉⠀⠀⠀⠀⣘⣿⢯⣷⣹⣺⢭⡿⣯⡿⣯⢧⣀⠀⠀⠀⠀⠀⠀⢁⠀⠐⢀⠁⠀⠀⠀⠀⠂⢀⠀⠄⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠄⠀⠄⠂⡐⠀⠄⡐⠀⢀⠀⠐⠀⠀⠀⠀⠀⠀⠀⠀⠀⠄⠹⣼⣟⣷⣯⢿⣾⠀⠀⢀⠀⠈⠁⠈⠀⠀⠀⠐⡀⠀⠀⠀⠀⢁⠉⠀⠀⠀⠀⡰⣸⢿⣯⣟⣷⢿⠀⠙⣿⣽⣯⢻⣖⡤⠀⠀⠀⠀⠀⠀⠀⠂⠀⠀⠀⠀⠀⠀⡐⠀⢀⠠⠐⠀⠂⠀⠁⠄\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠐⠀⠂⡐⠀⠁⠈⠰⠀⡀⠄⠂⠀⠀⠀⠀⠀⠀⠀⠀⠁⠀⡄⣿⢾⣻⡾⣟⣾⡐⠀⠀⠂⠁⠌⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠀⠄⠡⠈⠀⠠⠰⣸⣿⣳⡿⣯⡟⠀⠀⠘⣷⡿⣷⢿⣞⣆⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠄⠂⠐⢀⠂⠀⠀⠡⢀⠁⠂⠀\r\n# ⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠌⠀⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣟⣯⣿⣻⢷⠀⢁⠀⠐⠈⠀⠀⠀⢠⠒⡉⢉⠁⠒⠄⠀⠀⠀⠀⠀⢀⠃⠀⣿⡷⣿⣽⡷⡇⠀⠀⠀⠘⣿⣯⢿⣻⣞⣆⢂⠀⠀⠀⢀⠀⡀⠀⠀⠠⠀⠠⠀⢂⠐⠠⢀⠂⠀⠠⠐⠀\r\n# ⢀⠠⠐⠀⠠⠐⠀⡐⠀⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠰⠀⢹⣾⣟⣾⣟⡿⠀⠂⡄⠀⠀⠀⠀⠀⠘⠠⠐⠠⢈⠐⠄⠀⠀⠀⠀⠀⣼⡆⢰⣿⣻⣽⣾⣽⠁⠀⠀⠀⠀⠘⣿⣻⣽⣟⣾⣆⠠⠐⢀⠀⡀⠀⠐⡀⠀⠀⠀⠡⠀⠀⠄⠀⠂⠡⠀⠀⠀\r\n# ⠂⠠⢀⠁⡀⠁⠂⠄⡐⠀⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣷⣻⣷⣻⣽⠀⠀⣿⣦⡀⠀⠀⠀⠀⠑⠨⠐⠄⠊⠀⠀⠀⢀⣀⣿⣿⠀⢸⣷⢿⣽⣾⡓⠀⠀⠀⠀⠀⠀⠈⢿⣷⣻⣽⣾⣆⠩⠀⠂⢀⠐⠀⠀⠀⠀⠀⠀⠄⠂⠠⠐⠀⠀⠀⠀⠀\r\n# ⠀⡀⢁⠂⡀⠠⠈⠄⠀⠐⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⠀⠀⡀⠠⠐⠀⠠⠈⠀⡀⣿⣟⣾⣟⣾⠀⢠⣿⣿⣿⣶⣤⣀⠀⠀⠀⠀⠀⠀⢀⣠⣴⣾⣿⣿⣿⠀⣿⢾⣟⣷⢯⠃⠀⠆⠀⠀⠀⠀⠀⠈⢿⣯⣷⣟⣾⡄⢡⠀⠀⠀⠐⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⡀⠤⠈⠠⠐⢁⠣⢀⠂⢈⠠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠂⢀⠁⡐⠀⠁⠌⠠⢀⠁⠀⢸⣟⣾⣽⣾⣀⣾⢯⣿⣿⢿⡻⠛⡌⢐⠂⡐⠒⡈⠛⣿⣻⣿⣿⣽⣿⡄⣿⢯⣿⢾⡏⠀⠀⠀⠀⠀⠀⠀⠐⠀⡀⢿⣷⣻⣽⣿⡄⢣⠀⢁⠀⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠁⠀⢀⠀⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡀⠀⡀⠠⠈⠄⠀⢀⠠⠁⢀⠈⢠⡞⣯⡷⣟⣾⡜⣮⢽⡹⣞⣯⡇⠐⡈⠒⡴⣤⠃⡁⠂⢼⣳⢿⡝⣧⡝⣾⢯⡿⣯⢿⡀⠀⠸⠀⠈⠀⠄⠡⠀⠀⠀⠀⢻⣿⡷⣯⡿⡄⠂⠀⠀⠀⠀⠀⠀⡀⠀⡀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠂⠀⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⢀⢀⠐⡈⠐⠀⠂⢅⠂⡰⠀⣾⣹⢳⡿⣽⡞⡽⣎⢷⣫⡝⣮⢳⣓⢦⣁⡿⣽⣣⢴⢫⡳⣽⢫⣞⡵⣻⢼⡿⣽⣻⢧⣛⠀⡀⢁⠂⠁⠂⠀⠀⠀⠀⠀⠀⢻⣿⡿⣽⣷⡈⠄⠀⠀⠀⠀⠠⠀⠀⢀⠠⠀⢀⠀⠄⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠁⢀⠂⠀⠀⡄⣳⢧⡻⣽⣳⣏⢷⡹⣎⢷⡹⢧⡳⣭⢞⡮⣝⣳⠽⣮⠳⣝⡼⣳⢾⡱⣏⢾⣽⣳⢏⡾⣱⠠⢀⢂⠀⠐⠀⠁⠀⠀⠀⠀⠀⠈⢿⣿⣟⡾⣧⠐⠀⠀⠀⠠⠐⡀⢁⠀⠄⡀⠂⠀⡐⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠂⠈⠀⠀⠀⠀⢸⢧⣏⢷⣻⡼⣏⢾⡱⣏⢾⡹⣧⣛⡴⣫⢞⡷⢫⢷⣩⠟⣜⢾⢹⢧⢻⣜⣻⢾⡝⣮⢳⣝⠂⢁⠂⠂⠄⠠⠈⠀⠀⠀⠀⠀⠀⠘⣿⣿⡽⣯⣇⠠⠀⠐⠀⠀⠄⠂⠀⠀⠐⠀⠁⡀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠂⠀⠁⠐⡀⠂⢀⠐⠀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⡞⣷⢎⡷⣭⢿⣹⠂⠠⠋⢀⡽⣳⣜⡳⡝⠎⣇⠛⡮⢵⡝⣞⠣⠀⠁⡀⠸⣽⣻⡜⣧⣛⢮⡄⠠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢻⣿⣟⡷⢯⡄⢂⠀⠈⠐⠀⠈⠀⠄⡁⢀⠂⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠁⠄⡈⠐⠀⢀⠁⠂⠄⡠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠂⠁⢀⢸⡽⣹⢮⡳⣝⢾⡁⠀⠀⠀⠀⠜⢓⣮⢳⡅⠀⣌⡃⠈⢣⣟⡁⠡⠈⠀⠀⠀⣷⢻⡜⣧⢯⢷⣹⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣿⣽⣻⢦⠀⠂⠀⠈⠀⠁⠈⠀⠀⠁⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠐⠀⡀⠌⡐⢀⠀⠄⠡⠀⠀⠐⠀⠀⠀⠀⠀⠀⠀⠀⠀⠄⠐⢀⠂⣼⣧⢻⡵⣻⢵⣫⠾⣥⠀⠀⠀⠀⠀⡾⣜⡳⢶⠀⢆⡇⢠⢏⡾⠅⠀⠀⠀⠀⢰⣏⢷⡹⣞⢯⡞⣽⢿⣧⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣿⣷⢯⣻⠄⠀⢂⠀⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠐⠀⠄⡠⠐⠈⠄⠘⡈⠆⡀⢁⠠⠁⠀⠀⠀⠀⠀⠀⠄⠠⠐⠈⣀⡾⠏⣰⣏⢾⡱⣏⢾⣹⠶⡄⠀⠀⠀⠀⣟⣮⡝⣯⢣⣮⢆⣮⢻⡼⡀⠀⠀⠀⠀⡿⣜⢧⡻⣝⢮⡝⣶⠀⠻⣷⡀⠀⠀⠀⠀⠀⠀⠀⠄⠂⢀⠈⣿⣿⣯⣽⡃⠀⡀⠢⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\r\nfrom collections import Counter\r\n\r\n\r\nn = int(input())\r\nA = list(map(int,input().strip().split()))\r\n\r\n\r\nc = [0] * (int(1e5) + 1) \r\n\r\nfor i in A: c[i] += 1\r\nma = [0] * len(c)\r\nma[0] = 0\r\nma[1] = c[1]\r\n\r\nfor i in range(2, int(1e5)+1): ma[i] = max(ma[i-2] + c[i] * i, ma[i-1])\r\n\r\nprint(ma[int(1e5)])\r\n \r\n", "input()\r\nsum_list = [0] * 100001\r\n\r\nfor number in map(int, input().split()):\r\n sum_list[number] += number\r\n\r\ncurrent_max = previous_max = 0\r\n\r\nfor element in sum_list:\r\n current_max, previous_max = max(current_max, element + previous_max), current_max\r\n\r\nprint(current_max)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 14 20:11:44 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\nn=int(input())\r\nseq=list(map(int,input().split()))\r\nseq.sort()\r\nl=[]\r\nfor i in range(100001):\r\n l.append(0)\r\nfor i in seq:\r\n l[i]+=1\r\nbest=[0]\r\nbest.append(l[1])\r\nbest.append(max(l[1],2*l[2]))\r\nfor i in range(3,seq[-1]+1):\r\n a=best[i-2]+i*l[i]\r\n b=best[i-1]\r\n best.append(max(a,b))\r\nprint(best[-1])", "n = int(input())\r\nl = sorted([int(n) for n in input().split(\" \")])\r\n\r\ndp = []\r\ni = 0\r\nwhile i < n:\r\n count = 0\r\n curr = l[i]\r\n while l[i+count]==curr:\r\n count+=1\r\n if i+count>=len(l):\r\n break\r\n prev = len(dp)-1\r\n if l[i-1]==curr-1:\r\n prev-=1\r\n u = count*curr\r\n if prev >= 0:\r\n u+=dp[prev]\r\n lo = dp[-1] if dp else 0\r\n dp.append(max(u,lo))\r\n i += count\r\nprint(dp[-1])", "def max_points(n, sequence):\r\n max_num = max(sequence)\r\n \r\n # Count the frequency of each number in the sequence\r\n frequency = [0] * (max_num + 1)\r\n for num in sequence:\r\n frequency[num] += 1\r\n \r\n # Initialize two variables for dynamic programming\r\n dp = [0] * (max_num + 1)\r\n dp[1] = frequency[1] # If we choose 1, we get frequency[1] points\r\n \r\n # Calculate the maximum points using dynamic programming\r\n for i in range(2, max_num + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * frequency[i])\r\n \r\n return dp[max_num]\r\n\r\n# Input\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Calculate and print the result\r\nresult = max_points(n, sequence)\r\nprint(result)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nN = max(nums)\r\nl = [0]*(N+1)\r\nfor i in nums:\r\n l[i] += 1\r\ndp = [0, l[1]]\r\nfor i in range(2, N+1):\r\n dp.append(max(dp[i-1], dp[i-2]+l[i]*i))\r\nprint(dp[-1])\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nl=[0 for i in range(max(a)+2)]\r\nfor i in a:\r\n l[i+1]+=1\r\ndp=[0 for i in range(max(a)+2)]\r\nfor i in range(2,max(a)+2):\r\n dp[i]=max(dp[i-2]+(i-1)*l[i],dp[i-1])\r\nprint(dp[-1])", "\r\ninput()\r\nnums = {}\r\nfor num in sorted(int(i) for i in input().split()):\r\n nums[num] = nums.get(num, 0) + 1\r\n\r\ntwoBefore = 0\r\noneBefore = 0\r\nfor num, times in nums.items():\r\n if num-1 in nums:\r\n twoBefore, oneBefore = oneBefore, max(oneBefore, num*times + twoBefore)\r\n else:\r\n twoBefore = oneBefore\r\n oneBefore += num*times\r\nprint(oneBefore)", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = set(b)\r\narr = dict()\r\nfor i in range(max(c)+1):\r\n arr[i] = 0\r\nfor i in b:\r\n arr[i] += i\r\nans = [0,arr[1]]\r\nfor i in range(2,max(c)+1):\r\n ans.append(max(arr[i] + ans[i-2],ans[i-1]))\r\nprint(ans[max(c)])", "input()\r\nz = [0]*7**6\r\nfor i in map(int,input().split()):\r\n z[i] += i\r\na = 0\r\nb = 0\r\nfor i in z:\r\n a, b = max(a, i+b), a\r\nprint(a)", "dict={}\r\nn=int(input())\r\nli=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n if li[i] in dict:\r\n dict[li[i]]+=1\r\n else:\r\n dict[li[i]]=1\r\npre_op=[[i] for i in dict.keys()]\r\n\r\n\r\nfor i in range(len(dict)):\r\n pre_op[i].append(dict[pre_op[i][0]]*pre_op[i][0])\r\npre_op.sort()\r\n\r\n\r\nans=[0,pre_op[0][1]]\r\nfor i in range(1,len(dict)):\r\n if pre_op[i][0]-1==pre_op[i-1][0]:\r\n ans.append(max(ans[-1],pre_op[i][1]+ans[i-1]))\r\n else:\r\n ans.append(ans[-1]+pre_op[i][1])\r\n\r\nprint(max(ans))\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\np=max(m)\r\ncnt=[0]*(p+1)\r\ndp=[0]*(p+1)\r\nfor i in m:\r\n cnt[i]+=i\r\ndp[1]=cnt[1]\r\nfor i in range(2,p+1):\r\n dp[i]=max(dp[i-2]+cnt[i],dp[i-1])\r\nprint(max(dp[-3:]))", "def solve(elements):\n if not elements:\n return 0\n\n freq = {}\n for el in elements:\n e = int(el)\n if e in freq:\n freq[e] += 1\n else:\n freq[e] = 1\n\n values = sorted(list(freq.keys()))\n n = len(values)\n \n dp = [0]*n\n dp[0] = values[0]*freq[values[0]]\n\n for i in range(1,n):\n if values[i] == values[i-1] + 1:\n add = 0\n if i >= 2:\n add = dp[i-2]\n dp[i] = max(dp[i-1], values[i]*freq[values[i]] + add)\n else:\n dp[i] = values[i]*freq[values[i]] + dp[i-1]\n \n return dp[-1]\n\nn = int(input())\nelements = input()\nelements = elements.split()\nprint(solve(elements))\n \t\t\t \t \t\t\t\t\t\t\t \t \t \t \t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * 100001\r\nfor x in a:\r\n count[x] += x\r\n\r\ndp = [0] * 100001\r\ndp[1] = count[1]\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i-1], dp[i-2] + count[i])\r\n\r\nprint(dp[100000])\r\n", "def solve():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n\r\n dp = [0 for _ in range(100001)]\r\n\r\n for x in a:\r\n dp[x] += x\r\n\r\n for i in range(2, 100001):\r\n dp[i] = max(dp[i] + dp[i-2], dp[i-1])\r\n\r\n print(dp[-1])\r\n\r\n\r\nsolve()\r\n", "n = int(input())\r\nseq = list(map(int, input().split()))\r\n\r\n# 使用 dictionary 来计数每个数字出现的次数\r\ndic = {}\r\nfor s in seq:\r\n dic[s] = dic.get(s, 0) + 1\r\n\r\n# 创建一个列表用来存储每个数字的points\r\npoints = [0] * 100001\r\nfor k, v in dic.items(): # 对于dic中的每个key-value对\r\n points[k] = k * v\r\n\r\n# 应用动态规划逻辑\r\ndp = [0] * 100001\r\nfor i in range(1, 100001):\r\n dp[i] = max(dp[i-1], dp[i-2] + points[i])\r\n\r\nprint(dp[100000])", "# https://codeforces.com/contest/455/problem/A\n\nN = 10**5\nn = int(input())\n\na = [0]*(N+1)\nmx = 1\nmn = N\nfor x in map(int, input().split()):\n a[x] += 1\n mx = max(mx, x)\n mn = min(mn, x)\n\ndp = [0, a[1]] + [0]*(mx-1)\nfor i in range(mn, mx+1):\n dp[i] = max(dp[i-1], dp[i-2] + a[i]*i)\n\nprint(dp[mx])\n", "n = int(input())\na = list(map(int, input().split()))\n\ndp = [0] * 10**6\nfor v in a:\n dp[v] += 1\n\nfor i in range(2, len(dp)):\n dp[i] = max(dp[i - 1], dp[i - 2] + dp[i] * i)\n\nprint(dp[-1])\n", "n=int(input())\r\narr=[0]*(10**5+1)\r\nfor x in input().split():\r\n arr[int(x)]+=1\r\nfunc=[0]*(10**5+1)\r\nfunc[1]=arr[1]\r\nfor i in range(2,10**5+1):\r\n func[i]=max(func[i-1],func[i-2]+i*arr[i])\r\nprint(func[10**5])\r\n ", "from collections import defaultdict\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\n# Count occurrences of each number\r\ncounter = defaultdict(int)\r\nfor num in data:\r\n counter[num] += 1\r\n\r\n# Sort the unique numbers\r\nunique_numbers = sorted(counter.keys())\r\n\r\n# Dynamic programming array\r\ndp = [0] * (len(unique_numbers) + 1)\r\n\r\nfor i, num in enumerate(unique_numbers, start=1):\r\n # If not selecting the current number\r\n dp[i] = max(dp[i], dp[i-1])\r\n # If selecting the current number\r\n if i > 1 and unique_numbers[i-2] == num - 1:\r\n # If the previous unique number is adjacent to the current number\r\n dp[i] = max(dp[i], dp[i-2] + num*counter[num])\r\n else:\r\n dp[i] = max(dp[i], dp[i-1] + num*counter[num])\r\n\r\nprint(dp[-1])\r\n", "input()\r\nc = [0]*100001\r\nfor m in map(int, input().split()):\r\n c[m] += 1\r\ndp = [0]*100001\r\nfor i in range(1, 100001):\r\n dp[i] = max( dp[i-1], dp[i-2] + i* c[i])\r\nprint(max(dp))", "def max_points(n, a):\r\n count = [0] * (max(a) + 1)\r\n for num in a:\r\n count[num] += 1\r\n prev_max_points = 0\r\n curr_max_points = 0\r\n for num in range(1, max(a) + 1):\r\n p_with_current = num * count[num] + prev_max_points\r\n p_without_current = curr_max_points\r\n prev_max_points = curr_max_points\r\n curr_max_points = max(p_with_current, p_without_current)\r\n \r\n return curr_max_points\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nresult = max_points(n, a)\r\nprint(result)\r\n", "n = int(input())\r\ns = map(int, input().split())\r\nss = [0] * 10**6\r\nfor i in s:\r\n ss[i]+=1\r\nfor i in range(2,10**6):\r\n ss[i] = max(ss[i-1],ss[i-2]+i*ss[i])\r\nprint(ss[-1])", "n, arr, m = int(input()), [0]*(10**5 + 1), 0\r\nfor i in map(int,input().split()):\r\n arr[i] += i\r\n m = max(m,i)\r\na=b=0\r\narr = arr[:m+1]\r\nfor i in arr:\r\n a,b=max(a,i+b),a\r\nprint(a)", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\nmax_value = max(sequence)\r\nfrequency = [0] * (max_value + 1)\r\nfor num in sequence:\r\n frequency[num] += 1\r\ndp = [0] * (max_value + 1)\r\nfor i in range(1, max_value + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * frequency[i])\r\n\r\nprint(dp[max_value])\r\n", "def max_points(seq):\r\n freq = [0] * (max(seq) + 1)\r\n\r\n for num in seq:\r\n freq[num] += 1\r\n\r\n points = [0] * len(freq)\r\n points[1] = freq[1]\r\n\r\n for i in range(2, len(freq)):\r\n points[i] = max(points[i - 1], points[i - 2] + i * freq[i])\r\n\r\n return points[-1]\r\n\r\ndef main():\r\n n = int(input())\r\n seq = list(map(int, input().split()))\r\n result = max_points(seq)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nh = max(a)\r\ncnt = [0] * (h + 1)\r\nmas = [0] * (h + 1)\r\nfor i in a:\r\n cnt[i] += 1\r\nfor i in range(h + 1):\r\n mas[i] = cnt[i] * i\r\n \r\nresult = [0] * (h + 1)\r\nresult[1] = mas[1]\r\nfor i in range(2, h + 1):\r\n result[i] = max(result[i-1], result[i-2] + mas[i])\r\nprint(result[h])", "from collections import defaultdict\r\n\r\ndef solve(n,lt):\r\n cnt = defaultdict(int)\r\n mm = 0\r\n for ele in lt:\r\n cnt[ele]+=1\r\n mm = max(mm,ele)\r\n # print(cnt)\r\n dp = [0]*(mm+1)\r\n dp[0] = 0\r\n dp[1] = cnt[1]\r\n \r\n for i in range(2,mm+1):\r\n dp[i] = max(dp[i-1],dp[i-2]+cnt[i]*i)\r\n # print(dp[i-1],dp[i-2]+cnt[i]*i,i)\r\n print(dp[mm])\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n txt = input()\r\n lt = list(map(int,txt.split(\" \")))\r\n solve(n,lt)\r\n\r\n\r\nmain()", "n=int(input())\r\nfreq=[0]*int(1e5+5)\r\nsu=0\r\nfor i in input().split():\r\n i=int(i)\r\n su+=i\r\n freq[i]+=i\r\nmh=freq[1]\r\nfor i in range(2,10**5+1):\r\n mh=max(mh,freq[i]+freq[i-2])\r\n freq[i]=mh\r\nprint(mh)", "n = int(input())\r\ngame = list(map(int, input().split()))\r\nm = max(game)\r\nnumber = [0 for i in range(m+1)]\r\nfor i in range(n):\r\n number[game[i]] += 1\r\ndp = [[0, 0] for i in range(m+1)]\r\ndp[1][1] = number[1]\r\nfor i in range(2, m+1):\r\n dp[i][0] = max(dp[i-1])\r\n dp[i][1] = max(dp[i-2])+i*number[i]\r\nprint(max(dp[-1]))", "_=input()\r\nl1=list(map(int,input().split()))\r\nm=max(l1)\r\nl2=[0]*(m+1)\r\nfor x in l1:\r\n l2[x]+=x\r\na=0\r\nb=l2[1]\r\nfor i in range(2,m+1):\r\n a,b=b,max(a+l2[i],b)\r\nprint(b)", "from collections import Counter\r\n\r\nn = int(input())\r\n# for _ in range(n):\r\nl = list(map(int, input().split()))\r\nmn, mx = min(l), max(l)\r\nc = Counter(l)\r\nfor i in range(mn, mx+1):\r\n c[i] = c[i]*i\r\n# print(c)\r\ndp0= dp1 = 0\r\nfor i in range(mn, mx+1):\r\n dp0, dp1 = dp1, max(dp0+c[i], dp1)\r\n # dp1 = max(dp0, c[i])\r\nprint(dp1)", "import copy\r\nn=int(input())\r\na=[0]*100001\r\ndp=copy.deepcopy(a)\r\nfor i in map(int,input().split()):\r\n a[i]+=1\r\nfor i in range(100001):\r\n dp[i]=max(dp[i-1], dp[i-2]+i*a[i])\r\nprint(max(dp))", "n = int(float(input()))\ndp, counts = [0 for i in range(int(1e5+1))], [0 for i in range(int(1e5+1))]\narr = [int(float(i)) for i in input().split()]\nfor i in arr:\n counts[i]+=i\nfor i in range(int(1e5+1)):\n if i >= 3:\n dp[i] = max(dp[i-2], dp[i-3])\n dp[i] += counts[i]\n\nprint(max(dp[-2],dp[-1]))", "n=int(input())\r\narr=sorted(list(map(int,input().split())))\r\ndp=[0 for y in range(n)]\r\ni=0\r\nwhile i<n:\r\n\tsa=0\r\n\tt=0\r\n\tk=i-1\r\n\twhile k>=0:\r\n\t\tif arr[k]==arr[i]-1:\r\n\t\t\tt+=1\r\n\t\t\tk-=1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tk=i\r\n\twhile k<=n-1:\r\n\t\tif arr[k]==arr[i]:\r\n\t\t\tsa+=1\r\n\t\t\tk+=1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif sa==0:\r\n\t\tdp[i]=max(dp[i-1-t]+arr[i],dp[i-1])\r\n\telse:\r\n\t\tdp[i]=max(dp[i-1-t]+arr[i]*sa,dp[i-1])\r\n\t\tdp[i+sa-1]=dp[i]\r\n\tif sa!=0:\r\n\t\ti+=sa\r\n\telse:\r\n\t\ti+=1\r\n\t\t\t\r\nprint(str(dp[-1]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=max(a)\r\nb=[0] * d\r\nfor i in a:\r\n b[i-1]=b[i-1]+i\r\nm=0\r\ns=0\r\nfor k in b:\r\n m,s=max(m,k+s),m\r\nprint(m)", "def myfunc(n, arr):\r\n \r\n freq = [0] * 100005\r\n \r\n for val in arr:\r\n freq[val] += 1\r\n \r\n \r\n # dic = {}\r\n \r\n \r\n # def dp(n):\r\n \r\n # if n == 0:\r\n # return 0\r\n \r\n # if n == 1:\r\n # return freq[1]\r\n \r\n # if n in dic:\r\n # return dic[n]\r\n \r\n # result = max(dp(n-1), dp(n-2) + freq[n] * n)\r\n \r\n # return result\r\n \r\n \r\n \r\n dp = [0] * 100005\r\n \r\n dp[0] = 0\r\n \r\n dp[1] = freq[1]\r\n \r\n for i in range(2, 100001):\r\n \r\n dp[i] = max(dp[i-1], dp[i-2] + freq[i] * i)\r\n \r\n \r\n \r\n return dp[100000]\r\n \r\n \r\n\r\n# # # Input\r\n# # t = int(input())\r\n# # graph = defaultdict(list)\r\n\r\nn = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nprint(myfunc(n, arr))", "import math\r\nimport heapq\r\nfrom collections import*\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef fun(n,l,c,a):\r\n lst=[0]*(a+1)\r\n ans=0\r\n lst[1]=c[1]\r\n lst[2]=max(c[1],c[2]*2)\r\n for i in range(2,a+1):\r\n lst[i]=max(lst[i-2]+c[i]*i,lst[i-1])\r\n print(lst[a])\r\n\r\nfor _ in range(1):\r\n n=int(input())\r\n #n=int(input())\r\n # n,m=map(int,input().split())\r\n # n,m=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n c=Counter(l)\r\n a=max(l)\r\n\r\n\r\n \r\n # l1=list(map(int,input().split()))\r\n fun(n,l,c,a)\r\n#Read the problem statement carefully and understand the constraints and requirements.\r\n#\r\n#Break down the problem into smaller subproblems and try to solve each one separately.\r\n#\r\n#Try to find patterns and simplify the problem as much as possible.\r\n#\r\n#Use brute force approach to get a feel of the problem and then optimize it.\r\n#\r\n#Think outside the box and try to find a different approach that may not be obvious.\r\n#\r\n#Write clean and organized code and use efficient data structures and algorithms.\r\n#\r\n#Use test cases to verify your solution and edge cases to test the limits of your solution.\r\n#\r\n#Collaborate with others and learn from their approaches and solutions.'''", "# https://codeforces.com/problemset/problem/455/A\r\n\r\nfrom collections import defaultdict\r\n\r\nd, res = defaultdict(int), defaultdict(int)\r\n\r\ninput()\r\nseq = tuple(map(int, input().split()))\r\n\r\nfor it in seq:\r\n d[it] += it\r\n\r\n# это жадное решение, оно не прокатывает\r\n\"\"\"res = 0\r\nwhile len(d) > 0:\r\n max_key = max(d, key=d.get)\r\n res += d[max_key]\r\n del d[max_key]\r\n if max_key+1 in d:\r\n del d[max_key+1]\r\n if max_key-1 in d:\r\n del d[max_key-1]\r\n\r\nprint(res)\"\"\"\r\n\r\n# dp решение\r\nres[0] = 0\r\nres[1] = d[1]\r\nfor key in range(max(d.keys())+1):\r\n if key > 1:\r\n res[key] = max(res[key-1], res[key-2] + d[key])\r\n \r\nprint(res[max(d.keys())])", "def solve(n,arr):\n d = {}\n maxi = -1\n for i in arr:\n d[i] = d.get(i,0)+1\n maxi = max(maxi,i)\n \n dp = [-1 for i in range(maxi+1)]\n dp[0] = 0\n dp[1] = d.get(1,0)\n for j in range(2,maxi+1):\n dp[j] = max(dp[j-1],dp[j-2]+(d.get(j,0)*(j)))\n print(dp[maxi])\n\nn = int(input())\narr = [int(ele) for ele in input().split()]\nsolve(n,arr)\n# def solve(n,k,arr):\n# pass\n\n\n# t = int(input())\n# for _ in range(t):\n# n,k = [int(ele) for ele in input().split()]\n# arr = [int(ele) for ele in input().split()]\n# solve(n,k,arr)\n", "def func():\r\n a=[0]*100010\r\n dp=[0]*100010\r\n N = int(input())\r\n lst=list(map(int,input().split()))\r\n for j in range(N):\r\n a[lst[j]]+=1\r\n for i in range(100000,0,-1):\r\n dp[i]=max(dp[i+2]+a[i]*i,dp[i+3]+a[i+1]*(i+1))\r\n return dp[1]\r\nprint(func())", "n=int(input())\r\na=list(map(int,input().split()))\r\ndp=[0]*(max(a)+1)\r\nb=[0]*(max(a)+1)\r\nfor i in a:\r\n b[i] += 1\r\n#在排序的同时统计了重复数的个数\r\ndp[1]=b[1]\r\nfor i in range(2,max(a)+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+b[i]*i)\r\nprint(max(dp))", "n=int(input())\r\nnumber=[int(i) for i in list(input().split())]\r\nnumber.sort()\r\nnum=number[0]\r\nnumber_=[number[0]]\r\nNumber_=[]\r\nNumber=0\r\nfor i in number:\r\n if i==num:\r\n Number+=1\r\n else:\r\n Number_.append(Number)\r\n Number=1 \r\n num=i \r\n number_.append(i)\r\nNumber_.append(Number)\r\nn=len(number_)\r\ndp=[0]*(n+10)\r\nfor i in range(1,n+1):\r\n if i==1:\r\n dp[1]= number_[0]*Number_[0]\r\n elif i==2:\r\n if number_[1]-number_[0]>1:\r\n dp[2]= dp[1]+number_[1]*Number_[1]\r\n else:\r\n dp[2]=max(number_[1]*Number_[1],dp[1])\r\n else:\r\n if number_[i-1]-number_[i-2]>1:\r\n dp[i]=dp[i-1]+number_[i-1]*Number_[i-1]\r\n else:\r\n dp[i]=max(dp[i-2]+number_[i-1]*Number_[i-1],dp[i-1])\r\n \r\nprint(dp[n])", "n = int(input())\r\ni = list(map(int, input().split()))\r\ndata = [0] * 100000\r\nmaximum = 0\r\ndp = [0] * 100001\r\nfor j in i:\r\n data[j-1] += 1\r\n maximum = max(maximum, j)\r\ndp[0] = 0\r\ndp[1] = data[0]\r\nfor i in range(2, maximum+1):\r\n dp[i] = max(dp[i-1], dp[i-2] + data[i-1]*(i))\r\nprint(dp[maximum])\r\n", "input()\nd=[0]*100001\nfor x in map(int,input().split()):\n d[x]+=x\na=b=0\nfor i in d:\n a,b=max(a,i+b),a\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\narr=list(map(int,input().split()))\r\ndp=[0]*(max(arr)+1)\r\ncnt=[0]*(max(arr)+1)\r\nfor each in arr:\r\n cnt[each]+=1\r\ndp[0]=0\r\ndp[1]=cnt[1]\r\nfor i in range(2,max(arr)+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+cnt[i]*i)\r\nprint(max(dp))", "n=int(input())\r\na=[0 for i in range(100001)]\r\nb=[0 for i in range(100001)]\r\n#c=[0 for i in range(100001)]\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[l[i]]+=l[i]\r\nb[0]=a[0]\r\nb[1]=a[1]\r\nb[2]=a[2]+a[0]\r\nfor i in range(3,100001):\r\n b[i]=max(b[i-3],b[i-2])+a[i]\r\nprint(max(b[99999],b[100000]))", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndp = [0] * (100001)\r\na, b = 0, 0\r\nfor i in range(n):\r\n dp[arr[i]] += arr[i]\r\nfor i in dp:\r\n a, b = max(a, b + i), a\r\nprint(a)\r\n\n# Wed Jul 12 2023 11:27:15 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nthemax = max(arr)\r\ncounts = [0]*(themax+1)\r\nfor i in arr:\r\n counts[i] += 1\r\nanss = [0] \r\nfor i in range(1,themax+1):\r\n take = i*counts[i]\r\n skip = 0\r\n if i == 1 :\r\n anss.append(take)\r\n else:\r\n take += anss[i-2]\r\n skip += anss[i-1]\r\n anss.append(max(take,skip))\r\nprint(anss[themax])", "memo = [-1] * (10**6)\r\ndef boredom(n):\r\n for i in n:\r\n if memo[i] != -1:\r\n memo[i] = memo[i]+i\r\n else:\r\n memo[i] = i\r\n c,b= 0,0\r\n for j in (memo):\r\n c,b= max(c, b),c+j\r\n print(c)\r\ninput()\r\nn = map(int,input().split())\r\nboredom(n)", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\nmax_num = max(sequence)\r\n\r\ndp = [0] * (max_num + 1)\r\nfor num in sequence:\r\n dp[num] += num\r\n\r\nfor i in range(2, max_num + 1):\r\n dp[i] = max(dp[i-2] + dp[i], dp[i-1])\r\n\r\nprint(max(dp))\r\n", "rozm=10**5+1\r\nN=int(input())\r\nL=[0]*(rozm+3)\r\n\r\nfor i in input().split():\r\n L[int(i)]+=int(i)\r\n\r\na,b=0,L[1]\r\nfor i in range(2,rozm+2):\r\n a,b=b,max(b, a+L[i])\r\n\r\nprint(b)\r\n\r\n", "from collections import Counter\r\nimport sys\r\n \r\ninput = lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef I(): return input()\r\ndef II(): return int(input())\r\ndef MII(): return map(int, input().split())\r\ndef LI(): return list(input().split())\r\ndef LII(): return list(map(int, input().split()))\r\n \r\ninf = float(\"inf\")\r\nmod = 10**9 + 7\r\n# for _ in range(II()):\r\nn = II()\r\na = LII()\r\nmx = max(a)\r\ncnt = Counter(a)\r\nf0, f1 = 0, cnt[1]\r\nfor i in range(2, mx+1):\r\n f0, f1 = f1, max(f1, f0+cnt[i]*i)\r\nprint(f1)", "def maxPoints(n, a):\r\n max_num = max(a) # Find the maximum number in the sequence\r\n freq = [0] * (max_num + 1) # Initialize an array to count the frequency of each number\r\n dp = [0] * (max_num + 1) # Initialize an array to store the maximum points for each number\r\n\r\n # Count the frequency of each number\r\n for num in a:\r\n freq[num] += 1\r\n\r\n # Initialize the dynamic programming array\r\n dp[1] = freq[1] # If we choose the first number, we get points equal to its frequency\r\n dp[2] = max(2 * freq[2], dp[1]) # If we choose the second number, we get 2 points for each occurrence\r\n\r\n # Calculate the maximum points for each number from 3 to max_num\r\n for i in range(3, max_num + 1):\r\n dp[i] = max(i * freq[i] + dp[i - 2], dp[i - 1])\r\n\r\n return dp[max_num]\r\n\r\n# Read input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum points\r\nresult = maxPoints(n, a)\r\nprint(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Nov 21 16:17:18 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\nlst=list(map(int, input().split()))\r\ndp=[0]*100002\r\nout=[0]*100002\r\nfor i in lst:\r\n dp[i]+=i\r\nfor i in range(1,100001):\r\n out[i]=max(out[i-1],out[i-2]+dp[i])\r\nprint(max(out))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n'''for i in range(1,100000):\r\n if dp[i-1]==0 and dp[i+1]==0:\r\n out.append(dp[i])\r\n elif dp[i-1]!=0 and dp[i+1]!=0:\r\n out.append()\r\n'''", "import heapq \r\nfrom collections import defaultdict \r\nimport math \r\nimport collections\r\n\r\n\r\n\r\nmod=10**9+7\r\nalp='#abcdefghijklmnopqrstuvwxyz'\r\ncap='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ndigit='1234567890'\r\n\r\n\r\n\r\n#math.facorial(n)------>gives the factorial \r\n\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(1):\r\n \r\n n =int(input())\r\n #n,k =map(int,input().split())\r\n '''l=[]\r\n for i in range(n):\r\n l1=list(map(int,input().split()))\r\n l.append(l1)'''\r\n #print(math.gcd(-2,-6))\r\n l=list(map(int,input().split()))\r\n #s=input()\r\n d=defaultdict(int)\r\n for i in l:\r\n d[i]+=1 \r\n dp=[0]*(max(l)+1)\r\n \r\n dp[0]=0 \r\n mn =min(l)\r\n dp[mn]=mn*d[mn]\r\n for i in range(mn+1,max(l)+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+i*d[i])\r\n #print(dp)\r\n print(dp[max(l)])\r\n \r\n \r\n\r\n\r\n\r\n", "from collections import Counter\n\nn = int(input())\nnums = [int(_) for _ in input().split()]\n\nd = {}\n\nfor num in nums:\n d[num] = d.get(num, 0)+1\n\ndp = [0]*(10**5+1)\n\nfor i in range(1, 10**5+1):\n if i not in d:\n dp[i] = dp[i-1]\n else:\n dp[i] = max(dp[i-1], dp[i-2]+i*d[i])\n\nprint(dp[-1])\n", "n = int(input())\nl_n = list(map(int, input().split()))\ndp = [0]*(10**6)\nfor n_t in l_n:\n dp[n_t] += 1\nfor i in range(2, 10**6):\n dp[i] = max(dp[i - 1], dp[i - 2] + dp[i]*i)\n\nprint(dp[10**6 - 1])", "def max_points(n, sequence):\r\n # Create a frequency table to count the occurrences of each number\r\n freq = [0] * (max(sequence) + 1)\r\n for num in sequence:\r\n freq[num] += 1\r\n\r\n # Dynamic programming array to store the maximum points at each position\r\n dp = [0] * (max(sequence) + 1)\r\n dp[1] = freq[1] * 1 # Base case for the first number\r\n\r\n # Calculate the maximum points for each number\r\n for i in range(2, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2] + freq[i] * i)\r\n\r\n # Return the maximum points\r\n return dp[-1]\r\n\r\n# Read input values\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum points\r\nmax_points = max_points(n, sequence)\r\nprint(max_points)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nMOD = 1000000007\r\n\r\nn = int( input( ) ) \r\na = list( map( int , input( ).split( ) ) )\r\ns = [0] * 100005\r\nfor v in a : \r\n s[v] += 1 \r\na.clear( )\r\na.append( -1 )\r\nfor i in range( 1 , 100001 ) : \r\n if s[i] : a.append( i )\r\na.append( 0 )\r\nsi = len( a )\r\nf = [[0,0] for _ in range( si + 2 )]\r\nfor i in range( 1 , si ) : \r\n f[i][0] = max( f[i-1] )\r\n if a[i] != a[i-1] + 1 : \r\n f[i][1] = max( f[i-1] ) + a[i] * s[a[i]]\r\n else : \r\n f[i][1] = max( f[i-1][0] + a[i] * s[a[i]] , f[i-1][1] )\r\nprint( max( f[si-1] ) )", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nB = [[A[0],1]]\r\nfor a in A[1:]:\r\n if a==B[-1][0]:\r\n B[-1][1]+=1\r\n else:\r\n B.append([a,1])\r\ndp = [0]\r\nfor i,(a,c) in enumerate(B):\r\n if i>0 and B[i-1][0]+1==a:\r\n dp.append(max(dp[-2]+a*c, dp[-1]))\r\n else:\r\n dp.append(dp[-1]+a*c)\r\n \r\nprint(dp[-1])\r\n \r\n \r\n\r\n\r\n", "import sys\nfrom collections import deque, defaultdict, Counter\n\n############ ---- Input Functions ---- ############\ninput = sys.stdin.readline\n\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############ ---- Output Functions ---- ############\ndef oupNum(n):\n sys.stdout.write(str(n) + \"\\n\")\n\ndef oupList(lst):\n sys.stdout.write(\" \".join(map(str, lst)) + \"\\n\")\n\n\n\ndef main():\n m = inp()\n nums = inlt()\n counter = Counter(nums)\n uniqNums = list(counter.keys())\n uniqNums.sort()\n\n n = len(uniqNums)\n dp = [[0, 0] for _ in range(n)]\n dp[0][1] = counter[uniqNums[0]] * uniqNums[0]\n for i in range(1, n):\n dp[i][0] = max(dp[i-1][0], dp[i-1][1])\n dp[i][1] = max(dp[i][1], dp[i-1][0]+counter[uniqNums[i]]*uniqNums[i])\n if i > 0 and uniqNums[i] - uniqNums[i-1] > 1:\n dp[i][1] = max(dp[i][1], dp[i-1][1]+counter[uniqNums[i]]*uniqNums[i])\n\n oupNum(max(dp[n-1]))\n\n\n\nif __name__ == '__main__':\n main()", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\npoints = defaultdict(int)\r\n\r\nfor num in a:\r\n points[num] += num\r\n\r\ndp = [0 for _ in range(max(a) + 1)]\r\n\r\ndp[0] = 0\r\ndp[1] = points[1]\r\n\r\nfor i in range(2, len(dp)):\r\n dp[i] = max(dp[i - 1], points[i] + dp[i - 2])\r\n\r\nprint(dp[-1])\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n", "import sys; input = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nct = [0] * 100001\r\nfor i in range(n):\r\n ct[a[i]] += 1\r\n\r\ndp = [0] * 100001\r\ndp[1] = ct[1]\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i - 2] + ct[i] * i, dp[i - 1])\r\n\r\nprint(dp[100000])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nMAX_N = int(1e5 + 1)\r\n \r\ncount = [0] * (MAX_N + 1)\r\n\r\nfor i in a:\r\n count[i] += 1\r\n \r\ndp = [0] * (MAX_N + 1)\r\ndp[1] = count[1]\r\n\r\nfor last in range(2, MAX_N + 1):\r\n dp[last] = max(dp[last - 1], dp[last - 2] + last * count[last])\r\n \r\nprint(dp[MAX_N])\r\n\r\n", "n = int(input())\r\nnums = sorted(list(map(int, input().split())))\r\ndp = [0] * (max(nums) + 1)\r\nfor i in nums:\r\n dp[i] += i\r\na = 0\r\nb = 0\r\nfor i in dp:\r\n a, b = max(a, b + i), a\r\nprint(a)", "scrs = [0 for i in range(10**5+1)]\r\ninput()\r\n\r\nnums= map(int,input().split())\r\n\r\nfor num in nums:\r\n scrs[num] += num\r\n\r\n\r\nout = [0 for i in range(10**5+1)]\r\n\r\nfor pt in range(1,10**5+1):\r\n if pt < 1:\r\n out[pt] = 0\r\n continue\r\n out[pt] = max(out[pt-1], out[pt-2] + scrs[pt])\r\n\r\nprint(out[-1])", "n=int(input());seq=list(map(int,input().split()))\r\nfreq=[0]*(max(seq)+1)\r\nfor i in seq:\r\n freq[i]+=1\r\ndp=[0]*(max(seq)+1)\r\ndp[1]=freq[1]\r\nfor i in range(2,len(dp)):\r\n dp[i]=max(dp[i-1],dp[i-2]+i*freq[i])\r\nprint(dp[-1])", "n = int(input())\r\nli = [int(_) for _ in input().split()]\r\nrec = [0] * (max(li) + 1)\r\nfor i in range(n):\r\n rec[li[i]] += li[i]\r\nfor i in range(1, len(rec)):\r\n if i != 1 and i != 2 and i != 3:\r\n rec[i] += max(rec[i - 2], rec[i - 3], rec[i - 4])\r\n elif i == 3:\r\n rec[3] += rec[1]\r\nprint(max(rec))", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\ndic = {}\r\nfor n in data:\r\n dic[n] = dic.get(n, 0) + 1\r\n\r\nres = [0] * (max(data) + 1)\r\n\r\nfor i in range(1, len(res)):\r\n res[i] = max(res[i - 1], i * dic.get(i, 0) + (res[i - 2] if i > 1 else 0))\r\n\r\nprint(res[-1])\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\na=[0]*(m+1)\r\nfor i in l:\r\n a[i]+=i\r\nfor i in range(2,m+1):\r\n a[i]=max(a[i-2]+a[i],a[i-1])\r\nprint(a[m])", "N = 100001\r\nn = int(input())\r\na = [int(i) for i in input().split(\" \")]\r\ncnt = [0 for x in range(N)]\r\nfor i in range(n):\r\n cnt[a[i]] += 1\r\ndp = [0 for x in range(N)]\r\n\r\ndp[0] = 0\r\ndp[1] = cnt[1]\r\nfor i in range(2, N):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + (cnt[i] * i))\r\n\r\nprint(dp[N - 1])", "n = int(input())\r\nlist1 = list(map(int, input().split()))\r\n\r\nlist2 = [0] * (max(list1) + 1)\r\nfor i in list1:\r\n list2[i] += i\r\n\r\nfor i in range(2, max(list1) + 1):\r\n list2[i] = max(list2[i] + list2[i-2], list2[i-1])\r\n\r\nprint(list2[max(list1)])\n# Wed Jul 12 2023 13:41:14 GMT+0300 (Moscow Standard Time)\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\nimport heapq\r\n\r\n_ = input()\r\nL = list(map(int, input().split()))\r\ndic = Counter()\r\nfor i in range(len(L)):\r\n dic[L[i]] += 1\r\nnew = list(set(L))\r\nnew.sort()\r\ndp = [0] * (len(new) + 1)\r\ndp[1] = new[0] * dic[new[0]]\r\nfor i in range(2, len(dp)):\r\n dp[i] = dp[i - 1]\r\n if new[i - 1] == new[i - 2] + 1:\r\n dp[i] = max(dp[i], dp[i - 2] + new[i - 1] * dic[new[i - 1]])\r\n else:\r\n dp[i] = max(dp[i], dp[i - 1] + new[i - 1] * dic[new[i - 1]])\r\nprint(dp[-1])\r\n\r\n\r\n", "input()\r\nnList=[0]*100001\r\ndp=[0]*100001\r\nfor i in map(int,input().split()):\r\n nList[i]+=i\r\ndp[1]=nList[1]\r\n\r\nfor i in range(2,100001):\r\n dp[i]=max(dp[i-1],dp[i-2]+nList[i])\r\n\r\nprint(dp[-1])", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = max(a)\r\ns = [0] * t\r\ndp = [0] * t\r\nfor i in a:\r\n s[i - 1] += i\r\nif len(s) == 1:\r\n dp[0] = s[0]\r\nelif len(s) == 2:\r\n dp[0] = s[0]\r\n dp[1] = s[1]\r\nelse:\r\n dp[0] = s[0]\r\n dp[1] = s[1]\r\n dp[2] = s[0] + s[2]\r\n for i in range(3, max(a)):\r\n dp[i] = max(dp[i - 2] + s[i], dp[i - 3] + s[i])\r\nprint(max(dp))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 17 13:39:56 2022\r\n\r\n@author: 帝落梦魂\r\n\"\"\"\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nam = max(a)\r\nhe = [0]*am\r\nfor x in a:\r\n he[x-1] += x\r\nx = he[0]\r\ny = max(he[0],he[1])\r\nfor i in range(2,am):\r\n x,y = y,max(x+he[i],y)\r\nprint(y)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\ndp = [0]*(max(a)+1); w = [0]*(max(a)+1)\r\nfor ai in a: w[ai] += 1\r\n\r\nfor i in range(1,max(a)+1):\r\n dp[i] = max(dp[i-1], dp[i-2]+i*w[i])\r\n\r\nprint(max(dp))", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\ns=[0]*100010\r\nfor x in l:\r\n s[x]+=x\r\n\r\nans=[0,s[1] , s[2]]\r\nmx = s[1]\r\nfor i in range(3,100005):\r\n ans.append(mx+s[i])\r\n mx=max(mx, ans[i-1])\r\nprint(mx)", "n = int(input())\r\narray = sorted(list(map(int,input().split())))\r\nmax_num = array[-1]\r\nlst = [0]*(max_num+1)\r\ndp = [0]*(max_num+1)\r\nfor i in array:\r\n lst[i] += i\r\nfor x in range(max_num+1):\r\n if x <= 2:\r\n dp[x] = lst[x]\r\n else:\r\n dp[x] = max(dp[x-2],dp[x-3])+lst[x]\r\nprint(max(dp[max_num],dp[max_num-1]))", "from collections import Counter\n\nN = int(input())\ncounts = Counter(list(map(int, input().split())))\n\ndp = [0]\n\nfor num in range(1, 10**5+1):\n dp.append(max(dp[-1], counts[num] * num + (dp[-2] if len(dp) >= 2 else 0)))\n\nprint(dp[-1])", "#-*- coding: utf-8 -*\n'''\nCreated on Wen Nov 15\nauthor 钱瑞 2300011480\n'''\nn = int(input())\nl_in = list(map(int,str(input()).split()))\nl_a_n = l_in\nl_a_num=[ 0 for i in range(100001) ]\nl_seq_cho=[ 0 for i in range(100001) ]\nl_seq_not_cho=[ 0 for i in range(100001) ]\nfor i in range(n):\n l_a_num[ l_a_n[i] ] += 1\nl_seq_cho[ 1 ] = l_a_num[1]*1\nfor i in range(2,100001):\n l_seq_cho[ i ] = l_seq_not_cho[ i-1 ] + i*l_a_num[ i ]\n l_seq_not_cho[ i ] = max( l_seq_cho[ i-1 ] , l_seq_not_cho[ i-1 ] ) \nprint( max( l_seq_cho[100000] , l_seq_not_cho[100000] ) )", "n = int(input())\r\narr = [int(i) for i in input().split(\" \")]\r\n\r\nm = max(arr)\r\nsum_array = [0] * (m + 1)\r\ndp = [0] * (m+1)\r\n\r\nfor i in arr:\r\n sum_array[i] += 1\r\n \r\ndp[1] = sum_array[1]\r\nfor i in range(2, m+1):\r\n dp[i] = max(dp[i-1], dp[i-2]+(sum_array[i] * i))\r\n\r\n# print(dp)\r\nprint(dp[-1])", "from collections import Counter\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\na=list(Counter(a).items())\r\na.sort()\r\nn = len(a)\r\ninc,exc=a[0][1]*a[0][0],0\r\nfor i in range(1,n):\r\n inc1,exc1=a[i][1]*a[i][0],max(inc,exc)\r\n if i and a[i-1][0]+1==a[i][0]:\r\n inc1+=exc\r\n else:\r\n inc1+=max(inc,exc)\r\n inc,exc=inc1,exc1\r\nprint(max(inc,exc))\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nt = max(l)\r\np = [0]*(t+1)\r\nfor x in l:\r\n p[x] += 1\r\nd = [0,p[1]]\r\nfor i in range(2, t+1):\r\n d.append(max(p[i]*i+d[i-2], d[i-1]))\r\nprint(d[t])", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Find the maximum value in the sequence to determine the size of the array for DP\r\nmax_value = max(sequence)\r\n\r\n# Initialize an array to store the maximum points for each number\r\npoints = [0] * (max_value + 1)\r\n\r\n# Count the frequency of each number in the sequence\r\nfrequency = [0] * (max_value + 1)\r\nfor num in sequence:\r\n frequency[num] += 1\r\n\r\n# Initialize the DP array with the first two values\r\npoints[1] = frequency[1]\r\npoints[2] = max(frequency[1] * 1, frequency[2] * 2)\r\n\r\n# Calculate the maximum points for each number\r\nfor i in range(3, max_value + 1):\r\n points[i] = max(points[i - 1], points[i - 2] + frequency[i] * i)\r\n\r\n# The maximum points Alex can earn will be the maximum value in the DP array\r\nmax_points = max(points)\r\n\r\nprint(max_points)\r\n", "#罗景轩2300012610\r\nN = int(input())\r\nl = list(map(int, input().split()))\r\nz = [0 for _ in range(max(l)+1)]\r\ndp = [0 for _ in range(max(l)+1)]\r\nfor i in l:\r\n z[i] += i\r\ndp[1]=z[1]\r\nfor i in range(1,max(l)):\r\n dp[i+1]=max(dp[i],dp[i-1]+z[i+1])\r\nprint(dp[-1])", "def maximum_points(n, sequence):\r\n counts = {}\r\n for num in sequence:\r\n counts[num] = counts.get(num, 0) + 1\r\n\r\n scores = [0] * (max(sequence) + 1)\r\n for num in counts:\r\n scores[num] = num * counts[num]\r\n\r\n for i in range(2, len(scores)):\r\n scores[i] = max(scores[i] + scores[i - 2], scores[i - 1])\r\n\r\n return scores[-1]\r\n\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\nresult = maximum_points(n, sequence)\r\nprint(result)\r\n", "from collections import Counter\r\nfrom sys import stdin\r\n\r\n\r\ndef solve():\r\n stdin.readline()\r\n A = [int(x) for x in stdin.readline().split()]\r\n\r\n count = Counter(A)\r\n m = 10**5\r\n dp = [0] * (m + 1)\r\n dp[1] = count[1]\r\n\r\n for a in range(2, m + 1):\r\n dp[a] = max(dp[a - 2] + a * count[a], dp[a - 1])\r\n\r\n print(dp[m])\r\n\r\n\r\nsolve()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Create a frequency count of each number in the sequence\r\nfreq = [0] * (max(a) + 1)\r\nfor num in a:\r\n freq[num] += 1\r\n\r\n# Initialize dp array to store maximum points for each number\r\ndp = [0] * (max(a) + 1)\r\n\r\n# Calculate the maximum points using dynamic programming\r\ndp[0] = 0\r\ndp[1] = freq[1]\r\n\r\nfor i in range(2, len(dp)):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * freq[i])\r\n\r\n# Print the maximum points\r\nprint(dp[max(a)])\r\n", "import sys\r\n\r\ndef read_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\ndef read_string():\r\n return sys.stdin.readline().split()[0]\r\n\r\ndef read_strings():\r\n return sys.stdin.readline().split()\r\n\r\ndef YES():\r\n write('YES')\r\n\r\ndef NO():\r\n write('NO')\r\n\r\ndef write(x):\r\n sys.stdout.write(x + '\\n')\r\n\r\n\r\ndef solve():\r\n # identical to house robber\r\n n = read_int()\r\n a = read_ints()\r\n # first we need to make a counter array to store the \"value\" of each house\r\n counter = [0] * (10**5 + 1)\r\n for x in a:\r\n counter[x] += x\r\n dp = [0] * (10**5 + 1)\r\n # dp[i] = max points considering the houses [0..i] and we rob house i for sure\r\n dp[0] = 0\r\n dp[1] = counter[1]\r\n for i in range(2, 10**5 + 1):\r\n # either rob this house or not, if we rob this house, we can't rob the previous house\r\n dp[i] = max(dp[i-1], dp[i-2] + counter[i])\r\n write(str(dp[10**5]))\r\n\r\nsolve()", "n=int(input())\r\nlis=[0]*100001\r\ndp=[0]*100001\r\nfor i in map(int,input().split()):\r\n lis[i]+=1\r\nfor i in range(1,100001):\r\n dp[i]=max(dp[i-1],dp[i-2]+i*lis[i])\r\nprint(max(dp))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb={}\r\nc=[0 for i in range(100001)]\r\nfor i in range(100001):\r\n b[i]=0\r\nfor x in a:\r\n b[x]+=x\r\n \r\nif 1 in b:\r\n c[1]=b[1]\r\nif 2 in b:\r\n c[2]=b[2]\r\nfor i in range(3,100001):\r\n x1=c[i-3]+b[i]\r\n x2=c[i-2]+b[i]\r\n c[i]=max(x1,x2)\r\nc.sort()\r\nprint(c[-1])", "def main():\r\n n = int(input())\r\n v = list(map(int, input().split()))\r\n m = max(v)\r\n cnt = [0] * (m+1)\r\n for i in range(n):\r\n cnt[v[i]] += 1\r\n dp = [0] * (m+1)\r\n dp[1] = cnt[1]\r\n for i in range(2, m+1):\r\n dp[i] = max(dp[i-1], i*cnt[i] + dp[i-2])\r\n print(dp[m])\r\nmain()", "from collections import Counter\n\nN = int(input())\nc = Counter(map(int, input().split()))\nMAX = 10**5\n\ndp = {MAX + 1: 0, MAX + 2: 0}\nfor i in range(MAX, 0, -1):\n dp[i] = max(i * c[i] + dp[i + 2], dp[i + 1])\nprint(dp[1])\n \t\t \t\t \t\t \t \t\t \t\t\t \t \t", "import collections\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = collections.Counter(a)\r\n\r\ndp = [0] * (max(a) + 1)\r\ndp[0] = 0\r\ndp[1] = cnt[1]\r\n\r\nfor i in range(2, max(a) + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * cnt[i])\r\nprint(dp[max(a)])\r\n", "\r\nn=int(input())\r\nterms=sorted(list(map(int,input().split())))\r\nnums=[0]*max(terms) #把不连续部分的个数设为0\r\nfor i in terms:\r\n nums[i-1]+=1\r\ndp=[0]*(max(terms)+1)\r\nfor i in range(max(terms)):\r\n dp[i]=max(dp[i-1],dp[i-2]+(i+1)*nums[i]) #对应不选或选的情况\r\nprint(dp[max(terms)-1])", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nd=max(lst)\r\nl=[0]*d\r\nfor i in range(n):\r\n l[lst[i]-1]+=lst[i]\r\n\r\nfinal=max(l[0],l[1])\r\nf=[0]*d\r\nf[0]=l[0]\r\n\r\nfor i in range(1,d):\r\n \r\n final=max(final,l[i]+f[i-2])\r\n f[i]=final\r\n \r\nprint(final)", "from bisect import bisect_left\r\nfrom collections import Counter, defaultdict\r\nfrom functools import lru_cache\r\nimport sys\r\nimport threading\r\n\r\ndef main():\r\n n = int(input())\r\n nums = list(map(int, input().split()))\r\n cnt = Counter(nums)\r\n\r\n keys = sorted(cnt.keys())\r\n m = len(keys)\r\n\r\n @lru_cache(None)\r\n def dp(idx):\r\n if idx == m:\r\n return 0\r\n \r\n # choose\r\n choice1 = dp(bisect_left(keys, keys[idx] + 2)) + keys[idx] * cnt[keys[idx]]\r\n\r\n # not choose\r\n choice2 = dp(idx + 1)\r\n\r\n return max(choice1, choice2)\r\n\r\n print(dp(0))\r\n\r\n\r\nif __name__ == '__main__':\r\n sys.setrecursionlimit(1 << 30)\r\n threading.stack_size(1 << 27)\r\n\r\n main_thread = threading.Thread(target=main)\r\n main_thread.start()\r\n main_thread.join()", "from collections import Counter\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nnums = []\r\ncount = 1\r\nif n==1 : print(arr[0])\r\nelse :\r\n counter = Counter(arr)\r\n nums = [(num, count) for num, count in counter.items()]\r\n nums.reverse()\r\n includeprev = nums[0][0]*nums[0][1]\r\n prev = nums[0]\r\n notincludeprev = 0\r\n for i in range (1, len(nums)) :\r\n a = includeprev\r\n b = notincludeprev\r\n if nums[i][0]<prev[0]-1 :\r\n includeprev = max(a, b) + nums[i][0]*nums[i][1]\r\n notincludeprev = max(a, b)\r\n else : \r\n includeprev = b + nums[i][0]*nums[i][1]\r\n notincludeprev = max(a,b)\r\n prev = (nums[i][0], nums[i][1])\r\n print(max(includeprev, notincludeprev))", "'''\r\n* author: Adham0 \r\n* created: 21.08.2023 17:24:29\r\n \r\n* █████ ██████ ██ ██ █████ ███ ███ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ████ ████ \r\n* ███████ ██ ██ ███████ ███████ ██ ████ ██ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n* ██ ██ ██████ ██ ██ ██ ██ ██ ██ \r\n'''\r\n\r\nn = int(input())\r\n\r\nlst = [0] * 100001\r\n\r\nlst2 = [int(i) for i in input().split()]\r\nfor x in lst2:\r\n lst[x] += x\r\n\r\na = 0\r\nb = 0\r\nfor i in lst:\r\n a, b = max(a, i + b), a\r\n\r\nprint(a)", "n = int(input())\r\na = list(map(int, input().split()))\r\nn1 = max(a) + 1\r\ndp = [0] * n1\r\nfor i in a:\r\n dp[i] += 1\r\nfor i in range(2, n1):\r\n dp[i] = max(i * dp[i] + dp[i - 2], dp[i - 1])\r\nprint(dp[-1])\r\n", "input();z=[0]*(100001)\r\nfor i in map(int,input().split()):z[i]+=i\r\ns=0;t=0\r\nfor i in z:s,t=max(s,i+t),s\r\nprint(s)\r\n ", "from collections import Counter\r\n\r\ndef max_sum(temp):\r\n temp = [0]*3 + temp\r\n for i in range(3, len(temp)):\r\n temp[i] = max(temp[i-3], temp[i-2]) + temp[i]\r\n return max(temp)\r\n\r\nn = int(input())\r\ne = Counter(map(int, input().split()))\r\nnums = list(sorted(e.items(), key=lambda t: t[0]))\r\nprev = - float(\"inf\")\r\npoints = 0\r\ntemp = []\r\nfor t in nums:\r\n if t[0] - prev != 1:\r\n points += max_sum(temp)\r\n temp.clear()\r\n temp.append(t[0]*t[1])\r\n prev = t[0]\r\npoints += max_sum(temp)\r\nprint(points)", "n=int(input())\r\nA=list(map(int, input().split()))\r\ndp=[0]*(max(A)+1)\r\nnum=[0]*(max(A)+1)\r\nfor i in A:\r\n num[i]+=1\r\n\r\ndp[1]=num[1]\r\nfor i in range(2,max(A)+1):\r\n dp[i]=max(dp[i-1], dp[i-2]+i*num[i])\r\n \r\nprint(dp[max(A)])", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]*100002\r\nfor j in a:\r\n b[j]+=1\r\nd=max(a)\r\nfor i in range(d-1):\r\n b[i+2]=max(b[i+1],b[i]+(i+2)*b[i+2])\r\nprint(max(b))\r\n", "n = int(input())\r\nunsplitted = sorted(list(map(int, input().split())))\r\ns = len(set(unsplitted))\r\nnum = [[] for _ in range(s)]\r\nnum[0].append(unsplitted[0])\r\ncount = 0\r\nfor i in range(1, n):\r\n if unsplitted[i] == unsplitted[i-1]:\r\n num[count].append(unsplitted[i])\r\n else:\r\n count += 1\r\n num[count].append(unsplitted[i])\r\ndp = [0]*(s+1)\r\ndp[0] = 0\r\ndp[1] = sum(num[0])\r\nfor j in range(2, s+1):\r\n if num[j-1][0] > num[j-2][0] + 1:\r\n dp[j] = dp[j-1] + sum(num[j-1])\r\n else:\r\n dp[j] = max(dp[j-1], dp[j-2]+sum(num[j-1]))\r\nprint(dp[-1])\r\n", "memo = [-1] * (10**6)\r\ndef boredom(n):\r\n for i in n:\r\n if memo[i] != -1:\r\n memo[i] = memo[i]+i\r\n else:\r\n memo[i] = i\r\n c,b= 0,0\r\n for j in (memo):\r\n c,b =max(c,b), c+j \r\n return c\r\ninput()\r\nn = list(map(int,input().split()))\r\nc = boredom(n)\r\nprint(c)\r\n", "#本题的dp是从1~max_value，不需要关心这个数是否在seq中出现（有点难想到）\r\nn=int(input())\r\nseq=[int(_) for _ in input().split()]\r\nseq.sort()\r\nmax_value=seq[-1]\r\ncnt=[0]*(max_value+2)\r\ndp=[0]*(max_value+2)\r\n#记录数字出现的次数\r\nfor i in seq:\r\n cnt[i]+=1\r\n\r\nfor i in range(1,max_value+1):\r\n if i==1:\r\n dp[i]=1*cnt[i]\r\n else:\r\n pick=cnt[i]*i+dp[i-2] #选择当前数，舍弃之前一个数\r\n skip=dp[i-1] #舍弃当前数\r\n dp[i]=max(pick,skip)\r\n\r\nprint(dp[max_value])\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = [0] * 100001\r\nfor x in a:\r\n cnt[x] += 1\r\ndp = [0] * 100001\r\ndp[1] = cnt[1]\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * cnt[i])\r\nprint(dp[-1])", "n=int(input())\r\nlst=[int(x)for x in input().split()]\r\nt=max(lst)\r\ndp=[0]*(t+1)\r\nempty=[0]*(t+1)\r\nfor i in lst:\r\n empty[i]+=1\r\ndp[1]=empty[1]\r\nfor i in range(2,t+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+empty[i]*i)\r\nprint(max(dp))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nscore = [0]*(max(a)+1)\r\nfor ai in a:\r\n score[ai] += ai\r\nnew, old = 0, 0\r\nfor s in score:\r\n new, old = max(new, old + s), new\r\nprint(new)", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Calculate the maximum element in the sequence\r\nmax_element = max(sequence)\r\n\r\n# Create an array to store the frequency of each element in the sequence\r\nfrequency = [0] * (max_element + 1)\r\n\r\n# Fill the frequency array\r\nfor num in sequence:\r\n frequency[num] += 1\r\n\r\n# Create a dynamic programming table to store the maximum points for each element\r\ndp = [0] * (max_element + 1)\r\n\r\n# Initialize the base cases\r\ndp[1] = frequency[1]\r\n\r\n# Calculate the maximum points for each element\r\nfor i in range(2, max_element + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * frequency[i])\r\n\r\n# The answer is the maximum value in the dp array\r\nprint(dp[max_element])\r\n", "import sys\r\nfrom collections import Counter\r\n\r\n# sys.stdin, sys.stdout = open(\"input.txt\", \"r\"), open(\"output.txt\", \"w\")\r\n\r\ndef main():\r\n n = int(input())\r\n arr = [int(a) for a in input().split()]\r\n ctr = Counter(arr)\r\n keys = sorted(ctr.keys())\r\n k = len(keys)\r\n if k == 1:\r\n print(keys[0] * ctr[keys[0]])\r\n return\r\n p1, p2 = 0, keys[0] * ctr[keys[0]]\r\n if keys[1] == keys[0] + 1:\r\n p1 = max(keys[1] * ctr[keys[1]], p2)\r\n else:\r\n p1 = p2 + keys[1] * ctr[keys[1]]\r\n cur = 0\r\n for i in range(2, k):\r\n if keys[i] == keys[i - 1] + 1:\r\n cur = max(p1, p2 + keys[i] * ctr[keys[i]])\r\n else:\r\n cur = p1 + keys[i] * ctr[keys[i]]\r\n p2, p1 = p1, cur\r\n print(p1)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "import collections\r\nn = int(input())\r\nnums = []\r\nnums = list(map(int,\r\n input().strip().split()))[:n]\r\ncount=collections.Counter(nums)\r\nnums = sorted(list(set(nums)))\r\nearn1,earn2=0,0\r\nfor i in range(len(nums)):\r\n curEarn=nums[i]*count[nums[i]]\r\n if i>0 and nums[i]==nums[i-1]+1:\r\n temp=earn2\r\n earn2=max(curEarn+earn1,earn2)\r\n earn1=temp\r\n else:\r\n temp=earn2\r\n earn2=curEarn+earn2\r\n earn1=temp\r\nprint(earn2)", "from collections import defaultdict\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\nc=defaultdict(int)\r\nfor y in m:\r\n c[y]+=1\r\ne=list(c.keys())\r\ne.sort()\r\nf=[0]*len(e)\r\nf[0]=e[0]*c[e[0]]\r\n\r\nj=[0,0]\r\nk=[e[0],f[0]]\r\nfor i in range(1,len(c)):\r\n if k[0]!=e[i]-1:\r\n f[i]=k[1]+e[i]*c[e[i]]\r\n else:\r\n f[i]=j[1]+e[i]*c[e[i]]\r\n if k[1]<f[i]:\r\n j=k\r\n k=[e[i],f[i]]\r\n \r\nprint(k[1])", "def max_points(n, a):\r\n max_num = max(a) # Find the maximum element in the sequence\r\n frequency = [0] * (max_num + 1)\r\n dp = [0] * (max_num + 1)\r\n\r\n # Count the frequency of each element in the sequence\r\n for num in a:\r\n frequency[num] += 1\r\n\r\n # Dynamic programming to calculate the maximum points\r\n dp[1] = frequency[1]\r\n for i in range(2, max_num + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * frequency[i])\r\n\r\n # The final result is stored in dp[max_num]\r\n return dp[max_num]\r\n\r\n# Read input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum points\r\nresult = max_points(n, a)\r\nprint(result)", "input()\r\na = [0] * 7**6\r\nfor i in map(int, input().split()):\r\n a[i] += i\r\nfor i in range(2, 7**6):\r\n a[i] = max(a[i - 1], a[i - 2] + a[i])\r\n ans = a[i]\r\nprint(ans)", "input()\r\nd = [0]*100001\r\nfor x in map(int,input().split()):\r\n d[x]+=x \r\na=b=0 \r\nfor i in d:\r\n a,b = max(a,i+b),a \r\nprint(a)", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\nb=[0]*100001\r\ndp=[0]*100001\r\n\r\nfor i in range(n):\r\n b[a[i]] += 1\r\n\r\ndp[1] = b[1] \r\nans = b[1]\r\n\r\nfor i in range(2,max(a)+1):\r\n dp[i] = max(dp[i-2]+b[i]*i, dp[i-1])\r\nprint(dp[max(a)])", "n = int(input())\r\na = list(map(int, input().split()))\r\ndp = [0] * (10**5 + 1)\r\ncount = [0] * (10**5 + 1)\r\nfor num in a:\r\n count[num] += 1\r\ndp[1] = count[1] * 1\r\nfor i in range(2, 10**5 + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + count[i] * i)\r\nprint(dp[10**5])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nb = [0] * (m + 1)\r\nfor i in a:\r\n b[i] += i\r\ndp = [0] * (m + 1)\r\ndp[1] = b[1]\r\nfor i in range(2, m + 1):\r\n dp[i] = max(b[i] + dp[i - 2], dp[i - 1])\r\nprint(dp[-1])", "from types import GeneratorType\r\n \r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc\r\nfrom collections import *\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nc = Counter(arr)\r\nmx = max(arr)\r\n# @lru_cache(None)\r\ndp = [-1 for i in range(mx+1)]\r\n@bootstrap\r\ndef helper(ind):\r\n if ind > mx:\r\n yield 0\r\n if dp[ind] != -1:\r\n yield dp[ind]\r\n ans = (yield helper(ind+2) )\r\n ans += c[ind]*ind\r\n ans2 = (yield helper(ind+1))\r\n dp[ind] = max(ans,ans2)\r\n yield dp[ind]\r\nprint(helper(1))\r\n", "n=int(input())\r\nnums=[int(x) for x in input().split()]\r\nnums.sort()\r\nsus=[[nums[0],nums[0]]]\r\nkkk=1\r\nfor i in range(1,n):\r\n if nums[i]==nums[i-1]:\r\n sus[-1][1]+=nums[i]\r\n else:\r\n kkk+=1\r\n sus.append([nums[i],nums[i]])\r\n\r\nsus.sort(key=lambda x : x[0])\r\nanswer=[0,0,sus[0][1]]\r\nfor i in range(1,kkk):\r\n if sus[i][0]-1==sus[i-1][0]:\r\n answer.append(max(answer[i]+sus[i][1],answer[i+1]))\r\n else:\r\n answer.append(answer[i+1]+sus[i][1])\r\nprint(max(answer))", "n = int(input())\n\narr = list(map(int,input().split()))\n\ndp = [0] *100007\nnums = [0] *100007\nfor i in arr:\n nums[i] +=1\n\ndp[0] = 0\ndp[1] = nums[1]\n\nfor i in range(2,100000+1):\n dp[i] = max(dp[i-1],dp[i-2]+i*nums[i])\n\nprint(dp[100000])", "n = int(input())\r\nL = [int(x) for x in input().split()]\r\nA = [0 for _ in range(100000)]\r\nans = [0 for _ in range(100000)]\r\nfor i in range(n):\r\n A[L[i]-1] += 1\r\nans[0] = 1*A[0]\r\nans[1] = max(ans[0],2*A[1])\r\nfor i in range(2,100000):\r\n ans[i] = max(ans[i-1],(i+1)*A[i]+ans[i-2])\r\nprint(str(ans[-1]))", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\nn = int(input())\r\nnum_list = list(map(int,input().split()))\r\ndp = [0] * (max(num_list) + 2)\r\ntimes = [0] * (max(num_list) + 2)\r\nfor _ in num_list:\r\n times[_] += _\r\ndp[1] = times[1]\r\nfor i in range(2,max(num_list) + 2):\r\n dp[i] = max(dp[i - 1],dp[i - 2] + times[i])\r\nprint(dp[-1])", "n = int(input())\r\nnum = [int(x) for x in input().split()]\r\ncount = [0]*100001\r\nfor i in num:\r\n count[i] += 1\r\n\r\ndp = [0]*100001\r\nfor j in range(1, 100001):\r\n dp[j] = max(dp[j-1], dp[j-2]+count[j]*j)\r\nprint(max(dp))", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = [0] * 100001\r\nfor i in a:\r\n cnt[i] += 1\r\ndp = [0] * 100001\r\ndp[0] = 0\r\ndp[1] = cnt[1]\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i-1], dp[i-2] + cnt[i]*i)\r\nprint(dp[100000])", "import time\r\nimport sys\r\n\r\ndef MI(): return map(int,sys.stdin.readline().strip().split())\r\ndef I(): return int(sys.stdin.readline().strip())\r\n\r\nMAX = 100001;\r\ndp = [-1 for i in range(MAX)]\r\nc = MAX * [0]\r\n\r\ndef f(i): #TLE\r\n global dp, c\r\n if i == 0 :\r\n return 0\r\n if i == 1 :\r\n return c[1]\r\n if dp[i] != -1:\r\n return dp[i]\r\n\r\n ans = max( f(i-1), f(i-2) + c[i]*i)\r\n\r\n dp[i] = ans\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n global c\r\n I()\r\n a = MI()\r\n max_n = 0\r\n for x in a: \r\n c[x] += 1\r\n max_n = max(max_n, x)\r\n\r\n dp = [0 for i in range(max_n + 1)]\r\n dp[1] = c[1]\r\n for i in range(2, max_n + 1):\r\n dp[i] = max(dp[i - 1], i * c[i] + dp[i - 2])\r\n \r\n print(dp[max_n])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\npoints = [0]*(10**5+5)\r\nfor x in getints():\r\n points[x] += x\r\n\r\nans = 0\r\na1 = 0 # 1 step back answer\r\nfor x in points:\r\n ans,a1 = max(a1+x,ans),ans\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\np = []\r\nfor i in range(max(a) + 1):\r\n p.append(0)\r\nfor i in range(n):\r\n p[a[i]] += 1\r\nans = [0]\r\nfor i in range(1, max(a) + 1):\r\n ans.append(0)\r\n if p[i] == 0:\r\n ans[i] = ans[i - 1]\r\n continue\r\n ans[i] = max(ans[i - 1], ans[i - 2] + i * p[i])\r\nprint(ans[max(a)])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndp = [0] * 100001\r\n\r\nfor ak in a:\r\n dp[ak] += ak\r\n\r\ndp[1] = max(dp[1], dp[0])\r\n\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i] + dp[i-2], dp[i-1])\r\n\r\nprint(dp[100000])\r\n", "n = int(input())\r\nsequence = list(map(int,input().split()))\r\ncount = {}\r\nfor i in sequence:\r\n if i in count:\r\n count[i] += 1\r\n else: count[i] = 1\r\nkey = [-1] + sorted(list(count.keys()))\r\nk = len(key)-1\r\ndp = [0]*(k+1)\r\nfor i in range(1,k+1):\r\n if key[i] > key[i-1]+1:\r\n dp[i] = dp[i-1]+key[i]*count[key[i]]\r\n else:\r\n dp[i] = max(dp[i-1], dp[i-2]+key[i]*count[key[i]])\r\nprint(dp[k])", "n=int(input())\r\nnums=list(map(int,input().split()))\r\ncounts=[0]*(10**5+1)\r\nfor num in nums:\r\n counts[num]+=1\r\n\r\nprev=0\r\nscore=0\r\ndp=[0]\r\nfor i in range(10**5+1):\r\n if counts[i]==0:\r\n score+=dp[-1]\r\n dp=[0]\r\n else:\r\n if len(dp)==1: dp.append(i*counts[i])\r\n else: dp.append(max(i*counts[i]+dp[-2],dp[-1]))\r\nscore+=dp[-1]\r\nprint(score)\r\n", "maxn = int(1e+5 + 5)\r\n\r\nnums = dict()\r\nfor i in range(1, maxn + 1):\r\n nums[i] = 0\r\n\r\nn = int(input())\r\nfor i in map(int, input().split()):\r\n nums[i] += 1\r\n\r\ndp = [0] * maxn\r\ndp[0] = 1 * nums[1]\r\ndp[1] = max(dp[0], 2 * nums[2])\r\ndp[2] = max(dp[0] + 3 * nums[3], dp[1])\r\nfor i in range(3, maxn):\r\n dp[i] = max(dp[i - 1], ((i + 1) * nums[i + 1]) + max(dp[i - 2], dp[i - 3]))\r\n\r\nprint(dp[maxn - 1])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[0]*100005\r\nfor x in a:\r\n c[x]+=1\r\nd=[0]*100005\r\nd[1]=c[1]\r\nfor i in range(2,100005):\r\n d[i]=max(d[i-1],d[i-2]+c[i]*i)\r\nprint(d[100004])", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = [0]*(10**5 + 1)\r\nfor i in a:\r\n d[i] += i\r\nk = 0\r\nb = 0\r\nfor i in d:\r\n k, b = max(k, i + b), k\r\nprint(k)", "def max_points(n, sequence):\r\n # Create a frequency table to count the occurrences of each element\r\n frequency = [0] * (max(sequence) + 1)\r\n for num in sequence:\r\n frequency[num] += 1\r\n\r\n # Initialize dynamic programming table\r\n dp = [0] * (max(sequence) + 1)\r\n\r\n # Base case: dp[0] = 0, dp[1] = frequency[1]\r\n dp[1] = frequency[1]\r\n\r\n # Fill in the dynamic programming table\r\n for i in range(2, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * frequency[i])\r\n\r\n # Return the maximum number of points\r\n return dp[-1]\r\n\r\n# Read input\r\nn = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\n# Call the function and print the result\r\nprint(max_points(n, sequence))\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\narr1 = [0]*(100002)\r\nfor i in arr:\r\n arr1[i]+=i\r\ndp = [0]*len(arr1)\r\ndp[1] = arr1[1]\r\nfor i in range(2,len(arr1)):\r\n dp[i] = max(dp[i-1], arr1[i]+dp[i-2])\r\n\r\nprint(dp[-1])\r\n\r\n\r\n\r\n", "input()\r\nnDict={}\r\nfor i in map(int,input().split()):\r\n if i in nDict:\r\n nDict[i]+=1\r\n else:\r\n nDict[i]=1\r\n\r\nlenList=sorted(nDict.keys())[-1]+1\r\nnList=[0]*lenList\r\ndp=[0]*lenList\r\nfor i in nDict:\r\n nList[i]=i*nDict[i]\r\ndp[1]=nList[1]\r\n\r\nfor i in range(2,lenList):\r\n dp[i]=max(dp[i-1],dp[i-2]+nList[i])\r\n\r\nprint(dp[-1])", "\"\"\"\r\n由对命题特性的分析可知：\r\n1.只要全流程中有操作删除ak，那就要把ak要全部删除干净(cnt[ak]次操作)\r\n2.只要全流程涉及了删除ak的操作，就意味着全流程没有删除ak-1或ak+1的操作\r\n3.如果全流程中不涉及删除ak的操作，又分两种情况：\r\n①删除了ak-1\r\n②没删除ak-1（那就是删除了ak+1,但是由于我们按顺序递归，这里不从后往前考虑）\r\n所以：\r\n显然，对这个数列的操作与这个数列的排序是无关的，我们使用哈希表的方式统计\r\n每个元素出现的次数，记为cnt[x].\r\n现在我们做一个二维dp表，dp[i][0],dp[i][1]分别表示不删去i、删去i时\r\n得分的最大值。\r\n于是我们得到了一个递归的dp！\r\n状态转移方程为：\r\ndp[i][1]=dp[i-1][0]+i*cnt[i]\r\ndp[i][0]=max(dp[i-1][0],dp[i-1][1])\r\n边界条件：\r\ndp[0][0]和dp[0][1]\r\n\"\"\"\r\ninput()\r\nc = [0] * 100001\r\nfor m in map(int, input().split()):\r\n c[m] += 1\r\n\r\ndp = [0] * 100001\r\nfor i in range(1, 100001):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * c[i])\r\n\r\nprint(max(dp))", "def maximumPoints(n, a):\r\n # Step 1: Create an array to store the frequency of each number in the sequence.\r\n frequency = [0] * (max(a) + 1)\r\n for num in a:\r\n frequency[num] += 1\r\n\r\n # Step 2: Use dynamic programming to calculate the maximum points.\r\n dp = [0] * (max(a) + 1)\r\n dp[1] = frequency[1]\r\n\r\n for i in range(2, len(dp)):\r\n dp[i] = max(dp[i-1], dp[i-2] + i * frequency[i])\r\n\r\n # Step 3: Return the maximum points that can be earned.\r\n return dp[-1]\r\n\r\n# Input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Output\r\nprint(maximumPoints(n, a))", "def max_points(sequence):\r\n max_value = max(sequence) # Find the maximum value in the sequence\r\n counts = [0] * (max_value + 1) # Initialize counts array\r\n \r\n # Count occurrences of each number in the sequence\r\n for number in sequence:\r\n counts[number] += 1\r\n \r\n # Initialize result array with at least two elements\r\n result = [0] * (max_value + 1)\r\n \r\n # Dynamic programming to calculate result\r\n for i in range(1, max_value + 1):\r\n take = counts[i] * i # Points for taking number i\r\n skip = 0 # Points for skipping number i\r\n if i > 1:\r\n take += result[i - 2] # Add points from result of taking i-2\r\n skip = result[i - 1] # Points from result without taking i\r\n \r\n result[i] = max(take, skip) # Max points for number i\r\n \r\n return result[max_value] # Return the last element, the answer for the whole sequence\r\n\r\n# Example usage:\r\nn = int(input().strip())\r\nsequence = list(map(int, input().strip().split()))\r\nprint(max_points(sequence))", "n = int(input())\n\na = [0] * 100005\ndp = [0] * 100005\n\nline = input().split()\nfor i in range(len(line)):\n index = int(line[i])\n a[index] = a[index] + 1\n\ndp[0] = 0\ndp[1] = a[1]\nfor i in range(2, 100001):\n dp[i] = max(dp[i - 1], dp[i - 2] + (i * a[i]))\n\nprint(dp[100000])\n \t\t \t\t\t \t \t\t \t \t \t\t\t \t \t\t", "def f(arr):\r\n count = [0] * 100001\r\n dp = [0] * 100001\r\n\r\n for num in arr:\r\n count[num] += 1\r\n dp[0] = 0\r\n dp[1] = count[1]\r\n for i in range(2, 100001):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * count[i])\r\n return dp[100000]\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(f(arr))\n# Wed Jul 12 2023 12:04:27 GMT+0300 (Moscow Standard Time)\n", "def solve(n,arr):\r\n \r\n cnt = {}\r\n \r\n for i in range(len(arr)):\r\n try:\r\n cnt[arr[i]]+=1\r\n except:\r\n cnt[arr[i]] = 1\r\n \r\n for i in range(1,max(arr)+1):\r\n if i not in cnt.keys():\r\n cnt[i] = 0\r\n \r\n dp = [0 for i in range(len(cnt)+1)]\r\n dp[1] = cnt[1] \r\n for i in range(2, len(cnt)+1):\r\n dp[i] = max(dp[i-1], dp[i-2]+i*cnt[i])\r\n return dp[-1] \r\n \r\n#t = int(input())\r\nt = 1\r\nfor i in range(t):\r\n #s = input()\r\n n = int(input())\r\n #arr = input().split(\" \")\r\n #c = int(arr1[2])\r\n #n = int(ns[0])\r\n #k = int(ns[1])\r\n arr = input().split(\" \") \r\n arr = [int(a) for a in arr]\r\n \r\n ans = solve(n,arr)\r\n \r\n print(ans)", "n = int(input())\r\na = [0] * 100005\r\ndp = [0] * 100005\r\nfor i in input().split():\r\n a[int(i)] += 1\r\nfor i in range(1, 100000 + 1):\r\n if i == 1:\r\n if a[i] > 0:\r\n dp[i] = a[i]\r\n else:\r\n dp[i] = 0\r\n else:\r\n dp[i] = dp[i - 1]\r\n if a[i] > 0:\r\n dp[i] = max(dp[i], dp[i - 2] + a[i] * i)\r\nprint(dp[100000])", "def maxpoint(b:list):\r\n dp = [0]*(10**5+1)\r\n for i in range(1,10**5+1):\r\n if b[i] == 0:\r\n dp[i] = dp[i-1]\r\n else:\r\n if b[i-1] == 0:\r\n dp[i] = dp[i-1]+i*b[i]\r\n else:\r\n x = dp[i-2]+i*b[i]\r\n y = dp[i-1]\r\n dp[i] = max(x,y)\r\n return dp[-1]\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [0]*(10**5+1)\r\nfor i in a:\r\n b[i] += 1\r\n\r\nprint(maxpoint(b))", "n = int(input())\r\na = [0]*100001\r\nfor i in [int(x) for x in input().split()]:\r\n a[i] += 1\r\ndp = [0]*100001\r\nfor j in range(1, 100001):\r\n dp[j] = max(dp[j-1], dp[j-2] + j * a[j])\r\nprint(max(dp))", "def max_points(nums):\r\n counts = [0] * (max(nums) + 1)\r\n for num in nums:\r\n counts[num] += num\r\n take_it, leave_it = 0, 0\r\n for count in counts:\r\n take_it, leave_it = max(take_it, count + leave_it), take_it\r\n return take_it\r\n\r\ninput()\r\nnums = list(map(int, input().split()))\r\nprint(max_points(nums))", "from collections import Counter\r\n_ = input()\r\nnumbers = list(map(int, input().split()))\r\n\r\nc = Counter(numbers)\r\nkeys = sorted(c.keys())\r\n\r\nn = len(keys)\r\n\r\ntake = [0 for _ in range(n+1)]\r\nnotake = [0 for _ in range(n+1)]\r\n\r\nfor i in reversed(range(n)):\r\n number, count = keys[i], c[keys[i]]\r\n points = number * count\r\n if i == n - 1:\r\n notake[i] = 0\r\n take[i] = points\r\n continue\r\n\r\n\r\n if number != keys[i+1] - 1:\r\n take[i] = max(take[i + 1], notake[i + 1]) + points\r\n else:\r\n take[i] = max(take[i + 2], notake[i + 2]) + points\r\n notake[i] = max(take[i + 1], notake[i + 1])\r\n\r\nprint(max(take[0], notake[0]))", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\ns.sort()\r\na=[0]*100001\r\nfor i in s:\r\n a[i]+=i\r\ndp=[0]*100001\r\ndp[1]=a[1]\r\nans=0\r\nfor i in range(2,max(s)+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+a[i])\r\n ans=max(ans,dp[i])\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx =[0]*int(1e5+1) \r\nfor i in range(n):\r\n x[a[i]]+=1 \r\nmaxi=max(a)\r\ndp=[0]*(int(1e5)+1)\r\ndp[0]=0 \r\ndp[1]=x[1] \r\nfor i in range(2,int(1e5)+1):\r\n dp[i]=max(dp[i-1], dp[i-2]+x[i]*i) \r\nprint(dp[maxi])\r\n", "def max_points(n, a):\r\n max_val = max(a)\r\n freq = [0] * (max_val + 1)\r\n\r\n for num in a:\r\n freq[num] += 1\r\n\r\n dp = [0] * (max_val + 1)\r\n dp[1] = freq[1]\r\n\r\n for i in range(2, max_val + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * freq[i])\r\n\r\n return dp[max_val]\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nresult = max_points(n, a)\r\nprint(result)\r\n", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\nfreq = [0] * (10**5 + 1)\r\n\r\nfor num in sequence:\r\n freq[num] += 1\r\n\r\ndp = [0] * (10**5 + 1)\r\ndp[0] = freq[0] * 0\r\n\r\nfor i in range(1, 10**5 + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + freq[i] * i)\r\n\r\nmax_points = dp[10**5]\r\nprint(max_points)\r\n", "n, array = int(input()), list(map(int, input().split()))\r\n\r\narray_sort = [[0, 0]]\r\nfor i in range(1, max(array) + 1):\r\n array_sort.append([i, 0])\r\n\r\nfor i in range(n):\r\n array_sort[array[i]][1] += 1\r\n\r\ndp = [0]\r\nfor i in range(1, max(array) + 1):\r\n if i < 2:\r\n dp.append(max(array_sort[i][0] * array_sort[i][1], dp[-1]))\r\n elif i < 3:\r\n dp.append(max(dp[-1], array_sort[i][0] * array_sort[i][1] + dp[-2]))\r\n else:\r\n dp.append(max(dp[-1], array_sort[i][0] * array_sort[i][1] + dp[-2], array_sort[i][0] * array_sort[i][1] + dp[-3]))\r\n\r\nprint(dp[max(array)])", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n d = {i:0 for i in range(10**5+1)}\r\n vals = {i:0 for i in range(10**5+1)}\r\n for i in range(n):\r\n d[a[i]] += 1\r\n for i in list(d.keys()):\r\n vals[i] = d[i] * i\r\n\r\n dp = [[0, 0] for i in range(10 ** 5+1)]\r\n for i in range(1, 10**5+1):\r\n dp[i][0], dp[i][1] = max(dp[i-1][0], dp[i-1][1]), dp[i-1][0]+vals[i]\r\n\r\n print(max(dp[-1][0], dp[-1][1]))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\nimport sys\n# sys.stdin = open('in.txt', 'r') \n# sys.stdout = open('op.txt', 'w')\n\n\nt = 1\nwhile t>0:\n t-=1\n n = int(input())\n arr = list(map(int,input().split(' ')))\n cnt = [0]*(10**5+1)\n for i in arr:\n cnt[i]+=1\n ans = [0]*(10**5+1)\n for i in range(10**5+1):\n ans[i] = i*cnt[i]\n if(i>1):\n ans[i]+=ans[i-2]\n ans[i] = max(ans[i-1],ans[i])\n print(ans[10**5])\n\n\n\n ", "n = int(input())\r\nA = list(map(int, input().split()))\r\nP = [0] * 100001\r\nm = 0\r\nfor i in range (n):\r\n if A[i] > m:\r\n m = A[i]\r\n P[A[i]] += 1\r\nA = [-1] * (m + 1)\r\nA[1] = P[1]\r\nA[2] = max(P[1], P[2] * 2)\r\nfor i in range (3, m + 1):\r\n A[i] = max (A[i - 1], A[i - 2] + P[i] * i)\r\nprint (A[m])", "import collections\r\n\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nfreq=collections.Counter(lst)\r\ndp=[0 for i in range(max(lst)+1)]\r\nfor i in range(1,max(lst)+1):\r\n if(i==1):\r\n if(1 in freq):\r\n dp[1]=freq[1]\r\n else:\r\n if(i in freq):\r\n dp[i]=max(dp[i-1],dp[i-2]+freq[i]*i)\r\n else:\r\n dp[i]=max(dp[i-1],dp[i-2])\r\nprint(max(dp))", "n=int(input())\r\nlis=sorted([int(i) for i in input().split()])\r\ndic={}\r\nfor i in lis:\r\n if i not in dic:\r\n dic[i]=i\r\n else:\r\n dic[i]+=i\r\nk=max(lis)\r\ndp=[0]*(k+1)\r\nfor i in range(lis[0],k+1):\r\n if i not in dic:\r\n dp[i]=dp[i-1]\r\n else:\r\n if i-1 not in dic:\r\n dp[i]=dp[i-1]+ dic[i]\r\n else:\r\n dp[i]=max(dp[i-2]+dic[i],dp[i-1])\r\nprint(dp[-1])", "n = int(input())\r\ns = [int(_) for _ in input().split()]\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n\r\nl = sorted(d.items(),key = lambda x:x[0])\r\n\r\ndp = [0]*(len(l)+1)\r\ndp[1] = l[0][0]*l[0][1]\r\nfor i in range(1,len(l)):\r\n if l[i][0]-1 != l[i-1][0]:\r\n dp[i+1] = dp[i] + l[i][0]*l[i][1]\r\n else:\r\n dp[i+1] = max( dp[i] , dp[i-1] + l[i][0]*l[i][1])\r\nprint(max(dp))", "n = int(input())\r\nnums = sorted(list(map(int, input().split())))\r\n# mydict = {}\r\n# for i in nums:\r\n# mydict[i] = nums.count(i) * i\r\n# mykeys = sorted(list(mydict.keys()))\r\n# mykeys.reverse()\r\n# for i in mykeys:\r\n# if i + 1 not in mykeys:\r\ndp = [0] * (max(nums) + 1)\r\nfor i in nums:\r\n dp[i] += i\r\na = 0\r\nb = 0\r\nfor i in dp:\r\n a, b = max(a, b + i), a\r\nprint(a)\r\n\r\n\r\n\r\n\r\n\r\n", "n=input()\r\nnumbers=[int(x) for x in input().split()]\r\nm=[0]*100001\r\nfor i in numbers:\r\n m[i]+=1\r\ndp=[0]*100001\r\nfor j in range(100001):\r\n dp[j]=max(dp[j-1],dp[j-2]+j*m[j])\r\n\r\nprint(max(dp))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * (10**5 + 1)\r\nfor i in a:\r\n count[i] += i\r\n\r\ndp = [0] * (10**5 + 1)\r\ndp[1] = count[1]\r\nfor i in range(2, 10**5 + 1):\r\n dp[i] = max(dp[i-1], dp[i-2] + count[i])\r\n\r\nprint(dp[10**5])\r\n", "n = int(input())\r\nlst = [0] + list(map(int,input().split()))\r\n\r\ncnt = [0]*7**6\r\ndp = [0]*7**6\r\n\r\nfor i in lst:\r\n cnt[i] += 1\r\n\r\ndp[1] = cnt[1]\r\nfor i in range(2,len(dp)):\r\n dp[i] = max(dp[i-1],dp[i-2] + i*cnt[i])\r\n\r\nprint(max(dp))", "def max_points(n, sequence):\r\n freq = [0] * (max(sequence) + 1)\r\n\r\n for num in sequence:\r\n freq[num] += 1\r\n\r\n dp = [0] * (max(sequence) + 1)\r\n dp[1] = freq[1]\r\n\r\n for i in range(2, max(sequence) + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + freq[i] * i)\r\n\r\n return dp[max(sequence)]\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input()) \r\n sequence = list(map(int, input().split())) \r\n\r\n result = max_points(n, sequence)\r\n print(result)\r\n", "dl = int(input())\r\nlista = input().split()\r\nfor i in range(dl):\r\n lista[i] = int(lista[i])\r\n\r\nzlicz = [0] * (max(lista) + 1)\r\nfor i in lista:\r\n zlicz[i] += i\r\n\r\nwynik = [0] * (max(lista) + 1)\r\nwynik[0] = zlicz[0]\r\nwynik[1] = max(zlicz[0], zlicz[1])\r\nfor i in range(2, max(lista) + 1):\r\n wynik[i] = max(wynik[i - 1], zlicz[i] + wynik[i - 2])\r\n\r\nprint(wynik[-1])", "n=int(input())\r\nm=[int(i) for i in input().split()]\r\na=10**5\r\ns={}\r\nfor i in range(1,a+1):\r\n s[i]=0\r\nfor i in m:\r\n s[i]+=1\r\nt={}\r\nt[1]=s[1]\r\nt[2]=2*s[2]\r\nt[3]=t[1]+3*s[3]\r\nfor i in range(4,a+1):\r\n t[i]=i*s[i]+max(t[i-2],t[i-3])\r\nprint(max(t.values()))", "n=int(input())\r\na=[int(x)for x in input().split()]\r\nl=[0]*(max(a)+2)\r\nfor i in a:\r\n l[i+1]+=1\r\nans=[0 for i in range(max(a)+2)]\r\nfor i in range(2,len(ans)):\r\n ans[i]=max(ans[i-1],ans[i-2]+l[i]*(i-1))\r\nprint(max(ans))", "from collections import Counter\r\nn = int(input())\r\ns = Counter(map(int,input().split()))\r\na,b=0,0\r\nfor i in range(1,max(s.keys())+1):\r\n a,b=max(a,b+s[i]*i),a\r\nprint(a)", "import sys\r\nsys.setrecursionlimit(20000)\r\n\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\nl=[0 for i in range(100001)]\r\nfor i in range(n):\r\n l[m[i]]+=m[i]\r\n\r\ndp=[0]*(100001)\r\ndp[1]=l[1]\r\n\r\nfor i in range(2,100001):\r\n dp[i]=max(dp[i-1],dp[i-2]+l[i])\r\n\r\nprint(dp[-1])\r\n ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nA = [0]*(10**5 + 1)\r\nfor i in a:\r\n A[i] += i\r\nB = [0]*(10**5 + 1)\r\nB[1] = A[1]\r\nB[2] = max(A[1], A[2])\r\nfor i in range(3, 10**5 + 1):\r\n if B[i-1] == B[i-2]:\r\n B[i] = B[i-1] + A[i]\r\n else:\r\n if B[i-2] + A[i] > B[i-1]:\r\n B[i] = B[i-2] + A[i]\r\n else:\r\n B[i] = B[i-1]\r\nprint(B[-1])", "from collections import *\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\n\r\nc = Counter(nums)\r\nlst = sorted(c.items())\r\n\r\nf = [[0, 0] for _ in range(len(lst) + 1)] # 0选，1不选\r\nfor i in range(len(lst)):\r\n if i == 0 or lst[i][0] - 1 != lst[i - 1][0]: # 选\r\n f[i + 1][0] = max(lst[i][0], max(f[i]) + lst[i][0] * lst[i][1])\r\n else: # 当前不选\r\n f[i + 1][0] = max(lst[i][0], f[i][1] + lst[i][0] * lst[i][1])\r\n f[i + 1][1] = max(f[i])\r\nprint(max(f[-1]))", "n = int(input())\r\na = list(map(int,input().split()))\r\ncnt = [0]*100001\r\ndp = [0]*100001\r\n\r\nfor i in a:\r\n cnt[i]+=i\r\n\r\ndp[0] = 0\r\ndp[1] = cnt[1]\r\nfor i in range(2,100001):\r\n dp[i] = max(dp[i-1],dp[i-2]+cnt[i])\r\n\r\nprint(dp[100000])\r\n", "from collections import Counter\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=Counter(a)\r\nm,M=min(c),max(c)\r\nscore={x:x*c[x] for x in range(m,M+1)}\r\np=[0 for _ in range(M+1)]\r\nq=p[:]\r\nfor i in range(m,M+1):\r\n p[i]=max(p[i-1],q[i-1])\r\n q[i]=max(q[i-1],p[i-1]+score[i])\r\nprint(q[-1])", "from collections import Counter\r\nfrom os import path\r\nfrom random import getrandbits\r\nfrom sys import stdin, stdout\r\nfrom types import GeneratorType\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\nRANDOM = getrandbits(32)\r\n\r\n\r\nclass Int(int):\r\n def __hash__(self):\r\n return super().__hash__() ^ RANDOM\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 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\ndef solution():\r\n @bootstrap\r\n def dp(i: int) -> int:\r\n if i in cache:\r\n yield cache[i]\r\n if i >= n:\r\n ans = 0\r\n elif i == n - 1:\r\n ans = nums[n - 1] * c[nums[n - 1]]\r\n else:\r\n ans1 = yield dp(i + 1)\r\n ans2 = nums[i] * c[nums[i]]\r\n if nums[i + 1] - nums[i] == 1:\r\n ans2 += yield dp(i + 2)\r\n else:\r\n ans2 += yield dp(i + 1)\r\n ans = max(ans1, ans2)\r\n cache[i] = ans\r\n yield ans\r\n\r\n\r\n n = int(input())\r\n nums = [Int(num) for num in input().split()]\r\n c = Counter(nums)\r\n nums = sorted(c)\r\n n = len(nums)\r\n cache = dict()\r\n print(dp(0))\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * (max(a) + 1)\r\nfor num in a:\r\n count[num] += num\r\n\r\nb = [0] * (max(a) + 1)\r\nb[1] = count[1]\r\nfor i in range(2, max(a) + 1):\r\n b[i] = max(b[i - 1], b[i - 2] + count[i])\r\n\r\nprint(b[max(a)])\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\ncnt=[0]*(l[n-1]+1)\ndp=[0]*(l[n-1]+1)\nt=1\nfor i in range(n):\n cnt[l[i]]+=1\ndp[1]=1*cnt[1]\ndp[2]=max(1*cnt[1],2*cnt[2])\nfor i in range(2,l[n-1]+1):\n dp[i]=max(dp[i-1],dp[i-2]+cnt[i]*i)\nprint(dp[l[n-1]])", "input()\r\nL=[0]*(100002)\r\n \r\nfor i in input().split():\r\n L[int(i)]+=int(i)\r\n \r\na,b=0,0\r\nfor i in L:\r\n a, b = b, max(b,a+i)\r\n \r\nprint(b)\r\n", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nm=max(s)\r\na=[0]*(m+1)\r\ndp=[0]*(m+1)\r\nans=0\r\nfor i in range(n):\r\n a[s[i]]+=1\r\ndp[1]=a[1]\r\nfor i in range(2,m+1):\r\n dp[i]=max(a[i]*i+dp[i-2],dp[i-1])\r\nprint(max(dp))", "from collections import Counter\r\n\r\nn = int(input())\r\nf = Counter(map(int, input().split()))\r\nmx = max(f)+1\r\n\r\ndp = [0]*mx\r\nfor i in range(1, mx):\r\n dp[i] = max(dp[i-1], dp[i-2] + f[i]*i)\r\n\r\nprint(dp[-1])", "# merge two arrays\nimport math\n\n\n\n\ndef main():\n n = int(input())\n m = int((1e5+2))\n nums = list(map(int, input().split()))\n counters = [0]*m\n resFrom = [-1] * m\n for num in nums:\n counters[num] += 1\n resFrom[-1] = counters[-1] * (m-1)\n resFrom[-2] = max(resFrom[-1], counters[-2]*(m-2))\n for i in reversed(range(m-2)):\n resFrom[i] = max(counters[i]*i + resFrom[i+2], resFrom[i+1])\n print(resFrom[0])\n\nmain()\n\n ", "x=int(input())\r\nline=list(map(int,input().split()))\r\na=max(line)\r\nans_=[0]*(a+2)\r\nans=[0]*(a+2)\r\nfor i in line:\r\n ans_[i]+=1\r\nans[1]=ans_[1]\r\nfor i in range(2,a+2):\r\n ans[i]=max(ans[i-1],ans[i-2]+ans_[i]*i)\r\nprint(max(ans))", "input()\r\nnums=[int(x) for x in input().split( )]\r\ncount=[0]+[0]*max(nums)\r\ndp=[0]+[0]*max(nums)\r\n\r\nfor a in nums:\r\n count[a]+=1\r\n\r\ndp[1]=count[1]*1\r\nfor b in range(1,max(nums)+1):\r\n dp[b]=max(dp[b-1],dp[b-2]+count[b]*b)\r\n\r\nprint(max(dp))", "n = int(input())\r\nli = [int(a) for a in input().split()]\r\nx = max(li)\r\nlis = [0]*(x)\r\nfor i in li:\r\n lis[i-1] += 1\r\nans = []\r\nfor i in range(x):\r\n a = lis[i]*(i+1)\r\n ans.append(a)\r\ndp = [0]*x\r\ndp[0] = ans[0]\r\ndp[1] = max(ans[1],ans[0])\r\nif x<=2:\r\n print(max(dp))\r\nif x>2:\r\n for i in range(2,x):\r\n dp[i] = max(dp[i-1],dp[i-2]+ans[i])\r\n print(max(dp))", "n = int(input())\r\na = [int(ak) for ak in input().split()]\r\n\r\ncount_num = [0] * 100001\r\nfor ak in a:\r\n count_num[ak] += 1\r\n\r\ndp = [0] * 100001\r\ndp[1] = count_num[1]\r\nfor ak in range(2,len(dp)):\r\n dp[ak] = max(dp[ak-1], dp[ak-2]+count_num[ak]*ak)\r\n\r\nprint(dp[-1])", "n=int(input())\r\nl=[0]*100005\r\nfor i in [int(j) for j in input().split()]:\r\n l[i]+=1\r\ndp=[0]*100005\r\nfor i in range(1,100001):\r\n dp[i]=max( dp[i-1], dp[i-2] + i*l[i] )\r\nprint(max(dp))", "n = int(input())\r\nlist1 = list(map(int,input().split()))\r\nlist2 = [0]*1000001\r\nfor i in list1:\r\n list2[i] += 1\r\nlist3 = [0]*1000001\r\nfor q in range(1,1000001):\r\n list3[q] = max(list3[q-1],list3[q-2]+q*list2[q])\r\nprint(list3[max(list1)])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 17 16:41:42 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\nn = int(input())\r\ndp = [0] * 100002\r\na = sorted([int(l) for l in input().split()])\r\na.append(100001)\r\n\r\ntemp = 0\r\nfor i in range(n):\r\n if temp == 0:\r\n temp = a[i]\r\n if a[i] == a[i + 1]:\r\n temp += a[i]\r\n else:\r\n dp[a[i]] = temp\r\n temp = 0\r\n\r\n\r\nfor i in range(1,100001):\r\n dp[i] = max(dp[i - 1],dp[i - 2] + dp[i])\r\n\r\nprint(max(dp[-1],dp[-2]))", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\nmax_num = max(l1)\r\nl2 = [i for i in range(max_num+1)]\r\ncnt = [0] * (max_num + 1)\r\nfor i in l1:\r\n cnt[i] += 1\r\ndp = [0] * (max_num + 1)\r\ndp[0] = 0\r\ndp[1] = cnt[1]*l2[1]\r\nfor i in range(2, max_num + 1):\r\n dp[i] = max(dp[i - 1], dp[i - 2] + cnt[i]*l2[i])\r\nprint(dp[-1])", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\n\r\nm = max(a) + 1\r\ndp = [0] * m\r\ncnt = [0] * m\r\n\r\nfor i in range(n):\r\n cnt[a[i]] += 1\r\n \r\ndp[1] = cnt[1]\r\n\r\nfor i in range(2, m):\r\n dp[i] = max(i * cnt[i]+dp[i-2], dp[i-1])\r\n\r\nprint(dp[-1])\r\n\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 14 16:12:17 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\nz=[0]*100001\r\nfor i in map(int,input().split()):\r\n z[i]+=i\r\na=b=0\r\nfor i in z:\r\n a,b=max(a,b+i),a\r\nprint(a)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=[0]*100001\r\nfor x in a:\r\n d[x]+=x#把每一种数字的总和加起来\r\ndp=[0]*100003\r\nfor i,di in enumerate(d,2):\r\n dp[i]=max(dp[i-1],dp[i-2]+di)\r\nprint(dp[-1])\r\n", "length = int(input())\r\narr = [int(a) for a in input().split()]\r\n# sorting is O(nlgn)\r\narr.sort() \r\n# O(n) way to convert arr to nums and freq\r\nnums = [arr[0]]\r\nfreq = [1]\r\nuniquecounter = 0\r\nfor i in range(1, length):\r\n if arr[i] != arr[i-1]:\r\n nums += [arr[i]]\r\n freq += [1]\r\n uniquecounter += 1\r\n else:\r\n freq[uniquecounter] += 1\r\n# O(n) dynamic programming loop\r\nstorage = [0 for i in nums]\r\nstorage[-1] = nums[-1] * freq[-1]\r\nif(len(nums) > 1): \r\n storage[-2] = storage[-1] + nums[-2] * freq[-2]\r\n if nums[-2] + 1 == nums[-1]:\r\n storage[-2] = max(storage[-1], nums[-2] * freq[-2])\r\n for i in reversed(range(len(nums)-2)):\r\n if nums[i] + 1 != nums[i+1]:\r\n storage[i] = storage[i+1] + nums[i]*freq[i]\r\n else:\r\n storage[i] = max(storage[i+1], storage[i+2]+nums[i]*freq[i])\r\nprint(storage[0])", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ndp=[0]*(max(a)+1)\r\nsub=[0]*(max(a)+1)\r\nfor i in a:\r\n sub[i]+=1\r\ndp[1]=sub[1]\r\nfor j in range(2,max(a)+1):\r\n dp[j]=max(dp[j-1],dp[j-2]+sub[j]*j)\r\nprint(max(dp))", "\r\nimport sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\nn=int(input())\r\n\r\narr=li()\r\n\r\ncnt=defaultdict(int)\r\n\r\nfor i in arr:\r\n cnt[i]+=1\r\n\r\na=sorted(cnt.keys())\r\n\r\nn=len(a)\r\n\r\nf=[[0]*2 for _ in range(n)]\r\n\r\n#0表示不选 ，1表示选\r\n\r\nf[0][1]=a[0]*cnt[a[0]]\r\n\r\nfor i in range(1,n):\r\n f[i][0]=max(f[i-1])\r\n if a[i]-1==a[i-1]:\r\n f[i][1]=f[i-1][0]+a[i]*cnt[a[i]]\r\n else:\r\n f[i][1]=max(f[i-1])+a[i]*cnt[a[i]]\r\nprint(max(f[-1]))\r\n\r\n\r\n\r\n\r\n \r\n\r\n", "n = int(input())\r\nseq = [int(i) for i in input().split()]\r\nseq.sort()\r\npoints = [0]*100000\r\nfor i in range(0,n):\r\n points[seq[i]-1]+=seq[i]\r\nx = seq[-1]\r\ntotal = [0]*100000\r\ntotal[0] = points[0]\r\ntotal[1] = max(points[0],points[1])\r\nfor i in range(2,x):\r\n total[i] = max(total[i-1],total[i-2]+points[i])\r\nprint(total[x-1])", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nc=Counter(arr)\r\ndp=[[0,0] for _ in range(max(arr)+1)]\r\nfor el in range(1,max(arr)+1):\r\n dp[el][0]=dp[el-1][1]+c[el]*el\r\n dp[el][1]=max(dp[el-1][0],dp[el-1][1])\r\nprint(max(dp[-1]))\r\n \r\n ", "def max_points(n, a):\r\n # Count the frequency of each number in the sequence\r\n freq = [0] * (max(a) + 1)\r\n for num in a:\r\n freq[num] += 1\r\n \r\n # Initialize two variables to store the maximum points for two cases:\r\n # 1. If we skip the current number, we keep track of the maximum points up to the previous number.\r\n # 2. If we choose the current number, we add its points to the maximum points up to two numbers before.\r\n prev_max = 0\r\n current_max = 0\r\n \r\n for num in range(len(freq)):\r\n # Calculate the points if we choose the current number\r\n points_with_num = num * freq[num] + prev_max\r\n # Calculate the points if we skip the current number\r\n points_without_num = current_max\r\n \r\n # Update the maximum points for the current number\r\n current_max = max(points_with_num, points_without_num)\r\n \r\n # Update prev_max to the previous maximum\r\n prev_max = points_without_num\r\n \r\n return current_max\r\n\r\n# Read input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum points\r\nresult = max_points(n, a)\r\nprint(result)\r\n", "size = int(input())\r\nsteps = input().split()\r\nitem = 0\r\nwhile item < size:\r\n steps[item] = int(steps[item])\r\n item += 1\r\nmin_steps = min(steps)\r\nmax_steps = max(steps)\r\nnumber_of_steps = [0]*(max_steps-min_steps+2)\r\nitem = 0\r\nwhile item < size:\r\n number_of_steps[steps[item]-min_steps]+=1\r\n item += 1\r\nitem = 0\r\nwhile item < (max_steps-min_steps+1):\r\n number_of_steps[item] = number_of_steps[item]*(item+min_steps)\r\n item += 1\r\ncheck=[number_of_steps[0],max(number_of_steps[0],number_of_steps[1])]\r\nitem = 0\r\nwhile item < (max_steps-min_steps-1):\r\n check+=[max(check[len(check)-1],check[len(check)-2]+number_of_steps[len(check)])]\r\n item += 1\r\nprint(check[-1])", "# https://codeforces.com/problemset/problem/455/A\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ndp = [0]*(a[-1]+1)\r\nfor i in range(n):\r\n dp[a[i]] += a[i]\r\nfor i in range(2, a[-1]+1):\r\n dp[i] = max(dp[i-1], dp[i-2]+dp[i])\r\nprint(dp[-1])", "input()\r\ns=[int(x) for x in input().split()]\r\nA=[0]*(max(s)+1)\r\nfor x in s:\r\n\tA[x]+=x\r\n\r\ndp=[0]*(max(s)+1)\r\ndp[0]=A[0]\r\ndp[1]=A[1]\r\nfor i in range(2,len(dp)):\r\n\tdp[i]=max(dp[i-1],dp[i-2]+A[i])\r\nprint(max(dp))", "#author 沈天健 2300011417\r\nimport sys\r\ninput=sys.stdin.readline\r\nprint=sys.stdout.write\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\ncnt=[0]*(m+1)\r\ndp=[0]*(m+1)\r\nfor i in a:\r\n cnt[i]+=1\r\ndp[0]=0\r\ndp[1]=cnt[1]\r\nfor i in range(2,m+1):\r\n dp[i]=max(dp[i-1],dp[i-2]+cnt[i]*i)\r\nprint(str(dp[m]))\r\n\r\n", "\r\nn=int(input())\r\nnums=list(map(int,input().split()))\r\nnums=sorted(nums)\r\ng={}\r\nfor i in nums:\r\n if i in g:\r\n g[i]=g[i]+1\r\n else:\r\n g[i]=1\r\n\r\ndp=[0 for i in range(10**5+1)]\r\n# # print(g[0])\r\n# for key,value in g.items():\r\n# print(key,value)\r\n# if i-1 in g:\r\n# pass\r\n# dp[0]=nums[0]\r\n# check=[[nums[0],nums[0]]] # number,value\r\n# check[i]\r\n# set\r\nfor i in range(1,10**5+1):\r\n if i in g:\r\n dp[i]=max(dp[i-2]+i*g[i],dp[i-1])\r\n else:\r\n dp[i]=dp[i-1]\r\n# print(dp[:10])\r\nprint(dp[-1])\r\n# return dp[-1]", "n=int(input())\r\ncnt=[0 for i in range(100005)]\r\ndp=[0 for i in range(100005)]\r\narray=list(map(int,input().split()))\r\nfor i in range(n):\r\n cnt[array[i]]+=1\r\ndp[1]=1*cnt[1]\r\nfor i in range(2,100005):\r\n dp[i]=max(dp[i-2]+i*cnt[i],dp[i-1])\r\nprint(max(dp))", "#https://codeforces.com/problemset/problem/455/A\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na_dict = {}\r\nfor number in a:\r\n if number not in a_dict:\r\n a_dict[number] = 1\r\n else:\r\n a_dict[number] += 1\r\ntotal, temp_total = 0, 0\r\nfor x in range(1, 1+max(a_dict)):\r\n old_total, old_temp = total, temp_total\r\n total = max(old_total, old_temp)\r\n if(x in a_dict): \r\n temp_total = old_total + a_dict[x]*x\r\nprint(max(total,temp_total))", "#因为本题不涉及对输入数列元素顺序的要求，强调的是各个输入值的关系，因而按照各个值出现次数重构数列，只需要清楚一个值出现几次就可以。dp时，y受到y+-1的值的影响，与y+-2无关，因此进行动态规划即可。\r\nn=int(input())\r\nA=[0 for x in range(100010)]\r\nB=[0 for x in range(100010)]\r\nfor x in map(int,input().split()):\r\n B[x]+=1 \r\nfor y in range(1,100001):\r\n A[y]=max(B[y]*y+A[y-2],A[y-1])\r\nprint(max(A))\r\n \r\n", "# your code goes here\r\nn = int(input())\r\na = [0] * 100007\r\ndp = [0] * 100007\r\n\r\ndata = input().split()\r\nfor i in range(n):\r\n j = int(data[i])\r\n a[j] += 1\r\n\r\ndp[0] = 0\r\ndp[1] = a[1] # a[1]*1 = a[1]\r\n\r\nfor i in range(2, 100001): # Finding optimal points until the ith number\r\n dp[i] = max(dp[i - 1], dp[i - 2] + i * a[i])\r\n\r\nprint(dp[100000])\r\n", "n = int(input())\r\ng = list(map(int,input().split()))\r\nmas = [0 for i in range (100001)]\r\nfor i in range(0 , n):\r\n mas[g[i]] += g[i]\r\nf = 0 \r\ns = 0\r\nfor i in range (100001):\r\n f1 = f\r\n f = max(f , mas[i] + s)\r\n s = f1\r\nprint(f)\n# Wed Jul 12 2023 10:53:05 GMT+0300 (Moscow Standard Time)\n", "from collections import Counter\n\nN = int(input())\n \narr = list(map(int, input().split()))\n \nc = Counter(arr)\nmx = max(arr)\ndp = [0] * (mx + 1)\ndp[1] = c[1] \n \nfor i in range(2, mx + 1):\n dp[i] = max(i * c[i] + dp[i - 2], dp[i - 1])\n \nprint(dp[mx])", "input();z=[0]*7**6\r\nfor i in map(int,input().split()):z[i]+=i\r\na=b=0\r\nfor i in z:a,b=max(a,i+b),a\r\nprint(a)\r\n", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\ndp = [0]*100001\r\nfor i in x:\r\n dp[i] += 1\r\nfor i in range(2, 100001):\r\n dp[i] = max(dp[i-1], dp[i-2]+i*dp[i])\r\nprint(max(dp))", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\np=list(set(l))+[-1]\r\np.sort()\r\ndp=[0]\r\ndict={i:0 for i in p}\r\nfor i in range(len(l)):\r\n dict[l[i]]+=1\r\nfor i in range(1,len(p)):\r\n if p[i]==p[i-1]+1 and i>3:\r\n dp.append(max(dp[-2],dp[-3])+p[i]*dict[p[i]])\r\n elif p[i]==p[i-1]+1:\r\n\r\n dp.append(max(dp[:-1]) + p[i] * l.count(p[i]))\r\n elif i>3:\r\n dp.append(max(dp[-1],dp[-2],dp[-3]) + p[i] * dict[p[i]])\r\n else:\r\n dp.append(max(dp)+p[i]*dict[p[i]])\r\n\r\nprint(max(dp))", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\ncnt = Counter(nums)\r\nmx = max(nums)\r\nf = [0] * (mx + 1)\r\nf[1] = cnt[1]\r\nfor i in range(2, mx + 1):\r\n\tf[i] = max(f[i - 1], f[i - 2] + i * cnt[i])\r\nprint(f[-1])\r\n", "n = input()\r\ndp=[0]*7**6\r\nlst = list(map(int,input().split()))\r\nfor i in lst:\r\n dp[i] += i\r\n\r\na = b = 0\r\nfor i in dp:\r\n a,b=max(a,i+b),a\r\nprint(a)", "n = int(input())\r\narray = sorted([int(x) for x in input().split()])\r\nm = array[-1]\r\nlst = [0] * (m + 1)\r\ndp = [0] * (m + 1)\r\nfor i in range(n):\r\n lst[array[i]] += 1\r\ndp[1] = lst[1] * 1\r\nfor j in range(2,m + 1):\r\n dp[j] = max(dp[j - 1],dp[j - 2] + j * lst[j] )\r\nprint(dp[-1])", "n=int(input())\r\nnum=sorted([int(x) for x in input().split()])\r\ndp=[0]*(233333)\r\nc=[0]*233333\r\nfor _ in num:\r\n c[_]+=1\r\nfor i in range(1,100001):\r\n dp[i]=max(dp[i-1],dp[i-2]+i*c[i])\r\nprint(max(dp))\r\n" ]

[ "input()\r\ns = input()\r\n\r\nh, y = [], 0\r\nfor q in s:\r\n h.append(y)\r\n y += 2 * (q == '[') - 1\r\nm = 1 + 2 * max(h)\r\n\r\nf = lambda y: '+'.join((' ' * y, '|' * (m - 2 * y - 2), ' ' * y))\r\ng = lambda i, y: [f(y)] if s[i] == '[' else ([' ' * m] * 3 if s[i - 1] == '[' else []) + [f(y - 1)]\r\n\r\nfor t in zip(*sum((g(i, y) for i, y in enumerate(h)), [])):\r\n print(''.join(t).replace('+ ', '+-').replace(' +', '-+'))", "from itertools import groupby\r\n\r\nn = int(input())\r\nseq = list(input())\r\n\r\nanswer = []\r\nstack = []\r\ndepth = -1\r\nfor i in range(len(seq)):\r\n if seq[i] == '[':\r\n stack.append('[')\r\n depth += 2\r\n answer.append(depth)\r\n else:\r\n stack.pop()\r\n answer.append(depth)\r\n depth -= 2\r\n\r\n if len(stack) == 0:\r\n answer.append('*')\r\n\r\n# break down answer into nested lists using * separator\r\nanswer = [list(group) for k, group in groupby(answer, lambda x: x != \"*\") if k]\r\n\r\nmax_depth = 0\r\nfor i in range(len(answer)):\r\n if max_depth < max(answer[i]):\r\n max_depth = max(answer[i])\r\n\r\nfor i in range(len(answer)):\r\n answer[i] = [(max_depth + 1 - a) for a in answer[i]]\r\n\r\n# flatten\r\nanswer = [s for sub in answer for s in sub]\r\n\r\nout = \"\"\r\nstack = []\r\nfor i in range(len(answer)):\r\n line = \"\"\r\n\r\n if seq[i] == \"[\" and len(stack) == 0:\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n line += \"+\"\r\n line += \"|\" * answer[i]\r\n line += \"+\"\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n\r\n if seq[i + 1] == \"]\":\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n line += \"-\"\r\n line += \" \" * answer[i]\r\n line += \"-\"\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n\r\n stack.append(answer[i])\r\n elif seq[i] == \"[\" and len(stack) > 0:\r\n if seq[i - 1] == \"[\":\r\n line += \" \" * ((max_depth - answer[i] - 2) // 2)\r\n line += \"-\"\r\n else:\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n\r\n line += \"+\"\r\n line += \"|\" * answer[i]\r\n line += \"+\"\r\n\r\n if seq[i - 1] == \"[\":\r\n line += \"-\"\r\n line += \" \" * ((max_depth - answer[i] - 2) // 2)\r\n else:\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n\r\n if seq[i + 1] == \"]\":\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n line += \"-\"\r\n line += \" \" * answer[i]\r\n line += \"-\"\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n\r\n stack.append(answer[i])\r\n elif seq[i] == \"]\":\r\n if seq[i - 1] == \"[\":\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n line += \"-\"\r\n line += \" \" * answer[i]\r\n line += \"-\"\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n\r\n if i < len(answer) - 1 and seq[i + 1] == \"]\":\r\n line += \" \" * ((max_depth - answer[i] - 2) // 2)\r\n line += \"-\"\r\n line += \"+\"\r\n line += \"|\" * answer[i]\r\n line += \"+\"\r\n line += \"-\"\r\n line += \" \" * ((max_depth - answer[i] - 2) // 2)\r\n else:\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n line += \"+\"\r\n line += \"|\" * answer[i]\r\n line += \"+\"\r\n line += \" \" * ((max_depth - answer[i]) // 2)\r\n\r\n stack.pop()\r\n\r\n out += line\r\n\r\n# divide into chunks of size = max_depth + 2\r\nout = [out[i:i + max_depth + 2] for i in range(0, len(out), max_depth + 2)]\r\n\r\n# add a new line between - - and - -\r\ni = 0\r\nwhile i < len(out):\r\n if out[i].replace(\" \", \"\") == \"--\" and out[i + 1].replace(\" \", \"\") == \"--\":\r\n out.insert(i + 1, \" \" * len(out[i]))\r\n i += 1\r\n\r\nvertical = [list(r) for r in out]\r\n\r\n# horizontal printing\r\nfinal = \"\"\r\nfor i in range(len(vertical[0])):\r\n for j in range(len(vertical)):\r\n final += vertical[j][i]\r\n final += \"\\n\"\r\n\r\n# remove the trailing space\r\nfinal = final[:-1]\r\nprint(final)", "n=int(input())\ns=input()\ncur = 0\nm = -1\nfor c in s:\n\tif c == '[': cur+=1\n\telse:cur-=1\n\tm=max(m,2*cur+1)\ndouble=s.count('[]') # require extra space\n# [[][]][] -> 17 then 8+3*double\n# len(s)+3*double\ngrid = [[' '] * (n + 3 * double) for _ in range(m)]\nlevel = 0\nprev = ''\nEND = 0 # if [] then += 3\n#Each bracket separately\n#If [ then +- | +-\n#Else -+ | -+\n#Special case [] then put spaces +3\nfor c in s:\n\tif c == ']': level -=1\n\tif c == ']'and prev == '[': END += 3\n\t# grid[level][END] is top left i.e. plus sign\n\t# grid[m - level - 1][END] is plus sign bottom left\n\tgrid[level][END] = '+'\n\tgrid[m - level - 1][END] = '+'\n\tfor j in range(level + 1, m - level - 1):\n\t\tgrid[j][END] = '|' # vertical middle\n\t# horizontal -\n\t# if [ then +1 else -1\n\trtmp = END\n\tif c == '[':\n\t\trtmp += 1\n\telse:\n\t\trtmp -= 1\n\tgrid[level][rtmp] = '-'\n\tgrid[m-level-1][rtmp] = '-'\n\tif c=='[':level+=1\n\tprev=c\n\tEND+=1\n\nfor u in grid:\n\tprint (*u,sep='')" ]

[ "a = sorted(input())\r\nb = sorted(input(), reverse=True)\r\nn = len(a)\r\na = ''.join(a[:(n+1)//2])\r\nb = ''.join(b[:n//2])\r\nname = ['']*(len(a)+len(b))\r\n\r\nia = ib = ic = 0\r\nja = len(a)-1\r\njb = len(b)-1\r\njc = len(name)-1\r\nturn = 1\r\nwhile ic <= jc:\r\n if turn == 1:\r\n if ib > jb: name[ic] = a[ia]; ic+= 1\r\n elif a[ia] < b[ib]: name[ic] = a[ia]; ia+= 1; ic+= 1\r\n else: name[jc] = a[ja]; ja-= 1; jc-= 1\r\n else:\r\n if ia > ja: name[ic] = b[ib]; ic+= 1\r\n elif b[ib] > a[ia]: name[ic] = b[ib]; ib+= 1; ic+= 1\r\n else: name[jc] = b[jb]; jb-= 1; jc-= 1\r\n turn = 3-turn\r\nprint(''.join(name))", "import sys\r\nfrom math import sqrt\r\n\r\ndef solve():\r\n s = input() # Oleg's letters\r\n t = input() # Igor's letters\r\n n = len(s)\r\n\r\n s = sorted(s)[:(n + 1) // 2]\r\n t = sorted(t, reverse=True)[:n // 2]\r\n\r\n '''\r\n print(s)\r\n print(t)\r\n '''\r\n\r\n ans = [None] * n\r\n ansl = 0\r\n ansr = n - 1\r\n\r\n olgl = 0\r\n olgr = len(s) - 1\r\n igol = 0\r\n igor = len(t) - 1\r\n\r\n for i in range(n):\r\n if i % 2 == 0:\r\n if igol > igor or s[olgl] < t[igol]:\r\n ans[ansl] = s[olgl]\r\n ansl += 1\r\n olgl += 1\r\n else:\r\n ans[ansr] = s[olgr]\r\n ansr -= 1\r\n olgr -= 1\r\n pass\r\n else:\r\n if olgl > olgr or t[igol] > s[olgl]:\r\n ans[ansl] = t[igol]\r\n ansl += 1\r\n igol += 1\r\n else:\r\n ans[ansr] = t[igor]\r\n ansr -= 1\r\n igor -= 1\r\n pass\r\n\r\n # print(ans)\r\n\r\n ans = ''.join(ans)\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "a = sorted(input())\r\nb = sorted(input(), reverse=True)\r\nn = len(a)\r\na = ''.join(a[:(n+1)//2])\r\nb = ''.join(b[:n//2])\r\nname = [''] * (len(a) + len(b))\r\nia, ib, ic = 0, 0, 0\r\nja, jb, jc = len(a)-1, len(b)-1, len(name)-1\r\nturn = 1\r\nwhile ic <= jc:\r\n if turn == 1:\r\n if ib > jb: \r\n name[ic] = a[ia]\r\n ic += 1\r\n elif a[ia] < b[ib]: \r\n name[ic] = a[ia]\r\n ia += 1\r\n ic += 1\r\n else: \r\n name[jc] = a[ja]\r\n ja-= 1\r\n jc-= 1\r\n else:\r\n if ia > ja: \r\n name[ic] = b[ib]\r\n ic += 1\r\n elif b[ib] > a[ia]: \r\n name[ic] = b[ib]\r\n ib += 1\r\n ic += 1\r\n else: \r\n name[jc] = b[jb]\r\n jb -= 1\r\n jc -= 1\r\n turn = 1 - turn\r\nprint(''.join(name))\r\n", "from sys import stdin, stdout\r\na = stdin.readline().rstrip()\r\nb = stdin.readline().rstrip()\r\na_count = 26*[0]\r\nb_count = 26*[0]\r\nlength = len(a)\r\nfor i in range(length):\r\n a_count[ord(a[i]) - ord('a')] += 1\r\n b_count[ord(b[i]) - ord('a')] += 1\r\nresult = length * ['a']\r\nleft = 0\r\nright = length - 1\r\nmina, minb, maxa, maxb = 0, 0, 25, 25\r\nexclude = length//2\r\nfor i in range(25,-1,-1):\r\n if exclude <= 0:\r\n break\r\n while exclude >0 and a_count[i] !=0:\r\n exclude -= 1\r\n a_count[i] -= 1\r\nexclude = (length + 1) // 2\r\nfor i in range(26):\r\n if exclude <= 0:\r\n break\r\n while exclude >0 and b_count[i] != 0:\r\n exclude -= 1\r\n b_count[i] -= 1\r\n \r\nwhile a_count[mina] == 0 and mina < 25:\r\n mina += 1\r\nwhile b_count[minb] == 0 and minb < 25:\r\n minb += 1\r\nwhile a_count[maxa] == 0 and maxa > 0:\r\n maxa -= 1\r\nwhile b_count[maxb] == 0 and maxb > 0:\r\n maxb -= 1\r\ni = 0\r\nwhile i < length:\r\n if i & 1 == 0: # Alice \r\n if mina < maxb:\r\n result[left] = chr(ord('a')+mina)\r\n left += 1\r\n a_count[mina] -= 1\r\n while a_count[mina] == 0 and mina < 25:\r\n mina += 1 \r\n else:\r\n result[right] = chr(ord('a') + maxa)\r\n right -= 1\r\n a_count[maxa] -= 1\r\n while a_count[maxa] == 0 and maxa > 0:\r\n maxa -= 1\r\n else:\r\n if mina < maxb:\r\n result[left] = chr(ord('a')+maxb) \r\n left += 1\r\n b_count[maxb] -= 1\r\n while b_count[maxb] == 0 and maxb > 0:\r\n maxb -= 1\r\n else:\r\n result[right] = chr(ord('a') + minb)\r\n right -= 1\r\n b_count[minb] -= 1\r\n while b_count[minb] == 0 and minb < 25:\r\n minb += 1 \r\n i += 1\r\nprint(''.join(result))\r\n", "import sys\r\n\r\ndef main():\r\n s=sys.stdin.readline().rstrip()\r\n t=sys.stdin.readline().rstrip()\r\n \r\n result=[]\r\n \r\n iisl=0\r\n iisr=len(s)//2+len(s)%2-1\r\n iitl=0\r\n iitr=len(s)//2-1\r\n \r\n aas=list(sorted(list(s)))\r\n aat=list(sorted(list(t),reverse=True))\r\n rl=0\r\n rr=len(s)-1\r\n result=['?']*len(s)\r\n \r\n for i in range(len(s)):\r\n if i%2==0:\r\n if aas[iisl]<aat[iitl]:\r\n result[rl]=aas[iisl]\r\n iisl+=1\r\n rl+=1\r\n else:\r\n result[rr]=aas[iisr]\r\n iisr-=1\r\n rr-=1\r\n else:\r\n if aat[iitl]>aas[iisl]:\r\n result[rl]=aat[iitl]\r\n iitl+=1\r\n rl+=1\r\n else:\r\n result[rr]=aat[iitr]\r\n iitr-=1\r\n rr-=1\r\n \r\n sys.stdout.write(''.join(result)+'\\n')\r\n \r\nmain()\r\n\r\n", "'''from random import *\r\n\r\ntest = 10\r\nfor i in range(test):\r\n\r\nnew_in = open('0' * (3 - len(str(i + 1))) + str(i + 1) + \".in\", 'w')\r\nnew_out = open('0' * (3 - len(str(i + 1))) + str(i + 1) + \".out\", 'w')\r\n\r\nn = randint(1, 10)'''\r\na = [x for x in input()]\r\nb = [x for x in input()]\r\np = [''] * 300003\r\nn = len(a)\r\n\r\na.sort()\r\nb.sort(reverse=True)\r\n\r\n'''for i in range(n):\r\n\ta.append(chr(randint(0, 25) + 97))\r\n\tb.append(chr(randint(0, 25) + 97))\r\n'''\r\nx = 0\r\ny = (n+1) // 2\r\nr = n\r\nu = 0\r\nv = n // 2\r\nl = 0\r\nfor ii in range(n):\r\n\tif (ii % 2):\r\n\t\tif a[x] < b[u]:\r\n\t\t\tp[l] = b[u]\r\n\t\t\tl, u = l + 1, u + 1\r\n\t\telse:\r\n\t\t\tr -= 1\r\n\t\t\tv -= 1\r\n\t\t\tp[r] = b[v]\r\n\telse:\r\n\t\tif a[x] < b[u]:\r\n\t\t\tp[l] = a[x]\r\n\t\t\tl += 1\r\n\t\t\tx += 1\r\n\t\telse:\r\n\t\t\tr -= 1\r\n\t\t\ty -= 1\r\n\t\t\tp[r] = a[y]\r\n'''new_out.write(''.join([p[jj] for jj in range(n)]))\r\nnew_in.write(str(''.join(a)) + '\\n' + str(''.join(b)))\r\n\r\nnew_in.close()\r\nnew_out.close()'''\r\nprint(''.join([p[jj] for jj in range(n)]))", "from sys import *\r\nf = lambda: sorted(stdin.readline()[:-1])\r\nt = [f()[::-1], f()]\r\nn = len(t[0])\r\np = [n & 1, 1]\r\ns = ''\r\nfor i in range(n):\r\n k = t[0][-1] < t[1][-1]\r\n p[k] ^= 1\r\n s += t[p[k]].pop()\r\nprint(s)", "a = list(input())\r\nb = list(input())\r\nname = [None for _ in range(len(a))]\r\n\r\na.sort()\r\nb.sort(reverse=True)\r\n\r\n\r\nai = 0\r\naj = (len(a)+1)//2 - 1\r\nbi = 0\r\nbj = len(b)//2 - 1\r\n\r\nturn = 0 # 0 -> player A\r\nansi = 0\r\nansj = len(name)-1\r\n#print(a, b, ai, aj, bi, bj)\r\nfor _ in range(len(name)):\r\n if not turn:\r\n\r\n if a[ai] < b[bi]:\r\n name[ansi] = a[ai]\r\n ai += 1\r\n ansi += 1\r\n\r\n else:\r\n name[ansj] = a[aj]\r\n aj -= 1\r\n ansj -= 1\r\n\r\n else:\r\n\r\n if b[bi] > a[ai]:\r\n name[ansi] = b[bi]\r\n bi += 1\r\n ansi += 1\r\n\r\n else:\r\n name[ansj] = b[bj]\r\n bj -= 1\r\n ansj -= 1\r\n\r\n turn ^= 1\r\n\r\nprint(''.join(name))\r\n", "from sys import stdin\r\nfrom collections import deque\r\na = list(str(stdin.readline().strip()))\r\nb = list(str(stdin.readline().strip()))\r\nn = len(a)\r\na.sort()\r\nb.sort()\r\nb.reverse()\r\na = deque(a[:(n+1)//2])\r\nb = deque(b[:n//2])\r\nresult = ['?']*n\r\ntotoro = n-1\r\nblue = 0\r\nfor i in range(n):\r\n if len(a)==0:\r\n for i2 in range(n):\r\n if result[i2]=='?':\r\n result[i2]=b.popleft()\r\n break\r\n if len(b)==0:\r\n for i2 in range(n):\r\n if result[i2]=='?':\r\n result[i2] = a.popleft()\r\n break\r\n if i%2==0:\r\n if b[0] <= a[0]:\r\n result[totoro]=a.pop()\r\n totoro-=1\r\n else:\r\n result[blue] = a.popleft()\r\n blue+=1\r\n else:\r\n if a[0] >= b[0]:\r\n result[totoro]=b.pop()\r\n totoro-=1\r\n else:\r\n result[blue] = b.popleft()\r\n blue+=1\r\nprint(''.join(result))", "s1 = input()\ns2 = input()\nn = len(s1)\ns1 = sorted(s1)\ns2 = sorted(s2)[::-1]\ni = 0\nj = 0\nres = [\"?\"]*n\nrear = n-1\nfront = 0\nn1 = (n+1)//2 - 1\nn2 = n//2 - 1\n\nfor k in range(n):\n if k & 1 == 0:\n if s1[i] < s2[j]:\n res[front] = s1[i]\n front += 1\n i += 1\n else:\n res[rear] = s1[n1]\n rear -= 1\n n1 -= 1\n else:\n if s1[i] < s2[j]:\n res[front] = s2[j]\n front += 1\n j += 1\n else:\n res[rear] = s2[n2]\n rear -= 1\n n2 -= 1\n\nprint(\"\".join(res))", "a = list(input())\r\nb = list(input())\r\na.sort()\r\nb.sort(reverse=True)\r\nans = list()\r\nfor i in a:\r\n ans.append(\"a\") \r\nlen1 = len(a)//2 - 1\r\nlen2 = len(a)//2 - 1\r\nif len(a)%2:\r\n len1 = len1 + 1\r\ni = 0 # first\r\nj = 0 # end\r\nflag = 0\r\nai = 0\r\naj = 0\r\nbi = 0\r\nbj = 0\r\nwhile i + j < len(a):\r\n if i + j < len(a):\r\n if a[ai] < b[bi] and flag == 0:\r\n ans[i] = a[ai]\r\n i = i + 1\r\n ai = ai + 1\r\n else:\r\n ans[len(a)-j-1] = a[len1 - aj]\r\n j = j + 1\r\n aj = aj + 1\r\n flag = 1\r\n if i + j < len(a):\r\n if a[ai] < b[bi] and flag == 0:\r\n ans[i] = b[bi]\r\n i = i + 1\r\n bi = bi + 1\r\n else:\r\n ans[len(a)-j-1] = b[len2 - bj]\r\n j = j + 1\r\n bj = bj + 1\r\n flag = 1\r\nprint(\"\".join(ans))", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\na = list(input())\nb = list(input())\n\na.sort( )\nb.sort(reverse=True )\nn = len(a)\nans = ['' for i in range(n)]\nai = 0\nbi = 0\naj = 0\nbj = 0\naiend = n//2 -1\nif n%2:\n aiend += 1\nbiend = n//2 -1\ni = 0\nj = 0\nflag = 0\nwhile i + j < n:\n if i + j < n:\n if a[ai] < b[bi] and flag ==0:\n ans[i] = a[ai]\n i+=1\n ai+=1\n else:\n ans[n-j-1] = a[aiend-aj]\n j+=1\n aj+=1\n flag = 1\n if i + j < n:\n if a[ai] < b[bi] and flag ==0:\n ans[i] = b[bi]\n i+=1\n bi+=1\n else:\n ans[n-j-1] = b[biend-bj]\n j+=1\n bj+=1\n flag = 1\nprint(\"\".join(ans))", "str1 = list(input())\r\nstr2 = list(input())\r\nstr1.sort()\r\nstr2.sort(reverse=True)\r\nn = len(str1)\r\nstr = ['?'] * n\r\ni, j, ni, nj = 0, 0, (n + 1) // 2 - 1, n // 2 - 1\r\nfront, rear = 0, n - 1\r\nfor cur in range(n):\r\n if cur & 1 == 0:\r\n if (str1[i] < str2[j]):\r\n str[front] = str1[i]\r\n i += 1\r\n front += 1\r\n else:\r\n str[rear] = str1[ni]\r\n ni -= 1\r\n rear -= 1\r\n else:\r\n if (str1[i] < str2[j]):\r\n str[front] = str2[j]\r\n j += 1\r\n front += 1\r\n else:\r\n str[rear] = str2[nj]\r\n nj -= 1\r\n rear -= 1\r\n\r\nprint(''.join(str))\r\n", "\"\"\"import string\r\n\r\nigor = input()\r\noleg = input()\r\n\r\nigor = [x for x in igor]\r\noleg = [x for x in oleg]\r\n\r\nalphabet = list(string.ascii_lowercase)\r\n\r\ndef maxPosition(x):\r\n maxposition = 0\r\n for i in x:\r\n position = alphabet.index(i)\r\n if position>maxposition:\r\n maxposition = position\r\n return maxposition\r\n\r\ndef minPosition(x):\r\n minposition = 25\r\n for i in x:\r\n position = alphabet.index(i)\r\n if position<minposition:\r\n minposition = position\r\n return minposition\r\n\r\na =['b','c','d']\r\n\r\n\r\nleft= 0\r\nright= len(oleg)\r\noutput = ['?' for i in range(len(oleg))]\r\n\r\nfor i in range(len(igor)):\r\n #igor turn\r\n #put the smallest word posible\r\n if i%2 != 0:\r\n #igor has the smallest word\r\n if minPosition(igor)<minPosition(oleg):\r\n alphabetletter = alphabet[minPosition(igor)]\r\n output[left] = alphabetletter\r\n left += 1\r\n igor.pop(igor.index(alphabetletter))\r\n i+=1\r\n elif minPosition(igor)>maxPosition(oleg):\r\n output[right] = igor[maxPosition(igor)]\r\n right -= 1\r\n igor.pop(maxPosition(igor))\r\n #oleg turn\r\n elif i%2 == 0:\r\n if maxPosition(igor)<maxPosition(oleg):\r\n output[left] = oleg[maxPosition(oleg)]\r\n left += 1\r\n oleg.pop(oleg[maxPosition(igor)])\r\n i+=1\r\n elif minPosition(igor)>maxPosition(oleg):\r\n output[right] = igor[minPosition(oleg)]\r\n right -= 1\r\n igor.pop(minPosition(oleg))\r\n\r\nprint(output)\"\"\"\r\n\r\na = list(input())\r\nb = list(input())\r\n\r\na.sort()\r\nb.sort(reverse=True)\r\n\r\nans = list()\r\nfor i in a:\r\n ans.append(\"a\")\r\n\r\nlen1 = len(a)//2 - 1\r\nlen2 = len(a)//2 - 1\r\n\r\nif len(a)%2:\r\n len1 = len1 + 1#whats the point\r\n\r\n\r\ni = 0 # first\r\nj = 0 # end\r\n\r\n#what does all this represent\r\nflag = 0#???\r\nai = 0#left position of a\r\naj = 0#right position\r\nbi = 0#left position of b\r\nbj = 0#right position\r\n\r\nwhile i + j < len(a):\r\n if i + j < len(a):\r\n if a[ai] < b[bi] and flag == 0:#smallest of a is smaller then the smallest of b\r\n ans[i] = a[ai] #left side of ans will take on smallest of a\r\n i = i + 1\r\n ai = ai + 1\r\n else: #smallest of a is bigger then the smallest of b\r\n ans[len(a)-j-1] = a[len1 - aj]\r\n j = j + 1#right +1\r\n aj = aj + 1#right a + 1\r\n flag = 1 #???flag\r\n if i + j < len(a):\r\n if a[ai] < b[bi] and flag == 0: #smallest of a is smaller then the smallest of b\r\n ans[i] = b[bi] #left side of ans will take on the smallest of b\r\n i = i + 1 #move on to next position of ans\r\n bi = bi + 1\r\n else: ##smallest of a is bigger then the smallest of b\r\n ans[len(a)-j-1] = b[len2 - bj] #rightmost position of ans\r\n # will take on the rightmost position of b\r\n j = j + 1 #move on to the left side position of ans\r\n bj = bj + 1 #move on to the left side position of b\r\n flag = 1 #\r\n\r\nprint(\"\".join(ans))\r\n\r\n", "import sys\r\nimport heapq\r\nimport math\r\n\r\na = []\r\nb = []\r\n\r\n\r\ndef read_line(arr):\r\n while True:\r\n c = sys.stdin.read(1)\r\n if c == '\\n' or c == '':\r\n break\r\n heapq.heappush(arr, c)\r\n\r\n\r\ns = []\r\nr = []\r\nread_line(a)\r\nread_line(b)\r\nn = len(a)\r\n\r\na = heapq.nsmallest(math.ceil(n / 2), a)\r\nb = heapq.nlargest(math.floor(n / 2), b)\r\nleft = [0, 0]\r\nright = [-1, -1]\r\nfor i in range(n):\r\n turn = i % 2\r\n arr = a if turn == 0 else b\r\n if i == n - 1 or a[left[0]] < b[left[1]]:\r\n s.append(arr[left[turn]])\r\n left[turn] += 1\r\n\r\n else:\r\n r.append(arr[right[turn]])\r\n right[turn] -= 1\r\nfor i in s:\r\n print(i, end='')\r\nfor i in range(len(r)):\r\n print(r[~i], end='')\r\n" ]

[ "#!/usr/bin/env python3 \r\n\r\ntree = input().strip()\r\n\r\ndef get_answer(tree, start_index = 0, prev = []):\r\n colon_index = tree.find(':', start_index)\r\n period_index = tree.find('.', start_index)\r\n name_end_index = colon_index if ((colon_index != -1) and (colon_index < period_index)) else period_index\r\n name = tree[start_index:name_end_index]\r\n answer = prev.count(name)\r\n if ((colon_index == -1) or (period_index < colon_index)):\r\n return (answer, period_index+1)\r\n else:\r\n # Recurse\r\n prev_names = prev + [name]\r\n next_start = colon_index\r\n while tree[next_start] != '.':\r\n (sub_answer, next_start) = get_answer(tree, next_start+1, prev_names)\r\n answer += sub_answer\r\n return (answer, next_start+1)\r\n\r\nprint(get_answer(tree)[0])", "import sys\r\nfrom array import array # noqa: F401\r\nfrom collections import Counter\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nclass Employee(object):\r\n def __init__(self, name: str):\r\n self.name = name\r\n self.sub = []\r\n\r\n def add_sub(self, sub: 'Employee'):\r\n self.sub.append(sub)\r\n\r\n def __repr__(self):\r\n return self.name\r\n\r\n\r\nstack = [Employee('*** God ***')] # type: list[Employee]\r\ns = input().rstrip()\r\nn, l = len(s), 0\r\n\r\nwhile l < n:\r\n if s[l] == '.':\r\n stack.pop()\r\n l += 1\r\n continue\r\n if s[l] == ',':\r\n l += 1\r\n continue\r\n r = l\r\n while 65 <= ord(s[r]) <= 90:\r\n r += 1\r\n e = Employee(s[l:r])\r\n if stack:\r\n stack[-1].add_sub(e)\r\n if s[r] == ':':\r\n stack.append(e)\r\n l = r + 1\r\n\r\n\r\ndef rec(e: Employee):\r\n count = 0\r\n name_dict = Counter()\r\n\r\n for sub in e.sub:\r\n cnt, d = rec(sub)\r\n count += cnt\r\n for k, v in d.items():\r\n name_dict[k] += v\r\n\r\n count += name_dict[e.name]\r\n name_dict[e.name] += 1\r\n return count, name_dict\r\n\r\n\r\nprint(rec(stack[0])[0])\r\n", "######directed\r\ndef dfs(graph,n,currnode,match):\r\n visited=[False for x in range(n+1)]\r\n stack=[currnode]\r\n ans=0\r\n while stack:\r\n currnode=stack[-1]\r\n if visited[currnode]==False:\r\n visited[currnode]=True\r\n if arr[currnode]==match:ans+=1\r\n if currnode in graph:\r\n for neighbour in graph[currnode]:\r\n if visited[neighbour]==False:\r\n visited[neighbour]=True\r\n stack.append(neighbour)\r\n if arr[neighbour]==match:ans+=1\r\n break #####if we remove break it becomes bfs\r\n else:\r\n stack.pop() ####we are backtracking to previous node which is in our stack\r\n else:\r\n stack.pop()\r\n return ans\r\ndef buildgraph(arr):\r\n graph={}\r\n currnode=0\r\n graph[0]=[]\r\n parent=[None for x in range(len(arr))]\r\n i=2\r\n while i in range(1,len(arr)):\r\n if arr[i] not in look:\r\n if currnode in graph:\r\n graph[currnode].append(i)\r\n else:\r\n graph[currnode]=[i]\r\n parent[i]=currnode\r\n if arr[i+1]==\":\":\r\n currnode=i\r\n i+=2\r\n else:\r\n if arr[i]==\".\":\r\n currnode=parent[currnode]\r\n i+=1\r\n return graph,parent\r\n\r\n###main code\r\ns=input()\r\narr=[]\r\ndict={}\r\nlook={\".\",\":\",\",\"}\r\nname=\"\"\r\nfor i in range(len(s)):\r\n if s[i] not in look:\r\n name+=s[i]\r\n else:\r\n if name!=\"\":\r\n arr.append(name)\r\n name=\"\"\r\n arr.append(s[i])\r\n else:\r\n arr.append(s[i])\r\n\r\nif len(arr)>2:\r\n count=0\r\n graph,parent=buildgraph(arr)\r\n for i in range(len(arr)):\r\n if arr[i] not in look:\r\n count+=dfs(graph,len(arr),i,arr[i])\r\n count-=1\r\n print(count)\r\nelse:\r\n print(0)\r\n\r\n\r\n", "s = input()\r\na = []\r\ncnt = 0\r\ns = ':' + s\r\ns1 = ''\r\nflag = False\r\nfor i in range(len(s)):\r\n if flag:\r\n if s[i] != '.' and s[i] != ':' and s[i] != ',':\r\n s1 += s[i]\r\n continue\r\n else:\r\n a.append(s1)\r\n flag = False\r\n for j in range(len(a) - 1):\r\n if a[j] == a[-1]:\r\n cnt += 1\r\n if s[i] != '.' and s[i] != ':' and s[i] != ',':\r\n flag = True\r\n s1 = s[i]\r\n elif s[i] == '.':\r\n a.pop()\r\nprint(cnt)", "def main():\r\n alpha = \"QWERTYUIOPLKJHGFDSAZXCVBNM\"\r\n s = input()\r\n n = len(s)\r\n i = 0\r\n st = [\"root-0\"]\r\n name = \"\"\r\n ans = 0\r\n first = True\r\n while i < n:\r\n j = i\r\n if s[i] in alpha:\r\n while j+1 < n and s[j+1] in alpha:\r\n j += 1\r\n name = s[i:j+1]\r\n first = True\r\n i = j\r\n ans += st.count(name)\r\n elif s[i] == \":\":\r\n first = True\r\n st.append(name)\r\n elif s[i] == ',':\r\n first = True\r\n elif s[i] == '.' and first:\r\n first = False\r\n else:\r\n st.pop(-1)\r\n i += 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import time\r\nstartTimeProblem=time.time()\r\n\r\nimport fileinput, sys, itertools, functools\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom collections import *\r\n\r\ndef lcm(a, b): \r\n return (a*b)/gcd(a, b)\r\n\r\nclass InputHelper:\r\n def __init__(self):\r\n self.myinput = fileinput.input()\r\n\r\n def isLocal(self):\r\n return not fileinput.isstdin()\r\n\r\n def int(self):\r\n return int(self.myinput.readline().rstrip())\r\n\r\n def ints(self):\r\n return [int(_) for _ in self.myinput.readline().rstrip().split()]\r\n\r\n def str(self):\r\n return self.myinput.readline().rstrip()\r\n\r\n def strs(self):\r\n return [_ for _ in self.myinput.readline().rstrip().split()]\r\n\r\nclass OutputHelper:\r\n def int(self, a):\r\n print(a) \r\n\r\n def ints(self, a): \r\n print(\" \".join([str(_) for _ in a]))\r\n \r\n def intsNL(self, a):\r\n for _ in a:\r\n print(_)\r\n \r\n def str(self, s):\r\n print(s)\r\n\r\n def strs(self, s):\r\n print(\" \".join([_ for _ in s]))\r\n\r\n def strsNL(self, s):\r\n for st in s:\r\n print(st)\r\n\r\nclass ListNode:\r\n def __init__(self, val):\r\n self.val = val\r\n self.next = None\r\n self.prev = None\r\n\r\nIn = InputHelper()\r\nOut = OutputHelper()\r\n\r\n######################################\r\n\r\nclass Solution: \r\n #MIKE:MAX.,ARTEM:MIKE..,DMITRY:DMITRY.,DMITRY...\r\n def rec(self):\r\n myname = []\r\n leaf = True\r\n\r\n while self.i < len(self.s):\r\n el = self.s[self.i]\r\n self.i+=1\r\n\r\n if el==\".\":\r\n myname = \"\".join(myname)\r\n\r\n if not leaf:\r\n self.visited[myname]-=1\r\n \r\n self.ans += self.visited[myname] \r\n \r\n return \r\n\r\n elif el==\":\":\r\n leaf = False\r\n myname = \"\".join(myname)\r\n self.visited[myname]+=1\r\n self.rec()\r\n\r\n elif el==\",\":\r\n self.rec()\r\n else:\r\n myname.append(el)\r\n\r\n def solve(self):\r\n self.s = In.str()\r\n self.visited = defaultdict(int)\r\n self.i = 0\r\n self.ans = 0\r\n\r\n self.rec()\r\n \r\nsol = Solution() \r\nsol.solve()\r\n\r\nOut.int(sol.ans)\r\n\r\n\r\n######################################\r\n\r\nif len(sys.argv)>2 and sys.argv[2]==\"TIMEIT\":\r\n fin = (time.time()-startTimeProblem)*1000\r\n print(\"{:.2f}\".format(fin) + \"ms\")", "def P():\r\n\tn=a[0];a.pop(0);d={n:1};r=0\r\n\twhile a[0]!='.':\r\n\t\ta.pop(0);l,t=P();r+=l\r\n\t\tfor k in t.keys():\r\n\t\t\td[k]=d.get(k,0)+t[k]\r\n\t\t\tif k==n:r+=t[k]\r\n\ta.pop(0)\r\n\treturn r,d\r\na=[]\r\nx=''\r\nfor i in input():\r\n\tif i in ':.,':\r\n\t\tif x:a+=[x]\r\n\t\ta+=[i];x=''\r\n\telse:x+=i\r\nprint(P()[0])", "try:\r\n import sys\r\n from functools import lru_cache, cmp_to_key\r\n from heapq import merge, heapify, heappop, heappush\r\n from math import *\r\n from collections import defaultdict as dd, deque, Counter as C\r\n from itertools import combinations as comb, permutations as perm\r\n from bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\n from time import perf_counter\r\n from fractions import Fraction\r\n import copy\r\n from copy import deepcopy\r\n import time\r\n starttime = time.time()\r\n mod = int(pow(10, 9) + 7)\r\n mod2 = 998244353\r\n\r\n def data(): return sys.stdin.readline().strip()\r\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\n def L(): return list(sp())\r\n def sl(): return list(ssp())\r\n def sp(): return map(int, data().split())\r\n def ssp(): return map(str, data().split())\r\n def l1d(n, val=0): return [val for i in range(n)]\r\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\n\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n # from sys import stdin\r\n # input = stdin.buffer.readline\r\n # I = lambda : list(map(int,input().split()))\r\n # import sys\r\n # input=sys.stdin.readline\r\n\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\n\r\n\r\ndef P():\r\n n=a[0];a.pop(0);d={n:1};r=0\r\n while a[0]!='.':\r\n a.pop(0);l,t=P();r+=l\r\n for k in t.keys():\r\n d[k]=d.get(k,0)+t[k]\r\n if k==n:r+=t[k]\r\n a.pop(0)\r\n # print(a,r,d)\r\n return r,d\r\na=[]\r\nx=''\r\nfor i in input():\r\n if i in ':.,':\r\n if x:a+=[x]\r\n a+=[i];x=''\r\n else:x+=i\r\n\r\nprint(P()[0])" ]

[ "from sys import stdin, stdout\r\n\r\nint_in = lambda: int(stdin.readline())\r\narr_in = lambda: [int(x) for x in stdin.readline().split()]\r\nmat_in = lambda rows: [arr_in() for _ in range(rows)]\r\nstr_in = lambda: stdin.readline().strip()\r\nout = lambda o: stdout.write(\"{}\\n\".format(o))\r\narr_out = lambda o: out(\" \".join(map(str, o)))\r\nbool_out = lambda o: out(\"YES\" if o else \"NO\")\r\ntests = lambda: range(1, int_in() + 1)\r\ncase_out = lambda i, o: out(\"Case #{}: {}\".format(i, o))\r\n\r\nimport math\r\ndef solve(a, b):\r\n result = float(\"inf\")\r\n # b is the peak\r\n if a % b == 0:\r\n if (a // b) % 2 == 1:\r\n result = min(result, b)\r\n \r\n # (a, b) is part of the upward slope\r\n x_intercept = a - b\r\n if x_intercept == 0:\r\n assert result != float(\"inf\")\r\n else:\r\n i = math.floor(x_intercept / (2*b))\r\n if i > 0:\r\n size = x_intercept / (2*i)\r\n result = min(result, size)\r\n\r\n # (a, b) is part of the downward slope\r\n x_intercept = a + b\r\n i = math.floor(x_intercept / (2*b))\r\n if i > 0:\r\n size = x_intercept / (2*i)\r\n result = min(result, size)\r\n\r\n return -1 if result == float(\"inf\") else result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a, b = arr_in()\r\n out(solve(a, b))", "def main():\n a, b = map(int, input().split())\n n = a // b\n if n:\n n -= n + 1 & 1\n print(\"{:.12f}\".format((a + b) / (n + 1)))\n else:\n print(\"-1\")\n\n\nif __name__ == '__main__':\n main()\n", "a,b=map(float,input().split())\r\nif b>a :\r\n print(-1)\r\n exit()\r\nv=((a+b)/2)/((a+b)//(2*b))\r\nprint(v);\r\n", "a,b=map(int,input().split())\r\nif b > a:\r\n print(-1)\r\nelif b == a:\r\n print(a)\r\nelse:\r\n print(( (a+b) / 2 ) / ( (a+b) // (2*b) ))", "a, b = [int(i) for i in input().split()]\r\n\r\nif a<b:\r\n print(-1)\r\nelse:\r\n opt1 = (a-b)//b\r\n if opt1&1:\r\n opt1 -= 1\r\n opt2 = (a+b)//b\r\n if opt2&1:\r\n opt2 -= 1\r\n if opt1 == 0:\r\n print((a+b)/opt2)\r\n elif opt2 == 0:\r\n print((a-b)/opt1)\r\n else:\r\n print(min((a-b)/opt1, (a+b)/opt2))\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 10/10/2023 23:18:12 Hanoi, Vietnam\r\n# **/\r\n\r\na, b = map(int, input().split())\r\nif a < b:\r\n exit(print(-1))\r\nk = (a/b + 1) // 2\r\nprint((a + b) / (2 * k))", "a, b=[int(k) for k in input().split()]\r\nif b>a:\r\n print(-1)\r\nelse:\r\n if (a%b)==0 and (a//b)%2==1:\r\n print(b)\r\n else:\r\n c=(a//b-1)//2*2+1\r\n #print(c)\r\n #x-(a-c*x)=b\r\n #x+cx-a=b\r\n x=(a+b)/(1+c)\r\n print(x)\r\n\r\n \r\n#/\\/\\/\\/\\/\\/\\", "x,y=[int(e) for e in input().split()]\r\nif x<y:\r\n print(-1)\r\nelse:\r\n x0=x/y\r\n L=1\r\n R=(x0+1)//2\r\n while R>L+1:\r\n M=(L+R)//2\r\n if (x0+1)/(2*M)>=1:\r\n L=M\r\n else:\r\n R=M\r\n n=L\r\n if (x0+1)/(2*R)>=1:\r\n n=R\r\n print(y*(x0+1)/(2*n))", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nX,Y = map(int,input().split())\n\nk1,k2 = (Y+X)//(Y+Y),(Y-X)//(Y+Y)\nx1,x2 = -1,-1\nif k1>0:\n x1 = (Y+X)/(k1+k1)\nif k2>0:\n x2 = (Y-X)/(k2+k2)\n\nif x1!=-1 and x2!=-1:\n print(min(x1,x2))\nelif x1!=-1:\n print(x1)\nelse:\n print(-1)\n\n\n\n", "a, b = map(int, input().split())\r\nprint(-1 if a < b else (a + b) / (a // b + (a // b) % 2))", "import math\r\na,b=map(float, input().split())\r\nprint ( -1 if b>a else(((a+b)/2)/math.floor(((a+b)/2)/b)))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import *\r\n\r\na,b = map(int, input().split())\r\nif a<b:\r\n exit(print(-1))\r\n\r\nif a==b:\r\n exit(print(a))\r\n \r\n\r\ndef deal(n,b):\r\n l,r=1,10**9+1\r\n while l+1<r:\r\n m = (l+r)//2\r\n if n/(m+m)>=b:\r\n l = m\r\n else:\r\n r = m\r\n \r\n ans = n/(l+l)\r\n if ans>=b:\r\n return ans\r\n return float('inf')\r\n \r\na1 = deal(a-b,b)\r\na2 = deal(a+b,b)\r\nans = min(a1,a2)\r\nif ans==float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n ", "ent = input().split()\r\nx = int(ent[0])\r\ny = int(ent[1])\r\n\r\nqn = ((x + y)/(2 * y)).__trunc__()\r\nif qn == 0:\r\n print(-1)\r\nelse:\r\n n = (x + y)/(2 * qn)\r\n print(n)\r\n", "s, o= map(int, input ().split ())\n\n# A Pollyyyyy\n# A polyy 578\nprint (-1 if o>s else ((s+o)/2)/ ((s+o)//(2*o)))\n \t \t \t\t\t\t \t \t\t\t \t \t", "a,b=(int(i) for i in input().split())\r\nif (a<b):\r\n print(-1)\r\nelif (a==b):\r\n print(a)\r\nelse:\r\n i1=(a+b)//(2*b)\r\n i2=(a-b)//(2*b)\r\n if i2==0:\r\n print((a+b)/(2*i1))\r\n else:\r\n p=(a+b)/2\r\n q=(a-b)/2\r\n print(min(p/i1,q/i2))", "n,m=map(int,input().split())\r\nif m>n:print(-1)\r\nelse:\r\n\tq=int((1.+n/m)/2.)\r\n\tv=(m+n)/(2*q)\r\n\tprint(v)", "n,k=map(int,input().split())\r\nif k>n:\r\n print(-1)\r\nelif k==n:\r\n print(k)\r\nelse:\r\n #A\r\n diff=n-k\r\n diff/=2\r\n mod=int(diff/k)\r\n if mod==0:\r\n A=-1\r\n else:\r\n A=diff/mod\r\n #B\r\n summ=n+k\r\n summ/=2\r\n mod=int(summ/k)\r\n if mod==0:\r\n B-1\r\n else:\r\n B=summ/mod\r\n if A==-1:\r\n print(B)\r\n elif B==-1:\r\n print(A)\r\n else:\r\n print(min(A,B))", "#!/usr/bin/env python3\nimport collections, itertools, fractions, functools, heapq, math, queue\n\ndef solve():\n a, b = map(int, input().split())\n if a < b:\n return -1\n return (a+b)/(2*((a+b)//(2*b)))\n\nif __name__ == '__main__':\n print(solve())\n\n", "def run1(x, y):\r\n if x < y:\r\n return -1;\r\n cst = (x - y) * 0.5;\r\n l = 1; r = 1000000001;\r\n ans = - 1.0;\r\n while(l <= r):\r\n m = (l + r) >> 1;\r\n now = cst / m;\r\n if now >= y:\r\n ans = now;\r\n l = m + 1;\r\n else:\r\n r = m - 1;\r\n return ans;\r\n\r\ndef run2(x, y):\r\n cst = (x + y) * 0.5;\r\n l = 1; r = 1000000001;\r\n ans = - 1.0;\r\n while(l <= r):\r\n m = (l + r) >> 1;\r\n now = cst / m;\r\n if( now >= y ):\r\n ans = now;\r\n l = m + 1;\r\n else:\r\n r = m - 1;\r\n return ans;\r\n\r\nx, y = map(int, input().split());\r\np = run1(x, y);\r\nq = run2(x, y);\r\n\r\nans = - 1.0;\r\n\r\nif(ans < 0 or (p > 0 and p < ans) ):\r\n ans = p;\r\nif(ans < 0 or (q > 0 and q < ans) ):\r\n ans = q;\r\nprint (ans)\r\n\r\n\r\n", "#!/usr/bin/env python\n# 579C_polyline.py - Codeforces.com/problemset/problem/579/C by Sergey 2015\n\nimport unittest\nimport sys\n\n###############################################################################\n# Polyline Class (Main Program)\n###############################################################################\n\n\nclass Polyline:\n \"\"\" Polyline 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.a, self.b] = map(int, uinput().split())\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n result = float(1)\n\n if self.a < self.b:\n return \"-1\"\n\n if self.a == self.b:\n return str(\"{0:.12f}\".format(self.b))\n\n r1 = (self.a + self.b) / (2 * int((self.a + self.b) / (2 * self.b)))\n d = (2 * int((self.a - self.b) / (2 * self.b)))\n result = r1 if d == 0 else min(r1, (self.a - self.b) / d)\n return str(\"{0:.12f}\".format(result))\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_single_test(self):\n \"\"\" Polyline class testing \"\"\"\n\n # Constructor test\n test = \"3 1\"\n d = Polyline(test)\n self.assertEqual(d.a, 3)\n self.assertEqual(d.b, 1)\n\n # Sample test\n self.assertEqual(Polyline(test).calculate(), \"1.000000000000\")\n\n # Sample test\n test = \"1 3\"\n self.assertEqual(Polyline(test).calculate(), \"-1\")\n\n # Sample test\n test = \"4 1\"\n self.assertEqual(Polyline(test).calculate(), \"1.250000000000\")\n\n # My tests\n test = \"103 100\"\n self.assertEqual(float(Polyline(test).calculate()), 101.5)\n test = \"299 100\"\n self.assertEqual(float(Polyline(test).calculate()), 199.5)\n test = \"310 100\"\n self.assertEqual(float(Polyline(test).calculate()), 102.5)\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 = Polyline(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(Polyline().calculate())\n", "a, b = map(int, input().split())\nif a < b:\n print(-1)\nelif a == b:\n print(a)\nelse:\n ku = (a - b) // (2 * b)\n kd = (a + b) // (2 * b)\n xd = (a + b) / (2 * kd)\n if ku == 0:\n print(xd)\n else:\n xu = (a - b) / (2 * ku)\n print(min(xu, xd))\n", "a, b = map(int, input().split())\r\nif a == b:\r\n print(a)\r\nelse:\r\n t = (a + b) // (2 * b)\r\n s = (a - b) // (2 * b) if a > b else -1e-9\r\n if t == 0:\r\n print(-1)\r\n else:\r\n print(f\"{min((a + b) / (2 * t), ((a - b) / (2 * s)) if s != 0 else 1e9):.9f}\")\r\n\r\n\r\n", "s, x= map (int, input ().split())\n\n#a polyyyyyyyy\n\nprint (-1 if x>s else ((s+x)/2)/((s+x)//(2*x)))\n \t \t\t \t \t \t\t\t\t \t \t\t\t\t\t", "a, b = map(int, input().split())\r\nif a < b:\r\n print(-1)\r\nelif a == b:\r\n print(a)\r\nelse:\r\n i1 = (a+b) // (2*b)\r\n i2 = (a-b) // (2*b)\r\n if i2 == 0:\r\n print((a+b)/(2*i1))\r\n else:\r\n p = (a+b) / 2\r\n q = (a-b) / 2\r\n print(min(p/i1, q/i2))\r\n", "def solv(a,b):\r\n k1 = (b+a)//(b+b)\r\n k2 = (b-a)//(b+b)\r\n x1 = (b+a)/(k1+k1) if k1>0 else None\r\n x2 = (b-a)/(k2+k2) if k2>0 else None\r\n if x1 and x2: return min(x1,x2)\r\n if x1: return x1\r\n return -1\r\n\r\na,b=map(int,input().split())\r\nprint(solv(a,b))\r\n", "import math\r\nimport sys\r\nfrom random import randint as rn\r\nimport random\r\n\r\n\r\ndef solve():\r\n a, b = map(int, input().split())\r\n\r\n if a < b:\r\n print(-1)\r\n else:\r\n v1 = 1 << 60\r\n v2 = 1 << 60\r\n\r\n k = (a - b) // (2 * b)\r\n if k > 0:\r\n v1 = (a - b) / (2 * k)\r\n\r\n k = (a + b) // (2 * b)\r\n if k > 0:\r\n v2 = (a + b) / (2 * k)\r\n\r\n if min(v1, v2) == 1 << 60:\r\n print(-1)\r\n else:\r\n print('%.12f' % min(v1, v2))\r\n\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n multitest = 0\r\n\r\n if multitest:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n # gen()\r\n", "from decimal import *\r\nimport math\r\ngetcontext().prec=50\r\na,b=map(Decimal, input().split())\r\nprint ( -1 if b>a else(Decimal((a+b)/2)/math.floor(Decimal((a+b)/2)/b)))", "a, b = map(int, input().split())\nprint (-1 if b > a else (a+b)/2/((a+b)//(2*b)))\n", "import math\r\na,b = map(int,input().split())\r\nif b<=a:\r\n k = math.floor((a+b)/(2*b))\r\n print((a+b)/(2*k))\r\nelse:\r\n print(-1)", "a,b=map(int, input().split())\r\nprint (-1 if b>a else((a+b)/2)/((a+b)//(2*b)))", "x, y = [int(x) for x in input().split()]\r\nn1 = x + y\r\nans1 = -1\r\nans2 = -1\r\nif n1 // y - (n1 // y % 2) != 0:\r\n ans1 = n1 / (n1 // y - (n1 // y % 2))\r\nn2 = x + y \r\nif n2 // y - (n2 // y % 2) != 0:\r\n ans2 = n2 / (n2 // y - (n2 // y % 2))\r\nprint(min(ans1, ans2))" ]

[ "from sys import stdin,stdout\r\nimport bisect as bs\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,sm=lst()\r\n a=sorted(lst(),reverse=1)\r\n b=sorted(lst())\r\n used=-1\r\n rank=1\r\n # print(a)\r\n # print(b)\r\n p=-1\r\n for i in range(n):\r\n v1=a[i]\r\n p=bs.bisect_left(b,sm-v1,p+1,n)\r\n # print(a[i],p)\r\n if p>=n:\r\n rank=i\r\n # print(rank)\r\n break\r\n rank=i+1\r\n print(1,rank)\r\n", "from sys import stdin\r\nfrom collections import deque\r\n\r\nn,x = [int(x) for x in stdin.readline().split()]\r\n\r\ns1 = deque(sorted([int(x) for x in stdin.readline().split()]))\r\ns2 = deque(sorted([int(x) for x in stdin.readline().split()]))\r\n\r\nplace = 0\r\n\r\nfor score in s1:\r\n if s2[-1] + score >= x:\r\n place += 1\r\n s2.pop()\r\n else:\r\n s2.popleft()\r\n\r\nprint(1,place)\r\n \r\n\r\n\r\n", "n, x = map(int, input().split())\nscore1 = map(int, input().split())\nscore2 = map(int, input().split())\n\nscore1 = sorted(score1, reverse=True)\nscore2 = sorted(score2, reverse=True)\n\ncount = 0\ni = k = 0\nj = l = (n - 1)\nwhile i <= j and k <= l:\n if score1[i] + score2[l] >= score2[k] + score1[j]:\n if score1[i] + score2[l] >= x:\n count += 1\n i += 1\n l -= 1\n else:\n if score2[k] + score1[j] >= x:\n count += 1\n k += 1\n j -= 1\n \nprint(1, count) \n" ]

[ "import operator\r\n\r\nclass Participant:\r\n\tdef __init__(self,name,point):\r\n\t\tself.name=name\r\n\t\tself.point=point\r\n\r\nn,m=map(int,input().split())\r\ndes=[None]*m\r\nfor i in range(m):\r\n\tdes[i]=[]\r\nfor i in range(n):\r\n\tname,region,point=input().split()\r\n\tdes[int(region)-1].append(Participant(name,int(point)))\r\n\r\nresults=['?']*m\r\nfor i in range(m):\r\n\tcur_region=des[i]\r\n\tis_ok=False\r\n\tif len(cur_region)==2:\r\n\t\tis_ok=True\r\n\telse:\r\n\t\tcur_region.sort(key=operator.attrgetter('point'))\r\n\t\tif cur_region[-2].point!=cur_region[-3].point:\r\n\t\t\tis_ok=True\r\n\tif is_ok:\r\n\t\tresults[i]=' '.join([cur_region[-1].name,cur_region[-2].name])\r\nprint('\\n'.join(results))", "n, m = map(int, input().split())\r\nd = {}\r\nfor i in range(1, m+1): d[i] = []\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n b = int(b) ; c = int(c)\r\n d[b] += [(c, a)]\r\nfor i in range(1, m+1):\r\n t = sorted(d[i], reverse=True)\r\n print('?' if len(t) > 2 and t[1][0] == t[2][0] else t[0][1] + ' ' + t[1][1])\r\n", "n, m = map(int, input().split())\r\no = {x: {} for x in range(1, m+1)}\r\nfor _ in range(n):\r\n\ta, b, c = input().split()\r\n\to[int(b)][a] = int(c)\r\n\r\n\r\nfor key, value in o.items():\r\n\tvalue = dict(sorted(value.items(), key=lambda x: x[1], reverse=True))\r\n\tkeys = list(value.keys())\r\n\tvalues = list(value.values())\r\n\r\n\r\n\r\n\tif len(keys) == 2:\r\n\t\tprint(*keys)\r\n\telse:\r\n\t\tif values[0] == values[1] == values[2]:print(\"?\")\r\n\t\telif values[1] == values[2]:print(\"?\")\r\n\t\telse:print(*keys[:2])", "def contest(n, m, P):\n D = [[(-1, None), (-1, None), (-1, None)] for _ in range(m)]\n for n, r, p in P:\n D_i = D[r-1]\n d = (p, n)\n if d > D_i[0]:\n D_i[2] = D_i[1]\n D_i[1] = D_i[0]\n D_i[0] = d\n elif d > D_i[1]:\n D_i[2] = D_i[1]\n D_i[1] = d\n elif d > D_i[2]:\n D_i[2] = d\n\n for i in range(m):\n D_i = D[i]\n if D_i[1][0] == D_i[2][0]:\n yield '?'\n else:\n yield f'{D_i[0][1]} {D_i[1][1]}'\n\n\ndef readp():\n n, sr, sp = input().split()\n return n, int(sr), int(sp)\n\n\ndef main():\n n, m = readinti()\n P = [readp() for _ in range(n)]\n print('\\n'.join(contest(n, m, P)))\n\n##########\n\nimport sys\n\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\nif __name__ == '__main__':\n main()\n", "n,m=map(int,input().strip().split())\r\nd={}\r\nfor i in range(n):\r\n s,a,b=map(str,input().strip().split())\r\n if int(a) not in d:\r\n d[int(a)]=[(int(b),s)]\r\n else:\r\n d[int(a)]+=[(int(b),s)]\r\nfor i in range(1,m+1):\r\n mk=d[i]\r\n mk.sort(reverse=True)\r\n if len(mk)>2:\r\n if mk[1][0]==mk[2][0]:\r\n print(\"?\")\r\n else:\r\n print(mk[0][1],mk[1][1])\r\n else:\r\n print(mk[0][1],mk[1][1])", "participants,regions = map(int,input().split())\nresults ={}\n\n\nfor i in range(participants):\n name,region,score = input().split()\n if region in results:\n results[region].append([int(score),name])\n\n else:\n results[region]=[[int(score),name]]\n\nfor i in range(1,regions+1):\n j = str(i)\n\n if len(results[j])>2:\n results[j].sort()\n if results[j][-3][0]==results[j][-2][0]:\n print('?')\n\n else:\n print(results[j][-1][1],results[j][-2][1])\n\n else:\n print(results[j][1][1],results[j][0][1])\n\n", "n,m = map(int,input().split(' '))\r\nl = list()\r\nd = {}\r\nfor i in range(m):\r\n d[i+1] = []\r\nfor i in range(n):\r\n a,b,c = input().split()\r\n b = int(b)\r\n c = int(c)\r\n d[b] += [(c,a)]\r\n\r\nfor j in range(m):\r\n t = sorted(d[j+1])[::-1]\r\n if(int(len(t)) > 2 and (t[1][0]==t[2][0]) ):\r\n print('?')\r\n else:\r\n print(t[0][1] + ' ' + t[1][1])", "ns, ts = [int(x) for x in input().split()]\n\nd = dict();\nfor i in range(1, ts+1):\n d[i]=[];\n\nfor _ in range(ns):\n name, t, m = [x for x in input().split()];\n t=int(t);\n m=int(m);\n d[t].append((m, name));\n\nfor e in d:\n d[e] = sorted(d[e], key = lambda p: -p[0]);\n #print(d[e])\n \nfor i in range(1, ts+1):\n if len(d[i])>2 and d[i][1][0]==d[i][2][0]:\n print('?');\n else:\n #print(d[i])\n print(d[i][0][1], d[i][1][1]);\n\n", "n, m = map(int, input().split())\r\n\r\ngroup = [[] for _ in range(m)]\r\n\r\nfor _ in range(n):\r\n name, id, score = input().split()\r\n id = int(id) - 1\r\n group[id].append((name, int(score)))\r\n\r\nfor id in range(m):\r\n group[id] = sorted(group[id], key= lambda x: x[1], reverse= True)\r\n\r\nfor id in range(m):\r\n if len(group[id]) > 2 and (group[id][1][1] == group[id][2][1]):\r\n print('?')\r\n else:\r\n print(group[id][0][0], group[id][1][0])\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\nD = defaultdict(list)\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n b, c = int(b) - 1, int(c)\r\n D[b].append((c, a))\r\n D[b] = sorted(D[b], reverse=True)[:3]\r\n \r\nfor i in range(m):\r\n if len(D[i]) == 2:\r\n print(D[i][0][1], D[i][1][1])\r\n continue\r\n a, b, c = D[i]\r\n if c[0] == b[0] or c[0] == a[0]:\r\n print('?')\r\n else:\r\n print(a[1], b[1])", "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\nx = [[] for _ in range(m + 1)]\r\nfor _ in range(n):\r\n s, u, v = input().rstrip().decode().split()\r\n x[int(u)].append((int(v), s))\r\nans = []\r\nfor i in range(1, m + 1):\r\n y = x[i]\r\n y.sort(reverse = True)\r\n if len(y) == 2 or y[1][0] ^ y[2][0]:\r\n ans0 = \" \".join(map(str, (y[0][1], y[1][1])))\r\n else:\r\n ans0 = \"?\"\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))", "def main():\r\n\tn, m = map(int, input().strip().split())\r\n\t\r\n\tr = [[] for _ in range(m)]\r\n\tfor _ in range(n):\r\n\t\tname, region, score = input().strip().split()\r\n\t\tregion = int(region)\r\n\t\tscore = int(score)\r\n\t\tr[region - 1].append((name, score))\r\n\r\n\tfor i in range(m):\r\n\t\tp = sorted(r[i], key=lambda x: x[1], reverse=True)\r\n\t\tif len(p) == 2 or (p[0][1] >= p[1][1] > p[2][1]):\r\n\t\t\tprint('{} {}'.format(p[0][0], p[1][0]))\r\n\t\telse:\r\n\t\t\tprint('?')\r\n\t\t\r\nif __name__ == '__main__':\r\n\tmain()", "n, m = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(1, m+1):\r\n d[i] = []\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n a = str(a)\r\n b = int(b)\r\n c = int(c)\r\n d[b].append([c, a])\r\nfor i in range(1, m+1):\r\n a = d[i]\r\n a.sort(reverse=True)\r\n if len(a) > 2 and a[1][0] == a[2][0]:\r\n print(\"?\")\r\n else:\r\n print(a[0][1], a[1][1])\r\n", "from operator import itemgetter\n\n\nclass A:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.parts = []\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.parts.append(input().split(\" \"))\n\n def process_task(self):\n results = []\n region_scores = [[] for x in range(self.n_m[1])]\n for part in self.parts:\n region_scores[int(part[1]) - 1].append((part[0], int(part[2])))\n for region in region_scores:\n if len(region) < 3:\n results.append(\"{0} {1}\".format(region[0][0], region[1][0]))\n else:\n region.sort(key=itemgetter(1), reverse=True)\n if region[2][1] == region[1][1]:\n results.append(\"?\")\n else:\n results.append(\"{0} {1}\".format(region[0][0], region[1][0]))\n self.result = \"\\n\".join(results)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = A()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n\t \t \t \t\t\t\t \t \t\t \t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = [[] for _ in range(m)]\r\n\r\nfor i in range(n):\r\n s, b, c = input()[:-1].split()\r\n b = int(b)\r\n c = int(c)\r\n d[b-1].append((c, s))\r\n\r\nd = list(map(lambda x: sorted(x, reverse=True), d))\r\n\r\nfor i in d:\r\n if len(i) == 2:\r\n print(i[0][1], i[1][1])\r\n else:\r\n if i[1][0] == i[2][0]:\r\n print('?')\r\n else:\r\n print(i[0][1], i[1][1])", "def cmp(x): return x[1]\r\nn,m=map(int,input().split())\r\nq=[[] for i in range(m)]\r\nfor i in range(n):\r\n name,r,b=input().split()\r\n q[int(r)-1].append([name,int(b)])\r\nfor i in q:\r\n i=sorted(i,key=cmp)\r\n if len(i)==2: print(i[-1][0],i[-2][0])\r\n elif i[-1][1]==i[-2][1]==i[-3][1] or i[-2][1]==i[-3][1]: print('?')\r\n else: print(i[-1][0],i[-2][0])\r\n ", "from sys import stdin,stdout\r\n#n=int(stdin.readline().strip())\r\nn,m=map(int,stdin.readline().strip().split())\r\nregs=[[] for i in range(m+1)]\r\nfor i in range(n):\r\n name,r,p=stdin.readline().strip().split()\r\n regs[int(r)].append([int(p), name])\r\nfor i in range(1,m+1):\r\n regs[i].sort()\r\n if len(regs[i])>2 and regs[i][-3][0]==regs[i][-2][0]:\r\n stdout.write(\"?\\n\")\r\n else:\r\n stdout.write(\"%s %s\\n\" % (regs[i][-2][1],regs[i][-1][1]))\r\n\r\n#s=list(map(int,stdin.readline().strip().split()))\r\n" ]

[ "n, m = list(map(int, input().split()))\n \nsolucao = []\n \ndef merge(inicio, fim, rem):\n\tif rem < 2:\n\t\tsolucao.extend(range(inicio, fim))\n\t\treturn rem\n\tif fim - inicio == 1:\n\t\tsolucao.append(inicio)\n\t\treturn rem\n\trem -= 2\n\tmid = (inicio + fim + 1)//2\n\trem = merge(mid, fim, rem)\n\trem = merge(inicio, mid, rem)\n\treturn rem\n \nrem = merge(1, n + 1, m - 1)\nif rem == 0:\n\tprint(' '.join(map(str, solucao)))\nelse:\n\tprint(-1)", "k1 = 0\r\ndef main():\r\n n, k = [int(x) for x in input().split()]\r\n if k & 1 == 0 or k > 2 * n - 1:\r\n print(\"-1\")\r\n return\r\n else:\r\n lst = [0] * n\r\n \r\n global k1\r\n k1 = k - 1\r\n \r\n def ord_arr(l, r, val):\r\n global k1\r\n if r <= l+1:\r\n lst[l] = val\r\n \r\n elif k1 == 0:\r\n for i in range(l, r):\r\n lst[i] = val + i - l\r\n else:\r\n k1 -= 2\r\n m = (l+r) // 2\r\n ord_arr(l, m, val+r-m)\r\n ord_arr(m, r, val)\r\n \r\n ord_arr(0, n, 1)\r\n print(' '.join([str(x) for x in lst]))\r\n \r\nmain()", "def mergeSort(arr, l, r):\n\tglobal k\n\tif k<2 or r-l<2: return\n\tk -= 2\n\tm=(l+r)//2\n\tvetor[m], vetor[m-1] = vetor[m-1], vetor[m]\n\tmergeSort(arr, l, m)\n\tmergeSort(arr, m, r)\n\treturn\n\nn, k = input().split()\nn, k = int(n), int(k)\nvetor = []\nfor i in range(n):\n vetor.append(int(i+1))\nif k % 2 == 0 or k > 2*n:\n print(-1)\nelse:\n k-=1\n mergeSort(vetor, 0, n)\n for i in vetor:\n print(i, end=' ')\n \t \t\t \t\t\t\t\t \t\t\t \t\t \t\t \t", "\"\"\"\nthere are only 7\n\"\"\"\n\ndef merge(arr, l, r, lvl):\n\tglobal k\n\tif l >= r - 1 or k == 0:\n\t\treturn arr\n\telse:\n\t\tk-=2\n\t\tmid = (l+r) // 2\n\t\ttemp = arr[mid-1]\n\t\tarr[mid-1] = arr[mid]\n\t\tarr[mid] = temp\n\t\tmerge(arr, l, mid, lvl+1)\n\t\tmerge(arr, mid, r, lvl+1)\n\t\treturn arr\n\nk = 0\nn, k = map(int, input().split())\nif not(k&1) or k >= 2*n:\n\tprint(-1)\nelse: \n\tk -= 1\n\tprint(\" \".join(map(str, merge(list(range(1, n+1)), 0, n, 1))))", "flag = False\n \ndef dc(n,k,l):\n global flag \n \n if k == 0:\n return(list(range(l,l+n)))\n if n == 1:\n flag = True\n return([0])\n \n if (k%4 == 2): k1 = k2 = k//2 - 1 \n else:\n k1 = (k-4)//2\n k2 = k1+2\n \n n1 = n//2\n n2 = n-n1\n \n a1 = dc(n1,k1,l+n2)\n a2 = dc(n2,k2,l)\n \n a1.extend(a2)\n return(a1)\n \ndef __solve__():\n global flag\n n,k = [int(x) for x in input().split()]\n \n ans = dc(n,k-1,1)\n \n if (k%2 == 0):\n flag = True\n \n if flag:\n print(-1)\n else:\n for i in ans: print(i,end = \" \")\n\nif __name__ == '__main__':\n __solve__()\n", "n,k=map(int,input().split())\r\nif not k&1:exit(print(-1))\r\nk-=1\r\na=[int(i+1) for i in range(n)]\r\ndef f(l,r):\r\n global k\r\n if k<2 or r-l<2:return\r\n k-=2\r\n m=(l+r)//2\r\n a[m],a[m-1]=a[m-1],a[m]\r\n f(l,m)\r\n f(m,r)\r\nf(0,n)\r\nif k:exit(print(-1))\r\nfor i in a:\r\n print(int(i),end=' ')", "def construct(array, l, h, count, j):\r\n if count[0] >= j:\r\n return \r\n if h-l <= 1:\r\n return \r\n \r\n m = (l+h)//2\r\n array[m-1], array[m] = array[m], array[m-1]\r\n \r\n count[0] += 2\r\n construct(array, l, m, count, j)\r\n \r\n construct(array, m, h, count, j)\r\n \r\nn, j = list(map(int, input().split()))\r\nif not j & 1:\r\n print(-1)\r\nelse:\r\n array = [str(i) for i in range(1, n+1)]\r\n count = [1]\r\n construct(array, 0, n, count, j)\r\n if count [0] < j:\r\n print(-1)\r\n else:\r\n print(\" \".join(array))", "n, k = map(int,input().split())\r\n\r\nif k % 2 == 0:\r\n exit(print(-1))\r\n\r\nk -= 1\r\na = [i+1 for i in range(n)]\r\n\r\ndef sl(l,r):\r\n global k\r\n if r-l < 2 or k == 0:\r\n return\r\n k -= 2\r\n m = (l+r)//2\r\n a[m], a[m-1] = a[m-1], a[m]\r\n sl(l,m)\r\n sl(m, r)\r\n\r\nsl(0, n)\r\n\r\nif k != 0:\r\n exit(print(-1))\r\n\r\nprint(' '.join([str(i) for i in a]))", "from sys import setrecursionlimit as c\r\nc(10000)\r\n \r\ndef s(a, le, ri):\r\n global k\r\n if k <= 0 or le >= ri-1:\r\n return\r\n k -= 2\r\n mid = (le+ri)//2\r\n a[mid], a[mid-1] = a[mid-1], a[mid]\r\n s(a, le, mid)\r\n s(a, mid, ri)\r\n \r\nn, k = map(int, input().split())\r\n \r\nif not(k%2):\r\n print(\"-1\")\r\nelse:\r\n k -= 1\r\n l = list(range(1, n+1))\r\n s(l, 0, n)\r\n if not(k):\r\n print(*l)\r\n else:\r\n print(\"-1\")\r\n", "n, k = map(int, input().split())\r\n\r\nif k%2 == 0:\r\n print(-1)\r\n exit()\r\n\r\nA = list(range(1, n+1))\r\n\r\ndef calc(l, r):\r\n global k\r\n if r-l < 2 or k == 0:\r\n return\r\n k -= 2\r\n m = (l+r)//2\r\n A[m-1], A[m] = A[m], A[m-1]\r\n calc(l, m)\r\n calc(m, r)\r\n\r\nk -= 1\r\ncalc(0, n)\r\nif k != 0:\r\n print(-1)\r\nelse:\r\n print(*A)\r\n", "n, k = map(int,input().split())\nif k % 2 == 0:\n exit(print(-1))\nk -= 1\na = [int(i+1) for i in range(n)] \ndef f(l,r):\n global k\n if k < 2 or r-l < 2:\n return\n k-=2\n m=(l+r)//2\n a[m], a[m-1] = a[m-1], a[m]\n f(l,m)\n f(m,r)\nf(0,n)\nif k:exit(print(-1))\nfor i in a:\n print(int(i),end=' ')", "n,k=map(int,input().split())\r\na=[i+1 for i in range(n)]\r\nif not k&1:exit(print(-1))\r\nk-=1\r\ndef f(l,r):\r\n global k\r\n if(k<2 or r-l<2): return\r\n k-=2\r\n m=(l+r)//2\r\n a[m-1],a[m]=a[m],a[m-1]\r\n f(l,m)\r\n f(m,r)\r\nf(0,n)\r\nif not k==0:exit(print(-1))\r\nfor i in a:\r\n print(int(i),end=\" \")\r\n\r\n", "n, k = map(int, input().split())\r\na = [i+1 for i in range(n)]\r\nif not k & 1:\r\n exit(print(-1))\r\nk -= 1\r\n\r\n\r\ndef f(l, r):\r\n global k\r\n if(k < 2 or r-l < 2):\r\n return\r\n k -= 2\r\n m = (l+r)//2\r\n a[m-1], a[m] = a[m], a[m-1]\r\n f(l, m)\r\n f(m, r)\r\n\r\n\r\nf(0, n)\r\nif not k == 0:\r\n exit(print(-1))\r\nfor i in a:\r\n print(int(i), end=\" \")\r\n", "from sys import stdin, stdout\n\ndef merge_sort(l, r, nl, nr, t):\n if r - l < 2:\n if t:\n print(-1)\n exit()\n if l != r:\n res[l] = nl\n return\n k = t // 2\n y = t % 2\n m = (l+r)//2\n nm = (nl +nr) // 2\n if y:\n print(-1)\n exit()\n else:\n if k == 1:\n if nm - nr != l - m:\n nm = l - m + nr\n merge_sort(l, m, nm, nr, k - 1)\n merge_sort(m, r, nl, nm, k - 1)\n elif k:\n if k % 2:\n merge_sort(l, m, nl, nm, k - 1)\n merge_sort(m, r, nm, nr, k - 1)\n else:\n merge_sort(l,m,nl,nm,k-2)\n merge_sort(m,r,nm,nr,k)\n else:\n for i in range(l, r):\n res[i] = nl + i - l\nn, m = map(int, stdin.readline().split())\nres = [0 for i in range(n)]\nmerge_sort(0,n,1,n+1,m - 1)\nstdout.write(\" \".join(map(str, res)))", "#João Vitor Patricio Romão - 118211058\r\ndef create_list(n, num_of_calls):\r\n if n == 1:\r\n return [1], 0\r\n if n == 2:\r\n return [2, 1], 2\r\n if num_of_calls == 2:\r\n return list(range(2, n // 2 + 2)) + [1] +\\\r\n list(range(n // 2 + 2, n + 1)), 2\r\n \r\n list1, num_of_calls1 = create_list(n // 2, num_of_calls - 2)\r\n if num_of_calls1 == num_of_calls - 2:\r\n return list1 + list(range(n // 2 + 1, n + 1)), num_of_calls\r\n \r\n list2, num_of_calls2 = create_list((n + 1) // 2,\r\n num_of_calls - num_of_calls1 - 2)\r\n return list1 + [x + n // 2 for x in list2], \\\r\n num_of_calls1 + num_of_calls2 + 2\r\n \r\n \r\ndef main():\r\n n, k = [int(x) for x in input().split()]\r\n if k % 2 != 1:\r\n print(-1)\r\n return\r\n \r\n if k == 1:\r\n print(' '.join([str(x) for x in range(1, n + 1)]))\r\n return\r\n \r\n num_list, num_of_calls = create_list(n, k - 1)\r\n if num_of_calls != k - 1:\r\n print(-1)\r\n return\r\n print(' '.join([str(x) for x in num_list]))\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "from sys import stdin, setrecursionlimit, stdout\r\n#setrecursionlimit(1000000) #use \"python\" instead of \"pypy\" to avoid MLE\r\nfrom collections import deque\r\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\r\nfrom heapq import heapify, heappop, heappush, heapreplace, heappushpop\r\nfrom bisect import bisect_right, bisect_left\r\ndef ii(): return int(stdin.readline())\r\ndef fi(): return float(stdin.readline())\r\ndef mi(): return map(int, stdin.readline().split())\r\ndef fmi(): return map(float, stdin.readline().split())\r\ndef li(): return list(mi())\r\ndef si(): return stdin.readline().rstrip()\r\ndef lsi(): return list(si())\r\nmod=1000000007\r\nres=['NO', 'YES']\r\n\r\n\r\n#######################################################################################\r\n########################### M Y F U N C T I O N S ###########################\r\n#######################################################################################\r\n\r\ndef merge(l, r):\r\n global k\r\n if k:\r\n m=(l+r)//2\r\n if m and l+1!=r:\r\n a[m-1], a[m]=a[m], a[m-1]\r\n #print(a, m)\r\n k-=2\r\n merge(l, m)\r\n merge(m, r)\r\n return\r\n return\r\n\r\n\r\n#######################################################################################\r\n########################### M A I N P R O G R A M ###########################\r\n#######################################################################################\r\n\r\n\r\ntest=1\r\ntest_case=1\r\nwhile test<=test_case:\r\n test+=1\r\n\r\n\r\n\r\n\r\n n, k=mi()\r\n if not k%2 or k>=n+n:\r\n print(-1)\r\n exit()\r\n k-=1\r\n a=[i+1 for i in range(n)]\r\n merge(0, n)\r\n print(*a)", "import sys\r\n\r\nsys.setrecursionlimit(1000000)\r\n\r\n\"\"\"\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n\r\n if k % 2 == 0 or k > 2 * n:\r\n print(-1)\r\n return\r\n\r\n if k == 1:\r\n print(\" \".join(str(k) for k in range(1, n + 1)))\r\n return\r\n\r\n arr = [i + 1 for i in range(n)]\r\n\r\n def rec(l, r):\r\n nonlocal k\r\n if k < 2 or r - l < 2:\r\n return\r\n mid = (l + r) // 2\r\n k -= 2\r\n arr[mid], arr[mid - 1] = arr[mid - 1], arr[mid]\r\n rec(l, mid)\r\n rec(mid, r)\r\n\r\n k -= 1\r\n rec(0, n)\r\n if k:\r\n print(-1)\r\n return\r\n\r\n print(\" \".join(str(k) for k in arr))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys \r\n\r\ndef geradorLista(n, chamadas):\r\n if n == 1:\r\n return [1], 0\r\n if n == 2:\r\n return [2, 1], 2\r\n if chamadas == 2:\r\n return list(range(2, n // 2 + 2)) + [1] +\\\r\n list(range(n // 2 + 2, n + 1)), 2\r\n \r\n lista1, chamadas1 = geradorLista(n // 2, chamadas - 2)\r\n if chamadas1 == chamadas - 2:\r\n return lista1 + list(range(n // 2 + 1, n + 1)), chamadas\r\n \r\n lista2, chamadas2 = geradorLista((n + 1) // 2,\r\n chamadas - chamadas1 - 2)\r\n return lista1 + [x + n // 2 for x in lista2], \\\r\n chamadas1 + chamadas2 + 2\r\n \r\n \r\n\r\nn, k = [int(x) for x in input().split()]\r\nif k % 2 != 1:\r\n print(-1)\r\n sys.exit()\r\n \r\n \r\nif (k == 1):\r\n print(' '.join([str(x) for x in range(1, n + 1)]))\r\n sys.exit()\r\n \r\nnum_list, chamadas = geradorLista(n, k - 1)\r\n\r\nif (chamadas != k - 1):\r\n print(-1)\r\n sys.exit()\r\nelse:\r\n print(' '.join([str(x) for x in num_list]))\r\n sys.exit()", "n, k = map(int, input().split())\r\n\r\nlst = [i for i in range(1, n + 1)]\r\n\r\n\r\ndef rearrange(l, r):\r\n global k\r\n if k < 1 or l + 1 == r:\r\n return\r\n k -= 2\r\n mid = (l + r) // 2\r\n lst[mid - 1], lst[mid] = lst[mid], lst[mid - 1]\r\n rearrange(l, mid)\r\n rearrange(mid, r)\r\n\r\n\r\nif k % 2 == 0 or n * 2 < k:\r\n print(-1)\r\nelse:\r\n k -= 1\r\n rearrange(0, n)\r\n print(' '.join(str(i) for i in lst))\r\n", "n,m = list(map(int, input().split()))\n \nres = []\n \ndef solve(begin, end, rem):\n\tif rem<2:\n\t\tres.extend(range(begin,end))\n\t\treturn rem\n\tif end-begin==1:\n\t\tres.append(begin)\n\t\treturn rem\n\trem -= 2\n\tmid = (begin+end+1)//2\n\trem = solve(mid, end, rem)\n\trem = solve(begin, mid, rem)\n\treturn rem\n \nrem = solve(1, n+1, m-1)\nif rem == 0:\n\tprint(' '.join(map(str, res)))\nelse:\n\tprint(-1)\n", "def unsort(arr, left, right, k):\n if k[0] <= 0 or left >= right - 1:\n return\n\n k[0] -= 2\n mid = (left + right) // 2\n\n arr[mid], arr[mid - 1] = arr[mid - 1], arr[mid]\n\n unsort(arr, left, mid, k)\n unsort(arr, mid, right, k)\n\n\nn, k = map(int, input().split())\n\nif k % 2 == 0:\n print(-1)\nelse:\n k = [k - 1]\n arr = [i for i in range(1, n + 1)]\n\n unsort(arr, 0, n, k)\n\n if not k[0]:\n print(*arr)\n else:\n print(-1)\n", "'''\r\nBased on solution from Firepaw which is awesome\r\n'''\r\n\r\nk1 = 0\r\n\r\n\r\ndef main():\r\n n, k = [int(x) for x in input().split()]\r\n if k & 1 == 0 or k > 2*n-1:\r\n print(\"-1\")\r\n else:\r\n lst = [0]*n\r\n\r\n # k1 count how many recursions left, drain one for the initial call\r\n global k1\r\n k1 = k - 1\r\n\r\n # solve the task for [l, r)\r\n # Filling array with values val, val+1, ...\r\n def fill_arr(l, r, val):\r\n global k1\r\n # list size 1, nothing to do just set the value\r\n if r <= l+1:\r\n lst[l] = val\r\n elif k1 == 0:\r\n # just fill in a sorted array - no more calls here\r\n for i in range(l, r):\r\n lst[i] = val + i - l\r\n else:\r\n # drain 2 recursion calls (for left and right path)\r\n k1 -= 2\r\n # call subproblems\r\n m = (l+r) // 2\r\n # set initial vals for left path as [val + r-m, ... , val + r)\r\n fill_arr(l, m, val+r-m)\r\n\r\n # set initial vals for right path as [val, val+1, ... , val + r-m)\r\n fill_arr(m, r, val)\r\n\r\n # after filling subproblems we are sure list is not sorted\r\n # this justifies the draining k1\r\n\r\n fill_arr(0, n, 1)\r\n print(' '.join([str(x) for x in lst]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def merge_sort(a, l, h, c, k):\r\n if c[0] >= k or h - l <= 1:\r\n return\r\n\r\n m = (l + h) // 2\r\n a[m - 1], a[m] = a[m], a[m - 1]\r\n c[0] += 2\r\n\r\n merge_sort(a, l, m, c, k)\r\n merge_sort(a, m, h, c, k)\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\nif k % 2 == 0:\r\n print('-1')\r\nelse:\r\n a = [i + 1 for i in range(n)]\r\n c = [1]\r\n merge_sort(a, 0, n, c, k)\r\n if c[0] < k:\r\n print('-1')\r\n else:\r\n print(*a)", "from sys import stdin, stdout\r\n \r\nn, k = map(int, stdin.readline().split())\r\nvalue = n\r\ncnt = k\r\nans = []\r\n \r\n \r\ndef generate(l, r):\r\n global cnt, value\r\n \r\n if l == r:\r\n ans.append(value)\r\n value -= 1\r\n return 0\r\n \r\n if not cnt:\r\n for i in range(value - (r - l), value + 1):\r\n ans.append(i)\r\n \r\n value -= (r - l + 1)\r\n return 0\r\n \r\n cnt -= 2\r\n middle = (l + r + 1) >> 1\r\n generate(l, middle - 1)\r\n generate(middle, r) \r\n \r\n \r\ncnt -= 1\r\ngenerate(0, n - 1)\r\n \r\nif len(ans) != n or cnt:\r\n stdout.write('-1')\r\nelse:\r\n stdout.write(' '.join(list(map(str, ans))))", "n,k=map(int,input().split())\nif k%2==0:\n exit(print(-1))\nk-=1\na=[i+1 for i in range(n)]\ndef sl(l,r):\n global k\n if r-l<2 or k==0:\n return \n k-=2\n m=(l+r)//2\n a[m],a[m-1]=a[m-1],a[m]\n sl(l,m)\n sl(m,r)\nsl(0,n)\nif k!=0:\n exit(print(-1))\nprint(' '.join([str(i) for i in a]))\n\t \t\t \t\t\t \t \t \t\t \t \t", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nif k % 2 == 0 or k > 2 * n:\r\n ans = [-1]\r\nelse:\r\n ans = [i for i in range(1, n + 1)]\r\n q = deque()\r\n q.append((0, n))\r\n for _ in range(k // 2):\r\n l, r = q.popleft()\r\n m = (l + r) // 2\r\n x = []\r\n for i in range(l, r):\r\n x.append(ans[i])\r\n for i in range(r - l):\r\n ans[m] = x[i]\r\n m += 1\r\n if m == r:\r\n m = l\r\n if m - l > 1:\r\n q.append((l, m))\r\n if r - m > 1:\r\n q.append((m, r))\r\nprint(*ans)", "from collections import deque\r\n\r\nn, k = [int(x) for x in input().split()]\r\narr = list(range(n))\r\n\r\ndef count(l, r):\r\n if r-l == 1:\r\n return 0\r\n \r\n mid = (l+r)>>1\r\n return 2+count(l,mid)+count(mid, r)\r\n\r\nif k%2 == 0 or k > 1+count(0, n):\r\n print(-1)\r\n exit(0)\r\n\r\nintervals = deque([(0, n)])\r\nwhile k > 1:\r\n l, r = intervals.popleft()\r\n if r-l == 1:\r\n intervals.append((l,r))\r\n continue\r\n \r\n mid = (l+r)>>1\r\n intervals.append((l, mid))\r\n intervals.append((mid, r))\r\n k -= 2\r\n\r\nres = sorted(list(intervals))[::-1]\r\ncurr = 1\r\nfor l, r in res:\r\n for i in range(l, r):\r\n arr[i] = curr\r\n curr += 1\r\n\r\nprint(*arr)\r\n\r\n\r\n", "y = list(map(int,input().strip().split()))[:2]\r\nn = y[0]\r\nk = y[1]\r\n\r\ndef merg(lista, esq, dire, k):\r\n if k[0] <= 0 or esq >= dire - 1:\r\n return\r\n\r\n k[0] -= 2\r\n met = (esq + dire)//2\r\n \r\n lista[met], lista[met - 1] = lista[met - 1], lista[met]\r\n\r\n merg(lista, esq, met, k)\r\n merg(lista, met, dire, k)\r\n\r\nresposta = \"\"\r\n\r\nif k % 2 == 1:\r\n k = [k - 1]\r\n lista = [i for i in range(1, n + 1)]\r\n\r\n merg(lista, 0, n, k)\r\n\r\n if not k[0]:\r\n for xyz in range(len(lista)):\r\n resposta += str(lista[xyz])\r\n resposta += \" \"\r\n resposta = resposta.strip()\r\n else:\r\n resposta = -1\r\n\r\nelse:\r\n resposta = -1\r\n\r\nprint(resposta)", "class Solution:\r\n def func(self):\r\n global n,k\r\n if(not k&1): return []\r\n arr=list(range(1,n+1))\r\n k-=1\r\n if(k==0): return arr\r\n self.mergeSort(0,n,arr)\r\n if(k==0): return arr\r\n else: return []\r\n def mergeSort(self,l,r,arr):\r\n global k\r\n if(k==0): return\r\n if(l+1>=r): return\r\n mid=l+((r-l)>>1)\r\n arr[mid],arr[mid-1]=arr[mid-1],arr[mid]\r\n k-=2\r\n self.mergeSort(l,mid,arr)\r\n self.mergeSort(mid,r,arr)\r\n return\r\nif __name__=='__main__':\r\n global n,k\r\n S=Solution()\r\n n,k = map(int,input().split())\r\n t = S.func()\r\n if(t): print(*t)\r\n else: print(\"-1\")", "def ms(l, r):\r\n global c\r\n if l == r or c == 0:\r\n return \r\n \r\n mid = (l+r+1)//2\r\n\r\n temp = a[mid]\r\n a[mid] = a[mid-1]\r\n a[mid-1] = temp\r\n c -= 1\r\n\r\n ms(l, mid-1)\r\n ms(mid, r)\r\n\r\n return \r\n\r\n\r\nn, k = map(int, input().split())\r\nif not k % 2 or k > 2*n:\r\n print(-1)\r\n exit()\r\n\r\na = [i for i in range(1,n+1)]\r\nc = (k-1)//2\r\nms(0, n-1)\r\nprint(*a)\r\n", "def answer(c, l, r, a):\n global last\n if c == 1:\n i = r - 1\n while i >= l:\n a[i] = last\n last -= 1\n i -= 1\n return\n m = (l + r) // 2\n answer(c // 2 - int((c // 2) % 2 == 0), l, m, a)\n answer(c // 2 + int((c // 2) % 2 == 0), m, r, a)\n\ndef generate_array(n, k):\n if k % 2 == 0 or k >= 2 * n:\n print(-1)\n return\n\n \n a = [0] * n\n answer(k, 0, n, a)\n print(*a)\n\n\nn, k = [int(i) for i in input().split()]\nlast = n\ngenerate_array(n, k)\n", "n,k=map(int,input().split())\r\nkk=2*n-1\r\no=True\r\nif kk<k or k%2==0:\r\n o=False\r\ns=[[0,n]]\r\ns1=[]\r\ndata=[0]*n\r\nk-=1\r\nwhile o:\r\n if k==0:\r\n break\r\n ss=s.pop()\r\n l=ss[0]\r\n r=ss[1] \r\n if r-l==1:\r\n s1.append([l,r])\r\n else:\r\n mid=(l+r)//2\r\n s.append([l,mid])\r\n s.append([mid,r])\r\n k-=2\r\nif o:\r\n s=s+s1\r\n for i in s:\r\n for j in range(i[0],i[1]):\r\n data[j]=n-i[1]+(j-i[0])+1\r\n print(*data)\r\nelse:\r\n print(-1)", "def run():\r\n k = [0] \r\n n, k[0] = (int(i) for i in input().split())\r\n if k[0] % 2 == 0:\r\n print('-1')\r\n return\r\n d = [i for i in range(n+1)]\r\n k[0] -= 1\r\n \r\n mSort(d, 1, n+1, k)\r\n if k[0] == 0:\r\n print(*d[1:])\r\n else:\r\n print('-1')\r\n\r\ndef mSort(d, l, r, k):\r\n if k[0] <= 0 or l >= r - 1:\r\n return\r\n k[0] -= 2\r\n mid = (l + r) // 2\r\n aux = d[mid-1]\r\n d[mid-1] = d[mid]\r\n d[mid] = aux\r\n mSort(d, l, mid, k)\r\n mSort(d, mid, r, k)\r\n \r\nif __name__ == '__main__':\r\n run()", "n, k = map(int,input().split())\r\n\r\na = []\r\n\r\n\r\ndef merge(start, end, call):\r\n if call < 2:\r\n a.extend(range(start, end))\r\n return call\r\n if end - start == 1:\r\n a.append(start)\r\n return call\r\n\r\n call -= 2\r\n mid = (start + end + 1) // 2\r\n call = merge(mid, end, call)\r\n call = merge(start, mid, call)\r\n return call\r\n\r\n\r\ncall = merge(1, n + 1, k - 1)\r\n\r\nif call == 0:\r\n print(' '.join(map(str, a)))\r\nelse:\r\n print(-1)\r\n ", "def swap(m,n):\r\n temp= arr[m]\r\n arr[m]=arr[n]\r\n arr[n]=temp\r\n \r\ndef solve(arr,l,r,k):\r\n global count\r\n if count>=k or r-l<2:\r\n return\r\n else:\r\n m=int((l+r)/2)\r\n swap(m,m-1)\r\n count+=2\r\n solve(arr,l,m,k)\r\n solve(arr,m,r,k)\r\n \r\nn,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\narr=[]\r\n\r\nglobal count\r\ncount=1\r\nfor i in range(1,n+1):\r\n arr.append(i)\r\n \r\nsolve(arr,0,n,k)\r\nif count!=k:\r\n print(-1)\r\nelse:\r\n for i in arr:\r\n print(i,end=\" \")", "n,k = [int(x) for x in input().split()]\r\n\r\nif k%2 == 0:\r\n print(-1)\r\nelse:\r\n # a completely unsorted list of length n\r\n # will have 2(n-1) child calls\r\n\r\n if k > 2*n-1:\r\n print(-1)\r\n else:\r\n arr = [n-x for x in range(n)]\r\n\r\n sorts = 2*n-1-k\r\n\r\n segs = [[(0,n,n//2)]]\r\n\r\n layers = 0\r\n nCopy = n\r\n\r\n while nCopy:\r\n layers += 1\r\n nCopy //= 2\r\n\r\n for x in range(layers):\r\n newSeg = []\r\n for l,r,mid in segs[x]:\r\n if mid-l > 1:\r\n newSeg.append((l,mid,(mid+l)//2))\r\n if r-mid > 1:\r\n newSeg.append((mid,r,(mid+r)//2))\r\n segs.append(newSeg)\r\n for x in range(sorts//2):\r\n while not segs[-1]:\r\n segs.pop()\r\n l,r,mid = segs[-1].pop()\r\n newPart = arr[mid:r] + arr[l:mid]\r\n arr[l:r] = newPart\r\n print(' '.join([str(x) for x in arr]))\r\n\r\n \r\n", "import os\r\nimport sys\r\nimport copy\r\nnum = 0\r\na = None\r\n# sys.stdin = open(os.path.join(os.path.dirname(__file__),'35.in'))\r\nk = None\r\ndef solve():\r\n global k,a\r\n n, k = map(lambda x:int(x), input().split())\r\n savek = copy.deepcopy(k)\r\n # print(a)\r\n a = [_+1 for _ in range(n)]\r\n \r\n def mgsort(l, r):\r\n global num,a,k\r\n mid = (l+r) >> 1\r\n if r - l == 1 or k == 1:\r\n return\r\n k -= 2\r\n a[l:mid] , a[mid:r] = a[mid:r] , a[l:mid]\r\n mgsort(l, mid)\r\n mgsort(mid, r)\r\n if k % 2 != 0: \r\n mgsort(0, n)\r\n \r\n if k == 1:\r\n for i in a:\r\n print(i,sep=' ',end=' ')\r\n else:\r\n print(-1)\r\n\r\nsolve()", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/14 15:30\r\n\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\n\r\nif k & 1 == 0 or k > 2*n-1:\r\n print(-1)\r\nelse:\r\n a = [0] * n\r\n gs = (k-1)//2\r\n\r\n def unsort(l, r, v):\r\n if l == r-1:\r\n a[l] = v\r\n else:\r\n global gs\r\n if gs > 0:\r\n gs -= 1\r\n mid = (l+r)//2\r\n unsort(l, mid, v+r-mid)\r\n unsort(mid, r, v)\r\n else:\r\n for i in range(r-l):\r\n a[l+i] = v+i\r\n\r\n unsort(0, n, 1)\r\n\r\n print(' '.join([str(x) for x in a]))", "def arr(n,k,l):\r\n global flag\r\n \r\n if k == 0:\r\n return(list(range(l,l+n)))\r\n \r\n if n == 1:\r\n flag = True\r\n return([0])\r\n \r\n \r\n if (k%4 == 2): k1 = k2 = k//2 - 1 \r\n else:\r\n k1 = (k-4)//2\r\n k2 = k1+2\r\n \r\n n1 = n//2\r\n n2 = n-n1\r\n \r\n a1 = arr(n1,k1,l+n2)\r\n a2 = arr(n2,k2,l)\r\n \r\n a1.extend(a2)\r\n return( a1 )\r\n \r\nn,k = [int(i) for i in input().split()]\r\n \r\nflag = False\r\n \r\nans = arr(n,k-1,1)\r\n \r\nif (k%2 == 0): flag = True\r\n \r\nif flag: print(-1)\r\nelse:\r\n for i in ans: print(i,end = \" \")", "n, k = map(int, input().split())\r\ndef func(aux, l, r, k):\r\n if k[0] <= 0:\r\n return\r\n if l >= r - 1:\r\n return\r\n k[0] = k[0] - 2\r\n m = (l + r) // 2\r\n aux[m], aux[m - 1] = aux[m - 1], aux[m]\r\n func(aux, l, m, k)\r\n func(aux, m, r, k) \r\nif k % 2 == 0 or k > 2 * n:\r\n print(-1)\r\nelse:\r\n k = [k - 1]\r\n aux = [i for i in range(1, n + 1)]\r\n func(aux, 0, n, k) \r\n if not k[0]:\r\n print(*aux)\r\n else:\r\n print(-1)\r\n " ]

[ "\r\ndef count_primes(num):\r\n #does not consider num as a prime number\r\n count = 0\r\n\r\n for divisor in range(2, int(num**0.5)+1):\r\n if num % divisor == 0: count += 1\r\n\r\n while num % divisor == 0:\r\n num /= divisor\r\n \r\n if num > 1: count += 1 #num itself is prime\r\n\r\n return count\r\n\r\n\r\ndef count_almost_primes(num):\r\n count = 0\r\n for num in range(1, num+1):\r\n if count_primes(num) == 2: count += 1\r\n return count\r\n\r\ndef main():\r\n num = int(input())\r\n print(count_almost_primes(num))\r\n\r\nmain()\r\n\r\n \r\n", "def main():\r\n N=int(input())\r\n ans=0\r\n for j in range(1,N+1):\r\n i=2\r\n num=j\r\n count=0\r\n while(num!=1):\r\n if(num%i==0):\r\n count+=1\r\n while(num%i==0):\r\n num//=i\r\n i+=1\r\n if count==2:\r\n ans+=1\r\n print(ans)\r\nif __name__=='__main__':\r\n main()", "def is_prime(n):\n c = 0\n if n == 1:\n return False\n for k in range(2,n):\n if n % k == 0:\n c = 1\n return False\n if c == 0:\n return True\nr = 0\nn = int(input())\nfor i in range(1, n + 1):\n c = 0\n for j in range(1, i):\n if i % j == 0:\n if is_prime(j):\n c += 1\n \n if c == 2:\n r += 1\nprint(r)\n \t \t \t\t\t \t \t \t\t\t\t\t\t", "a,p = [],[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499]\nfor i in range(0, len(p)):\n\tfor j in range(i+1, len(p)):\n\t\tk = 1\n\t\twhile p[j]*(p[i]**k) < 3000: \n\t\t\tl = 1\n\t\t\twhile (p[i]**k)*(p[j]**l) < 3000:\n\t\t\t\ta.append((p[i]**k)*(p[j]**l))\n\t\t\t\tl+=1\n\t\t\tk+=1\na, i, x= sorted(set(a)), 0, int(input())\nwhile i < len(a) and x >= a[i]: i+=1\nprint(i)", "def prime(n):\r\n factor = set()\r\n d = 2\r\n \r\n while d * d <= n:\r\n while n % d == 0:\r\n factor.add(d)\r\n n //= d\r\n d += 1\r\n if n >1:\r\n factor.add(n)\r\n \r\n return factor\r\n\r\n\r\nn = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(2, n+1):\r\n ans = prime(i)\r\n if len(ans) == 2:\r\n count += 1\r\n\r\nprint(count)\r\n \r\n ", "#code\r\ndef 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 \r\n return True\r\n##print(isprime(10)) \r\nn=int(input())\r\n\r\nc=0\r\nfor i in range(1,n+1):\r\n count=0\r\n for j in range(1,i):\r\n if i%j==0:\r\n if isprime(j):\r\n count+=1\r\n if count==2:\r\n c+=1\r\nprint(c)\r\n", "import math\r\n\r\nn = int(input())\r\nprimes = [True] * (n + 1)\r\nprimes[0] = primes[1] = False\r\nfor k in range(2, int(math.sqrt(n)) + 1):\r\n if primes[k]:\r\n for m in range(2 * k, n + 1, k):\r\n primes[m] = False\r\nprimesVector = [k for k in range(2, n + 1) if primes[k]]\r\n\r\nalmostPrimeCount = 0\r\nfor k in range(2, n + 1):\r\n divisors = 0\r\n for p in primesVector:\r\n if k % p == 0:\r\n divisors += 1\r\n if divisors == 2:\r\n almostPrimeCount += 1\r\n\r\nprint(almostPrimeCount)", "n = int(input())\r\n\r\nresult = 0\r\nfor i in range(1,n+1):\r\n cnt = 0\r\n for j in range(2,i+1):\r\n if i%j==0:\r\n isFound = False\r\n for k in range(2,j):\r\n if j%k==0:\r\n isFound = True\r\n break\r\n if not isFound:\r\n cnt += 1\r\n if cnt == 2:\r\n result += 1\r\nprint(result)", "\r\nn = int(input())\r\ncurrentSum = [set() for i in range(n + 1)]\r\n\r\n\r\ndef sieve():\r\n isPrime = [True for i in range(n + 1)]\r\n isPrime[1] = False\r\n currentNum = 1\r\n while(currentNum <= n):\r\n if isPrime[currentNum]:\r\n currentMultiple = 1\r\n while(currentNum * currentMultiple <= n):\r\n currentSum[currentNum * currentMultiple].add(currentNum)\r\n isPrime[currentNum * currentMultiple] = False\r\n currentMultiple += 1\r\n currentNum += 1\r\n\r\n\r\nsieve()\r\ncount = 0\r\nfor num in currentSum:\r\n if len(num) == 2:\r\n count += 1\r\n\r\n\r\nprint(count)\r\n", "n = int(input())\ns = []\nsum1 = 0\n# for i in range(2, n + 1):\n# for j in range(2, i // 2 + 1):\n# if i % j == 0:\n# sum1 = sum1 + 1\n# if sum1 == 0:\n# s.append(i)\n# sum1 = 0\n\n# print(s)\nsum0 = 0\nsum2 = 0\nfor i in range(2, n + 1):\n for j in range(2, i // 2 + 1):\n if i % j == 0:\n sum1 = sum1 + 1\n if sum1 == 0:\n s.append(i)\n sum1 = 0\n for j in range(2, i + 1):\n if i % j == 0 and j in s:\n sum0 = sum0 + 1\n if sum0 == 2:\n sum2 = sum2 + 1\n sum0 = 0\nprint(sum2)\n\t \t\t \t\t\t\t\t \t \t \t \t \t \t \t", "import math\r\nn = int(input())\r\nif n<6:\r\n print(0)\r\n exit()\r\nmaximum_count = 0\r\nfor i in range(6,n+1):\r\n count = 0\r\n for j in range(2,int(math.sqrt(i))+1):\r\n if i%j==0:\r\n count+=1\r\n while i%j==0:\r\n i = i//j\r\n if i!=1:\r\n count+=1\r\n # print(count)\r\n if count==2:\r\n maximum_count+=1\r\nprint(maximum_count) ", "def get_primes(n):\r\n isprimes = [False, False] + [True] * (n - 1)\r\n primes = []\r\n for i in range(2, n + 1):\r\n if isprimes[i]:\r\n primes.append(i)\r\n for p in range(i, n + 1, i):\r\n isprimes[p] = False\r\n return primes\r\n\r\nn = int(input())\r\nprimes = get_primes(n)\r\nans = 0\r\nfor i in range(2, n + 1):\r\n cnt = 0\r\n for x in primes:\r\n if x > i:\r\n break\r\n if i % x == 0:\r\n cnt += 1\r\n if cnt == 2:\r\n ans += 1\r\nprint(ans)", "from collections import defaultdict\r\nfrom collections import Counter\r\nn = int(input())\r\nans = 0\r\nfor num in range(6 , n + 1):\r\n \r\n d = 2\r\n \r\n count = set()\r\n while d * d <= num:\r\n while num%d==0:\r\n count.add(d)\r\n num/= d\r\n \r\n d += 1\r\n if num > 1:\r\n count.add(num)\r\n if len(count) == 2:\r\n ans += 1\r\n\r\nprint(ans)", "n=int(input())\r\nar=[0]*(n+1)\r\nans=0\r\nfor k in range(2,n+1):\r\n if ar[k]==2:\r\n ans+=1\r\n if ar[k]==0:\r\n for p in range(k,n+1,k):\r\n ar[p]+=1\r\nprint(ans)", "def helper():\n count = 0\n n = int(input())\n for i in range(n+1):\n if trial_division_simple(i) == 2:\n count += 1\n return count\n\ndef trial_division_simple(n):\n factorization = set()\n d = 2\n while d * d <= n:\n while n % d == 0:\n factorization.add(d)\n n //= d\n d += 1\n if n > 1:\n factorization.add(n)\n return len(factorization)\nprint(helper())", "\n\"\"\"prime=[True]*3000\n\n\ndef Sieve(n):\n li=[]\n p = 2\n cnt=0\n while (p * p <= n):\n if (prime[p] == True):\n\n for i in range(p * p, n+1, p):\n prime[i] = False\n p += 1\n\n\n\n\ndef almost(n):\n\n ans = 0\n\n\n for i in range(6, n + 1):\n\n\n c = 0\n for j in range(2, int(i**(1/2)) + 1):\n\n\n if i % j == 0:\n\n if j * j == i:\n if prime[j]:\n c += 1\n else:\n if prime[j]:\n c += 1\n if prime[i // j]:\n c += 1\n\n if c == 2:\n ans += 1\n\n return ans\n\nn=int(input())\nif n<=5:\n print(0)\nelse:\n Sieve(n)\n print(almost(n))\"\"\"\n\n\nn=int(input())\nprime=[0]*(n+1)\nfor i in range (2,(n+1)):\n if prime[i]==0:\n for j in range(2*i,n+1,i):\n prime[j]+=1\nprint(prime.count(2))\n\n \t \t\t\t\t \t \t \t\t\t \t\t \t \t", "n = int(input())\r\n\r\ni = 2\r\na = [0] * 3005\r\n\r\nfor i in range(2, n + 1):\r\n\r\n if a[i] > 0 :\r\n continue\r\n\r\n for j in range(i * 2, n + 1, i):\r\n a[j] += 1\r\n \r\n\r\nans = 0\r\n\r\nfor i in range(2, n + 1):\r\n if a[i] == 2 :\r\n ans += 1\r\n\r\nprint(ans)", "n=int(input())\r\ndef check(n):\r\n i=2\r\n j=0\r\n k=1\r\n while n>1:\r\n u=n%i==0\r\n if u:\r\n while n>1:\r\n n/=i\r\n if n%i>0:\r\n break\r\n if i==3:\r\n k=2\r\n i+=k\r\n if u:\r\n j+=1\r\n if j>2:\r\n return False\r\n return j==2\r\ns=0\r\nfor i in range(6,n+1):\r\n if check(i):\r\n s+=1\r\nprint(s)\r\n ", "n=int(input())\r\nMM=n//2+1\r\nprime=[True for i in range(MM)]\r\nprimes=[]\r\nfor i in range(2, MM):\r\n if prime[i]:\r\n for j in range(i+i, MM, i):\r\n prime[j] = False\r\n primes.append(i)\r\nans = 0\r\nfor i in range(6, n + 1):\r\n cnt = 0\r\n for p in primes:\r\n if i % p == 0:\r\n cnt += 1\r\n if cnt == 2:\r\n ans += 1\r\nprint(ans)", "# The same file will be used throughout Problem Set by saving after writing different codes\r\ndef numsList(num):\r\n arr = [0 for x in range(num+1)];\r\n for x in range(2, num + 1):\r\n if arr[x] == 0:\r\n i = 2 * x;\r\n while i < num + 1:\r\n arr[i] += 1;\r\n i += x;\r\n return arr;\r\n\r\nn = int(input());\r\narr = numsList(n);\r\ncount = 0;\r\nfor x in arr:\r\n if x == 2:\r\n count += 1;\r\nprint(count);", "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\ndef count_almost_prime(n):\r\n count = 0\r\n for num in range(1, n + 1):\r\n prime_divisors = set()\r\n for i in range(2, num):\r\n if num % i == 0 and is_prime(i):\r\n prime_divisors.add(i)\r\n if len(prime_divisors) > 2:\r\n break\r\n if len(prime_divisors) == 2:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\n\r\nresult = count_almost_prime(n)\r\n\r\nprint(result)\r\n", "from collections import defaultdict\r\ndef isprime(n):\r\n\r\n arr = defaultdict(int)\r\n d = 2\r\n\r\n while d*d <= n:\r\n\r\n while n % d == 0:\r\n n //= d\r\n arr[d] += 1\r\n\r\n if len(arr) > 2:\r\n return False\r\n d += 1\r\n if n > 1:\r\n arr[n] += 1 \r\n\r\n return True if len(arr) == 2 else False \r\n\r\n \r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(2,n+1):\r\n if isprime(i):\r\n count += 1\r\n \r\nprint(count)\r\n ", "from collections import *\r\nfrom math import ceil, gcd,inf,sqrt\r\nfrom functools import *\r\nimport sys\r\nimport bisect\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n@lru_cache\r\ndef prime(num):\r\n if num==2 or num==3:return True\r\n elif num%6!=1 and num%6!=5:return False\r\n for i in range(6,num//2+1,6):\r\n if num%(i-1)==0 or num%(i+1)==0:return False\r\n return True\r\nlist_prime =[i for i in range(2,3001//2) if prime(i)] \r\nleng=len(list_prime);LIST=set()\r\nfor i in range(leng):\r\n for j in range(i+1,leng):\r\n n,m=list_prime[i],list_prime[j]\r\n ji=n*m;a,b=1,1;f=1\r\n while ji<3000: \r\n \r\n while ji<3000:b+=1;LIST.add(ji);ji=(n**a)*(m**b)\r\n a+=1;b=1\r\n ji=(n**a)*(m**b)\r\nLIST=sorted(list(LIST)) \r\n# print(LIST) \r\nn=int(input())\r\nprint(bisect.bisect(LIST,n))\r\n\r\n \r\n ", "import math\r\n\r\n\r\ndef check(x: int):\r\n if (x < 2):\r\n return False\r\n \r\n counter = 0\r\n p = 2\r\n \r\n while (x > 1):\r\n divided = False\r\n \r\n while (x % p == 0):\r\n divided = True\r\n x //= p\r\n \r\n p += 1\r\n \r\n if (divided == True):\r\n counter += 1\r\n \r\n return counter == 2\r\n\r\n\r\nn = int(input())\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n if (check(i) == True):\r\n ans += 1\r\n\r\nprint(ans)", "arr=int(input())\ndicti={}\nfor num in range(2,arr+1):\n\tdicti[num]=0\nfor k in dicti.keys():\n\tif dicti[k]==0:\n\t\tg=k\n\t\twhile g<(len(dicti.keys())+2):\n\t\t\tdicti[g]+=1\n\t\t\tg+=k\ncount=0\nfor key in dicti.keys():\n\tif(dicti[key]==2):\n\t\tcount+=1\nprint(count)\n\n", "n=int(input())\r\nres=[0]*(n+1)\r\nfor i in range(2,n//2+1):\r\n if res[i]==0:\r\n for k in range(2*i,n+1,i):\r\n res[k]+=1\r\n \r\nprint(res.count(2))", "prime = []\r\n\r\nprm = [True for i in range(0,3000)]\r\nfor i in range(2,3000):\r\n if prm[i]==True:\r\n j=2*i\r\n while j<3000:\r\n prm[j]=False\r\n j+=i\r\nfor i in range(2,3000):\r\n if prm[i]:\r\n prime.append(i)\r\n\r\nn=int(input())\r\nans=0\r\nfor i in range(6,n+1):\r\n c=0\r\n for j in prime:\r\n if i%j==0:\r\n c+=1\r\n if c==2:\r\n ans+=1\r\nprint(ans)\r\n", "def prime (n):\r\n lst=[]\r\n for i in range (2,n+1):\r\n count=0\r\n for j in range (2,i+1):\r\n if i%j== 0 :\r\n count= count+1\r\n if count == 1:\r\n \r\n lst.append(i)\r\n return (lst)\r\n \r\n\r\n\r\n\r\nnum=int(input())\r\nt = prime (num)\r\ncount2 = 0\r\n\r\nl=[]\r\nfor s in range (2,num+1):\r\n count1 = 0\r\n \r\n \r\n for no in t:\r\n if no <= s:\r\n if s%no==0:\r\n count1= count1+ 1\r\n \r\n if count1 == 2:\r\n l.append(s)\r\nprint (len(l)) ", "n1 = int(input())\r\n\r\n\r\ncount1 = 0\r\nfor n in range(2,n1+1):\r\n arr = []\r\n count = 0\r\n for i in range(2, n):\r\n if n % i == 0:\r\n arr.append(i)\r\n prime = [True for i in range(n + 1)]\r\n prime[1] = False\r\n p = 2\r\n while p * p <= n:\r\n if prime[p] == True:\r\n for y in range(p * p, n + 1, p):\r\n prime[y] = False\r\n p += 1\r\n for x in arr:\r\n if prime[x] == True:\r\n count += 1\r\n if count == 2:\r\n count1+=1\r\nprint(count1)", "import math\r\nimport random\r\nimport decimal\r\nimport fractions\r\nimport copy\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n cnt = 0; res = 0\r\n for i in range (1, n + 1):\r\n res = 0\r\n for x in range (2, math.isqrt(i) + 1):\r\n if i % x == 0:\r\n res += 1\r\n while i % x == 0: i /= x\r\n if i > 1: res += 1\r\n if res == 2: cnt += 1\r\n print(cnt)", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n limit = math.isqrt(n)\r\n for i in range(3, limit + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef hasExactlyTwoPrimeDivs(n):\r\n counter = 0\r\n for i in range(2, n // 2 + 1, 1):\r\n if n % i == 0 and isPrime(i):\r\n counter += 1\r\n return counter == 2\r\n\r\n\r\nnum = int(input())\r\nans = 0\r\nfor i in range(6, num + 1):\r\n if hasExactlyTwoPrimeDivs(i):\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\npr=0\r\n\r\ndef RAZ(n):\r\n a = set()\r\n for i in range(2, n+1):\r\n while n%i==0:\r\n n=n//i\r\n a.add(i)\r\n if a==[i, i]:\r\n break\r\n if len(a)>2:\r\n break\r\n if len(a)==2:\r\n global pr\r\n pr+=1\r\nfor i in range(1,n+1):\r\n RAZ(i)\r\nprint(pr)\r\n\r\n", "n=int(input())\r\na=[0]*(n+1)\r\nfor i in range (2,n+1):\r\n if a[i]==0:\r\n for j in range(2*i,n+1,i):\r\n a[j]+=1\r\nprint(a.count(2))", "n = int(input())\ncount = 0\nfor i in range(6, n+1):\n tempI = i\n tempCount = 0\n for j in range(2, n):\n if(tempI % j == 0):\n tempCount+=1\n while(tempI % j == 0):\n tempI /= j\n if tempI == 1 and tempCount == 2:\n count+=1\nprint(count)\n\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 prime = [0] * (N + 1)\r\n for i in range(2, N + 1):\r\n if prime[i] == 0:\r\n for j in range(2 * i, N + 1, i):\r\n prime[j] += 1\r\n return prime\r\n\r\n\r\nN = int(input())\r\nA = Prime(N)\r\nprint(A.count(2))\r\n", "def is_prime(n): \r\n\tif n<2: return False\r\n\tfor i in range(2,n):\r\n\t\tif i*i>n: break\r\n\t\tif n%i==0: return False\r\n\treturn True\r\nn = int(input())\r\nB = list(range(2,n+1))\r\nf= 0\r\nfor n in B:\r\n c = 0\r\n A = []\r\n for i in range(1,n):\r\n if i * i > n: break\r\n if n % i == 0:\r\n A.append(i)\r\n if i != n // i:\r\n A.append(n // i)\r\n for k in A:\r\n if is_prime(k) == True: c += 1\r\n if c==2:f+=1\r\nprint(f)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def is_almost_simple(num):\r\n dividers = 0\r\n\r\n for div in simples:\r\n if num % div == 0:\r\n dividers += 1\r\n\r\n if dividers > 2:\r\n return False\r\n\r\n if dividers < 2:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef is_simple(num):\r\n for divider in simples:\r\n if num % divider == 0:\r\n return False\r\n if divider > num // 2:\r\n return True\r\n return True\r\n\r\n\r\nsimples = []\r\nfor i in range(2, 1500):\r\n if is_simple(i):\r\n simples.append(i)\r\n\r\nn = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n count += is_almost_simple(i)\r\n\r\nprint(count)\r\n", "vat = int(input())\r\ncount = 0\r\n\r\n\r\nfor i in range(6,vat+1):\r\n n = i\r\n factors = set()\r\n d = 2\r\n while d * d <= i:\r\n while n % d == 0:\r\n factors.add(d)\r\n n = n / d\r\n d += 1\r\n if n > 1 :\r\n factors.add(n)\r\n \r\n if len(factors) == 2:\r\n count += 1\r\nprint(count) ", "import math\r\ndef prime(n):\r\n if n<=0:\r\n return 0\r\n c=int(math.sqrt(n))\r\n for i in range(2,c+1):\r\n if n%i==0:\r\n return 0\r\n return 1\r\ndef fun(n):\r\n c=0\r\n for i in range(2,n):\r\n if n%i==0 and prime(i):\r\n c+=1\r\n if c==2:\r\n return 1\r\n else:\r\n return 0\r\n \r\nn=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n if fun(i):\r\n c+=1\r\nprint(c)\r\n", "n=int(input())\r\na=[x for x in range(2,n+1)]\r\nfor x in a:\r\n\tfor y in range(2,n):\r\n\t\ttry:\r\n\t\t\ta.remove(x*y)\r\n\t\texcept:\r\n\t\t\tcontinue\r\ns=0\r\nfor x in range(1,n+1):\r\n\tt=0\r\n\tfor y in a:\r\n\t\tif x%y==0:\r\n\t\t\tt+=1\r\n\tif t==2:\r\n\t\ts+=1\r\nprint(s)\r\n\r\n\r\n", "import math\r\n\r\n\r\ndef isPrime(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 for i in range(5, int(math.sqrt(n) + 1), 6):\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nans = 0\r\nfor num in range(2, n + 1):\r\n broken = False\r\n divs = set()\r\n for i in range(2, num+1):\r\n if num % i == 0 and isPrime(i):\r\n divs.add(i)\r\n if len(divs) > 2:\r\n broken = True\r\n divs = set()\r\n break\r\n if not broken and len(divs) == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "import math\nn=int(input())\nlt=[2]\nfor i in range(2,n+1):\n for j in range(2,int(math.sqrt(i))+2):\n if i%j==0:\n break\n else:\n lt.append(i)\nans=0\n#print(lt)\nfor i in range(2,n+1):\n c=0\n for j in lt:\n if i%j==0:\n c+=1\n #print(i,j)\n if c==2:\n ans+=1\nprint(ans)\n \t\t \t\t \t \t \t\t\t\t\t \t \t", "def Div(x):\r\n c=0\r\n for k in range (1,x):\r\n if x%k==0:\r\n c+=1\r\n return c\r\ndef primo(x):\r\n if Div(x)==1:\r\n return True\r\n else:\r\n return False\r\ndef Divprimos(x):\r\n n=0\r\n for j in range(1,x):\r\n if x%j==0 and primo(j):\r\n n+=1\r\n return n\r\n\r\nr=int(input())\r\nj=0\r\nfor k in range (1,r+1):\r\n if Divprimos(k)==2:\r\n j+=1\r\nprint(j)", "x = int(input())\r\ncount = 0\r\nfor i in range(1,x+1):\r\n fact = set()\r\n d = 2\r\n while d*d <= i:\r\n while i % d == 0:\r\n fact.add(d)\r\n i //= d\r\n d += 1\r\n if i > 1: \r\n fact.add(i)\r\n if len(fact) == 2:\r\n count += 1\r\nprint(count)", "import math\r\n\r\ndef IsPrime(num):\r\n if num==2 :\r\n return True\r\n if num<2 or num%2==0 :\r\n return False\r\n limit = int(math.sqrt(num))\r\n for i in range(3,limit+1,2):\r\n if num%i==0 :\r\n return False\r\n return True\r\n\r\ndef hasTwoPrimeDiv(n):\r\n counter=0;\r\n for i in range (2,int(n/2+1)):\r\n counter+=( n%i==0 and IsPrime(i))\r\n if counter>2 :\r\n break\r\n return (counter==2)\r\n\r\nn = int(input())\r\nans=0\r\nfor i in range (6,n+1):\r\n ans+=hasTwoPrimeDiv(i)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "def prime(num):\r\n count = 0\r\n divisor=2\r\n for i in range(1,num +1):\r\n if num % i == 0:\r\n count +=1\r\n if count==divisor:\r\n return True\r\n else:\r\n return False\r\n\r\ncount=0\r\nfor i in range(6,int(input())+1):\r\n c=0\r\n li=[]\r\n for j in range(1,i+1):\r\n if i%j==0:\r\n if prime(j)==True:\r\n li+=[j]\r\n if len(li)==2:\r\n count+=1\r\nprint(count)", "T = int(input())\n\ndef isprime(n) :\n # Corner cases\n if n <= 1 :\n return False\n if n <= 3 :\n return True\n # This is checked so that we can skip\n # middle five numbers in below loop\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 = i + 6\n return True\n\ndef isalmostprime(number):\n\tcount = 0\n\ti = 2\n\thalf = int(number/2)\n\twhile(i <= half):\n\t\tif number % i == 0 and isprime(i):\n \t count += 1\n\t\tif count > 2:\n\t\t\tbreak\n\t\ti += 1\n\tif count == 2:\n\t\treturn True\n\telse:\n\t\treturn False\n\nresult_count = 0\nfor t in range(T+1):\n\tif isalmostprime(t):\n\t\tresult_count += 1\nprint(result_count)\n", "# return primes up to and including n\r\ndef generate_primes(n):\r\n is_primes = [False, False] + [True] * (n - 1)\r\n primes = []\r\n for i in range(2, n + 1):\r\n if is_primes[i]:\r\n primes.append(i)\r\n for p in range(i * 2, n + 1, i):\r\n is_primes[p] = False\r\n return primes\r\n\r\nn = int(input())\r\nprimes = generate_primes(n)\r\nans = 0\r\nfor i in range(2, n + 1):\r\n cnt = 0\r\n for x in primes:\r\n if x > i:\r\n break\r\n if i % x == 0:\r\n cnt += 1\r\n if cnt == 2:\r\n ans += 1\r\nprint(ans)", "def pdd(x):\r\n d={}\r\n i=2\r\n while i*i<=x:\r\n if x%i==0:\r\n d[i]=0\r\n while x%i==0:\r\n x//=i\r\n d[i]+=1\r\n i+=1\r\n if x!=1:\r\n d[x]=1\r\n return d\r\nn=int(input())\r\nc=0\r\nfor i in range(1, n+1):\r\n c+=len(pdd(i))==2\r\nprint(c)", "import sys\r\ninput = sys.stdin.readline\r\np=[0 for i in range(30000)]\r\ni=2\r\nwhile i<30000:\r\n if p[i]==0:\r\n curr=i\r\n while curr<30000:\r\n p[curr]+=1\r\n curr+=i\r\n i+=1\r\n#print(p)\r\nans=0\r\nn=int(input())\r\nfor i in range(2,n+1):\r\n if p[i]==2:\r\n ans+=1\r\nprint(ans)", "def prime_factorization(num):\r\n factors = []\r\n d = 2\r\n while d * d <= num:\r\n while num % d == 0:\r\n factors.append(d)\r\n num = num // d\r\n d+=1\r\n \r\n if num > 1:\r\n factors.append(num)\r\n \r\n return factors\r\n\r\nn = int(input())\r\ncount = 0\r\nfor num in range(n+1):\r\n factors = prime_factorization(num)\r\n if len(set(factors)) == 2:\r\n count += 1\r\n \r\nprint(count)\r\n ", "uinput = int(input())\r\nresult = 0\r\n\r\nfor i in range(1, uinput+1):\r\n counter = 0\r\n n = i\r\n for j in range(2, i):\r\n if n%j == 0:\r\n counter += 1\r\n while n%j==0:\r\n\r\n n = n/j\r\n\r\n \r\n if counter == 2:\r\n result += 1\r\n\r\nprint(result)", "import sys, io, os\r\nfrom math import gcd, lcm, floor, ceil, factorial, comb, perm, sqrt, log, log10, log2\r\nfrom collections import OrderedDict, namedtuple, Counter, deque, defaultdict\r\nfrom statistics import mean, median, mode, fmean, geometric_mean, harmonic_mean, variance, stdev\r\nfrom string import ascii_letters, ascii_lowercase, ascii_uppercase, digits, hexdigits\r\nfrom string import octdigits, punctuation, printable, whitespace\r\nfrom itertools import combinations, permutations, chain\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ninput = sys.stdin.readline\r\nMOD = 1000000007\r\nINF = float('inf')\r\n\r\n\r\n\r\ndef intlistinp():\r\n return list(map(int, input().split()))\r\n\r\n\r\n\r\ndef strlistinp():\r\n return list(map(str, input().split()))\r\n\r\n\r\n\r\ndef inttupinp():\r\n return tuple(map(int, input().split()))\r\n\r\n\r\n\r\ndef strtupinp():\r\n return tuple(map(str, input().split()))\r\n\r\n\r\n\r\ndef intdeqinp():\r\n return deque(map(int, input().split()))\r\n\r\n\r\n\r\ndef strdeqinp():\r\n return deque(map(str, input().split()))\r\n\r\n\r\n\r\ndef intsetinp():\r\n return set(map(int, input().split()))\r\n\r\n\r\n\r\ndef strsetinp():\r\n return set(map(str, input().split()))\r\n\r\n\r\n\r\ndef intmapinp():\r\n return map(int, input().split())\r\n\r\n\r\n\r\ndef strmapinp():\r\n return map(str, input().split())\r\n\r\n\r\n\r\ndef inp():\r\n return input().rstrip()\r\n\r\n\r\n\r\ndef intinp():\r\n return int(input())\r\n\r\n\r\n\r\ndef floatinp():\r\n return float(input())\r\n\r\n\r\n\r\ndef floatmapinp():\r\n return map(float, input().split())\r\n\r\n\r\n\r\ndef println(*argv, end = ' '):\r\n output = ''\r\n for arg in argv: output += str(arg) + end\r\n output += '\\n'\r\n return sys.stdout.write(output)\r\n\r\n\r\n\r\ndef printsl(*argv, end = ' '):\r\n output = ''\r\n for arg in argv: output += str(arg) + end\r\n return sys.stdout.write(output)\r\n\r\n\r\n\r\n# Use List for indexing else use deque\r\n\r\n\r\nclass Solution:\r\n\r\n def __init__(self):\r\n n = intinp()\r\n ans = 0\r\n\r\n checks = [0] * (n + 1)\r\n prime_factors = [0] * (n + 1)\r\n\r\n for i in range(2, n + 1):\r\n if checks[i] == 0:\r\n for j in range(2 * i, n + 1, i):\r\n checks[j] = 1\r\n prime_factors[j] += 1\r\n\r\n if prime_factors[i] == 2:\r\n ans += 1\r\n\r\n println(ans)\r\n\r\nSolution()", "def helper(num):\r\n d = 2\r\n st = set()\r\n while d * d <= num:\r\n while num % d == 0:\r\n num//= d\r\n st.add(d)\r\n \r\n d+=1\r\n # print(st)\r\n if num > 1:\r\n st.add(num)\r\n if len(st) == 2:\r\n # print(st)\r\n return st\r\n else:\r\n return []\r\n\r\ndef func(num):\r\n # num = int(input)\r\n d= 2\r\n ans = 0\r\n\r\n for i in range(5,num+1):\r\n temp = helper(i)\r\n # print(temp)\r\n if len(temp)==2:\r\n ans+=1\r\n\r\n print(ans)\r\n\r\nnum = int(input())\r\nfunc(num)", "n = int(input())\n\nc = 0\nfor i in range(6 , n+1) : # 1 2 3 4 5 i == 1\n count = 0\n for j in range(2 ,i+1) : #j == 1\n \n if i % j == 0 : # div or not\n for k in range(2 , j) : #prime check\n if j % k == 0 :\n break\n else :\n count += 1\n if count == 2 :\n c += 1\nprint(c)\n\n\t\t \t \t\t\t\t\t \t\t \t\t \t\t \t\t\t\t\t\t\t\t", "n=int(input())\n\nprime=[0]*(n+1)\nimport math\nprime[0]=0\nprime[1]=0\nfor i in range(2,n+1):\n\tfor j in range(i,n+1,i):\n\t\tif j%i==0 and j!=i:\n\t\t\tif prime[i]==0:\n\t\t\t\tprime[j]+=1\n\n\t\n\nc=0\nfor i in range(2,n+1):\n\tif prime[i]==2:\n\t\tc+=1\n\nprint(c)", "n=int(input());\r\nc=[0]*(n+1);\r\nfor i in range(2,n+1):\r\n if c[i]==0:\r\n for j in range(2*i,n+1,i):\r\n c[j]+=1;\r\nprint(c.count(2))", "n = int(input())\r\ndef factorization(n):\r\n p = []\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n p.append(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n p.append(n)\r\n return p\r\nres = 0\r\nfor i in range(1, n + 1):\r\n if len(set(factorization(i))) == 2:\r\n res += 1\r\nprint(res)", "import math\n\ndef isPrime(k):\n flag = 1\n for i in range(2,int(math.sqrt(k)+1)):\n if k%i== 0:\n flag = 0\n break\n return flag\n\nn = int(input())\nalmost_prime_Count = 0 \n\nfor i in range(2,n+1):\n prime_count = 0\n for j in range(2,i):\n if i%j == 0 and isPrime(j): \n prime_count+=1\n if(prime_count == 2):\n almost_prime_Count+=1\n \nprint(almost_prime_Count)\n", "import math\r\n\r\n\r\ndef isPrime(num: int) -> bool:\r\n if num == 2:\r\n return True\r\n if num < 2 or num % 2 == 0:\r\n return False\r\n limit = int(math.sqrt(num))\r\n\r\n for i in range(3, limit + 1, 2):\r\n if num % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef isAlmostPrime(num: int) -> bool:\r\n counter = 0\r\n\r\n for i in range(2, num):\r\n\r\n if num % i == 0 and isPrime(i):\r\n counter += 1\r\n\r\n # if counter == 2:\r\n # return True\r\n #\r\n # return False\r\n\r\n return counter == 2\r\n\r\n\r\nn = int(input())\r\n\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if isAlmostPrime(i):\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\"\"\"\r\nn == 10\r\n\r\n1,2,3,4,5,6,7,8,9,10\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n", "\n\ndef prime_fact1(x1): \n divisor1 = 2\n flag1 = []\n while divisor1 <= x1:\n if x1%divisor1 == 0:\n x1 = x1/divisor1 \n if divisor1 not in flag1:\n flag1.append(int(divisor1))\n else:\n divisor1 += 1 #divisor = divisor + 1\n # if len(flag) == 2:\n # return True\n if len(flag1) == 2:\n return True\n else:\n return False\n\n\n\nx = int(input())\ncount = 0\nfor j in range(6,x+1):\n if prime_fact1(j) == True:\n count+=1\nprint(count)\n\t\t\t\t \t\t\t \t \t\t \t \t \t \t\t \t\t", "import math\r\ndef primeFactors(n): \r\n s=set()\r\n while(n%2)==0:\r\n s.add(2) \r\n n//=2\r\n for i in range(3,int(math.sqrt(n))+1,2): \r\n while n % i== 0: \r\n s.add(i) \r\n n//=i \r\n if(n>2): \r\n s.add(n)\r\n return s\r\nn=int(input())\r\nif(n==1):\r\n print(0)\r\nelse:\r\n c=0\r\n for i in range(2,n+1):\r\n if(len(primeFactors(i))==2):\r\n c+=1\r\n print(c)", "n = int(input())\r\n\r\nans = 0\r\nfor i in range(2, n+1):\r\n j = 2\r\n count = 0\r\n while (j <= i):\r\n if i%j == 0:\r\n count += 1\r\n while i%j == 0:\r\n i = i/j\r\n j += 1\r\n if count == 2:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\n\r\n\r\ndef findPrimes(num):\r\n factors = set()\r\n d = 2\r\n\r\n while d * d <= num:\r\n while num % d == 0:\r\n factors.add(d)\r\n num //= d\r\n d += 1\r\n if num > 1:\r\n factors.add(num)\r\n return factors\r\n\r\n\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if len(findPrimes(i)) == 2:\r\n count += 1\r\nprint(count)\r\n", "import math\r\ndef isprime(n):\r\n for i in range(2,n):\r\n if(n%i==0):\r\n return False\r\n if(n==1):\r\n return False\r\n return True\r\nn=int(input())\r\nnum=0\r\nfor j in range(1,n+1):\r\n f=[]\r\n c=0\r\n for k in range(2,int(math.sqrt(n))+1):\r\n if(j%k==0):\r\n f.append(k)\r\n f.append(j//k)\r\n f1=list(set(f))\r\n for i in f1:\r\n if(isprime(i)):\r\n c+=1\r\n if(c==2):\r\n num+=1\r\nprint(num)", "n = int(input())\r\ncount = 0\r\ndef prime(n):\r\n factor = set()\r\n \r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n factor.add(d)\r\n n//=d\r\n d += 1\r\n if n > 1:\r\n factor.add(n)\r\n \r\n if len(factor) == 2:\r\n return True\r\n return False\r\nfor i in range(n+1):\r\n if prime(i):\r\n count +=1 \r\nprint(count)\r\n \r\n \r\n\r\n ", "num = int(input())\r\nans = 0\r\nfor i in range(6, num+1):\r\n check = set()\r\n d = 2\r\n temp = i\r\n while d*d <= temp:\r\n while temp % d == 0:\r\n check.add(d)\r\n temp //= d\r\n if d == 2:\r\n d += 1\r\n else:\r\n d += 2\r\n if temp > 1:\r\n check.add(temp)\r\n if len(check) == 2:\r\n ans += 1\r\nif num < 6:\r\n print(0)\r\nelse:\r\n print(ans)", "n=int(input())\r\nt=0\r\nif n>3:\r\n for i in range(3,n+1):\r\n p,f=2,set()\r\n while(i!=1):\r\n if i%p==0:\r\n i=i//p\r\n f.add(p)\r\n else: p+=1\r\n if len(f)==2: t+=1\r\nprint(t)", "a = int(input())\n\ndef is_almost_prime(n):\n bench = []\n i = 2\n while i ** 2 <= n:\n if n % i == 0:\n if i not in bench:\n bench.append(i)\n if len(bench) == 3:\n return False\n n = n // i\n else:\n i += 1\n if n not in bench:\n bench.append(n)\n if len(bench) == 2:\n return True\n return False\n\nanswer = 0\n\nfor i in range(a):\n if is_almost_prime(i + 1):\n answer += 1\n\nprint(answer)\n", "x = int(input())\r\ny = []\r\nfor i in range(2, x + 1):\r\n z = 0\r\n for j in range(2, i):\r\n if i % j == 0:\r\n z = 1\r\n if z == 0:\r\n y.append(i)\r\ns = 0\r\nfor k in range(1, x + 1):\r\n count = 0\r\n for j in y:\r\n if k % j == 0:\r\n count += 1\r\n if count == 2:\r\n s += 1\r\nprint(s)\r\n\r\n", "#import sys\r\n#from collections import defaultdict\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\ndef findPrimes(n):\r\n if n < 3:\r\n return 0\r\n primeFactors = [2]\r\n i = 3\r\n count = 0\r\n while i <= n:\r\n j = 0\r\n check = set()\r\n while j < len(primeFactors):\r\n curr = i\r\n while curr % primeFactors[j] == 0:\r\n curr = curr // primeFactors[j]\r\n check.add(primeFactors[j])\r\n j += 1\r\n \r\n if not check:\r\n primeFactors.append(i)\r\n if len(check) == 2:\r\n count += 1\r\n i += 1\r\n return count\r\nn = inp()\r\nprint(findPrimes(n))\r\n \r\n \r\n ", "import math\r\ndef p(a):\r\n x=int(math.sqrt(a))\r\n for i in range(2,x+1):\r\n if a%i==0:\r\n return 0\r\n return 1\r\nn=int(input())\r\nk=0\r\nfor i in range(6,n+1):\r\n c=0\r\n x=int(math.sqrt(i))\r\n for j in range(2,x+1):\r\n if i%j==0:\r\n if p(j)==1:c+=1\r\n if j!=int(i/j) and p(i/j)==1:\r\n c+=1\r\n if c==2:k+=1\r\nprint(k)\r\n\r\n", "def sieve(n):\r\n p=[0]*(n+1)\r\n for i in range(2,n+1):\r\n if p[i]==0:\r\n for j in range(i,n+1,i):\r\n p[j] +=1\r\n return p\r\nn=int(input())\r\n\r\np=sieve(3000)\r\nans=0\r\nfor i in range(n+1):\r\n if p[i]==2:\r\n ans +=1\r\nprint(ans)\r\n", "n = int(input())\r\nans = 0\r\nif n <= 5:\r\n print(0)\r\n exit()\r\nfor i in range(6, n+1):\r\n fact = []\r\n d = 2\r\n while d * d <= i:\r\n while i % d == 0:\r\n fact.append(d)\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n fact.append(i)\r\n if len(set(fact)) == 2:\r\n ans += 1\r\n\r\nprint(ans)", "#26A\r\nn = int(input())\r\na = list(range(n+1))\r\n#print(a)\r\na[1] = 0\r\nlst = []\r\n\r\ni = 2\r\nwhile i <= n:\r\n if a[i] != 0:\r\n lst.append(a[i])\r\n for j in range(i, n+1, i):\r\n a[j] = 0\r\n i += 1\r\nc=0\r\n#print(lst)\r\nfor i in range(0,len(lst)-1):\r\n for j in range(i+1,len(lst)):\r\n \tif i!=j:\r\n \t\tx=lst[i]\r\n \t\ty=lst[j]\r\n \t\tif (x)*(y)<=n:\r\n \t\t\t\t\t\t\r\n \t\t\t\t\tc+=1\r\n \t\tfor k in range(1,n//(x*y)+1):\r\n \t\t\t#print(n//(x*y))\r\n \t\t\tfor kk in range(1,n//((x**k)*y)+1):\r\n \t\t\t\t#print(n//(x*y))\r\n \t\t\t\t#print((x**k)*(y**kk))\r\n \t\t\t\tif (x**k)*(y**kk)<=n and (k>1 or kk>1):\r\n \t\t\t\t\t#print((x**k)*(y**kk))\t\t\r\n \t\t\t\t\tc+=1\r\nprint(c)", "ans=0\r\nsimp=[]\r\na= int(input())\r\nfor i in range(1,((a+1)//2)+1):\r\n scr=0\r\n for x in range(1,((i+1)//2)+1):\r\n if i%x==0:\r\n scr+=1\r\n if scr>1:\r\n break\r\n if scr==1:\r\n simp.append(i)\r\nfor i in range(1,a+1):\r\n scr=0\r\n for x in simp:\r\n if i%x==0:\r\n scr+=1\r\n if scr>3:\r\n break\r\n if scr==3:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n primes = set()\r\n d = 2\r\n while d*d <=i:\r\n while i%d==0:\r\n primes.add(d)\r\n i//=d\r\n d+=1\r\n if i >1:\r\n primes.add(i)\r\n if len(primes)==2:\r\n count+=1\r\nprint(count)", "def distinct_factors(n, memo):\r\n if n not in memo:\r\n for num in range(2, n+1):\r\n if n % num == 0:\r\n other = distinct_factors(n // num, memo).copy()\r\n other.add(num)\r\n memo[n] = other\r\n break\r\n if num * num > n:\r\n memo[n] = set([n])\r\n break\r\n return memo[n]\r\n\r\n\r\nn = int(input())\r\nres = 0\r\nmemo = {1: set()}\r\n\r\nfor num in range(2, n+1):\r\n if len(distinct_factors(num, memo)) == 2:\r\n res += 1\r\n\r\nprint(res)\r\n", "import math\r\ndef isPrime(a):\r\n flag=0\r\n for i in range(2,int(math.sqrt(a))+1):\r\n if a%i==0:\r\n flag=1\r\n break\r\n if flag==0:\r\n return a\r\n else:\r\n return 0\r\nn=int(input())\r\ncount=0\r\nfor i in range(6,n+1):\r\n arr=[]\r\n for j in range(2,i+1):\r\n if i%j==0:\r\n p=isPrime(j)\r\n if p!=0:\r\n arr.append(p)\r\n if len(arr)==2:\r\n count+=1\r\nprint(count)", "num = int(input())\r\np, X = [], []\r\nfor n in range(1,num+1):\r\n count = 0\r\n p = []\r\n for i in range(1,n+1):\r\n if n%i == 0:\r\n p.append(i)\r\n for x in p:\r\n P = []\r\n for j in range(1,x+1):\r\n if x%j == 0:\r\n P.append(j)\r\n if len(P) == 2:\r\n count+=1\r\n if count == 2:\r\n X.append(n)\r\nprint(len(X))", "n = int(input())\r\n# info = [int(i) for i in input().split()]\r\ndp = [0]*(n+1)\r\nfor i in range(2,n+1):\r\n if dp[i] == 0:\r\n j = 2 * i\r\n while j <= n:\r\n dp[j] += 1 \r\n j += i \r\nans = 0 \r\nfor i in range(2,n+1):\r\n if dp[i] == 2:\r\n ans += 1 \r\nprint(ans)\r\n ", "\nn = int(input())\na = 0\nb = [False] * 3001\np = [0] * 3001\n\nfor i in range(2, n + 1):\n if (not b[i]):\n for j in range (i + i, n + 1, i):\n b[j] = True;\n p[j] = p[j] + 1\n\n if (p[i] == 2):\n a = a + 1;\n\n\n\nprint(a);\n\n \t\t \t\t \t \t \t \t \t\t", "from collections import deque\ndef ints():\n return map(int,input().split())\nn=int(input())\nsieve=[0 for i in range(n+1)]\nfor i in range(2,n+1):\n if not sieve[i]:\n for j in range(2*i,n+1,i):\n sieve[j]+=1\ncount=0\nfor i in range(n+1):\n if sieve[i]==2:\n count+=1\nprint(count)\n \n \n\n", "def quase_primo(n):\n divs = 0\n for i in range(2, int(n/2)+1):\n \n if n % i == 0:\n p = 0\n \n for j in range(2, i+1):\n if i % j == 0:\n p += 1\n\n if p == 1:\n divs += 1\n\n if divs == 2:\n return True\n else:\n return False\n\nn = int(input())\nquant = 0\nfor i in range(5, n+1):\n if quase_primo(i):\n quant += 1\n\nprint(quant)\n \t \t\t \t\t\t \t\t \t \t\t \t \t\t \t \t", "def f(n):\r\n t = 2\r\n s = set()\r\n while n != 1:\r\n while n % t == 0:\r\n n //= t\r\n s.add(t)\r\n else:\r\n t += 1\r\n if len(s) > 2:\r\n return 0\r\n if len(s) == 2:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nn = int(input())\r\ns = 0\r\nfor i in range(1, n + 1):\r\n s += f(i)\r\nprint(s)\r\n", "def Is_Prime(n):\r\n x=0\r\n for i in range(2,n):\r\n if n/i==int(n/i):\r\n x=x+1\r\n return 'NOT'\r\n break\r\n if x==0:\r\n return 'A'\r\ndef Is_Almost_Prime(n):\r\n y=0\r\n for j in range(2,n):\r\n if n/j==int(n/j) and Is_Prime(j)=='A':\r\n y=y+1\r\n if y>2:\r\n return 'NOT'\r\n break\r\n if y==2: \r\n return 'A' \r\nn=int(input())\r\nz=0\r\nfor k in range(1,n+1):\r\n if Is_Almost_Prime(k)=='A':\r\n z+=1\r\nprint(z) ", "n = int(input())\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n factors = []\r\n d = 2\r\n while d * d <= i:\r\n while i % d == 0:\r\n factors.append(d)\r\n i //= d\r\n d += 1\r\n\r\n if i > 1:\r\n factors.append(i)\r\n\r\n if len(set(factors)) == 2:\r\n count += 1\r\nprint(count)", "def findfactors(n):\r\n total=0\r\n for num in range(n+1):\r\n count=0\r\n for i in range(2,num):\r\n if(i*i>num or count>2 ):\r\n break\r\n cut=0\r\n while(num%i==0):\r\n num=num//i\r\n cut=cut+1\r\n \r\n if(cut):\r\n count=count+1\r\n if(num>1):\r\n count=count+1\r\n if(count==2):\r\n total=total+1\r\n return(total)\r\nprint(findfactors(int(input())))", "def prime(num):\r\n i=2\r\n while i<=num//2 and num%i!=0:\r\n i=i+1\r\n if i==num//2+1 or num==2:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\ndef fact(p,q,n):\r\n tot=0\r\n h=n//(p*q)\r\n while h>=1:\r\n tot=tot+1\r\n z=1\r\n while (h//(q**z))>=1:\r\n tot=tot+1\r\n z=z+1\r\n h=h//p\r\n return tot \r\n\r\n\r\nn=int(input())\r\ntot=0\r\na=0\r\nl=[]\r\nfor i in range(2,n,1):\r\n if prime(i)==1:\r\n l.append(i)\r\n a=a+1\r\nfor j in range(a):\r\n k=j+1\r\n while k<a:\r\n tot=tot+fact(l[j],l[k],n)\r\n k=k+1\r\nprint(tot)", "import sys, math\ninput= sys.stdin.readline \na=int(input())\nb=[]\nc=0\nd=0\nfor number in range (1, a+1): \n if number > 1: \n for i in range (2, number): \n if (number % i) == 0: \n break \n else: \n b.append(number)\nfor i in range(1,a+1):\n for j in b:\n if i%j==0:\n c+=1\n if c==2:\n d+=1\n c=0\nprint(d)\n\t \t\t\t \t\t\t\t\t\t\t\t \t \t \t\t\t\t \t \t", "# https://codeforces.com/contest/26/problem/A\n\ndef solution(n):\n prime = [True for _ in range(3001)]\n pfactor = [0 for _ in range(3001)]\n ctr = 0\n\n # Numbers 0 & 1 are not prime\n prime[0] = prime[1] = False\n\n for i in range(2, n + 1):\n if prime[i]:\n for j in range(i + i, n + 1, i):\n prime[j] = False\n pfactor[j] += 1\n\n if pfactor[i] == 2:\n ctr += 1\n\n return ctr\n\nif __name__ == \"__main__\":\n n = int(input())\n print(solution(n))", "n = int(input())\r\n\r\n# Đánh dấu các số nguyên tố\r\nis_prime = [True] * (n + 1)\r\nis_prime[0] = is_prime[1] = False\r\n\r\nfor i in range(2, int(n**0.5) + 1):\r\n if is_prime[i]:\r\n for j in range(i * i, n + 1, i):\r\n is_prime[j] = False\r\n\r\n# Đếm số lượng số gần như nguyên tố\r\ncount = 0\r\n\r\nfor i in range(2, n + 1):\r\n divisors = 0\r\n \r\n for j in range(2, i):\r\n if is_prime[j] and i % j == 0:\r\n divisors += 1\r\n \r\n if divisors > 2:\r\n break\r\n \r\n if divisors == 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "def prime(n):\r\n s=set()\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n s.add(i)\r\n c=0\r\n while n%i==0:\r\n c+=1\r\n n//=i\r\n if n>1:\r\n s.add(n)\r\n return len(s)==2\r\n\r\nw=int(input())\r\nc=0\r\nfor i in range(1,w+1):\r\n if prime(i):\r\n c+=1\r\nprint(c)", "from collections import Counter\r\nn = int(input())\r\nans = []\r\n\r\n\r\nfor i in range(1, n + 1):\r\n factorization = []\r\n d = 2\r\n \r\n while d * d <= i:\r\n while i % d == 0:\r\n factorization.append(d)\r\n i //= d\r\n \r\n d += 1\r\n \r\n if i > 1:\r\n factorization.append(i)\r\n \r\n counter = Counter(factorization) \r\n if len(counter) == 2 :\r\n ans. append(i)\r\n \r\nprint(len(ans))", "import math\r\nnum=int(input())\r\n\r\ndef prime(n):#func to check if n is prime\r\n for i in range(2,math.floor(math.sqrt(n))+1):\r\n if(n%i==0):\r\n return 0\r\n return 1\r\n\r\nmain_cnt=0\r\nfor n in range(2,num+1): #n=2 to num\r\n cnt=0\r\n for k in range(2,math.floor(math.sqrt(n))+1):\r\n if(n%k==0): #k is a factor, check if its prime\r\n if(prime(k)==1):\r\n cnt+=1\r\n if(n/k!=k and prime(n/k)==1):\r\n cnt+=1\r\n\r\n if(cnt==2): #means n is almost prime\r\n main_cnt+=1\r\nprint(main_cnt) \r\n \r\n ", "a=int(input())\r\ndef prostoe(a) :\r\n t=''\r\n for i in range(2,a) :\r\n if a%i==0 :\r\n return False\r\n return True\r\ndef delit(a) :\r\n p=0\r\n for i in range(2,a) :\r\n if a%i==0 and prostoe(i):\r\n p+=1\r\n if p>2 :\r\n return False\r\n if p<2 :\r\n return False\r\n else :\r\n return True\r\ne=0\r\nfor i in range(2,a+1) :\r\n if delit(i) :\r\n e+=1\r\nprint(e)", "def check_Prime(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nn=int(input())\r\ncount=0\r\nfor i in range(6,n+1):\r\n count_prime_factors=0\r\n for j in range(2,i):\r\n if(i%j==0 and check_Prime(j)):\r\n count_prime_factors+=1\r\n if count_prime_factors==2:\r\n count+=1\r\nprint(count)", "import sys\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nn=int(input())\r\nar=[0]*(n+1)\r\nans=0\r\nfor k in range(2,n+1):\r\n if ar[k]==2:\r\n ans+=1\r\n if ar[k]==0:\r\n for p in range(k,n+1,k):\r\n ar[p]+=1\r\nprint(ans)", "n = int(input())\r\na = [i for i in range(1, n + 1)]\r\npr = set()\r\nans = 0\r\nfor i in range(1, n):\r\n if a[i] != 0:\r\n pr.add(a[i])\r\n for pos in range(2, n // a[i] + 1):\r\n a[pos * a[i] - 1] = 0\r\n#print(pr)\r\nfor i in range(6, n + 1):\r\n cur_dels = 0\r\n for d in pr:\r\n if i % d == 0:\r\n cur_dels += 1\r\n if cur_dels == 2:\r\n ans += 1\r\nprint(ans)\r\n", "size = int(input()) + 1\nsieve = [0] * size\nfor i in range(2, size):\n if sieve[i] == 0:\n for j in range(i, size, i):\n sieve[j] += 1\nprint(sieve.count(2))\n", "from math import *\r\nn=int(input())\r\nans=0\r\nif n<=5:\r\n ans=0\r\nelse:\r\n l=[2]\r\n for i in range(3,n+1):\r\n for j in range(2,i):\r\n if i%j==0:\r\n break\r\n else:\r\n l.append(i)\r\n i=6\r\n while i<(n+1):\r\n c=0\r\n for j in l:\r\n if i%j==0:\r\n c=c+1\r\n if c==2:\r\n ans=ans+1\r\n i=i+1\r\nprint(ans)\r\n \r\n ", "import math\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 elif 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 += 6 \r\n return True \r\n \r\n \r\n \r\ndef find_list(N):\r\n arr = [2,3,5,7]\r\n for i in range(11,N+1):\r\n if is_prime(i):\r\n arr.append(i)\r\n return arr \r\ndef Almost_Prime():\r\n upto = int(input())\r\n arr = find_list(upto)\r\n pos = 0\r\n for i in range(len(arr)-1):\r\n for j in range(i+1,len(arr)):\r\n k1 = arr[i]*arr[j]\r\n if k1 <= upto:\r\n k2 = int(math.log(upto/(k1),arr[i]))\r\n pos += 1 + k2\r\n k1 = k1 * arr[j] \r\n while k1 <= upto: \r\n k2 = int(math.log(upto/k1,arr[i]))\r\n pos += 1 + k2\r\n k1 = k1 * arr[j]\r\n \r\n \r\n else:\r\n break\r\n \r\n return pos\r\n \r\n \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(Almost_Prime())\r\n remained_test_cases -= 1 ", "a=int(input())\r\n\r\ndef okp(n):\r\n return len([i for i in range(1,n+1)if n%i==0])<=2 \r\n\r\ndef cp(n):\r\n ans=len([i for i in range(2,n+1)if n%i==0 and okp(i)])\r\n return ans \r\n\r\nans=0\r\nfor i in range(1,a+1):\r\n if cp(i)==2:\r\n ans+=1\r\n\r\nprint(ans)\r\n", "import math\r\n\r\n\r\ndef almostPrimeNumbers(n):\r\n count = 0\r\n primeCounter = 0\r\n primeList = []\r\n primeList.append(2)\r\n for x in range(3, n+1, 2):\r\n if IsPrime(x):\r\n primeList.append(x)\r\n\r\n for j in range(1, n+1):\r\n for y in range(0, len(primeList)):\r\n if j % primeList[y] == 0:\r\n count += 1\r\n\r\n if count == 2:\r\n primeCounter += 1\r\n count = 0\r\n else:\r\n count = 0\r\n return primeCounter\r\n\r\n\r\ndef IsPrime(N):\r\n if N == 2:\r\n return True\r\n if N % 2 == 0 or N < 2:\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\n\r\n\r\nn = int(input())\r\nprint(almostPrimeNumbers(n))\r\n", "n =int(input())\r\n\r\nprimes = [1]*(n+1)\r\nnums = []\r\n\r\nfor i in range(2,n+1):\r\n if primes[i] == 1:\r\n nums.append(i)\r\n if primes[i] == 1:\r\n start = 2*i\r\n for j in range(start,n+1,i):\r\n primes[j] = 0\r\nprime_no = set(nums)\r\ncount = 0\r\nfor j in range(5,n+1):\r\n if primes[j] == 0:\r\n c = 0\r\n for p in prime_no:\r\n if j%p == 0:\r\n c+=1\r\n if c == 2:\r\n count+=1\r\nprint(count)\r\n \r\n\r\n \r\n \r\n \r\n ", "'''\r\nlist(map(int, input().split()))\r\nint(input())\r\n'''\r\n\r\ndef isPrime(num):\r\n d = 2\r\n prime = set()\r\n\r\n while d*d <= num:\r\n while num%d == 0:\r\n prime.add(d)\r\n num //= d\r\n \r\n d += 1\r\n \r\n if num > 1:\r\n prime.add(num)\r\n \r\n return len(prime) == 2\r\n\r\ndef main():\r\n num = int(input())\r\n counts = 0\r\n\r\n for elm in range(num+1):\r\n if isPrime(elm):\r\n counts += 1\r\n \r\n print(counts)\r\n\r\nmain()\r\n", "n=int(input())\r\ncount=0\r\n\r\ndef prime(n):\r\n factor=set()\r\n d=2\r\n \r\n while d*d<=n:\r\n while n%d==0:\r\n factor.add(d)\r\n n//=d\r\n \r\n d+=1\r\n \r\n if n > 1:\r\n factor.add(n)\r\n return factor\r\n\r\nfor i in range(1,n+1):\r\n if len(prime(i))==2:\r\n count+=1\r\n \r\nprint(count)", "MAX = int(1e6 + 1)\nspf = [i for i in range(MAX)]\n\nfor i in range(4, MAX, 2):\n\tspf[i] = 2\n\nfor i in range(3, MAX):\n\tif spf[i] == i:\n\t\tfor j in range(i * i, MAX, i):\n\t\t\tif spf[j] == j:\n\t\t\t\tspf[j] = i\n\n\ndef prime_factorize_seive(x):\n\tans = {}\n\n\twhile x != 1:\n\t\tans[spf[x]] = ans.get(spf[x], 0) + 1\n\t\tx //= spf[x]\n\n\treturn ans\n\nn = int(input())\nans = 0\n\nfor i in range(1, n + 1):\n\tans += int(len(prime_factorize_seive(i)) == 2)\n\nprint(ans)", "import math\nn = int(input().strip())\n\nis_prime = [False, False] + [True] * (n - 1)\nprime_list = list()\nalmost_prime = list()\n\nfor i in range(n + 1):\n if is_prime[i]:\n prime_list.append(i)\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n\nlp = len(prime_list)\n\n\nfor i in range(lp-1):\n for j in range(i + 1, lp):\n product = prime_list[i] * prime_list[j]\n if product < n:\n almost_prime.append(product)\n\ndef find_factors(n):\n if n == 1:\n return []\n elif n == 2:\n return [2]\n else:\n for item in prime_list:\n if n % item == 0:\n return [item] + find_factors(n/item)\n return []\n\ncount = 0\nfor i in range(3, n + 1):\n if not is_prime[i]:\n num_factors = len(set(find_factors(i)))\n if num_factors == 2:\n count += 1\n\nprint(count)\n\n\n", "def prime(n):\r\n i = 3\r\n if n == 2 :\r\n return True\r\n if n % 2 == 0 :\r\n return False\r\n while i*i <= n :\r\n if n % i == 0 :\r\n return False\r\n i += 2\r\n return True\r\n\r\nn = int(input())\r\npr = [i for i in range(2,n+1) if prime(i)]\r\nr = 0\r\nfor i in range(1,n+1):\r\n x = 0\r\n for p in pr :\r\n if i % p == 0 :\r\n x += 1\r\n if x > 2 :\r\n break\r\n if x == 2 :\r\n r += 1\r\n\r\nprint(r)", "def is_prime(num):\r\n for i in range(int(num**0.5),1,-1):\r\n if num%i==0:\r\n return False\r\n return True\r\n\r\ndef primefactors(inp):\r\n count=0\r\n for i in range(2,inp):\r\n if inp%i==0 and is_prime(i)==True:\r\n count+=1\r\n inp//=i\r\n return count\r\n\r\nx=int(input())\r\ncount=0\r\nfor i in range(1,x+1):\r\n if primefactors(i)==2:\r\n count+=1\r\nprint(count)", "import sys\r\nimport math\r\n \r\nn = int(input()) + 1\r\nk = [True] * n\r\nk[0] = False\r\nk[1] = False\r\n\r\nfor i in range(2, int(math.sqrt(n)) + 1):\r\n for j in range(i * 2, n, i):\r\n k[j] = False\r\n\r\nb = [i for i in range(2, n) if k[i]]\r\nres = 0\r\nfor i in range(1, n):\r\n c = 0\r\n for j in b:\r\n if(i % j == 0):\r\n c += 1\r\n\r\n if(c == 2):\r\n res += 1\r\n\r\nprint(res)", "import math\n\nentrada = int(input())\nsaida = 0\nfor n in range(1,entrada+1):\n fatores = []\n while (n % 2) == 0:\n if 2 not in fatores:\n fatores.append (2)\n n = n // 2\n \n\n for i in range(3,int(math.sqrt(n))+1,2): \n while (n % i) == 0:\n if i not in fatores:\n fatores.append (i)\n n = n // i\n \n if n > 1:\n if n not in fatores:\n fatores.append (n)\n \n if (len(fatores)==2):\n saida +=1\n \n # print(fatores)\n\nprint(saida)\n\t \t\t\t \t\t\t\t \t\t \t\t \t\t\t \t \t", "def sieve_of_eratosthenes(n):\r\n prime = [True] * (n + 1)\r\n p = 2\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 return [p for p in range(2, n + 1) if prime[p]]\r\n\r\ndef count_almost_prime(n):\r\n primes = sieve_of_eratosthenes(n)\r\n count = 0\r\n for num in range(1, n + 1):\r\n divisors = 0\r\n for prime in primes:\r\n if num % prime == 0:\r\n divisors += 1\r\n if divisors > 2:\r\n break\r\n if divisors == 2:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nresult = count_almost_prime(n)\r\nprint(result)\r\n", "import math\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n for i in range(2, math.floor(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nprimes = []\r\nfor i in range(2, n + 1):\r\n if is_prime(i):\r\n primes.append(i)\r\n\r\nans = 0\r\nfor i in range(2, n + 1):\r\n cnt = 0\r\n for x in primes:\r\n if x > i:\r\n break\r\n if i % x == 0:\r\n cnt += 1\r\n while i % x == 0:\r\n i /= x\r\n if cnt == 2:\r\n ans += 1\r\nprint(ans)", "def solve(n:int,arr:list)->None:\n count = 0\n\n # This is basically a erastosthenes sieve\n for i in range(1,n):\n if arr[i] == 0: # If the value is 0, then it is prime\n #Now we iterate over the multiples of i and set their values respectively\n for j in range(2*i+1,n,i+1):\n arr[j] += 1\n\n if arr[j] == 2:\n count += 1\n elif arr[j] == 3:\n count -= 1\n return count\n\n\n\nif __name__ == '__main__':\n n = int(input())\n arr = [0 for i in range(n)] #np.zeros(n, dtype=np.intc)\n print(solve(n, arr))\n \t \t\t \t\t \t \t \t \t \t \t\t", "from collections import Counter\r\nn = int(input())\r\ncount = 0\r\nans = []\r\nfor i in range(5,n+1):\r\n factor = Counter()\r\n d = 2\r\n while d*d <= i:\r\n while i % d == 0:\r\n factor[d] += 1\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n factor[d] += 1\r\n if len(factor) == 2:\r\n count += 1\r\nprint(count)\r\n\r\n ", "# Hydro submission #6349662e42a9d5b1f6285fd2@1665754670551\nn=int(input())\ndef isprime(x):\n if x<=2:\n return x==2\n for i in range(2,x):\n if x%i==0:\n return 0\n return 1\nans=0\nfor i in range(1,n+1):\n s=set()\n for j in range(1,i+1):\n if i%j==0:\n s.add(j)\n s.add(i//j)\n res=0\n for k in s:\n if isprime(k):\n res+=1\n if res==2:\n ans+=1\nprint(ans)", "n = int(input())\r\namount = 0\r\nb = [False] * (n+1)\r\npfactors = [0] * (n+1)\r\n\r\nfor i in range(2, n+1):\r\n if not b[i]:\r\n for j in range(i+i, n+1, i):\r\n b[j] = True\r\n pfactors[j] += 1\r\n\r\n if pfactors[i] == 2:\r\n amount += 1\r\n\r\nprint(amount)\r\n", "def p(n):\r\n x=True\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n x=False\r\n break\r\n return x\r\ndef alprime(n):\r\n x=0\r\n if (n**(1/3))%1==0:\r\n return False\r\n for i in range(2,(n//2)+1):\r\n if n%i==0 and p(i):\r\n x+=1\r\n if x>2:\r\n return False\r\n return x==2\r\nm=int(input())\r\ny=0\r\nfor i in range(6,m+1):\r\n if alprime(i):\r\n y+=1\r\nprint(y)", "def nPrimeDivisors(num):\r\n ret = 0\r\n \r\n if num%2 == 0:\r\n ret += 1\r\n while num%2 == 0:\r\n num /= 2\r\n\r\n i = 3\r\n while i*i <= num:\r\n if num%i == 0:\r\n ret += 1\r\n while num%i == 0:\r\n num /= i\r\n i += 2\r\n\r\n if num != 1:\r\n ret += 1\r\n\r\n return ret\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(2, n+1):\r\n if nPrimeDivisors(i) == 2:\r\n # print(\">\", i)\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\np = [x for x in range(2, n+1)]\r\nfor i in range(len(p)):\r\n if p[i] != 0:\r\n for j in range(p[i]+p[i]-2, len(p), p[i]):\r\n p[j] = 0\r\np = [x for x in p if x != 0]\r\na = 0\r\nfor i in range(1, n+1):\r\n c = 0\r\n for pr in p:\r\n if i < pr:\r\n break\r\n if i % pr == 0:\r\n c = c + 1\r\n \r\n if c == 2:\r\n a += 1\r\n \r\n\r\nprint(a)", "nums=int(input())\r\nresult=0\r\n\r\nfor num in range(4,nums+1):\r\n curr=[]\r\n d=2\r\n n=num\r\n while d*d<=n:\r\n while n%d==0:\r\n curr.append(d)\r\n n//=d\r\n d+=1\r\n \r\n if n>1:\r\n curr.append(n)\r\n if len(set(curr))==2:\r\n # print(num,curr)\r\n result+=1\r\n\r\nprint(result)", "n = int(input())\r\ndef factor(n):\r\n factorization: list[int] = []\r\n d = 2\r\n\r\n while d * d <= n:\r\n while n % d == 0:\r\n factorization.append(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n factorization.append(n)\r\n return factorization\r\ncount = 0\r\nfor i in range(1,n+1):\r\n s = factor(i)\r\n if len(set(s))==2:\r\n count+=1\r\nprint(count)\r\n", "m = 0\nimport math\ndef primeFactors(n):\n s = set()\n while n % 2 == 0:\n s.add(2)\n n = n // 2\n for i in range(3, int(math.sqrt(n)) + 1, 2):\n while n % i == 0:\n n = n // i\n s.add(i)\n if n > 2:\n s.add(n)\n return s\nz = int(input())\nfor i in range(1,z+1):\n s = primeFactors(i)\n if len(s) == 2:\n m += 1\nprint(m)", "#rpoblem B\nn = int(input())\n\nfrom math import sqrt\ndef factor_list(n):\n factors = []\n sqrt_n = sqrt(n)\n sqrt_n = int(sqrt_n)\n for a in range(1, sqrt_n + 1):\n if n % a == 0:\n b = n//a\n if a == b:\n factors.append(a)\n else:\n factors.append(a)\n factors.append(b)\n return factors\n\n\ndef is_prime(n):\n if n < 2:\n return False\n else:\n factors = []\n sqrt_n = sqrt(n)\n sqrt_n = int(sqrt_n)\n for a in range(1, sqrt_n + 1):\n if n % a == 0:\n b = n // a\n if a == b:\n factors.append(a)\n else:\n factors.append(a)\n factors.append(b)\n\n if len(factors) > 2:\n break\n factor_nb = len(factors)\n if factor_nb == 2:\n return True\n else:\n return False\n\nalmost_primes = []\nfor n in range(1, n+1):\n factors = factor_list(n)\n factor_prime_nb = 0\n for i in factors:\n if is_prime(i) == True:\n factor_prime_nb = factor_prime_nb + 1\n\n if factor_prime_nb == 2:\n almost_primes.append(n)\n\nprint(len(almost_primes))\n\n \t \t \t\t\t\t \t\t\t \t \t \t", "\r\nn = int(input())\r\n\r\ndef isAlmostPrime(n):\r\n \r\n d = 2\r\n divisors = set()\r\n \r\n while d * d <= n:\r\n \r\n while n % d == 0:\r\n divisors.add(d)\r\n n //= d\r\n \r\n d += 1\r\n \r\n if len(divisors) > 2:\r\n return False\r\n \r\n divisors.add(n) if n > 1 else None\r\n if len(divisors) == 2: \r\n return True\r\n\r\n\r\n\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n if isAlmostPrime(i):\r\n count += 1\r\n \r\nprint(count)\r\n ", "import math\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\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\nn=int(input())\r\ncount=0\r\nfor m in range(2,n+1):\r\n factorList=[]#存放m的所有质因子\r\n for i in range(2,m+1):\r\n if m%i==0 and is_prime(i):\r\n factorList.append(i)\r\n if len(factorList)==2:\r\n count+=1\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "seive=[]\r\ndef precalc(n):\r\n i=2\r\n while(i*i<=n):\r\n if(seive[i]):\r\n j=i*i\r\n while(j<=n):\r\n seive[j]=False\r\n j+=i\r\n i+=1\r\ndef main():\r\n global seive\r\n n=int(input())\r\n seive=[True]*(n+1)\r\n precalc(n)\r\n res,cnt=[],0\r\n for i in range(2,n+1):\r\n if(seive[i]):\r\n res.append(i)\r\n for i in range(2,n+1):\r\n temp=0\r\n for j in range(2,n+1):\r\n if(seive[j] and i%j==0):\r\n temp+=1\r\n if(temp==2):\r\n cnt+=1\r\n print(cnt)\r\nmain()", "n = int(input())\r\ndev = 0\r\nmol = 0\r\ndef prime(q):\r\n for i in range(2, int(q ** 0.5) + 1):\r\n if q % i == 0:\r\n return 0\r\n return 1\r\nfor i in range(2, n + 1):\r\n for j in range(2, i + 1):\r\n if i % j == 0 and prime(j) == 1:\r\n dev += 1\r\n if dev == 2:\r\n mol += 1\r\n dev = 0\r\nprint(mol)\r\n", "import math as m\r\ndef isprime(n):\r\n if n <= 1:\r\n return False\r\n for i in range(2, int(m.sqrt(n))+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\ndef fun(n):\r\n cnt = 0\r\n for i in range(2, n + 1):\r\n if n % i == 0 and isprime(i) == True:\r\n cnt += 1\r\n if cnt == 2:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(6, n + 1):\r\n if isprime(i) == False and fun(i) == True:\r\n cnt += 1\r\nprint(cnt)\r\n", "n=int(input())\r\nans=0\r\nfor i in range(2,n+1):\r\n j=2\r\n k=i\r\n cnt=0\r\n while(j*j<=k):\r\n if(k%j==0):\r\n cnt+=1\r\n while(k%j==0):\r\n k=k//j\r\n j+=1\r\n if(k!=1):\r\n cnt+=1\r\n if(cnt==2):\r\n ans+=1\r\nprint(ans)", "def sieve():\r\n global spf,adj,MAX\r\n spf[1]=1\r\n for i in range(MAX):\r\n spf[i]=i\r\n for i in range(2,MAX):\r\n \r\n if i*i > MAX:\r\n break\r\n if spf[i]==i:\r\n for j in range(i*i,MAX,i):\r\n if spf[j]==j:\r\n spf[j]=i\r\n\r\ndef distPrime(n):\r\n global adj,spf,MAX\r\n idx = 0\r\n for i in range(1,MAX):\r\n idx,x = 1,i\r\n if x!=1:\r\n adj[i].append(spf[x])\r\n x = x//spf[x]\r\n while x!=1:\r\n if adj[i][idx-1] != spf[x]:\r\n adj[i].append(spf[x])\r\n idx += 1\r\n x = x//spf[x]\r\n\r\n\r\n\r\nMAX = 100001\r\nspf = [0 for i in range(MAX)]\r\nadj = [[] for i in range(MAX)]\r\n\r\nsieve()\r\nn = int(input())\r\ndistPrime(n)\r\nout = 0\r\n\r\nfor i in range(1,n+1):\r\n if len(adj[i])==2:\r\n out += 1\r\nprint(out)", "t=int(input())\r\nl = [0] * (t + 1)\r\nfor i in range(2, t // 2 + 1):\r\n if not l[i]:\r\n for j in range(2 * i, t + 1, i):\r\n l[j] += 1\r\nprint(l.count(2))", "def get(n):\r\n i=2\r\n count=0\r\n while i*i<=n:\r\n if not n%i:\r\n count+=1\r\n while not n%i:\r\n n//=i\r\n i+=1\r\n if n!=1:\r\n count+=1\r\n if count==2:return 1\r\n return 0\r\nn=int(input())\r\ncount=0\r\nfor i in range(n+1):\r\n if get(i):\r\n count+=1\r\n# print(\">>\",i)\r\nprint(count)\r\n", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef get_divisors(n):\r\n i = 1\r\n divisors = []\r\n\r\n while i * i <= n:\r\n if n % i == 0:\r\n divisors.append(i)\r\n if i != n // i:\r\n divisors.append(n // i)\r\n i += 1\r\n\r\n divisors.sort()\r\n return divisors\r\n\r\n\r\ndef get_primes(n):\r\n check = [True for _ in range(0, n + 1)]\r\n\r\n check[1] = False\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if check[i]:\r\n for j in range(2 * i, n + 1, i):\r\n check[j] = False\r\n\r\n primes = [i for i in range(1, n + 1) if check[i]]\r\n return primes\r\n\r\n\r\nmemo = set(get_primes(3000))\r\n\r\n\r\nn = int(input())\r\ncnt = 0\r\n\r\nfor i in range(1, n + 1):\r\n if len(set(get_divisors(i)) & memo) == 2:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "m = 10**5\ncri = [0]*m\nfor i in range(2, m):\n\tif cri[i] == 0:\n\t\tfor j in range(i, m, i):\n\t\t\tcri[j] += 1\nn = int(input())\nres = 0\nfor i in range(n+1):\n\tif cri[i] == 2:\n\t\tres += 1\nprint(res)", "def checkprime(n):\r\n c=0\r\n if n==1:\r\n return False\r\n for i in range(2,(n//2)+1):\r\n if n%i==0:\r\n c=c+1\r\n if c>=1:\r\n return False\r\n else:\r\n return True\r\ndef no_of_primefactors(n):\r\n c=0\r\n for i in range(2,(n//2)+1):\r\n if n%i==0 and checkprime(i):\r\n c=c+1\r\n return c\r\n\r\nn=int(input())\r\nt=0\r\nfor i in range(1,n+1):\r\n if no_of_primefactors(i)==2:\r\n t=t+1\r\nprint(t)", "n = int(input())\r\ncounter = 0\r\n\r\nfor i in range(1, n + 1):\r\n s = set()\r\n div = 2\r\n\r\n while i != 1:\r\n if i % div != 0:\r\n div += 1\r\n else:\r\n i //= div\r\n s.add(div)\r\n\r\n if len(s) == 2:\r\n counter += 1\r\n \r\nprint(counter)\r\n \r\n \r\n\r\n", "def primeFactors(n):\n \n c = 2\n lista = []\n while(n > 1):\n\n if(n % c == 0):\n\n lista.append(c)\n n = n / c\n else:\n c = c + 1\n myset = set(lista)\n return len(myset)\n\n\n# Driver code\nt = input()\nt = int(t)\ncont=0\nfor i in range(t+1):\n if primeFactors(i) ==2:\n cont+=1\nprint(cont)\n \t \t \t \t \t \t \t \t\t\t\t", "def prime(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return 0\r\n return 1 \r\ndef factors(n):\r\n count=0\r\n for i in range(2,n+1):\r\n if n%i==0:\r\n if prime(i)==1:\r\n count=count+1\r\n return count \r\n\r\ndef numbers(n):\r\n count=0\r\n for x in range(2,n+1):\r\n if factors(x)==2:\r\n count=count+1\r\n return count\r\n\r\n\r\nnum=int(input())\r\ncount=numbers(num)\r\nprint(count)", "import sys, os\r\nimport math\r\n\r\n\r\ndef seive(n):\r\n primes = [True]*(n+1)\r\n primes[0] = False\r\n primes[1] = False\r\n for i in range(2,n+1):\r\n if primes[i]==True:\r\n for j in range(i*i,n+1,i):\r\n primes[j] = False\r\n return primes\r\n \r\n\r\ndef solve():\r\n primes = seive(1000000)\r\n n = int(input())\r\n res = 0\r\n\r\n for i in range(1,n+1):\r\n cnt = 0\r\n div = []\r\n for j in range(1,n//2+1):\r\n if i%j==0 and primes[j]==True:\r\n cnt += 1\r\n if cnt==2:\r\n res += 1\r\n print(res)\r\n\r\nif os.path.exists('input.txt'):\r\n debug = True\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n #sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nsolve()\r\n", "# Source: https://usaco.guide/general/io\r\nans = 0\r\nn = int(input())\r\n##########Sieve of Erasothenes#######\r\nis_prime = [True]*(n+1)\r\nis_prime[0] = is_prime[1] = False\r\ni = 2\r\nwhile i*i<=n:\r\n if is_prime[i]:\r\n for j in range(i*i,n+1,i):\r\n is_prime[j] = False \r\n i+=1\r\n#####################################\r\n\r\nprimes = []\r\nfor i in range(n+1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n\r\ni = 0\r\nwhile i< len(primes)-1 and primes[i]*primes[i] < n:\r\n j = i+1\r\n while primes[i]*primes[j]<=n:\r\n k = 1\r\n while primes[i]**k *primes[j]<=n:\r\n l = 1\r\n while primes[i]**k*primes[j]**l<=n:\r\n ans+=1\r\n l+=1\r\n k+=1\r\n j+=1\r\n i+=1\r\nprint(ans)", "t = int(input())\r\ncount = 0\r\nfor i in range(1, t+1):\r\n a = set()\r\n c = 2\r\n n = i\r\n while(n > 1):\r\n if(n % c == 0):\r\n a.add(c)\r\n n = n / c\r\n else:\r\n c = c + 1\r\n if(len(a) == 2):\r\n count = count + 1\r\nprint(count)", "n=int(input())\nprime=[0]*(n+1)\nfor i in range (2,(n+1)):\n if prime[i]==0:\n for j in range(2*i,n+1,i):\n prime[j]+=1\nprint(prime.count(2))", "n = int(input())\r\nans = 0\r\nprimes = [i for i in range(2,(n+1)//2+1) if 0 not in [i%n for n in range(2, i)]]\r\nfor i in range(6,n+1):\r\n f = 0\r\n for j in primes:\r\n if j > i//2 or f > 2:\r\n break\r\n if not i % j:\r\n f += 1\r\n if f == 2:\r\n ans += 1\r\nprint(ans)", "import collections\r\np = [0]*(3005)\r\np[0] = 0\r\np[1] = 0\r\np[2] = 1\r\ndef sieve_prime(p,n):\r\n for i in range(3,n,2):\r\n p[i] = 1\r\n\r\n\r\n\r\n\r\n for i in range(3,n,2):\r\n if p[i]==1:\r\n\r\n for j in range(i*i,n,i):\r\n p[j] = 0\r\n\r\n return p\r\n\r\ndef is_prime(n,primes):\r\n mp = collections.defaultdict(list)\r\n for i in range(2,n):\r\n if primes[i]==1:\r\n\r\n for j in range(i,n,i):\r\n\r\n if j not in mp:\r\n mp[j]=1\r\n else:\r\n mp[j]+=1\r\n\r\n ans = 0\r\n for i in range(2,n):\r\n if mp[i]==2:\r\n\r\n ans+=1\r\n\r\n return ans\r\nprimes = sieve_prime(p,3005)\r\n\r\n# print(primes)\r\nn = int(input())\r\nprint(is_prime(n+1,primes))\r\n", "def prime_factors(n):\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n return factors\r\nn = int(input())\r\nprimes= 0\r\nfor i in range(1,n+1):\r\n if len(set(prime_factors(i))) == 2:\r\n primes += 1\r\nprint(primes)", "n = int(input())\r\nl = [0]*(n+1)\r\nfor i in range(2, n+1):\r\n\tif l[i]==0:\r\n\t\tfor j in range(2*i, n+1, i):\r\n\t\t\tl[j]+=1\r\nprint(l.count(2))", "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\n\r\ndef count_s_primes(n):\r\n s_prime_count = 0\r\n for i in range(1, n+1):\r\n prime_count = 0\r\n for j in range(1, int(i**0.5) + 1):\r\n if i % j == 0:\r\n if is_prime(j):\r\n prime_count += 1\r\n if i // j != j and is_prime(i // j):\r\n prime_count += 1\r\n if prime_count == 2:\r\n s_prime_count += 1\r\n return s_prime_count\r\n\r\n# Eingabe einlesen\r\nn = int(input())\r\n\r\n# Anzahl der S-Primzahlen berechnen\r\nresult = count_s_primes(n)\r\n\r\n# Ergebnis ausgeben\r\nprint(result)\r\n", "def findDividers(num):\n dividers = []\n for i in range(1,int(num**0.5//1)+1):\n if num%i == 0:\n if i != num//i:\n dividers.append(i)\n dividers.append(num//i)\n elif i == num//i:\n dividers.append(i)\n return dividers\n\n\ndef isPrime(num):\n if num < 2 or (num > 2 and num%2 == 0):\n return False\n \n for i in range(3,int((num**0.5//1))+1, 2):\n if isPrime(i):\n if num%i == 0:\n return False\n \n return True\n\ndef isAlmostPrime(num):\n dividers = findDividers(num)\n count = 0\n for divider in dividers:\n if count > 2:\n return False\n elif isPrime(divider):\n count+=1\n if count == 2:\n return True\n else:\n return False\n\ndef nOfAlmostPrimes(num):\n count = 0\n for i in range(1,num+1):\n if isAlmostPrime(i):\n count +=1\n return count\n\nprint(nOfAlmostPrimes(int(input())))\n \t\t\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\ndef count_distinct_prime_divisors(num):\r\n count = 0\r\n for i in range(2, num + 1):\r\n if num % i == 0 and is_prime(i):\r\n count += 1\r\n while num % i == 0:\r\n num //= i\r\n return count\r\n\r\ndef count_almost_primes(n):\r\n count = 0\r\n for i in range(1, n + 1):\r\n if count_distinct_prime_divisors(i) == 2:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nprint(count_almost_primes(n))", "n = int(input())\r\n\r\ndef is_almost_prime(num):\r\n factors = set()\r\n \r\n factor = 2\r\n while factor*factor <= num:\r\n\r\n while not num%factor:\r\n\r\n factors.add(factor)\r\n if len(factors) > 2:\r\n return False\r\n \r\n num //= factor\r\n \r\n factor += 1\r\n \r\n if num > 1:\r\n factors.add(num)\r\n \r\n return len(factors) == 2\r\n\r\n\r\n\r\nalmost_prime = 0\r\nfor num in range(1, n + 1):\r\n \r\n almost_prime += is_almost_prime(num)\r\n\r\n\r\nprint(almost_prime)", "l = [0 for _ in range(3001)]\r\nfor i in range(2, len(l)):\r\n if l[i] == 0:\r\n for j in range(2*i, 3001, i):\r\n l[j] += 1\r\ns = 0\r\nfor i in range(int(input())+1):\r\n if l[i] == 2:\r\n s += 1\r\nprint(s)", "from sys import *\r\n'''sys.stdin = open('input.txt', 'r') \r\nsys.stdout = open('output.txt', 'w') '''\r\nfrom collections import defaultdict as dd\r\nfrom math import *\r\nfrom bisect import *\r\n#sys.setrecursionlimit(10 ** 8)\r\ndef sinp():\r\n return input()\r\ndef inp():\r\n return int(sinp())\r\ndef minp():\r\n return map(int, sinp().split())\r\ndef linp():\r\n return list(minp())\r\ndef strl():\r\n return list(sinp())\r\ndef pr(x):\r\n print(x)\r\nmod = int(1e9+7)\r\nn=inp()\r\nf=0\r\nb = [False for i in range(3002)]\r\np = [0 for i in range(3002)]\r\nfor i in range(2,n+1):\r\n if not b[i]:\r\n for j in range(2*i,n+1,i):\r\n b[j] = True\r\n p[j] += 1\r\n if p[i] == 2:\r\n f += 1\r\npr(f)", "p = [2, 3, 5, 7, 11]\nn = int(input())\nfor i in range(13, n + 1, 2):\n f = True\n for j in range(3, i):\n if i % j == 0:\n f = False\n break\n if(f):\n p.append(i)\nv = []\nfor w in p:\n x = w\n a = []\n i = 1\n while x < n:\n a.append(x)\n i += 1\n x = w ** i\n v.append(a)\nv.append([])\nt = 0\nfor i, x in enumerate(v):\n for j, y in enumerate(v[i + 1:]):\n t += sum(a * b <= n for a in x for b in y)\nprint(t)\n", "import math\r\nn=int(input())\r\np=list(range(2,n+1))\r\nc=0\r\nfor i in range(2,int(math.sqrt(n)+1)):\r\n for j in range(0,len(p)):\r\n if p[j]%i==0 and p[j]!=i:\r\n p[j]=-1\r\n c+=1\r\nwhile c>0:\r\n c-=1\r\n p.remove(-1)\r\n\r\nx=list(range(2,n+1))\r\nans=0\r\nfor i in range(0,len(x)):\r\n d=0\r\n for j in range(0,len(p)):\r\n if x[i]%p[j]==0:\r\n d+=1\r\n if d==2:\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nnums = [0] * (n + 1)\r\n\r\nfor i in range(2, n // 2 + 1):\r\n if nums[i] == 0:\r\n for k in range(2 * i, n + 1, i):\r\n nums[k] += 1\r\n \r\nprint(nums.count(2))", "from math import sqrt\r\n\r\n#-------------------------------------------\r\n\r\ndef isPrime(n):\r\n if(n==2): return True\r\n if(n < 2 or n % 2 == 0): return False\r\n\r\n can2 = int(sqrt(n))\r\n for i in range (3,can2+1,2):\r\n if(n % i ==0): return False\r\n return True\r\n\r\n#-------------------------------------------\r\n\r\ndef isNear(n):\r\n can2 = int(sqrt(n))\r\n count_prime = 0\r\n \r\n for i in range (1,can2+1):\r\n if(n % i == 0):\r\n if(isPrime(i)): count_prime += 1\r\n if(isPrime(n//i)): count_prime += 1\r\n \r\n if(can2 * can2 == n and isPrime(can2)): count_prime -= 1\r\n return [False,True][count_prime == 2]\r\n\r\n#-------------------------------------------\r\n\r\nn = int(input())\r\nprint(sum(isNear(i) for i in range (n+1)))", "n = int(input())\r\ncount = 0\r\n\r\ndef is_almost_prime(n):\r\n factors = set()\r\n d = 2\r\n\r\n while d * d <= n:\r\n while n % d == 0:\r\n factors.add(d)\r\n n //= d\r\n d += 1\r\n \r\n if n > 1:\r\n factors.add(n)\r\n\r\n return len(factors) == 2\r\n\r\nfor i in range(1, n+1):\r\n count += is_almost_prime(i)\r\n \r\nprint(count)", "\r\ndef generate(n):\r\n\tprime=[True for i in range(n+1)]\r\n\tp=2\r\n\twhile(p*p<=n):\r\n\t\tif(prime[p]==True):\r\n\t\t\tfor j in range(p*p,n+1,p):\r\n\t\t\t\tprime[j]=False\r\n\t\tp=p+1\r\n\tl=[]\r\n\tfor k in range(2,n+1):\r\n\t\tif(prime[k]==True):\r\n\t\t\tl.append(k)\r\n\treturn l\r\n\r\n\r\n\r\nn=int(input())\r\nl1=generate(n//2)\r\nk=0\r\nfor i in range(2,n+1):\r\n\tc=0\r\n\tj=0\r\n\tfor j in range(0,len(l1)):\r\n\t\tif(i%l1[j]==0):\r\n\t\t\tc=c+1\r\n\t\t\twhile(i%l1[j]==0):\r\n\t\t\t\ti=i//l1[j]\r\n\t\tif(c>2):\r\n\t\t\tbreak\r\n\tif(c==2):\r\n\t\tk=k+1\r\nprint(k)\r\n\t\t\r\n\t\r\n\t\r\n\r\n\r\n", "n = int(input())\r\ncount = 0\r\nfor number in range(1,n + 1):\r\n #check the number of prime factors of number\r\n d = 2\r\n \r\n store = set()\r\n original = number\r\n while d <= original:\r\n while number % d == 0:\r\n store.add(d)\r\n number = number // d\r\n d += 1\r\n \r\n if len(store) == 2:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n \r\n\r\n", "'''\r\n\r\n\n\n15.07.2021\r\n\r\n\n\nCF 026 A\n\n\r\n\r\n'''\r\n\r\n\n\nn = int (input ())\r\n\nk = 0;\n\r\nfor mm in range (n+1) :\r\n\n m = mm\n\r\n d = 2; kol = 0\r\n\n while m > 1 :\n\r\n if m % d == 0 :\r\n\n kol += 1\n\r\n while m % d == 0 :\r\n\n m = m // d\n\r\n d += 1\r\n\n if kol > 2 :\r\n\n break\n\r\n if kol == 2 :\r\n\n k += 1\n\r\n\r\n\nprint (k);\r\n", "from collections import defaultdict\r\ndef rng():\r\n return int(input())\r\ndef lst():\r\n return list(map(int, input().split()))\r\ndef string():\r\n return input()\r\ndef str_lst():\r\n return list(input())\r\n \r\nr = rng()\r\n\r\ndef check(n):\r\n n_set = set()\r\n d = 2\r\n \r\n while d * d <= n:\r\n while n % d == 0:\r\n n_set.add(d)\r\n n //= d\r\n d += 1\r\n \r\n if n > 1:\r\n n_set.add(n)\r\n \r\n return n_set\r\n\r\n\r\nctr = 0\r\nfor i in range(1,r+1):\r\n num = i\r\n \r\n if len(check(num)) == 2:\r\n ctr += 1\r\n \r\n\r\n\r\nprint(ctr)", "iterations = int(input())\r\n\r\nprime_numbers = []\r\nfor i in range(1, iterations+1):\r\n if i == 1:\r\n continue\r\n for j in range(1, i+1):\r\n if i % j == 0 and j != 1 and j != i:\r\n break\r\n else:\r\n prime_numbers.append(i)\r\n\r\nresult = 0\r\ndividers = 0\r\nfor i in range(1, iterations+1):\r\n for j in prime_numbers:\r\n if i < j:\r\n break\r\n if i % j == 0:\r\n dividers += 1\r\n if dividers == 3:\r\n break\r\n if dividers == 2:\r\n result += 1\r\n dividers = 0\r\nprint(result)", "def solve():\r\n n = int(input())\r\n res = 0\r\n cnt = 0\r\n for i in range(2, n+1):\r\n cnt = 0\r\n j = i\r\n k = 2\r\n while k*k <= j:\r\n if j%k == 0:\r\n cnt += 1\r\n while j%k == 0:\r\n j = j/k\r\n k += 1\r\n if j > 1:\r\n cnt += 1\r\n if cnt == 2:\r\n res += 1\r\n print(res)\r\nsolve()", "from sys import stdin\r\ninput = stdin.readline\r\nimport math\r\n\r\ndef czy_pierwsza(x):\r\n\tfor c in range(2, int(math.sqrt(x)) + 1):\r\n\t\tif x % c == 0:\r\n\t\t\treturn False\r\n\t\t\t\r\n\treturn True\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tw = 0\r\n\r\n\tfor liczba_ktora_testujemy in range(1, n + 1):\r\n\t\tdzielniki = []\r\n\t\tfor k in range(1, int(math.sqrt(liczba_ktora_testujemy))+1):\r\n\t\t\tif(liczba_ktora_testujemy % k == 0):\r\n\t\t\t\tdzielniki.append(k)\r\n\t\t\t\tdrugiDzielnik = liczba_ktora_testujemy/k\r\n\t\t\t\tif(drugiDzielnik != k): \r\n\t\t\t\t\tdzielniki.append(int(drugiDzielnik))\r\n\t\r\n\t\t# ~ breakpoint()\r\n\t\tdzielniki.sort()\r\n\t\tile = 0\r\n\t\tfor k in dzielniki:\r\n\t\t\tif k != 1 and czy_pierwsza(k):\r\n\t\t\t\tile += 1\r\n\t\t\t\t\r\n\t\tif ile == 2:\r\n\t\t\tw += 1\r\n\t\t\r\n\tprint(w)\r\n\t\r\nmain()\r\n", "def solution(num):\r\n res = []\r\n d = 2\r\n while d * d <= num:\r\n while not num % d: \r\n res.append(d)\r\n num //= d\r\n d += 1\r\n\r\n if num > 1:\r\n res.append(num)\r\n \r\n return set(res)\r\n\r\n\r\ndef check(n):\r\n res = 0\r\n for i in range(1, n + 1):\r\n tmp = solution(i)\r\n if len(tmp) == 2:\r\n res += 1\r\n return res\r\n\r\n\r\nx = int(input())\r\nprint(check(x))", "n=int(input())\r\nlst=[0]*(n+1)\r\nfor i in range(2,n):\r\n if lst[i]==0:\r\n for j in range(2*i,n+1,i):\r\n lst[j]+=1\r\nprint(lst.count(2))", "def almostPrime(x):\n aux = []\n for i in range(x + 1):\n aux.append(0)\n for i in range(2, x // 2 + 1):\n if not aux[i]:\n for j in range(2 * i, x + 1, i):\n aux[j] += 1\n ans = aux.count(2)\n return ans\n\n\nn = int(input())\nprint(almostPrime(n))\n\t\t\t\t\t\t \t\t \t\t \t\t\t \t \t\t \t \t\t\t\t", "def factors(n):\n\tfrom functools import reduce\n\treturn set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\t\n\ndef isPrime(n):\n\t# a prime(except 2 or 3) is of the form 6k-1 or 6k+1\n\tif n == 2 or n == 3:\n\t\treturn True\n\tif n % 2 == 0 or n % 3 == 0:\n\t\treturn False\n\ti = 5\n\tw = 2\n\tsqN = int(pow(n, .5))\n\twhile i <= sqN:\n\t\tif n % i == 0:\n\t\t\treturn False\n\t\ti += w\n\t\tw = 6 - w\n\treturn True\n\ndef isAlmostPrime(n):\n\tfacs = sorted(list(factors(n)))\n\tc = 0\n\tfor i in range(1, len(facs)-1):\n\t\tif isPrime(facs[i]):\n\t\t\tc += 1\n\treturn c == 2\n\nn = int(input().strip())\nc = 0\nfor i in range(1, n+1):\n\tif isAlmostPrime(i):\n\t\tc += 1\nprint(c)\n\n\n", "from collections import Counter\r\n\r\n\r\ndef LI():\r\n return list(map(int, input().split(\" \")))\r\ndef LS():\r\n return input().split(\" \")\r\ndef LC():\r\n return input().split()\r\ndef I():\r\n return int(input())\r\ndef S():\r\n return input()\r\n\r\nprime = set()\r\nprime.add(2)\r\nalmost = 0\r\nrang = I()\r\n\r\nfor num in range(3, rang + 1):\r\n temp = []\r\n for p in prime:\r\n if num % p == 0:\r\n temp.append(p)\r\n divisors = len(Counter(temp))\r\n if not divisors:\r\n prime.add(num)\r\n elif divisors == 2:\r\n almost += 1\r\nprint(almost)\r\n\r\n \r\n", "import math\r\ndef is_prime(num):\r\n sq = int(math.sqrt(num))\r\n for i in range(2, sq + 1):\r\n if num % i == 0:\r\n return False\r\n else:\r\n return True\r\nn = int(input())\r\n\r\ncnt1 = 0\r\nfor i in range(6, n + 1):\r\n cnt = 0\r\n if is_prime(i) == False:\r\n for k in range(2, i + 1):\r\n if i % k == 0 and is_prime(k):\r\n cnt += 1\r\n if cnt > 3:\r\n break\r\n if cnt == 2:\r\n cnt1 += 1\r\nprint(cnt1)\r\n\r\n \r\n", "n = int(input())\r\ncounter = 0\r\nfor i in range(4, n+1):\r\n pd_counter = 0\r\n for j in range(2, n):\r\n if pd_counter > 2:\r\n break\r\n if i % j == 0:\r\n pd_counter += 1\r\n while i % j == 0:\r\n i //= j\r\n\r\n if pd_counter == 2:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "def almostPrime(num):\r\n primes = set()\r\n\r\n d = 2\r\n \r\n while d*d <= num:\r\n\r\n while num % d == 0:\r\n primes.add(d)\r\n num //= d\r\n d += 1\r\n if num > 1:\r\n primes.add(n)\r\n return len(primes) == 2\r\n\r\nn = int(input())\r\nres = 0\r\nfor num in range(2,n + 1):\r\n if almostPrime(num):\r\n res += 1\r\n\r\nprint(res)\r\n\r\n", "from collections import Counter\r\n\r\ndef checker(n):\r\n d = 2\r\n count = 0\r\n flag = True\r\n while(d * d <= n):\r\n while(n % d == 0):\r\n if flag:\r\n count += 1\r\n flag = False\r\n n = n // d\r\n d += 1\r\n flag = True\r\n if n > 1:\r\n count += 1\r\n \r\n return count\r\n\r\ncnt = 0\r\nn = int(input())\r\nfor i in range(1,n+1):\r\n if checker(i) == 2:\r\n cnt += 1\r\nprint(cnt)\r\n \r\n# testcases = int(input())\r\n# for _ in range(testcases):\r\n# checker()\r\n ", "c=0\r\nn = int(input())\r\nfor i in range(6,n+1):\r\n ct=0\r\n j=2\r\n while(j*j<=i):\r\n if(i%j==0):\r\n while(i%j==0):\r\n i//=j\r\n ct+=1\r\n j+=1\r\n if i>1:\r\n ct+=1\r\n if ct==2:\r\n c+=1\r\nprint(c)", "# ~ prime = []\r\n# ~ mark = [True]*(1000000+1)\r\n# ~ def sieve(n):\r\n\t# ~ mark[0] = mark[1] = False\r\n\t# ~ p = 2\r\n\t# ~ while p*p <= n:\r\n\t\t# ~ if mark[p]:\r\n\t\t\t# ~ for i in range(p*p, n+1, p):\r\n\t\t\t\t# ~ mark[i] = False\r\n\t\t# ~ p += 1\r\n\t# ~ for i in range(n+1):\r\n\t\t# ~ if mark[i]:\r\n\t\t\t# ~ prime.append(i) \r\n# ~ sieve(1000000)\r\nn = int(input())\r\nc = 0\r\nfor i in range(1,n+1):\r\n\tx = i\r\n\ty = 0\r\n\tfor j in range(2, x+1):\r\n\t\tf = 0\r\n\t\twhile x % j == 0:\r\n\t\t\tx //= j\r\n\t\t\tf = 1\r\n\t\tif f:\r\n\t\t\ty += 1\r\n\t# ~ print(i, y)\r\n\tif y == 2:\r\n\t\tc += 1\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "t = int(input())\r\nif t<=5:\r\n print(0)\r\nelse:\r\n def is_prime(n):\r\n CNT = 0\r\n for i in range(2, n + 1):\r\n if i * i > n:\r\n break\r\n D = 0\r\n while n % i == 0:\r\n D = 1\r\n n /= i\r\n CNT += D\r\n if n != 1:\r\n CNT += 1\r\n if CNT == 2:\r\n return True\r\n return False\r\n x = 0\r\n for i in range(1, t+1):\r\n if is_prime(i):\r\n x += 1\r\n print(x)", "from sys import stdin\nfrom collections import defaultdict, deque, Counter\nfrom math import floor, ceil, log, inf, sqrt\nfrom heapq import *\nfrom functools import lru_cache\nfrom bisect import bisect_left, bisect_right\nimport itertools\nimport random\nfrom string import ascii_lowercase\n\nN = int(stdin.readline())\n\nsieve = [-1]*(3001)\nsieve[0] = 0\nsieve[1] = 0\n\nfor i in range(2,len(sieve)):\n if sieve[i] == -1:\n for j in range(i*2,len(sieve),i):\n sieve[j] = i\n \nans = 0\n\nfor i in range(2,N+1):\n divs = set()\n x = i\n \n while sieve[x] != -1:\n divs.add(sieve[x])\n x //= sieve[x]\n\n divs.add(x)\n ans += 1 if len(divs) == 2 else 0\n\nprint(ans)\n\n \t \t \t\t \t \t \t \t \t\t\t", "############ ---- By RealGemechis (Black Tourist) ---- ############\r\nimport sys\r\ninput = sys.stdin.readline\r\nimport math\r\nimport bisect\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\nmod = 1000000007\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inplist():\r\n return(list(map(int,input().split())))\r\ndef instr():\r\n s = input() \r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndef str_int(x):\r\n return(int(x))\r\n__author__ = \"Gemechis\"\r\n\r\ndef main():\r\n \r\n num = int(inp())\r\n count = 0\r\n \r\n for n in range(num+1):\r\n factorization = set()\r\n d = 2\r\n while d*d <= n:\r\n while n % d == 0:\r\n factorization.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n factorization.add(n)\r\n if len(factorization) == 2:\r\n count += 1\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n ", "import datetime\r\n\r\n\r\ndef is_almost_prime(x):\r\n fact = set()\r\n i = 2\r\n while i * i < x:\r\n if x % i == 0:\r\n fact.add(i)\r\n while x % i == 0:\r\n x //= i\r\n if len(fact) > 2:\r\n return False\r\n i += 1\r\n if x != 1:\r\n fact.add(x)\r\n\r\n return len(fact) == 2\r\n\r\n\r\nn = int(input())\r\ncnt = 0\r\n\r\nfor i in range(n + 1):\r\n cnt += is_almost_prime(i)\r\nprint(cnt)\r\n", "from math import * \r\nn = int(input()) \r\na = [0]*(n+1) \r\n \r\nfor i in range(2, (n//2)+1): \r\n if a[i] == 0: \r\n for j in range(2 * i, n + 1, i): \r\n a[j] += 1 \r\n \r\nprint(str(a).count('2')) ", "n = int(input())\nprimos = []\nfor e in range(2, n):\n is_pri = True\n for i in range(2, e):\n if(e % i == 0):\n is_pri = False\n break\n if(is_pri):\n primos.append(e)\ntotal = 0\nfor e in range(1, n + 1):\n how_many = 0\n for primo in primos:\n if(e % primo == 0):\n how_many += 1\n if(how_many == 2):\n total += 1\n\n\nprint(total)\n \t\t \t\t \t\t\t \t\t\t \t\t\t\t \t\t", "def trial_division_simple(n):\r\n m = set()\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n m.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n m.add(n)\r\n\r\n if len(m) == 2:\r\n return True\r\n return False\r\n\r\nnum = int(input())\r\nres = 0\r\nfor i in range(1,num+1):\r\n if trial_division_simple(i):\r\n res += 1\r\nprint(res)\r\n\r\n", "from math import sqrt\r\nn = int(input())\r\ndef get_primes(n):\r\n primes = []\r\n y = 0\r\n for i in range(2,n+1):\r\n prime = True\r\n for j in range(2,i):\r\n if i%j == 0:\r\n prime = False\r\n break\r\n if prime:\r\n primes.append(i)\r\n if i < sqrt(n):\r\n y += 1\r\n return [primes,y]\r\ns = 0\r\n[primes,y] = get_primes(n)\r\nfor k in range(0,y):\r\n a = primes[k]\r\n ra = n//a \r\n for m in range(k+1,len(primes)):\r\n b = primes[m]\r\n rb = n//b \r\n t = a*b\r\n for i in range(1,ra):\r\n #t = b*a**i\r\n tb = t\r\n for j in range(rb):\r\n if tb <= n:\r\n s += 1\r\n else:\r\n break\r\n tb*=b\r\n t *= a\r\nprint(s)\r\n ", "n=int(input())\nans=[0]*(n+1)\nfor i in range(2,(n//2)+1):\n if ans[i] == 0:\n for j in range(2 * i, n + 1, i):\n ans[j] += 1 \nprint(ans.count(2))\n\t \t \t\t \t\t\t\t \t\t\t \t \t\t \t", "intInput = lambda : int(input())\r\ntupInput = lambda : map(int, input().strip().split())\r\nlistInput = lambda : list(map(int, input().strip().split()))\r\nstrInput = lambda : list(input().strip())\r\n\r\n\r\ndef run():\r\n n = intInput()\r\n if n < 3:\r\n print(0)\r\n return\r\n \r\n primes = [2]\r\n almostPrimes = 0\r\n curr = 3\r\n while curr <= n:\r\n factors = set()\r\n for prime in primes:\r\n temp = curr\r\n while temp % prime == 0:\r\n factors.add(prime)\r\n temp //= prime\r\n \r\n if not factors:\r\n primes.append(curr)\r\n elif len(factors) == 2:\r\n almostPrimes += 1\r\n \r\n curr += 1\r\n \r\n print(almostPrimes)\r\n\r\n\r\nrep = 1\r\nfor _ in range(rep):\r\n run()", "pr=[]\r\nfor i in range(2, 3000):\r\n flag=0\r\n for j in pr:\r\n\t if i%j==0:\r\n\t flag=1\r\n\t break\r\n if flag==0:\r\n\t pr.append(i)\r\npr.append(1e10)\r\nn=int(input())\r\ncount=0\r\nfor i in range(6, n+1):\r\n j=0\r\n count1=0\r\n while i>=pr[j]:\r\n if i%pr[j]==0:\r\n count1+=1\r\n j+=1\r\n if count1==2:\r\n count+=1\r\nprint(count)\r\n", "def prime_factorization(num: int) -> list[int]:\r\n factorization: set = set()\r\n\r\n d = 2\r\n\r\n while d * d <= num:\r\n while num % d == 0:\r\n factorization.add(d)\r\n num //= d\r\n d += 1\r\n \r\n if num != 1:\r\n factorization.add(num)\r\n \r\n return factorization\r\n\r\n\r\ndef solve():\r\n num = int(input())\r\n answer = 0\r\n\r\n for i in range(1, num + 1):\r\n if len(prime_factorization(i)) == 2:\r\n answer += 1\r\n\r\n print(answer)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "n = int(input())\nnum = [2]\nh = 0\nfor i in range(3,n+1):\n for x in range(2,i):\n a = i % x\n if a == 0:\n break\n if x == (i-1):\n num.append(i)\nfor c in range(1,n+1):\n d = 0\n for y in range(len(num)):\n b = c % num[y]\n if b == 0:\n d = d + 1\n if d == 2:\n h = h + 1\nprint(h)\n\t \t\t\t \t \t \t\t \t \t\t \t \t", "n = int(input())\r\n\r\nans = 0\r\nx = n\r\nfor i in range(1, x + 1):\r\n d = 2\r\n fact = []\r\n n = i\r\n while d * d <= n:\r\n while n % d == 0:\r\n fact.append(d)\r\n n = n // d\r\n d += 1\r\n \r\n if n > 1:\r\n fact.append(n) \r\n \r\n if len(list(set(fact))) == 2:\r\n ans += 1\r\n \r\nprint(ans)\r\n", "def prost(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\n\r\nn = int(input())\r\ns = 0\r\nfor i in range(2, n + 1):\r\n c = 0\r\n for j in range(2, i):\r\n if i % j == 0:\r\n if prost(j):\r\n c += 1\r\n if c == 2:\r\n s += 1\r\nprint(s)", "number = int(input())\r\nanswer = 0\r\n\r\nfor num in range(2, (number + 1)):\r\n primes = set()\r\n while num > 1:\r\n for i in range(2, (num + 1)):\r\n if num % i == 0:\r\n num //= i\r\n break\r\n primes.add(i)\r\n \r\n if len(primes) == 2:\r\n answer += 1\r\n \r\nprint(answer)", "\r\nn = int(input())\r\n\r\nfrom math import sqrt\r\ndef primefactors(n):\r\n\tss = set()\r\n\twhile n % 2 == 0:\r\n\t\tss.add(2)\r\n\t\tn //= 2\r\n\r\n\tfor i in range(3, int(sqrt(n)) + 1, 2):\r\n\r\n\t\twhile n % i == 0:\r\n\t\t\tss.add(i)\r\n\t\t\tn //= i\r\n\r\n\tif n > 2:\r\n\t\tss.add(n)\r\n\r\n\treturn ss\r\n\r\n\r\nans = 0\r\nfor i in range(6, n + 1):\r\n\t\r\n\tss = primefactors(i)\r\n\r\n\tif len(ss) == 2:\r\n\t\tans += 1\r\n\r\nprint(ans)", "import sys\nimport math\n# a_o,b_o,c_o = [int(x) for x in input().split(' ')]\n# a,b,c = a_o,b_o,c_o\n# if a>b:\n# a,b = b,a\n# while b:\n# a = a%b\n# a,b = b,a\n\n\n# if c%a == 0:\n# print('YES')\n# else:\n# print('NO')\nn = int(input())\nnums = [0 for i in range(n+1)]\nnums[0],nums[1] = 1,1\n\nfor i in range(2,n+1):\n if nums[i] == 0:\n for j in range(2*i, n+1, i):\n\n nums[j] += 1\nct = 0\nfor i in range(len(nums)):\n if nums[i]==2:\n ct += 1\nprint(ct)", "def Factor(n):\r\n Ans = []\r\n d = 2\r\n while d * d <= n:\r\n if n % d == 0:\r\n Ans.append(d)\r\n n //= d\r\n else:\r\n d += 1\r\n if n > 1:\r\n Ans.append(n)\r\n return Ans\r\n\r\n\r\nt = int(input())\r\nr = 0\r\nfor ViZnaliChtoVlasovBot in range(6, t + 1):\r\n n = ViZnaliChtoVlasovBot\r\n if len(set(Factor(n))) == 2:\r\n r += 1\r\nprint(r)\r\n", "def print_prime(n):\r\n i = 2\r\n ans = set()\r\n while i*i <= n:\r\n if n<=1:\r\n break\r\n if n%i == 0:\r\n ans.add(i)\r\n n = n//i\r\n else:\r\n i += 1\r\n if n >= 2:\r\n ans.add(n)\r\n return len(ans) == 2\r\n\r\nn = int(input())\r\nc = 0\r\nfor i in range(2,n+1):\r\n factors = print_prime(i)\r\n if factors == True:\r\n c += 1\r\nprint(c)\r\n", "import math\r\nx = int(input())\r\ns = 0\r\ndef findPrimes(n):\r\n\tprimes = []\r\n\tfor i in range(2, n+1):\r\n\t\tj = 2\r\n\t\tpos = False\r\n\t\twhile j * j < i:\r\n\t\t\tif j % i == 0:\r\n\t\t\t\tpos = True\r\n\t\t\t\tbreak\r\n\t\t\tj+=1\r\n\t\tif(not pos):\r\n\t\t\tprimes.append(i)\r\n\r\n\treturn primes\r\n\r\ndef primeFactorize(n, primes):\r\n\tprimeFactors = []\r\n\tfor i in primes:\r\n\t\twhile(n%i == 0):\r\n\t\t\tprimeFactors.append(i)\r\n\t\t\tn = n//i \r\n\t\tif(n == 1):\r\n\t\t\tbreak\r\n\t\r\n\treturn primeFactors\r\n\r\nprimes = findPrimes(3000)\r\nfor i in range(1,x+1):\r\n l = primeFactorize(i,primes) \r\n y = []\r\n for k in l:\r\n if k in y:\r\n pass\r\n else:\r\n y.append(k)\r\n if len(y)==2:\r\n s+=1\r\nprint(s)", "import math\r\ndef prime(n):\r\n a=n\r\n ans = 0\r\n for i in range(2,int(math.sqrt(n))+2):\r\n if n%i==0:\r\n ans+=1\r\n while n % i== 0:\r\n n = n // i\r\n if ans>2:\r\n return False\r\n if n>2:\r\n ans+=1\r\n \r\n return ans==2\r\n \r\n \r\nn = int(input())\r\nans = 0\r\nfor i in range(6,n+1):\r\n if prime(i):\r\n ans+=1\r\nprint(ans) \r\n ", "\r\nn = int(input())\r\n\r\nal_prime = [0] * (n + 1)\r\nis_prime = [0, 0] + [1] * (n + 1)\r\n\r\ni = 2\r\ntot = 0\r\nwhile i <= n:\r\n if is_prime[i]:\r\n j = 2 * i\r\n while j <= n:\r\n is_prime[j] = 0\r\n al_prime[j] += 1\r\n j += i\r\n elif al_prime[i] == 2:\r\n tot += 1\r\n i += 1\r\n\r\nprint(tot)\r\n\r\n\r\n", "n = int(input())\r\n\r\ndef howManyPrimes(num):\r\n d = 2\r\n primes = set()\r\n \r\n while d * d <= num:\r\n while not num % d:\r\n primes.add(d)\r\n num //= d\r\n \r\n d += 1\r\n \r\n if num > 1:\r\n primes.add(num)\r\n \r\n return len(primes)\r\n\r\ncoprimes = 0\r\nfor num in range(2, n + 1):\r\n if howManyPrimes(num) == 2:\r\n coprimes += 1\r\n \r\nprint(coprimes)", "def is_almost_prime(n):\r\n factors = set()\r\n\r\n curr = 2\r\n\r\n while curr * curr <= n:\r\n while n % curr == 0:\r\n factors.add(curr)\r\n n //= curr\r\n\r\n curr += 1\r\n\r\n if n >= curr:\r\n factors.add(n)\r\n\r\n return len(factors) == 2\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nres = 0\r\nfor num in range(1, n+1):\r\n # print(num, is_almost_prime(num))\r\n if is_almost_prime(num):\r\n res += 1\r\n\r\nprint(res)\r\n", "\r\nn = int(input())\r\nfactors = set()\r\na = [0]*(1000005)\r\nprimes = set()\r\nprimes.add(2)\r\nans = 0\r\nfor i in range(3,1000000,2):\r\n if a[i]==0:\r\n primes.add(i)\r\n for j in range(i,1000000,i):\r\n a[j]=1\r\nfor j in range(6,n+1):\r\n temp = 0\r\n factors = set()\r\n for i in primes:\r\n while j%i==0:\r\n if i not in factors:\r\n factors.add(i)\r\n temp+=1\r\n j/=i\r\n if j==1:\r\n break\r\n if j in primes:\r\n temp+=1\r\n break\r\n if temp==2:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nv = []\r\nfor i in range(2,n + 1):\r\n\tif all(i % j != 0 for j in v):\r\n\t\tv.append(i)\r\n\r\ndef is_almost_prime(n):\r\n\tc = 0\r\n\tfor p in v:\r\n\t\tif n % p == 0:\r\n\t\t\tc += 1\r\n\tif(c == 2):\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\ncnt = 0\r\nfor i in range(1,n+1):\r\n\tif is_almost_prime(i):\r\n\t\tcnt += 1\r\nprint(cnt)", "def sushu(m):\n cnt=0\n for j in range(2,int(m/2)+1):\n if m%j==0:\n cnt+=1\n return cnt\nn=int(input())\nlis1=[i for i in range(2,n+1) if sushu(i)==0]\nc=0\nfor k in range(1,n+1):\n cn = 0\n for l in lis1:\n if k%l==0:\n cn+=1\n if cn==2:\n c+=1\nprint(c)\n\t\t \t\t \t \t \t \t \t \t \t\t \t \t", "import math\r\ndef primeFactors(n):\r\n a = set()\r\n\r\n while n % 2 == 0:\r\n a.add(2)\r\n n = n /2\r\n\r\n for i in range(3, int(math.sqrt(n))+1,2):\r\n while n % i == 0:\r\n a.add(int(i))\r\n n = n / i\r\n if n > 2:\r\n a.add(int(n))\r\n return a\r\n\r\n\r\ndef process(n):\r\n cnt = 0\r\n for i in range(1,n+1):\r\n if len(primeFactors(i)) == 2:\r\n cnt +=1\r\n return cnt\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nprint(process(n))", "from math import sqrt\r\n\r\ndef is_prime(a):\r\n if a == 1:\r\n return False\r\n ra = int(sqrt(a))\r\n for d in range(2, ra + 1):\r\n if a % d == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\n#rn = int(sqrt(n))\r\ncount = 0\r\nfor k in range(1, n + 1):\r\n c = 0\r\n for d in range(2, k + 1):\r\n if k % d == 0 and is_prime(d):\r\n c += 1\r\n #print(d)\r\n if c == 2:\r\n #print('---', k)\r\n count += 1\r\nprint(count)\r\n", "def almost_prime(num): \r\n x = num \r\n d = 2\r\n\r\n factorization = set()\r\n \r\n while d * d <= num: \r\n while num % d == 0: \r\n factorization.add(d)\r\n num //= d\r\n\r\n d += 1\r\n\r\n if num > 1:\r\n factorization.add(num)\r\n \r\n return len(factorization) == 2\r\n\r\n\r\ndef almost_primes(num):\r\n count = 0\r\n\r\n for num in range(2, num + 1):\r\n if almost_prime(num): \r\n count += 1\r\n \r\n return count\r\n\r\n\r\nprint(almost_primes(int(input())))", "import math\r\n\r\n\r\ndef IsPrime(num):\r\n if num == 2:\r\n return True\r\n if num % 2 == 0:\r\n return False\r\n limit = math.isqrt(num)\r\n for i in range(3, limit + 1, 2):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef HasExactlyTwoPrimeDivs(num):\r\n counter = 0\r\n for i in range(2, num):\r\n if num % i == 0 and IsPrime(i):\r\n counter += 1\r\n return counter == 2\r\n\r\n\r\nN, ans = int(input()), 0\r\nfor i in range(6, N + 1):\r\n ans += HasExactlyTwoPrimeDivs(i)\r\n\r\nprint(ans)\r\n", "#papi eratostenes x2 almost prime\nprimes = [[i, 1] for i in range(3004)]\n\ndef sieve():\n primes[0][1] = 0\n primes[1][1] = 0\n for i in range(2,len(primes)):\n if primes[i][1] == 1:\n for valor in range(2*i,len(primes), i):\n primes[valor][1] += 1\n\n\ndef solve(n):\n count = 0\n for j in range(2,n+1):\n if primes[j][1] -1 == 2:\n count+= 1\n print(count)\n\n\ndef main():\n sieve()\n\n n = int(input())\n solve(n)\n \nmain()\n \t\t \t \t\t \t \t \t\t\t\t\t \t\t\t\t \t \t", "n=int(input())\r\na=[]\r\nfor i in range(n+1):\r\n a.append([])\r\nfor i in range(2,n):\r\n if(len(a[i])==0):\r\n for j in range(i+i,n+1,i):\r\n a[j].append(i)\r\nans=0\r\nfor i in a:\r\n if(len(i)==2):\r\n ans+=1 \r\n# print(a)\r\nprint(ans)\r\n", "# https://codeforces.com/problemset/problem/26/A\r\n\r\ndef is_prime(even_number):\r\n divisor = 3\r\n while divisor * divisor <= even_number:\r\n if even_number % divisor == 0:\r\n return False\r\n divisor += 2\r\n return True\r\n\r\n\r\ndef prime_numbers():\r\n yield 2\r\n n = 3\r\n while True:\r\n if is_prime(n):\r\n yield n\r\n n += 2\r\n\r\n\r\ndef func_sol(raw_data):\r\n n = int(raw_data.strip())\r\n\r\n primes = []\r\n for d in prime_numbers():\r\n if d > n:\r\n break\r\n primes.append(d)\r\n\r\n cnt = 0\r\n for i in range(len(primes) - 1):\r\n for j in range(i + 1, len(primes)):\r\n ci = 1\r\n while primes[i] ** ci <= n:\r\n cj = 1\r\n while primes[j] ** cj <= n:\r\n t = primes[i] ** ci * primes[j] ** cj\r\n if t <= n:\r\n cnt += 1\r\n cj += 1\r\n ci += 1\r\n\r\n return str(cnt)\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "def prime_factorize(n):\r\n d = 2\r\n primes = []\r\n while d * d <= n:\r\n while n % d == 0:\r\n primes.append(d)\r\n n //=d\r\n d+=1\r\n if n > 1:\r\n primes.append(n)\r\n return primes\r\n\r\nn = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n primes = prime_factorize(i)\r\n if len(set(primes)) == 2:\r\n count += 1\r\nprint(count)", "inp = int(input())\r\nres = 0\r\n\r\ndef isPrime(x):\r\n for i in reversed(range(2, x)):\r\n if x % i == 0:\r\n return False\r\n return x != 1\r\n\r\nfor i in range(6, inp + 1):\r\n count = 0\r\n for j in range(2, inp):\r\n if i % j == 0 and isPrime(j):\r\n count += 1\r\n \r\n if count == 2:\r\n res += 1\r\n \r\n\r\nprint(res)", "# A. Almost Prime\n\nfrom math import sqrt\n\n\ndef all_distinct_prime_factors(n):\n st = set()\n if n == 0 or n == 1:\n return st\n else:\n while n % 2 == 0:\n st.add(2)\n n = n // 2\n for i in range(3, int(sqrt(n))+1, 2):\n while n % i == 0:\n st.add(i)\n n = n // i\n if n > 2:\n st.add(n)\n return st\n\n\nn = int(input())\nans = 0\nfor i in range(1, n+1):\n if len(all_distinct_prime_factors(i)) == 2:\n ans += 1\nprint(ans)\n", "def isprime(x) :\n\tif x == 1:\n\t\treturn 0\n\ti = int(2)\n\twhile i * i <= x :\n\t\tif x % i == 0 :\n\t\t\treturn 0\n\t\ti += 1\n\treturn 1\na = int(input())\nans = int(0)\nfor x in range(1, a + 1) :\n\tcnt = int(0)\n\tj = int(1)\n\twhile j * j <= x :\n\t\tif x % j == 0 :\n\t\t\tif isprime(j) :\n\t\t\t\tcnt += 1\n\t\t\tif isprime(x / j) and x / j != j :\n\t\t\t\tcnt += 1\n\t\tj += 1\n\tif cnt == 2 : \n\t\tans += 1\nprint(ans)\t\n", "\"\"\"\r\nAuthor : Tamil Selvan\r\n \r\n\r\n\"\"\"\r\n\r\n\r\ndef isPrime(n):\r\n if n==2:\r\n return True\r\n\r\n if n<2 or n%2==0:\r\n return False\r\n\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\ndef almostPrime(n):\r\n cnt = 0\r\n for i in range(1,(n//2)+1):\r\n\r\n if n%i==0 and isPrime(i):\r\n cnt += 1\r\n if cnt > 2:\r\n return False\r\n if cnt==2:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n\r\ndef solve():\r\n\r\n n = int(input())\r\n c = 0\r\n for i in range(1,n+1):\r\n\r\n\r\n if almostPrime(i):\r\n c+=1\r\n\r\n\r\n print(c)\r\n\r\n\r\nsolve()\r\n", "import math\n\nn = int(input())\n\ndef primefactors(n):\n s = set()\n\n while n % 2 == 0:\n s.add(2)\n n = n // 2\n\n for i in range(3,int(math.sqrt(n))+1,2):\n while (n % i == 0):\n s.add(i)\n n = n // i\n\n if n > 2:\n s.add(n)\n return len(s) == 2\n\n\n\ncount = 0\nfor i in range(2,n+1):\n if primefactors(i):\n count += 1\n\nprint(count)\n\n\t \t\t\t \t \t\t\t \t \t\t \t \t \t\t\t\t\t\t\t", "maxN = 3003\n\nprimes = set()\n\n\ndef is_a_prime(x):\n\n if x == 1:\n return False\n\n for i in range(2, x):\n if x % i == 0:\n return False\n \n return True\n\nfor i in range(1, maxN):\n if is_a_prime(i):\n primes.add(i)\n\ndef almost_prime(x):\n\n if x == 1:\n return False\n \n if x in primes:\n return False\n \n factors = []\n\n prime_count = 0\n \n for i in range(1, x):\n if x % i == 0:\n if i in primes:\n prime_count += 1\n \n return (prime_count == 2)\n\n\nN = int(input())\n\ncount = 0\nfor i in range(1, N+1):\n if almost_prime(i):\n count += 1\n #print(f\"{i} is almost prime\")\n\nprint(count)\n \t\t\t \t \t\t \t \t \t \t\t \t\t \t\t \t \t\t", "def is_prime(x):\r\n if x==2:\r\n return True\r\n else:\r\n for i in range(2, x//2+1):\r\n if x%i == 0:\r\n return False\r\n return True\r\n \r\nn = int(input())\r\ncount = 0\r\n\r\nfor j in range(6, n+1):\r\n if is_prime(j):\r\n continue\r\n else:\r\n lst = [i for i in range(2, n) if j%i==0]\r\n lst1 = list(filter(is_prime, lst))\r\n if len(lst1) == 2:\r\n count += 1\r\nprint(count)\r\n\r\n\r\n\r\n", "import math\r\n\r\nn = int(input())\r\nap = 0\r\n\r\n\r\ndef prime(num):\r\n for i in range(2,num - 1):\r\n if num%i == 0:\r\n return False\r\n return True\r\nfor i in range(3,n + 1):\r\n d1 = False\r\n d2 = False\r\n for j in range(2,i):\r\n if i%j == 0 and prime(j):\r\n if not d1:\r\n d1 = True\r\n elif not d2:\r\n d2 = True\r\n else:\r\n d1 = False\r\n d2 = False\r\n break\r\n if d1 and d2:\r\n #print(i)\r\n ap = ap + 1\r\nprint(ap)\r\n\r\n", "n = int(input())\n\n\ndef f(n):\n a = [c for c in range(2, n+1)]\n i = 0\n while i*i <= n:\n if i < len(a):\n if a[i] != 0:\n for j in range(a[i]*a[i], n+1, a[i]):\n a[j-2] = 0\n i += 1\n b = []\n for c in a:\n if c != 0:\n b.append(c)\n return b\nc = 0\nfor i in range(2, n+1):\n d = 0\n for j in (f(i)):\n if i % j == 0:\n d += 1\n if d == 2:\n c += 1\nprint(c)\n", "b=int(input())\nap=0\nfor a in range(b+1):\n sum=0\n if a==1:\n pass\n else:\n for i in range(2,a): \n if a%i==0 :\n am=True\n for j in range(2,i):\n if i%j==0:\n am=False\n break\n if am:\n sum+=1\n if sum ==3:\n break\n if sum==2:\n ap+=1\nprint(ap)\n\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t\t\t \t\t \t", "num = int(input())\r\n\r\ndef primeFactorizer(n):\r\n factors = set()\r\n d = 2\r\n\r\n while d * d <= n:\r\n\r\n while n % d == 0:\r\n factors.add(d)\r\n n = n // d\r\n\r\n d += 1\r\n \r\n if n > 1:\r\n factors.add(n)\r\n\r\n return len(factors)\r\n\r\n\r\nif num < 6:\r\n print(0)\r\nelse:\r\n res = 0\r\n for i in range(1, num + 1):\r\n primeFactors = primeFactorizer(i)\r\n if primeFactors == 2:\r\n res += 1\r\n \r\n\r\n print(res)\r\n\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 and x != 2:\r\n return False\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\nk = 0\r\nfor i in range(1, n+1):\r\n if not is_prime(i):\r\n r = 0\r\n for j in range(2, i+1):\r\n if i % j == 0 and is_prime(j):\r\n r += 1\r\n if r > 2:\r\n break\r\n else:\r\n if r == 2:\r\n k += 1\r\nprint(k)", "import math\r\n\r\ndef check(x):\r\n c=0\r\n while x%2==0:\r\n x=x//2\r\n c=1\r\n for w in range(1,x+1):\r\n if x%w==0 and w!=1:\r\n if prime(w):\r\n \r\n c+=1\r\n if c>2:\r\n return False\r\n \r\n if c==2:\r\n \r\n return True\r\n else:\r\n return False\r\n \r\n\r\ndef prime(i):\r\n for x in range(2,int(i//2)):\r\n if i%x==0:\r\n return False\r\n return True \r\n\r\n\r\n\r\n\r\nn=int(input())\r\nsum=0\r\nfor i in range(1,n+1):\r\n if check(i):\r\n # print(i)\r\n sum+=1\r\nprint(sum)", "n = int(input())\nres = 0\naux = [False for _ in range(3001)]\nfactors = [0 for _ in range(3001)]\nfor i in range(2,n+1):\n\tif not aux[i]:\n\t\ts = i + i\n\t\tfor j in range(s, n+1, i):\n\t\t\taux[j] = True\n\t\t\tfactors[j] += 1\n\tif factors[i] == 2:\n\t\tres += 1\nprint(res)\n\n \t\t\t \t \t\t\t \t\t \t \t", "n = int(input())\r\nans =0\r\n \r\nfor i in range(2, n + 1):\r\n x = i\r\n div = []\r\n j = 2\r\n while j*j <= i:\r\n if x % j == 0:\r\n while x % j == 0:\r\n x //= j\r\n div.append(j)\r\n j += 1\r\n if x > 1:\r\n div.append(x)\r\n if len(div) == 2:\r\n ans +=1\r\n \r\nprint(ans)", "import math\r\n\r\n\r\ndef isPrime(num: int):\r\n if num == 2:\r\n return True\r\n if num < 2 or num % 2 == 0:\r\n return False\r\n\r\n lim = int(math.sqrt(num))\r\n for i in range(3, lim + 1, 2):\r\n if num % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef isAlmostPrime(num: int):\r\n counter = 0\r\n for i in range(2, num//2 + 1):\r\n if num % i == 0 and isPrime(i):\r\n counter += 1\r\n return counter == 2\r\n\r\n\r\nn, ans = int(input()), 0\r\nfor i in range(2, n + 1):\r\n if isAlmostPrime(i):\r\n ans += 1\r\n\r\nprint(ans)\r\n'''\r\n\r\n6 -> 2 3\r\n10 -> 2 5\r\n12 -> 2 3\r\n14 -> 2 7\r\n15 -> 3 5\r\n18 -> 2 3\r\n20 -> 2 5\r\n21 -> 3 7\r\n...\r\n\r\n10 => 6, 10 => 2\r\n21 => 6, 10, 12, 14, 15, 18, 20, 21 => 8\r\n'''\r\n", "\r\nn = int(input())\r\n\r\ndef isPerfectPrime(n):\r\n factors = set()\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n factors.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n factors.add(n)\r\n return len(factors)==2\r\n\r\n\r\ncount = 0\r\nfor i in range(6, n+1):\r\n if isPerfectPrime(i):\r\n count += 1\r\nprint(count)\r\n \r\n\r\n", "import sys\r\nimport threading\r\ninp = sys.stdin.readline\r\ninput = lambda: inp().strip()\r\nii = lambda: int(input())\r\nmi = lambda: map(int,input().split())\r\nli = lambda: list(map(int,input().split()))\r\nfrom collections import defaultdict,Counter,deque\r\nfrom bisect import bisect_left,bisect_right\r\nfrom heapq import heappush,heappop,heapify\r\nfrom math import *\r\nmod = 10**9+7\r\n\r\ndef main():\r\n n = ii()\r\n primes = [0] * (n+1)\r\n for i in range(2,n+1):\r\n if primes[i] == 0:\r\n for j in range(i+i,n+1,i):\r\n primes[j] += 1\r\n print(primes.count(2))\r\n \r\nif __name__ == \"__main__\":\r\n sys.setrecursionlimit(2**32//2-1)\r\n threading.stack_size(1 << 27)\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()\r\n \r\n", "number = int(input())\r\n\r\ndef is_prime(n):\r\n if n == 2:\r\n return True\r\n if n == 1: \r\n return False\r\n d = 2\r\n while d * d <= n:\r\n if n % d == 0:\r\n return False\r\n d += 1\r\n return True\r\n \r\n\r\nalmost_prime = 0 \r\nfor n in range(1, number + 1):\r\n divisors = set() \r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n n //= d\r\n divisors.add(d)\r\n d += 1\r\n if n > 1:\r\n divisors.add(n)\r\n count_primes = 0 \r\n for num in divisors:\r\n if is_prime(num):\r\n count_primes += 1\r\n if count_primes == 2:\r\n almost_prime += 1\r\nprint(almost_prime)\r\n \r\n", "import math\r\n\r\ndef main():\r\n n = int(input())\r\n primes = [True] * (n + 1)\r\n primes[0] = primes[1] = False\r\n for k in range(2, int(math.sqrt(n)) + 1):\r\n if primes[k]:\r\n for m in range(2 * k, n + 1, k):\r\n primes[m] = False\r\n\r\n primesVector = [k for k in range(2, n + 1) if primes[k]]\r\n\r\n almostPrimeCount = 0\r\n for k in range(2, n + 1):\r\n divisors = 0\r\n for p in primesVector:\r\n if k % p == 0:\r\n divisors += 1\r\n if divisors == 2:\r\n almostPrimeCount += 1\r\n\r\n print(almostPrimeCount)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def isPrime(n):\r\n factorization = set()\r\n d = 2\r\n\r\n while d * d <= n:\r\n while n % d == 0:\r\n factorization.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n factorization.add(n)\r\n \r\n return factorization\r\n\r\n\r\nn = int(input())\r\nans = 0\r\nfor k in range(1, n+1):\r\n if len(isPrime(k)) == 2:\r\n ans += 1\r\nprint(ans)", "n = int(input())\ndef primos_de_num(num):\n primos = []\n if num%2==0:\n primos.append(2)\n for n in range(3, num+1, 2):\n if num%n ==0:\n es_primo = True\n for i in range(2, n):\n if n % i == 0:\n es_primo = False\n if es_primo:\n primos.append(n)\n return len(primos)\n\nnum_casi_primos = 0\nfor i in range(2, n+1):\n if primos_de_num(i) ==2:\n num_casi_primos+=1\nprint(num_casi_primos)\n \t \t\t\t\t\t\t \t\t\t \t\t \t", "n=int(input())\r\npr=[2]\r\ni=0\r\nFlag=True\r\ndef kd():\r\n ini=0\r\n for i in range(len(pr)):\r\n if p%pr[i]==0:\r\n ini+=1\r\n return ini\r\nfor k in range(3,n+1):\r\n for kk in range(len(pr)):\r\n if k%pr[kk]==0:\r\n Flag=False\r\n break\r\n if Flag!=False:\r\n pr.append(k)\r\n Flag=True\r\nfor p in range(2,n+1):\r\n if kd()==2:\r\n i+=1\r\nprint(i)", "n = int(input())\r\ncount = 0\r\nfor i in range(2,n+1):\r\n result = set()\r\n d = 2\r\n while d * d <= i:\r\n while i % d == 0:\r\n result.add(d)\r\n i //= d\r\n d += 1\r\n if len(result) > 2:\r\n break\r\n \r\n if i > 1:\r\n result.add(i)\r\n \r\n if len(result) == 2:\r\n count += 1\r\n \r\nprint(count)\r\n ", "n = int(input())\r\na = [0]*10005\r\nans = 0\r\ni = 2\r\nwhile i <= n:\r\n if not a[i]:\r\n j = i\r\n while j <= n:\r\n a[j] += 1\r\n j += i\r\n if (a[i]) == 2:\r\n ans += 1\r\n i += 1\r\n \r\nprint(ans)", "from collections import *\nimport sys\nfrom functools import reduce\nfrom itertools import *\n\ndef _input(): return sys.stdin.readline().rstrip(\"\\r\\n\") \ndef I(): return int(_input())\ndef II(): return _input()\ndef III(): return map(int, _input().split())\ndef IV(): return list(map(int, _input().split()))\ndef V(): return sorted(list(map(int, _input().split())))\ndef out(var): sys.stdout.write(str(var) + \"\\n\")\n\ndef prime(n):\n checker = set()\n i = 2\n while i * i <= n:\n if n % i == 0:\n n = n // i\n checker.add(i)\n else:\n i += 1\n if n != 1:\n checker.add(n)\n return len(checker) == 2\n\ndef Solve():\n N = I()\n count = 0\n for i in range(6, N + 1):\n if prime(i):\n count += 1\n out(count)\n\nT = 1\nfor ___ in range(T):\n Solve()\n", "n = int(input())\r\nprimesList = []\r\n\r\nfor i in range(2,n+1):\r\n isPrime = True\r\n for j in range(2,i):\r\n if i%j==0:\r\n isPrime = False\r\n if isPrime:\r\n primesList.append(i)\r\n \r\nans = 0\r\nfor i in range(2,n+1):\r\n cnt = 0\r\n for prime in primesList:\r\n if i%prime==0:\r\n cnt+=1\r\n if cnt == 2: \r\n #print(i)\r\n ans+=1\r\n\r\nprint(ans)\r\n ", "def isPrime(x):\n flag = False\n if x>1:\n for i in range(2,int(x**.5)+1):\n if x%i==0:\n flag = True\n break\n if flag==False:\n return True\n else:\n return False\n else:\n return False\n\ncount = 0\n\nfor n in range(1, int(input())+1):\n lst = []\n for i in range(1,n):\n if n%i==0 and isPrime(i) and i not in lst:\n lst.append(i)\n if len(lst)==2:\n count+=1\n\nprint(count)\n \t\t \t\t\t \t \t \t\t\t\t\t\t \t \t\t\t", "x=3050\r\n\r\nimport math\r\nimport bisect\r\nL=math.floor(math.sqrt(x)) # 平方根を求める\r\n\r\n\r\n\r\nPrimelist=[i for i in range(x+1)]\r\nPrimelist[1]=0 # 1は素数でないので0にする.\r\n \r\nfor i in Primelist:\r\n if i>L:\r\n break\r\n if i==0:\r\n continue\r\n for j in range(2*i,x+1,i):\r\n Primelist[j]=0\r\n\r\nPrimes=[Primelist[j] for j in range(x+1) if Primelist[j]!=0]\r\n\r\nANS=[]\r\n\r\nfor i in range(len(Primes)):\r\n for j in range(i+1,len(Primes)):\r\n x,y=Primes[i],Primes[j]\r\n for k in range(1,15):\r\n for l in range(1,15):\r\n u=(x**k)*(y**l)\r\n if u>3050:\r\n break\r\n ANS.append(u)\r\n\r\nANS.sort()\r\n\r\nn=int(input())\r\n\r\nprint(bisect.bisect(ANS,n))\r\n", "n = int(input())\r\nans = 0\r\nfor i in range(2,n+1):\r\n num = i\r\n d = 2\r\n store = set()\r\n while d * d <= num:\r\n while num % d == 0:\r\n store.add(d)\r\n num //= d\r\n d += 1\r\n if num > 1:\r\n store.add(num)\r\n if len(store) == 2:\r\n ans += 1\r\n # store = set()\r\nprint(ans)", "nC=int(input())\r\nlst=[0]*(nC+1)\r\nfor i in range(2,nC):\r\n if lst[i]==0:\r\n for j in range(2*i,nC+1,i):\r\n lst[j]+=1\r\nprint(lst.count(2))", "\r\nimport math\r\ndef div(n):\r\n\tl=[]\r\n\twhile n%2==0 :\r\n\t\tl.append(2)\r\n\t\tn//=2\r\n\tfor j in range(3,int(math.sqrt(n))+1,2):\r\n\r\n\t\twhile n%j==0:\r\n\t\t\tl.append(j)\r\n\t\t\tn//=j\r\n\tif n>2:\r\n\t\tl.append(n)\r\n\tl=set(l)\r\n\treturn len(l)\r\n\r\n\r\n\r\nans=0\r\nfor i in range(1,int(input())+1):\r\n\tn=i\r\n\tif(div(n) == 2):\r\n\r\n\t\tans+=1\r\nprint(ans)", "def sieve(n):\n Primes = []\n isPrime = [True] * (n + 1)\n isPrime[0] = isPrime[1] = False\n for i in range(2, n + 1):\n if isPrime[i]:\n Primes.append(i)\n for j in range(i * i, n + 1, i):\n isPrime[j] = False\n return Primes\n\n\nn = int(input())\nprime = sieve(n)\nAprimes = []\nfor j in range(1, n+1):\n\n cnt = 0\n for k in prime:\n if j % k == 0:\n cnt += 1\n if cnt == 2:\n Aprimes.append(j)\n\nprint(len(Aprimes))\n\t\t \t \t\t\t \t \t\t\t\t \t \t", "def I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\n\r\ndef solve():\r\n num = I()\r\n\r\n count = 0\r\n for i in range(6, num + 1):\r\n factors = set()\r\n d = 2\r\n while d*d <= i:\r\n while i % d == 0:\r\n factors.add(d)\r\n i /= d\r\n d += 1\r\n\r\n if i > 1:\r\n factors.add(d)\r\n if len(factors) == 2:\r\n count += 1\r\n print(count)\r\n\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "n=int(input())\r\nl=[0]*(n+1)\r\nfor i in range(2,n+1):\r\n\tif l[i]==0:\r\n\t\tfor j in range(2*i,n+1,i):l[j]+=1\r\nprint(l.count(2))", "n = int(input())\r\nt = [0] * (n + 1) \r\nfor i in range(2, n // 2 + 1):\r\n if t[i] == 0:\r\n for j in range(2 * i, n + 1, i):\r\n t[j] += 1 \r\nprint(t.count(2))", "import math\r\ndef sieveoferat(n):\r\n if n<2:\r\n return []\r\n is_prime=[True]*n\r\n is_prime[0]=False\r\n is_prime[1]=False\r\n\r\n for i in range(2,n):\r\n if is_prime[i]:\r\n for j in range(i*2,n,i):\r\n is_prime[j]=False\r\n return [l for l in range(n) if is_prime[l]]\r\ndef checker(n):\r\n result=sieveoferat(n)\r\n count=0\r\n i=5\r\n while i<n+1:\r\n f=0\r\n for j in result:\r\n if i%j==0:\r\n f+=1\r\n if f==2:\r\n count+=1\r\n else:\r\n count+=0\r\n i+=1\r\n return count\r\nn=int(input())\r\nprint(checker(n))", "t = int(input())\r\nif t<=5:\r\n print(0)\r\nelse:\r\n x = 0\r\n P = []\r\n for i in range(3001):\r\n P.append(0)\r\n for i in range(2,3001):\r\n if P[i] == 0:\r\n for j in range(i * 2, 3001, i):\r\n P[j] += 1\r\n x = 0\r\n for i in range(2, t+1):\r\n if P[i] == 2:\r\n x += 1\r\n print(x)", "n = int(input())\r\namount = 0\r\n\r\n\r\ndef prime(num):\r\n d = 2\r\n primes = []\r\n while d * d <= num:\r\n while num % d == 0:\r\n primes.append(d)\r\n num /= d\r\n d += 1\r\n if num > 1:\r\n primes.append(num)\r\n\r\n return primes\r\n\r\n\r\nfor i in range(1, n+1):\r\n\r\n temp = set(prime(i))\r\n\r\n if len(temp) == 2:\r\n amount += 1\r\n\r\nprint(amount)", "r = int(input())\r\nk = [0]*(r+1)\r\nfor x in range(2, r+1):\r\n\tif k[x]==0:\r\n\t\tfor y in range(2*x, r+1, x):\r\n\t\t\tk[y]+=1\r\nprint(k.count(2))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef is_prime(x):\r\n if x == 1: return False\r\n if x in [2, 3]: return True\r\n for i in range(2, int(x ** 0.5) + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\nres = 0\r\nn = int(input())\r\nprimes = set([x for x in range(2, n + 1) if is_prime(x)])\r\n\r\nfor i in range(2, n + 1):\r\n prime_divisors = 0\r\n for j in range(2, i + 1):\r\n if j in primes and i % j == 0:\r\n prime_divisors += 1\r\n if prime_divisors == 2:\r\n res += 1\r\n\r\nprint(res)\r\n", "#https://codeforces.com/problemset/problem/26/A\nn=int(input())\nd=[0]*(n+1)\nfor i in range(2,n+1):\n\tif d[i]==0:\n\t\tfor j in range(2*i, n+1 , i):\n\t\t\td[j]+=1\nprint(d.count(2))\n\n", "# -*- coding: utf-8 -*-\r\n\r\nprimos,tot = [],0\r\nn = int(input())\r\n\r\nfor i in range(2,int(n/2+1)):\r\n for j in range(2,i):\r\n if i%j == 0: break\r\n else: primos.append(i)\r\n \r\nfor i in range(6,n+1):\r\n cont = 0\r\n for j in primos:\r\n if i%j == 0: cont += 1\r\n if cont > 2: break\r\n if cont == 2: tot += 1\r\n \r\nprint(tot)\r\n\r\n", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(1,n+1):\r\n fat = set()\r\n d = 2\r\n\r\n while d*d <= i:\r\n while i % d == 0:\r\n fat.add(d)\r\n i //=d\r\n d +=1\r\n\r\n if i > 1:\r\n fat.add(i)\r\n\r\n if len(fat) == 2:\r\n count +=1\r\n fat.clear()\r\n\r\nprint(count)\r\n\r\n\r\n", "\r\ndef SieveOfEratosthenes(n): \r\n\tprime = [True for i in range(n+1)] \r\n\tp,l = 2,[]\r\n\twhile (p * p <= n): \r\n\t\tif (prime[p] == True): \r\n\t\t\tfor i in range(p * 2, n+1, p): \r\n\t\t\t\tprime[i] = False\r\n\t\tp += 1\r\n\tfor p in range(2, n): \r\n\t\tif prime[p]: \r\n\t\t\tl.append(p)\r\n\treturn l\t\t\r\nif __name__=='__main__': \r\n\tn=int(input())\r\n\tl=SieveOfEratosthenes(n)\r\n\tc,f=0,0\r\n\tfor i in range(6,n+1):\r\n\t c=0\r\n\t for j in l:\r\n\t if i%j==0:\r\n\t c+=1\r\n\t if c==2:\r\n\t f+=1\r\n\tprint(f) \r\n\t", "import math\r\ndef prime_sieve(n):\r\n\tprime=[[] for i in range(n+1)]\r\n\troot = int(math.sqrt(n))\r\n\tfor i in range(2,n//2+1):\r\n\t\tif len(prime[i])==0:\r\n\t\t\tfor j in range(2*i,n+1,i):\r\n\t\t\t\tprime[j].append(i)\r\n\treturn prime\r\nn=int(input())\r\nprime = prime_sieve(n)\r\n# print(prime)\r\nc=0\r\nfor i in range(2,n+1):\r\n\tif len(prime[i])==2:\r\n\t\tc+=1\r\nprint(c)", "import math\na = int(input())\ncount = 0\nfor x in range(1, a + 1):\n l1 = []\n l2 = []\n while x % 2 == 0:\n l1.append(2)\n x = x / 2\n for i in range(3, int(math.sqrt(x)) + 1, 2):\n while x % i == 0:\n l1.append(i)\n x = x / i\n if x > 2:\n l1.append(int(x))\n for y in l1:\n if y not in l2:\n l2.append(y)\n if len(l2) == 2:\n count += 1\nprint(count)\n \t \t\t \t \t\t\t \t\t \t\t \t\t \t", "n = int(input())\r\n\r\ncount = 0\r\nprimes = []\r\n\r\ndef isPrime(x):\r\n d = 2\r\n while d * d <= x:\r\n if x % d==0:\r\n return False\r\n d +=1\r\n return True\r\n\r\n\r\nfor i in range(2, 3000):\r\n if isPrime(i):\r\n primes.append(i)\r\n\r\n\r\nfor i in range(1, n+1):\r\n c = 0\r\n for prime in primes:\r\n if prime < i and i % prime == 0:\r\n c += 1\r\n if c == 2:\r\n count += 1\r\nprint(count)", "from math import sqrt\r\n\r\n\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n for i in range(2, int(sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef is_almost_prime(n):\r\n s = set()\r\n for i in range(2, int(sqrt(n)) + 1):\r\n if n % i == 0:\r\n if is_prime(i):\r\n s.add(i)\r\n if is_prime(n // i):\r\n s.add(n // i)\r\n if len(s) == 2:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(6, n + 1):\r\n if is_almost_prime(i):\r\n ans += 1\r\nprint(ans)", "ub = 3 * int(1e3)\r\nsieve = [True] * (ub + 1)\r\nsieve[0] = sieve[1] = False\r\nfor i in range(2, int(ub ** 0.5) + 1):\r\n if sieve[i]:\r\n for j in range(i * i, ub + 1, i):\r\n sieve[j] = False\r\n\r\nn = int(input())\r\nres = 0\r\nfor i in range(2, n + 1):\r\n cnt = 0\r\n if not sieve[i]:\r\n for j in range(2, int(i ** 0.5) + 1):\r\n if i % j == 0:\r\n if j != i // j:\r\n if sieve[j]:\r\n cnt += 1\r\n if sieve[i // j]:\r\n cnt += 1\r\n if cnt == 2:\r\n res += 1\r\nprint(res)\r\n\r\n", "import math\r\n\r\ndef PrimeFactors(n):\r\n x=[]\r\n while n%2==0:\r\n x.append(2)\r\n n=n/2\r\n for i in range(3,int(math.sqrt(n)+1),2):\r\n while n%i==0:\r\n x.append(i)\r\n n=n/i\r\n if n>2:\r\n x.append(n)\r\n return x\r\na=int(input(\"\"))\r\ncount=0\r\nfor i in range(a):\r\n y=set(PrimeFactors(i+1))\r\n if len(y)==2:\r\n count+=1\r\nprint(count)", "\nn = int(input())\nlist1, list2 , list3 = set(), set(), []\ncount, count2 = 0,0\nfor i in range(1,n+1):\n for z in range(1, i+ 1):\n if i%z == 0:\n count += 1\n list2.add(z)\n if count == 2:\n list1.add(i)\n count = 0\n for each in list2:\n if each in list1:\n count2 += 1\n if count2 ==2:\n list3.append(i)\n count2 = 0\n list2 = set()\nprint(len(list3))\n \t \t\t \t \t\t \t \t \t \t\t \t\t\t", "def isPrime(n):\r\n\tif n < 2:\r\n\t\treturn False\r\n\ti = 2\r\n\twhile i * i <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn False\r\n\t\ti += 1\r\n\treturn True\r\n\r\n\r\ndef findDivisors(num):\r\n\ti = 1\r\n\tdivisors = set()\r\n\twhile i * i <= num:\r\n\t\tif num % i == 0:\r\n\t\t\tdivisors.add(i)\r\n\t\t\tdivisors.add(num // i)\r\n\t\ti += 1\r\n\treturn divisors\r\n\r\nn = int(input())\r\nalmostPrime = 0\r\n\r\nfor num in range(1, n+1):\r\n\tdivisors = list(findDivisors(num))\r\n\tcount = 0\r\n\r\n\tfor i in range(len(divisors)):\r\n\t\tif count > 2:\r\n\t\t\tbreak\r\n\t\tif isPrime(divisors[i]):\r\n\t\t\tcount += 1\r\n\telse:\r\n\t\tif count == 2:\r\n\t\t\talmostPrime += 1\r\n\t\t\t\r\nprint(almostPrime)\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\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\nn=int(input())\r\ncount=0\r\nfor m in range(2,n+1):\r\n factorList=[]\r\n for i in range(1,m+1):\r\n if m%i==0:\r\n factorList.append(i)\r\n # print(factorList)\r\n\r\n primeFactorList=[]\r\n for f in factorList:\r\n if is_prime(f):\r\n primeFactorList.append(f)\r\n # print(primeFactorList)\r\n if len(primeFactorList)==2:\r\n count+=1\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "def is_almost_prime(number):\r\n prime_factors = set()\r\n i = 2\r\n while i * i <= number:\r\n while number % i == 0:\r\n prime_factors.add(i)\r\n number //= i\r\n i += 1\r\n if number > 1:\r\n prime_factors.add(number)\r\n return len(prime_factors) == 2\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if is_almost_prime(i):\r\n count += 1\r\nprint(count)\r\n", "import math\r\ndef isPrime(num):\r\n if(num >= 2 and math.sqrt(num)%1 != 0):\r\n for i in range(2,num):\r\n if(num%i == 0):\r\n return False\r\n return True\r\n else:\r\n return False\r\nnum = 0\r\nPrimes = [2,3]\r\nfound = []\r\nn = int(input())\r\n\r\nfor i in range(4,n+1):\r\n counter = 0\r\n stop = False\r\n if(isPrime(i)):\r\n Primes.append(i)\r\n continue\r\n \r\n for j in range(len(Primes)):\r\n if(i%Primes[j] ==0 ):\r\n counter +=1\r\n if (counter>2):\r\n break\r\n \r\n if(counter<=2):\r\n mxPrime = max(Primes)\r\n for k in range(mxPrime+1,i):\r\n if(isPrime(k)):\r\n Primes.append(k)\r\n if(i%k==0):\r\n counter+=1\r\n if(counter>2):\r\n break\r\n\r\n if(counter==2):\r\n num+=1\r\n\r\nprint(num)\r\n\r\n", "n = int(input())\r\n \r\ncounter = 0\r\n\r\nfor i in range(1, n + 1):\r\n \r\n factorization = set()\r\n d = 2\r\n x = i\r\n\r\n #perform prime factorzation\r\n while len(factorization) <= 2 and (d * d) <= x:\r\n while x % d == 0:\r\n factorization.add(d)\r\n x //= d\r\n\r\n d += 1\r\n\r\n if x > 1:\r\n factorization.add(x)\r\n \r\n #count if we only found 2 prime factors\r\n counter += (len(factorization) == 2)\r\n\r\nprint(counter)", "n=int(input())\r\nlst=[]\r\nfor i in range(2,n+1):\r\n s=0\r\n for j in range(1,i):\r\n if(i%j==0):\r\n s=s+1\r\n if(s==1):\r\n lst.append(i)\r\nlst1=[]\r\nfor i in range(1,n+1):\r\n s=0\r\n for j in lst:\r\n if(i%j==0):\r\n s=s+1\r\n if(s==2):\r\n lst1.append(i)\r\nprint(len(lst1))\r\n \r\n\r\n", "n = int(input())\r\nTotal = 0\r\nfor i in range(1,n+1):\r\n d = 2\r\n indcount = set()\r\n while d*d <= i:\r\n while i%d == 0:\r\n indcount.add(d)\r\n i //= d\r\n d += 1\r\n if i>1:\r\n indcount.add(i)\r\n if len(indcount) == 2:\r\n Total += 1\r\n\r\nprint(Total)\r\n \r\n ", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef inlist():\r\n return(list(map(int,input().split())))\r\n \r\ndef main():\r\n n = int(input())\r\n ans = 0\r\n for i in range(1 , n + 1):\r\n x = 2\r\n cnt = 0\r\n k = i\r\n while (x * x <= k):\r\n if (k % x == 0):\r\n cnt += 1\r\n while (k % x == 0):\r\n k /= x\r\n x += 1\r\n if (k != 1): cnt += 1\r\n if (cnt == 2): ans += 1\r\n sys.stdout.write(str(ans) + \"\\n\")\r\nmain()", "from math import sqrt\r\nN = 100005\r\nprime = [True] * N \r\ndef SieveOfEratosthenes(): \r\n prime[1] = False\r\n for p in range(2, int(sqrt(N))) : \r\n if prime[p] == True :\r\n for i in range(2*p, N, p) :\r\n prime[i] = False\r\ndef almostPrimes(n) :\r\n ans = 0\r\n for i in range(6, n + 1) : \r\n c = 0\r\n for j in range(2, int(sqrt(i)) + 1) :\r\n if i % j == 0 :\r\n if j * j == i :\r\n if prime[j]:\r\n c += 1\r\n else :\r\n if prime[j] :\r\n c += 1\r\n if prime[i // j] :\r\n c += 1 \r\n if c == 2 : \r\n ans += 1\r\n return ans \r\nSieveOfEratosthenes() \r\nn = int(input())\r\nprint(almostPrimes(n)) \r\n", "\r\nnumber = int(input())\r\nfrom collections import Counter\r\ndef findFactorization(num):\r\n factorization = []\r\n d = 2\r\n while d*d <= num :\r\n while num%d == 0:\r\n factorization.append(d)\r\n num //= d\r\n d += 1\r\n if num >1 :\r\n factorization.append(num)\r\n return factorization\r\n\r\nanswer = 0\r\nfor i in range(1,number + 1):\r\n factorCount = findFactorization(i)\r\n dic = Counter(factorCount) \r\n if len(dic) == 2:\r\n answer += 1\r\nprint(answer)", "def isprime(n):\n \"\"\"Returns True if n is prime.\"\"\"\n if n == 2:\n return True\n if n == 3:\n return True\n if n % 2 == 0:\n return False\n if n % 3 == 0:\n return False\n\n i = 5\n w = 2\n\n while i * i <= n:\n if n % i == 0:\n return False\n\n i += w\n w = 6 - w\n\n return True\n\ndef primfacs(n):\n i = 2\n primfac = []\n while i * i <= n:\n while n % i == 0:\n primfac.append(i)\n n = n / i\n i = i + 1\n if n > 1:\n primfac.append(n)\n return primfac\n\ncount = 0\nn = int(input())\n\nfor i in range(1, n + 1):\n multipliers = set(primfacs(i))\n is_two_counter = 0\n\n for multiplier in multipliers:\n if isprime(multiplier):\n is_two_counter += 1\n \n if is_two_counter == 2:\n count += 1\n\nprint(count)", "n = int(input())\r\n\r\n\r\ndef factor_counter(num):\r\n factors = set()\r\n d = 2\r\n\r\n while d * d <= num:\r\n while num % d == 0:\r\n factors.add(d)\r\n num //= d\r\n d += 1\r\n\r\n if num > 1:\r\n factors.add(num)\r\n\r\n return factors\r\n\r\n\r\nalmost_primes = 0\r\n\r\nfor num in range(6, n + 1):\r\n count = 0\r\n factors = factor_counter(num)\r\n\r\n if len(factors) == 2:\r\n almost_primes += 1\r\n\r\nprint(almost_primes)\r\n", "def factor(num):\r\n store = set()\r\n value = 2\r\n temp = num\r\n\r\n while value * value <= num:\r\n \r\n while num % value == 0:\r\n store.add(value)\r\n num = num // value\r\n\r\n\r\n \r\n\r\n if len(store) > 2:\r\n return False\r\n\r\n value += 1\r\n\r\n if num > 1:\r\n store.add(num)\r\n\r\n\r\n return len(store) == 2\r\n\r\nnum = int(input())\r\nif num < 6:\r\n print(0)\r\n\r\nelse:\r\n count = 0\r\n for i in range(6, num + 1):\r\n if factor(i):\r\n count += 1\r\n\r\n\r\n print(count)", "num = int(input())\r\nprimes = [i for i in range(2,num//2+1)]\r\nvisited = set()\r\nres = [0 for i in range(num+1)]\r\n\r\nfor i in primes:\r\n \r\n if i in visited:\r\n continue\r\n x = 1\r\n \r\n while i * x <= num:\r\n res[i*x] += 1\r\n x += 1\r\n visited.add(i*x)\r\n \r\nprint(res.count(2))\r\n ", "n = int(input())\r\ndef getPrimeFactors(x):\r\n\r\n i = 2\r\n ret = []\r\n while i * i <= x:\r\n while x % i == 0:\r\n ret.append(i)\r\n x = x // i\r\n i = i + 1\r\n if x > 1:\r\n ret.append(x)\r\n distinctFactors = set(ret)\r\n lenSet = len(distinctFactors)\r\n \r\n return lenSet\r\n\r\ncount = 0\r\nfor i in range(n + 1):\r\n w = getPrimeFactors(i)\r\n if w == 2:\r\n count += 1\r\nprint(count)\r\n", "pst=[]\r\nfor x in range(1,1500):\r\n k=0\r\n for i in range(1,x+1):\r\n if x%i==0:\r\n k+=1\r\n if k==2:\r\n pst.append(x)\r\n\r\na=int(input())\r\nk=0\r\nfor x in range(1,a+1):\r\n m=[]\r\n for e in pst:\r\n if x%e==0:\r\n x=x//e\r\n m.append(e)\r\n if len(m)==2:\r\n k+=1\r\nprint(k)", "\r\nx=3001 \r\np=2 \r\nprime=[True]*x \r\nprime[0]=prime[1]=False\r\np=2\r\n\r\nwhile p<x:\r\n if prime[p]:\r\n for i in range(p*p,x,p):\r\n prime[i]=False \r\n p+=1 \r\nn=int(input())\r\nans=0\r\nfor i in range(1,n+1):\r\n c=0\r\n for j in range(2,i):\r\n if i%j==0 and prime[j]==True:\r\n c+=1 \r\n if c==2:\r\n ans+=1\r\n \r\nprint(ans) ", "def fun1(inp):\n orig_inp = inp\n f = 2\n prime_dict = {}\n while f < orig_inp:\n while inp % f == 0:\n inp /= f\n if f not in prime_dict:\n prime_dict[f] = 1\n else:\n prime_dict[f] += 1\n if inp == 1:\n break\n elif f == 2:\n f += 1\n else:\n f += 2\n # if len(prime_dict) ==\n return len(prime_dict)\nt = input()\ntotal = 0\nfor n in range(int(t) + 1):\n num_primes = fun1(n)\n if num_primes == 2:\n total += 1\nprint(total)", "n = int(input())\r\na = [i for i in range(0,n+2)]\r\nfor i in range(2, int(n**0.5)+2):\r\n for j in range(i*i,n+2,i):\r\n a[j] = 0\r\na = [i for i in a if i != 0 and i != 1]\r\ncounter = 0\r\nfor i in range(6,n+1):\r\n number = i\r\n lcounter = 0\r\n for j in a:\r\n if number % j == 0 and number >= j:\r\n number //= j\r\n lcounter += 1\r\n if lcounter == 2:\r\n counter += 1\r\nprint(counter)", "n = int(input())\r\n\r\ndef fac(num):\r\n factor = 2\r\n pr_divs = []\r\n while factor < num*num:\r\n if num % factor == 0:\r\n num //= factor\r\n pr_divs.append(factor)\r\n else:\r\n factor += 1\r\n return pr_divs\r\n\r\nres = 0\r\nfor i in range(n+1):\r\n if len(set(fac(i))) == 2:\r\n res += 1\r\n \r\nprint(res)", "def SOE(num):\r\n isPrime = [True] * (num+1)\r\n for p in range(2, num):\r\n if isPrime[p]:\r\n for i in range(p*p, num+1, p):\r\n isPrime[i] = False\r\n isPrime[0] = isPrime[1] = False\r\n pf = [i for i, x in enumerate(isPrime) if x]\r\n return pf\r\n\r\ndef almost_pf(num):\r\n pf = SOE(n)\r\n a=[]\r\n for i in pf:\r\n if not num%i:\r\n a.append(i)\r\n return len(a) == 2\r\n\r\nn = int(input())\r\nct=0\r\nfor i in range(1,n+1):\r\n if almost_pf(i):\r\n ct+=1\r\nprint(ct)\r\n", "# author: birsnot - Nardos Wehabe\r\n\r\nfrom sys import stdin\r\n# def input(): return stdin.readline()[:-1]\r\ninput = stdin.readline\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\ndef nxt(n):\r\n d = 2\r\n while d*d <= n:\r\n if n%d:\r\n d += 1\r\n else:\r\n while n%d == 0:\r\n n //= d\r\n return n\r\n return 1\r\n\r\ndef solve():\r\n N = I()\r\n ans = 0\r\n for n in range(6, N+1):\r\n m = nxt(n)\r\n if m != 1:\r\n m = nxt(m)\r\n if m == 1:\r\n ans += 1\r\n print(ans)\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "def almost_prime(x: int) -> set:\r\n d=2\r\n factorization = set()\r\n \r\n while d*d<=x:\r\n while x%d==0:\r\n factorization.add(d)\r\n x//=d\r\n d+=1\r\n \r\n if x > 1:\r\n factorization.add(x)\r\n \r\n return factorization\r\n \r\nn = int(input())\r\noutput = 0\r\n\r\nfor i in range(1, n+1):\r\n \r\n prime_factors = almost_prime(i)\r\n if len(prime_factors)==2:\r\n output+=1\r\n\r\nprint(output)", "n = int(input())\n\nlista = list(range(n+1))\nfor i in lista:\n if(i==0 or i==1):\n continue\n for j in range(i, int(n/i+1)):\n lista[i*j] = 0\nprimos=[]\nfor i in lista:\n if(i!=0 and i!=1): \n primos.append(i)\n\ncount=0\nfor i in range(1,n+1):\n c = 0\n for primo in primos:\n if(i==primo):\n break\n if(i%primo==0):\n c+=1\n if(c==2):\n count+=1\n\nprint(count)\n \t\t \t\t\t\t\t\t \t \t \t \t \t \t\t\t\t", "p = [True]*3001\r\np[0] = p[1] = False\r\nfor i in range(2,56):\r\n if p[i]:\r\n x = 2\r\n while x*i <= 3000:\r\n p[x*i] = False\r\n x += 1\r\npn = [i for i in range(len(p)) if p[i]]\r\nn = int(input())\r\nc = 0\r\nfor i in range(1, n+1):\r\n j, x = 0, i\r\n t = 0\r\n while x != 1 and j < len(pn):\r\n if x % pn[j] == 0:\r\n while x % pn[j] == 0:\r\n x = x // pn[j]\r\n t += 1\r\n else: j += 1\r\n if t == 2: c += 1\r\nprint(c)\r\n", "N = int(input())\r\nalmostPrime =0\r\nfor num in range(1,N+1):\r\n \r\n d = 2\r\n curr_num = num\r\n \r\n factors = set()\r\n while d*d <= num:\r\n while curr_num%d == 0:\r\n factors.add(d)\r\n curr_num//=d\r\n\r\n d +=1\r\n if curr_num > 1:\r\n factors.add(curr_num)\r\n if len(factors) == 2:\r\n almostPrime +=1\r\n \r\nprint(almostPrime)\r\n \r\n \r\n \r\n ", "n = int(input())\nl = [0] * (n + 1)\nfor c in range(2, n + 1):\n if l[c] == 0:\n for j in range(c, n + 1, c):\n l[j] += 1\nprint(l.count(2)) \n \t \t\t\t\t\t\t\t \t\t \t \t\t\t\t \t", "__author__ = 'zihaozhu'\nfrom sys import stdin\nimport math\nnumber1 = int(stdin.readline())\nnumPrime=0\nfor number in range (1,number1+1):\n answer = set ()\n i=2\n while i*i < number:\n #print(i)\n #print(number)\n while(number % i == 0):\n answer.add(i)\n number/=i\n # print(i)\n i+=1\n if(number>1):\n answer.add(number)\n if(len(answer)==2):\n #print(\"Here\")\n numPrime+=1\nprint(numPrime)\n", "n = int(input())\r\ncount = 0\r\n\r\ndef primes(n):\r\n factors = set()\r\n d = 2\r\n\r\n while d*d <= n:\r\n while n%d == 0:\r\n factors.add(d)\r\n n//=d\r\n d+=1\r\n if n>1:\r\n factors.add(n)\r\n return factors\r\n\r\nfor i in range(1, n+1):\r\n if len(primes(i)) == 2:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "n = int(input())\r\noutput = 0\r\n\r\nfor i in range(6, n + 1):\r\n factor = 0\r\n f = 2\r\n\r\n while f * f <= i:\r\n if i % f == 0 :\r\n factor += 1\r\n\r\n while i % f == 0:\r\n i = i // f\r\n \r\n f += 1\r\n \r\n if i > 1: \r\n factor += 1\r\n \r\n if factor == 2:\r\n output += 1\r\n\r\nprint(output)", "n = int(input())\r\nnums = 0\r\nfor i in range(2,n + 1):\r\n factors = set()\r\n d = 2\r\n while d * d <= i:\r\n while i % d == 0:\r\n factors.add(d)\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n factors.add(i)\r\n if len(factors) == 2:\r\n nums += 1\r\nprint(nums)", "i = int(input())\r\nj = 0\r\nfor n in range(1, i + 1):\r\n temp = n\r\n count, d = 0, 2\r\n while d * d <= n:\r\n check = False\r\n while n % d == 0:\r\n n //= d\r\n check = True\r\n if check:\r\n count += 1\r\n d += 1\r\n if n > 1:\r\n count += 1\r\n if count == 2:\r\n j += 1\r\nprint(j)", "from math import sqrt\r\ndef isPrime(n):\r\n\tfor i in range(2,int(sqrt(n))+1):\r\n\t\tif n%i==0:\r\n\t\t\treturn False\r\n\treturn True\r\nn=int(input())\r\nc=0\r\nfor i in range(6,n+1):\r\n\tl=set()\r\n\tfor x in range(2,i//2+1):\r\n\t\tif i%x==0 and isPrime(x):\r\n\t\t\tl.add(x)\r\n\tif len(l)==2:\r\n\t\tc+=1\r\n\t\t# print(i,l)\r\nprint(c)", "isp = lambda n: n > 1 and all(n%k for k in range(2,int(n**.5)+1))\r\n\r\nprimes = [n for n in range(3000) if isp(n)]\r\nyay = []\r\nfor p in primes:\r\n n = p\r\n while n <= 3000:\r\n yay.append((p,n))\r\n n *= p\r\n\r\ncnt = 0\r\nn = int(input())\r\nfor i,y in enumerate(yay):\r\n for x in yay[:i]:\r\n p1, n1 = x\r\n p2, n2 = y\r\n if p1 != p2 and n1*n2 <= n: cnt += 1\r\nprint(cnt)", "n = int(input())\r\nl = []\r\nfor j in range(2, n+1):\r\n for i in range(2, j):\r\n if(j*j%i) == 0 or j ==1 :\r\n break\r\n else:\r\n l.append(j)\r\n\r\nct = 0\r\nfor i in range(6, n+1):\r\n c = 0\r\n for j in range(0, len(l)):\r\n if (i % l[j] == 0):\r\n c += 1\r\n if c == 2:\r\n ct += 1\r\n\r\nprint(ct)\r\n\r\n\r\n", "prime = [True for i in range(4002)]\r\nans = []\r\np = 2\r\nwhile p*p<=4000:\r\n if prime[p]==True:\r\n for i in range(p*p,4000,p):\r\n prime[i] = False\r\n p+=1\r\nfor i in range(2,4000):\r\n if i>3000:\r\n break\r\n if prime[i]==True:\r\n ans.append(i)\r\n\r\nn = int(input())\r\nprime = []\r\nfor i in range(len(ans)):\r\n for j in range(i+1,len(ans)):\r\n x = ans[i]*ans[j]\r\n if x<=3000:\r\n prime.append((ans[i],ans[j]))\r\ncnt = 0\r\nfor i in range(1,n+1):\r\n for j in prime:\r\n num = i\r\n x,y = j\r\n if num%x==0 and num%y==0:\r\n while True:\r\n if num%x!=0:\r\n break\r\n num = num//x\r\n while True:\r\n if num%y!=0:\r\n break\r\n num = num//y\r\n if num>1:\r\n pass\r\n else:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\ncount = 0\r\nfor i in range(2, n + 1):\r\n no_prime = set()\r\n d = 2\r\n temp = i\r\n while d <= temp:\r\n if len(no_prime) > 2:\r\n break\r\n while i % d == 0:\r\n no_prime.add(d)\r\n i //= d\r\n d += 1\r\n \r\n if len(no_prime) == 2:\r\n count += 1\r\nprint(count)", "num = int(input())\r\ncount = 0\r\n\r\nfor i in range(1,num +1):\r\n d = 2\r\n Set = set()\r\n \r\n while d * d <= i:\r\n \r\n while i % d == 0:\r\n Set.add(d)\r\n i //= d\r\n \r\n \r\n d +=1\r\n \r\n \r\n if i > 1:\r\n Set.add(i)\r\n if len(Set) == 2 :\r\n count +=1\r\n \r\nprint(count)\r\n \r\n \r\n \r\n ", "from math import sqrt\nfrom collections import Counter\nn = int(input())\ndef prime(x):\n for i in range(2,int(sqrt(x))+1):\n if x % i == 0:\n return 0\n else:\n return 1\nd = Counter()\nfor i in range(2,3001):\n if prime(i):\n d[i] = 1\ns = 0\np = []\nkol = 0\nfor i in range(6,n + 1):\n kol = 0\n p = []\n for j in range(2,n // 2 + 1):\n # print(j)\n if i % j == 0 and d[j] == 1:\n kol += 1\n p += [[i,j]]\n # print(kol,p)\n if kol == 2:\n s += 1\nprint(s)\n", "def primeFacSet(num):\r\n disPrimes = set()\r\n\r\n d = 2\r\n while d<=num:\r\n while num%d==0:\r\n disPrimes.add(d)\r\n num //= d\r\n d += 1\r\n\r\n return len(disPrimes)\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if primeFacSet(i)==2:\r\n count+=1\r\n\r\nprint(count)\r\n\r\n", "def prime(n):\r\n is_prime=[True]*(n+1)\r\n is_prime[0]=is_prime[1]=False\r\n p=2\r\n while(p*p<=n):\r\n if(is_prime[p]):\r\n j=p*p\r\n while(j<=n):\r\n is_prime[j]=False\r\n j+=p\r\n p+=1\r\n l=[]\r\n for i in range(2,n+1):\r\n if(is_prime[i]):\r\n l.append(i)\r\n return l\r\n\r\nn=int(input())\r\nl=prime(n)\r\nans=0\r\nfor i in range(2,n+1):\r\n fac=0\r\n flag=1\r\n for j in range(2,i+1):\r\n if(i%j==0 and j in l):\r\n fac+=1\r\n if fac>2:\r\n flag=0\r\n break\r\n if flag==1 and fac==2:\r\n ans+=1\r\nprint(ans)", "import math\ndef main():\n n = int(input())\n cap = [0] * (n + 1)\n for i in range(2, n + 1):\n if cap[i] == 0:\n now = i\n while now <= n:\n cap[now]+=1\n now += i\n\n cnt = 0\n for i in cap:\n if i == 2: cnt+=1\n\n print(cnt)\n\n\nmain()", "N = int(input())\r\nL = [0]*(N+1)\r\nfor i in range (2, N+1):\r\n if L[i] == 0:\r\n for j in range (2*i, N+1, i):\r\n L[j] += 1\r\nprint(L.count(2))", "\r\ndef almostPrime(n):\r\n count = 0\r\n d = 2\r\n while d * d <= n:\r\n if n % d == 0:\r\n count += 1\r\n while n % d == 0:\r\n n //= d\r\n if count > 2:\r\n return False\r\n d += 1\r\n if n > 1:\r\n count += 1\r\n return count == 2\r\n\r\nnum = int(input())\r\ncount = 0\r\n\r\nfor n in range(6, num + 1):\r\n if almostPrime(n):\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\nprime=[0]*(n+1)\r\nprime[0],prime[1]=0,0\r\ni=2\r\nwhile(i<=n):\r\n if prime[i]==0:\r\n j=2\r\n while(j<=(n)/i):\r\n prime[i*j]+=1\r\n j+=1\r\n i+=1\r\ncount=0\r\nfor i in prime:\r\n\tif i ==2:\r\n\t\tcount+=1\r\nprint(count)", "#ALmost prime\r\ndef prime(a):\r\n for i in range(2,int(a**.5)+1):\r\n if a%i==0:\r\n return False\r\n return True\r\ndef divisor(j):\r\n\tcount = 0\r\n\tfor i in range(2,j):\r\n\t\tif j%i==0 and i!=1:\r\n\t\t\tif (prime(i)==True):\r\n\t\t\t\tcount += 1\r\n\t\t\t\tj //= i\r\n\treturn count\r\nj_1 = int(input())\r\ncount = 0\r\nfor x in range(1,j_1+1):\r\n\tif divisor(x) == 2:\r\n\t\tcount += 1\r\n\telse:\r\n\t\tcount += 0\r\nprint(count)", "n=int(input())\r\na=0\r\ndef ifprime(q):\r\n m=0\r\n for i in range(2,q):\r\n if q%i==0:\r\n m=1\r\n if m==0:\r\n h=1\r\n else:\r\n h=2\r\n return h\r\n \r\nfor p in range (5,n+1):\r\n t=0;\r\n for k in range(2,p):\r\n if (p%k==0 and ifprime(k)==1):\r\n t=t+1 \r\n if t==2:\r\n a=a+1\r\nprint(a)\r\n ", "pr = []\ncp = []\nnumEnter = int(input())\ncont = 0\n\n\ndef primos(n):\n if n < 2:\n return False\n for i in range(2, n):\n if n % i == 0:\n return False\n return True\n\ndef addpri(numEnter):\n for rec in range(1, numEnter+1):\n if primos(rec):\n pr.append(rec)\n return pr\n\ndef casiprimos():\n for r in range(2,numEnter+1):\n repite = 0\n for n in pr:\n if r % n == 0:\n repite += 1\n if(repite == 2):\n cp.append(r)\n \n print(len(cp) )\n \n\naddpri(numEnter)\ncasiprimos()\n\n \t \t \t\t \t \t\t \t \t \t \t \t\t", "def is_prime(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\n\r\ndef almost_prime(n):\r\n count = 0\r\n for i in range(2, n+1):\r\n divisors = set()\r\n for j in range(2, i):\r\n if i % j == 0 and is_prime(j):\r\n divisors.add(j)\r\n if len(divisors) == 2:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nprint(almost_prime(n))\r\n", "n = int(input())\nsimple = [2]\nisSimple = True\n\nif (n > 0) and (n < 5):\n print(0)\n\nelse:\n for i in range(3, n):\n isSimple = True\n for j in range(2, i-1):\n if i % j == 0:\n isSimple = False\n break\n if isSimple:\n simple.append(i)\n\n count = 0\n kol_vo_simple_del = 0\n\n for i in range(6, n+1):\n kol_vo_simple_del = 0\n for el in simple:\n if el > i:\n break\n if i % el == 0:\n kol_vo_simple_del += 1\n if kol_vo_simple_del > 2:\n break\n if kol_vo_simple_del == 2:\n count += 1\n\n print(count)\n", "def pr(n):\n i = 2\n while i ** 2 <= n:\n if n % i == 0:\n return False\n i += 1\n return True\ndef npr(n):\n return sum(1 for i in range(2, n // 2 + 1) if n % i == 0 and pr(i))\nprint(sum(1 for i in range(1, int(input()) + 1) if npr(i) == 2))\n", "fact=[0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 2, 2, 1, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 2, 3, 1, 2, 1, 2, 1, 3, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 3, 2, 1, 2, 1, 3, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 1, 1, 2, 3, 1, 3, 2, 2, 2, 2, 1, 3, 1, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 2, 2, 2, 1, 2, 3, 2, 1, 3, 1, 3, 2, 2, 1, 3, 2, 2, 2, 2, 1, 3, 1, 3, 2, 2, 2, 3, 2, 2, 2, 3, 1, 2, 1, 2, 3, 2, 1, 3, 1, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 4, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 1, 2, 2, 2, 1, 3, 1, 3, 3, 2, 1, 3, 2, 2, 2, 3, 1, 3, 1, 2, 1, 2, 2, 3, 2, 2, 2, 2, 1, 3, 2, 2, 3, 1, 1, 3, 2, 3, 2, 2, 1, 3, 2, 3, 2, 2, 1, 3, 1, 2, 3, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 3, 3, 2, 2, 1, 3, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1, 2, 3, 2, 1, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 4, 1, 2, 2, 2, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 3, 2, 1, 3, 1, 3, 2, 2, 1, 3, 2, 2, 3, 2, 1, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 3, 2, 2, 2, 3, 1, 3, 2, 2, 1, 2, 3, 2, 2, 2, 1, 4, 2, 2, 2, 2, 2, 3, 1, 2, 3, 2, 1, 3, 2, 2, 2, 3, 2, 3, 1, 3, 2, 2, 2, 3, 2, 2, 2, 3, 1, 4, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 1, 2, 1, 3, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 3, 3, 1, 2, 2, 3, 1, 4, 1, 2, 3, 2, 1, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 1, 3, 2, 2, 3, 2, 2, 2, 1, 2, 2, 3, 1, 3, 2, 3, 3, 2, 2, 3, 1, 2, 2, 2, 1, 3, 2, 3, 2, 2, 1, 4, 2, 1, 2, 2, 2, 3, 2, 3, 2, 3, 1, 3, 1, 2, 3, 2, 2, 3, 1, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 4, 1, 2, 2, 3, 2, 3, 2, 2, 3, 2, 1, 3, 2, 3, 3, 2, 1, 3, 2, 2, 2, 2, 1, 4, 1, 3, 2, 3, 2, 2, 1, 2, 2, 3, 2, 3, 2, 2, 3, 2, 1, 3, 2, 3, 2, 2, 1, 3, 3, 2, 2, 3, 1, 3, 1, 3, 2, 2, 2, 3, 1, 2, 3, 3, 2, 3, 1, 2, 3, 3, 1, 3, 1, 3, 2, 2, 2, 3, 1, 2, 3, 2, 2, 4, 1, 2, 2, 2, 2, 3, 2, 3, 2, 2, 1, 3, 1, 3, 3, 3, 1, 2, 2, 3, 3, 2, 1, 3, 2, 2, 2, 3, 1, 4, 1, 2, 3, 2, 3, 3, 2, 2, 2, 3, 2, 3, 1, 2, 2, 2, 1, 3, 2, 3, 2, 3, 1, 3, 2, 2, 2, 2, 2, 4, 1, 2, 3, 2, 2, 3, 2, 2, 2, 3, 1, 3, 2, 2, 3, 2, 2, 3, 1, 3, 2, 2, 2, 4, 3, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 1, 3, 1, 3, 2, 3, 1, 2, 3, 2, 2, 3, 1, 3, 3, 3, 1, 3, 2, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 3, 3, 1, 3, 2, 2, 3, 2, 2, 2, 1, 4, 2, 2, 1, 3, 2, 2, 3, 2, 2, 4, 2, 3, 2, 2, 2, 3, 1, 2, 2, 3, 2, 3, 2, 2, 3, 2, 1, 4, 2, 2, 2, 2, 2, 3, 3, 3, 2, 2, 1, 3, 1, 3, 2, 3, 2, 3, 2, 2, 3, 3, 1, 3, 1, 2, 3, 3, 1, 3, 1, 3, 2, 2, 2, 3, 2, 3, 2, 2, 1, 4, 1, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 1, 3, 3, 2, 1, 4, 1, 3, 3, 2, 1, 2, 2, 2, 2, 3, 2, 4, 2, 2, 2, 3, 2, 3, 1, 2, 2, 3, 1, 3, 1, 3, 3, 2, 1, 3, 2, 3, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 3, 2, 2, 3, 1, 2, 2, 4, 1, 3, 2, 2, 3, 2, 2, 3, 1, 3, 2, 2, 2, 4, 2, 2, 2, 2, 1, 4, 2, 2, 2, 2, 3, 3, 1, 3, 2, 3, 1, 3, 2, 2, 3, 3, 1, 3, 2, 3, 2, 3, 1, 3, 2, 2, 3, 2, 2, 3, 1, 3, 2, 2, 2, 4, 1, 2, 3, 3, 1, 2, 2, 2, 3, 2, 1, 3, 2, 3, 2, 2, 1, 3, 2, 3, 3, 3, 2, 4, 1, 2, 2, 3, 2, 3, 1, 2, 2, 2, 3, 3, 2, 2, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 3, 2, 2, 2, 1, 4, 1, 3, 3, 1, 2, 3, 2, 2, 2, 3, 1, 3, 1, 3, 3, 3, 2, 3, 1, 3, 2, 2, 2, 3, 3, 2, 2, 2, 1, 4, 1, 2, 2, 3, 2, 3, 2, 2, 2, 3, 1, 3, 1, 3, 3, 3, 2, 3, 1, 3, 3, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 3, 3, 1, 2, 2, 3, 1, 4, 1, 2, 3, 2, 1, 3, 2, 3, 2, 3, 1, 3, 3, 3, 2, 2, 1, 4, 2, 2, 3, 2, 2, 3, 1, 3, 2, 3, 2, 4, 1, 2, 2, 2, 2, 3, 1, 3, 3, 2, 2, 3, 2, 2, 2, 2, 2, 4, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 1, 2, 1, 2, 4, 2, 2, 3, 2, 3, 2, 3, 1, 3, 2, 3, 2, 2, 2, 4, 1, 2, 3, 2, 2, 3, 2, 3, 2, 3, 1, 3, 2, 2, 3, 2, 1, 3, 2, 4, 2, 2, 1, 3, 2, 3, 3, 2, 2, 3, 1, 2, 2, 3, 2, 3, 2, 2, 3, 3, 2, 3, 1, 2, 2, 2, 1, 4, 2, 3, 3, 3, 1, 3, 2, 2, 2, 2, 1, 4, 1, 3, 2, 2, 3, 3, 1, 2, 3, 3, 2, 3, 2, 2, 3, 3, 2, 3, 1, 2, 2, 2, 2, 4, 2, 2, 2, 3, 1, 4, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 3, 2, 3, 3, 3, 1, 3, 1, 2, 3, 2, 1, 3, 2, 2, 3, 3, 1, 4, 1, 3, 2, 2, 3, 2, 1, 3, 2, 3, 1, 4, 1, 2, 3, 2, 1, 3, 3, 3, 3, 2, 2, 3, 2, 3, 2, 2, 1, 4, 1, 2, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 3, 1, 3, 2, 3, 4, 2, 1, 3, 1, 3, 2, 2, 1, 3, 2, 2, 2, 3, 2, 4, 1, 2, 2, 2, 2, 4, 2, 2, 2, 3, 2, 3, 2, 3, 3, 2, 2, 3, 1, 3, 2, 2, 2, 3, 2, 3, 3, 2, 1, 4, 2, 2, 2, 3, 2, 3, 2, 2, 3, 3, 2, 3, 1, 2, 3, 3, 1, 4, 1, 4, 2, 2, 1, 3, 3, 2, 2, 2, 1, 3, 2, 3, 3, 2, 2, 3, 1, 2, 3, 3, 1, 3, 1, 2, 3, 3, 2, 2, 1, 3, 2, 3, 3, 3, 2, 2, 2, 2, 2, 4, 1, 2, 2, 3, 2, 3, 2, 2, 3, 3, 1, 4, 1, 3, 3, 2, 1, 3, 1, 3, 3, 2, 1, 3, 3, 3, 2, 3, 1, 3, 2, 2, 2, 2, 3, 3, 2, 3, 2, 3, 1, 3, 2, 2, 3, 2, 2, 4, 2, 3, 2, 2, 1, 3, 2, 3, 2, 2, 2, 4, 1, 2, 3, 3, 2, 2, 2, 2, 2, 4, 2, 3, 1, 2, 3, 2, 3, 3, 1, 3, 3, 2, 1, 4, 2, 2, 2, 3, 1, 4, 2, 3, 2, 3, 2, 3, 1, 2, 2, 3, 1, 3, 2, 2, 3, 2, 2, 3, 1, 3, 3, 3, 1, 3, 2, 3, 2, 2, 2, 4, 2, 2, 2, 2, 3, 4, 1, 3, 3, 2, 1, 3, 2, 2, 3, 3, 1, 3, 1, 4, 2, 3, 1, 3, 3, 2, 3, 2, 1, 3, 1, 2, 2, 3, 2, 3, 1, 3, 2, 3, 2, 3, 2, 3, 3, 2, 1, 4, 2, 3, 2, 2, 2, 3, 3, 2, 2, 2, 2, 4, 2, 3, 3, 2, 2, 3, 1, 2, 3, 3, 2, 3, 1, 2, 3, 3, 1, 3, 1, 3, 2, 3, 2, 3, 2, 2, 3, 2, 2, 4, 1, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 3, 1, 3, 3, 2, 1, 3, 1, 3, 2, 3, 2, 3, 3, 2, 2, 3, 1, 4, 2, 2, 2, 2, 2, 4, 2, 2, 2, 3, 1, 4, 1, 2, 3, 2, 2, 2, 3, 3, 2, 2, 1, 3, 2, 3, 2, 3, 2, 4, 1, 3, 3, 2, 2, 3, 1, 3, 3, 3, 2, 3, 1, 2, 3, 2, 2, 3, 1, 3, 2, 2, 2, 3, 2, 2, 3, 3, 2, 4, 3, 2, 2, 2, 2, 3, 1, 3, 2, 3, 2, 3, 1, 2, 4, 3, 1, 3, 1, 3, 2, 2, 2, 4, 2, 2, 2, 3, 2, 3, 1, 3, 2, 3, 2, 4, 2, 2, 2, 3, 1, 3, 2, 2, 3, 2, 2, 3, 2, 4, 2, 2, 1, 3, 2, 3, 3, 2, 2, 4, 1, 2, 3, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 3, 3, 1, 4, 1, 3, 2, 2, 2, 3, 3, 2, 2, 2, 2, 4, 1, 3, 2, 2, 2, 3, 1, 2, 3, 4, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 3, 2, 2, 3, 3, 3, 3, 2, 1, 4, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 1, 3, 2, 3, 3, 2, 1, 3, 2, 3, 3, 2, 1, 4, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 3, 1, 4, 1, 2, 3, 2, 2, 4, 2, 3, 2, 2, 2, 2, 2, 3, 3, 2, 1, 4, 1, 2, 3, 2, 3, 3, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 3, 1, 4, 2, 3, 2, 3, 1, 4, 2, 2, 2, 2, 2, 3, 1, 3, 3, 3, 2, 3, 1, 2, 4, 2, 1, 3, 1, 2, 3, 4, 1, 3, 2, 3, 2, 2, 2, 4, 1, 2, 3, 3, 3, 3, 1, 2, 2, 3, 2, 3, 2, 3, 2, 2, 1, 3, 1, 4, 2, 2, 2, 3, 3, 2, 3, 2, 1, 4, 2, 2, 2, 3, 2, 4, 2, 1, 2, 3, 2, 3, 1, 3, 3, 2, 2, 3, 2, 3, 2, 2, 1, 3, 3, 2, 3, 3, 1, 4, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 1, 3, 1, 2, 3, 3, 1, 3, 1, 4, 3, 2, 3, 3, 2, 2, 2, 2, 1, 4, 2, 2, 2, 2, 2, 3, 2, 3, 3, 3, 1, 3, 1, 3, 3, 2, 2, 3, 2, 3, 3, 2, 2, 3, 2, 2, 2, 3, 1, 4, 1, 3, 2, 3, 3, 3, 1, 2, 3, 3, 1, 4, 1, 2, 4, 3, 2, 3, 2, 3, 2, 2, 1, 3, 2, 3, 2, 3, 2, 3, 1, 3, 3, 2, 2, 3, 2, 2, 2, 4, 2, 3, 2, 2, 3, 2, 2, 3, 1, 3, 2, 2, 2, 4, 3, 2, 1, 2, 2, 4, 2, 2, 3, 2, 2, 3, 1, 3, 2, 3, 2, 3, 1, 3, 3, 2, 1, 3, 1, 4, 3, 3, 1, 3, 2, 2, 2, 2, 2, 4, 1, 3, 3, 2, 2, 4, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 1, 3, 1, 3, 2, 3, 1, 4, 2, 2, 3, 2, 2, 3, 1, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 4, 2, 2, 3, 3, 1, 3, 1, 3, 2, 2, 1, 3, 3, 2, 3, 3, 2, 4, 1, 3, 2, 2, 2, 3, 1, 3, 3, 3, 2, 3, 1, 3, 3, 3, 1, 3, 2, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 5, 1, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 2, 2, 3, 2, 3, 3, 3, 1, 3, 2, 2, 3, 3, 1, 4, 1, 2, 3, 2, 3, 4, 1, 2, 2, 3, 1, 3, 2, 3, 3, 3, 1, 3, 2, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 4, 1, 2, 3, 2, 2, 3, 1, 3, 3, 4, 1, 3, 1, 2, 3, 2, 3, 3, 1, 3, 2, 3, 1, 4, 2, 2, 3, 3, 1, 3, 1, 2, 2, 2, 3, 3, 2, 3, 3, 3, 1, 3, 2, 3, 4, 2, 1, 4, 2, 3, 2, 3, 1, 3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 4, 1, 3, 2, 3, 1, 4, 2, 3, 3, 2, 1, 3, 2, 3, 3, 2, 2, 3, 2, 2, 3, 2, 1, 4, 2, 2, 2, 3, 3, 3, 1, 2, 2, 4, 2, 3, 1, 2, 3, 2, 1, 4, 2, 3, 2, 3, 2, 3, 3, 3, 2, 2, 2, 4, 2, 3, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 1, 2, 3, 3, 2, 4, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 4, 1, 3, 2, 2, 2, 3, 2, 2, 2, 4, 1, 3, 2, 3, 3, 2, 2, 3, 1, 3, 3, 3, 1, 3, 2, 3, 2, 3, 1, 4, 1, 3, 3, 2, 3, 3, 1, 2, 2, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 2, 4, 2, 3, 2, 2, 1, 4, 2, 2, 3, 3, 3, 3, 2, 2, 2, 4, 1, 2, 1, 2, 3, 3, 2, 3, 2, 3, 2, 2, 2, 4, 2, 2, 3, 2, 1, 4, 2, 2, 3, 2, 2, 3, 1, 4, 2, 3, 1, 4, 2, 2, 3, 3, 2, 3, 2, 3, 2, 3, 1, 3, 3, 2, 2, 2, 3, 4, 2, 2, 2, 2, 2, 3, 1, 2, 2, 3, 2, 4, 2, 2, 3, 2, 1, 3, 1, 4, 2, 2, 1, 3, 3, 3, 3, 3, 2, 4, 1, 2, 2, 3, 2, 3, 1, 3, 3, 3, 2, 3, 1, 3, 3, 3, 1, 3, 1, 3, 3, 2, 1, 3, 3, 2, 3, 3, 1, 3, 2, 3, 3, 2, 2, 4, 1, 2, 3, 3, 1, 3, 1, 3, 3, 3, 3, 3, 1, 3, 2, 2, 2, 3, 2, 3, 2, 3, 1, 5, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 1, 3, 2, 2, 3, 2, 2, 3, 1, 3, 3, 2, 1, 3, 3, 3, 2, 3, 2, 4, 2, 2, 2, 2, 3, 3, 1, 2, 3, 3, 2, 4, 2, 3, 3, 2, 1, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1, 4, 1, 2, 3, 3, 3, 3, 1, 2, 2, 3, 1, 3, 1, 2, 4, 3, 2, 3, 1, 3, 2, 3, 2, 4, 2, 2, 2, 2, 1, 4, 3, 3, 2, 2, 2, 3, 2, 3, 3, 3, 2, 3, 1, 3, 3, 2, 1, 4, 2, 3, 2, 3, 1, 3, 2, 2, 3, 2, 3, 4, 1, 3, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 2, 2, 3, 2, 2, 3, 2, 4, 3, 2, 2, 3, 2, 2, 3, 2, 1, 3, 2, 3, 2, 3, 2, 4, 1, 2, 2, 3, 2, 3, 2, 2, 3, 2, 1, 4, 2, 3, 2, 2, 1, 3, 3, 2, 3, 2, 1, 4, 2, 3, 2, 3, 3, 2, 1, 2, 3, 3, 2, 3, 2, 3, 3, 4, 1, 3, 2, 3, 2, 2, 2, 3, 2, 2, 3, 3, 1, 4, 2, 2, 2, 2, 3, 3, 2, 3, 2, 3, 2, 3, 1, 3, 3, 2, 1, 4, 2, 3, 3, 2, 1, 4, 2, 2, 3, 3, 1, 4, 1, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 4, 2, 2, 3, 2, 2, 3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 2, 1, 3]\r\nt=int(input())\r\ncnt=0\r\nfor i in range(t):\r\n if fact[i]==2:\r\n cnt+=1\r\nprint(cnt)", "'''Author- Akshit Monga'''\r\nimport math\r\nans=0\r\ndef primeFactors(n):\r\n global ans\r\n all=set()\r\n while n % 2 == 0: \r\n all.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 all.add(i)\r\n n = n / i\r\n if n > 2: \r\n all.add(n)\r\n if len(all)==2:\r\n ans+=1\r\n \r\nfor i in range(1,int(input())+1):\r\n primeFactors(i)\r\nprint(ans)", "# --- https://codeforces.com/contest/26/problem/A\r\nimport math\r\nans=0\r\ndef divisors(n):\r\n x=int(math.sqrt(n))\r\n i=2\r\n ctr=0\r\n while(i<=x):\r\n if (n%i==0):\r\n ctr=ctr+1\r\n while(n%i==0):\r\n n=n//i\r\n i=i+1\r\n\r\n if(n>1):\r\n ctr=ctr+1\r\n \r\n if ctr==2:\r\n return 1\r\n else:\r\n return 0\r\nN=int(input())\r\nfor n in range(1,N+1):\r\n ans=ans+divisors(n)\r\nprint(ans) ", "import math\r\nprime=[True for i in range(2,3001)]\r\nfor i in range(len(prime)):\r\n if prime[i]:\r\n for j in range((i+2)**2,3001,i+2):\r\n prime[j-2]=False\r\nn=int(input())\r\nif n==1:\r\n print(0)\r\nelse:\r\n tot=0\r\n for i in range(1,n+1):\r\n k=math.floor(math.sqrt(i))\r\n co=0\r\n for j in range(1,k+1):\r\n if i%j==0:\r\n if j**2==i:\r\n if prime[j-2]:\r\n co+=1\r\n else:\r\n if prime[j-2]:\r\n co+=1\r\n if prime[(i//j)-2]:\r\n co+=1\r\n if co==2:\r\n tot+=1\r\n print(tot)\r\n \r\n \r\n \r\n \r\n\r\n", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 12/25/19\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\nMAXN = 3001\nmark = [True for _ in range(MAXN)]\nmark[0] = mark[1] = False\nfor i in range(2, MAXN):\n if mark[i]:\n v = i + i\n while v < MAXN:\n mark[v] = False\n v += i\n\nprimes = [i for i in range(MAXN) if mark[i]]\n\n\ndef check(val):\n factors = 0\n for v in primes:\n if factors > 2:\n break\n if v > val:\n break\n if val % v == 0:\n factors += 1\n while val % v == 0:\n val //= v\n if val > 1:\n factors += 1\n \n return factors == 2\n\nN = int(input())\nprint(sum([1 for i in range(1, N+1) if check(i)]))\n\n", "def solution():\r\n n = int(input())\r\n prime = set()\r\n for i in range(2, n // 2 + 1):\r\n for j in range(2, int(i ** 0.5) + 1):\r\n if i % j == 0:\r\n break\r\n else:\r\n prime.add(i)\r\n\r\n res = 0\r\n for i in range(2, n+1):\r\n cnt = 0\r\n for j in range(1, int(i ** 0.5) + 1):\r\n if i % j == 0:\r\n if j in prime:\r\n cnt += 1\r\n if i // j in prime and i // j != j:\r\n cnt += 1\r\n if cnt > 2:\r\n break\r\n else:\r\n if cnt == 2:\r\n res += 1\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "sieve=[1]*3001\r\nspf=[0]*3001\r\nfor i in range(2,3001):\r\n if(sieve[i]==1):\r\n j=i*i\r\n while(j<=3001):\r\n if(j%i==0):\r\n sieve[j]=0\r\n j=j+i\r\nfor i in range(2,3001):\r\n if(sieve[i]==1):\r\n for j in range(i+1,3001):\r\n if(j%i==0):\r\n spf[j]=spf[j]+1\r\nn=int(input())\r\nsum=0\r\nfor i in range(2,n+1):\r\n if(spf[i]==2):\r\n sum = sum + 1\r\nprint(sum)", "n = int(input())\nsum = 0\ndef prime(n):\n if n != 2:\n for i in range(2, n//2+1):\n if n % i == 0:\n return False\n return True\nfor i in range(n+1):\n d = []\n for j in range(1, i):\n if i % j == 0 and j != 1 :\n if prime(j):\n d += [j]\n if len(d) == 2:\n sum += 1\nprint(sum)\n", "n=int(input())\r\n\r\nprost =[]\r\nfor i in range(2,n+1):\r\n for j in prost:\r\n if i%j==0:\r\n break\r\n else:\r\n prost.append(i)\r\n \r\n\r\n\r\nkol=0\r\ndeli=0\r\n\r\nfor i in range(6,n+1):\r\n for j in range(0,len(prost)):\r\n if i%prost[j]==0:\r\n deli+=1\r\n \r\n if deli==2:\r\n kol+=1\r\n\r\n deli=0 \r\n\r\nprint(kol) \r\n\r\n \r\n", "n = int(input())\r\na = [0] * (n + 1)\r\na[0] = -1\r\na[1] = -1\r\nfor i in range (2, n + 1):\r\n if a[i] == 0 :\r\n for j in range (2 *i, n + 1, i) :\r\n a[j] += 1\r\nans = 0\r\n# print(a)\r\nfor i in range (2, n + 1) :\r\n if a[i] == 2 :\r\n ans += 1\r\nprint(ans)", "from math import *\r\nn=int(input())\r\nd=[]\r\nfor k in range(2,n+1):\r\n l=[]\r\n for i in range(2,k//2+1):\r\n if(k%i==0):\r\n f=0\r\n for j in range(2,int(sqrt(i))+1):\r\n if(i%j==0):\r\n f=1\r\n break\r\n if(f==0):\r\n l.append(i)\r\n if(len(l)==2):\r\n d.append(k)\r\nprint(len(d))\r\n", "n = int(input())\r\nf = [True] * 3001\r\nfor i in range(2,3001):\r\n for j in range(2,3000//i+1):\r\n f[i*j] = False\r\n\r\nres = 0\r\nfor i in range(2,n+1):\r\n t = 0\r\n for j in range(2,i+1):\r\n if f[j] and i % j ==0:\r\n t+=1\r\n if t ==2:\r\n res +=1\r\nprint(res)", "num = int(input())\r\n\r\ndef findPrime(num):\r\n d = 2\r\n factors = []\r\n while d*d <= num:\r\n while num % d == 0:\r\n num //= d\r\n factors.append(d)\r\n d += 1\r\n if num > 1:\r\n factors.append(num)\r\n\r\n if len(set(factors)) == 2:\r\n return 1\r\n else:\r\n return 0\r\n\r\nans = 0\r\nfor n in range(1,num+1):\r\n ans += findPrime(n)\r\n\r\nprint(ans)\r\n\r\n", "def is_prime(n):\r\n\tfor i in range(2,n):\r\n\t\tif n%i==0:return 0\r\n\treturn 1\r\n\r\nn = int(input())\r\nres = 0\r\nfor i in range(6,n+1):\r\n\tcnt = 0\r\n\tfor j in range(2,i):\r\n\t\tif i%j==0:\r\n\t\t\tif is_prime(j):cnt+=1\r\n\t\tif cnt>2:break\r\n\t\r\n\tif cnt==2:res+=1\r\nprint(res)\r\n\t", "def isprimo(x):\r\n for y in range(2, x):\r\n if x % y == 0:\r\n return False\r\n break\r\n return True\r\n\r\ndef intervalo(n):\r\n total_semiprimos = 0\r\n for x in range(n, 5, -1):\r\n if is_semiprimo(x) == 2:\r\n total_semiprimos += 1 \r\n return total_semiprimos\r\n\r\ndef is_semiprimo(x):\r\n total = 0\r\n aux = 2\r\n while x >= aux:\r\n if x % aux == 0 and isprimo(aux):\r\n while x % aux == 0:\r\n x /= aux\r\n total +=1\r\n aux+=1\r\n \r\n return total\r\n\r\ntry:\r\n n = abs(int(input()))\r\n print(intervalo(n))\r\nexcept:\r\n pass\r\n\r\n", "# Bismillah\r\n# In the name of GOD\r\n\r\ndef prime_factors(n):\r\n\ti = 2\r\n\tcount = 0\r\n\twhile n > 1:\r\n\t\tu = n % i == 0\r\n\t\tif u:\r\n\t\t\twhile n > 1:\r\n\t\t\t\tn /= i\r\n\t\t\t\tif n % i > 0:\r\n\t\t\t\t\tbreak\r\n\t\tif i == 3:\r\n\t\t\ti += 2\r\n\t\telse:\r\n\t\t\ti += 1\r\n\t\tif u:\r\n\t\t\tcount += 1\r\n\t\t\tif count > 2:\r\n\t\t\t\treturn False\r\n\treturn count == 2\r\n\r\n\r\ns = 0\r\nfor i in range(6, int(input()) + 1):\r\n\ts += prime_factors(i)\r\nprint(s)\r\n", "def count_prime_factors(n):\r\n count = set()\r\n x = 2\r\n while x * x <= n:\r\n while n % x == 0:\r\n count.add(x)\r\n n //= x\r\n \r\n x += 1\r\n if n > 1:\r\n count.add(n)\r\n return count\r\n\r\nn = int(input())\r\nalmost_prime = 0\r\nfor i in range(n+1):\r\n ans = count_prime_factors(i)\r\n if len(ans) == 2:\r\n almost_prime += 1\r\nprint(almost_prime)", "def Primes(n):\r\n c = 0\r\n prime = [i for i in range(n+1)]\r\n \r\n for i in range(2,int(n**0.5)+1):\r\n if prime[i] == (i):\r\n for j in range(i*i,n+1,i):\r\n if prime[j]==j: \r\n prime[j] = i\r\n a = []\r\n while n!=1:\r\n a.append(prime[n])\r\n n //=prime[n] \r\n return a\r\n\r\nn = int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n if len(set(Primes(i))) ==2:\r\n c+=1\r\nprint(c)", "n = int(input())\nprimes = [2]\nfor i in range(3,n+1):\n for j in range(2,i):\n if i % j == 0:\n break\n else:\n primes.append(i)\ncount = 0\nfor x in range(1,n+1):\n check = 0\n for y in primes:\n if x % y == 0:\n check+=1\n if check == 2:\n count+=1\n\nprint(count)\n", "\r\nfrom math import sqrt\r\n\r\nn = int(input())\r\n\r\nc = 0\r\n\r\nfor i in range(6, n+1):\r\n s = set()\r\n while not i % 2:\r\n s.add(2)\r\n i //= 2\r\n\r\n while not i % 3:\r\n s.add(3)\r\n i //= 3\r\n\r\n for j in range(5, int(sqrt(i)) + 1, 6):\r\n while not i % j:\r\n s.add(j)\r\n i //= j\r\n while i % (j+2) == 0:\r\n s.add(j+2)\r\n i //= (j+2)\r\n\r\n if i > 1: s.add(i)\r\n if len(s) == 2: c += 1\r\nprint(c)\r\n", "v =int(input())\r\ncount = 0\r\n\r\nfor i in range(1,v + 1):\r\n sett = set()\r\n d = 2\r\n n = i\r\n \r\n while d*d <= n:\r\n while n % d == 0:\r\n sett.add(d)\r\n n //= d \r\n d += 1\r\n if n > 1:\r\n sett.add(n)\r\n \r\n if len(sett) == 2:\r\n count += 1\r\n \r\nprint(count)", "def prime(n):\r\n for i in range(2, n):\r\n if n % i == 0:\r\n return False\r\n return True\r\ndef almprime(m):\r\n count = 0\r\n for x in range(2, int(m/2)+1):\r\n if m % x == 0 and prime(x) == True:\r\n count = count + 1\r\n if count > 3:\r\n break;\r\n if count == 2:\r\n return True\r\n else:\r\n return False\r\n \r\n \r\n\r\nN = int(input())\r\nfinal = 0\r\nfor a in range(2, N+1):\r\n if almprime(a) == True:\r\n final = final + 1\r\nprint(final)\r\n \r\n", "def prime_divisors(n):\r\n divisors = set()\r\n d = 2\r\n while d * d <= n:\r\n while (n % d) == 0:\r\n divisors.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n divisors.add(n)\r\n return divisors\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(1, n+1):\r\n divisors = prime_divisors(i)\r\n if len(divisors) == 2:\r\n count += 1\r\nprint(count)\r\n", "def prime(n):\r\n if n==2:\r\n return True\r\n for i in range(2, int(n**0.5)+2):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\ndef almost_prime(n):\r\n # cnt = 0\r\n number_of_almost_prime = 0\r\n\r\n if n==0 or n==1 or n==2 or n==3 or n==4 or n==5:\r\n return 0\r\n \r\n \r\n else:\r\n for i in range(6, n+1):\r\n cnt = 0\r\n for j in range(2,i): #to chk prime no.\r\n\r\n if prime(j):\r\n if i%j==0:\r\n cnt+=1\r\n \r\n if cnt==2:\r\n number_of_almost_prime+=1\r\n # print(i)\r\n \r\n return number_of_almost_prime \r\n \r\nn = int(input())\r\nprint(almost_prime(n))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n", "import math\r\nn=int(input())\r\nans=0\r\nfor i in range(1,n+1):\r\n prime_sieve = [1]*(i+1)\r\n m=math.floor(math.sqrt(len(prime_sieve)))\r\n # print(prime_sieve)\r\n for j in range(2,m+1):\r\n if prime_sieve[j]==1:\r\n for k in range(j**2, i+1, j):\r\n prime_sieve[k]=0\r\n # print(prime_sieve)\r\n cnt=0\r\n k=i\r\n for j in range(2,i+1):\r\n if prime_sieve[j]==1:\r\n if k<j:\r\n break\r\n else:\r\n if (k%j==0):\r\n while k%j==0:\r\n k=k//j\r\n cnt+=1\r\n if cnt==2:\r\n ans+=1\r\nprint(ans) ", "\r\ndef findPrime(num):\r\n primes = set()\r\n i = 2\r\n while i <= num:\r\n while num % i == 0:\r\n primes.add(i)\r\n num /= i\r\n i += 1\r\n if num > 1:primes.add(int(num))\r\n return len(primes)\r\n \r\n\r\nnum = int(input())\r\nresult = 0\r\nfor i in range(num + 1):\r\n if findPrime(i) == 2:\r\n result += 1\r\nprint(result)\r\n", "def generate_almost_primes(n):\n is_prime = [1] * (n+1)\n is_prime[0] = is_prime[1] = 0\n almost_primes = 0\n for i in range(2, n+1):\n if is_prime[i] == 1:\n for j in range(i, n+1, i):\n is_prime[j] += 1\n for i in range(n+1):\n if is_prime[i] == 3:\n almost_primes += 1\n return almost_primes\n\nn = int(input())\nprint(generate_almost_primes(n))\n\t\t \t \t \t \t \t \t\t\t \t \t \t", "def primefactorsCount(n):\r\n lst = []\r\n for i in range(2,n+1):\r\n while n%i==0:\r\n if i in lst:\r\n n /= i\r\n else:\r\n lst.append(i)\r\n n /= i\r\n if n==1:\r\n break\r\n return len(lst)\r\n\r\nn = int(input())\r\ns = 0\r\nfor i in range(6,n+1):\r\n ret = primefactorsCount(i)\r\n if ret==2:\r\n s += 1\r\nprint(s)", "num = int(input())\n\ndef get_prime_factors(num):\n\n d = 2\n ans = set()\n while(d*d<=num):\n while(num%d==0):\n ans.add(d)\n num/=d\n d+=1\n\n if(num>1):\n ans.add(num)\n\n return ans\n\ncount =0\nfor curr in range(1,num+1):\n prime_factros = get_prime_factors(curr)\n if(len(prime_factros)==2):\n count+=1\n\nprint(count)\n\n\n\n\n\n ", "import math\r\nimport random\r\nimport itertools\r\n\r\n\r\nimport time\r\ndef timer(f):\r\n def tmp(*args, **kwargs):\r\n t = time.time()\r\n res = f(*args, **kwargs)\r\n #print(\"Время выполнения функции: %f\" % (time.time()-t))\r\n return res\r\n\r\n return tmp\r\n\r\nprimes = []\r\nfor i in range(1, 3001):\r\n prime = True\r\n for j in range(2, int(math.sqrt(i))+1):\r\n if i%j == 0:\r\n prime = False\r\n if prime:\r\n primes.append(i)\r\n\r\n\r\n@timer\r\ndef main(n):\r\n total = 0\r\n macht = 0\r\n for j in range(n+1):\r\n total = 0\r\n for i in range(len(primes)):\r\n if j%primes[i] == 0:\r\n total+=1\r\n\r\n #print(j, total)\r\n if total == 3:\r\n macht+=1\r\n\r\n print(macht)\r\n\r\nmain(int(input()))", "n = int(input())\r\n\r\n\r\n\r\ncount = 0\r\nfor i in range(6, n + 1):\r\n primes = set()\r\n d = 2 \r\n while d*d <= i:\r\n while i % d == 0:\r\n primes.add(d)\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n primes.add(i)\r\n if len(primes) == 2:\r\n count += 1\r\nprint(count)", "import math\r\n\r\ndef isAlmost(n):\r\n count = 0\r\n i = 2\r\n while(i<=n):\r\n if n%i == 0:\r\n count+=1\r\n while(n%i==0):\r\n n/=i\r\n i+=1\r\n if count==2:\r\n return True\r\n return False\r\n \r\n\r\nn = int(input())\r\nnum=0\r\nfor i in range(2, n+1, 1):\r\n if isAlmost(i):\r\n num+=1\r\nprint(num)\r\n", "from bisect import bisect\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn = get(int)\np: list[int] = []\nv = [False] * (n + 1)\nfor i in range(2, n + 1):\n if not v[i]:\n p.append(i)\n for j in p:\n if i * j > n:\n break\n v[i * j] = True\n if not i % j:\n break\nc = 0\nfor i in range(1, n + 1):\n s = set[int]()\n for j in p:\n if i == 1:\n break\n while not i % j:\n s.add(j)\n i //= j\n if len(s) == 2:\n c += 1\nprint(c)\n", "def isPrime(n):\n\tif n < 2:\n\t\treturn False\n\ti = 2\n\twhile i * i <= n:\n\t\tif n % i == 0:\n\t\t\treturn False\n\t\ti += 1\n\treturn True\n\n\ndef findDivisors(num):\n\ti = 1\n\tdivisors = set()\n\twhile i * i <= num:\n\t\tif num % i == 0:\n\t\t\tdivisors.add(i)\n\t\t\tdivisors.add(num // i)\n\t\ti += 1\n\treturn divisors\n\nn = int(input())\nalmostPrime = 0\n\nfor num in range(1, n+1):\n\tdivisors = list(findDivisors(num))\n\tcount = 0\n\n\tfor i in range(len(divisors)):\n\t\tif count > 2:\n\t\t\tbreak\n\t\tif isPrime(divisors[i]):\n\t\t\tcount += 1\n\telse:\n\t\tif count == 2:\n\t\t\talmostPrime += 1\n\t\t\t\nprint(almostPrime)\n\n\n\n\n\n\n \t \t \t\t\t\t\t \t \t\t\t\t \t\t", "n=int(input())\r\ncount=0\r\nfor i in range(2,n+1):\r\n checker=set()\r\n d=2\r\n org=i\r\n while d*d<=i:\r\n while i%d==0:\r\n checker.add(d)\r\n i//=d\r\n d+=1\r\n if i>1:\r\n checker.add(i)\r\n \r\n if len(checker)==2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ntotal = 0\r\nnum = [i for i in range(n + 1)]\r\nnum[1] = 0\r\ni = 2\r\nwhile i <= n:\r\n if num[i] != 0:\r\n j = i + i\r\n while j <= n:\r\n num[j] = 0\r\n j = j + i\r\n i += 1\r\nnum = [i for i in num if i != 0]\r\n\r\nlst = [int(i) for i in range(1, n+1)]\r\n\r\nfor a in lst:\r\n test = [int(i) for i in range(1, a+1) if a % i == 0]\r\n test2 = [i for i in test if i in num]\r\n if len(test2) == 2:\r\n total += 1\r\nprint(total)\r\n\r\n\r\n", "n = int(input())\r\nisPrime = [True for i in range(n+1)]\r\nisPrime[0] = False\r\nisPrime[1] = False\r\nfor i in range(4, n+1, 2):\r\n\tisPrime[i] = False\r\nfor i in range(3, n+1, 2):\r\n\tif(i*i > n):\r\n\t\tbreak\r\n\tif(isPrime[i]):\r\n\t\tfor j in range(i+i, n+1, i):\r\n\t\t\tisPrime[j] = False\r\nret = 0\r\nfor i in range(6, n+1):\r\n\tif(isPrime[i]):\r\n\t\tcontinue\r\n\tp = 0\r\n\tfor j in range(2, i):\r\n\t\tif(i%j == 0):\r\n\t\t\tif(isPrime[j]):\r\n\t\t\t\tp+=1\r\n\tif(p == 2):\r\n\t\tret+=1\r\nprint(ret)\r\n\r\n", "n = int(input())\r\nprime = [1]*(n+1)\r\ncnt = [0]*(n+1)\r\ni=2\r\nwhile i<=n:\r\n if prime[i]:\r\n j=i\r\n while j<=n:\r\n prime[j]=0\r\n cnt[j]+=1;\r\n j+=i\r\n i+=1\r\n\r\nans=0\r\nfor i in range(n+1):\r\n ans+=(cnt[i]==2)\r\nprint(ans)", "#ShutTheF**kUpDonny\r\nimport sys\r\ndef BobVanceVanceRefrigeration(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef BrocolliRob(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\ndef factors(n):\r\n v=[]\r\n i=1\r\n while i*i<=n:\r\n if n%i==0:\r\n v.append(i)\r\n if i*i!=n:\r\n v.append(n//i)\r\n i+=1\r\n return set(v)\r\n\r\ndef primeseive(n):\r\n prime =[True for i in range(n+1)]\r\n if n>1:\r\n prime[0]=prime[1]=False\r\n p=2\r\n a=[]\r\n while(p*p<=n):\r\n if prime[p]:\r\n\r\n for i in range(p*p,n+1,p):\r\n prime[i]=False\r\n p+=1\r\n for i in range(n+1):\r\n if prime[i]:\r\n a.append(i)\r\n return set(a)\r\n\r\nn=int(input())\r\nc=0\r\nfor i in range(n+1):\r\n if len(factors(i).intersection(primeseive(i)))==2:\r\n c+=1\r\nprint(c)\r\n \r\n", "n=int(input())\r\n\r\nprimes=[1]*(n+1)\r\nprimes[0]=0\r\nprimes[1]=0\r\nfor i in range(2,n):\r\n if primes[i]==1:\r\n for j in range(i*i,n,i):\r\n primes[j]=0\r\ndef almost_primes(primes,n):\r\n c=0\r\n #print(n,primes)\r\n for i in range(2,n):\r\n if primes[i]==1 and n%i==0:\r\n #print(\"hi\")\r\n c+=1\r\n if c==2:\r\n return 1\r\n else:\r\n return 0\r\nc=0\r\n\r\n\r\nfor i in range(n+1):\r\n #print(i)\r\n c+=almost_primes(primes,i)\r\nprint(c)\r\n \r\n", "def check(n):\r\n count = set()\r\n\r\n i = 2\r\n while i * i <= n:\r\n while n % i == 0:\r\n count.add(i)\r\n n //= i\r\n \r\n i += 1\r\n \r\n if n > 1:\r\n count.add(i)\r\n \r\n return len(count)\r\n\r\nnum = int(input())\r\n\r\nans = 0\r\nfor i in range(num+1):\r\n if check(i) == 2:\r\n ans += 1\r\n \r\nprint(ans)", "nhh = int(input())\r\namount = 0\r\n\r\nb = [False] * 3001\r\npfactors = [0] * 3001\r\n\r\nfor i in range(2, nhh + 1):\r\n if not b[i]:\r\n for j in range(i + i, nhh + 1, i):\r\n b[j] = True\r\n pfactors[j] += 1\r\n \r\n if pfactors[i] == 2:\r\n amount += 1\r\n\r\nprint(amount)\r\n", "s = set()\r\ndef factors(n):\r\n for i in range(2, ((int)(n ** 0.5))+1):\r\n while (n % i == 0):\r\n s.add(i)\r\n n /= i\r\n if (n > 1):\r\n s.add(n)\r\n\r\n\r\nn = int(input())\r\nct = 0\r\nfor i in range(2, n+1):\r\n factors(i)\r\n if (len(s) == 2):\r\n ct += 1\r\n s.clear()\r\n\r\nprint(ct)\r\n\r\n\r\n\r\n \r\n", "# Templates for the inputs:\r\nfrom typing import List\r\nfrom collections import Counter, defaultdict\r\nimport sys\r\nimport itertools\r\nimport bisect\r\n\r\ndef stringInput() -> str:\r\n return sys.stdin.readline()\r\n \r\ndef listInput() -> List[int]:\r\n return list(map(int, input().split()))\r\n \r\ndef string_list() -> List[int]:\r\n return list(input())\r\ndef intInput() -> int:\r\n return int(input())\r\n\r\n\r\n\r\ndef primeProduct(n: int):\r\n d = 2\r\n ans = set()\r\n while d * d <= n:\r\n while n % d == 0:\r\n ans.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n ans.add(n)\r\n\r\n return ans\r\n\r\n \r\ndef solve():\r\n tt = 1\r\n # tt = intInput()\r\n for _ in range(tt):\r\n n = intInput()\r\n count = 0\r\n for i in range(1, n+1):\r\n if len(primeProduct(i)) == 2:\r\n count += 1\r\n \r\n print(count)\r\n\r\n\r\n# Driver code... \r\nif __name__ == '__main__':\r\n solve()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(1,n+1):\r\n res = set()\r\n d = 2\r\n while d * d <= i:\r\n while i % d == 0:\r\n if d not in res:\r\n res.add(d)\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n res.add(i)\r\n if len(res) == 2:\r\n count += 1\r\nprint(count)", "import math\r\n\r\ndef prime(x):\r\n if x==1:\r\n return False\r\n else:\r\n for i in range(2,int(math.sqrt(x))+1):\r\n if(x%i==0):\r\n return False\r\n else:\r\n return True\r\nn = int(input())\r\n#print(prime(n))\r\nalmostprime = 0\r\nfor i in range(1,n+1):\r\n cnt=0\r\n for j in range(1,i+1):\r\n if i%j==0 and prime(j)==True:\r\n #print(i)\r\n cnt+=1\r\n #print(cnt)\r\n if cnt==2:\r\n almostprime+=1\r\nprint(almostprime)", "import sys\r\nimport collections\r\nimport math\r\nimport bisect\r\nimport heapq\r\n\r\ninf = sys.maxsize\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\n\r\ndef sieve2(n):\r\n primes = [0] * 3001\r\n for i in range(2, n + 1):\r\n if not primes[i]:\r\n for j in range(i, n + 1, i):\r\n primes[j] += 1\r\n cnt = 0\r\n for i in primes:\r\n if i == 2:\r\n cnt += 1\r\n return cnt\r\n\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n print(sieve2(n))", "n = int(input())\r\n\r\na = [2]*(n+1)\r\na[0]=0\r\na[1]=1\r\nfor i in range(2, n//2+1):\r\n for j in range(i+i, n+1, i):\r\n a[j]+=1\r\nk=0\r\nfor i in range(1, n+1):\r\n k1=0\r\n for j in range(2, n//2+1):\r\n if a[j]==2 and i%j==0 and a[i//j]==2 and j*j!=i:\r\n k1=2\r\n break\r\n elif a[j]==2 and i%j==0:k1+=1\r\n if k1==2:k+=1\r\n \r\nprint(k)\r\n", "def is_almost_prime(n):\n arr = []\n d = 2\n while d * d <= n:\n if n % d == 0:\n arr.append(d)\n n //= d\n else:\n d += 1\n\n if n > 1:\n arr.append(n)\n\n arr = set(arr)\n\n if len(arr) == 2:\n return 1\n else:\n return 0\n\nk = 0\namount = int(input())\n\nfor i in range(6, amount + 1):\n if is_almost_prime(i):\n k += 1\n\n\nprint(k)\n\t \t \t\t\t\t\t \t\t\t\t \t\t\t\t \t \t\t\t", "\r\ndef countAlmostPrime(n):\r\n primes=[]\r\n count=0\r\n for i in range(2,n+1):\r\n if i in [2,3,5,7]:\r\n primes.append(i)\r\n continue\r\n divs=[]\r\n j=i\r\n for p in primes:\r\n if p>i:\r\n break\r\n if j%p==0:\r\n j//=p\r\n divs.append(i)\r\n while j%p==0:\r\n j//=p\r\n elif p==primes[-1] and j==i:\r\n primes.append(i)\r\n if len(divs)==2:\r\n count+=1\r\n return count\r\n \r\n \r\nprint(countAlmostPrime(int(input())))\r\n\r\n\r\n \r\n", "n = int(input())\r\ncount = 0\r\n\r\nfor num in range(1, n + 1):\r\n factorization = []\r\n d = 2\r\n\r\n while d * d <= num:\r\n while num % d == 0:\r\n factorization.append(d)\r\n num //= d\r\n \r\n d += 1\r\n\r\n if num > 1:\r\n factorization.append(num)\r\n \r\n if len(set(factorization)) == 2:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "\r\nn = int(input())\r\n\r\nprimes_count = [0] * (n + 1)\r\n\r\n\r\nfor i in range(2, n+1):\r\n\r\n if not primes_count[i]:\r\n\r\n for j in range(i, n + 1, i):\r\n primes_count[j] += 1\r\n\r\n\r\ncount = 0\r\n\r\nfor i in range(4, n + 1):\r\n if primes_count[i] == 2:\r\n count += 1\r\n\r\nprint(count)", "s = int(input())\r\nt =[0]*(s+1)\r\nu = s//2\r\nfor x in range(2,u+1):\r\n if(t[x]==0):\r\n for y in range(x*2,s+1,x):\r\n t[y]+=1\r\nprint(t.count(2))", "def SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n count = []\r\n for p in range(2, n):\r\n if prime[p]:\r\n count.append(p)\r\n return count\r\n\r\nn = int(input())\r\nk = SieveOfEratosthenes(n)\r\n# print(k)\r\nval = 0\r\nfor i in range(1,n+1):\r\n count = 0\r\n for item in k:\r\n if item<i:\r\n if i%item==0:\r\n count+=1\r\n else:\r\n break\r\n if count==2:\r\n val+=1\r\nprint(val)", "n = int(input())\r\nres = 0\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999]\r\nfor i in range(1, n+1):\r\n factorization = []\r\n for j in primes:\r\n if i%j == 0:\r\n factorization.append(j)\r\n while i%j == 0:\r\n i /= j\r\n if len(factorization) == 2:\r\n res+=1\r\nprint(res)", "\ndef get_divisor(n):\n i = 2\n while i * i <= n:\n if n % i == 0:\n return i\n i += 1\n return 1\n\n\ndef is_prime(n):\n if n == 1 or n == 0: return False\n return get_divisor(n) == 1\n\n\ndef almost_prime(n):\n d = get_divisor(n)\n if d == 1: return False\n while n % d == 0:\n n //= d\n if is_prime(n): return True\n b = get_divisor(n)\n if b == 1: return False\n while n % b == 0:\n n //= b\n return n == 1\n\n\nn = int(input())\n\nresult = 0\nfor i in range(1, n + 1):\n if almost_prime(i):\n result += 1\n\nprint(result)\n", "n=int(input())\r\nisprimes=[1]*(n+1)\r\nisprimes[0]=isprimes[1]=0\r\np=2\r\nwhile(p<=n):\r\n if isprimes[p]==1:\r\n for i in range(p+p,n+1,p):\r\n isprimes[i]+=1\r\n p+=1\r\ncount=0\r\nfor i in isprimes:\r\n if i==3:\r\n count+=1\r\nprint(count)\r\n", "N=100001\r\nsei=[i for i in range(N)]\r\ntemp=[2]*N\r\nsei[0],sei[1]=0,0\r\ndef gen_sei():\r\n for i in range(2,N//2):\r\n if(sei[i]==i):\r\n for j in range(i+i,N,i):\r\n temp[j]-=1\r\n sei[j]=sei[j]//i\r\ngen_sei()\r\na=int(input())\r\nc=0\r\nfor i in range(2,a+1):\r\n if(temp[i]==0):\r\n c+=1\r\nprint(c)\r\n", "import math\r\ndef is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(math.sqrt(num)) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\nn = int(input())\r\nc=0\r\nfor x in range(1,n+1):\r\n l=[]\r\n # print(x)\r\n for i in range(2,x+1):\r\n if x%i==0 and is_prime(i) :\r\n l.append(i)\r\n if len(l)==2 and l[0]!=l[1]:\r\n c+=1\r\nprint(c)", "n=int(input())\r\na=[0]*(n+1)\r\nfor i in range(2, n//2+1):\r\n if a[i]==0:\r\n for j in range(2*i, n+1, i):\r\n a[j]+=1\r\nprint(a.count(2))", "def isPrime(x):\r\n count=0\r\n for i in range(1,x+1):\r\n if(x%i==0):\r\n count+=1\r\n \r\n if(count==2):\r\n return True\r\n\r\ndef almostPrime(x):\r\n count=0\r\n for i in range(1,x+1):\r\n if(x%i==0 and isPrime(i)):\r\n count+=1\r\n \r\n if(count==2):\r\n return True\r\n\r\ndef run():\r\n n=int(input())\r\n count=0\r\n \r\n for i in range(1,n+1):\r\n if(almostPrime(i)):\r\n count+=1\r\n \r\n return count\r\n \r\nif __name__ == \"__main__\":\r\n \r\n print(run())\r\n \r\n", "def is_prime(a):\r\n k = 0\r\n for i in range(1, a + 1):\r\n if a % i == 0:\r\n k += 1\r\n if k > 2:\r\n return False\r\n return True\r\nn = int(input())\r\ncnt = 0\r\nfor j in range(1, n + 1):\r\n a = []\r\n for i in range(2, j + 1):\r\n if j % i == 0:\r\n if is_prime(i) and i not in a:\r\n a.append(i)\r\n if len(a) == 2:\r\n cnt += 1\r\nprint(cnt)", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\n\r\ndef factor(n):\r\n d = 2\r\n fact = {}\r\n while d * d <= n:\r\n\r\n while n % d == 0:\r\n if not d in fact:\r\n fact[d] = 1\r\n n //= d\r\n\r\n d += 1\r\n \r\n if n > 1:\r\n if not d in fact:\r\n fact[d] = 1\r\n \r\n return fact\r\ncount = 0\r\nfor num in range(2, n+1):\r\n if len(factor(num)) == 2:\r\n count += 1\r\n \r\nprint(count)\r\n", "def f(n):\r\n\tx = i\r\n\ty = 0\r\n\tfor j in range(2, x+1):\r\n\t\tf = 0\r\n\t\twhile x % j == 0:\r\n\t\t\tx //= j\r\n\t\t\tf = 1\r\n\t\tif f:\r\n\t\t\ty += 1\r\n\tif y == 2:\r\n\t\treturn True\r\n\treturn False\r\n \r\nn = int(input())\r\nkol = 0\r\nfor i in range(1, n+1):\r\n if f(n):\r\n\t kol += 1\r\nprint(kol)\r\n", "def is_prime(n):\n for i in range(2, int(n//2)+1):\n if (n % i) == 0:\n return False\n return True\n\nalmost = []\nnum = int(input())\nfor i in range(1,num+1):\n primes = 0\n used = []\n for j in range(2,i):\n if i % j == 0 and is_prime(j) and j not in used:\n primes += 1\n used.append(j)\n if primes == 2:\n almost.append(i) \n\nprint(len(almost))\n \t\t \t\t\t \t\t \t \t\t \t \t\t \t\t\t", "import math\r\n\r\n\r\ndef is_prime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n limiter = math.isqrt(n)\r\n for i in range(3, limiter + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef two_prime_divs(n):\r\n counter = 0\r\n for i in range(2, n // 2 + 1):\r\n if n % i == 0 and is_prime(i):\r\n counter += 1\r\n return counter == 2\r\n\r\n\r\nn, ans = int(input()), 0\r\n\r\nfor i in range(6, n + 1):\r\n # if two_prime_divs(i):\r\n # ans += 1\r\n ans += two_prime_divs(i)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nseive = [i for i in range(n+1)]\r\nfor i in range(2,int(n**0.5)+1):\r\n if seive[i] == i:\r\n for j in range(i*i,n+1,i):\r\n seive[j] = i\r\nmyList=[]\r\ntemp = n\r\n##print(myList)\r\ncount=0\r\nfor i in range(1,n+1):\r\n temp = i\r\n while(i!=1):\r\n myList.append(seive[i])\r\n i= i//seive[i]\r\n if len(set(myList)) == 2:\r\n myList.clear()\r\n## print(temp)\r\n count+=1\r\n else:\r\n myList.clear()\r\nprint(count)\r\n \r\n", "n = int(input())\r\n\r\ndef fact (n):\r\n\r\n result = set()\r\n d = 2\r\n\r\n while d * d <= n:\r\n\r\n while n % d == 0:\r\n\r\n if d != 1:\r\n result.add(d)\r\n n = n // d\r\n d += 1\r\n\r\n if n > 0:\r\n if n != 1:\r\n result.add(n)\r\n\r\n return result \r\n \r\ncount = 0\r\n\r\nfor i in range(1, n + 1):\r\n\r\n check = fact(i)\r\n\r\n if len(check) == 2:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "from math import sqrt\r\n\r\ndef f(n):\r\n\tfor i in range(2,int(sqrt(n))+1):\r\n\t\tif n%i==0:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef fn(n):\r\n\tl=[]\r\n\tl2=[]\r\n\tfor i in range(2,n+1):\r\n\t\tif n%i==0:\r\n\t\t\tl.append(i)\r\n\tfor i in l:\r\n\t\tif f(i):\r\n\t\t\tl2.append(i)\r\n\t# print(l,l2)\r\n\treturn len(l2)==2\r\n\r\nn=int(input())\r\nc=0\r\nfor i in range(6,n+1):\r\n\tif fn(i):\r\n\t\tc+=1\r\n\t\t# print(i)\r\n\t# c+=int(fn(i))\r\nprint(c)", "from math import *\r\ndef pf(n):\r\n\te=[]\r\n\twhile n%2==0:\r\n\t\te.append(2)\r\n\t\tn=n//2\r\n\tfor i in range(3,int(sqrt(n))+1,2):\r\n\t\twhile n%i ==0:\r\n\t\t\te.append(i)\r\n\t\t\tn=n//i\r\n\tif n>2:\r\n\t\te.append(n)\r\n\treturn len(list(set(e)))==2 \r\nn=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n\tif pf(i)==True:\r\n\t\tc+=1\r\nprint(c)", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = [0] * (n + 1)\r\nans = 0\r\nfor i in range(2, n + 1) :\r\n if a[i] == 0 :\r\n for j in range(i * 2, n + 1, i) :\r\n a[j] += 1\r\n elif a[i] == 2:\r\n ans += 1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "import math\n\nl=[2]\ntot=0;\n\nn = int(input())\nfor i in range(3,n+1):\n\tcont = 0;\n\tfor j in l:\n\t\tif(i%j==0):\n\t\t\tcont+=1\n\t\tif(j>cont>2):\n\t\t\tbreak\n\tif(cont==0):\n\t\tl.append(i)\n\telif(cont==2):\n\t\ttot+=1\n\nprint(tot)\n", "n = int(input())\r\nr = [i for i in range(2,n+1)]\r\na = n\r\nb = []\r\nfor i in range(a-1):\r\n b.append(0)\r\ni = 0\r\nfor j in r:\r\n if j != 1 and b[i]==0:\r\n c = j+j\r\n while c<=a:\r\n b[c-2] += 1\r\n c+=j\r\n i+=1\r\nprint(b.count(2))", "def pr(x):\r\n i = 2\r\n while i ** 2 <= x:\r\n if x % i == 0:\r\n return False\r\n i = i + 1\r\n return True\r\nn = int(input())\r\ns = 0\r\nfor j in range(1, n+1):\r\n sum = 0\r\n for i in range(2, j // 2 + 1):\r\n if j % i == 0 and pr(i):\r\n sum = sum +1\r\n if sum == 2:\r\n s = s + 1\r\nprint(s)\r\n", "num = int(input())\r\nsqrtt = int(num**(0.5))\r\nprimes = [i for i in range(2,sqrtt+1)]\r\nvisited = set()\r\n\r\nres = [[0,i] for i in range(num+1)]\r\n\r\nfor i in primes:\r\n \r\n if i in visited:\r\n continue\r\n x = 1\r\n \r\n while i * x <= num:\r\n \r\n res[i*x][0] += 1\r\n while res[i*x][1] % (i) == 0:\r\n res[i*x][1] //= (i)\r\n x += 1\r\n visited.add(i*x)\r\n\r\n \r\ncount = 0\r\nfor i in res:\r\n if i[0] == 2 and i[1] ==1:\r\n count += 1\r\n elif i[0] == 1 and i[1] > 1:\r\n count += 1\r\nprint(count)\r\n ", "def almost_prime(num):\n ''' funcion que retorna la cantidad de primos que contiene\n un numero '''\n\n count = 0 # cuenta para considerar divisores de este num que son primos\n\n # buscamos numeros por los que es divisible, ignoraremos el 1 y el mismo numero\n for i in range (2, num): # recorremos desde 2, ..., num - 1\n if num % i == 0: # si resto es 0 significa que es divisible, por lo tanto lo reviso si es primo\n # reviso si es primo, si es que si, lo agrego a la cuenta\n if primo(i):\n count += 1\n \n if count == 2: # exactamente 2 divisores primos distintos\n return True\n return False \n\ndef primo(num):\n ''' retorna True si es primo, False en caso contrario '''\n for i in range(2, num):\n if num % i == 0:\n return False\n return True\n\nn = int(input())\ncount = 0\nfor i in range(3, n + 1): # evitamos el 1 y el 2 porque sabemos que no son almost prime\n if almost_prime(i):\n count += 1\nprint(count)\n\t \t\t\t \t\t\t\t\t \t\t\t \t", "# A. Almost Prime, by marcid\r\n\r\nn = int(input())\r\ndef prime_factors(n):\r\n\tprimes = []\r\n\tif n % 2 == 0: primes.append(2)\r\n\tfor x in range(3, n + 1, 2):\r\n\t\tif n%x==0 and is_prime(x): primes.append(x)\r\n\treturn primes\r\n \r\ndef is_prime(number):\r\n # if number is equal to or less than 1, return False\r\n if number <= 1:\r\n return False\r\n for x in range(2, number):\r\n # if number is divisble by x, return False\r\n if not number % x:\r\n return False\r\n return True\r\n\r\nc=0\r\nfor i in range(2, n+1):\r\n\tif len(prime_factors(i)) == 2: c+=1\r\nprint(c)", "import math\r\ndef factors(a):\r\n if a==1:\r\n return False\r\n if a==2:\r\n return False\r\n # else:\r\n l = []\r\n while a%2==0:\r\n a=a//2\r\n l.append(2)\r\n # print(int(math.sqrt(a)))\r\n for i in range(3,int(math.sqrt(a))+1,2):\r\n # print(i)\r\n while a%i==0:\r\n a= a//i\r\n l.append(i)\r\n if a>2:\r\n l.append(a)\r\n final = list(set(l))\r\n\r\n # print(final)\r\n if len(final) ==2:\r\n return True\r\n else:\r\n return False\r\n \r\n \r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\n\r\nl = [i+1 for i in range(n)]\r\nans = []\r\n# print(l)\r\nfor i in l:\r\n ans.append(factors(i))\r\ncnt =0\r\nfor i in ans:\r\n if i==True:\r\n cnt +=1\r\nprint(cnt)\r\n\r\n# ans = factors(n)\r\n# print(ans)\r\n\r\n", "\nimport math\n\ndef isPrime(num):\n if num==1:\n return True\n for i in range(2,int((num**0.5)+1)):\n if num%i==0:\n return False\n return True\n\ndef fact(num):\n fac= 1 \n for i in range(num):\n fac*=(i+1)\n return fac\n\ndef comb(n,r):\n return int(fact(n)/(fact(r)*fact(n-r)))\n\ndef facts(num,a,last):\n x=math.floor(math.sqrt(num))+1\n\n for i in range(last,x):\n if num%i==0:\n a.append(i)\n return facts(num/i,a,i)\n a.append(num)\n return a\n\n\ndef inp():\n \n return [int(x) for x in input().split()]\n \ndef findComp(p,n,r):\n return p*((1+(r/100))**n)-p\n\ndef are_coprime(a,b):\n \n hcf = 1\n\n for i in range(1, a+1):\n if a%i==0 and b%i==0:\n hcf = i\n\n return hcf == 1 \n \n \ndef frac(i):\n count=0\n z=math.ceil(pow(i,.5))\n for y in range(2,z):\n if i%y==0 :\n if isPrime(y):\n count+=1\n \n if isPrime(i/y):\n count+=1\n \n return count\n\ncount=0\nx=int(input())\nfor i in range(4,x+1):\n if frac(i)==2:\n \n count+=1 \n\n\nprint(count) \n\t \t\t \t \t \t\t \t\t \t\t\t\t \t\t\t\t\t", "'''\r\nCreated on May 13, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\ndef Prime(n):\r\n f = 2\r\n pr_dvs = []\r\n while(f<n*n):\r\n if n%f == 0:\r\n n//=f \r\n pr_dvs.append(f)\r\n else:\r\n f+=1\r\n return pr_dvs\r\nn = int(input())\r\nans =0\r\nfor i in range(n+1):\r\n if len(set(Prime(i))) == 2:\r\n ans+=1\r\nprint(ans)", "def almost_prime(n):\n m = n\n c = 0\n for i in range(2, int((m**0.5)+1)):\n if m % i == 0:\n while m%i == 0:\n m//=i\n c += 1\n if m == 1:\n break\n if m!=1:\n c+=1\n return c == 2\n\n\nc=0\nfor i in range(1, int(input())+1):\n if almost_prime(i):\n c+=1\nprint(c)", "def p(x):\r\n if x<=1:\r\n return False\r\n else:\r\n for i in range(2,int(x**0.5+1)):\r\n if x % i ==0:\r\n return False\r\n \r\n return True \r\n \r\nn=int(input())\r\nukupno=0\r\nfor i in range(6,n+1):\r\n bpd=0\r\n if p(i)==False:\r\n for j in range(2,i//2+1):\r\n if i%j==0 and p(j):\r\n bpd+=1\r\n if bpd==2:\r\n ukupno=ukupno+1\r\nprint(ukupno)\r\n", "def f(x): \r\n d = 2 \r\n s = set() \r\n while d**2 <= x : \r\n if x % d == 0: \r\n x//=d \r\n s.add(d)\r\n \r\n else : d += 1\r\n if x != 1 : s.add(x)\r\n if len(s) == 2 : return True\r\n return False\r\nn = int(input()) \r\nans = 0\r\nfor i in range(2, n+1): \r\n if f(i) : ans += 1\r\nprint(ans)", "n= int(input())\r\ncnt= 0\r\n\r\nfor i in range(6, n+1):\r\n d= 2\r\n res= set()\r\n while d ** 2 <= i:\r\n while i % d == 0:\r\n res.add(d)\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n res.add(d)\r\n if len(res) == 2:\r\n cnt +=1\r\nprint(cnt)", "import math\nimport sys\n\ninput = sys.stdin.readline\n\n\ndef inp():\n return int(input())\n\n\ndef inlt():\n return list(map(int, input().split()))\n\n\ndef insr():\n s = input()\n return list(s[:len(s) - 1])\n\n\ndef invr():\n return map(int, input().split())\n\n\ndef is_prime(n):\n if n <= 1:\n return False\n for i in range(2, int(math.sqrt(n)) + 1):\n if n % i == 0:\n return False\n return True\n\n\ndef count_baitta_primes(UB):\n count = 0\n for i in range(1, UB + 1):\n divisors = set()\n for j in range(2, int(math.sqrt(i)) + 1):\n if i % j == 0:\n if is_prime(j):\n divisors.add(j)\n if is_prime(i // j):\n divisors.add(i // j)\n if len(divisors) > 2:\n break\n if len(divisors) == 2:\n count += 1\n return count\n\n\nif __name__ == '__main__':\n num = inp()\n print(count_baitta_primes(num))\n\n\t \t\t \t\t \t \t\t\t \t\t\t\t\t\t\t \t \t\t \t", "def isAlmostPrime(n):\r\n number_primes = set()\r\n prime_num = 2\r\n \r\n while prime_num * prime_num <= n:\r\n while n % prime_num == 0:\r\n number_primes.add(prime_num)\r\n n //= prime_num\r\n prime_num += 1\r\n \r\n if n > 1:\r\n number_primes.add(n)\r\n return len(number_primes) == 2\r\n \r\nnumbers = int(input())\r\ncount = 0\r\n\r\nfor i in range(1, numbers + 1):\r\n if isAlmostPrime(i):\r\n count += 1\r\n \r\nprint(count)", "# LUOGU_RID: 101447044\ndef sieve(n):\r\n primes = set(range(2, n + 1))\r\n for i in range(2, int(n**0.5 + 1)):\r\n primes.difference_update(range(i * 2, n + 1, i))\r\n return list(primes)\r\n\r\nn = int(input())\r\np = sieve(n)\r\ndef check(x):\r\n c = 0\r\n for i in range(2, x + 1):\r\n if x % i == 0 and i in p:\r\n c += 1\r\n return c == 2\r\nprint(sum(check(x) for x in range(1, n + 1)))", "def compute():\n n = int(input())\n SIZE = 3010\n sieve = [0]*SIZE\n for it1 in range(2,SIZE):\n if sieve[it1]==0:\n for it2 in range(it1,SIZE,it1):\n sieve[it2] += 1\n return sum(1 for it in range(n+1) if sieve[it]==2)\n\nif __name__==\"__main__\":\n print(compute())\n", "n = int(input())\r\ncount = 0\r\ntemp = 0\r\na = 2\r\nfor i in range(1,n+1):\r\n a = 2\r\n t = set()\r\n while a*a <= i:\r\n while i%a == 0:\r\n t.add(a)\r\n i //=a\r\n a += 1\r\n if i > 1:\r\n t.add(i)\r\n if len(t) == 2:\r\n count += 1\r\nprint(count)", "from collections import Counter\r\n\r\n\r\ndef LI():\r\n return list(map(int, input().split(\" \")))\r\ndef LS():\r\n return input().split(\" \")\r\ndef LC():\r\n return input().split()\r\ndef I():\r\n return int(input())\r\ndef S():\r\n return input()\r\n\r\nprime = set()\r\nprime.add(2)\r\nalmost = 0\r\nnum = I()\r\n\r\nfor i in range(3, num + 1):\r\n temp = []\r\n flag = True\r\n for p in prime:\r\n x = i % p\r\n if not x:\r\n temp.append(p)\r\n y = len(Counter(temp))\r\n if not y:\r\n prime.add(i)\r\n elif y == 2:\r\n almost += 1\r\n\r\nprint(almost)\r\n\r\n \r\n", "pool = {6, 10, 12, 14, 15, 18, 20, 21, 22, 24, 26, 28, 33, 34, 35, 36, 38, 39, 40, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 62, 63, 65, 68, 69, 72, 74, 75, 76, 77, 80, 82, 85, 86, 87, 88, 91, 92, 93, 94, 95, 96, 98, 99, 100, 104, 106, 108, 111, 112, 115, 116, 117, 118, 119, 122, 123, 124, 129, 133, 134, 135, 136, 141, 142, 143, 144, 145, 146, 147, 148, 152, 153, 155, 158, 159, 160, 161, 162, 164, 166, 171, 172, 175, 176, 177, 178, 183, 184, 185, 187, 188, 189, 192, 194, 196, 200, 201, 202, 203, 205, 206, 207, 208, 209, 212, 213, 214, 215, 216, 217, 218, 219, 221, 224, 225, 226, 232, 235, 236, 237, 242, 244, 245, 247, 248, 249, 250, 253, 254, 259, 261, 262, 265, 267, 268, 272, 274, 275, 278, 279, 284, 287, 288, 291, 292, 295, 296, 297, 298, 299, 301, 302, 303, 304, 305, 309, 314, 316, 319, 320, 321, 323, 324, 325, 326, 327, 328, 329, 332, 333, 334, 335, 338, 339, 341, 344, 346, 351, 352, 355, 356, 358, 362, 363, 365, 368, 369, 371, 375, 376, 377, 381, 382, 384, 386, 387, 388, 391, 392, 393, 394, 395, 398, 400, 403, 404, 405, 407, 411, 412, 413, 415, 416, 417, 422, 423, 424, 425, 427, 428, 432, 436, 437, 441, 445, 446, 447, 448, 451, 452, 453, 454, 458, 459, 464, 466, 469, 471, 472, 473, 475, 477, 478, 481, 482, 484, 485, 486, 488, 489, 493, 496, 497, 500, 501, 502, 505, 507, 508, 511, 513, 514, 515, 517, 519, 524, 526, 527, 531, 533, 535, 536, 537, 538, 539, 542, 543, 544, 545, 548, 549, 551, 553, 554, 556, 559, 562, 565, 566, 567, 568, 573, 575, 576, 578, 579, 581, 583, 584, 586, 589, 591, 592, 596, 597, 603, 604, 605, 608, 611, 614, 621, 622, 623, 626, 628, 629, 632, 633, 634, 635, 637, 639, 640, 648, 649, 652, 655, 656, 657, 662, 664, 667, 668, 669, 671, 674, 675, 676, 679, 681, 685, 686, 687, 688, 689, 692, 694, 695, 697, 698, 699, 703, 704, 706, 707, 711, 712, 713, 716, 717, 718, 721, 722, 723, 724, 725, 731, 734, 736, 737, 745, 746, 747, 749, 752, 753, 755, 758, 763, 764, 766, 767, 768, 771, 772, 775, 776, 778, 779, 781, 783, 784, 785, 788, 789, 791, 793, 794, 796, 799, 800, 801, 802, 803, 807, 808, 813, 815, 817, 818, 824, 831, 832, 833, 835, 837, 838, 842, 843, 844, 845, 847, 848, 849, 851, 856, 862, 864, 865, 866, 867, 869, 871, 872, 873, 875, 878, 879, 886, 889, 891, 892, 893, 895, 896, 898, 899, 901, 904, 905, 908, 909, 913, 914, 916, 917, 921, 922, 923, 925, 926, 927, 928, 931, 932, 933, 934, 939, 943, 944, 949, 951, 955, 956, 958, 959, 963, 964, 965, 968, 972, 973, 974, 976, 979, 981, 982, 985, 989, 992, 993, 995, 998, 999, 1000, 1003, 1004, 1006, 1007, 1011, 1016, 1017, 1018, 1025, 1027, 1028, 1029, 1037, 1041, 1042, 1043, 1046, 1047, 1048, 1052, 1053, 1055, 1057, 1058, 1059, 1067, 1072, 1073, 1075, 1076, 1077, 1079, 1081, 1082, 1083, 1084, 1088, 1089, 1094, 1096, 1099, 1101, 1107, 1108, 1111, 1112, 1114, 1115, 1119, 1121, 1124, 1125, 1126, 1127, 1132, 1133, 1135, 1136, 1137, 1138, 1139, 1141, 1142, 1143, 1145, 1147, 1149, 1152, 1154, 1156, 1157, 1159, 1161, 1165, 1167, 1168, 1169, 1172, 1174, 1175, 1177, 1179, 1183, 1184, 1186, 1189, 1191, 1192, 1195, 1198, 1199, 1202, 1203, 1205, 1207, 1208, 1211, 1214, 1215, 1216, 1219, 1225, 1226, 1227, 1228, 1233, 1234, 1238, 1241, 1243, 1244, 1247, 1250, 1251, 1252, 1253, 1255, 1256, 1257, 1261, 1262, 1263, 1264, 1267, 1268, 1269, 1271, 1273, 1280, 1282, 1285, 1286, 1293, 1294, 1296, 1299, 1304, 1306, 1312, 1313, 1315, 1317, 1318, 1322, 1323, 1324, 1325, 1328, 1329, 1333, 1336, 1337, 1339, 1341, 1343, 1345, 1346, 1347, 1348, 1349, 1351, 1352, 1354, 1355, 1357, 1359, 1363, 1366, 1371, 1372, 1375, 1376, 1377, 1379, 1382, 1383, 1384, 1385, 1387, 1388, 1389, 1391, 1393, 1396, 1397, 1401, 1402, 1403, 1405, 1408, 1411, 1412, 1413, 1415, 1417, 1418, 1421, 1424, 1431, 1432, 1436, 1437, 1438, 1441, 1444, 1445, 1448, 1454, 1457, 1458, 1461, 1465, 1466, 1467, 1468, 1469, 1472, 1473, 1475, 1477, 1478, 1486, 1492, 1497, 1501, 1502, 1503, 1504, 1507, 1509, 1513, 1514, 1516, 1517, 1519, 1521, 1522, 1525, 1527, 1528, 1529, 1532, 1535, 1536, 1537, 1538, 1539, 1541, 1544, 1546, 1552, 1555, 1556, 1557, 1561, 1563, 1565, 1568, 1569, 1573, 1574, 1576, 1577, 1585, 1587, 1588, 1589, 1591, 1592, 1593, 1594, 1600, 1603, 1604, 1611, 1616, 1618, 1622, 1623, 1625, 1629, 1631, 1633, 1636, 1639, 1641, 1642, 1643, 1646, 1647, 1648, 1649, 1651, 1654, 1655, 1658, 1661, 1664, 1671, 1673, 1675, 1676, 1678, 1679, 1682, 1684, 1685, 1687, 1688, 1689, 1691, 1696, 1701, 1703, 1706, 1707, 1711, 1712, 1713, 1714, 1715, 1717, 1718, 1719, 1724, 1726, 1727, 1728, 1731, 1732, 1735, 1737, 1739, 1744, 1745, 1751, 1754, 1756, 1757, 1761, 1762, 1763, 1765, 1766, 1769, 1772, 1773, 1774, 1775, 1779, 1781, 1784, 1791, 1792, 1793, 1795, 1796, 1797, 1799, 1803, 1805, 1807, 1808, 1809, 1813, 1814, 1816, 1817, 1819, 1821, 1822, 1825, 1828, 1829, 1832, 1835, 1837, 1838, 1839, 1841, 1843, 1844, 1851, 1852, 1853, 1856, 1857, 1858, 1859, 1863, 1864, 1865, 1868, 1874, 1875, 1882, 1883, 1888, 1891, 1893, 1894, 1895, 1897, 1899, 1903, 1906, 1909, 1912, 1915, 1916, 1917, 1919, 1921, 1922, 1923, 1927, 1928, 1929, 1934, 1936, 1937, 1939, 1941, 1942, 1943, 1944, 1945, 1948, 1952, 1954, 1957, 1959, 1961, 1963, 1964, 1966, 1967, 1969, 1971, 1975, 1977, 1981, 1982, 1983, 1984, 1985, 1991, 1994, 1996, 2000, 2005, 2007, 2008, 2009, 2012, 2018, 2019, 2021, 2023, 2025, 2026, 2031, 2032, 2033, 2036, 2038, 2041, 2042, 2043, 2045, 2047, 2049, 2051, 2056, 2057, 2059, 2061, 2062, 2066, 2071, 2073, 2075, 2077, 2078, 2084, 2092, 2095, 2096, 2097, 2098, 2101, 2102, 2103, 2104, 2105, 2107, 2116, 2117, 2119, 2122, 2123, 2125, 2126, 2127, 2133, 2138, 2144, 2147, 2149, 2151, 2152, 2155, 2157, 2159, 2164, 2165, 2167, 2168, 2169, 2171, 2173, 2174, 2176, 2177, 2181, 2182, 2183, 2186, 2188, 2189, 2191, 2192, 2194, 2195, 2199, 2201, 2206, 2215, 2216, 2217, 2218, 2219, 2224, 2225, 2227, 2228, 2229, 2231, 2234, 2241, 2245, 2246, 2248, 2249, 2252, 2253, 2257, 2258, 2259, 2263, 2264, 2271, 2272, 2276, 2279, 2283, 2284, 2285, 2291, 2299, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2312, 2313, 2315, 2317, 2319, 2321, 2323, 2326, 2327, 2329, 2335, 2336, 2342, 2344, 2348, 2349, 2353, 2359, 2361, 2362, 2363, 2367, 2368, 2369, 2372, 2374, 2375, 2384, 2386, 2391, 2395, 2396, 2402, 2403, 2404, 2407, 2413, 2416, 2419, 2421, 2425, 2426, 2427, 2428, 2429, 2432, 2433, 2434, 2435, 2439, 2443, 2446, 2449, 2452, 2453, 2455, 2456, 2458, 2461, 2462, 2463, 2468, 2469, 2471, 2474, 2476, 2479, 2481, 2483, 2487, 2488, 2489, 2491, 2493, 2495, 2497, 2498, 2500, 2501, 2504, 2507, 2509, 2511, 2512, 2513, 2515, 2517, 2518, 2519, 2523, 2524, 2525, 2527, 2528, 2529, 2533, 2536, 2537, 2545, 2547, 2554, 2558, 2559, 2560, 2561, 2563, 2564, 2566, 2567, 2569, 2571, 2572, 2573, 2575, 2577, 2578, 2581, 2582, 2587, 2588, 2589, 2592, 2594, 2597, 2599, 2601, 2602, 2603, 2605, 2606, 2608, 2611, 2612, 2614, 2615, 2619, 2623, 2624, 2627, 2629, 2631, 2636, 2637, 2638, 2641, 2642, 2643, 2644, 2645, 2648, 2649, 2651, 2653, 2654, 2656, 2661, 2662, 2669, 2672, 2673, 2675, 2681, 2692, 2696, 2701, 2704, 2705, 2708, 2721, 2722, 2723, 2725, 2727, 2732, 2733, 2734, 2735, 2738, 2743, 2744, 2746, 2747, 2752, 2757, 2759, 2761, 2762, 2763, 2764, 2768, 2771, 2773, 2776, 2779, 2781, 2783, 2785, 2787, 2792, 2798, 2799, 2804, 2807, 2811, 2813, 2815, 2816, 2817, 2818, 2823, 2824, 2825, 2827, 2831, 2836, 2839, 2841, 2845, 2846, 2848, 2853, 2854, 2855, 2858, 2859, 2863, 2864, 2866, 2867, 2869, 2872, 2873, 2875, 2876, 2878, 2881, 2883, 2885, 2888, 2889, 2891, 2893, 2894, 2896, 2899, 2901, 2902, 2906, 2908, 2911, 2913, 2916, 2918, 2921, 2923, 2929, 2931, 2932, 2933, 2935, 2936, 2941, 2942, 2943, 2944, 2947, 2949, 2951, 2956, 2959, 2962, 2965, 2966, 2972, 2973, 2974, 2977, 2978, 2979, 2981, 2983, 2984, 2986, 2987, 2989, 2991, 2993, 2995, 2997, 2998}\r\n\r\narr = sorted(pool)\r\nnum = int(input())\r\n\r\nans = 0\r\nfor i in arr:\r\n if i <= num :\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\ndef prime(num):\r\n prime=True\r\n\r\n if num > 1:\r\n \r\n \r\n for i in range(2, int(num/2)+1):\r\n \r\n \r\n if (num % i) == 0:\r\n prime=False\r\n break\r\n else:\r\n prime=True\r\n \r\n else:\r\n prime=False\r\n return prime\r\ntotal=0\r\nfor jj in range(6,n+1):\r\n \r\n divisors=[]\r\n for i in range(2,int(jj/2)+1):\r\n if jj%i==0:\r\n divisors.append(i)\r\n else:\r\n pass\r\n pass1=0\r\n\r\n \r\n for nos in divisors:\r\n \r\n if prime(nos)==True:\r\n pass1+=1\r\n \r\n if pass1==2:\r\n total+=1\r\nprint(total)\r\n", "import math\r\ndef soe(n):\r\n is_prime = [True for i in range(n+1)]\r\n is_prime[0] = False\r\n is_prime[1] = False\r\n count = [0 for i in range(n+1)]\r\n primes = []\r\n for i in range(2,(n//2)+1):\r\n if is_prime[i]:\r\n for j in range(2*i,n+1,i):\r\n is_prime[j] = False\r\n count[j] += 1\r\n res = 0\r\n for i in range(n+1):\r\n if count[i] == 2:\r\n res += 1\r\n return res\r\n\r\nn = int(input())\r\nprint(soe(n))\r\n\r\n\r\n \r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\ndef factor(n):\r\n factorization = set()\r\n d = 2\r\n\r\n while d * d <= n:\r\n while n % d == 0:\r\n factorization.add(d)\r\n if len(factorization) > 2:\r\n return 0\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n factorization.add(n)\r\n if len(factorization) == 2:\r\n return 1\r\n return 0\r\n\r\ndef solve():\r\n num = get_int()\r\n ans = 0\r\n \r\n for i in range(1,num+1):\r\n ans += factor(i)\r\n \r\n print(ans)\r\n \r\n \r\n \r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "#!/usr/bin/env python3\n\ndef main():\n n = int(input())\n sieve = [0] * (n + 1)\n for i in range(2, n + 1):\n if not sieve[i]:\n for j in range(2 * i, n + 1, i):\n sieve[j] += 1\n print(sieve.count(2))\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\ncount = 0\r\nfor i in range(4, n+1):\r\n each_count = 0\r\n d = 2\r\n\r\n while d * d <= i:\r\n if i % d == 0:\r\n each_count += 1\r\n while i % d == 0:\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n each_count += 1\r\n if each_count == 2:\r\n count += 1\r\nprint(count)", "#!/usr/bin/python3\n\n# https://codeforces.com/problemset/problem/26/A\n\"\"\"\nA. Almost Prime\ntime limit per test2 seconds\nmemory limit per test256 megabytes\ninputstandard input\noutputstandard output\nA number is called almost prime if it has exactly two distinct prime divisors.\nFor example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not.\nFind the amount of almost prime numbers which are between 1 and n, inclusive.\n\nInput\nInput contains one integer number n (1 ≤ n ≤ 3000).\n\nOutput\nOutput the amount of almost prime numbers between 1 and n, inclusive.\n\"\"\"\n\nimport math\n\ndef get_divisors(anint):\n\n divisors = []\n keepgoing = True\n curr = anint\n\n # Get divisors of 2\n while True:\n if curr % 2 == 0:\n curr = int(curr/2)\n divisors.append(2)\n else:\n break\n\n #curr = anint\n sqrt_int = int(math.sqrt(anint)) + 1\n for i in range(3, sqrt_int, 2):\n while curr % i == 0:\n curr = int(curr/i)\n divisors.append(i)\n\n if curr > 2:\n divisors.append(curr)\n\n return set(divisors)\n\ndef main():\n number = int(input())\n\n n_divisors = 0\n for i in range(1, number+1):\n divisors = get_divisors(i)\n if len(divisors) == 2:\n n_divisors += 1\n\n print(n_divisors)\n\nif __name__ == \"__main__\":\n main()\n", "x = 100004\r\nhmap = {}\r\ndef sieve(x):\r\n if x < 2:\r\n return 0\r\n primes = [1] * (x + 1)\r\n \r\n primes[0] = primes[1] = 0\r\n spf = [-1] * (100004 + 1)\r\n \r\n i = 2\r\n # iterating only over the squareroot of N\r\n while(i * i <= x):\r\n # in sieve we consider first non cut number to be prime\r\n if primes[i]: \r\n j = i\r\n while(i * j <= x):\r\n if primes[i * j] == 1:\r\n spf[i * j] = i\r\n primes[i * j] = 0\r\n j += 1\r\n i += 1\r\n return spf\r\n\r\nspfArray = sieve(x)\r\ndef primeFactors(n):\r\n # we have to create sieve only once according to the contraints\r\n # here in this example spf array for 10 will look like\r\n # [-1, -1, -1, -1, 2, -1, 2, -1, 2, 3, 2]\r\n # according to condition spfArray[10] = 2 (which is not equal to -1)\r\n # therefore while loop will run \r\n # and we will print spf[10] which is 2 \r\n # and we will divide n by spf[10] which is 10 / 2 => 5\r\n # now again while loop condition will check spf[5] != -1\r\n # but here spf[5] is -1 (beacuse it is a prime number)\r\n # therefore we will not go into while loop \r\n # now if condition n != -1\r\n # here n is 5 so we will print n => 5 these are the factors of 10\r\n while(spfArray[n] != -1):\r\n if spfArray[n] in hmap:\r\n hmap[spfArray[n]] += 1\r\n else:\r\n hmap[spfArray[n]] = 1\r\n n //= spfArray[n]\r\n if n != 1:\r\n if n in hmap:\r\n hmap[n] += 1\r\n else:\r\n hmap[n] = 1\r\n \r\n \r\n if len(hmap) == 2:\r\n return True\r\n else:\r\n return False\r\n \r\n\r\n\r\nq = int(input())\r\ncount = 0\r\nfor i in range(2, q + 1):\r\n res = primeFactors(i)\r\n if res:\r\n count += 1\r\n hmap.clear()\r\nprint(count)", "m = int(input())\r\n\r\ncounter = 0\r\n\r\nfor n in range(1,m+1):\r\n mySet = set()\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n mySet.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n mySet.add(n)\r\n\r\n \r\n if len(mySet) == 2:\r\n counter += 1\r\nprint(counter)\r\n\r\n", "n = int(input())\r\nc = 0\r\nfor i in range(2,n+1):\r\n p = 2\r\n l = []\r\n while i > 1:\r\n if i % p == 0:\r\n i //= p\r\n l.append(p)\r\n continue\r\n p += 1\r\n if len(set(l)) == 2:\r\n c += 1\r\nprint(c)", "def primeFactors(n):\n i = 2\n primesfactors = set()\n while i*i <= n:\n if n % i == 0:\n primesfactors.add(i)\n n //= i\n else:\n i += 1\n if n > 1:\n primesfactors.add(n)\n return 1 if len(primesfactors) == 2 else 0\n\n\nsm = 0\nfor i in range(1, int(input())+1):\n sm += primeFactors(i)\nprint(sm)\n\n\n# print(primeFactors(19))\n\n \t \t\t\t \t\t\t \t\t \t \t\t\t \t \t \t", "def decompose (n):\r\n L,i = [],2 \r\n while n>1: \r\n while n%i == 0: \r\n L.append(i)\r\n n = n/i \r\n i += 1\r\n return len(set(L))\r\n \r\nalpcount = 0\r\nfor k in range(1,int(input())+1): alpcount += decompose(k) == 2\r\nprint(alpcount)", "def prime(n):\n if n < 2:\n return False\n else:\n for i in range(2, int(n**(1/2) + 1)):\n if n % i == 0:\n return False\n return True\n\ndef almost_prime(n):\n count = 0\n primes = set()\n not_primes = set()\n\n for i in range(1, n+1):\n div_prime = 0\n\n for j in range(1, i+1):\n if i % j == 0:\n if j in primes:\n div_prime += 1\n elif j in not_primes:\n continue\n else:\n boolean = prime(j)\n if boolean:\n primes.add(j)\n div_prime += 1\n else:\n not_primes.add(j)\n if div_prime > 2:\n break\n if div_prime == 2:\n count += 1\n return count\n\nn = int(input())\nprint(almost_prime(n))\n\t\t\t\t \t\t\t \t \t \t \t\t\t \t \t\t\t", "def distinct_prime_factors(number):\r\n\ti = 2\r\n\tfactors = set()\r\n\twhile i*i <= number:\r\n\t\tif number%i != 0:\r\n\t\t\ti+=1\r\n\t\telse:\r\n\t\t\tnumber //= i\r\n\t\t\tfactors.add(i)\r\n\tif number>1:\r\n\t\tfactors.add(number)\r\n\treturn len(factors)\r\n\r\nn = int(input())\r\nnum = 0\r\nfor i in range(n+1):\r\n\tif distinct_prime_factors(i) == 2:\r\n\t\tnum += 1\r\nprint(num)", "# from time import time\n# from time import sleep\n\ndef isPrime(n) :\n if n == 0 or n == 1 : return False\n else :\n k = 2\n while k ** 2 < n :\n if n % k == 0 :\n return False\n k += 1\n if k ** 2 == n : return False\n return True\n\ndef factors(n , primes) :\n k = 0\n lst = []\n while n != 1 :\n if n % primes[k] == 0 :\n if primes[k] not in lst :\n lst.append(primes[k])\n n //= primes[k]\n else :\n k += 1\n return True if len(lst) == 2 else False\n\nif __name__ == \"__main__\" :\n # start = time()\n primes = []\n for i in range(3001) :\n if isPrime(i) :\n primes.append(i)\n n = int(input())\n count = 0\n for i in range(1,n+1) :\n if factors(i , primes) :\n count += 1\n print(count)\n # print(time() - start)\n", "n = int(input())\r\na = [0]*(n)\r\ni = 2\r\nc = []\r\nwhile i * i <= n:\r\n if a[i] == 0:\r\n for j in range(i*i, n, i):\r\n a[j] = 1\r\n i += 1\r\nfor i in range(2, n):\r\n if a[i] == 0:\r\n c.append(i)\r\nt2 = 0\r\nfor i in range(4, n + 1):\r\n j = 0\r\n t = 0\r\n while c[j] <= (i // 2):\r\n if i % c[j] == 0:\r\n t += 1\r\n j += 1\r\n if t == 2:\r\n t2 += 1\r\nprint(t2)", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nans = 0\r\n\r\nfor i in range(2, n + 1):\r\n x = i\r\n div = []\r\n j = 2\r\n while j * j <= i:\r\n if x % j == 0:\r\n while x % j == 0:\r\n x //= j\r\n div.append(j)\r\n j += 1\r\n if x > 1:\r\n div.append(x)\r\n if len(div) == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "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\n\r\ndef generate_primes(num):\r\n primes = [num for num in range(2, num + 1) if is_prime(num)]\r\n return primes\r\n\r\n\r\nans = 0\r\n\r\nn = int(input())\r\n\r\nlst = [0] * (n + 1)\r\n\r\nprime = generate_primes(n)\r\n\r\nfor i in range(1, n + 1):\r\n for j in prime:\r\n if i % j == 0:\r\n lst[i] += 1\r\n\r\nprint(lst.count(2))\r\n", "k=int(input())\r\nm=[]\r\nfor n in range(k) :\r\n\tlists=list(i for i in range (1,n+1) if n%i ==0 )\r\n\tp=(len(lists))\r\n\tif p==2 :\r\n\t\tm.append(n)\r\n#print(m)\r\nalmost_prime=[]\r\nfor x in range (1, k+1) :\r\n\tlists2=[]\r\n\tfor i in m :\r\n\t\tif x%i==0 :\r\n\t\t\tlists2.append(i)\r\n\tif len(lists2)==2 :\r\n\t\talmost_prime.append(x)\r\n#print(*almost_prime)\r\nprint(len(almost_prime))\r\n\t\r\n\t\r\n", "n = int(input())\r\n\r\ndef isPrime(n):\r\n aset = set()\r\n\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n aset.add(d)\r\n n //= d\r\n d += 1\r\n\r\n if n > 1:\r\n aset.add(n)\r\n\r\n return aset\r\nans = 0\r\nfor i in range(2 , n + 1):\r\n if len(isPrime(i)) == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ncount = 0\r\n\r\ndef almostPrime(n):\r\n d = 2\r\n primes = 0\r\n \r\n while d * d <= n:\r\n if n % d == 0:\r\n primes += 1\r\n \r\n while n % d == 0:\r\n n//=d\r\n \r\n if primes > 2:\r\n return False\r\n \r\n d+= 1\r\n \r\n if n > 1:\r\n primes += 1\r\n \r\n if primes == 2:\r\n return True\r\n \r\n return False\r\n\r\nfor i in range(2, n+1):\r\n # print(i)\r\n if almostPrime(i):\r\n count += 1\r\n \r\nprint(count)\r\n \r\n \r\n \r\n \r\n", "#SIEVE PRIME\r\nimport math\r\nx = int(input())\r\nprime = [0 for i in range(x+1)]\r\nm_prime = []\r\n\r\nfor i in range(2,x+1) :\r\n if prime[i] == 0 :\r\n for j in range(i+i,x+1,i) :\r\n prime[j] += 1\r\n\r\nfor i in range(2,x+1) :\r\n if prime[i] == 2 :\r\n m_prime.append(i)\r\nprint(len(m_prime))\r\n", "\nhi = int(input())\ncount = 0\n\ndict1 = {}\n\nfor i in range(2,hi+1):\n dict1[i] = 0\n\nfor j in range(2,hi+1):\n if not dict1[j]:\n for m in range(j,hi+1, j):\n dict1[m] += 1\n\nfor k in range(2,hi+1):\n if dict1[k] == 2:\n count +=1\n \nprint(count)", "from sys import stdin,stdout\nn = int(stdin.readline())\nprimes = [2]\nisprime = True\nresult = 0\ncount = 0\nfor i in range(3,n+1):\n if i % 2 == 0:\n continue\n for number in range(3,i):\n if i % number == 0:\n isprime = False\n break\n if isprime:\n primes.append(i)\n isprime = True\n\nfor i in range(1,n+1):\n if n <= 5:\n break\n for number in range(2,i):\n if i % number == 0 and number in primes:\n count += 1\n if count == 2:\n result += 1\n count = 0\nstdout.write(str(result))\n\t \t \t \t \t \t\t \t \t \t \t\t", "\r\nN = 3002\r\nsiv = [set() for _ in range(N)]\r\nfor i in range(2,N):\r\n\tif len(siv[i])==0:\r\n\t\tfor j in range(i,N,i):\r\n\t\t\tsiv[j] |= {i}\r\n\r\nn = int(input())\r\nprint(sum([ len(siv[i])==2 for i in range(n+1) ]))\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "n = int(input())\r\ncount = 0\r\n\r\nfor index in range(n + 1):\r\n fact = []\r\n d = 2\r\n \r\n while d * d <= index:\r\n while index % d == 0:\r\n fact.append(d)\r\n index //= d\r\n \r\n d += 1\r\n \r\n if index > 1:\r\n fact.append(index)\r\n \r\n if len(set(fact)) == 2:\r\n count += 1\r\n \r\nprint(count)", "n=3000\r\nprimes=[1]*(n+1)\r\nspf=[-1]*(n+1)\r\nprimes[1]=0\r\nfor i in range(2,n):\r\n j=i\r\n while i*j<=n:\r\n if primes[i*j]==1:\r\n primes[i*j]=0\r\n spf[i*j]=i\r\n j=j+1\r\n######################################\r\nk=int(input())\r\ncount=0\r\nfor n1 in range(2,k+1):\r\n dup=spf[n1]\r\n unique_cofactors={}\r\n unique_cofactors[dup]=1\r\n while spf[n1]!=-1:\r\n n1=n1//spf[n1]\r\n if spf[n1]!=-1:\r\n unique_cofactors[spf[n1]]=1\r\n else:\r\n break\r\n unique_cofactors[n1]=1\r\n unique_cofactors.pop(-1,None)\r\n if len(unique_cofactors)==2:\r\n count=count+1\r\nprint(count)", "n = int(input())\r\n\r\ndef almostPrime(x):\r\n d = 2\r\n fact = set()\r\n while d * d <= x:\r\n while x%d==0:\r\n fact.add(d)\r\n x//= d\r\n d +=1\r\n if x > 1:\r\n fact.add(x)\r\n return 1 if len(fact)==2 else 0\r\n \r\nans = 0\r\n\r\nfor i in range(2,n+1):\r\n ans += almostPrime(i)\r\n \r\nprint(ans)", "import math\n\ndef divisores(num):\n div = []\n i=1\n raiz=math.floor(math.sqrt(int(num)))\n while(raiz>math.pow(2,32)):\n raiz=math.floor(math.sqrt(int(raiz)))\n while(i<raiz+1):\n if int(num)%i ==0 and i not in div:\n div.append(i)\n if i != num and i != (int(num)//i):\n div.append((int(num)//i))\n i+= 1\n return div\n\ndef isprimo(num):\n div = divisores(num) \n if len(div) == 2:\n return num\n\n\nn = int(input())\nprimos = []\nc = 0\n\nfor i in range(1,n+1):\n if(isprimo(i)):\n primos.append(i)\n\nfor j in range(1,n+1):\n cont = 0\n r = divisores(j)\n for x in range(len(r)):\n if r[x] in primos and j not in primos:\n cont += 1\n if cont == 2:\n c +=1\nprint(c)\n \n\n\n\n\t \t\t\t\t \t\t\t\t \t \t \t \t\t \t \t", "n = int(input())\r\ndef factorization(n):\r\n \r\n d = 2\r\n ans = set()\r\n while d*d <= n:\r\n \r\n while n%d == 0:\r\n ans.add(d)\r\n n //= d\r\n d+=1\r\n if n> 1 :\r\n ans.add(n)\r\n return ans\r\ncount = 0\r\nfor i in range(2, n+1):\r\n \r\n \r\n arr = factorization(i)\r\n \r\n if len(arr) == 2:\r\n count +=1 \r\nprint(count)\r\n \r\n ", "primes= set()\r\n\r\nfor i in range(2,1500):\r\n primes.add(i)\r\n\r\nfor i in range(2,1500):\r\n for j in range(2*i,1500,i):\r\n primes.discard(j)\r\n\r\ni = int(input())\r\n\r\nsecondcount=0\r\nfor k in range(4,i+1):\r\n counter=0\r\n for j in primes:\r\n if(k%j==0):\r\n counter+=1\r\n if j>k/2:\r\n break\r\n if counter==2:\r\n secondcount+=1\r\nprint(secondcount)", "import math\r\ndef is_prime(x):\r\n if x == 2 :\r\n return True\r\n else:\r\n for i in range(2,math.ceil(math.sqrt(x))+1):\r\n if x % i == 0:\r\n return False\r\n return True\r\nn = int(input())\r\ncount = 0\r\nfor i in range(2,n+1):\r\n c = 0\r\n for j in range(2,i):\r\n if i % j == 0 and is_prime(j) == True:\r\n #print(i,j)\r\n c += 1\r\n if c == 2:\r\n # print(i,j)\r\n count += 1\r\nprint(count)\r\n ", "import math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n count = 0\r\n primes = []\r\n for i in range(2, n + 1):\r\n prime_factors = 0\r\n for prime in primes:\r\n if prime > math.sqrt(i) and prime_factors == 0:\r\n break\r\n if not i % prime:\r\n prime_factors += 1\r\n if prime_factors == 0:\r\n primes.append(i)\r\n elif prime_factors == 2:\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def isprime(n):\n if n == 2 or n == 3:\n return True\n if n % 2 == 0 or n < 2:\n return False\n for i in range(3, int(n ** 0.5) + 1, 2):\n if n % i == 0:\n return False\n\n return True\n\n\na = int(input())\nans = 0\nmas = []\ntek = 0\nfor i in range(1, a + 1):\n if isprime(i):\n mas.append(i)\n\nfor i in range(1, a + 1):\n for j in mas:\n if i % j == 0:\n tek += 1\n if tek == 2:\n ans += 1\n tek = 0\nprint(ans)\n", "def isPrime(x):\r\n primeCount = 0\r\n for y in range (1,x):\r\n if x%y == 0:\r\n primeCount += 1\r\n\r\n if primeCount == 1:\r\n return True\r\n\r\n return False\r\n\r\n\r\ndef factors(x):\r\n arr = []\r\n for z in range(2,x+1):\r\n if x%z == 0:\r\n arr.append(z)\r\n \r\n return arr\r\n \r\nn = int(input())\r\ncount = 0\r\nalmost = []\r\ndictio = {}\r\nfor x in range(2, n+1):\r\n dictio[x] = factors(x)\r\n\r\nfor x in range(2,n+1):\r\n count = 0\r\n for y in range(len(dictio[x])):\r\n if(isPrime(dictio[x][y])):\r\n count += 1\r\n if count == 2:\r\n almost.append(x) \r\n \r\n \r\nprint(len(almost))\r\n", "n=int(input())\r\n\r\n\r\ny=[]\r\n\r\ndef primefactor(num):\r\n x=[]\r\n \r\n while num%2==0:\r\n x.append(2)\r\n num=int(num/2)\r\n \r\n for i in range(3,int(num**(0.5))+1,2):\r\n \r\n while num%i==0:\r\n x.append(i)\r\n num=int(num/i)\r\n \r\n if num>2:\r\n x.append(num)\r\n \r\n if len(set(x))==2:\r\n y.append(1) \r\n \r\n \r\nfor num in range(2,n+1):\r\n primefactor(num)\r\n \r\nprint(len(y))", "def is_prime(n):\r\n for i in range(2, n - 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef is_almost_prime(n):\r\n prime_divisors = []\r\n for i in range(2, n):\r\n if n % i == 0 and is_prime(i):\r\n prime_divisors.append(i)\r\n if len(prime_divisors) == 2 and prime_divisors[0] != prime_divisors[1]:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(6, n + 1):\r\n if is_almost_prime(i):\r\n count += 1\r\nprint(count)\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\nn = readint()\r\n\r\nprimes = []\r\n\r\nfor num in range(2,3001):\r\n for i in range(2,num):\r\n if num % i == 0:\r\n break\r\n else:\r\n primes.append(num)\r\n\r\n\r\nans = 0\r\n\r\nfor num in range(1, n+1):\r\n curr = 0\r\n for prime in primes:\r\n if num % prime == 0:\r\n curr += 1\r\n \r\n if curr == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "def is_prime(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 return True\r\n\r\n\r\ndef count_prime_div(n):\r\n c = 0\r\n for i in range(2,n):\r\n if n % i == 0 and is_prime(i):\r\n c+=1\r\n return c\r\n\r\n\r\nn = int(input())\r\ncounter = 0\r\nfor i in range(1,n+1):\r\n if count_prime_div(i) == 2:\r\n counter+=1\r\nprint(counter)", "n = int(input())\nctt = {}\nfor i in range(2, n + 1):\n if i not in ctt:\n for j in range(2*i, n + 1, i):\n if j not in ctt:\n ctt[j] = 1\n else:\n ctt[j] += 1\ncant = list(ctt.values()).count(2)\nprint(cant)\n \t \t\t \t\t \t \t \t\t \t\t\t", "def count(pr,n):\r\n c=0\r\n i=0\r\n while n>1:\r\n if n%pr[i]==0:\r\n c+=1\r\n while n%pr[i]==0:\r\n n//=pr[i]\r\n i+=1 \r\n return c \r\ndef cal(n,pr):\r\n arr=[]\r\n for i in range(n):\r\n arr.append(count(pr,i))\r\n return arr\r\n\r\ndef sieve(n):\r\n arr=[True for i in range(n)]\r\n arr[0]=arr[1]=False\r\n for i in range(2,int((n)**0.5)+1):\r\n if arr[i]==True:\r\n for j in range(i*i,n,i):\r\n arr[i]=False \r\n for i in range(2,n):\r\n if arr[i]:\r\n print(i)\r\ndef linear_sieve(n):\r\n arr=[0 for i in range(n)]\r\n arr[0]=arr[1]=1\r\n pr=[]\r\n for i in range(2,n):\r\n if arr[i]==0:\r\n arr[i]=i \r\n pr.append(i)\r\n j=0\r\n while j<len(pr) and pr[j]*i<n and arr[i]>=pr[j]:\r\n arr[i*pr[j]]=pr[j]\r\n j+=1 \r\n return pr\r\n\r\ndef fib(n):\r\n if n==0:\r\n return 1,0 \r\n a,b=fib(n//2)\r\n y=b*(2*a-b)\r\n x=a*a+b*b \r\n m=10**9+7\r\n if n&1:\r\n return (x+y)%m,x%m \r\n return x%m,y%m\r\nm=int(int(input()))\r\nn=3010\r\nn=m+1\r\npr=linear_sieve(n)\r\n\r\narr=cal(n,pr)\r\nans=0\r\nfor i in range(m+1):\r\n if arr[i]==2:\r\n ans+=1 \r\nprint(ans)\r\n", "n = int(input())\ncount = 0\nfor b in range(1,n+1):\n a = []\n d = []\n for i in range(2,b+1):\n if b % i == 0:\n d.append(i)\n for j in d:\n if j == 2 or j % 2 != 0:\n if j not in a:\n for k in range(2,int(j ** 0.5) + 1):\n if j % k == 0:\n break\n else:\n a.append(j)\n if len(a) == 2:\n count += 1\nprint(count)\n\t \t \t\t \t \t\t \t\t\t\t \t \t\t", "m = int(input())\r\ncount = 0\r\n\r\ndef almost_prime(x):\r\n fact = set()\r\n div = 2\r\n \r\n while div*div <= x:\r\n \r\n while x%div==0:\r\n fact.add(div)\r\n x //= div\r\n div += 1\r\n if x > 1:\r\n fact.add(n)\r\n return 1 if len(fact)==2 else 0\r\n\r\nfor n in range(2,m+1):\r\n count += almost_prime(n)\r\nprint(count)\r\n \r\n", "#!/usr/bin/env pypy\r\nimport math\r\nx=int(input())\r\nc=0\r\ndef isprime(n):\r\n d=0\r\n for i in range(2,int(math.sqrt(n)+1),1):\r\n if(n%i==0):\r\n d+=1\r\n break\r\n if(d==0):\r\n return 1\r\n else:\r\n return 0\r\nwhile(x):\r\n l=[]\r\n for i in range(2,x,1):\r\n if(x%i==0):\r\n if(isprime(i)==1):\r\n l.append(i)\r\n l=list(dict.fromkeys(l))\r\n if(len(l)==2):\r\n c+=1\r\n x-=1\r\nprint(c)\r\n \r\n", "n = int(input())\r\nalPrime = []\r\nfor j in range(n + 1):\r\n primeNo = []\r\n i = 2\r\n while i * i <= j:\r\n if j % i == 0:\r\n primeNo.append(i)\r\n j = j // i\r\n else:\r\n i = i + 1\r\n if j > 1:\r\n primeNo.append(j)\r\n st = set(primeNo)\r\n if len(st) == 2:\r\n alPrime.append(j)\r\nprint(len(alPrime))", "def mkarr(arr, n):\n\tfor i in range(2, n):\n\t\tif not arr[i]:\n\t\t\tfor j in range(i+i, n, i):\n\t\t\t\tif arr[j] < 3:\n\t\t\t\t\tarr[j] += 1\n\treturn arr\n\ndef cnt2(arr):\n\tc = 0\n\tfor b in arr:\n\t\tif b == 2:\n\t\t\tc += 1\n\treturn c\n\nn = int(input())\narr = mkarr(bytearray(n+1), n+1)\nprint(cnt2(arr))\n", "# Happy Prime\r\n\r\nmaxn = 3000\r\nisPrime = [1] * (maxn + 1)\r\ndivCount = [0] * (maxn + 1)\r\nisPrime[0], isPrime[1] = 0, 0\r\ni = 2\r\nwhile i <= maxn:\r\n if isPrime[i] == 1:\r\n divCount[i] = 1\r\n j = 2\r\n while i * j <= maxn:\r\n divCount[i * j] += 1\r\n isPrime[i * j] = 0\r\n j += 1\r\n i += 1\r\n\r\nprefixHappy = [0] * (maxn+1)\r\nfor i in range(1, maxn+1):\r\n if divCount[i] == 2:\r\n prefixHappy[i] = prefixHappy[i-1] + 1\r\n else:\r\n prefixHappy[i] = prefixHappy[i-1]\r\n\r\nn = int(input())\r\nprint(prefixHappy[n])\r\n\r\n", "#!/usr/bin/env python\r\nn = int(input())\r\n\r\n\r\ndef prime(num):\r\n i = 2\r\n j = 0\r\n k = 1\r\n while num > 1:\r\n u = num % i == 0\r\n if u:\r\n while num > 1:\r\n num /= i # divisor extraction\r\n if num % i > 0:\r\n break\r\n if i == 3:\r\n k = 2 # skip even numbers\r\n i += k\r\n if u:\r\n j += 1\r\n if j > 2: # can't be almost prime\r\n return False\r\n return j == 2\r\n\r\n\r\ns = 0\r\nfor ia in range(6, n + 1):\r\n if prime(ia):\r\n s += 1\r\n\r\nprint(s)\r\n", "m = int(input())\r\n\r\ncount = 0\r\nfor num in range(1, m+1):\r\n d = 2\r\n aset = set()\r\n n = num\r\n while d*d <= n:\r\n while n%d == 0:\r\n aset.add(d)\r\n n//=d\r\n d += 1\r\n \r\n if n > 1:\r\n aset.add(n)\r\n\r\n if len(aset) == 2:\r\n count += 1\r\n \r\nprint(count)\r\n \r\n \r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(6,n+1):\r\n prime = []\r\n d = 2\r\n while d*d<=i:\r\n while i % d == 0:\r\n prime.append(d)\r\n i //= d \r\n d += 1\r\n if i > 1:\r\n prime.append(i)\r\n \r\n if len(set(prime))==2:\r\n count+=1\r\nprint(count)", "\r\nseive=[0]*(3005)\r\n#seive[1] = 1\r\nfor i in range(2,len(seive)):\r\n if seive[i] == 0:\r\n \r\n for j in range(i,len(seive),i):\r\n seive[j] +=1\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(2,n+1):\r\n if seive[i] == 2:\r\n count+=1\r\nprint(count)\r\n\r\n\r\n# n,m = map(int,input().split())\r\n\r\n# def gcd(a,b):\r\n# if b == 0:return a\r\n# return gcd(b,a%b)\r\n\r\n# a = list(map(int,input().split()))\r\n# b = list(map(int,input().split()))\r\n# pro = 1\r\n# for eel in a:\r\n# pro*=eel\r\n\r\n# pro1 = 1\r\n# for eel in b:\r\n# pro1*=eel\r\n\r\n# ans = gcd(pro,pro1)\r\n# print(pro//ans)\r\n# print(pro1//ans)\r\n", "n = int(input())\r\nans = 0\r\nfor nn in range(1, n+1):\r\n i = 2\r\n a = 0\r\n m=nn\r\n while i<=nn:\r\n if nn%i==0:\r\n a+=1\r\n while nn%i==0:\r\n nn/=i\r\n else:\r\n i += 1\r\n if a==2:\r\n ans+=1\r\nprint(ans)\r\n", "n=int(input())\r\nisPrime=[True]*(n+1)\r\nalmost_prime=[0]*(n+1)\r\nfor i in range(2,(n+1),1):\r\n if(isPrime[i]):\r\n for j in range(i*2,n+1,i):\r\n isPrime[j]=False\r\n almost_prime[j]+=1\r\n\r\n\r\ncount=0\r\nfor i in range(2,n+1):\r\n if(almost_prime[i]==2):\r\n count+=1\r\nprint(count)", "#!/usr/bin/env pypy3\n\nclass Sieve:\n def __init__(self, n=10**7):\n self.N = n\n\n s = [-1] * n\n for i in range(2, int(n**0.5)+1):\n if s[i] != -1: continue\n for j in range(i, n, i): \n if j > i: s[j] = i\n self.s = s\n \n def primes():\n return [i for i, e in enumerate(self.s) if e == -1 and i >= 2]\n\n def fastfactorize(self, n):\n assert(n <= self.N)\n\n ret = []\n\n while self.s[n] != -1:\n ret += [self.s[n]]\n n //= self.s[n]\n\n ret += [n]\n\n return ret\n\nsieve = Sieve()\nN = int(input())\n\nans = 0\nfor i in range(1, N+1):\n factors = sieve.fastfactorize(i)\n if len(set(factors)) == 2:\n ans += 1\n\nprint(ans)", "count = 0\r\n\r\nfor i in range(6, int(input())+1):\r\n primes = set()\r\n d = 2\r\n \r\n while d * d <= i:\r\n while i % d == 0:\r\n primes.add(d)\r\n i //= d\r\n \r\n if d != 2: \r\n d += 2\r\n else:\r\n d += 1\r\n \r\n if i > 1:\r\n primes.add(i)\r\n \r\n if len(primes) == 2:\r\n count += 1\r\n \r\nprint(count)", "n = int(input())\r\nlst = [0] * (n + 1)\r\ni = 2\r\nwhile i <= n//2:\r\n if lst[i] == 0:\r\n j = 1\r\n while(i * j <= n):\r\n lst[i * j] += 1\r\n j += 1\r\n i += 1\r\nprint(lst.count(2))", "\nimport math\n\n\ndef primegenerator(max):\n flags = [0, 0, 1]\n counter = 3\n while counter <= max:\n flags.append(1)\n counter += 1\n p = 2\n while p <= math.sqrt(max):\n crossOf(p, flags)\n p = nextPrime(p, flags)\n prime_numbers = []\n for i, v in enumerate(flags):\n if v == 1:\n prime_numbers.append(i)\n return prime_numbers\n\n\ndef crossOf(prime, flags):\n count = prime * prime\n while count < len(flags):\n flags[count] = 0\n count += prime\n\n\ndef nextPrime(prime, flags):\n if prime == 2:\n next_prime = prime + 1\n else:\n next_prime = prime + 2\n while next_prime < len(flags) and flags[next_prime] == 0:\n next_prime += 2\n return next_prime\n\n\ndef almostPrime(prime_numbers, max):\n if len(prime_numbers) < 2:\n return 0\n count = 0\n m = 6\n while m <= max:\n flag = True\n helper = 0\n for p in prime_numbers:\n if p > m:\n break\n elif m % p == 0:\n helper += 1\n elif helper > 2:\n flag = False\n break\n if flag and helper == 2:\n count += 1\n m += 1\n return count\n\n\nif __name__ == '__main__':\n num1 = int(input())\n prime_numbers = primegenerator(num1)\n print(almostPrime(prime_numbers, num1))\n", "def checkprime(n):\n arr = set()\n\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n arr.add(i)\n\n if len(arr)>2:\n return False\n\n while n%i==0:\n n/=i\n \n if n>1:\n arr.add(n)\n return len(arr)==2\n\n\nn = int(input())\ncount = 0\nfor i in range(1,n+1):\n count += checkprime(i)\n\nprint(count)", "sieve=[1]*3010\r\nsieve[0]=0\r\nsieve[1]=0\r\nfor i in range(2,3010):\r\n if(sieve[i]==1):\r\n j=i+i\r\n while j<3010:\r\n sieve[j]+=1\r\n j+=i\r\nans=0\r\nn=int(input())\r\nfor i in range(n+1):\r\n if(sieve[i]==3):\r\n ans+=1\r\nprint(ans)", "import math\r\n\r\nvalue = int(input())\r\ncount = 0\r\nfor num in range(1,value+1):\r\n arr = set()\r\n val =2\r\n while val * val <= num:\r\n if num % val ==0:\r\n arr.add(val)\r\n num = num//val\r\n else:\r\n val += 1\r\n if num != 1:\r\n arr.add(num)\r\n \r\n if len(arr) == 2:\r\n count += 1\r\nprint(count)", "n=3001\nseive=[0 for i in range(n+1)]\nalmost=[0 for i in range(n+1)]\ndef fun():\n for i in range(2,int(n**0.5)+1):\n for j in range(i*i,n,i):\n seive[j]=1\n for i in range(2,n+1):\n if(seive[i]==0):\n k=i*2\n for j in range(k,n+1,i):\n almost[j]+=1\nfun()\nt=int(input())\nc=0\nfor i in range(1,t+1):\n if(almost[i]==2):\n c+=1\nprint(c)\n\n ", "n = int(input())\r\nans = 0\r\nfor i in range(2,n+1):\r\n d,c = 2,[]\r\n while d * d <= i:\r\n while i % d == 0:\r\n if d not in c:c.append(d)\r\n i //= d\r\n d += 1\r\n \r\n if i>1:\r\n c.append(i)\r\n if len(c)==2:ans+=1\r\n # print(c,i)\r\nprint(ans)\r\n", "def isPrime(n):\r\n for x in range (2, n):\r\n if(n%x == 0):\r\n return False\r\n if(x > (n/2)):\r\n return True\r\n return True\r\n\r\ndef getDividors(n):\r\n res = []\r\n for x in range (2, n):\r\n if(n % x == 0):\r\n res.append(x)\r\n return res\r\nn = int(input())\r\nres = 0\r\nfor x in range(1, n+1):\r\n dividors = getDividors(x)\r\n amountOfDividors = 0\r\n for y in dividors:\r\n if(isPrime(y)):\r\n amountOfDividors += 1\r\n if(amountOfDividors == 2):\r\n res += 1\r\n\r\nprint(res)\r\n", "ile=int(input())\r\ni=2\r\nliczba_dzielników=[0]*(ile+1)\r\n\r\nwhile i<=ile:\r\n if liczba_dzielników[i]==0:\r\n for j in range(2,ile//i+1):\r\n liczba_dzielników[i*j]+=1\r\n i+=1\r\n \r\nprint(liczba_dzielników.count(2))", "from math import floor\r\nfrom math import sqrt\r\n\r\nn = int(input())\r\n\r\ndef y(a):\r\n x = floor(sqrt(a))\r\n c = 0\r\n for i in range(x):\r\n if a%(i + 1) == 0 and i + 1 != 1:\r\n c += 1\r\n while a %(i + 1) == 0:\r\n a /= (i + 1)\r\n if a != 1:\r\n c += 1\r\n return c == 2\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if(y(i + 1) == True):\r\n cnt+= 1\r\nprint(cnt)", "\r\ndef isAlmostPrime(num):\r\n ans = []\r\n d = 2\r\n while d*d <= num:\r\n curr = []\r\n while num%d == 0:\r\n curr.append(d)\r\n num//=d\r\n if curr: ans.append(curr[0])\r\n d += 1\r\n if num > 1:\r\n ans.append(num)\r\n if len(ans) == 2:\r\n return 1\r\n return -1\r\n\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(2, n+1):\r\n if isAlmostPrime(i) == 1:\r\n count += 1\r\n \r\n\r\nprint(count)\r\n ", "import math\r\n\r\ndef is_prime(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 almost_prime(n):\r\n count = 0\r\n i = 2\r\n while (i <= int(n/2)):\r\n if n % i == 0:\r\n if is_prime(i): count += 1\r\n i += 1\r\n if count == 2: return True\r\n else: return False\r\n\r\nn = int(input())\r\nresult = 0\r\nfor i in range(1, n+1):\r\n if almost_prime(i): result += 1\r\n \r\nprint(result)\r\n", "a = int(input())\r\nb = [2]\r\ncount = 0\r\ncount2 = 0\r\nfor x in range(3,3000):\r\n for y in range(2,x):\r\n if x%y == 0:\r\n break\r\n else:\r\n b.append(x)\r\nfor w in range(3,a+1):\r\n for l in b:\r\n if w%l == 0:\r\n count+=1\r\n if count == 2:\r\n count2+=1\r\n count = 0\r\nprint(count2)", "#code\r\ndef isprime(x):\r\n if x==1:\r\n return False\r\n else:\r\n i=2\r\n while(i*i<=x):\r\n if x%i==0:\r\n return False\r\n i+=1\r\n return True\r\n \r\nn=int(input())\r\n\r\nc=0\r\nfor i in range(1,n+1):\r\n count=0\r\n for j in range(1,i):\r\n if i%j==0:\r\n if isprime(j):\r\n count+=1\r\n if count==2:\r\n c+=1\r\nprint(c)\r\n", "from collections import defaultdict\nsieve = defaultdict(list)\n\nn = int(input())\n\nfor i in range(1, n+1):\n for j in range(i, n+1, i):\n sieve[j].append(i)\n\nalmostcounter = 0\n\n\nfor i in range(1, n+1):\n flag = False\n counter = 0\n if len(sieve[i]) > 2:\n for item in sieve[i]:\n if len(sieve[item]) == 2:\n counter += 1\n if counter == 2:\n almostcounter += 1\n\n\nprint(almostcounter)\n#print(sieve)\n\n\n\t\t \t\t \t\t \t\t\t\t \t \t \t \t\t\t\t", "def prime_factors(n):\r\n i = 2\r\n s = set()\r\n while n > 1:\r\n if n % i == 0:\r\n s.add(i)\r\n while n % i == 0:\r\n n = n // i\r\n else:\r\n i += 1\r\n return len(s)\r\n\r\n\r\n\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(1, n + 1):\r\n if prime_factors(i) == 2:\r\n cnt += 1\r\nprint(cnt)", "def almostPrime(n):\r\n s=set()\r\n for i in range(2,int(n**.5)+1):\r\n if n%i==0:\r\n s.add(i)\r\n if len(s)>2:\r\n return False\r\n while n%i==0:\r\n n/=i\r\n if n>1:\r\n s.add(n)\r\n return len(s)==2\r\nn=int(input())\r\ncnt=0\r\nfor i in range(1,n+1):\r\n cnt+=almostPrime(i)\r\nprint(cnt)\r\n", "n=int(input())\r\nx=[0]*(n+1)\r\nfor i in range (2,n+1):\r\n if x[i]==0:\r\n for j in range(2*i,n+1,i):\r\n x[j]+=1\r\nprint(x.count(2))", "import math\r\n\r\n\r\ndef sieve():\r\n list_of_prime = []\r\n n = int(input())\r\n prime = [1 for i in range(3001)]\r\n value = math.sqrt(3001)\r\n prime[0] = 0\r\n prime[1] = 0\r\n for i in range(2, int(value+1)):\r\n if prime[i] == 1:\r\n for j in range(i*i, 3001, i):\r\n prime[j] = 0\r\n for val in range(2, 3001):\r\n if prime[val]:\r\n list_of_prime.append(val)\r\n count = 0\r\n answer = 0\r\n for i in range(1, n+1):\r\n if i in list_of_prime:\r\n continue\r\n if i == 1:\r\n continue\r\n for j in list_of_prime:\r\n if j < i:\r\n if i % j == 0:\r\n count += 1\r\n else:\r\n continue\r\n else:\r\n break\r\n\r\n if count == 2:\r\n answer += 1\r\n count = 0\r\n else:\r\n count = 0\r\n continue\r\n\r\n # count = 0\r\n\r\n print(answer)\r\n\r\n\r\nsieve()", "def prime(n):\r\n if n<6:\r\n print(0)\r\n return\r\n if n<10:\r\n print(1)\r\n return\r\n arr = list(range(2, n + 1))\r\n brr=[0]*len(arr)\r\n count=0\r\n for i in range(len(arr)):\r\n p=arr[i]\r\n if p==False:\r\n continue\r\n for j in range(p*p,n+1,p):\r\n arr[j-2]=False\r\n brr[j-2]=j\r\n for i in range(len(brr)):\r\n if brr[i]!=0:\r\n c=set()\r\n d=brr[i]\r\n for j in arr:\r\n if j!=False:\r\n while d%j==0:\r\n d=d//j\r\n c.add(j)\r\n if len(c)==2 and d==1:\r\n count+=1\r\n break\r\n print(count)\r\n\r\nprime(int(input()))", "def isprime(n):\r\n return len([int(a) for a in range(1,n+1) if n%a==0]) == 2\r\n\r\ndef isalmost(n):\r\n return len([int(a) for a in range(1,n+1) if n%a == 0 and isprime(a)]) == 2\r\n\r\ncount = 0\r\nq = int(input())\r\nfor i in range(1,q+1):\r\n if isalmost(i):\r\n count+=1\r\n\r\nprint(count)", "n=int(input())\r\nans=0\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\nfor i in range(2,n+1):\r\n c=0\r\n if(not isprime(i)):\r\n for j in range(2,i):\r\n if(i%j==0 and isprime(j)):\r\n c+=1\r\n if(c==2):\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range(1,n + 1):\r\n \r\n dic = {}\r\n d = 2\r\n \r\n while d*d <= i:\r\n \r\n while i % d == 0:\r\n dic[d] = 1\r\n i = i //d\r\n if d==2:\r\n d+=1\r\n else:\r\n d+=2\r\n if i!=1:\r\n dic[i] = 1\r\n if len(dic) == 2:\r\n # print(check)\r\n count += 1\r\nprint(count)\r\n \r\n \r\n \r\n ", "from math import isqrt\r\ndef prime(num):\r\n for i in range(2, isqrt(num)+1):\r\n if not num%i:\r\n return False\r\n return True\r\n\r\ndef almost_pf(num):\r\n a=[]\r\n for i in range(2,num):\r\n if not num%i and prime(i):\r\n a.append(i)\r\n return len(a) == 2\r\n\r\nn = int(input())\r\nct=0\r\nfor i in range(1,n+1):\r\n if almost_pf(i):\r\n ct+=1\r\nprint(ct)\r\n", "def primefactors(n):\r\n d = {}\r\n i = 2 \r\n while i*i <= n:\r\n if n%i ==0:\r\n d[i] = 1\r\n while n%i == 0:\r\n n = n//i\r\n \r\n i+=1\r\n if n >= 2:\r\n d[n] = 1\r\n if len(d) == 2:\r\n return 1\r\n else:\r\n return 0\r\nn = int(input())\r\ncount = 0\r\nfor i in range(1,n+1):\r\n k = primefactors(i)\r\n count+=k\r\nprint(count)\r\n", "import math\n\n\nn = int(input())\n\ncounter = 0\n\ndef primeFactors(n):\n counter1 = 0\n \n if n % 2 == 0:\n counter1 += 1\n \n while n % 2 == 0:\n n /= 2\n \n for i in range(3, int(math.sqrt(n)) + 1, 2):\n if n % i == 0:\n counter1 += 1\n \n while n % i == 0:\n n /= i\n \n if n > 2:\n counter1 += 1\n\n return counter1\n\n\nfor j in range(1, n + 1):\n if primeFactors(j) == 2:\n counter += 1\n\nprint(counter)", "\r\nn = int(input())\r\nprime = []\r\n\r\n\r\nfor i in range(2 , n + 1):\r\n r = 0\r\n for j in range(2 , i):\r\n if i % j == 0 and i != j:\r\n r += 1\r\n if r == 0:\r\n prime.append(i)\r\n \r\ncnt = 0\r\n\r\nfor i in range(2 , n + 1):\r\n p = 0\r\n for j in range(2 , i + 1):\r\n if i % j == 0 and j in prime:\r\n p += 1\r\n if p == 2:\r\n cnt += 1\r\n \r\n \r\n \r\nprint(cnt)\r\n ", "import math\n\ndef primefactors(n,l):\n while n%2==0:\n if l.count(2)==0:\n \tl.append(2)\n n = n//2\n for i in range(3,int(math.sqrt(n))+1,2):\n while (n % i == 0):\n if l.count(i)==0:\n \tl.append(i)\n n = n//i\n if n > 2:\n l.append(n)\n return len(l)\n\nn=int(input())\nc=0\nfor i in range(6,n+1):\n\tif primefactors(i,[])==2:\n\t\tc+=1\nprint(c)\n\n", "t = int(input())\nl = [0]*(t+1)\nfor i in range(2, t+1):\n\tif l[i]==0:\n\t\tfor j in range(2*i, t+1, i):\n\t\t\tl[j]+=1\nprint(l.count(2))\n\t \t \t\t \t \t\t\t \t\t\t\t \t\t", "n=int(input())\r\nli=[0]*(n+1)\r\nfor i in range(2,(n//2)+1):\r\n if(li[i]==0):\r\n for j in range(i*2,n+1,i):\r\n li[j]+=1\r\nprint(li.count(2))", "n=int(input())\r\ndef prime(p):\r\n\tfor i in range(2,p):\r\n\t\tif p%i==0:\r\n\t\t\treturn False\r\n\treturn True\r\nm=0\t\r\nif n<6:\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(6,n+1):\r\n\t\ta=[]\r\n\t\tfor j in range(2,i):\r\n\t\t\tif i%j==0 and prime(j):\r\n\t\t\t\ta.append(j)\r\n\t\tif len(a)==2:\r\n\t\t\tm+=1\r\n\tprint(m)", "\nPrime = [2, 3]\nptr = 2\nfor i in range(5, 3501, 2):\n for j in range(ptr):\n if i % Prime[j] == 0:\n break\n else:\n Prime.append(i)\n ptr += 1\n\nwhile True:\n try:\n n = int(input())\n ans = 0\n for i in range(6, n + 1):\n count = 0\n for j in range(ptr):\n if Prime[j] <= i:\n if i % Prime[j] == 0:\n count += 1\n else:\n break\n if count == 2:\n ans += 1\n print(ans)\n except EOFError:\n break\n \t\t \t\t\t \t\t \t\t \t \t", "l = [0] * 3001\ni = 2\nwhile i < 3001:\n if l[i] == 0:\n for j in range(i,3001,i):\n l[j] += 1\n i += 1\nn = int(input())\nprint(l[:n+1].count(2))\n", "l=[1]*3001\r\nl[0]=l[1]=0\r\nfor i in range(2,3001):\r\n if l[i]==1:\r\n for j in range(i*i,3001,i):\r\n l[j]=0\r\n \r\n\r\n# for _ in range(int(input())):\r\nn=int(input())\r\ns=set()\r\nc=0\r\nr=0\r\nfor i in range(2,n+1):\r\n if l[i]==0:\r\n for j in range(2,int(i**0.5)+1):\r\n if i%j==0 and (i//j)!=j:\r\n if l[j]==1:\r\n c+=1\r\n if l[i//j]==1:\r\n c+=1\r\n if c==2:\r\n r+=1\r\n c=0\r\nprint(r) ", "N = int(input())\r\nans = 0\r\nfor i in range(1,N + 1):\r\n primes = []\r\n d = 2\r\n c = i\r\n while d * d <= i:\r\n \r\n while c % d == 0:\r\n primes.append(d)\r\n c //= d\r\n d += 1\r\n \r\n if c > 1:\r\n primes.append(c)\r\n\r\n\r\n if len(set(primes))== 2:\r\n ans += 1\r\nprint(ans)", "BIG=[0 for i in range(3001)]\r\nBIG[0]=1\r\nBIG[1]=1\r\nprime=[]\r\nfor i in range(len(BIG)):\r\n if BIG[i]==0:\r\n prime+=[i]\r\n for j in range(2*i,len(BIG),i):\r\n BIG[j]=1\r\nN=int(input())\r\nans=0\r\nfor i in range(1,N+1):\r\n count=0\r\n for x in prime:\r\n if i%x==0:\r\n count+=1\r\n if count>3:\r\n break\r\n if count==2:\r\n ans+=1\r\nprint(ans) \r\n ", "number = int(input())\r\n\r\ncount = 0\r\nfor n in range(number + 1):\r\n ans = []\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n ans.append(d)\r\n n = n // d\r\n d += 1\r\n if n > 1:\r\n ans.append(n)\r\n\r\n check = set(ans)\r\n if len(check) == 2:\r\n count += 1\r\nprint(count)", "n = int(input())\r\n\r\nx = 0\r\n\r\nfor i in range(2, n + 1):\r\n\ty = 0\r\n\t\r\n\tfor j in range(2, i + 1):\r\n\t\tif i % j == 0 and j != i ** 0.5:\r\n\t\t\tz = 0\r\n\t\t\t\r\n\t\t\tfor k in range(2, j):\r\n\t\t\t\tif j % k == 0:\r\n\t\t\t\t\tz += 1\r\n\t\t\t\t\tbreak\r\n\t\t\t\t\t\r\n\t\t\tif z == 0:\r\n\t\t\t\ty += 1\r\n\t\t\t\t\r\n\t\tif y == 3:\r\n\t\t\tbreak\r\n\t\t\t\t\r\n\tif y == 2:\r\n\t\tx += 1\r\n\t\t\r\nprint(x)", "from math import sqrt\r\n\r\n\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n for elem in range(2, int(sqrt(n)) + 1):\r\n if n % elem == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef is_semiprime(m):\r\n result = list()\r\n for i in range(2, m + 1):\r\n if m % i == 0 and is_prime(i):\r\n result.append(i)\r\n return result\r\n\r\n\r\nnumber = int(input())\r\na = list(range(1, number + 1))\r\ncount = 0\r\nfor elem in a:\r\n if len(is_semiprime(elem)) == 2:\r\n count += 1\r\nprint(count)\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\nresult = 0\r\n\r\nfor num in range(1, n + 1):\r\n count = Counter()\r\n divisor = 2\r\n \r\n while divisor * divisor <= num:\r\n \r\n while not num % divisor:\r\n count[divisor] = 1\r\n \r\n num //= divisor\r\n \r\n divisor += 1\r\n \r\n if num > 1:\r\n count[n] = 1\r\n \r\n if len(count.keys()) == 2:\r\n result += 1\r\n\r\nprint(result)", "def is_simple(s):\r\n for i in simple:\r\n if s%i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef find_simple(x):\r\n for i in range(2, x//2+1):\r\n if is_simple(i):\r\n simple.append(i)\r\n\r\n\r\ndef is_almost_simple(x):\r\n counter = 0\r\n for j in simple:\r\n if x%j == 0:\r\n counter += 1\r\n if counter == 3:\r\n return False\r\n if counter == 2:\r\n return True\r\n return False\r\n\r\n\r\n\r\nn = int(input())\r\nsimple = []\r\ncounter = 0\r\nfind_simple(n)\r\nfor i in range(1, n+1):\r\n if is_almost_simple(i):\r\n counter += 1\r\nprint(counter)\r\n", "from itertools import accumulate\r\nfrom collections import defaultdict\r\n\r\ndef I(): return int(input())\r\ndef ST(): return input()\r\ndef IL(): return list(map(int, input().split()))\r\ndef ILS(): return sorted(map(int, input().split()))\r\n\r\nn = I()\r\ncount = 0\r\nfor num in range(6,n+1):\r\n d = 2\r\n seen = set()\r\n while d*d <= num:\r\n while num%d == 0:\r\n seen.add(d)\r\n num //= d\r\n d += 1\r\n if num > 1:\r\n seen.add(num)\r\n if len(seen) == 2:\r\n count += 1\r\n \r\nprint(count)", "import math as m\r\ndef isprime(x):\r\n d = 2\r\n while d*d <= x:\r\n if x % d == 0:\r\n return False\r\n \r\n d += 1\r\n \r\n return True\r\n \r\ndef fun(x):\r\n primes = 0\r\n for i in range(2, x + 1):\r\n if x % i == 0 and isprime(i):\r\n primes += 1\r\n \r\n if primes == 2:\r\n return True\r\n \r\n return False\r\n \r\nn = int(input())\r\n\r\ncount = 0\r\nfor x in range(6, n + 1):\r\n if not isprime(x) and fun(x) == True:\r\n count += 1\r\n \r\nprint(count)", "def prime(n):\r\n for i in range(2,(n//2)+1):\r\n if(n%i==0):\r\n return 1 \r\n return 0\r\n\r\n\r\nn=int(input())\r\nl=0\r\nfor i in range(2,n+1):\r\n c=0\r\n for j in range(2,i):\r\n if(i%j==0):\r\n d=prime(j)\r\n if(d==0):\r\n c+=1 \r\n if(c==2):\r\n l+=1 \r\nprint(l)\r\n", "import math\r\n\r\nis_prime=[True]*30001\r\nprime=[]\r\ndef soe():\r\n for i in range(2,int(math.sqrt(3100))):\r\n if is_prime[i]==True:\r\n for j in range(i*i,3100,i):\r\n is_prime[j]=False\r\n for i in range(2,3100):\r\n if is_prime[i]:\r\n prime.append(i) \r\n \r\n\r\nif __name__==\"__main__\":\r\n n=int(input())\r\n cnt=0\r\n soe()\r\n l=dict.fromkeys(range(n+1),0)\r\n for i in prime:\r\n for j in range(i,n+1,i):\r\n l[j]+=1;\r\n for x,y in l.items(): \r\n if y==2:\r\n cnt+=1\r\n print(cnt) \r\n \r\n \r\n \r\n \r\n \r\n", "import math\r\nn=int(input())\r\ncount=0\r\ndef isprime(n):\r\n d=0\r\n for i in range(2,int(math.sqrt(n)+1),1):\r\n if(n%i==0):\r\n d+=1\r\n break\r\n if(d==0):\r\n return 1\r\n else:\r\n return 0\r\nwhile(n):\r\n lst=[]\r\n for i in range(2,n,1):\r\n if(n%i==0):\r\n if(isprime(i)==1):\r\n lst.append(i)\r\n lst=list(dict.fromkeys(lst))\r\n if(len(lst)==2):\r\n count+=1\r\n n-=1\r\nprint(count)", "import math\r\n\r\nn = int(input())\r\n\r\nk = [0]*(n+1)\r\nprimes = [True]*(n+1)\r\n\r\nfor i in range(n+1):\r\n if i%2 == 0:\r\n k[i] += 1\r\n primes[i] = False\r\n\r\nfor i in range(3, n, 2):\r\n if not primes[i]:\r\n continue\r\n \r\n for j in range(i+1, n+1):\r\n if j % i == 0:\r\n k[j] += 1\r\n primes[j] = False\r\nans = 0\r\n\r\nfor i in range(n+1):\r\n if k[i] == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(6, n + 1):\r\n divisors = 0\r\n for j in range(2, int(i ** 0.5) + 1):\r\n if i % j == 0:\r\n divisors += 1\r\n while i % j == 0:\r\n i //= j\r\n if i > 1:\r\n divisors += 1\r\n if divisors == 2:\r\n count += 1\r\nprint(count)", "n = int(input())\na, c = [0] * (n - 1), 0\nfor i in range(2, n + 1):\n if not a[i - 2]:\n for j in range(2 * i, n + 1, i):\n a[j - 2] += 1\nprint(a.count(2))", "def readln(inp=None): return tuple(map(int, (inp or input()).split()))\n\nn, = readln()\ndef check(d):\n i = 2\n while i * i <= d:\n if d % i == 0:\n return False\n i += 1\n return True\n\nsimple = [i for i in range(2, n + 1) if check(i)]\nans = 0\nfor i in range(len(simple)):\n for j in range(i + 1, len(simple)):\n for k in range(1, 11):\n if simple[i]**k > n:\n break\n for m in range(1, 11):\n if simple[i]**k * simple[j]**m <= n:\n ans += 1\n else:\n break\nprint(ans)\n", "def sieve(n):\n primes = [True] * (n + 1)\n primes[0] = False\n primes[1] = False\n for index, i in enumerate(primes):\n if i == True:\n for j in range(index * index, n + 1, index):\n primes[j] = False\n return primes\n\n\ndef main():\n n = int(input())\n arr = [0] * (n + 1)\n primes = sieve(n)\n for i, boolean in enumerate(primes):\n if boolean == True:\n for j in range(2 * i, n + 1, i):\n arr[j] += 1\n\n count = 0\n for i in arr:\n if i == 2:\n count += 1\n print(count)\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nanswer = 0\r\nansss = []\r\nfor x in range(1, n + 1):\r\n d = 2\r\n ans = 0\r\n saved = x\r\n while d // 2 <= x:\r\n\r\n if not x % d:\r\n \r\n while not x % d:\r\n \r\n x //= d\r\n \r\n ans += 1\r\n \r\n if ans > 2:\r\n break\r\n \r\n d += 1\r\n \r\n if ans == 2:\r\n answer += 1\r\n\r\nprint(answer)\r\n\r\n\r\n", "from fractions import Fraction\nimport sys\nsys.setrecursionlimit(1000*100)\n#c=int(input())\n#a,b=tuple(map(int,input().split()))\n#edges=dict((i,[]) for i in range(1,c+1))\n#children=filter(lambda x: x != p, edges[r])\n#cs.sort(key=lambda x:Fraction(x[0],x[1]),reverse=True)\n#if dp[r] is not None:\nn=int(input())\n\na=[0 for _ in range(0,n+1)]\n#print(a)\nret=0\nfor i in range(2,n+1):\n if a[i]==0:\n for j in range(2*i,n+1,i):\n a[j]+=1\n elif a[i]==2:\n ret+=1\n\n#print(a)\nprint(ret)\n\n\n\n", "\r\ndef isAlmostPrime(num):\r\n ans = []\r\n d = 2\r\n while d*d <= num:\r\n while num%d == 0:\r\n ans.append(d)\r\n num//=d\r\n d += 1\r\n if num > 1:\r\n ans.append(num)\r\n if len(set(ans)) == 2:\r\n return 1\r\n return -1\r\n\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(2, n+1):\r\n if isAlmostPrime(i) == 1:\r\n count += 1\r\n \r\n\r\nprint(count)\r\n ", "def sieve():\r\n prime = [1] * 3005\r\n prime[0] = prime[1] = 0\r\n almostprime = [0]*3005\r\n\r\n for i in range(2, 3001) :\r\n if prime[i] :\r\n j = 2*i\r\n while(j < 3001):\r\n prime[j] = 0\r\n almostprime[j] += 1\r\n j += i\r\n return almostprime\r\n\r\n\r\nalmnostPrime = sieve()\r\nans = 0\r\nn = int(input())\r\nfor i in range(n+1):\r\n if almnostPrime[i] == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "def Count(p):\r\n k = 0\r\n if p % 2 == 0:\r\n k += 1\r\n while p % 2 == 0:\r\n p //= 2\r\n i = 3\r\n while i <= p:\r\n if p % i == 0:\r\n k += 1\r\n while p % i == 0:\r\n p //= i\r\n i += 2\r\n return k\r\n\r\n\r\nn = int(input())\r\nc = 0\r\nfor i in range(3, n + 1):\r\n if Count(i) == 2:\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n factorization = []\r\n d = 2\r\n\r\n while d * d <= i:\r\n while i % d == 0:\r\n factorization.append(d)\r\n i //= d\r\n\r\n d += 1\r\n\r\n if i > 1:\r\n factorization.append(i)\r\n\r\n if len(set(factorization)) == 2:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\ncnt=0\r\nx=0\r\nfor r in range(4,n+1):\r\n v=r\r\n cnt=0\r\n for i in range(2,v-1):\r\n \r\n if(v%i==0):\r\n k=0\r\n for j in range(2,i-1):\r\n \r\n if(i%j==0):\r\n k+=1\r\n if(k==0):\r\n cnt+=1\r\n if(cnt==2):\r\n x+=1\r\nprint(x)\r\n \r\n", "def multiple(i):\r\n j = i \r\n while j <= n:\r\n yield j\r\n j += i\r\ndef find_factor(n):\r\n divisor = []\r\n for i in range(1,int(n**(1/2))+1):\r\n if n%i == 0:\r\n divisor.append(i)\r\n divisor.append(n//i)\r\n return set(divisor)\r\ncount = 0\r\nn = int(input())\r\nprime = [i for i in range(2,n+1)]\r\ntrue_prime = []\r\nwhile len(prime) > 0:\r\n # print(prime[0])\r\n true_prime.append(prime[0])\r\n cross = [a for a in multiple(prime[0])]\r\n prime = [i for i in prime if i not in cross]\r\n \r\nprime = [i for i in range(2,n+1)]\r\nfor n in prime:\r\n factor = find_factor(n)\r\n count = count + 1 if len([i for i in factor if i in true_prime]) == 2 else count\r\n\r\nprint(count)\r\n ", "n=int(input());\r\nprimes=[2];\r\n\r\nans=0;\r\nfor i in range(3,n+1):\r\n prime_divisor_count=0;\r\n x=i;\r\n for j in primes:\r\n if x%j==0:\r\n prime_divisor_count+=1;\r\n if prime_divisor_count<3:\r\n while x%j==0:\r\n x//=j;\r\n\r\n if prime_divisor_count==0:\r\n primes.append(i);\r\n elif prime_divisor_count==2:\r\n ans+=1;\r\n\r\n\r\nprint(ans);\r\n \r\n", "n=int(input())\r\nans=0\r\nv=[0]*(n+1)\r\nfor i in range(2,n+1):\r\n if(v[i]==0):\r\n for j in range(i,n+1,i):\r\n v[j]+=1\r\n if(v[i]==2):\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nsieve = [0 for i in range(n+1)]\r\nfor i in range(2,n+1):\r\n if(sieve[i]==0):\r\n x = 2*i\r\n while(x<=n):\r\n sieve[x]+=1\r\n x+=i\r\nc=0\r\nfor i in range(1,n+1):\r\n if(sieve[i]==2):\r\n c+=1\r\nprint(c)", "import math\r\ndef getPrimes(n):\r\n seive = [0 for i in range(n+1)]\r\n\r\n # 0 and 1 are not primes\r\n seive[0] = 1\r\n seive[1] = 1\r\n\r\n for i in range(2, int(math.sqrt(n))+1):\r\n if seive[i] == 0:\r\n for j in range(i, n+1):\r\n if j*i>n:\r\n break\r\n else:\r\n if seive[i*j]==0:\r\n seive[i*j] = 1\r\n res = []\r\n for i in range(len(seive)):\r\n if seive[i] == 0:\r\n res.append(i)\r\n return res\r\n\r\nn = int(input())\r\ntotPrimes = getPrimes(n)\r\ntot = 0\r\nfor i in range(1, n+1):\r\n count = 0\r\n if i not in totPrimes:\r\n for j in range(len(totPrimes)):\r\n if i%totPrimes[j] == 0:\r\n count+=1\r\n if count > 2:\r\n break\r\n if count == 2:\r\n tot+=1\r\nprint(tot)\r\n", "# Har har mahadev #\r\n#author : @harsh kanani\r\n\r\ndef sieveoferatosthenes(n, primes):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while p*p <= n:\r\n if prime[p] == True:\r\n for i in range(p*p,n+1,p):\r\n prime[i] = False\r\n p += 1\r\n\r\n for i in range(2, n+1):\r\n if prime[i]:\r\n primes.append(i)\r\n\r\ndef primedivisors(n):\r\n primes = []\r\n sieveoferatosthenes(n, primes)\r\n count = 0\r\n for i in range(1, n+1):\r\n c = 0\r\n for j in primes:\r\n if i%j==0:\r\n c += 1\r\n if c==2:\r\n count += 1\r\n return count\r\n\r\n\r\n\r\n#DRIVER CODE\r\nn = int(input())\r\nprint(primedivisors(n))", "from collections import Counter\r\n\r\ninteger = int(input())\r\ncount=0\r\n\r\nfor i in range(1,integer+1):\r\n arr=[]\r\n d=2\r\n while d*d<=i:\r\n while i%d==0:\r\n arr.append(d)\r\n i//=d\r\n \r\n d+=1\r\n \r\n if i>1:\r\n arr.append(i)\r\n \r\n amount = Counter(arr)\r\n if len(amount)==2:\r\n count+=1\r\n \r\nprint(count)", "# Python program to print prime factors\n\nimport math\n\n# A function to print all prime factors of\n# a given number n\ndef primeFactors(n):\n\n # Print the number of two's that divide n\n while n % 2 == 0:\n if(len(factors) == 0):\n factors.append(2)\n elif(factors[len(factors)-1] != 2):\n factors.append(2)\n n = n // 2\n\n # n must be odd at this point\n # so a skip of 2 ( i = i + 2) can be used\n for i in range(3, int(math.sqrt(n)) + 1, 2):\n\n # while i divides n , print i ad divide n\n while n % i == 0:\n if (len(factors) == 0):\n factors.append(i)\n elif (factors[len(factors) - 1] != i):\n factors.append(i)\n n = n // i\n\n # Condition if n is a prime\n # number greater than 2\n if n > 2:\n if (len(factors) == 0):\n factors.append(n)\n elif (factors[len(factors) - 1] != n):\n factors.append(n)\n\n# Driver Program to test above function\n\nn = int(input())\ncount = 0\nfor idx in range(n):\n factors = []\n primeFactors(idx+1)\n if len(factors) == 2:\n count += 1\n\nprint(count)\n\n# This code is contributed by Harshit Agrawal\n \t\t\t\t\t\t \t \t\t \t\t \t\t\t\t \t\t \t \t", "\r\ndef solve(n):\r\n\r\n s = set()\r\n t = 2\r\n\r\n while n != 1 :\r\n while n % t == 0 :\r\n s.add(t)\r\n n //= t\r\n\r\n else:\r\n t +=1\r\n\r\n if len(s) > 2 :\r\n return 0\r\n\r\n\r\n if len(s) == 2 :\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nn = int(input())\r\ncount = 0\r\n\r\nfor i in range(1 ,n+1):\r\n count += solve(i)\r\n\r\nprint(count)", "# Wadea #\r\n\r\narr = list({2, 3, 5, 2053, 7, 11, 13, 2063, 17, 19, 2069, 23, 29, 31, 2081, 2083, 37, 2087, 41, 2089, 43, 47, 2099, 53, 59, 61, 2111, 2113, 67, 71, 73, 79, 2129, 83, 2131, 89, 2137, 2141, 2143, 97, 101, 103, 2153, 107, 109, 113, 2161, 127, 131, 2179, 137, 139, 149, 151, 2203, 157, 2207, 163, 2213, 167, 173, 2221, 179, 181, 2237, 191, 2239, 193, 2243, 197, 199, 2251, 211, 2267, 2269, 223, 2273, 227, 229, 233, 2281, 239, 2287, 241, 2293, 2297, 251, 257, 2309, 263, 2311, 269, 271, 277, 281, 283, 2333, 2339, 293, 2341, 2347, 2351, 307, 2357, 311, 313, 317, 2371, 2377, 331, 2381, 2383, 337, 2389, 2393, 347, 349, 2399, 353, 359, 2411, 367, 2417, 373, 2423, 379, 383, 389, 2437, 2441, 397, 2447, 401, 409, 2459, 419, 2467, 421, 2473, 2477, 431, 433, 439, 443, 449, 2503, 457, 461, 463, 467, 2521, 479, 2531, 487, 491, 2539, 2543, 499, 2549, 503, 2551, 509, 2557, 521, 523, 2579, 541, 2591, 2593, 547, 557, 2609, 563, 569, 2617, 571, 2621, 577, 2633, 587, 593, 599, 2647, 601, 607, 2657, 2659, 613, 2663, 617, 619, 2671, 2677, 631, 2683, 2687, 641, 2689, 643, 2693, 647, 2699, 653, 659, 2707, 661, 2711, 2713, 2719, 673, 677, 2729, 683, 2731, 691, 2741, 701, 2749, 2753, 709, 719, 2767, 727, 2777, 733, 739, 2789, 743, 2791, 2797, 751, 2801, 2803, 757, 761, 769, 2819, 773, 2833, 787, 2837, 2843, 797, 2851, 809, 2857, 811, 2861, 821, 823, 827, 829, 2879, 839, 2887, 2897, 853, 2903, 857, 859, 2909, 863, 2917, 877, 2927, 881, 883, 887, 2939, 2953, 907, 2957, 911, 2963, 919, 2969, 2971, 929, 937, 941, 947, 2999, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039})\r\n\r\nn = int(input())\r\nc = 0\r\nans = 0\r\n\r\nfor i in range(2,n+1):\r\n c = 0\r\n for j in arr:\r\n if i % j == 0:\r\n c += 1\r\n if c == 2:\r\n ans += 1\r\nprint(ans)\r\n", "import math\r\n\r\nn = int(input())\r\ntotal = 0\r\n\r\nfor cur in range(2, n + 1):\r\n\r\n right = math.ceil(math.sqrt(cur))\r\n arr = set()\r\n\r\n for num in range(2, right):\r\n\r\n while cur % num == 0:\r\n arr.add(num)\r\n cur //= num\r\n \r\n if cur > 1:\r\n arr.add(n)\r\n \r\n if len(arr) == 2:\r\n total += 1\r\n\r\nprint(total)\r\n \r\n\r\n", "def is_prime(a):\r\n for i in range(2,a):\r\n if a % i == 0:\r\n return False\r\n return True\r\ndef is_almost_prime(a):\r\n h = 0\r\n for i in range(2,a):\r\n if a % i == 0 and is_prime(i):\r\n h+=1\r\n return h == 2\r\nj = 0\r\nn = int(input())\r\nfor i in range(1,n+1):\r\n if is_almost_prime(i):\r\n j+=1\r\nprint(j)\r\n", "from collections import defaultdict as di \r\nimport copy\r\nimport math\r\nsieve=[1]*(10**4)\r\nsieve[0]=0\r\nsieve[1]=0\r\ni=2\r\nwhile(i*i<(10**4)):\r\n if sieve[i]==1:\r\n j=i\r\n while(i*j<(10**4)):\r\n sieve[i*j]=0\r\n j+=1\r\n i+=1\r\n#c=0\r\ndef solve(n):\r\n c=0\r\n for i in range(2,n+1):\r\n if n%i==0 and sieve[i]:\r\n c+=1\r\n if c==2:\r\n return True\r\n else:\r\n return False\r\nn=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n if solve(i):\r\n c+=1\r\nprint(c)\r\n\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n num = i\r\n d = 2\r\n primes = []\r\n while d * d <= num:\r\n \r\n \r\n while not num % d:\r\n \r\n primes.append(d)\r\n num//= d\r\n d += 1\r\n if num > 1:\r\n primes.append(num)\r\n \r\n if len(set(primes)) == 2:\r\n count += 1\r\nprint(count)", "\r\ndef fact(n):\r\n factorization = set()\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n factorization.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n factorization.add(n)\r\n \r\n return len(factorization)\r\n\r\nnum = int(input())\r\ncount = 0\r\n\r\nfor i in range(1, num+1):\r\n if fact(i) == 2:\r\n count += 1\r\nprint(count) ", "n = int(input())\r\nprime = []\r\ndef isPrime(x: int) -> bool:\r\n d = 2\r\n while d * d <= x:\r\n if x % d == 0:\r\n return False\r\n d += 1\r\n return True\r\n\r\nfor i in range(2,n):\r\n if isPrime(i) == True:\r\n prime.append(i)\r\n\r\nans = []\r\nfor i in range(1, n+1):\r\n coun = 0\r\n for j in prime:\r\n if j > i:\r\n break\r\n\r\n if i % j == 0:\r\n coun += 1\r\n\r\n if coun == 2:\r\n ans.append(i)\r\n\r\nprint(len(ans))\r\n", "from collections import defaultdict\r\nn = int(input())\r\ncount = 0\r\nfor num in range(n+1):\r\n d = 2\r\n dic = defaultdict(int)\r\n while (d **2) <= num:\r\n while num % d == 0:\r\n dic[d] += 1\r\n num = num/d\r\n d += 1\r\n if num > 1:\r\n dic[num] += 1\r\n if len(dic)== 2:\r\n count += 1\r\nprint(count)", "import os\r\n\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ndef get_primes(max_prime):\r\n primes = [True] * (max_prime + 1)\r\n primes[1] = False\r\n for i in range(2, max_prime + 1):\r\n x = i + i\r\n while x <= max_prime:\r\n primes[x] = False\r\n x += i\r\n p = set()\r\n for i in range(2, max_prime + 1):\r\n if primes[i]:\r\n p.add(i)\r\n return p\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n n = inp()\r\n primes = get_primes(n)\r\n ans = 0\r\n for x in range(2, n + 1):\r\n cnt = 0\r\n for i in range(1, int(x / 2) + 1):\r\n if i in primes and x % i == 0:\r\n cnt += 1\r\n if cnt > 2:\r\n break\r\n if cnt == 2:\r\n ans += 1\r\n # print(x)\r\n print(ans)\r\n", "def sieve(n):\n prime = [True for i in range(n+1)]\n p = 2\n while (p * p <= n):\n if (prime[p]):\n\n for i in range(p * p, n+1, p):\n prime[i] = False\n p += 1\n\n primes = []\n\n for p in range(2, n+1):\n if prime[p]:\n primes.append(p)\n\n return primes\n\n\ndef get_prime_factors(n):\n prime_factors = {}\n for prime in primes:\n while n % prime == 0:\n n //= prime\n if prime in prime_factors:\n prime_factors[prime] += 1\n else:\n prime_factors[prime] = 1\n return prime_factors\n\n\nn = int(input())\nprimes = sieve(n)\n\nans = 0\nfor i in range(6, n + 1):\n if len(get_prime_factors(i)) == 2:\n ans += 1\n \nprint(ans)\n\n\t\t\t\t\t \t\t\t\t\t\t\t\t \t\t\t \t \t\t \t\t \t", "import math\r\n\r\nprimes = set()\r\n\r\nfor i in range(3000):\r\n prime = True\r\n for j in range(2, i):\r\n if i % j == 0:\r\n prime = False\r\n break\r\n if prime:\r\n primes.add(i)\r\n\r\n\r\ndef divisors(n):\r\n divs = []\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n divs.extend([i, n // i])\r\n return set(divs)\r\n\r\n\r\nn = int(input())\r\nans = 0\r\n\r\nfor i in range(n + 1):\r\n cnt = 0\r\n for v in divisors(i):\r\n if v in primes:\r\n cnt += 1\r\n if cnt == 2:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n factors = set()\r\n x = 2\r\n \r\n while x * x <= i:\r\n if i % x == 0:\r\n factors.add(x)\r\n i //= x\r\n else:\r\n x += 1\r\n \r\n if i != 1:\r\n factors.add(i)\r\n \r\n if len(factors) == 2:\r\n ans += 1\r\n \r\nprint(ans)", "# about prime\r\nimport math\r\nx = int(input())\r\ncount = 0\r\ndef pd(n):\r\n l=[]\r\n global count\r\n i = 2\r\n while (i<= math.sqrt(n)):\r\n if (n%i == 0):\r\n l.append(i)\r\n while (n%i == 0):\r\n n /= i\r\n i += 1\r\n if (n>1):\r\n l.append(n)\r\n if len(l) == 2:\r\n count += 1\r\nfor k in range(1,x+1):\r\n pd(k)\r\nprint(count)", "n = int(input())\r\n\r\ncount = 0\r\nfor i in range(1,n+1):\r\n \r\n d = 2\r\n factors = set()\r\n while d * d <= i:\r\n while i % d == 0:\r\n factors.add(d)\r\n \r\n i //= d\r\n \r\n d += 1\r\n \r\n if i > 1:\r\n factors.add(i)\r\n if len(factors) == 2:\r\n count += 1\r\n \r\nprint(count)", "def prime(n):\r\n for j in range(2, int(pow(n, 0.5) + 1)):\r\n if n % j == 0:\r\n return False\r\n return True\r\nnums = [2]\r\nfor j in range(3, 3001, 2):\r\n if prime(j) == True:\r\n nums.append(j)\r\ndef al_prime(n):\r\n count = 0\r\n for j in range(len(nums)):\r\n if n % nums[j] == 0:\r\n count += 1\r\n if count > 2:\r\n return False\r\n if nums[j] > n:\r\n break\r\n return count == 2\r\ncount = 0\r\nfor j in range(2, int(input()) + 1):\r\n if al_prime(j) == True:\r\n count += 1\r\nprint(count)\r\n", "def I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\n\r\n\r\n\r\ncount = 0\r\n \r\nfor n in range(1,I()+1):\r\n \r\n d = 2 \r\n lis:list[int] = []\r\n \r\n while d*d < n:\r\n while n%d == 0:\r\n lis.append(d)\r\n n //= d \r\n \r\n d += 1 \r\n if n > 1:\r\n lis.append(n)\r\n \r\n if len(set(lis)) == 2:\r\n count += 1\r\n \r\n \r\n\r\nprint(count)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n", "n = int(input())\r\n\r\ncount = 0\r\nfor i in range(6,n+1):\r\n result = {}\r\n d = 2\r\n found = False\r\n num = i\r\n while d * d <= num:\r\n while num % d == 0:\r\n result[d] = 1\r\n num //= d\r\n d += 1\r\n \r\n if num != 1:\r\n result[num] = 1\r\n if len(result) == 2:\r\n count += 1\r\n \r\nprint(count)", "def Pn(n):\r\n\tbo = 1\r\n\tif n <= 1:\r\n\t\tbo = 0\r\n\telif n > 3:\r\n\t\ti = 2\r\n\t\twhile i <= int(n/2):\r\n\t\t\tif n%i == 0:\r\n\t\t\t\tbo = 0\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\ti += 1\r\n\treturn bo\r\n\t\r\ndef APn(n):\r\n\tdem = 0\r\n\ti = 1\r\n\twhile i <= n:\r\n\t\tif n%i == 0 and Pn(i) == 1:\r\n\t\t\tdem += 1\r\n\t\ti += 1\r\n\treturn dem\r\n\r\ndef SAPn(n):\r\n\tdem = 0\r\n\tfor i in range(1, n+1):\r\n\t\tif APn(i) == 2:\r\n\t\t\tdem += 1\r\n\treturn dem\r\n\r\nn = int(input())\r\nprint(SAPn(n))", "test = int(input())\r\ntotal = 0\r\nfor n in range(2, test + 1):\r\n\r\n factorization = set()\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n factorization.add(d)\r\n if len(factorization) > 2:\r\n break\r\n n //= d\r\n d += 1\r\n\r\n if n > 1:\r\n factorization.add(n)\r\n\r\n if len(factorization) == 2:\r\n total += 1\r\n\r\nprint(total)\r\n", "from math import sqrt\r\nn=int(input())\r\nl=[1]*(3000+3)\r\nfor i in range(2,int(sqrt(3000+2))+1):\r\n\tif l[i]==1:\r\n\t\tfor j in range(i*i,3000+2,i):\r\n\t\t\tl[j]=0\r\ns=[]\r\nfor i in range(2,3000+1):\r\n\tif l[i]==1:\r\n\t\ts.append(i)\r\nd={}\r\nfor i in s:\r\n\tif i<1500:\r\n\t\td[i]=[i]\r\n\t\tt=i*i\r\n\t\twhile t<3000+1:\r\n\t\t\td[i].append(t)\r\n\t\t\tt=t*i\r\nx=set()\r\nfor i in d:\r\n\tfor j in d:\r\n\t\tif i!=j:\r\n\t\t\tfor k in d[i]:\r\n\t\t\t\tfor q in d[j]:\r\n\t\t\t\t\tx.add(k*q)\r\ncount=0\r\nfor i in list(x):\r\n\tif i<=n:\r\n\t\tcount+=1\r\nprint(count)", "count=0\r\nfor t in range(6,int(input())+1):\r\n x=set()\r\n i=2\r\n while i*i<=t:\r\n while(t%i==0):\r\n x.add(i)\r\n t/=i\r\n i+=1\r\n if t!=1:\r\n x.add(t)\r\n if len(x)==2:\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\ncount = 0\r\nif n < 6:\r\n print(0)\r\nelse:\r\n for t in range(6, n + 1):\r\n i = 2\r\n mass = []\r\n t1 = t\r\n while i * i <= t1:\r\n while t % i == 0:\r\n mass.append(i)\r\n t //= i\r\n i += 1\r\n if t != 1:\r\n mass.append(t)\r\n if len(set(mass)) == 2:\r\n count += 1\r\n print(count)\r\n", "def p(n):\r\n x=True\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n x=False\r\n break\r\n return x\r\ndef alprime(n):\r\n x=0\r\n if (n**(1/3))%1==0:\r\n return False\r\n for i in range(2,(n//2)+1):\r\n if n%i==0 and p(i):\r\n x+=1\r\n if x>2:\r\n return False\r\n return x==2\r\nn=int(input())\r\no=0\r\nfor i in range(6,n+1):\r\n if alprime(i):\r\n o+=1\r\nprint(o)", "import math\r\n\r\ndef isPrime(x):\r\n if(x<2):\r\n return False\r\n q=int(math.sqrt(x))\r\n for i in range(2,q+1):\r\n if(x%i==0):\r\n return False\r\n return True\r\n \r\nn=int(input())\r\nres=0\r\nfor i in range(1,n+1):\r\n cnt=0\r\n q=int(math.sqrt(i))\r\n for j in range(1,q+1):\r\n if(i%j==0):\r\n if(isPrime(j)): cnt+=1\r\n if(isPrime(i/j) and j*j!=i): cnt+=1\r\n if(cnt==2):\r\n res+=1\r\nprint(res)", "n = int(input())\r\ncnt = [0] * (n + 1)\r\ni = 2\r\nprime = [0] * (n + 1)\r\nwhile i <= n:\r\n if not(prime[i]):\r\n j = i\r\n while j <= n:\r\n prime[j] = 1\r\n cnt[j] += 1\r\n j += i\r\n i += 1\r\n\r\nans = 0\r\nfor i in range(n + 1):\r\n ans += (cnt[i] == 2)\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\n\r\ndef prime(x):\r\n for _ in range(2, x):\r\n if x % _ == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(2, n+1):\r\n factors = 0\r\n flag = 1\r\n for j in range(2, i+1):\r\n if i % j == 0 and prime(j):\r\n factors += 1\r\n if factors > 2:\r\n flag = 0\r\n break\r\n if flag == 1 and factors == 2:\r\n count += 1\r\nprint(count)\r\n", "import math\r\nn = int(input())\r\ncount = 0\r\nfor i in range(6, n + 1):\r\n prime_factors = set()\r\n prime = 2\r\n num = i\r\n while prime <= i // 2:\r\n if num % prime == 0:\r\n prime_factors.add(prime)\r\n num = num // prime\r\n else:\r\n prime += 1\r\n \r\n if len(prime_factors) == 2:\r\n count += 1\r\n \r\nprint(count)", "import math\r\n\r\ndef IsPrime(x):\r\n for i in range(2,int(math.sqrt(x))+1):\r\n if not x%i:\r\n return False\r\n return True\r\n\r\nn=int(input())\r\na=[]\r\nc=0\r\nfor i in range(2,n+1):\r\n if IsPrime(i):\r\n a.append(i)\r\nfor i in range(1,n+1):\r\n j=0\r\n d=[]\r\n while i > 1:\r\n if i%a[j] != 0:\r\n j=j+1\r\n else:\r\n i=i/a[j]\r\n if a[j] not in d:\r\n d.append(a[j])\r\n if len(d)==2:\r\n c=c+1\r\nprint(c)\r\n\r\n\r\n", "def factorNumber(n):\r\n d = 2\r\n factors = set()\r\n while d*d <= n:\r\n while n % d == 0:\r\n factors.add(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n factors.add(d)\r\n return factors\r\n\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(2,n+1):\r\n if len(factorNumber(i)) == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "from math import sqrt\r\nclass Solution:\r\n def countPrimes(self, n):\r\n prime_array = [0]*(n+1)\r\n #count_array = [0]*(n+1)\r\n count=0\r\n for i in range(2,(n//2)+1):\r\n if prime_array[i]==0:\r\n for j in range(2,(n//i)+1):\r\n prime_array[i*j]+=1\r\n \r\n for i in range(2,n+1):\r\n if prime_array[i]==2:\r\n count+=1\r\n return count\r\nval = int(input())\r\na = Solution()\r\nprint(a.countPrimes(val))\r\n", "def count_almost_primes(n):\n # Função para checar se um número é primo\n def is_prime(num):\n if num < 2:\n return False\n for i in range(2, int(num ** 0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n # Contagem de divisores primos para cada número\n almost_primes = [0] * (n + 1)\n for i in range(2, n + 1):\n if is_prime(i):\n for j in range(i, n + 1, i):\n almost_primes[j] += 1\n\n count = sum(1 for x in almost_primes if x == 2)\n return count\n\nn = int(input()) # Recebe o valor de n\nresult = count_almost_primes(n)\nprint(result)\n\n\t\t\t \t \t \t \t\t \t \t\t\t\t \t\t \t\t \t\t\t\t\t", "m=0\na=[2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83 , 89 , 97 , 101 , 103 , 107 , 109 , 113 , 127 , 131 , 137 , 139 , 149 , 151 , 157 , 163 , 167 , 173 , 179 , 181 , 191 , 193 , 197 , 199 , 211 , 223 , 227 , 229 , 233 , 239 , 241 , 251 , 257 , 263 , 269 , 271 , 277 , 281 , 283 , 293 , 307 , 311 , 313 , 317 , 331 , 337 , 347 , 349 , 353 , 359 , 367 , 373 , 379 , 383 , 389 , 397 , 401 , 409 , 419 , 421 , 431 , 433 , 439 , 443 , 449 , 457 , 461 , 463 , 467 , 479 , 487 , 491 , 499 , 503 , 509 , 521 , 523 , 541 , 547 , 557 , 563 , 569 , 571 , 577 , 587 , 593 , 599 , 601 , 607 , 613 , 617 , 619 , 631 , 641 , 643 , 647 , 653 , 659 , 661 , 673 , 677 , 683 , 691 , 701 , 709 , 719 , 727 , 733 , 739 , 743 , 751 , 757 , 761 , 769 , 773 , 787 , 797 , 809 , 811 , 821 , 823 , 827 , 829 , 839 , 853 , 857 , 859 , 863 , 877 , 881 , 883 , 887 , 907 , 911 , 919 , 929 , 937 , 941 , 947 , 953 , 967 , 971 , 977 , 983 , 991 , 997 , 1009 , 1013 , 1019 , 1021 , 1031 , 1033 , 1039 , 1049 , 1051 , 1061 , 1063 , 1069 , 1087 , 1091 , 1093 , 1097 , 1103 , 1109 , 1117 , 1123 , 1129 , 1151 , 1153 , 1163 , 1171 , 1181 , 1187 , 1193 , 1201 , 1213 , 1217 , 1223 , 1229 , 1231 , 1237 , 1249 , 1259 , 1277 , 1279 , 1283 , 1289 , 1291 , 1297 , 1301 , 1303 , 1307 , 1319 , 1321 , 1327 , 1361 , 1367 , 1373 , 1381 , 1399 , 1409 , 1423 , 1427 , 1429 , 1433 , 1439 , 1447 , 1451 , 1453 , 1459 , 1471 , 1481 , 1483 , 1487 , 1489 , 1493 , 1499 , 1511 , 1523 , 1531 , 1543 , 1549 , 1553 , 1559 , 1567 , 1571 , 1579 , 1583 , 1597 , 1601 , 1607 , 1609 , 1613 , 1619 , 1621 , 1627 , 1637 , 1657 , 1663 , 1667 , 1669 , 1693 , 1697 , 1699 , 1709 , 1721 , 1723 , 1733 , 1741 , 1747 , 1753 , 1759 , 1777 , 1783 , 1787 , 1789 , 1801 , 1811 , 1823 , 1831 , 1847 , 1861 , 1867 , 1871 , 1873 , 1877 , 1879 , 1889 , 1901 , 1907 , 1913 , 1931 , 1933 , 1949 , 1951 , 1973 , 1979 , 1987 , 1993 , 1997 , 1999 , 2003 , 2011 , 2017 , 2027 , 2029 , 2039 , 2053 , 2063 , 2069 , 2081 , 2083 , 2087 , 2089 , 2099 , 2111 , 2113 , 2129 , 2131 , 2137 , 2141 , 2143 , 2153 , 2161 , 2179 , 2203 , 2207 , 2213 , 2221 , 2237 , 2239 , 2243 , 2251 , 2267 , 2269 , 2273 , 2281 , 2287 , 2293 , 2297 , 2309 , 2311 , 2333 , 2339 , 2341 , 2347 , 2351 , 2357 , 2371 , 2377 , 2381 , 2383 , 2389 , 2393 , 2399 , 2411 , 2417 , 2423 , 2437 , 2441 , 2447 , 2459 , 2467 , 2473 , 2477 , 2503 , 2521 , 2531 , 2539 , 2543 , 2549 , 2551 , 2557 , 2579 , 2591 , 2593 , 2609 , 2617 , 2621 , 2633 , 2647 , 2657 , 2659 , 2663 , 2671 , 2677 , 2683 , 2687 , 2689 , 2693 , 2699 , 2707 , 2711 , 2713 , 2719 , 2729 , 2731 , 2741 , 2749 , 2753 , 2767 , 2777 , 2789 , 2791 , 2797 , 2801 , 2803 , 2819 , 2833 , 2837 , 2843 , 2851 , 2857 , 2861 , 2879 , 2887 , 2897 , 2903 , 2909 , 2917 , 2927 , 2939 , 2953 , 2957 , 2963 , 2969 , 2971 , 2999]\nb=int(input())\nfor i in range(2,b+1):\n n=0\n for j in a:\n if j>=i:\n break\n if i%j==0:\n n=n+1\n if n==2:\n m=m+1\nprint(m)\n\n \t\t \t\t \t\t\t \t\t\t \t \t \t \t\t", "from math import *\r\ndef solution(n):\r\n\ttot=0\r\n\tfor j in range(2,n+1):\r\n\t\tnum=j\r\n\t\tl=[]\r\n\r\n\t\tfor i in range(2,n):\r\n\t\t\twhile num%i==0:\r\n\t\t\t\tl.append(i)\r\n\t\t\t\tnum=num/i\r\n\t\tif num!=1:\r\n\t\t\tl.append(num)\r\n\t\tif len(set(l))==2:\r\n\t\t\ttot+=1\r\n\treturn tot\r\nprint(solution(int(input())))\r\n\r\n\r\n", "def find_primes(a, b):\r\n p = 2\r\n primes = [True for _ in range(b + 1)]\r\n primes[0] = False\r\n primes[1] = False\r\n while p * p <= b:\r\n if primes[p] == True:\r\n for i in range(p ** 2, b + 1, p):\r\n primes[i] = False\r\n p = p + 1\r\n prime_list = []\r\n for i in range(b + 1):\r\n if primes[i]:\r\n prime_list.append(i)\r\n return prime_list\r\n\r\ns = find_primes(1, 3000)\r\nn = int(input())\r\nans = 0\r\nfor i in range(2, n + 1):\r\n c = 0\r\n flag = 1\r\n for j in s:\r\n if j > i:\r\n break\r\n if i % j == 0:\r\n c = c + 1\r\n if c > 2:\r\n flag = 0\r\n break\r\n if flag == 1 and c == 2:\r\n #print(i)\r\n ans = ans + 1\r\nprint(ans)", "def II():return int(input())\r\ndef LI(): return list(map(int,input().split()))\r\ndef MI(): return map(int,input().split())\r\ndef SI(): return sorted(list(map(int,input().split())))\r\n\r\n \r\ndef prime(num):\r\n res = set()\r\n d = 2\r\n \r\n while d * d <= num:\r\n if num % d == 0:\r\n res.add(d)\r\n num //= d\r\n continue\r\n \r\n d += 1\r\n \r\n if num > 1:\r\n res.add(num)\r\n \r\n return len(res)\r\n \r\nnum = II()\r\ncount = 0\r\n\r\nfor i in range(1, num + 1):\r\n ans = prime(i)\r\n if ans == 2:\r\n count += 1\r\n \r\n \r\nprint(count)\r\n \r\n \r\n \r\n \r\n \r\n ", "def main():\r\n ilo=int(input())\r\n lista=[1]*(ilo+1)\r\n lista[1]=1\r\n wyn=0\r\n for j in range(2,ilo+1):\r\n i=2*j\r\n if lista[j]==1:\r\n while i<=ilo:\r\n lista[i]=j\r\n i+=j\r\n #if i%(j*100)==0:\r\n #print(i,j)\r\n pier=[]\r\n for i in range(2,ilo):\r\n if lista[i]==1:\r\n pier.append(i)\r\n if lista[-1]==1: pier.append(ilo)\r\n for j in range(1,ilo+1):\r\n ile=0\r\n for i in range(len(pier)):\r\n if j%pier[i]==0:\r\n ile+=1\r\n if ile==2: wyn+=1\r\n print(wyn)\r\nmain()", "import math\r\ndef isprime(n):\r\n if n <= 1:\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\ndef checkSemiprime(num):\r\n cnt = 0\r\n for i in range(2, num+1):\r\n if isprime(i)==True and num%i==0:\r\n \r\n cnt = cnt+1\r\n \r\n return cnt == 2\r\ndef solve():\r\n n = int(input())\r\n c = 0\r\n for i in range(2, n+1):\r\n if checkSemiprime(i)==True:\r\n c+=1\r\n print(c)\r\nif __name__ == \"__main__\": \r\n solve()", "def almostprime(val):\r\n a=0\r\n l=0\r\n b=[]\r\n d=[]\r\n for i in range(2,val):\r\n a=0\r\n for j in range(2,i):\r\n if(i%j!=0):\r\n pass\r\n else:\r\n a+=1\r\n if a==0:\r\n b.append(i)\r\n for i in range(2,val):\r\n c=0\r\n for j in range(0,len(b)):\r\n if(i%b[j]==0):\r\n c+=1\r\n if c==2:\r\n d.append(i)\r\n print(len(d))\r\n \r\n\r\nalmostprime(int(input())+1)", "def main() -> None:\r\n n = int(input())\r\n almost = 0\r\n\r\n for i in range(6, n + 1):\r\n d, _set = 2, set()\r\n\r\n while d * d <= i:\r\n while i % d == 0:\r\n _set.add(d)\r\n i //= d\r\n d += 1\r\n if i > 1:\r\n _set.add(i)\r\n\r\n almost += 1 if len(_set) == 2 else 0\r\n print(almost)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nsev = [0] * (n+1)\r\ni =2\r\nwhile i <= n//2:\r\n if sev[i] == 0:\r\n j =1\r\n while(i*j<=n):\r\n sev[i*j] += 1\r\n j+=1\r\n i+=1\r\ncnt = 0\r\nfor x in sev:\r\n if x == 2:\r\n cnt += 1\r\nprint(cnt)", "taste_case = int(input())\r\ncount = 0\r\nfor number in range(1,taste_case + 1):\r\n factorization = set()\r\n \r\n d = 2\r\n taste = number\r\n while d*d <= number:\r\n \r\n while taste % d == 0:\r\n factorization.add(d)\r\n \r\n taste //= d\r\n \r\n d += 1\r\n \r\n if taste > 1:\r\n factorization.add(taste)\r\n\r\n if len(factorization) == 2:\r\n count += 1\r\n \r\nprint(count)", "#Declaring Vars :\r\np = []\r\nres = []\r\n\r\n#For Making Prime List\r\ndef prime(n):\r\n for i in range (2,n+1):\r\n for k in range(2,i):\r\n if i%k == 0 :\r\n break\r\n else:\r\n p.append(i)\r\n\r\nn = int(input( ))\r\nprime(n)\r\n#To loop on every Num To the Target\r\nfor i in range(1,n+1):\r\n #To Check how many primes the number can divis on :\r\n much = 0\r\n for k in p :\r\n if i % k ==0 and i not in p and i not in res :\r\n much += 1\r\n #if the number only Divisable By 2 So Victory !!! \r\n if much == 2 :res.append(i)\r\n\r\nprint(len(res))", "# A. Almost Prime\r\n\r\nn = int(input())\r\nMM = n // 2 + 1\r\n\r\nprime = [True for i in range(MM)]\r\nprimes = []\r\nfor i in range(2, MM):\r\n if prime[i]:\r\n for j in range(i+i, MM, i):\r\n prime[j] = False\r\n primes.append(i)\r\n\r\nans = 0\r\nfor i in range(6, n + 1):\r\n cnt = 0\r\n for p in primes:\r\n if i % p == 0:\r\n cnt += 1\r\n if cnt == 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "import math\r\ndef pr_f(n):\r\n div = []\r\n while n % 2 == 0: \r\n div.append(2)\r\n n = n//2\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n while n % i== 0: \r\n div.append(i) \r\n n = n//i\r\n if n > 2: \r\n div.append(n)\r\n if len(set(div))==2:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nc=0\r\nfor i in range(1, n+1):\r\n if pr_f(i):\r\n c+=1\r\nprint(c)", "inp = int(input())\r\ndef prime(inp):\r\n i = 2\r\n ans = set()\r\n while i * i <= inp:\r\n i = 2\r\n while inp % i != 0:\r\n i+=1\r\n inp//=i\r\n ans.add(i)\r\n if inp >1:\r\n ans.add(inp)\r\n return len(ans)\r\n\r\ndef solve(inp):\r\n c = 0\r\n for i in range(1,inp+1):\r\n cal = prime(i)\r\n if cal == 2:\r\n c+=1\r\n\r\n print(c)\r\nsolve(inp)\r\n", "n = int(input())\n\nis_prime = [True] * (n + 1)\nis_prime[0], is_prime[1] = False, False\n\np = 2\n\nwhile p ** 2 <= n:\n if is_prime[p]:\n for i in range(p ** 2, n + 1, p):\n is_prime[i] = False\n\n p += 1\n\nprimes = {num for num, prime in enumerate(is_prime) if prime}\n\nans = 0\nfor i in range(2, n + 1):\n divisors = 0\n for prime in primes:\n if int(i / prime) == i / prime:\n divisors += 1\n\n if divisors == 2:\n ans += 1\n\nprint(ans)\n", "n = int(input())\r\n\r\ncount = 0\r\nfor i in range(n+1):\r\n factorization = set()\r\n d = 2\r\n while d * d <= i:\r\n while i % d == 0:\r\n # print(d)\r\n factorization.add(d)\r\n i //= d\r\n d += 1\r\n\r\n if i > 1:\r\n factorization.add(i)\r\n\r\n if len(factorization) == 2:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n \r\n \r\n \r\n", "from math import*\r\ndef p(x):\r\n if x<=1:\r\n return False\r\n for dj in range(2,int(sqrt(x))+1):\r\n if x%dj==0:\r\n return False\r\n return True\r\nn=int(input())\r\naa=0\r\nfor i in range (6,n+1):\r\n s=0\r\n if p(i)==False:\r\n for j in range (2,i//2+1):\r\n if p(j) and i%j==0:\r\n s+=1\r\n if s==2:\r\n aa+=1\r\nprint(aa)\r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\ndef factorizer(number):\r\n case = set()\r\n temp = number\r\n d = 2\r\n while d <= number:\r\n \r\n while temp % d == 0:\r\n case.add(d)\r\n temp = temp // d\r\n \r\n \r\n d += 1\r\n \r\n \r\n \r\n if len(case) > 2 or len(case) < 2:\r\n return False\r\n else:\r\n return True\r\n \r\ncount = 0\r\n \r\nfor item in range(1,n+ 1):\r\n if factorizer(item):\r\n count += 1\r\n\r\nprint(count)\r\n \r\n ", "n=int(input())\r\nt=0\r\nfor i in range(4,n+1):\r\n c=0\r\n if i%2==0: c+=1\r\n while i%2==0: i= i//2\r\n for j in range(3,n+1,2):\r\n if i%j==0:\r\n c+=1\r\n while i%j==0: i= i//j\r\n if c==2: t+=1 \r\nprint(t) \r\n \r\n ", "# Generate all primes up to n using the Sieve of Eratosthenes\r\ndef sieve(n):\r\n is_prime = [True] * (n + 1)\r\n is_prime[0] = is_prime[1] = False\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if is_prime[i]:\r\n for j in range(i * i, n + 1, i):\r\n is_prime[j] = False\r\n return [i for i in range(n + 1) if is_prime[i]]\r\n\r\n# Count the number of almost primes up to n\r\ndef count_almost_primes(n):\r\n primes = sieve(n)\r\n count = 0\r\n for i in range(2, n + 1):\r\n factors = set()\r\n for p in primes:\r\n if p > i ** 0.5:\r\n break\r\n if i % p == 0:\r\n factors.add(p)\r\n while i % p == 0:\r\n i //= p\r\n if i > 1:\r\n factors.add(i)\r\n if len(factors) == 2:\r\n count += 1\r\n return count\r\n\r\n# Read input and output result\r\nn = int(input())\r\nprint(count_almost_primes(n))\r\n", "n=int(input())\r\ndef isAlmost(n):\r\n d=2\r\n factorization=set()\r\n while d*d<=n:\r\n while n%d==0:\r\n factorization.add(d)\r\n n//=d\r\n d+=1\r\n if n > 1:\r\n factorization.add(n)\r\n return 1 if len(factorization)==2 else 0\r\nalmost_primes=0\r\nfor i in range(1,n+1):\r\n almost_primes+=isAlmost(i)\r\nprint(almost_primes)\r\n\r\n", "def estimatePrimes(n):\n primes = []\n for i in range(2, n + 1):\n for j in range(2, i):\n if (i % j) == 0:\n break\n else:\n primes.append(i)\n return primes\n\ndef isAlmostPrime(n):\n counter = 0\n for x in primes:\n if n % x == 0:\n counter += 1\n if counter > 2:\n break;\n if counter == 2:\n return True\n return False\n\n\n\nn = int(input())\nnumberOfAlmostPrimes = 0\n\nprimes = estimatePrimes(n)\n# print(primes)\nfor i in range(2, n + 1):\n if isAlmostPrime(i):\n numberOfAlmostPrimes += 1\n\nprint(numberOfAlmostPrimes)", "n=int(input())\r\nans=0\r\nfor i in range(6,n+1):\r\n k=set()\r\n l=i\r\n j=2\r\n while j*j<l:\r\n while l%j==0:\r\n k.add(j)\r\n l=l/j\r\n j+=1\r\n if l!=1:\r\n k.add(j)\r\n if len(k)==2:\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n \r\n", "def is_almost_prime(num):\r\n count = 0\r\n for i in range(2, int(num ** 0.5) + 1):\r\n if num % i == 0:\r\n count += 1\r\n while num % i == 0:\r\n num //= i\r\n if num > 1:\r\n count += 1\r\n return count == 2\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if is_almost_prime(i):\r\n count += 1\r\nprint(count)", "n = int(input())\r\n\r\ncount = 0\r\nfor i in range(n+1):\r\n num = i\r\n primeFactors = set()\r\n d = 2\r\n while d * d <= num:\r\n while num%d == 0:\r\n primeFactors.add(d)\r\n num //= d\r\n \r\n d += 1\r\n \r\n if num > 1:\r\n primeFactors.add(num)\r\n\r\n if len(primeFactors) == 2:\r\n count += 1\r\n\r\nprint(count)", "#_________________ Mukul Mohan Varshney _______________#\r\n\r\n#Template\r\nimport sys\r\nimport os\r\nimport math\r\nimport copy\r\nfrom math import gcd\r\nfrom bisect import bisect\r\nfrom io import BytesIO, IOBase\r\nfrom math import sqrt,floor,factorial,gcd,log,ceil\r\nfrom collections import deque,Counter,defaultdict\r\nfrom itertools import permutations, combinations\r\n\r\n#define function \r\ndef Int(): return int(sys.stdin.readline())\r\ndef Mint(): return map(int,sys.stdin.readline().split())\r\ndef Lstr(): return list(sys.stdin.readline().strip())\r\ndef Str(): return sys.stdin.readline().strip()\r\ndef Mstr(): return map(str,sys.stdin.readline().strip().split())\r\ndef List(): return list(map(int,sys.stdin.readline().split()))\r\ndef Hash(): return dict()\r\ndef Mod(): return 1000000007\r\ndef Ncr(n,r,p): return ((fact[n])*((ifact[r]*ifact[n-r])%p))%p\r\ndef Most_frequent(list): return max(set(list), key = list.count)\r\ndef Mat2x2(n): return [List() for _ in range(n)]\r\n\r\ndef Prime_factors(n):\r\n i = 2\r\n factors = set()\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.add(i)\r\n if n > 1:\r\n factors.add(n)\r\n if len(factors)==2:\r\n return True\r\n else:\r\n return False\r\n\r\ndef Divisors(n) : \r\n l = [] \r\n for i in range(1, int(math.sqrt(n) + 1)) :\r\n if (n % i == 0) : \r\n if (n // i == i) : \r\n l.append(i) \r\n else : \r\n l.append(i)\r\n l.append(n//i)\r\n return l\r\n \r\ndef Sieve(n): \r\n prime=[True for i in range(n+1)]\r\n lst=[]\r\n p=2\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=p+1\r\n for i in range(2,n+1):\r\n if prime[i]:\r\n lst.append(i)\r\n return lst \r\n \r\ndef GCD(x,y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n \r\ndef minimum_integer_not_in_list(a):\r\n b=max(a)\r\n if(b<1):\r\n return 1\r\n \r\n A=set(a)\r\n B=set(range(1,b+1))\r\n D=B-A\r\n if len(D)==0:\r\n return b+1\r\n else:\r\n return min(D)\r\n \r\n# Driver Code \t\r\ndef solution():\r\n n=int(input())\r\n a=0\r\n for i in range(n+1):\r\n if(Prime_factors(i)==True):\r\n a+=1\r\n \r\n print(a)\r\n \r\n\r\n#Call the solve function \r\nif __name__ == \"__main__\":\r\n solution() " ]

[ "# LUOGU_RID: 132709855\n# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nimport sys\r\n\r\nfrom math import gcd\r\n\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\nx0, y0, x1, y1 = M()\r\n\r\nif x0 <= x1 and y0 <= y1:\r\n print(\"Polycarp\")\r\nelif x0 + y0 <= max(x1, y1):\r\n print(\"Polycarp\")\r\nelse:\r\n print(\"Vasiliy\")", "xp,yp,xv,yv = map(int,input().split())\n\nans = \"Vasiliy\"\n\nif xp+yp <= max(xv,yv):\n ans = \"Polycarp\"\nelif xp<=xv and yp<=yv:\n ans = \"Polycarp\"\nprint(ans)", "x, y, a, b = map(int, input().split())\r\nprint('Vasiliy' if a < x and b < x + y or b < y and a < x + y else 'Polycarp')", "x1, y1, x2, y2 = map(int, input().split())\nif (x1 > x2 or y1 > y2) and x1 + y1 > max(x2, y2):\n\tprint(\"Vasiliy\")\nelse:\n\tprint(\"Polycarp\")\n", "x,y,a,b=map(int,input().split())\r\nprint('Vasiliy' if a<x and b<x+y or b<y and a<x+y else 'Polycarp')", "xp, yp, xv, yv = (int(x) for x in input().split())\nif xp <= xv and yp <= yv:\n\tprint('Polycarp')\n\texit(0)\nif xv <= xp and yv <= yp:\n\tprint('Vasiliy')\n\texit(0)\nif xv > xp and yv < yp:\n\tif xv - xp >= yp:\n\t\tprint('Polycarp')\n\telse:\n\t\tprint('Vasiliy')\n\texit(0)\nif yv - yp >= xp:\n\tprint('Polycarp')\nelse:\n\tprint('Vasiliy')\n", "def check(a, b, c, d):\r\n if(d >= a+b) or (c >= a+b) or (c >= a and d >= b):\r\n print(\"Polycarp\")\r\n else:\r\n print(\"Vasiliy\")\r\na, b, c, d = map(int, input().split())\r\ncheck(a, b, c, d)# 1691164694.5289586", "x1, y1, x2, y2 = map(int, input().split())\nprint(\"Polycarp\" if ((x2 >= x1 and y2 >= y1) or (max(x2, y2) >= x1 + y1)) else \"Vasiliy\")\n\n \t \t\t\t \t\t \t \t \t \t\t\t\t", "x1, y1, x2, y2 = map(int, input().split())\n\nif x1 <= x2 and y1 <= y2:\n print('Polycarp')\nelse:\n if x1+y1 <= max(x2, y2):\n print('Polycarp')\n else:\n print('Vasiliy')", "def dist(a,b,c,d):\r\n poly = a + b\r\n vasi = max(c,d)\r\n if(poly<=vasi):\r\n return True\r\n return False\r\na,b,c,d= map(int,input().split())\r\nx,y = min(a,c), min(b,d)\r\nif((a<=c and b<=d) or (dist(a,b,c,d))):\r\n print(\"Polycarp\")\r\nelse:\r\n print(\"Vasiliy\")", "def main():\n def dist(x1, y1, x2, y2):\n return max(abs(x1 - x2), abs(y1 - y2))\n \n xp, yp, xv, yv = [int(i) for i in input().split()]\n \n win = -1\n while True:\n if xp == 0:\n yp -= 1\n elif yp == 0:\n xp -= 1\n elif dist(xp - 1, yp, xv, yv) < dist(xp, yp - 1, xv, yv):\n xp -= 1\n else:\n yp -= 1\n if xp == 0 and yp == 0:\n win = 0\n break\n \n if xv == 0:\n if xp == 0 and yv - yp == 1:\n win = 0\n break\n yv -= 1\n elif yv == 0:\n if yp == 0 and xv - xp == 1:\n win = 0\n break\n xv -= 1\n else:\n if yv - yp == 1 and xv - xp == 1:\n win = 0\n break\n xv -= 1\n yv -= 1\n if xv == 0 and yv == 0:\n win = 1\n break\n \n print([\"Polycarp\", \"Vasiliy\"][win])\n \n \nmain()\n", "xp, yp, xv, yv = map(int, input().split())\nif xv >= xp and yv >= yp:\n print(\"Polycarp\")\nelif yv >= yp + xp:\n print(\"Polycarp\")\nelif xv >= xp + yp:\n print(\"Polycarp\")\nelse:\n print(\"Vasiliy\")\n", "a, b, x, y = map(int, input().split())\r\nif a >= x:\r\n if b >= y:\r\n print('Vasiliy')\r\n else:\r\n z = y - b\r\n t = max(x - z, 0)\r\n if a - z <= t:\r\n print('Polycarp')\r\n else:\r\n print('Vasiliy')\r\nelse:\r\n if b <= y:\r\n print('Polycarp')\r\n else:\r\n z = x - a\r\n t = max(y - z, 0)\r\n if b - z <= t:\r\n print('Polycarp')\r\n else:\r\n print('Vasiliy')" ]

[ "l=['A','U','O','I','E','Y']\r\ns=input()\r\nc=0\r\nm=0\r\nfor i in s:\r\n if(i in l):\r\n m=max(m,c)\r\n c=0\r\n else:\r\n c=c+1\r\nm=max(c,m)\r\nprint(m+1)", "s=input()\r\nm=1\r\nl=0\r\nd={'A','E','I','O','U','Y'}\r\nfor i in range(len(s)):\r\n\tif s[i] in d:\r\n\t\tl=max(l,m)\r\n\t\tm=1\r\n\telse:\r\n\t\tm+=1\r\nl=max(l,m)\t\r\nif l==0:\r\n\tprint(len(s)+1)\t\r\nelse:\r\n\tprint(l)", "def solve(s:str):\r\n a=[]\r\n vowels=['A','E','I','O','U','Y']\r\n flag=False\r\n\r\n for i in range(0,len(s)):\r\n if s[i] in vowels:\r\n flag=True\r\n a.append(i)\r\n a.insert(0,-1)\r\n a.append(len(s))\r\n\r\n m=-1\r\n if not flag:\r\n print(len(s)+1)\r\n else:\r\n for i in range(1,len(a)):\r\n #print(a[i])\r\n if(m<(a[i]-a[i-1])):\r\n m=a[i]-a[i-1]\r\n \r\n print(m)\r\n \r\n\r\nif __name__=='__main__':\r\n s=input()\r\n solve(s)", "st = input()\r\nst2 = list(st).copy()\r\n\r\nst2.append('A')\r\nst2.insert(0,'A')\r\n\r\nl = ['A','E','I','O','U','Y']\r\nb = []\r\nfor i in range(len(st2)):\r\n if st2[i] in l:\r\n b.append(i)\r\n\r\nmaxx = 0\r\nfor i in range(len(b)-1):\r\n if b[i+1]-b[i]>maxx:\r\n maxx=b[i+1]-b[i]\r\nprint(maxx)", "import re\r\n\r\ns = input()\r\nprint(len(max(re.split('[AEIOUY]', s), key = len))+1)", "string = list(input())\nv = {\"A\", \"E\", \"I\", \"O\", \"U\", \"Y\"}\nstring.append(\"A\")\nanswers = []\ncount = 0\nfor i in string:\n if i in v:\n count += 1\n answers.append(count)\n count = 0\n else:\n count += 1\nprint(max(answers))\n \t\t \t\t \t\t \t \t\t \t\t \t\t\t\t\t\t\t\t", "s = 'Y' + input() + 'Y'\r\nindex = []\r\nvow = set(['A', 'E', 'I', 'O', 'U', 'Y'])\r\nfor i in range(len(s)):\r\n if s[i] in vow:\r\n index.append(i)\r\nans = []\r\nfor i in range(len(index) - 1):\r\n ans.append(index[i+1] - index[i])\r\nprint(max(set(ans)))\r\n", "string = input()\nminimo = 0\nsaltoactual = 1\nfor letra in string:\n if letra not in(\"AEIOUY\"):\n saltoactual += 1\n if minimo < saltoactual:\n minimo = saltoactual\n elif letra in(\"AEIOUY\"):\n saltoactual = 1 \nprint(minimo)\n\n \t \t\t\t\t\t \t \t \t\t \t\t \t\t\t", "pre='AEIOUY'\r\ns=input()\r\ns='A'+s+'A'\r\nans=0;begin=0\r\nfor i in range(len(s)):\r\n if s[i] in pre :\r\n ans=max(ans,i-begin)\r\n begin=i\r\nprint(ans)\r\n\r\n", "s=input()\r\nindex=[-1]\r\nfor i in range(len(s)):\r\n if s[i] in \"AEIOUY\":\r\n index.append(i)\r\nindex.append(len(s))\r\ng=-2\r\nfor i in range(1,len(index)):\r\n if index[i]-index[i-1] >g:\r\n g=index[i]-index[i-1]\r\nprint(g)", "l=['A','E','I','O','U','Y']\r\ns=input()\r\nm=1\r\nj=1\r\nfor i in s:\r\n if i in l:\r\n m=max(m,j)\r\n j=1\r\n else:\r\n j+=1\r\nm=max(m,j)\r\nprint(m)", "l=input()\r\nk='AEIOUY'\r\na='Z'+l+'A'\r\nmaxi=0\r\nc=0\r\nfor i in range(len(a)):\r\n if not a[i] in k:\r\n c+=1\r\n else:\r\n c=1\r\n maxi=max(maxi,c) \r\nprint(maxi)", "text = input()\r\nalphabet = 'AEIOUY'\r\nmaxLength = 0\r\nlenght = 0\r\n\r\nfor i in text:\r\n if i not in alphabet:\r\n lenght += 1\r\n else:\r\n lenght += 1\r\n if lenght > maxLength:\r\n maxLength = lenght\r\n lenght = 0\r\n\r\nlenght += 1\r\nif lenght > maxLength:\r\n maxLength = lenght\r\nlenght = 0\r\n\r\nprint(maxLength)", "inp = input()\ns = list(inp)\nl = []\nmax = 0\n\ns.append('A')\n\n# print(s)\n# print(len(s))\n\nfor i in range(0, len(s), 1):\n if s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U' or s[i]=='Y':\n l.append(i+1)\n \n# print(l)\n\nmax = l[0]\nfor j in range(len(l)):\n \n if j+1==len(l):\n break\n d = l[j+1]-l[j]\n if(d>max):\n max = d\n\nprint(max)\n \t \t\t\t\t \t\t\t \t\t\t \t\t\t\t \t", "cadena=input()\ncontador=0\nmaximo=0\nfor i in cadena:\n if i in 'AEIOUY':\n contador=0\n elif i in 'BCDFGHJKLMNPQRSTUVWXZ':\n contador+=1\n if contador>maximo:\n maximo=contador\nprint(maximo+1)\n\n \t\t \t\t \t\t\t\t\t\t \t \t\t \t\t\t \t\t \t\t", "s = input()\r\ns += \"A\"\r\nres = []\r\nc = 0\r\nvowels = \"AEIOUY\"\r\n# consonants\r\nfor i in range(len(s)):\r\n if s[i] in vowels:\r\n res.append(c+1)\r\n c = 0\r\n else:\r\n c += 1\r\n \r\nprint(max(res))", "string = input()\ncont = 1 \nmax_cont = 0\nnew = '0'+ string + '0'\nfor e in new:\n if e in '0AEIOUY':\n if cont >= max_cont:\n max_cont = cont\n cont = 1\n else:\n cont += 1\nprint(max_cont)\n\t\t \t \t\t \t\t \t \t\t\t \t\t\t\t \t\t\t\t", "s='A'+input()+'A';res=0\r\nY='AEIOUY';s1=0\r\nfor i in range(len(s)):\r\n if s[i] in Y:\r\n e=i\r\n if res<e-s1:res=e-s1\r\n s1=e\r\nprint(res)", "l=['A', 'E', 'I', 'O', 'U','Y']\r\ns=input()\r\nz,p=0,0\r\nfor i in range(len(s)):\r\n\tif s[i] in l:\r\n\t\tp=0\r\n\t\tcontinue\r\n\telse:\r\n\t\tp+=1\r\n\tz=max(z,p)\r\nprint(z+1)", "s = input()\r\ncnt = jump = 0\r\nvowels = ['A','E','I','O','U','Y']\r\nfor i in range(len(s)):\r\n if s[i] not in vowels:\r\n cnt += 1\r\n if cnt > jump:\r\n jump = cnt\r\n else:\r\n cnt = 0\r\nprint(jump+1)\r\n", "'''n=int(input())\r\nv=n%7\r\nif v==0:\r\n print((n//7)*2,(n//7)*2)\r\nelif v==1:\r\n print((n//7)*2,(n//7)*2+1)\r\nelif v==6:\r\n print((n//7)*2+1,(n//7)*2+2)\r\nelse:\r\n print((n//7)*2,(n//7)*2+2)\r\ns=input()\r\nt=input()\r\nf='aeiou'\r\nif len(s)!=len(t):\r\n print('No')\r\nelse:\r\n for i in range(len(s)):\r\n if f.find(s[i])==-1 and f.find(t[i])==-1:\r\n pass\r\n elif f.find(s[i])!=-1 and f.find(t[i])!=-1:\r\n pass\r\n else:\r\n print('No')\r\n break\r\n else:\r\n print('Yes')\r\nm=int(input())\r\nn=input().split()\r\nfor i in range(m):\r\n n[i]=int(n[i])\r\nn.sort()\r\nif len(n)%2==0:\r\n print(n[m//2-1])\r\nelse:\r\n print(n[m//2])\r\na=input()\r\nb=input().split()\r\nc=0\r\nd=0\r\nfor i in b:\r\n c+=int(i)\r\nx=c%2\r\nif x==0:\r\n for i in b:\r\n if int(i)%2==0:\r\n d+=1\r\nelse:\r\n for i in b:\r\n if int(i)%2==1:\r\n d+=1\r\nprint(d)\r\nn=int(input())\r\nA=input().split()\r\nm=int(input())\r\nB=input().split()\r\nfor i in range(n):\r\n A[i]=int(A[i])\r\nfor i in range(m):\r\n B[i]=int(B[i])\r\nA.sort()\r\nB.sort()\r\nprint(int(A[n-1]),int(B[m-1]))'''\r\nn=input()\r\nc=1\r\nt=0\r\nfor i in n:\r\n if i in'AEIOUY':\r\n if t<c:\r\n t=c\r\n c=1\r\n else:\r\n c+=1\r\nif t<c:\r\n t=c\r\nprint(t)\r\n \r\n\r\n \r\n\r\n\r\n \r\n", "V = ['A', 'E', 'O', 'I', 'U', 'Y']\r\n\r\nS = 'A' + input() + 'A'\r\nN = len(S)\r\n\r\nx = 1\r\ny = 1\r\nfor i in range(N):\r\n if S[i] in V:\r\n x = max(x, y)\r\n y = 1\r\n else:\r\n y += 1\r\n\r\nprint(x)\r\n", "r = 0\r\nt = -1\r\nfor i, x in enumerate(input() + 'A'):\r\n if x in 'AEIOUY':\r\n r = max(r, i - t)\r\n t = i\r\nprint(r)\r\n", "X = input()\r\nMIN = 1\r\nX = 'A' + X + 'A'\r\nPREV = 0\r\nfor i in range(1, len(X)):\r\n if X[i] in \"AEIOUY\":\r\n MIN = max(MIN, i - PREV)\r\n PREV = i\r\nprint(MIN)\r\n", "s=['A','E','I','O','U','Y']\r\ni=input()\r\nans=0\r\ncount=0\r\nfor x in i:\r\n if x not in s:\r\n count=count+1\r\n ans=max(count,ans)\r\n else:\r\n count=0\r\nprint(ans+1)", "l=list(input())\r\ng1=0\r\ns=len(l)\r\ng2=s+1\r\nc=0\r\np=[\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"]\r\nfor i in range(s):\r\n\tif i==s-1 and l[i] not in p:\r\n\t\tt=g2-g1\r\n\t\tif c<t:\r\n\t\t\tc=t\r\n\telif l[i] in p:\r\n\t\tt=i+1-g1\r\n\t\tg1=i+1\r\n\t\tif c<t:\r\n\t\t\tc=t\r\nprint(c)\r\n", "\r\n\r\nst = list(input())\r\nvo = list('AEIOUY')\r\n\r\nability = 0\r\nco = 1\r\nfor i in range(len(st)):\r\n\tif st[i] in vo:\r\n\t\tif co > ability:\r\n\t\t\tability = co\r\n\t\tco = 1\r\n\telse:\r\n\t\tco += 1\r\nif co > ability:\r\n\tability = co\r\nprint(ability)\r\n\r\n\r\n\r\n", "s=\"A\"+input()+\"A\"\r\nans=0\r\nfront=0\r\nvowel=['A','E','I','O','U','Y']\r\nfor i in range(1,len(s)):\r\n if s[i] in vowel:ans=max(ans,i-front);front=i\r\nprint(ans)\r\n\r\n", "import sys\r\na = input()\r\nm = -1\r\nmini = -1\r\nvowels = ['A', 'E', 'I', 'O', 'U', 'Y']\r\nfor i in range(len(a)):\r\n if(a[i] in vowels):\r\n if(i-m>mini):\r\n mini = i-m\r\n m = i\r\nif(i+1-m>mini):\r\n mini = i+1-m\r\nprint(mini)\r\n", "v=('A','E','I','O','U','Y')\ns=input()+'A'\nc=0\nm=0\nfor i in s:\n c+=1\n if i in v:\n if c>m:\n m=c\n c=0\nprint(m)", "l=list(input())\r\na=['A','E','I','O','U','Y']\r\nz=[]\r\nl.insert(0,'A')\r\nl.append('A')\r\nc,d=0,0\r\nfor i in range(1,len(l)):\r\n\tif l[i] in a:\r\n\t\tc=i\r\n\t\tz.append(abs(c-d))\r\n\t\td=i\t\r\nprint(max(z))\t\t", "# LUOGU_RID: 101647570\nimport re\r\nprint(max(map(len, re.split('[AEIOUY]', input()))) + 1)", "a = input()\r\n\r\nvowels = {'A', 'E', 'I', 'O', 'U','Y'}\r\n\r\nmaxs = 1\r\ncount = 1\r\nfor x in a+'A':\r\n if x not in vowels:\r\n count += 1\r\n else:\r\n if count > maxs:\r\n maxs = count\r\n count = 1\r\nprint(maxs)", "string = input()\nstring = 'A' + string + 'A'\njawaban = 0\ncekpoin = 0\nfor i in range(len(string)):\n if string[i] == 'A' or string[i] == 'I' or string[i] == 'U' or string[i] == 'E' or string[i] == 'O' or string[i] == 'Y':\n if i - cekpoin > jawaban:\n jawaban = i - cekpoin\n cekpoin = i\n\nprint(jawaban)\n\t\t \t \t\t\t\t \t \t\t\t\t\t \t\t\t\t\t\t\t", "s=input()\r\nn=len(s)\r\ni=0\r\nj=-1\r\nx=1\r\nc=0\r\nv=['a','e','i','o','u','y']\r\nwhile i<n:\r\n if s[i].lower() in v:\r\n# print(s[i],i,j)\r\n x=max(x,i-j)\r\n j=i\r\n else:\r\n c+=1\r\n i+=1\r\n#print(n,n-i,n-j)\r\nif n-j>x:\r\n x=n-j\r\nif c==n:\r\n print(n+1)\r\nelse:\r\n print(x)", "s = input()\r\ns += \"A\"\r\nc = 0\r\nres = []\r\nfor i in range(len(s)):\r\n if s[i] not in \"AEIOUY\":\r\n c += 1\r\n else:\r\n res.append(c)\r\n c = 0\r\nprint(max(res)+1)\r\n", "s=[x for x in input()]\r\nn=len(s)\r\nv=['A','E','I','O','U','Y']\r\npos=[-1]\r\nfor i in range(len(s)):\r\n\tif(v.count(s[i])):\r\n\t\tpos.append(i)\r\npos.append(n)\r\nd=[]\r\nfor i in range(1,len(pos)):\r\n\td.append(pos[i]-pos[i-1])\r\nprint(max(d))\r\n", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\nst=input()\r\nvow=['A','E','I','O','U','Y']\r\nmn=1;cur=1\r\nfor i in range(len(st)):\r\n\tif st[i] in vow:\r\n\t\tmn=max(mn,cur)\r\n\t\tcur=0\r\n\tcur+=1\r\nprint(max(mn,cur))", "import re\r\nprint(len(max(re.split('[AEIOUY]', input()), key=len))+1)", "ch=input()\r\nvowel=\"AEIOUY\"\r\nc=0\r\np=0\r\nfor i in ch :\r\n if i in vowel:\r\n c=0\r\n else:\r\n c+=1\r\n p=max(p,c)\r\nprint(p+1)", "a = input().upper() + \" \"\r\nv = ['A','E','I','O','U','Y']\r\nm=0\r\nc=0\r\nfor i in range(len(a)):\r\n c+=1\r\n if(a[i] in v or a[i]==\" \"):\r\n if(c>m):\r\n m=c\r\n c=0\r\nprint(m) ", "s = input()\nconvert_to_list_and_append_2_vowels_to_s = ['A'] + list(s) + ['A']\nvowels = ['A', 'E', 'I', 'O', 'U', 'Y']\n\njumps = []\nj = 0\nk = 0\n\nwhile j < len(convert_to_list_and_append_2_vowels_to_s):\n if convert_to_list_and_append_2_vowels_to_s[j] in vowels:\n jumps.append(j - k)\n k = j\n j += 1\n\nprint(max(jumps))", "def main():\n string = 'Z' + input() + 'A'\n n = len(string)\n vowels = 'AEIOUY'\n max_length = 0\n index = 0\n\n while index < n - 1:\n next_index = next(i for i in range(index + 1, n) if string[i] in vowels)\n max_length = max(max_length, next_index - index)\n index = next_index\n\n print(max_length)\n\n\nif __name__ == '__main__':\n main()\n", "n='A'+input()+'A'\r\nx=0\r\njump=0\r\nv='AEIOUY'\r\nfor i in range(1,len(n)):\r\n if n[i] in v:\r\n jump=max(jump,i-x)\r\n x=i\r\nprint(jump)\r\n", "ss = input()\r\nc = 0\r\nmaxs = 0\r\nfor s in ss:\r\n if s=='A' or s == 'E' or s == 'I' or s == 'O' or s == 'U' or s == 'Y':\r\n c = 0\r\n else:\r\n c += 1\r\n if maxs <= c:\r\n maxs = c\r\nprint(maxs+1)", "from sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\ns = input()\r\nn = len(s)\r\nar = [0]*n\r\ncnt = 1\r\nbad = set([\"A\",\"O\",\"E\",\"Y\",\"I\",\"U\"]) \r\nres = []\r\nfor i in range(n):\r\n\tif s[i] in bad:\r\n\t\tres.append(cnt)\r\n\t\tcnt = 1\r\n\t\tcontinue\r\n\tcnt+=1\r\nres.append(cnt)\r\nprint(max(res))", "if __name__ == \"__main__\":\n vowels = 'AEIOUY'\n inp = input()\n max_jump = 1\n current_len = 1\n\n for c in inp:\n if c in vowels:\n max_jump = max(max_jump, current_len)\n current_len = 1\n else:\n current_len += 1\n\n # current_len += 1\n max_jump = max(max_jump, current_len)\n\n print(max_jump)", "a = input()\r\nmaxi = 0 \r\nans = 0\r\nfor i in range(0, len(a)):\r\n if a[i] != 'A' and a[i] != 'E' and a[i] != 'I' and a[i] != 'O' and a[i] != 'U' and a[i] != 'Y':\r\n ans = ans + 1\r\n if maxi < ans:\r\n maxi = ans\r\n else:\r\n ans = 0\r\nprint(maxi+1)", "s=\"A\"+input()+\"A\"\r\nans=0\r\nbegin=0\r\nfor end in range(len(s)):\r\n if s[end] in \"AEIOUY\":\r\n ans=max(ans,end-begin)\r\n begin=end\r\nprint(ans)", "s=\"A\"+input()+\"A\"\r\nl=0\r\ne=0\r\nfor i in range(len(s)):\r\n if s[i] in \"AEIOUY\":\r\n l=max(l,i-e)\r\n e=i\r\nprint(l)", "z=input().upper()\r\nd=[]\r\ng=[]\r\nq=\"AOIEYU\"\r\n#BCDEF\r\nfor i in range(len(z)):\r\n if z[i] in q:\r\n if g==[] :\r\n d.append(i+1)\r\n g.append(i)\r\n else:\r\n d.append(abs(g[-1]-i))\r\n g.append(i)\r\nif g==[]:\r\n print(len(z)+1)\r\nelse:\r\n d.append(len(z)-g[-1])\r\n\r\n print(max(d))\r\n\r\n \r\n\r\n", "g = ['A', 'E', 'I', 'O', 'U', 'Y']\r\ns = input() + 'A'\r\nl = -1\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] in g:\r\n ans = max(ans, i - l)\r\n l = i\r\nprint(ans)", "a = input()\r\nb = []\r\ncounter = 1\r\nmx = 0\r\n\r\nfor i in a:\r\n b.append(i)\r\n\r\nfor i in b:\r\n if i == \"A\" or i == \"E\" or i == \"I\" or i == \"O\" or i == \"U\" or i == \"Y\":\r\n counter = 1\r\n else: \r\n counter += 1\r\n if counter > mx:\r\n mx = counter\r\n\r\nprint(mx)", "a=b=1\r\nfor i in input():\r\n if i=='A' or i=='E' or i=='I' or i=='O' or i=='U' or i=='Y':a=max(a,b);b=1\r\n else:b+=1\r\nprint(max(a,b))", "import re\r\ns = re.split(\"A|E|I|O|U|Y\",input())\r\ns.sort(key=lambda x : len(x), reverse=True)\r\nprint(len(s[0])+1)\r\n", "a=input()\r\na='Z'+a+'A'\r\nb=0\r\nc=0\r\nh='AEIOUY'\r\nfor i in range(len(a)):\r\n if a[i] not in h:\r\n c+=1\r\n else:\r\n b=max(c,b)\r\n c=1\r\nprint(b)\r\n ", "def main() -> None:\r\n s = input()\r\n v = \"AEIOUY\"\r\n ans = 1\r\n pos = -1\r\n for i in range(len(s)):\r\n if s[i] not in v:\r\n continue\r\n ans = max(ans, i - pos)\r\n pos = i\r\n print(max(ans, len(s) - pos))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "S = input()\r\nnum = 1\r\ntmp = 1\r\nfor i in S:\r\n if i not in ['A', 'I', 'U', 'E', 'O', 'Y']:\r\n tmp += 1\r\n else:\r\n num = max(num, tmp)\r\n tmp = 1\r\n\r\nnum = max(num, tmp)\r\nprint(num)\r\n", "st = input()\r\ncopy_st, vow = '', 'AEIOUY'\r\nfor i in st:\r\n if i in vow:\r\n copy_st += ' '\r\n else:\r\n copy_st += 'J'\r\ncopy_st = copy_st.split()\r\ncopy_st.sort()\r\nif len(copy_st) == 0:\r\n print(1)\r\nelse:\r\n print(len(copy_st[-1])+1)", "s = input()\r\nmaximum = 0\r\ncounter = 0\r\nv = [\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"]\r\nif (\"A\" not in s) and (\"E\" not in s) and (\"I\" not in s) and (\"O\" not in s) and (\"U\" not in s) and (\"Y\" not in s):\r\n print(len(s)+1)\r\nelse:\r\n for num in s:\r\n counter += 1\r\n if num in v:\r\n if counter > maximum:\r\n maximum = counter\r\n counter = 0\r\n print(max(maximum,counter+1))", "vowels = ['A', 'E', 'I', 'O', 'U', 'Y']\r\n\r\n\r\ndef solve(r):\r\n n = len(r)\r\n X = [0] + [i + 1 for i in range(n) if r[i] in vowels] + [n + 1]\r\n m = 0\r\n for i in range(len(X) - 1):\r\n m = max(m, X[i + 1] - X[i])\r\n return m\r\n\r\n\r\ns = input()\r\nprint(solve(s))", "s=input()\r\nres,ans=-1,0\r\nlst=['A','E','I','O','U','Y']\r\nfor i in range(len(s)):\r\n if s[i] in lst:\r\n ans=max(ans,i-res)\r\n res=i \r\nprint(max(ans,len(s)-res))", "s=input()\r\ncount=0\r\nlist3=[]\r\nlist1=[]\r\nlist2=['A','E','I','O','U','Y']\r\nfor j in s:\r\n list1.append(j)\r\nfor j in range(len(list1)):\r\n if list1[j] not in list2:\r\n count+=1\r\n list3.append(count)\r\n elif list1[j] in list2:\r\n count=0\r\n list3.append(count)\r\nprint(max(list3)+1)\r\n", "a=input()\r\nk=-1\r\nma=1\r\na+='U'\r\nb=['A', 'E', 'I', 'O', 'U','Y']\r\nfor i in range(len(a)):\r\n\tif a[i] in b:\r\n\t\tma=max(ma,i-k)\t\r\n\t\tk=i\t\r\nprint(ma)", "X = list (input ())\nY = - 1\nZ = 0\n\nfor H, I in enumerate (X):\n\n if I == 'A' or I == 'E' or I == 'I' or I == 'O' or I == 'U' or I == 'Y':\n\n Z = max (Z, H - Y)\n Y = H\n\nZ = max (Z, len (X) - Y)\nprint (Z)\n", "s = input()\r\nv = (\"A\", \"E\", \"I\", \"O\", \"U\", \"Y\")\r\npos = [-1]\r\nans = 0\r\nfor i in range(len(s)):\r\n\tif s[i] in v:\r\n\t\tpos.append(i)\r\npos.append(len(s))\r\nfor i in range(1,len(pos)):\r\n\tans = max(ans, pos[i]-pos[i-1])\r\nprint(ans)", "def is_vowel(ch):\r\n vowels = ['A', 'E', 'I', 'O', 'U', 'Y']\r\n return True if ch in vowels else False\r\n\r\n\r\ns = input()\r\nvin = []\r\ndist = []\r\n\r\nfor i, x in enumerate(s):\r\n if is_vowel(x):\r\n vin.append(i)\r\n\r\nl = len(vin)\r\n\r\nif l == 0:\r\n print(len(s)+1)\r\nelse:\r\n for i in range(1, l):\r\n dist.append(vin[i]-vin[i-1])\r\n\r\n dist.append(vin[0]+1)\r\n dist.append(len(s)-vin[l-1])\r\n print(max(dist))\r\n", "s = input() + \"A\"\r\n\r\njumps = {'A', 'E', 'I', 'O', 'U', 'Y'}\r\n\r\nmx = 0\r\n\r\ntemp = 0\r\n\r\nfor char in s:\r\n if char not in jumps:\r\n temp += 1\r\n else:\r\n if temp > mx:\r\n mx = temp\r\n temp = 0\r\n\r\nprint(mx+1)\r\n", "\r\npre='AEIOUY'\r\ns=input()\r\ns='Y'+s+'Y'\r\nans=0;begin=0\r\nfor i in range(len(s)):\r\n if s[i] in pre:\r\n ans=max(ans,i-begin)\r\n begin=i\r\nprint(ans)", "def is_vowel(h):\n if h == 'A' or h =='I' or h =='U' or h == 'E' or h == 'O' or h == 'Y':\n return True\n return False\n\ns = input()\ns = 'A' + s + 'A'\n\njawaban = 0\nprev = 0\n\nfor i in range (len(s)):\n if is_vowel(s[i]):\n jawaban = max(jawaban, i-prev)\n prev = i\n\nprint (jawaban)\n \t\t\t \t\t\t \t\t\t \t\t\t \t\t\t\t", "#sa7afy\r\n#a,b = map(int,input().split())\r\n#arr=[]\r\n#arr=list(map(int,input().split()))\r\n#arr = list(dict.fromkeys(arr))\r\n#arr.sort()\r\n#n = int(input())\r\n#for i in range():\r\n#print(*list)\r\n#sorted(arr, reverse=True)\r\n \r\n#def isPalindrome(s):\r\n #return s == s[::-1]\r\n#min(n*a,-n//m*-b,n//m*b+n%m*a),max(n*a,-n//m*-b,n//m*b+n%m*a)\r\n#import re\r\n#x=input()\r\n#z=re.search(r\"text\",x)\r\n#n=str(sum(map(int,n))) \r\n \r\n \r\n#────────▓▓▓▓▓▓▓────────────▒▒▒▒▒▒\r\n#──────▓▓▒▒▒▒▒▒▒▓▓────────▒▒░░░░░░▒▒\r\n#────▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓────▒▒░░░░░░░░░▒▒▒\r\n#───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒░░░░░░░░░░░░░░▒\r\n#──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒\r\n#──▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒\r\n#─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░░▒\r\n#▓▓▒▒▒▒▒▒░░░░░░░░░░░▒▒░░▒▒▒▒▒▒▒▒▒▒▒░░░░░░▒\r\n#▓▓▒▒▒▒▒▒▀▀▀▀▀███▄▄▒▒▒░░░▄▄▄██▀▀▀▀▀░░░░░░▒\r\n#▓▓▒▒▒▒▒▒▒▄▀████▀███▄▒░▄████▀████▄░░░░░░░▒\r\n#▓▓▒▒▒▒▒▒█──▀█████▀─▌▒░▐──▀█████▀─█░░░░░░▒\r\n#▓▓▒▒▒▒▒▒▒▀▄▄▄▄▄▄▄▄▀▒▒░░▀▄▄▄▄▄▄▄▄▀░░░░░░░▒\r\n#─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒\r\n#──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒\r\n#───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀▀▀░░░░░░░░░░░░░░▒\r\n#────▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░▒▒\r\n#─────▓▓▒▒▒▒▒▒▒▒▒▒▄▄▄▄▄▄▄▄▄░░░░░░░░▒▒\r\n#──────▓▓▒▒▒▒▒▒▒▄▀▀▀▀▀▀▀▀▀▀▀▄░░░░░▒▒\r\n#───────▓▓▒▒▒▒▒▀▒▒▒▒▒▒░░░░░░░▀░░░▒▒\r\n#────────▓▓▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░▒▒\r\n#──────────▓▓▒▒▒▒▒▒▒▒▒░░░░░░░░▒▒\r\n#───────────▓▓▒▒▒▒▒▒▒▒░░░░░░░▒▒\r\n#─────────────▓▓▒▒▒▒▒▒░░░░░▒▒\r\n#───────────────▓▓▒▒▒▒░░░░▒▒\r\n#────────────────▓▓▒▒▒░░░▒▒\r\n#──────────────────▓▓▒░▒▒\r\n#───────────────────▓▒░▒\r\n#────────────────────▓▒\r\n \r\n \r\n \r\n \r\n \r\ndef run():\r\n print(\"YOusef\")\r\ndef run3():\r\n print(\"Abdalla\") \r\ndef run2():\r\n print(\"Attia\")\r\ndef kk():\r\n print(\"Sa7afy\") \r\n#code here\r\ns=input()\r\narr=['A', 'E', 'I', 'O', 'U' , 'Y']\r\nn=len(s)\r\nt=-1\r\nm=-1\r\nfor i in range(n):\r\n\tif s[i] in arr:\r\n\t\tm=max(m,i-t)\r\n\t\tt=i\r\nm=max(m,n-t)\r\nprint(m)\r\n# 2 5 8 ---> max(-1,3) m=3 &t =2 --> m=max(3,3) =3 ,t = 5 max(3,8-8)=3 <---\r\n# ", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nS = input()\r\nS = \"A\" + S + \"A\"\r\nA = [\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"]\r\nT = [*S]\r\nAns = 0\r\ntemp = 0\r\nfor i in range(1,len(T)):\r\n if T[i] in A:\r\n dis = i - temp\r\n temp = i\r\n Ans = max(Ans,dis)\r\nprint(Ans)\r\n\r\n", "line = input()\r\nmaxjump = 1\r\ncurrentjump = 1\r\nfor i in range(0,len(line)):\r\n if (line[i] == 'A' or line[i] == 'E' or line[i] == 'I' or line[i] == 'O' or line[i] == 'U' or line[i] == 'Y'):\r\n if (currentjump > maxjump):\r\n maxjump = currentjump\r\n currentjump = 1\r\n else:\r\n currentjump += 1\r\nif (currentjump > maxjump):\r\n maxjump = currentjump\r\nprint(maxjump)", "a='AEIOUY'\r\nn=input()\r\nb=[0]\r\nc=1\r\nflag=0\r\nfor i in range(len(n)):\r\n\tif n[i] not in a:\r\n\t\tc+=1\r\n\telse:\r\n\t\tb.append(c)\r\n\t\tc=1\r\nprint(max(max(b),c))\r\n\t\r\n", "s=input()\r\nd=['A','E','I','O','U','Y']\r\ng=-1\r\nc=1\r\nfor i in s:\r\n if i in d:\r\n c=1\r\n else:\r\n c+=1 \r\n g=max(g,c)\r\ng=max(g,c)\r\n\r\nprint(g) \r\n \r\n ", "str=input()\r\nstr+='$'\r\nans=0\r\nvowels=['A','E','I','O','U','Y','$']\r\ncur=0\r\nfor i in range(1,len(str)+1):\r\n if str[i-1] in vowels:\r\n ans=max(ans,i-cur)\r\n cur=i\r\nprint(ans)\r\n", "str = input()\r\nmax_jump = 0\r\n\r\nprev = -1\r\ncurr = 0\r\nwhile curr < len(str):\r\n if str[curr] in 'AEIOUY':\r\n max_jump = max(max_jump, curr - prev)\r\n prev = curr\r\n\r\n curr += 1\r\n\r\nprint(max(max_jump, len(str) - prev))\r\n", "# -*- coding: utf-8 -*-\n\ns = input()\ns = s.replace('A', ' ').replace('E', ' ').replace('I', ' ').replace('O', ' ').replace('U', ' ').replace('Y', ' ')\nlengths = map(len, s.split(' '))\nprint(max(lengths) + 1)\n", "put = input()\r\njump = 0\r\nans = 0\r\n\r\nfor letters in put.upper(): \r\n if(letters =='A'or letters=='E'or letters=='I'or letters=='O'or letters=='U'or letters=='Y'):\r\n jump += 1\r\n if(jump > ans):\r\n ans = jump\r\n jump = 0\r\n else: \r\n jump += 1 \r\n \r\njump +=1\r\nif(jump>ans):\r\n ans =jump\r\nprint (ans)\r\n ", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-21 17:51:14\nLastEditTime: 2021-11-21 18:00:37\nDescription: Grasshopper And the String\nFilePath: CF733A.py\n'''\n\n\ndef func():\n s1 = input().strip()\n vowel = [\"A\", \"E\", \"I\", \"O\", \"U\", \"Y\"]\n s2 = [0]\n for index, value in enumerate(s1):\n if value in vowel:\n s2.append(index + 1)\n s2.append(len(s1) + 1)\n s3 = []\n for i in range(1, len(s2)):\n s3.append(s2[i] - s2[i - 1])\n print(max(s3))\n\n\nif __name__ == '__main__':\n func()\n", "a = input()\r\ns = 'AEIOUY'\r\na = 'A'+a+'A'\r\nk = 1\r\nc = 1\r\nfor i in a:\r\n if s.find(i)==-1:\r\n c+=1\r\n else:\r\n c=1\r\n if c>k:\r\n k = c\r\nprint (k)", "s= str(input())\r\n\r\nx=['A','E','I','O','U','Y']\r\ni=0\r\nans=0\r\nwhile i<len(s):\r\n c=0\r\n if s[i] not in x:\r\n while i<len(s) and s[i] not in x:\r\n c=c+1\r\n i=i+1\r\n ans=max(ans,c)\r\n i=i+1\r\nprint(ans+1)", "s='A'+input()+'A'\r\nans=0\r\nbegin=0\r\nv=['A','E','I','O','U','Y']\r\nfor i in range(1,len(s)):\r\n if s[i]in v:\r\n end=i\r\n k=end-begin\r\n begin=end\r\n if k>ans:ans=k\r\nprint(ans)", "s = input()\r\ncur = ans = -1\r\nfor i in range(len(s)):\r\n if s[i] in 'AEIOUY':\r\n ans = max(ans, i - cur)\r\n cur = i\r\nans = max(ans, len(s) - cur)\r\nprint(ans)", "s=input()\r\nh,p=-1,-1\r\nfor i in range(len(s)):\r\n if s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U' or s[i]=='Y':\r\n if i-p>h:\r\n h=i-p\r\n p=i\r\nif len(s)-p>h:\r\n h=len(s)-p\r\nprint(h)", "s = input()\nl = -1\nm = 1\nfor i in range(len(s)):\n if s[i] in ['A', 'O', 'E', 'U', 'I', 'Y']:\n m, l = max(m, i-l), i\nm = max(m, len(s) - l)\nprint(m)\n", "str = input()\na = 'AEIOUY'\ncnt, max = 0, -1\nfor i in range(len(str)):\n if str[i] in a: cnt = 0\n else: cnt += 1\n if cnt > max: max = cnt\nprint(max + 1)\n\t \t\t\t\t\t \t \t \t \t\t \t\t\t\t\t \t\t", "letters = input()\r\nletters = list(letters)\r\nletters.insert(0, \"A\")\r\nletters.append(\"A\")\r\n\r\ncount = 0\r\nmax_jump = 0\r\nfor i in range(len(letters)):\r\n\tltr = letters[i]\r\n\tif ltr == \"A\" or ltr == \"E\" or ltr == \"I\" \\\r\n\tor ltr == \"O\" or ltr == \"U\" or ltr == \"Y\":\r\n\t\tcount += 1\r\n\t\tif count > max_jump:\r\n\t\t\tmax_jump = count\r\n\t\t\tcount = 0\r\n\t\telse:\r\n\t\t\tcount = 0\r\n\telse:\r\n\t\tcount += 1\r\nprint(max_jump)\r\n\r\n", "str1=\"AEYOUI\"\r\nc=1\r\nm=0\r\nfor k in input()+\"A\":\r\n if(k in str1):\r\n if(c>m):\r\n m=c\r\n c=1\r\n else:\r\n c+=1\r\nprint(m)", "t = input()\r\nd = {\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"}\r\nz = 0\r\nt1 = 0\r\nk = 0\r\nfor i in range(len(t)):\r\n\tif t[i] in d:\r\n\t\tk = k + 1\r\n\t\tz = max(z,k)\r\n\t\tk = 0\r\n\telse:\r\n\t\tk = k + 1\r\n\t\tz = max(z,k)\r\nif i == len(t)-1 and t[i] in d:\r\n\tk+=0\r\nelse:\r\n\tk+=1\r\nz = max(z,k)\r\nprint(z)", "S=input()\r\nS='A'+S+'A'\r\nVOWEL=\"AEIOUY\"\r\nA0=0\r\nL=[0]\r\nfor i in range(len(S)):\r\n if S[i] in VOWEL:\r\n A1=i\r\n D=A1-A0\r\n A0=A1\r\n L.append(D)\r\nprint(max(L))", "string = input()\n\ncontador = 1\nvocales = [\"A\", \"E\", \"I\", \"O\", \"U\", \"Y\"]\n\ncontador2 = 0\n\nfor letra in string:\n\n if letra not in vocales:\n contador += 1\n elif letra in vocales:\n if contador > contador2:\n contador2 = contador\n contador = 1\n\nif contador > contador2:\n contador2 = contador\n\nprint(contador2) \n \t \t \t \t \t\t\t \t \t \t", "s = input()+'A'\r\nv = 'AEOIUY'\r\nprev = -1\r\ni = 0\r\nmaxj = 1\r\nfor c in s:\r\n if c in v:\r\n maxj = max(maxj, i-prev)\r\n prev = i\r\n i += 1\r\nprint(maxj)\r\n", "s = input()\r\nx = c = 1\r\nfor i, ch in enumerate(s):\r\n if ch not in 'AEIOUY':c += 1\r\n else:\r\n x = max(c, x)\r\n c = 1\r\nprint(max(c, x))", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#---------------------------------\r\n\r\ng='AEIOUY';m=0;p=0\r\nf=list(str(input()))\r\nfor i in range(len(f)):\r\n if g.count(f[i])==0:\r\n p+=1\r\n else:\r\n m=max(m,p+1)\r\n p=0\r\nm=max(m,p+1)\r\nprint(m)", "print(max([*map(len,input().replace('E','A').replace('I','A').replace('O','A').replace('U','A').replace('Y','A').split('A'))])+1)", "gl = 'AEIOUY'\r\ns = 'A' + input() + 'A'\r\nm = 0\r\nprev = -1\r\nfor i in range(len(s)):\r\n if s[i] in gl:\r\n m = max(m, i - prev)\r\n prev = i\r\nprint(m)", "string = input()\nm,c = 1,1\nvowels = ['A','E','I','O','U','Y']\nfor i in string:\n\tif i in vowels:\n\t\tc = 1\n\telse:\n\t\tc+=1\n\tif c > m:\n\t\tm = c\n\nprint(m)", "n = list(input())\r\nm = 0\r\n\r\nres = []\r\n\r\nif n[-1] not in 'AOUYIE':\r\n n += 'A'\r\n\r\nfor i in range(len(n)):\r\n m += 1\r\n if n[i] in 'AOUYIE':\r\n res.append(m)\r\n m = 0\r\n\r\nprint(max(res))", "count = 0\r\nidx = 0\r\nstring = input()\r\n\r\ndef jumpcounter(letter):\r\n global count\r\n global idx\r\n global string\r\n count += 1\r\n if letter in 'AEIOUY':\r\n temp, count = count, 0\r\n idx += 1\r\n return temp\r\n else:\r\n if idx is len(string) - 1:\r\n idx += 1\r\n return count + 1\r\n idx += 1\r\n return count\r\n\r\ndef minjumpability(string):\r\n print(max(set(map(jumpcounter, string))))\r\n\r\n \r\nminjumpability(string)", "a=input()\r\ncount=max=1\r\nfor i in range(len(a)):\r\n if(a[i] not in ['A','E','I','O','U','Y'] and i==(len(a)-1)):\r\n count+=1\r\n if(max<=count):\r\n max=count\r\n elif(a[i] not in ['A','E','I','O','U','Y'] and i!=(len(a)-1)):\r\n count+=1\r\n else:\r\n if(max<=count):\r\n max=count\r\n count=1\r\nprint(max)", "string = input()\n\ngap = 0\nlargest_gap = -1000\nvowels = 0\nct = 0\nfor char in string:\n gap += 1\n if char in \"AEIOUY\":\n gap = 0\n largest_gap = max(largest_gap, gap)\n\nprint(largest_gap + 1)", "vowels = {'A','E','I','O','U','Y'}\r\n\r\nmaxJump = 1\r\ncurrentJump = 1\r\n\r\ns = input()\r\nfor c in s:\r\n if c in vowels:\r\n currentJump = 1\r\n else:\r\n currentJump += 1\r\n if maxJump < currentJump:\r\n maxJump = currentJump\r\nprint(maxJump)", "string = input()\r\njump_ability = 0\r\nsteps = 0\r\nstring = string + \"A\"\r\nfor i in string:\r\n if i not in \"AEIOUY\":\r\n steps = steps + 1\r\n else:\r\n steps = steps + 1\r\n if steps > jump_ability:\r\n jump_ability = steps \r\n steps = 0\r\nprint(jump_ability)", "a=input()\r\nb=list(a)\r\nv = ['A', 'E', 'I', 'O', 'U', 'Y']\r\nm = 0\r\nlast = -1\r\nfor i in range(len(b)):\r\n\tif b[i] in v: \r\n\t\tm = max(m, i - last)\r\n\t\tlast = i\r\nprint (max(m, len(b) - last))", "str = input()\ns1 = str\ns2 = 'A'\nstr = s2 + s1 + s2\nl = len(str)\npos = 0\nans = 0\nfor i in range(0, l):\n if str[i] == 'A' or str[i] == 'E' or str[i] == 'O' or str[i] == 'U' or str[i] == 'I' or str[i] == 'Y' :\n ans = max(ans, i - pos)\n pos = i\nprint(ans)", "s = ' ' + input()\nd = {'A', 'E', 'I', 'O', 'U', 'Y'}\nprev_index, max_dif = 0, 0\nfor i in range(1, len(s)):\n if s[i] in d:\n if i - prev_index > max_dif:\n max_dif = i - prev_index\n prev_index = i\n if i == len(s) - 1:\n if i - prev_index + 1 > max_dif:\n max_dif = i - prev_index + 1\nprint(max_dif)\n", "s,count,Max=input(),1,0\r\nfor i in range(len(s)):\r\n if s[i] in \"AEIOUY\":\r\n Max,count=max(Max,count),1\r\n else: count+=1\r\nprint(max(Max,count))\r\n", "s = 'A' + input() + 'A'\r\nans = last = 0\r\nfor i in range(len(s)):\r\n if s[i] in 'AEIOUY':\r\n ans = max(ans, i - last)\r\n last = i\r\nprint(ans)\r\n", "s = input()\r\ncnt = 0\r\nk = -100\r\nfor i in s:\r\n if i=='A' or i=='E' or i=='I' or i=='O' or i=='U' or i=='Y':\r\n cnt = 0\r\n else:\r\n cnt+=1\r\n k = max(k,cnt)\r\nprint(k+1)\r\n ", "string = str.upper(input())\r\nvowels = ['A', 'E', 'I', 'O', 'U', 'Y']\r\njumps = []\r\njump = 1\r\n\r\nfor c in string:\r\n if c in vowels:\r\n jumps.append(jump)\r\n jump = 1\r\n else:\r\n jump += 1\r\n\r\njumps.append(jump)\r\nprint(max(jumps))", "S=input()\r\nVoyelles = [\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"]\r\nC=0\r\ncmpt=[]\r\nk=0\r\nif len(S) == 1:\r\n if S[0] in Voyelles:\r\n C=1\r\n else:\r\n C=2\r\nelse:\r\n if S[-1] not in Voyelles :\r\n S=S+'A'\r\n if S[0] not in Voyelles:\r\n S='A'+S\r\n for i in range(len(S)):\r\n if S[i] in Voyelles:\r\n cmpt.append(i+1)\r\n for i in range(len(cmpt)-1): \r\n v=cmpt[i+1]-cmpt[i]\r\n if C<v:\r\n C=v\r\n for i in S:\r\n if i in Voyelles:\r\n k=k+1\r\n if k== len(S):\r\n C=1\r\nprint(C)", "alf=['A', 'E', 'I', 'O', 'U' , 'Y']\nstroka=input()\nlist1=[]\nk=[]\nstart=0\nstop=0\nfor i in range (len(stroka)):\n stop=i+1\n if stroka[i] in alf:\n k.append(stop-start)\n start=stop\nk.append(stop-start+1)\nprint(max(k))\n \n", "s=input()\r\nl=[]\r\nz=len(s)+1\r\nans=1\r\n\r\nc=1\r\nfor i in range (len(s)):\r\n if s[i]==\"A\" or s[i]==\"E\" or s[i]==\"I\" or s[i]==\"O\" or s[i]==\"Y\" or s[i]==\"U\":\r\n l.append(i)\r\n# print(l)\r\nif l:\r\n for i in range(len(l)-1):\r\n # c=l[i+1]-l[i]\r\n ans=max(l[i+1]-l[i],ans)\r\n # c=l[i+1]-l[i]\r\n\r\n print(max(ans,l[0]+1,len(s)-l[len(l)-1]))\r\nelse:\r\n print(z)\r\n", "s=input()\r\ns=s+'A'\r\na=\"AEIOUY\"\r\nq=-1\r\nf=1\r\nm=0\r\nfor i in range(len(s)):\r\n if s[i] in a:\r\n m=max(i-q,m)\r\n q = i\r\n f=0\r\nif f==0:\r\n print(m)\r\nelse:\r\n print(len(s)+1)", "stra = list(input())\nvowels = set(['A', 'E', 'I', 'O', 'U','Y'])\n\nlast_spot = -1\nlen_jump = 0\nmax_jump = 0\nfor i, let in enumerate(stra):\n if let in vowels:\n len_jump = i - last_spot\n last_spot = i\n if len_jump > max_jump:\n max_jump = len_jump\n\ni = len(stra)\nlen_jump = i - last_spot\nlast_spot = i\nif len_jump > max_jump:\n max_jump = len_jump\n\nprint(max_jump)\n \t \t \t \t \t \t \t \t\t \t\t\t\t", "s='A'+input()+'A' \r\nbegin=0 \r\nans=0 \r\nv='AEIOUY' \r\nfor i in range(1,len(s)):\r\n if s[i] in v: \r\n end=i \r\n k=end-begin \r\n begin=end \r\n if k>ans:ans=k \r\nprint(ans)", "string = 'A'+str(input())+'A'\r\nmax_distance = 1\r\ntemp_distance = 1\r\nfor i in string:\r\n if i in 'A E I O U Y':\r\n if temp_distance > max_distance:\r\n max_distance = temp_distance\r\n temp_distance = 1\r\n else:\r\n temp_distance += 1\r\nprint(max_distance)\r\n\r\n", "p = -1\r\nr = 0\r\nfor c in 'A'+input()+'A':\r\n\tp += 1\r\n\tif c in 'AEIOUY':\r\n\t\tr = max(r, p)\r\n\t\tp = 0\r\nprint(r)\r\n", "s=input()\r\nm=0\r\nk=1\r\np=0\r\nfor i in s:\r\n if i in \"AEIOUY\":\r\n m=max(m,k-p)\r\n p=k\r\n k+=1\r\nm=max(m,k-p)\r\nprint(m)", "import re\r\ns = input()\r\ns = (re.split('[AEIOUY]', s))\r\nres = list()\r\n\r\nfor i in range(len(s)):\r\n res.append(len(s[i]))\r\n\r\nres.sort(reverse=True)\r\nprint(res[0] + 1)", "def solve(s):\r\n ln=len(s)\r\n ans=0\r\n tmp=-1\r\n i=0\r\n while i<ln:\r\n if s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U'or s[i]=='Y':\r\n ans=max(ans,i-tmp)\r\n tmp=i\r\n i+=1\r\n ans=max(ans,ln-tmp)\r\n return ans\r\n\r\ns=input()\r\nprint(solve(s))\r\n", "s = input(\"\")\r\nconsonants = \"BCDFGHJKLMNPQRSTVWXZ\"\r\n\r\ncurrent_count = 0\r\nmax_length = 0\r\n\r\nfor i in range (len(s)):\r\n if s[i] in consonants:\r\n current_count += 1\r\n max_length = max(max_length, current_count)\r\n else:\r\n current_count = 0\r\n \r\nprint(max_length + 1)\r\n \r\n ", "s = input()\nn = len(s)\ncurr_pos = -1\naux = 1\nd = {}\nvowels = {\"A\",\"E\", \"I\", \"O\", \"U\", \"Y\"}\nfor i in range(n):\n if s[i] in vowels:\n aux = max(i - curr_pos, aux)\n curr_pos = i\n\naux = max(n - curr_pos, aux)\nprint(aux)\n\t \t\t\t \t\t\t \t \t\t \t \t\t \t", "vowels = 'aeiouy'\r\n\r\nletters = input('').lower()\r\n\r\npast = -1\r\ndist = 0\r\nmaxDist = 0\r\n\r\nletters += 'a'\r\n\r\nfor i in range(len(letters)):\r\n if letters[i] in vowels:\r\n dist = i - past\r\n if dist > maxDist:\r\n maxDist = dist\r\n past = i\r\n\r\nprint(maxDist)\r\n", "line = input()\r\nletters = [\"A\", \"E\", \"I\", \"O\", \"U\", \"Y\"]\r\njump = 0\r\nmax_jump = 0\r\n\r\nfor i in line:\r\n jump += 1\r\n if i in letters:\r\n if jump > max_jump:\r\n max_jump = jump\r\n jump = 0\r\n\r\njump += 1\r\nif jump > max_jump:\r\n max_jump = jump\r\n\r\nprint(max_jump)\r\n", "\r\nvowel = \"AEIOUY\"\r\ns = input()\r\ns = 'A' + s + 'A'\r\nans = 0\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] in vowel:\r\n ans = max(ans,i-count)\r\n count = i\r\nprint(ans)\r\n\r\n\r\n", "a = input()\r\nb = ['A', 'E', 'I', 'O', 'U', 'Y']\r\nc = [] \r\nc.append(-1)\r\nfor i in range(len(a)):\r\n if a[i] in b:\r\n c.append(i) \r\nc.append(len(a))\r\nans = 0\r\nfor i in range(len(c) - 1): \r\n ans = max(ans, c[i + 1] - c[i])\r\nprint(ans)\r\n", "string = input()\r\njumps = []\r\ninit = 0\r\nstring = '*' + string + 'A'\r\nif any(t == 'A' or t == 'E'or t =='I' or t =='O'or t =='U' or t =='Y' for t in string):\r\n\tif len(string) == 1:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tfor i in range(len(string)):\r\n\t\t\tif string[i] == 'A' or string[i] == 'E'or string[i] =='I' or string[i] =='O'or string[i] =='U' or string[i] =='Y':\r\n\t\t\t\tdiff = i - init\r\n\t\t\t\tinit = i\r\n\t\t\t\tjumps.extend([abs(diff)])\r\n\tprint(max(jumps))\r\nelse:\r\n\tprint(len(string))", "l=input()\r\nk=1\r\nma=0\r\na=['A','E','I','O','U','Y']\r\nfor i in range(len(l)):\r\n if a.count(l[i])>0:\r\n k=1\r\n if k>ma:\r\n ma=k\r\n else:\r\n k=k+1\r\n if k>ma:\r\n ma=k\r\nprint(ma)\r\n \r\n", "p='AEIOUY'\r\ns=input()\r\ns='Y'+s+'Y'\r\nans=0\r\nbegin=0\r\nfor i in range(len(s)):\r\n if s[i] in p:\r\n ans=max(ans,i-begin)\r\n begin=i\r\nprint(ans)", "s = input()\r\n\r\n\r\nfor i in range (0,len(s)):\r\n if (s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='U' or s[i]=='O' or s[i]=='Y'):\r\n s=s.replace(s[i],'.')\r\n\r\n#print(s)\r\ncount=1\r\nmaksimum=0\r\n\r\nfor i in range (0,len(s)):\r\n if s[i]=='.':\r\n count=1\r\n else:\r\n count=count+1\r\n\r\n maksimum=max(maksimum,count)\r\n\r\nprint(maksimum)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = input()\r\nz = [\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"]\r\nf =0\r\nc =1\r\nfor i in a:\r\n\tif i in z:c =1\r\n\telse:c+=1\r\n\tf = max(f,c)\r\nf = max(f,c)\r\nprint(f)", "x = input()\r\ns = i = 0\r\nfor j in x:\r\n if j in 'AIOUYE':\r\n i = 0\r\n else:\r\n i += 1\r\n s = max(s, i)\r\nprint(s + 1)\r\n", "a = input()\nv = ['A', 'E', 'I', 'O', 'U', 'Y']\nans = -1\ncnt = 0\nfor i in a:\n if i in v:\n cnt += 1\n ans = max(ans, cnt)\n cnt = 0\n else:\n cnt += 1\n\ncnt += 1\n\nans = max(ans, cnt)\nprint(ans)\n", "s = input()\r\nm = 0\r\ntmp = 0\r\nfor i in range(len(s)):\r\n if s[i] in 'AEIOUY':\r\n if m < tmp:\r\n m = tmp\r\n tmp = 0\r\n else:\r\n tmp += 1\r\n if i == len(s) - 1:\r\n if m < tmp:\r\n m = tmp\r\n tmp = 0\r\nprint(m+1)\r\n", "b=\"a\"+input().lower()+\"a\"\r\nc=0\r\nz=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\np=[]\r\nv=[]\r\nfor j in range(len(b)):\r\n if b[j] in z:\r\n p+=[j+1]\r\njump=0\r\nfor k in range(len(p)-1):\r\n v+=[p[k+1]-p[k]]\r\n\r\nprint(max(v))\r\n\r\n\r\n\r\n", "vowels = [\"A\", \"E\", \"I\", \"O\", \"U\", \"Y\"]\r\n\r\nstring = input()\r\n\r\njump = 1\r\nbig_jump = 1\r\n\r\nfor i in string:\r\n try:\r\n vowels.index(i)\r\n\r\n if jump > big_jump:\r\n big_jump = jump\r\n\r\n jump = 1\r\n\r\n except ValueError:\r\n jump += 1\r\n\r\nif jump > big_jump:\r\n big_jump = jump\r\n\r\n\r\nprint(big_jump)\r\n", "a = input()\ncount = 1\nbasis=1\n\nfor b in a:\n if b.isalpha():\n if b in \"AEIOUY\":\n count = 1\n else:\n count += 1\n if count > basis:\n basis = count\nprint(basis)", "s=input()\r\ns='A'+s+'A'\r\nbeg=0\r\nend=0\r\nj=0\r\nv='AEIOUY'\r\nfor i in range(1,len(s)):\r\n if s[i] in v:\r\n end=i\r\n if (end-beg)>j:\r\n j=end-beg\r\n beg=end\r\nprint(j)", "s=input()\r\na=['A','E','O','I','U','Y']\r\nc=0\r\nx=0\r\nfor i in range(len(s)):\r\n c+=1\r\n if(s[i] in a):\r\n x=max(c,x)\r\n c=0\r\nc+=1\r\nprint(max(c,x))\r\n", "n=input()\r\nn=n+\"A\"\r\ncnt=1\r\nl=[]\r\nfor t in n:\r\n if(t==\"A\" or t==\"E\" or t==\"I\" or t==\"O\" or t==\"U\" or t==\"Y\"):\r\n l.append(cnt)\r\n cnt=1\r\n else:\r\n cnt=cnt+1\r\nprint(max(l))", "s = input()\r\ns += \"A\"\r\nres = []\r\nc = 0\r\nfor i in range(len(s)):\r\n if s[i]!=\"A\" and s[i]!=\"E\" and s[i]!=\"I\" and s[i]!=\"O\" and s[i]!=\"U\" and s[i]!=\"Y\":\r\n c += 1\r\n if s[i]==\"A\" or s[i]==\"E\" or s[i]==\"I\" or s[i]==\"O\" or s[i]==\"U\" or s[i]==\"Y\":\r\n res.append(c+1)\r\n c = 0\r\n \r\n\r\n\r\nprint(max(res))", "'''n=int(input())\r\np=input().rstrip().split(' ')\r\nif int(p[1])==7 or int(p[0])==7:\r\n print(0)\r\nelif int(p[1])>7:\r\n for i in range(int(p[1]),-1,-1):\r\n T=list(str(i))\r\n if '7' in T:\r\n V=i;\r\n break;\r\n B=int(p[1])-V;\r\n print(B//n)\r\nelse:\r\n B=3+int(p[1])\r\n print(B//n)'''\r\n\r\n\r\n\r\ns=input().rstrip()\r\nx=list(s)\r\nS=0;\r\nw=[]\r\nl=['A','E','I','O','U','Y']\r\nfor i in range(0,len(x)):\r\n if x[i] in l:\r\n w.append(i+1-S)\r\n S=i+1;\r\nw.append(len(x)+1-S)\r\nprint(max(w))", "s = input()\n\nres = 0\ncurr = 0\nfor i in s:\n if i not in \"AEIOUY\":\n curr += 1\n else:\n res = max(res, curr+1)\n curr = 0\nprint(max(res, curr+1))", "c = 1\r\nm = 1\r\nfor i in list(input()):\r\n if i in 'AEIOUY':\r\n if c > m:\r\n m = c\r\n c = 0\r\n c += 1\r\nif c > m:\r\n m = c\r\nprint(m)", "m = 0\r\nc = 0\r\nfor i in input():\r\n if i in [\"A\", \"E\", \"O\", \"U\", \"I\", \"Y\"]:\r\n c = 0\r\n else:\r\n c += 1\r\n m = max(m, c)\r\nprint(m + 1)", "_str=input()\n_str=_str.lower()\ncounter=0\n_max=0\nv=\"aeiouy\"\n\n\nfor i in _str:\n if i in v:\n if counter > _max:\n _max=counter\n counter=0\n else:\n counter=0\n elif i not in v:\n counter+=1\n \nif counter > _max:\n _max = counter\n \nprint(_max+1)\n", "a = input()\r\ncount = 1\r\nbasis = 1\r\nfor b in a:\r\n if b.isalpha():\r\n if b in \"AEIOUY\":\r\n count = 1\r\n else:\r\n count += 1\r\n if count>basis:\r\n basis = count\r\nprint(basis)\r\n", "s=list(input())+['A']\r\nvow=['A','E','I','O','U','Y']\r\ndec=[]\r\nx=1\r\nfor i in range(len(s)):\r\n if s[i] in vow:\r\n dec.append(x)\r\n x=1\r\n else:\r\n x+=1\r\nprint(max(dec))", "s = str(input())\r\ni = 0\r\nprev_count = 0\r\nvowels = ['A', 'E', 'I', 'O', 'U', 'Y']\r\n\r\nwhile i < len(s):\r\n count = 1\r\n while i < len(s) and s[i] not in vowels:\r\n i+=1\r\n count+=1\r\n i+=1\r\n if count > prev_count:\r\n prev_count = count\r\n count = 1\r\n elif count < prev_count or count == prev_count:\r\n count = 1\r\n \r\n\r\nprint(prev_count)\r\n \r\n \r\n \r\n", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n a = [i for i, c in enumerate('A' + input() + 'A') if c in 'AEIOUY']\r\n print(max(b - a for a, b in zip(a, a[1:])))", "s=input()\r\ni=-1\r\nans=0\r\nfor j in range(len(s)):\r\n if s[j] in \"AEIOUY\":\r\n ans=max(ans,j-i)\r\n i=j\r\nans=max(ans,len(s)-i)\r\nprint(ans)", "s = input()\r\ns += \"A\"\r\ncount = 1\r\nmax_count = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] in ['A', 'E', 'I', 'O', 'U', 'Y']:\r\n if count > max_count:\r\n max_count = count\r\n count = 1\r\n else:\r\n count += 1\r\n\r\nprint(max_count)\r\n", "s = input()\r\n\r\nv = ['A', 'E', 'I', 'O', 'U' ,'Y']\r\ni = -1\r\nm = 0\r\nwhile i < len(s):\r\n prev = i\r\n j = prev + 1\r\n while j < len(s) and s[j] not in v:\r\n j += 1\r\n \r\n if m < j - prev:\r\n m = j - prev\r\n \r\n prev = j\r\n i = prev\r\n\r\nprint(m)", "y = \"AEIOUY\"\r\nN = input()\r\nt = 0\r\nr = -1\r\nfor i in range(len(N)):\r\n if N[i]in y:\r\n t = max(t, i - r)\r\n r = i\r\nprint(max(t, len(N) - r))", "x = 'AEIOUY'\r\npos = -1\r\na = input()\r\nans = 0\r\nn = len(a)\r\nfor i in range(n):\r\n if a[i] in x:\r\n ans = max(ans, i-pos)\r\n pos = i\r\nprint(max(ans, n-pos))", "n = input()\r\ng = n.replace('A', ' ').replace('E', ' ').replace('I', ' ').replace('O', ' ').replace('U', ' ').replace('Y', ' ')\r\nk = 0\r\nfor i in g.split():\r\n k = max(k, len(i))\r\nprint(k + 1)\r\n", "S=input()\nVoyelles = [\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\"]\nC=0\ncmpt=[]\nk=0\nif len(S) == 1:\n if S[0] in Voyelles:\n C=1\n else:\n C=2\nelse:\n if S[-1] not in Voyelles :\n S=S+'A'\n if S[0] not in Voyelles:\n S='A'+S\n for i in range(len(S)):\n if S[i] in Voyelles:\n cmpt.append(i+1)\n for i in range(len(cmpt)-1): \n v=cmpt[i+1]-cmpt[i]\n if C<v:\n C=v\n for i in S:\n if i in Voyelles:\n k=k+1\n if k== len(S):\n C=1\nprint(C)", "s = input() + 'A'\r\nm=1\r\n_m=1\r\nfor c in s:\r\n\tif c in \"AEIOUY\":\r\n\t\tm = max(m, _m)\r\n\t\t_m = 1\r\n\telse:\r\n\t\t_m += 1\r\nprint(m)\r\n", "def main(string):\r\n glas = 'AEIOUY'\r\n m = 0\r\n t = 0\r\n for i in range(len(string)):\r\n if string[i] in glas:\r\n if m<t:\r\n m = t\r\n t = 0\r\n else:\r\n t+=1\r\n if i==len(string)-1:\r\n if m<t:\r\n m = t\r\n t = 0\r\n return m+1\r\n\r\n\r\nprint(main(input()))", "string = input()\r\njump = 0\r\ntemp = 0\r\nfor i in string.upper():\r\n if(i == 'A' or i == 'E' or i == 'I' or i == 'O' or i == 'U' or i == 'Y'):\r\n jump += 1\r\n if (jump > temp):\r\n temp = jump\r\n jump = 0 \r\n else:\r\n jump += 1\r\n \r\njump += 1\r\nif (jump > temp):\r\n temp = jump\r\nprint(temp)", "S=' '+input()+'A';ans=0\r\nY='AEIOUY';s=0\r\nfor i in range(len(S)):\r\n if S[i] in Y:\r\n e=i\r\n if ans<e-s:\r\n ans=e-s\r\n s=e\r\nprint(ans)\r\n ", "n=input()\r\ns=0\r\nlst=[]\r\nz=0\r\nfor i in n:\r\n if(i!='A' and i!='E' and i!='I' and i!='O' and i!='U' and i!='Y'):\r\n s=s+1\r\n z=0\r\n else:\r\n z=z+1\r\n s=s+1\r\n lst.append(s)\r\n s=0\r\nif(z==0):\r\n lst.append(s+1)\r\nprint(max(lst))\r\n", "vowels = \"AEIOUY\"\r\n\r\ns = input()\r\npos = [0] + [i+1 for i in range(len(s)) if s[i] in vowels] + [len(s) + 1]\r\nprint(max([pos[j] - pos[j-1] for j in range(1, len(pos))]))\r\n ", "ans = 1\r\ns = input()\r\n\r\nm = 1\r\n\r\nvowel = ['A', 'E', 'I', 'O', 'U','Y']\r\n\r\nfor i in range(len(s)):\r\n if s[i] not in vowel:\r\n m += 1\r\n ans = max(ans, m)\r\n else:\r\n m = 1\r\nprint(ans)\r\n", "a,b=1,1\r\nfor i in input()+'A':\r\n if i in 'AEIOUY':\r\n a=max(a,b)\r\n b=1\r\n else:\r\n b+=1\r\nprint(a)", "ruler = input()\r\nvowels = 'A E I O U Y'.split()\r\njump = jump_max = 1\r\n\r\nfor letter in ruler:\r\n jump += 1\r\n \r\n if letter in vowels:\r\n jump = 1\r\n\r\n if jump_max < jump:\r\n jump_max = jump\r\n\r\nprint(jump_max)\r\n", "a=0\r\nb=0\r\nc=0\r\nfor i in input()+'A':\r\n\ta+=1\r\n\tif i in 'AEIOUY':\r\n\t\tb=max(b,a-c)\r\n\t\tc=a\r\nprint(b)", "a = input()\r\nvowels = \"AEIOUY\"\r\ncount = 1\r\ntemp = 1\r\nfor i in range(len(a)):\r\n if a[i] in vowels:\r\n temp = 1\r\n else:\r\n temp += 1\r\n count = max(count, temp)\r\nprint(count)\r\n", "# Grasshopper and the string\ndef hopper(s):\n vals = [0]\n vowels = 'AEIOUY'\n for i, n in enumerate(s):\n if n in vowels:\n vals.append(i + 1)\n vals.append(len(s) + 1)\n ans = 0\n for i in range(1, len(vals)):\n val = vals[i] - vals[i-1]\n ans = max(ans, val)\n return ans\n\n\n\n\ns = input()\nprint(hopper(s))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip().decode())\r\nx = set(list(\"AEIOUY\"))\r\nans, c = 1, 1\r\nfor i in s:\r\n if not i in x:\r\n c += 1\r\n else:\r\n c = 1\r\n ans = max(ans, c)\r\nprint(ans)", "str = input()\r\ns1 = str\r\ns2 = 'A'\r\nstr = s2 + s1 + s2\r\nl = len(str)\r\npos = 0\r\nans = 0\r\nfor i in range(0, l):\r\n if str[i] == 'A' or str[i] == 'E' or str[i] == 'O' or str[i] == 'U' or str[i] == 'I' or str[i] == 'Y' :\r\n ans = max(ans, i - pos)\r\n pos = i\r\nprint(ans)", "l = list(input())\nv = ['A', 'E', 'I', 'O', 'U', 'Y']\nm = 0\nlast = -1\nfor i in range(len(l)):\n if l[i] in v:\n m = max(m, i - last)\n last = i\nprint(max(m, len(l) - last))", "s=input()\r\ns=s+'A'\r\na=\"AEIOUY\"\r\nq=-1\r\nf=1\r\nm=0\r\nfor i in range(len(s)):\r\n if s[i] in a:\r\n m=max(i-q,m)\r\n q = i\r\n f=0\r\nprint(m)", "s='A'+input()+'A';ans=0\r\nY='AEIOUY';s1=0\r\nfor i in range(len(s)):\r\n if s[i] in Y:\r\n e=i\r\n if ans<e-s1:ans=e-s1\r\n s1=e\r\nprint(ans)", "s = input()+' '\r\na = ['A', 'U', 'Y', 'E', 'O', 'I']\r\nb = 0\r\nc = 0\r\nfor i in s:\r\n c += 1\r\n if i in a:\r\n if b < c:\r\n b = c\r\n c = 0\r\nif b < c:\r\n b = c\r\nprint(b)", "str1=input()\r\nlist1=list(str1)\r\n\r\npos=0\r\nlistNew=[]\r\n\r\nfor i in range(len(list1)):\r\n if list1[i]=='A' or list1[i]=='E' or list1[i]=='I' or list1[i]=='O' or list1[i]=='U' or list1[i]=='Y':\r\n listNew.append((i+1)-pos)\r\n pos=i+1\r\n\r\npos-=1\r\nlistNew.append(len(list1)-pos)\r\nprint(max(listNew))\r\n", "vowels = \"AEIOUY\"\ns = input()\nMax = -1\ntool = 1\nfor i in s:\n if i in vowels:\n if tool > Max:\n Max = tool\n tool = 1\n else:\n tool+=1\nprint(max(tool,Max))\n", "v = \"AEIOUY\"\r\ns = \"A\" + input() + \"A\"\r\nx = 0 #begin\r\ny = 0\r\ne = 0 #ans\r\nfor i in range(1, len(s)):\r\n if s[i] in v:\r\n x = i\r\n te = x-y\r\n y = x\r\n if te > e:\r\n e = te\r\nprint(e)", "jump_point = ['A', 'E', 'I', 'O', 'U', 'Y']\r\nn = list(input())\r\ncount = 1\r\nmax_jump = 1\r\nfor i in range(len(n)):\r\n if n[i] not in jump_point:\r\n count += 1\r\n if max_jump < count:\r\n max_jump = count\r\n else:\r\n pass\r\n else:\r\n count = 1\r\n\r\nprint(max_jump)\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/733/A\n\"\"\"\nchaine = input() + \"Z\"\n\nsautmax = 0\ncompte = 0\nfor c in chaine:\n compte += 1\n if c in \"AEIOUY\":\n if compte > sautmax:\n sautmax = compte\n compte = 0\nif compte > sautmax:\n sautmax = compte\n\nprint(sautmax)\n", "def main():\r\n vowels = \"AEIOUY\"\r\n paper = input()\r\n\r\n current_max = 0\r\n current = 0\r\n\r\n for c in paper:\r\n current += 1\r\n\r\n if c in vowels:\r\n if current > current_max:\r\n current_max = current\r\n current = 0\r\n\r\n current += 1\r\n if current > current_max:\r\n current_max = current\r\n\r\n print(current_max)\r\n\r\nmain()\r\n", "q=input()\r\nw=-2\r\ne=-1\r\nt=[]\r\nfor r in range(len(q)):\r\n if q[r] in 'AEIOUY':\r\n w,e=e,r\r\n t.append(e-w)\r\nt.append(len(q)-e)\r\nprint(max(t))", "s = input()\r\n\r\nvow = {'A', 'E', 'I', 'O', 'U', 'Y'}\r\n\r\npos = set()\r\n\r\nfor i, x in enumerate(s):\r\n if x in vow:\r\n pos.add(i)\r\n\r\nans = 0\r\n\r\nprev = -1\r\n\r\npos = sorted(list(pos))\r\n\r\nfor x in pos:\r\n ans = max(x - prev, ans)\r\n prev = x\r\n\r\nans = max(len(s) - prev, ans)\r\n\r\nprint(ans)\r\n\r\n#TXULTFSBUBFLRNQORMMULWNVLPWTYJXZBPBGAWNX", "s = input()\r\nn = len(s)\r\nv = 'AEIOUY'\r\nc, j = 0, -1\r\nfor i in range(n):\r\n if(s[i] in v):\r\n c = max(c, i - j)\r\n j = i\r\nc = max(c, n - j)\r\nprint(c)", "w = input().lower()\r\nv = ['a','e','i','o','u','y']\r\na = 1\r\nm = 1\r\nfor x in w:\r\n if(x not in v):\r\n m+=1\r\n elif(x in v):\r\n if(m>a):\r\n a=m\r\n m=1\r\nif(m>a):\r\n a=m\r\nprint(a)\r\n ", "s = input()\r\na = [ 'A', 'E', 'I', 'O', 'U', 'Y']\r\nj = 1\r\nc = 1\r\nfor i in s:\r\n if i not in a:\r\n c += 1\r\n j = max(j,c)\r\n else:\r\n c = 1\r\nprint(j)", "vowels = [\"A\", \"E\", \"I\", \"O\", \"U\",\"Y\"]\r\n\r\ns = input()\r\nc = 1\r\njump = 1\r\nfor ch in s:\r\n if ch not in vowels:\r\n c = c+1\r\n jump = max(c, jump)\r\n else:\r\n c = 1\r\n\r\nprint(jump)", "s='A'+input()+'A'\r\nbegin=0\r\nans=0\r\nv='AEIOUY'\r\nfor i in range(1,len(s)):\r\n if s[i] in v:\r\n end=i\r\n k=end-begin\r\n begin=end\r\n if k>ans:ans=k\r\nprint(ans)", "maxn,long = 1,1\r\nfor i in input().strip():\r\n if i in ['A','E','I','O','U','Y']:\r\n long = 1\r\n else:\r\n long += 1\r\n maxn = max(maxn,long)\r\nprint(maxn)", "s=input()\r\nv=['A','E','I','O','U','Y']\r\ncount=0\r\nmax=0\r\nfor i in s:\r\n if i in v:\r\n count=0\r\n else:\r\n count+=1\r\n if count>max:\r\n max=count\r\nprint(max+1) \r\n", "s = input()\r\nj = 0\r\ndistance = [0 for x in range(len(s))]\r\nm = 0\r\n\r\nfor i in range(0, len(s)):\r\n if s[i] in 'AEIOUY':\r\n j += 1\r\n else:\r\n distance[j] += 1\r\n m = max(distance[j], m)\r\nprint(m+1)\r\n", "a = input()\r\ngl = ['A', 'E', 'I', 'O', 'U', 'Y']\r\nsm = 0\r\ns = 0\r\nfor i in a:\r\n if i not in gl:\r\n s += 1\r\n else:\r\n s = 0\r\n if sm < s:\r\n sm = s\r\nprint(sm + 1)\r\n\r\n\r\n", "s = list(input())\r\nans = 0\r\nability = 1\r\nfor x in range(len(s)):\r\n if s[x] not in [\"A\",\"E\",\"I\",\"O\",\"U\", \"Y\"]:\r\n ability += 1\r\n else:\r\n ability = 1\r\n ans = max(ans,ability)\r\nprint(ans)", "s=input()\r\ncount = 1\r\nmaxa = 0\r\nfor i in range(0,len(s)):\r\n if s[i]=='A' or s[i]=='E' or s[i]=='I' or s[i]=='O' or s[i]=='U' or s[i]=='Y': \r\n count = 1\r\n else:\r\n count += 1\r\n if(count>maxa):\r\n maxa = count\r\nprint(maxa)\r\n ", "def solve(s):\n cur = 0\n maxi = 0\n for i in s[1:]:\n if i in 'AEIOUY':\n cur += 1\n maxi = max(maxi, cur)\n cur = 0\n else:\n cur += 1\n return maxi\n\n\ndef main():\n s = 'A' + input() + 'A'\n print(solve(s))\n\n\nmain()\n", "s = input()\nvowels = ['A', 'E', 'I', 'O', 'U', 'Y']\n\nmaxdist = 1\ndistance = 1\nfor i in range(len(s)):\n if s[i] in vowels:\n if distance > maxdist:\n maxdist = distance\n\n distance = 1\n continue\n\n distance += 1\n\nif distance > maxdist:\n maxdist = distance\n\nprint(maxdist)\n\t \t \t\t \t \t\t\t\t \t \t \t\t\t\t\t \t\t\t", "import re;print(max(map(len,re.split('[AEIOUY]',input())))+1)", "s=0;k=0;i=0\r\nfor j in input()+\"A\":\r\n i+=1\r\n if j in \"AEIOUY\":k=max(k,i-s);s=i\r\nprint(k)", "s = input()+'A'\r\nvowels = ['A', 'E', 'I', 'O', 'U', 'Y']\r\njumps = 0\r\njump = 0\r\nfor i in s:\r\n if i in vowels:\r\n jump+=1\r\n if jump>jumps:\r\n jumps = jump\r\n jump = 0\r\n else:\r\n jump+=1\r\nprint(jumps)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nl = 'AEIOUY'\r\n\r\ns = 'A' + input()[:-1] + 'A'\r\nd, c = [], 0\r\nfor i in range(1, len(s)):\r\n if s[i] in l:\r\n d.append(i-c)\r\n c = i\r\nprint(max(d))", "a=input()\r\nl=[]\r\nt=0\r\nfor i in a:\r\n if i==\"A\" or i==\"E\" or i==\"I\" or i==\"O\" or i==\"U\" or i==\"Y\":\r\n t +=1\r\n l +=[t]\r\n t=0\r\n else:\r\n t +=1\r\nelse:\r\n l +=[t+1]\r\n print(max(l))\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 numbers = list(map(int, input().split()))\r\n n = numbers[0]\r\n m = numbers[1]\r\n moves = [[0] * (n + 4) for _ in range(n + 4)]\r\n for i in range(m):\r\n listOfMoves = list(map(int, input().split()))\r\n x = listOfMoves[0]\r\n y = listOfMoves[1]\r\n for a in range(x, x + 3):\r\n for b in range(y, y + 3):\r\n moves[a][b] = moves[a][b] + 1\r\n if moves[a][b] == 9:\r\n print(i + 1)\r\n quit()\r\n print(-1)", "n,m = map(int,input().split())\r\ngrid = [[0 for i in range(n)] for j in range(n)]\r\nfor tc in range(m):\r\n r,c = map(int,input().split())\r\n r -= 1\r\n c -= 1\r\n ok = False\r\n for i in range(r-1,r+2):\r\n for j in range(c-1,c+2):\r\n # print(i,j)\r\n if 0 <= i and i < n and 0 <= j and j < n:\r\n grid[i][j] += 1\r\n if grid[i][j] == 9:\r\n ok = True\r\n if ok:\r\n print(tc+1)\r\n exit()\r\nprint(-1)\r\n", "n, m = map(int, input().split())\r\nc = [[0] * (n + 4) for _ in range(n + 4)]\r\nfor l in range(m):\r\n x, y = map(int, input().split())\r\n for i in range(x, x + 3):\r\n for j in range(y, y + 3):\r\n c[i][j] += 1\r\n if c[i][j] == 9:\r\n print(l + 1)\r\n quit()\r\nprint(-1)", "def f():\n\n n, m = map(int, input().split())\n\n p = [[0] * (n + 2) for i in range(n + 2)]\n\n for k in range(m):\n\n x, y = map(int, input().split())\n\n for i in range(x - 1, x + 2):\n\n for j in range(y - 1, y + 2):\n\n if p[i][j] == 8: return k + 1\n\n p[i][j] += 1\n\n return -1\n\nprint(f())\n\n\n\n# Made By Mostafa_Khaled", "n, m = map(int, input().split())\r\narr = [[0] * (n+4) for _ in range(n+4)]\r\nfor c in range(m):\r\n x, y = map(int, input().split())\r\n for i in range(x, x + 3):\r\n for j in range(y, y + 3):\r\n arr[i][j] += 1\r\n if arr[i][j] == 9:\r\n print(c + 1)\r\n exit()\r\nprint(-1)\r\n", "'''\r\n4 11\r\n1 1\r\n1 2\r\n1 3\r\n2 2\r\n2 3\r\n1 4\r\n2 4\r\n3 4\r\n3 2\r\n3 3\r\n4 1\r\n'''\r\nn, m = map(int, input().split())\r\n\r\ngrid = []\r\nfor i in range(n):\r\n grid.append([0] * n)\r\nans = -1\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if ans>0:\r\n continue\r\n a-=1\r\n b-=1\r\n \r\n for nA in range(max(a-1, 0), min(a+2, n-1)):\r\n for nB in range(max(b-1, 0), min(b+2, n-1)):\r\n grid[nA][nB] += 1\r\n if grid[nA][nB] >= 9:\r\n ans = i+1\r\n break\r\n \r\nprint(ans)", "a,b=map(int,input().split())\r\nz=[[0]*(a+4) for i in range(a+4)]\r\ndef gh(i,j):\r\n for i1 in range(i-2,i+1):\r\n for j1 in range(j-2,j+1):\r\n if i1<1 or j1<1:continue\r\n ok=True\r\n for i2 in range(i1,i1+3):\r\n for j2 in range(j1,j1+3):\r\n if z[i2][j2]==0:ok=False;break\r\n if not(ok):break\r\n if ok:return ok\r\n return False\r\n\r\nfor _ in range(1,b+1):\r\n u,v=map(int,input().split())\r\n z[u][v]=1\r\n if gh(u,v):exit(print(_))\r\nprint(-1)", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,m=map(int,input().split())\r\nblack=[[False]*(n+10) for i in range(n+10)]\r\nfor i in range(1,m+1):\r\n x,y=map(lambda x:int(x)+5,input().split())\r\n black[x][y]=True\r\n for lx in range(x-2,x+1):\r\n for ly in range(y-2,y+1):\r\n cnt=0\r\n for dx in range(3):\r\n for dy in range(3):\r\n cnt+=black[lx+dx][ly+dy]\r\n if cnt==9:\r\n print(i)\r\n exit()\r\n\r\nprint(-1)", "def solve_case():\n n, m = map(int, input().split())\n count = [None] * n\n for i in range(n):\n count[i] = [0] * n\n ans = -1\n for k in range(m):\n x, y = map(int, input().split())\n x -= 1\n y -= 1\n found = False\n for i in range(x-2, x+1):\n for j in range(y-2, y+1):\n if i >= 0 and i < n and j >= 0 and j < n:\n count[i][j] += 1\n if count[i][j] == 9:\n found = True\n if found:\n ans = k + 1\n break\n print(ans)\n\nsolve_case()", "R=lambda:map(int,input().split())\r\nn,m=R()\r\nif n<3 or m<9:\r\n print(-1)\r\n exit()\r\na=[[0]*(n-2) for i in range(n-2)]\r\nfor i in range(1,m+1):\r\n x,y=R()\r\n x-=1\r\n y-=1\r\n for x0 in range(x-2,x+1):\r\n for y0 in range(y-2,y+1):\r\n if x0<0 or y0<0 or x0>=n-2 or y0>=n-2:\r\n continue\r\n a[x0][y0]+=1\r\n if a[x0][y0]==9:\r\n print(i)\r\n exit()\r\nprint(-1)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * n + v\r\n\r\nn, m = map(int, input().split())\r\ns = [0] * (n * n)\r\nans = -1\r\nxy = [tuple(map(int, input().split())) for _ in range(m)]\r\nfor k in range(m):\r\n x, y = xy[k]\r\n x, y = x - 1, y - 1\r\n s[f(x, y)] = 1\r\n for i in range(x - 2, x + 1):\r\n if not 0 <= i < i + 2 < n:\r\n continue\r\n for j in range(y - 2, y + 1):\r\n if not 0 <= j < j + 2 < n:\r\n continue\r\n ok = 1\r\n for u in range(i, i + 3):\r\n for v in range(j, j + 3):\r\n if not s[f(u, v)]:\r\n ok = 0\r\n break\r\n if not ok:\r\n break\r\n if ok:\r\n ans = k + 1\r\n if ans ^ -1:\r\n break\r\nprint(ans)", "n, m = map(int, input().split())\r\na = [[0 for i in range(n + 2)] for i in range(n + 2)]\r\n\r\nanswer = -1\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n a[x-1][y-1] += 1\r\n a[x-1][y] += 1\r\n a[x-1][y+1] += 1\r\n a[x][y-1] += 1\r\n a[x][y] += 1\r\n a[x][y+1] += 1\r\n a[x+1][y-1] += 1\r\n a[x+1][y] += 1\r\n a[x+1][y+1] += 1\r\n if max(a[x-1][y-1], a[x-1][y], a[x-1][y+1],\r\n a[x][y-1], a[x][y], a[x][y+1],\r\n a[x+1][y-1], a[x+1][y], a[x+1][y+1]) == 9:\r\n answer = i + 1\r\n break\r\n\r\nprint(answer)", "read = lambda: map(int, input().split())\r\nxy = [[0]*1002 for i in range(1002)]\r\nn, m = read()\r\nfor i in range(m):\r\n x, y = read()\r\n for j in range(x-1, x+2):\r\n for k in range(y-1, y+2):\r\n xy[j][k] += 1\r\n if xy[j][k] is 9:\r\n print(i+1)\r\n exit()\r\nprint(-1)", "def read():\r\n return map(int, input().split())\r\n\r\nif __name__ == \"__main__\":\r\n n, m = read()\r\n mat = [[0 for i in range(n)] for j in range(n)]\r\n step = -1\r\n for i in range(m):\r\n x, y = read()\r\n for dx in range(-1, 2):\r\n for dy in range(-1, 2):\r\n if 0 <= x + dx < n and 0 <= y + dy < n:\r\n mat[x + dx][y + dy] += 1\r\n if mat[x + dx][y + dy] == 9:\r\n if step == -1:\r\n step = i + 1\r\n\r\n print(step)\r\n" ]

[ "firstLine = input();\nn, k = firstLine.split();\nn = int(n);\nk = int(k);\n\ns = input();\n\nresult = 0;\ncount = [0] * 26\n\nfor i in range(0, len(s)):\n index = ord(s[i]) - 65;\n count[index] = count[index] + 1;\n \ncount.sort(reverse=True)\n\n\n\nfor j in range(0, len(count)):\n\n if(count[j] <= k):\n result = result + (count[j]*count[j]);\n k = k - count[j];\n if(k==0): break\n else:\n result = result + (k*k);\n break\n \nprint(result)\n\t\t\t\t \t \t \t \t\t \t \t\t \t \t\t", "n,k=map(int,input().split())\r\ns=input()\r\nlst=list()\r\nc=str.count\r\nind=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nfor i in ind:\r\n if(c(s,i)!=0):\r\n lst.append(c(s,i))\r\nlst.sort()\r\nlst.reverse()\r\nans=0\r\nfor i in lst:\r\n ans+=min(k,i)**2\r\n k=k-min(k,i)\r\n if(k==0):break\r\nprint(ans)\r\n \r\n \r\n\r\n", "n, k = map(int, input().split())\r\ns = input().strip()\r\ncnt = dict()\r\nfor i in s:\r\n if i not in cnt:\r\n cnt[i] = 0\r\n cnt[i] += 1\r\na = []\r\nfor i in cnt:\r\n a.append(cnt[i])\r\na.sort(reverse=True)\r\ncn = 0\r\nans = 0\r\nfor i in range(len(a)):\r\n if a[i] + cn <= k:\r\n ans += a[i] * a[i]\r\n cn += a[i]\r\n else:\r\n ans += (k - cn) * (k - cn)\r\n break\r\nprint(ans)\r\n", "nk = list(map(int, input().rstrip().split()))\r\ns=input()\r\ncount=[]\r\nst=[]\r\nfor i in s:\r\n if i in st:\r\n count[st.index(i)]+=1\r\n else:\r\n st.append(i)\r\n count.append(1)\r\ncount.sort()\r\ncount.reverse()\r\ns=0\r\nans=0\r\nfor i in count:\r\n s=s+i\r\n if s<=nk[1]:\r\n ans+=i*i\r\n else:\r\n s=s-i\r\n ans+=(nk[1]-s)*(nk[1]-s)\r\n break\r\nprint(ans)\r\n", "def appleman_and_card_game(): # inefficient af but im lazy\r\n alphabet = {\"A\": 0, \"B\": 0, \"C\": 0, \"D\": 0, \"E\": 0, \"F\": 0,\r\n \"G\": 0, \"H\": 0, \"I\": 0, \"J\": 0, \"K\": 0, \"L\": 0,\r\n \"M\": 0, \"N\": 0, \"O\": 0, \"P\": 0, \"Q\": 0, \"R\": 0,\r\n \"S\": 0, \"T\": 0, \"U\": 0, \"V\": 0, \"W\": 0, \"X\": 0, \"Y\": 0,\r\n \"Z\": 0}\r\n n, k = list(map(int, input().split(\" \")))\r\n for letter in input():\r\n alphabet[letter] += 1\r\n array = sorted(list(alphabet.values()))\r\n array.reverse()\r\n counter = 0\r\n money = 0\r\n while k > 0:\r\n if array[counter] <= k:\r\n money += array[counter] * array[counter]\r\n k -= array[counter]\r\n counter += 1\r\n else:\r\n money += k * k\r\n k = 0\r\n print(money)\r\n\r\n\r\nappleman_and_card_game()", "this=input()\r\nhurry=this.split()\r\nn=int(hurry[0])\r\nk=int(hurry[1])\r\nthen=input()\r\nthelist=[]\r\ni=0\r\nwhile i<len(then):\r\n thelist.append(then[i])\r\n i+=1\r\n#print(thelist)\r\n\r\nchecked=[]\r\ncounts=[]\r\nfor item in thelist:\r\n if item not in checked:\r\n checked.append(item)\r\n counts.append(thelist.count(item))\r\n#print(checked)\r\n#print(counts)\r\nthetotal=0\r\nwhile k>0:\r\n x=max(counts)\r\n if x>=k:\r\n print(thetotal+k*k)\r\n k=0\r\n else:\r\n thetotal+= x*x\r\n k-=x\r\n q=counts.index(x)\r\n #print(q)\r\n counts.remove(x)\r\n checked.remove(checked[q])\r\n", "n, k = map(int, input().split())\r\ns = input()\r\nd = [0] * (26)\r\nfor i in s:\r\n j = ord(i) - ord('A')\r\n d[j] += 1 \r\n \r\nd.sort()\r\ns = 0\r\nfor i in range(25, -1, -1):\r\n a = max(0, min(k, d[i]))\r\n s += a * a \r\n k -= a \r\nprint(s)", "from collections import *\r\nn,k=map(int,input().split())\r\ns=input()\r\nl=dict(Counter(s))\r\nl=sorted(l.items(),reverse=True,key=lambda x:(x[1],x[0]))\r\nc=0\r\nfor x,y in l:\r\n if k>=y:\r\n k=k-y\r\n c=c+y*y\r\n else:\r\n c=c+k*k\r\n break\r\nprint(c)\r\n\r\n\r\n\r\n", "def maxim():\r\n\tm = 0\r\n\tindex = 0\r\n\tfor i in range(26):\r\n\t\tif(not visited[i] and arr[i] > m):\r\n\t\t\tm = arr[i]\r\n\t\t\tindex = i\r\n\tvisited[index] = True\r\n\treturn m\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\narr = [0]*26\r\nfor i in range(n):\r\n\tarr[ord(s[i])-ord(\"A\")] += 1\r\ni = 0\r\nvisited = [False]*26\r\nm = maxim()\r\ncount = 0\r\nwhile i+m < k:\r\n\tcount += m*m \r\n\ti+=m\r\n\tm = maxim()\r\n\r\nif(k-i > 0):\r\n\tex = k-i\r\n\tcount+=ex*ex\r\n\r\n\r\n\r\nprint(count)", "n, k = map(int, input().split())\ns = list(str(input()))\ndict = {}\nfor i in s:\n if i in dict:\n dict[i] += 1\n else :\n dict[i] = 1\np = list(dict.values())\np.sort(reverse = True)\nans = 0\nfor i in p:\n if i <= k:\n k -= i\n ans += i*i\n else :\n ans += k*k\n break\nprint(ans)\n", "from bisect import insort # args : list, element,beg,end \r\nimport math as mt \r\nimport heapq # heapify(list), nlargest(n,heap), nsmallest(n, heap), heappop(heap) ,heappush(heap,e)\r\nfrom functools import lru_cache #memoise: maxsize\r\nfrom collections import deque,Counter,defaultdict #pop , popleft ; \r\nfrom itertools import combinations as c #iter, c\r\nimport sys \r\n\r\n\"\"\"use resource\"\"\"\r\n# import resource\r\n# resource.setrlimit(resource.RLIMIT_STACK, [0x100000000, resource.RLIM_INFINITY])\r\n\r\n\"\"\"for recursion\"\"\"\r\n# import threading\r\n# threading.stack_size(1<<27)\r\n# sys.setrecursionlimit(10000)\r\n\r\n# fast io\r\ndef fop(s,end='\\n'): sys.stdout.write(str(s)+end)\r\ndef fip(): return sys.stdin.readline().strip()\r\nfintinp = lambda : int(fip()) \r\ndef flistinp(func= int): return list(map(func,fip().split())) \r\ndef fnsepline(n,func=str): return [func(fip()) for _ in range(n)]\r\n\r\ndef solve():\r\n n,k = flistinp()\r\n s = fip()\r\n cnt = Counter(s)\r\n ans = 0\r\n sorted_cnt = sorted(cnt.items(),key=lambda x:x[1])\r\n while k and sorted_cnt:\r\n x = sorted_cnt.pop()\r\n y = min(k, x[1])\r\n ans += y * y \r\n k -= y\r\n print(ans)\r\n \r\n\r\n\r\ntc = 1 \r\n# tc = fintinp()\r\nfor _ in range(tc):\r\n solve()\r\n", "import collections\r\nn,k=map(int,input().split())\r\nstring=input()\r\nc=collections.Counter(string)\r\nlis=[]\r\nfor i in c:\r\n lis.append([i,c[i]])\r\nlis.sort(key=lambda x:x[1],reverse=True)\r\ni=0\r\nres=0\r\nwhile(k>0):\r\n if lis[i][1]<=k:\r\n res+=lis[i][1]*lis[i][1]\r\n k-=lis[i][1]\r\n else:\r\n res+=k*k\r\n k-=k\r\n i+=1\r\nprint(res)", "nk=list(input().split())\r\nn=int(nk[0])\r\nk=int(nk[1])\r\na=input()\r\nb=set(a)\r\nc=[]\r\nd=len(b)\r\nfor i in range(d):\r\n c.append(a.count(b.pop()))\r\nc.sort(reverse=True)\r\nsum=0\r\nx=0\r\nfor i in range(d):\r\n sum=sum+c[i]\r\n if sum>=k:\r\n x=x+(abs(sum-k-c[i]))**2\r\n break\r\n else:\r\n x=x+c[i]**2\r\nprint(x)\r\n", "n,k = map(int,input().split())\ncards = input()\noccu = {}\nfor x in cards:\n occu[x] = occu.get(x,0) + 1\nl = []\nfor x in occu.keys():\n l.append(occu[x])\nl.sort()\ntaken = 0\ns=0\nwhile taken <k:\n if l[-1]>=k-taken:\n s+= (k-taken)**2\n taken = k\n else:\n s+= l[-1]**2\n taken+= l[-1]\n l.pop()\nprint(s)\n", "from collections import Counter\n\nn, k = [int(x) for x in input().split()]\ncards = Counter(input())\n\npoints = 0\nwhile k > 0:\n card, count = cards.most_common(1)[0]\n cards_chosen = min(count, k)\n points += cards_chosen ** 2\n k -= cards_chosen\n\n cards -= Counter({card: cards_chosen})\n\nprint(points)\n\n\t\t \t\t \t\t\t \t\t \t\t\t \t \t\t\t", "m, n = map(int, input().split())\r\n\r\nnum = list(str(input()))\r\nhaha = []\r\nfor i in set(num):\r\n quant = 0\r\n for j in num:\r\n if j == i:\r\n quant += 1\r\n haha.append((i, quant))\r\n\r\nhaha.sort(key=lambda x: x[1], reverse=True)\r\noutput = 0\r\nfor i in range(len(haha)):\r\n if haha[i][1] <= n:\r\n output += (haha[i][1] ** 2)\r\n n -= haha[i][1]\r\n else:\r\n if n == 0:\r\n print(output)\r\n quit()\r\n else:\r\n output += (n ** 2)\r\n print(output)\r\n quit()\r\nprint(output)\r\n", "n,k = [int(x) for x in input().split()]\narr = input()\nfreq = {}\nfor char in arr:\n\tif char not in freq:\n\t\tfreq[char] = 0\n\tfreq[char]+=1\nsort = sorted(freq,key = lambda x: freq[x],reverse=True)\n#print(sort)\nans = 0\nk1 = k\ni = 0\nwhile k1:\n\tx = freq[sort[i]]\n\tif k1 <= x:\n\t\tans+=k1*k1\n\t\tk1 = 0\n\telse: #k1>x\n\t\tans+=x*x\n\t\tk1-=x\n\ti+=1\nprint(ans)\n", "from sys import *\r\nfrom math import *\r\n\r\nn, k = map(int, stdin.readline().split())\r\na=list(input())\r\ncnt=[0]*26\r\nd={}\r\nfor i in range(n):\r\n cnt[ord(a[i])-65]+=1\r\ncnt.sort()\r\ncnt=cnt[::-1]\r\nj=0\r\nans=0\r\nfor i in range(26):\r\n if j==k:\r\n break\r\n x=min(k-j,cnt[i])\r\n j+=x\r\n ans+=x*x\r\nprint(ans)", "n, k = map(int, input().split())\r\nq, w = ([0] * 26, 0)\r\nfor i in input():\r\n q[ord(i) - 65] += 1\r\nq.sort(reverse=1)\r\n\r\nfor i in q:\r\n if i <= k:\r\n w += i * i\r\n k -= i\r\n else:\r\n w += k * k\r\n break\r\nprint(w)# 1691207390.267095", "from collections import defaultdict\r\n\r\nn , k = map(int , input().split())\r\n\r\ns = input()\r\n\r\ncnt = defaultdict(lambda : 0)\r\n\r\nfor x in s:\r\n cnt[x] += 1\r\n\r\nlist = sorted(cnt.values())\r\n\r\nc = 0\r\nans = 0\r\nwhile c < k and len(list) > 0:\r\n v = list.pop()\r\n if c + v > k:\r\n ans += (k - c) ** 2\r\n else :\r\n ans += v ** 2\r\n c += v\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\ns=input()\r\nl=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]\r\nfor i in range(len(s)):\r\n if(s[i]=='A'):\r\n l[0]=l[0]+1\r\n elif(s[i]=='B'):\r\n l[1]=l[1]+1\r\n elif(s[i]=='C'):\r\n l[2]=l[2]+1\r\n elif(s[i]=='D'):\r\n l[3]=l[3]+1\r\n elif(s[i]=='E'):\r\n l[4]=l[4]+1\r\n elif(s[i]=='F'):\r\n l[5]=l[5]+1\r\n elif(s[i]=='G'):\r\n l[6]=l[6]+1\r\n elif(s[i]=='H'):\r\n l[7]=l[7]+1\r\n elif(s[i]=='I'):\r\n l[8]=l[8]+1\r\n elif(s[i]=='J'):\r\n l[9]=l[9]+1\r\n elif(s[i]=='K'):\r\n l[10]=l[10]+1\r\n elif(s[i]=='L'):\r\n l[11]=l[11]+1\r\n elif(s[i]=='M'):\r\n l[12]=l[12]+1\r\n elif(s[i]=='N'):\r\n l[13]=l[13]+1\r\n elif(s[i]=='O'):\r\n l[14]=l[14]+1\r\n elif(s[i]=='P'):\r\n l[15]=l[15]+1\r\n elif(s[i]=='Q'):\r\n l[16]=l[16]+1\r\n elif(s[i]=='R'):\r\n l[17]=l[17]+1\r\n elif(s[i]=='S'):\r\n l[18]=l[18]+1\r\n elif(s[i]=='T'):\r\n l[19]=l[19]+1\r\n elif(s[i]=='U'):\r\n l[20]=l[20]+1\r\n elif(s[i]=='V'):\r\n l[21]=l[21]+1\r\n elif(s[i]=='W'):\r\n l[22]=l[22]+1\r\n elif(s[i]=='X'):\r\n l[23]=l[23]+1\r\n elif(s[i]=='Y'):\r\n l[24]=l[24]+1\r\n elif(s[i]=='Z'):\r\n l[25]=l[25]+1\r\nl.sort(reverse=True)\r\nwhile(l[len(l)-1]==0):\r\n l.pop()\r\nr=0\r\nfor i in range(len(l)):\r\n if(l[i]==k):\r\n r=r+l[i]*l[i]\r\n print(r)\r\n break\r\n elif(l[i]<k):\r\n r=r+l[i]*l[i]\r\n k=k-l[i]\r\n elif(k==1):\r\n r=r+1\r\n print(r)\r\n break\r\n elif(k<l[i]):\r\n r=r+k*k\r\n print(r)\r\n break", "n,k = map(int,input().split())\r\nl = list(str(input()))\r\nfrom collections import Counter\r\nd = Counter(l)\r\nv = list(d.values())\r\nz = 0\r\nz1 = 0\r\nwhile z < k:\r\n if z + max(v) > k:\r\n p = k-z\r\n\r\n z1 +=p**2\r\n break\r\n else:\r\n z += max(v)\r\n z1 += max(v)**2\r\n v.pop(v.index(max(v)))\r\nprint(z1)\r\n", "import string\n\n#variables\ncoins = 0\n\nn, k = input().split()\nn = int(n)\nk = int(k)\n\ncards = input()\n\nletters = {}\n\n\n#map letter frequencies\nfor c in cards:\n if c in letters:\n letters[c] += 1\n else:\n letters[c] = 1\n\n#traverse letters frequencies\nwhile(k > 0):\n currCoins = 0\n maxCard = 0\n maxCardsIdx = 0\n\n #get biggest frequency\n for key, v in letters.items():\n if(v > maxCard):\n maxCard = v\n maxCardsChar = key\n\n #add coin\n if(maxCard > k):\n coins += (k*k)\n k=0\n elif(maxCard < k):\n coins += (maxCard*maxCard)\n k -= maxCard\n letters[maxCardsChar] = 0\n else:\n coins += (k*k)\n k=0 \n\nprint(coins) \n\n\n\n\n\n#", "from collections import Counter\r\nn,k=map(int,input().split())\r\nx=list(input())\r\ncnt=Counter(x)\r\ny=sorted(cnt,key=lambda i:cnt[i],reverse=True)\r\ns=0\r\nfor i in y:\r\n if k>=cnt[i]:\r\n s+=cnt[i]*cnt[i]\r\n k-=cnt[i]\r\n else:\r\n s+=k*k\r\n k=0\r\n break\r\nprint(s)", "from collections import Counter\r\ndef apple(s, k):\r\n c = Counter(s)\r\n arr = sorted([c[i] for i in c], reverse=True)\r\n t = 0\r\n for el in arr:\r\n if k >= el:\r\n t += el * el\r\n k -= el\r\n else:\r\n t += k * k\r\n k = 0\r\n\r\n return t\r\n \r\nn, k = [int(j) for j in input().split()]\r\ns = input()\r\nprint(apple(s, k))", "from collections import Counter\n\nn, k = map(int, input().split())\nstring = input()\ntotal = 0\nc = Counter(string)\nl = sorted(c.values(), reverse=True)\nfor e in l:\n if k <= 0: break\n if k < e:\n total += k * k\n k = 0\n else:\n k -= e\n total += e * e\n\nprint(total)", "import collections\r\nn,k=map(int,input().split())\r\ns=input()\r\nD=collections.Counter(s)\r\nB=list(D.values())\r\nB.sort(reverse=True)\r\nS=0\r\nfor i in B:\r\n if i<=k:\r\n S+=i*i\r\n k=k-i\r\n else:\r\n S+=(k**2)\r\n break\r\nprint(S)", "n,k=map(int,input().split( ))\r\ns=input()\r\ndic={}\r\nfor i in s:\r\n if i in list(dic.keys()):\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\nl=list(dic.values())\r\nl.sort()\r\nscore=0\r\nfor j in l[::-1]:\r\n if k>j:\r\n k=k-j\r\n score+=j**2\r\n else:\r\n score+=k**2\r\n break\r\nprint(score)", "n,m=map(int,input().split())\r\ns=list(input())\r\nb=[]\r\nc=[]\r\nsum=0\r\nfor i in set(s):\r\n b.append(i)\r\nfor i in b:\r\n c.append(s.count(i))\r\nc.sort(reverse=True)\r\nfor i in c:\r\n if m-i>0:\r\n m=m-i\r\n sum=sum+i*i\r\n else:\r\n sum=sum+m*m\r\n break\r\nprint(sum)\r\n", "S=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\r\nS1=[]\r\nn,m=map(int,input().split())\r\nT=input()\r\nfor i in range(26) :\r\n S1.append(T.count(S[i]))\r\nS1=sorted(S1)\r\nk=0\r\nfor i in range(25,-1,-1) :\r\n if m>=S1[i] :\r\n k=k+S1[i]*S1[i]\r\n m=m-S1[i]\r\n else :\r\n k=k+m*m\r\n break\r\nprint(k)\r\n \r\n \r\n", "n,k=map(int,input().split());s=input();l=list(set(s))\r\nd=dict.fromkeys(l,0);u={}\r\nfor i in s:\r\n\td[i]+=1\r\nl=list(d.values());l.sort(reverse=True);s=0\r\nfor i in l:\r\n\tif i>=k:s+=k**2;k=0\r\n\telse:s+=i**2;k-=i\r\n\tif k==0:break\r\nprint(s)", "n,k=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\ndic={}\r\nd=[]\r\nans=0\r\nfor i in range(n):\r\n if s[i] not in dic:\r\n dic[s[i]]=1\r\n else:\r\n dic[s[i]]+=1\r\nfor i in s:\r\n d.append((dic[i],i))\r\nd=set(d)\r\nd=list(d)\r\nd.sort(reverse=True)\r\nt=0\r\nfor i in d:\r\n if i[0]>k-t:\r\n ans=ans+(k-t)**2\r\n break\r\n else:\r\n ans=ans+i[0]**2\r\n t+=i[0]\r\nprint(ans)\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n2 3 1 -2 -3 -1 2 3\r\nok so it's just f2 - f1 repeat\r\nconstant time op\r\n\r\nf[i+1] = f[i] - f[i-1]\r\nf[i+2] = f[i+1] - f[i] = f[i] - f[i-1] - f[i] = -f[i-1]\r\nf[i+3] = f[i+2] - f[i+1] = -f[i-1] - (f[i] - f[i-1]) = -f[i]\r\nf[i+4] = f[i+3] - f[i+2] = -f[i] - (-f[i-1]) = -f[i] - f[i-1]\r\n\r\nx, y, y-x, -x, -y, -y+x, ...\r\n'''\r\ndef solve():\r\n n, k = MII()\r\n d = defaultdict(int)\r\n for i,x in enumerate(I().strip()):\r\n d[x] += 1\r\n a = sorted(d.values())\r\n \r\n ans = 0\r\n while a and k:\r\n x = min(a[-1], k)\r\n ans += x*x\r\n\r\n a[-1] -= x\r\n k -= x\r\n if a[-1] == 0:\r\n a.pop()\r\n print(ans)\r\n\r\nsolve()", "n, k = [int(j) for j in input().split()]\r\ns = str(input())\r\nfreq = 26 * [0]\r\nfor j in range(n):\r\n freq[ord(s[j]) - 65] += 1\r\nfreq.sort()\r\nans = 0\r\nfor j in range(25, -1, -1):\r\n val = min(freq[j], k)\r\n ans += val ** 2\r\n freq[j] -= val\r\n k -= val\r\nprint(ans)\r\n", "n,k = map(int,input().split())\ncards = input()\nhand = {}\n\nfor card in cards:\n if hand.get(card) == None:\n hand[card] = 1\n else:\n hand[card] = hand.get(card)+1\n\nval = sorted(hand.values())\n\np = -1\ntotal = 0\n\nwhile k>0:\n if val[p] < k:\n total += val[p]*val[p]\n k -= val[p]\n else:\n total += k*k\n k = 0\n p -= 1\n\nprint(total) \n", "def main():\r\n n, k = map(int, input().split())\r\n cards = list(input())\r\n c = 0\r\n d = {}\r\n\r\n for i in range(n):\r\n letter = cards[i]\r\n if letter not in d:\r\n d[letter] = 1\r\n else:\r\n d[letter] += 1\r\n\r\n d = sorted(d.items(), key = lambda x: x[1], reverse=True)\r\n\r\n for key, value in d:\r\n if k > 0:\r\n if value > k:\r\n c += k ** 2\r\n break\r\n elif value == k:\r\n c += k ** 2\r\n break\r\n else:\r\n c += value ** 2 \r\n k -= value\r\n\r\n return(c)\r\n\r\nprint(main())", "n, k = map(int, input().split(' '))\r\ns = input()\r\nm = {}\r\nfor c in s:\r\n m[c] = 1 + m.get(c, 0)\r\n\r\nprofits = sorted(m.values(), reverse=True)\r\n\r\nres = 0\r\ncards = 0\r\nfor profit in profits:\r\n if cards >= k:\r\n break\r\n if cards + profit > k:\r\n to_add = k - cards\r\n cards += to_add \r\n res += to_add ** 2\r\n else:\r\n res += profit ** 2\r\n cards += profit\r\nprint(res)", "from collections import defaultdict\nn,k=list(map(int,input().split()))\nhashTable=defaultdict(int)\nfor i in input():\n\thashTable[i]+=1\ndata=sorted(hashTable.values(),reverse=True)\nans=[]\nidx=0\nwhile k:\n\tif k>=data[idx]:\n\t\tans.append(data[idx])\n\t\tk-=data[idx]\n\telse:\n\t\tans.append(k)\n\t\tk=0\n\tidx+=1\nresult=0\n#print(ans)\n#print(data)\nfor i in ans:\n\tresult+=(i*i)\nprint(result)", "from collections import Counter\r\ndef f(arr,k):\r\n\tx=Counter(arr)\r\n\tans=0\r\n\tfor i,j in sorted(x.items(),key=lambda s:s[1],reverse=True):\r\n\t\tif j<=k:\r\n\t\t\tk-=j\r\n\t\t\tans+=j**2\r\n\t\telse:\r\n\t\t\tans+=k**2\r\n\t\t\tk=0\r\n\t\t\tbreak\r\n\treturn ans\r\n\r\n\r\na,b=map(int,input().strip().split())\r\nlst=input()\r\nprint(f(lst,b))", "n,k=map(int,input().split())\r\ns = input()\r\na = []\r\nfor c in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n a.append(s.count(c))\r\na.sort()\r\ni = len(a)-1\r\nans = 0\r\nwhile i>=0 and k>0:\r\n ans += min(k,a[i])**2\r\n k -= min(k,a[i])\r\n i-=1\r\nprint (ans)\r\n \r\n\r\n", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\nd={}\r\nfor ele in s:\r\n d[ele]=d.get(ele,0)+1\r\nli=[]\r\nll=0\r\nfor ele in d:\r\n li.append([d[ele],ele])\r\n ll+=1\r\nli.sort(reverse=True)\r\ni=0\r\nj=0\r\ncost=0\r\nwhile i<k:\r\n x=li[j][0]\r\n take=min(x,k-i)\r\n cost+=take*take\r\n i+=take\r\n j+=1\r\nprint(cost)", "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\n\r\nn, k = rinput()\r\ncards = input()\r\n\r\ns = []\r\n\r\nfor item in set(cards):\r\n\ts.append(cards.count(item))\r\n\r\ns.sort(reverse = True)\r\n# print(s)\r\nans = 0\r\n\r\nfor item in s:\r\n\tif item>=k:\r\n\t\tans += k*k\r\n\t\tk = 0\r\n\telse:\r\n\t\tans += item*item\r\n\t\tk -= item\r\n\tif k==0:\r\n\t\tbreak\r\n\r\nprint(ans)\t\t\t", "z=[0]*26\r\na,b=map(int,input().split())\r\nfor i in input():z[ord(i)-65]+=1\r\nz.sort(reverse=1==1);s=0\r\nfor i in z:k=min(b,i);b-=k;s+=k*k\r\nprint(s)", "n, k = map(int, input().split())\r\ns = input()\r\nvisited = {}\r\n\r\nfor c in s:\r\n visited[c] = visited.get(c, 0) + 1\r\n\r\norder = sorted(visited.values())\r\nresult = 0\r\n\r\nwhile k > 0 and len(order) > 0:\r\n current = order.pop()\r\n if k - current >= 0:\r\n result += current * current\r\n k -= current\r\n else:\r\n result += k * k\r\n k -= k\r\n\r\nprint(result)\r\n", "for _ in range(1):\r\n n, k = map(int, input().split())\r\n s = input()\r\n s = list(s)\r\n s.sort()\r\n d = {}\r\n for i in range(n):\r\n if s[i] in d:\r\n d[s[i]] += 1\r\n else:\r\n d[s[i]] = 1\r\n ans = []\r\n for key in d:\r\n ans.append(d[key])\r\n ans.sort(reverse=True)\r\n ss = 0\r\n diff = k\r\n for i in ans:\r\n temp = min(diff, i)\r\n ss = ss + (temp*temp)\r\n diff -= temp\r\n if diff <= 0:\r\n break\r\n print(ss)\r\n", "def main():\r\n from sys import stdin, stdout\r\n import collections\r\n\r\n n,m = map(int,stdin.readline().split())\r\n collection=collections.Counter(stdin.readline().strip())\r\n \r\n ans = 0\r\n for i,j in collection.most_common():\r\n if j >=m:\r\n ans += m*m\r\n break\r\n else:\r\n ans += j*j\r\n m-=j\r\n stdout.write(str(ans)+'\\n')\r\n\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n, k = [int(n) for n in input().split()]\r\ncards = input()\r\nchars = []\r\nfor i in range(n):\r\n chars.append(cards[i])\r\nchars.sort()\r\nchars_counter = {}\r\nfor word in chars:\r\n if word in chars_counter:\r\n chars_counter[word] += 1\r\n else:\r\n chars_counter[word] = 1\r\npopular_words = sorted(chars_counter, key=chars_counter.get, reverse=True)\r\nfinal_counter = 0\r\nfor i in range(len(popular_words)):\r\n if chars_counter.get(popular_words[i]) < k:\r\n final_counter += chars_counter.get(popular_words[i]) ** 2\r\n k = k - chars_counter.get(popular_words[i])\r\n else:\r\n final_counter += k**2\r\n break\r\nprint(final_counter)\r\n", "arr = [int(x) for x in input().split()]\nn = arr[0]\nk = arr[1]\ncards = list(input())\naux = {}\nfor card in cards:\n if card not in aux:\n aux[card] = 1\n else:\n aux[card] += 1\naux = sorted(aux.items(), key=lambda x: x[1], reverse = True)\nresp = 0\nrem = k\nfor i in aux:\n if rem - i[1] <= 0:\n resp += rem*rem\n break\n else:\n resp += i[1]*i[1]\n rem -= i[1]\nprint (resp)\n \t\t\t\t \t \t \t\t\t \t\t \t\t \t\t \t\t", "import sys\r\nfrom collections import Counter\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn, k = map(int, input().split())\r\ns = list(input())\r\nc = Counter(s)\r\nls = []\r\nfor val in c.values():\r\n ls.append(val)\r\nls.sort(reverse=True)\r\nans = 0\r\nfor i in ls:\r\n if k >= i:\r\n ans += i * i\r\n k -= i\r\n elif k < i:\r\n ans += k * k\r\n break\r\nprint(ans)\r\n", "n, k = map(int, input().split())\n\n\ns = input()\n\nocc = [0 for _ in range(26)]\n\nfor char in s:\n occ[ord(char)-65] += 1\n\nocc.sort(reverse=True)\n\ntotal = 0\ni = 0\n\nwhile k > 0:\n total += min(k, occ[i]) * min(k, occ[i])\n k -= occ[i]\n i += 1\n\nprint(total)", "'''\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\ndef main():\r\n\tN, K = map(int,input().split())\r\n\tstring = str(input())\r\n\tstring = list(string)\r\n\tdp= [0 for _ in range(26)]\r\n\tfor i in range(len(string)):\r\n\t\tdp[ord(string[i])-ord('A')]+=1\r\n\tdp.sort(reverse=True)\r\n\tans = 0\r\n\tindex = 0\r\n\twhile index<N and K>0:\r\n\t\tif dp[index]> K:\r\n\t\t\tans+= K*(K)\r\n\t\t\tK-=K\r\n\t\telse:\r\n\t\t\tans+= dp[index]*dp[index]\r\n\t\t\tK-=dp[index]\r\n\t\tindex+=1\r\n\tprint(ans)\r\nmain()", "# -*- coding: utf-8 -*-\r\n\r\nfrom collections import Counter\r\n\r\nn, k = map(int, input().split())\r\n\r\nz = Counter(input())\r\ncnt = sorted([z[x] for x in z])[::-1]\r\n\r\nans = 0\r\n\r\nfor x in cnt:\r\n ans += min(k, x)**2\r\n k -= min(k, x)\r\n\r\nprint(ans)\r\n", "n, k = map(int, input().split())\n\nd = {}\nfor c in input():\n if c in d:\n d[c] += 1\n else:\n d[c] = 1\n\nd = list(d.values())\nd.sort(reverse=True)\n\nans = 0\nfor v in d:\n c = min(v, k)\n k -= c\n ans += c ** 2\n\nprint(ans)", "n, k = map(int, input().split())\na = 26 * [0]\ns = input()\nfor i in range(n):\n a[ord(s[i]) - 65] += 1\na.sort(reverse=True)\nans = 0\nj = 0\nwhile k > 0:\n if a[j] <= k:\n ans += a[j] ** 2\n k -= a[j]\n else:\n ans += k ** 2\n k = 0\n if k <= 0:\n break\n j += 1\nprint(ans)\n", "n , k = map(int,input().split())\nstr_ = input()\n\nres = {i : str_.count(i) for i in set(str_)}\nr = 0\n\nfor v in sorted(res.values())[::-1]:\n x = min(k,v)\n r += x*x\n k -= x\nprint(r)", "s = input().split()\r\nn, k = int(s[0]), int(s[1])\r\n\r\ncards = input()\r\n\r\ncount = [cards.count(i) for i in list(set(cards))]\r\n\r\ncount.sort(reverse = True)\r\n\r\ncoins = 0\r\n\r\nfor i in count:\r\n\tif k >= i:\r\n\t\tcoins += (i * i)\r\n\t\tk -= i\r\n\telif k > 0:\r\n\t\tcoins += (k * k)\r\n\t\tk = 0\r\n\r\nprint(coins)", "from collections import defaultdict, OrderedDict\n\ndef appleman(cards, k):\n d = defaultdict(lambda: 0)\n for c in cards:\n d[c] = d[c] + 1\n\n d = OrderedDict(sorted(d.items(), key=lambda i: -i[1]))\n\n total = 0\n for key, value in d.items():\n total = total + min(k, value)*min(k,value)\n k = k - value\n if k < 0:\n break\n\n return total\n\n_, k = [int(x) for x in input().split(' ')]\ncards = input()\n\nprint(appleman(cards, k))\n", "# n = int(input())\r\n# arr = list(map(int, input().split()))\r\n# n,m=map(int,input().split())\r\n# n, m, k = map(int, input().split())\r\n# arr = list(map(int, input().split()))\r\n# ls = list(map(int, input().split()))\r\nn,m=map(int,input().split())\r\nss=input()\r\nss=ss.lower()\r\nss=list(ss)\r\ns=set(ss)\r\ns=list(s)\r\n#ls=[0]*26\r\nls=[]\r\nfor i in range(len(s)):\r\n var=s[i]\r\n f=ss.count(var)\r\n ls.append(f)\r\nls.sort()\r\nflag=0\r\nfor d in range(len(ls)-1,-1,-1):\r\n if ls[d]>=m:\r\n flag+=m*m\r\n break\r\n elif ls[d]<m:\r\n flag+=ls[d]*ls[d]\r\n m-=ls[d]\r\nprint(flag)\r\n\r\n\r\n", "n,k=map(int,input().split());temp=n\r\ns=input();d={}\r\nfor i in s:d[i]=d.get(i,0)+1\r\nsort_d=sorted(d.items(),key=lambda x:x[1])[::-1]\r\nans=0\r\n#print(sort_d)\r\nfor i in range(len(sort_d)):\r\n if k==0:break\r\n k1=min(k,sort_d[i][1]);k-=k1;\r\n ans+=k1*k1\r\nprint(ans)\r\n", "n,k=map(int, input().split())\r\ns=input()\r\nfrom collections import Counter\r\nd=Counter(s)\r\nc=0\r\nwhile k>=0:\r\n key=max(d,key=d.get)\r\n g=min(k,d[key])\r\n del d[key]\r\n c+=(g**2)\r\n k-=g\r\n if k==0:\r\n break\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 26 03:54:17 2020\r\n\r\n@author: Samiul2651\r\n\"\"\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nx = input().split(\" \")\r\na = int(x[0])\r\nb = int(x[1])\r\nn = input()\r\nlist_1 = list(n)\r\nlist_1 = sorted(list_1)\r\n#print(list_1)\r\ni = 0\r\nlength_1 = len(list_1)\r\nlist_2 = [] \r\n \r\nwhile i < length_1:\r\n g = list_1[i]\r\n h = list_2.count(g)\r\n if h == 0:\r\n list_2.append(g)\r\n i += 1\r\n \r\n \r\n \r\n \r\n \r\n#print(list_2) \r\nlength_2 = len(list_2)\r\nlist_3 = []\r\ni = 0\r\nwhile i < length_2:\r\n g = list_2[i]\r\n h = list_1.count(g)\r\n list_3.append(h)\r\n i += 1\r\nlist_3 = sorted(list_3)\r\nlist_3.reverse()\r\n#print(list_3)\r\ncoins = 0\r\ni = 0\r\nwhile i < len(list_3):\r\n #print(coins)\r\n j = list_3[i]\r\n if b >= j:\r\n b = b - j\r\n coins += j*j\r\n else:\r\n l = b\r\n b = b - l\r\n coins += l*l\r\n i += 1\r\n if b <= 0:\r\n break\r\nprint(coins)\r\n", "from collections import defaultdict\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\ncount = defaultdict(int)\r\nfor i in s:\r\n count[i] += 1\r\nres = 0\r\nfor i in reversed(sorted(count.values())):\r\n if i == k:\r\n res += i * i\r\n break\r\n elif i > k:\r\n res += k * k\r\n break\r\n else:\r\n res += i * i\r\n k -= i\r\nprint(res)\r\n", "n, k = map(int, input().split())\narray = [x for x in input()]\n\nhash_map = {}\nfor x in array:\n if x not in hash_map:\n hash_map[x] = 1\n else:\n hash_map[x] += 1\nsums, j = 0, 0\nvalues = sorted([v for v in hash_map.values()], reverse = True)\n\nfor x in values:\n sums += min(k, x) ** 2\n k -= min(k, x)\n if k == 0:\n break\nprint(sums)\n", "n, k = map(int, input().split())\r\ns, t = 0, [0] * 26\r\nfor i in input(): t[ord(i) - 65] += 1\r\nfor i in sorted(t)[:: -1]:\r\n if i > k: break\r\n s += i * i\r\n k -= i\r\nprint(s + k * k)", "# It's all about what U BELIEVE\nimport sys\ninput = sys.stdin.readline\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\nMOD = \"1000000007\"\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n############################ SOLUTION IS COMING ###############################\nn, k = gint_arr()\ns = input()\nfrom collections import Counter\nc = Counter(s).most_common()\nres = 0\ni = 0\nwhile k:\n taken = min(k, c[i][1])\n res += taken * taken\n k -= taken\n i += 1\n\nprint(res)\n", "n, k = map(int, input().split())\r\n\r\n_ = input()\r\nc = {}\r\nfor i in _:\r\n if (c.get(i) != None):\r\n c[i] += 1\r\n else:\r\n c[i] = 1\r\n\r\n\r\nsorted_c = sorted(c.items(), key=lambda kv: kv[1])\r\nsorted_c.reverse()\r\n\r\n\r\nans = 0\r\nfor i in sorted_c:\r\n if (k - i[1] >= 0):\r\n ans += i[1]**2\r\n k -= i[1]\r\n elif (k <= 0):\r\n break\r\n else:\r\n ans += k**2\r\n k -= i[1]\r\nprint(ans)", "n,k = map(int, input().split())\r\ns = input()\r\nd={}\r\nfor i in s:\r\n if i not in d.keys():\r\n d[i] = 1\r\n else:\r\n d[i]+=1\r\nl=[]\r\nfor i in d.values():\r\n l.append(i)\r\nl.sort()\r\np = len(l)\r\nans=0\r\nwhile k>=0:\r\n if l[p-1] <= k:\r\n k = k - l[p-1]\r\n \r\n ans += l[p-1]**2\r\n p=p-1\r\n else:\r\n ans += k*k\r\n break\r\nprint(ans)", "from collections import deque\r\n\r\ndef main():\r\n n, k = list(map(int, input().split()))\r\n s = [i for i in input()]\r\n s.sort()\r\n d = {i:0 for i in s}\r\n for i in s:\r\n d[i] += 1\r\n\r\n a = []\r\n for i in list(d.keys()):\r\n a.append(d[i])\r\n a.sort(reverse=True)\r\n a = deque(a)\r\n ans = 0\r\n while k > 0:\r\n elem = a.popleft()\r\n if k >= elem:\r\n ans += (elem**2)\r\n k -= elem\r\n else:\r\n ans += (k**2)\r\n k = 0\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k = map(int,input().split())\r\ns = input()\r\nact = \"\"\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nlst = (sorted(d.items(), key=lambda kv:\r\n (kv[1], kv[0])))\r\nnew_d = {}\r\nfor i in lst[::-1]:\r\n new_d[i[0]] = i[1]\r\nd = new_d\r\nfor i in d.keys():\r\n act += (i * d[i])\r\nans = (act[:k])\r\nnum = 0\r\nseen = {}\r\nfor i in ans:\r\n if i in seen:\r\n seen[i] += 1\r\n else:\r\n seen[i] = 1\r\nfor i in ans:\r\n num += seen[i]\r\nprint(num)\r\n", "import sys\r\nimport math\r\ndokopy,moze=map(int,input().split())\r\nstring=input()\r\ndupl=moze\r\nd=[0]*26\r\nsucet=0\r\nfor i in string:\r\n d[ord(i)-65]+=1\r\nzoznam=sorted (d,reverse=True)\r\nif moze==1:\r\n sucet=1\r\n print (sucet)\r\n sys.exit() \r\nfor j in range (0,len(zoznam)-1):\r\n if dupl<zoznam[0]:\r\n sucet=dupl*dupl\r\n break\r\n moze-=zoznam[j]\r\n sucet+=pow(zoznam[j],2)\r\n if moze <= zoznam[j+1]:\r\n sucet+=pow(moze,2)\r\n break \r\nprint (sucet)\r\n", "a,b=map(int,input().split())\r\nx=input()\r\ncounts={'A':0,\r\n 'B':0,\r\n 'C':0,\r\n 'D':0,\r\n 'E':0,\r\n 'F':0,\r\n 'G':0,\r\n 'H':0,\r\n 'I':0,\r\n 'J':0,\r\n 'K':0,\r\n 'L':0,\r\n 'M':0,\r\n 'N':0,\r\n 'O':0,\r\n 'P':0,\r\n 'Q':0,\r\n 'R':0,\r\n 'S':0,\r\n 'T':0,\r\n 'U':0,\r\n 'V':0,\r\n 'W':0,\r\n 'X':0,\r\n 'Y':0,\r\n 'Z':0}\r\nfor i in range(26):\r\n counts[chr(i+65)]=x.count(chr(65+i))\r\ny=[]\r\nfor i in list(counts.items()):\r\n y.append(i[1])\r\ny.sort()\r\ny=y[::-1]\r\ntot=0\r\ncount=0\r\nwhile b and count<26:\r\n if b>y[count]:\r\n tot+=y[count]**2\r\n b-=y[count]\r\n else:\r\n tot+=b**2\r\n b=0\r\n count+=1\r\nprint(tot)\r\n", "a,b=list(map(int,input().split()))\r\nc=input()\r\ng={}\r\nans=0\r\nfor i in c:\r\n if i in g:\r\n g[i]=g[i]+1 \r\n else:\r\n g[i]=1 \r\nh=sorted(g.items(), key =lambda kv:(-kv[1], kv[0]))\r\n#print(g)\r\nfor i in range(len(h)):\r\n i=h[i][0]\r\n if g[i]<b:\r\n ans=ans+g[i]*g[i]\r\n b=b-g[i]\r\n else:\r\n ans=ans+b*b \r\n break\r\nprint(ans)", "from operator import itemgetter\n\n\nclass CodeforcesTask462BSolution:\n def __init__(self):\n self.result = ''\n self.n_k = []\n self.cards = ''\n\n def read_input(self):\n self.n_k = [int(x) for x in input().split(\" \")]\n self.cards = input()\n\n def process_task(self):\n scores = {}\n for c in self.cards:\n if c in scores:\n scores[c] += 1\n else:\n scores[c] = 1\n score = [(scores[c], c) for c in self.cards]\n score.sort(reverse=True)\n scorezs = {}\n for c in score[:self.n_k[1]]:\n if c[1] in scorezs:\n scorezs[c[1]] += 1\n else:\n scorezs[c[1]] = 1\n #print(scorezs, scores)\n scorez = [scorezs[x[1]] for x in score[:self.n_k[1]]]\n #print(score, scorez)\n self.result = str(sum(scorez))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask462BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n,k=map(int,input().split())\r\na=input()\r\nb=[]\r\nwhile len(a)>0:\r\n b.append(a.count(a[0]))\r\n a=a.replace(a[0],'')\r\nb.sort(reverse=True)\r\nsum=0\r\nwhile k>0:\r\n sum+=(min(b[0],k)**2)\r\n k-=min(b[0],k)\r\n del b[0]\r\nprint(sum)", "from collections import Counter\r\na, b = map(int, input().split())\r\ns = 0\r\ncount = Counter(input()).most_common()\r\nfor x in count:\r\n\tif b - x[1] >= 0:\r\n\t\tb -= x[1];s += x[1] ** 2\r\n\telse:\r\n\t\ts += b**2\r\n\t\tbreak\r\nprint(s)", "import math\r\n\r\n\r\n\r\ndef main_function():\r\n n , k = [int(i) for i in input().split(\" \")]\r\n s = input()\r\n hash_ = {}\r\n for i in s:\r\n if i in hash_:\r\n hash_[i] += 1\r\n else:\r\n hash_[i] = 1\r\n new_list = sorted([hash_[i] for i in hash_], reverse=True)\r\n counter = 0\r\n for i in new_list:\r\n if k >= i:\r\n k -= i\r\n counter += i ** 2\r\n else:\r\n counter += k ** 2\r\n break\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "\r\na = []\r\nn, k = map(int, input().split())\r\ns = list(input())\r\nfor c in range(0, 26):\r\n ch = chr(c + ord('A'))\r\n a.append((s.count(ch), ch))\r\na.sort()\r\na.reverse()\r\nans = 0\r\nfor f, g in a:\r\n get = min(k, f)\r\n ans += get * get\r\n k -= get\r\nprint(ans)", "n,k=map(int,input().split())\r\nl=list(input())\r\nd={}\r\nchk=[]\r\nfor i in list(set(l)):\r\n d[i]=0\r\nfor i in l:\r\n d[i]+=1\r\nfor i in d:\r\n chk.append([d[i],i])\r\nchk=sorted(chk,reverse=True)\r\ncount=0\r\nele=[]\r\nfor i in chk:\r\n if(count<k):\r\n if(i[0]+count<=k):\r\n count+=i[0]\r\n ele.append([i[1],i[0]])\r\n elif(i[0]>=(k-count)):\r\n r=k-count\r\n count+=(k-count)\r\n ele.append([i[1],r])\r\nans=0\r\nfor i in ele:\r\n ans+=(i[1]*i[1])\r\nprint(ans)\r\n \r\n \r\n", "n,k = map(int,input().split())\r\nstr1 = input()\r\ndct = {}\r\nfor i in range(n):\r\n if str1[i] in dct.keys():\r\n dct[str1[i]] += 1\r\n else:\r\n dct[str1[i]] = 1\r\nl = list(dct.values())\r\nl.sort(reverse = True)\r\nans = 0\r\ncount = 0\r\nfor j in range(len(l)):\r\n if count < k:\r\n diff = k - count\r\n if diff < l[j]:\r\n ans += diff*diff\r\n count += diff\r\n else:\r\n ans += l[j]*l[j]\r\n count += l[j]\r\nprint(ans)", "#codeforces462B\r\nfrom collections import Counter\r\ngi = lambda : list(map(int,input().strip().split()))\r\nn, m = gi()\r\nocc = Counter(input())\r\nocc = [occ[e] for e in occ]\r\nocc.sort()\r\nocc = occ[::-1]\r\nans = 0\r\nk = 0\r\nwhile m:\r\n\tans += min(m, occ[k])**2\r\n\tm -= min(m, occ[k])\r\n\tk += 1\r\nprint(ans)", "from collections import defaultdict\r\nn,k = map(int,input().split())\r\ns = input()\r\nd = defaultdict(int)\r\na = []\r\nfor i in s:\r\n d[i]+=1\r\nfor key in d:\r\n a.append(d[key])\r\na.sort(reverse = True)\r\ni = 0\r\nans = 0\r\nwhile k:\r\n if a[i]<k:\r\n ans += a[i]**2\r\n k-=a[i]\r\n i+=1\r\n else:\r\n ans += k**2\r\n break\r\nprint(ans)\r\n", "let=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\ncont=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]\n\nn,k=list(map(int,input().split()))\npala=input()\n\ntest=k\n\nfor i in pala.lower():\n cont[let.index(i)]+=1\ncont.sort()\nans=0\nwhile k>0:\n p=cont.index(max(cont))\n q = min(k,cont[p])\n ans+=q**2\n k-=q\n cont[p]-=q\nprint(ans)\n\n \t\t \t\t\t \t\t \t\t\t \t\t\t\t \t\t \t", "from collections import Counter\r\nn, k = [int(x) for x in input().split()]\r\ns = input()\r\nc = Counter(s)\r\narr = list(c.values())\r\narr.sort(reverse = True)\r\ncount= 0\r\nans = 0\r\ni = 0\r\nwhile(count <k):\r\n if count + arr[i] > k:\r\n ans += (k-count)**2\r\n count = k\r\n break\r\n else:\r\n count += arr[i]\r\n ans += arr[i]**2\r\n i += 1\r\nprint(ans) \r\n\r\n", "def main():\n\tn, k = [ int(i) for i in input().split(' ') ]\n\tcards = input()\n\tletters = []\n\tfor i in range(n):\n\t\tif cards[i] not in letters:\n\t\t\tletters.append(cards[i])\n\tl = len(letters)\n\tfreq = [ 0 for i in range(l) ]\n\tfor i in range(l):\n\t\tfreq[i] = cards.count(letters[i])\n\ttotal = 0\n\twhile k != 0:\n\t\tm = max(freq)\n\t\tif m > k:\n\t\t\ttotal = total + (k * k)\n\t\t\tk = 0\n\t\telse:\n\t\t\tk = k - m\n\t\t\ttotal = total + (m * m)\n\t\t\tfreq.remove(m)\n\tprint(total)\n\n\nmain()", "[n,k]=[int(i) for i in input().split()]\r\ns=list(input())\r\ncounts=[]\r\nfor i in set(s):\r\n counts.append(s.count(i))\r\nans=0\r\nwhile(k>0):\r\n ans+=(min(max(counts),k))*(min(max(counts),k))\r\n k-=max(counts)\r\n counts[counts.index(max(counts))]=0\r\nprint(ans)", "n, m = map(int, input().split())\r\ns = str(input())\r\ncnt = [0] * 26\r\n\r\nfor c in s:\r\n cnt[ord(c)-ord('A')] += 1\r\n\r\nans = 0\r\nwhile m > 0:\r\n cMaxC = 0\r\n cMaxCPos = 0\r\n for i in range(26):\r\n if cnt[i] > cMaxC:\r\n cMaxC = cnt[i]\r\n cMaxCPos = i\r\n\r\n ans += min(cMaxC, m) ** 2\r\n\r\n m -= cMaxC\r\n cnt[cMaxCPos] = 0\r\nprint(ans)\r\n", "count = [0]*26\r\nn, k = map(int , input().split())\r\ncards = input()\r\nfor c in cards:\r\n\tcount[ord(c)-ord('A')]+=1\r\n\r\ncount.sort(reverse=True)\r\nans = 0\r\nfor c in count:\r\n\tif (k - c) >= 0:\r\n\t\tans += c**2\r\n\t\tk-=c\r\n\telse:\r\n\t\tans += k**2\r\n\t\tbreak\r\n\r\nprint(ans)\r\n", "import sys;input=sys.stdin.readline\r\nfrom collections import Counter as C\r\nn,k = map(int,input().strip().split())\r\ns = input().strip()\r\nc = [*map(lambda x:x[1],C(s).most_common())]\r\n\r\nans = 0\r\ncn = 0\r\nfor i in c:\r\n if cn+i <= k:\r\n ans += i*i\r\n cn += i\r\n else:\r\n ans += (k - cn)*(k-cn)\r\n break\r\nprint(ans)", "from collections import Counter\n\n\nif __name__ == '__main__':\n n, k = [int(i) for i in input().split()]\n \n c = Counter(input())\n\n res = 0\n tmp = k\n\n for w, n in c.most_common():\n if tmp > n:\n tmp -= n\n res += n * n\n else:\n res += tmp * tmp\n break\n print(res)\n\n", "n, k = map(int, input().split())\r\ns = input()\r\narr = [0] * 26\r\ndef pos(c):\r\n return ord(c) - ord('A')\r\n\r\nfor c in s:\r\n arr[pos(c)] += 1\r\narr.sort(reverse=True)\r\nans = 0\r\nfor i in arr:\r\n if i == 0:\r\n break\r\n if k >= i:\r\n ans += i**2\r\n k -= i\r\n else:\r\n ans += k**2\r\n break\r\nprint(ans)\r\n", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\ns = list(input())\r\nfreq = defaultdict(int)\r\nfor i in s:\r\n freq[i] += 1\r\nc = sorted([i for i in freq.values()], reverse=True)\r\nres = 0\r\nfor i in c:\r\n if k-i > 0:\r\n res += i*i\r\n k -= i\r\n else:\r\n res += k*k\r\n break\r\nprint(res)\r\n", "import collections\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\ncs = collections.Counter(s)\r\nt = sorted(list(cs.values()), reverse=True)\r\ni = 0\r\nans = 0\r\nwhile k and i < len(t):\r\n ans += min(k, t[i])**2\r\n k -= min(k, t[i])\r\n i += 1\r\nprint(ans)", "# --- Algorithm --- #\ndef function(n, k, cards):\n L = {}\n\n for c in cards:\n if L.get(c) == None:\n L[c] = 0\n L[c] += 1\n\n b = list(L.values())\n b.sort(reverse=True)\n\n money = 0\n\n for n in b:\n\n if k == 0:\n break\n\n elif k > n or k == n:\n money += n * n\n k -= n\n elif k < n:\n money += k * k\n k = 0\n \n return money\n\n\n\n# --- Run --- #\n\n# input vars\na = input().split()\nn = int(a[0])\nk = int(a[1])\ncards = list(input())\n\n# function output\nans = function(n, k, cards)\n\n# spit answer\nprint(ans)", "n,k = map(int,input().split())\nnew_dict = {}\nt = input()\nfor x in t:\n\tif x in new_dict:\n\t\tnew_dict[x]=new_dict[x]+1\n\telse:\n\t\tnew_dict[x]=1\n\np=0\n\n#print(new_dict.items())\n\nwhile(k>0):\n\tif(new_dict[max(new_dict, key=new_dict.get)]>=k):\n\t\tp = p + k**2;\n\t\tk = 0\n\telse:\n\t\tp = p + new_dict[max(new_dict, key=new_dict.get)]**2\n\t\tk = k - new_dict[max(new_dict, key=new_dict.get)]\n\t\tdel new_dict[max(new_dict, key=new_dict.get)]\n\t#\tprint(\"hello\\n\")\nprint(p)\n", "\r\n\r\n\r\n\r\nfrom collections import Counter\r\nn, k = map(int, input().strip().split())\r\ns = Counter(input().strip())\r\nm = {key : v for key, v in reversed(sorted(s.items(), key = lambda item: item[1]))}\r\nans = 0\r\n# print(m)\r\nfor key in m:\r\n if m[key] <= k:\r\n k -= m[key]\r\n ans += m[key] * m[key]\r\n else:\r\n ans += k * k\r\n k = 0\r\nprint(ans)", "n,k = map(int,input().split())\r\ns = input();st = set(s);res=[];sz = 0\r\nif len(st) == len(s):\r\n print(k)\r\n exit()\r\nfor i in st:\r\n res.append(s.count(i))\r\nres.sort(reverse = True)\r\nop = 0\r\nfor it in res:\r\n if sz == k:\r\n break\r\n elif sz >= k:\r\n v = k\r\n sz = k\r\n else:\r\n if it>=k-sz:\r\n v = k-sz\r\n sz += v\r\n else:\r\n v = it\r\n sz += v\r\n op += v*v\r\nprint(op) \r\n", "\n\nif __name__ == '__main__':\n entrada = input()\n entrada_str = list(entrada.split(\" \"))\n entrada_int = list(map(int, entrada_str))\n n = entrada_int[0]\n k = entrada_int[1]\n\n vetor = input()\n vetor_letras = [0] * 26\n for i in range(n):\n vetor_letras[ord(vetor[i]) - 65] += 1\n\n vetor_letras.sort()\n\n resposta = 0\n for i in reversed(range(26)):\n if vetor_letras[i] <= k:\n resposta += vetor_letras[i] * vetor_letras[i]\n k = k - vetor_letras[i]\n else:\n resposta += k * k\n k = 0\n if k == 0:\n break\n\n print(resposta)\n\n \t\t \t\t\t \t \t \t\t\t \t", "n,k=map(int,input().split())\r\n\r\ns=list(input())\r\n\r\n#print(s)\r\n\r\nmp=dict()\r\n\r\nfor i in range(ord('A'),ord('Z')+1):\r\n mp[chr(i)]=0\r\n \r\nfor a in s:\r\n mp[a]+=1\r\n\r\n\r\n \r\n\r\ns.sort(key=lambda item:(mp[item],item))\r\n\r\ns.reverse()\r\n\r\ni=0\r\nans=[]\r\nwhile k>0 and i<len(s):\r\n ans.append(s[i])\r\n i+=1\r\n k-=1\r\nmp.clear()\r\n\r\nfor i in range(ord('A'),ord('Z')+1):\r\n mp[chr(i)]=0\r\n \r\nfor a in ans:\r\n mp[a]+=1\r\n\r\n\r\n#print(s)\r\nres=sum(mp[a] for a in ans)\r\n\r\nprint(res)", "n,k = [int(x) for x in input().split()]\nfreq = {}\nfor s in input():\n\tfreq[s] = freq[s] +1 if s in freq else 1\nfreqArr = sorted(list(freq.values()), reverse=True)\nans = 0\nfor i in range(len(freqArr)):\n\tif freqArr[i] >= k:\n\t\tans+=k**2\n\t\tbreak\n\telse: \n\t\tans+=freqArr[i]**2\n\t\tk-=freqArr[i]\nprint(ans)\n", "a,b=map(int,input().split())\r\nx=input()\r\nalpha=[chr(i).upper() for i in range(97,123)]\r\ny=[0]*26\r\nfor i in x:\r\n y[alpha.index(i)]+=1\r\nyy=[int(i) for i in y]\r\nyy.sort()\r\ns=0\r\nfor j in yy[::-1]:\r\n if j<=b:\r\n s+=j*j\r\n b-=j\r\n else:\r\n if b>0:\r\n s+=b**2\r\n b=0\r\n if b==0:\r\n break\r\n#print(y)\r\n#print(yy[::-1])\r\nprint(s)\r\n\r\n", "a,b=map(int,input().split())\nc=input()\ndict={}\nfor i in c:\n dict[i]=dict.get(i,0)\n dict[i]+=1\na=sorted(dict.values())\nr=0\nwhile b>0:\n e=a.pop()\n if b>e:\n r+=e*e\n b-=e\n else:\n r+=b*b\n b=0\nprint(r)\n \t \t \t \t \t \t \t \t\t\t\t \t\t\t", "n,k = map(int,input().split())\r\nd,r = {},0\r\nfor c in input(): d[c] = d.get(c, 0)+1\r\nfor v in sorted(d.values())[::-1]:\r\n x = min(k,v)\r\n r += x*x\r\n k -= x\r\nprint(r)\r\n \r\n", "n,k=map(int,input().split())\r\ns=input()\r\nd={}\r\nfor i in s:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nl=list(d.values())\r\nl.sort(reverse=True)\r\ns=0;c=0\r\nfor i in range(len(l)):\r\n if k==c:\r\n break\r\n if c+l[i]<=k:\r\n s+=l[i]*l[i]\r\n c=c+l[i]\r\n else:\r\n s+=(k-c)*(k-c)\r\n c=k\r\nprint(s) ", "n,k = map(int,input().split())\r\na=input()\r\n\r\nb=a[:];c=[];\r\nmax=-1\r\nfor i in range(len(a)):\r\n if a[i]!='1':\r\n count=b.count(a[i])\r\n a=a.replace(a[i],'1')\r\n c.append(count)\r\n\r\nc.sort()\r\nflag=0;total=0;\r\nfor i in range(len(c)-1,-1,-1):\r\n preflag=flag\r\n flag+=c[i]\r\n\r\n if flag<k:\r\n total+=c[i]*c[i]\r\n elif flag==k:\r\n total+=c[i]*c[i]\r\n break\r\n else:\r\n total+=(k-preflag)*(k-preflag)\r\n break\r\nprint(total)\r\n", "ls = input().split(\" \")\r\nn = int(ls[0])\r\nk = int(ls[1])\r\nst = input()\r\nmp = {}\r\nfor i in st:\r\n if(i not in mp):\r\n mp[i] = 0\r\n mp[i] += 1\r\nfreq = []\r\nfor i in mp:\r\n freq.append(mp[i])\r\n\r\nfreq = sorted(freq, reverse = True)\r\nans = 0\r\nfor i in freq:\r\n if(i <= k):\r\n ans += (i*i)\r\n k-=i\r\n else:\r\n ans += (k*k)\r\n k = 0\r\n if(k == 0):\r\n break\r\n \r\nprint(ans)", "x=list(map(int, input().split()))\r\nk=x[1]\r\ns=input()\r\nfreq = {}\r\nmy_list = list(s)\r\nfor item in my_list:\r\n if (item in freq):\r\n freq[item] += 1\r\n else:\r\n freq[item] = 1\r\nf=list(freq.values())\r\nf.sort()\r\nf.reverse()\r\n#print(f)\r\nif f[0]>=k:\r\n r=k*k\r\nelse:\r\n r=0\r\n p=0\r\n for i in range(len(f)):\r\n k1=k-p\r\n #print(k)\r\n if k1>f[i]:\r\n r=r+f[i]*f[i]\r\n p=p+f[i]\r\n #print(r)\r\n #print(p)\r\n else:\r\n r=r+k1*k1\r\n #print(r)\r\n break\r\nprint(r)", "import os\r\nfrom math import*\r\nfrom bisect import*\r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\ns=sorted(s)\r\ni=0\r\narr=[]\r\nwhile i<n:\r\n\tarr.append(bisect_right(s,s[i])-bisect_left(s,s[i]))\r\n\ti+=arr[-1]\r\narr.sort(reverse=True)\r\nk=min(n,k)\r\ni=0\r\nans=0\r\nwhile k>0:\r\n\tif arr[i]<=k:\r\n\t\tk-=arr[i]\r\n\t\tans+=arr[i]*arr[i]\r\n\telse:\r\n\t\tans+=k*k\r\n\t\tbreak\r\n\ti+=1\r\nprint(ans)", "from collections import defaultdict, deque\n\ndef main():\n (n, k) = map(int, input().split(' '))\n s = list(input())\n m = defaultdict(int)\n for c in s:\n m[c] += 1\n l = deque(sorted([(x, m[x]) for x in m.keys()], key=lambda x: x[1]))\n ans = 0\n while k > 0:\n x = l.pop()\n r = x[1]\n if r <= k:\n k -= x[1]\n else:\n r = min(r, k)\n k = 0\n ans += (r * r)\n return ans\n\nprint(main())\n", "n,k=map(int,input().split())\r\n# n=int(input())\r\ns=input()\r\n# arr=list(map(int,input().split()))\r\nmp={}\r\nfor i in s:\r\n if i in mp:\r\n mp[i]+=1\r\n else:\r\n mp[i]=1\r\nval=sorted(list(mp.values()),reverse=True)\r\nans=0\r\nfor i in val:\r\n if i<=k:\r\n ans+=i*i\r\n k-=i\r\n elif k and i>k:\r\n ans+=k*k\r\n break\r\n else:\r\n break\r\nprint(ans)", "n,k=map(int,input().split())\r\na=str(input())\r\nb=[]\r\nl=0\r\nfor i in a:\r\n if i not in b:\r\n b.append(i)\r\n l+=1\r\nc=[0]*l\r\nfor l in range(l):\r\n for i in range(n):\r\n if b[l]==a[i]:\r\n #print(c)\r\n c[l]+=1\r\nc.sort()\r\n#print(c)\r\nx=0\r\nwhile(k>0):\r\n #print(l)\r\n if k>=c[l]:\r\n k-=c[l]\r\n x=x+c[l]*c[l]\r\n del c[l]\r\n #print(k)\r\n l-=1\r\n #print(l)\r\n elif k<c[l]:\r\n #print(k)\r\n x=x+(k*k)\r\n k-=k\r\nprint(x) \r\n \r\n \r\n ", "# your code goes here'\r\n# your code goes here\r\nn,k = input().split()\r\nd = {}\r\nl = input()\r\nl = \" \".join(l)\r\nl = list(l.split())\r\n\r\nfor i in l:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\n\t\t\r\n\r\ns=0\r\nv=0\r\nk=int(k)\r\n\r\nwhile 1:\r\n\tkeymax = max(d, key=d.get)\r\n\t\r\n\tv = d[keymax]\r\n\t\r\n\tif(v<k):\r\n\t\tk = k-v\r\n\t\ts=s+v*v\r\n\telse:\r\n\t\ts=s+k*k\r\n\t\tk=0\r\n\t\r\n\td[keymax] = 0\r\n\t\r\n\tif(k==0):\r\n\t\tbreak\r\n\t\r\nprint(s)", "from collections import Counter\r\n\r\n(n, k) = map(int, input().split(' '))\r\n\r\nstring = input()\r\n\r\ncounter = Counter(string)\r\n\r\nocc = []\r\n\r\nfor letter in counter:\r\n occ.append(counter[letter])\r\n\r\nocc = sorted(occ, reverse = True)\r\n\r\nselected = []\r\n\r\nsum = 0\r\n\r\nfinal = []\r\n\r\n\r\nfor num in occ:\r\n if (sum + num) <= k:\r\n final.append(num)\r\n sum += num\r\n else:\r\n final.append(k - sum)\r\n break\r\n\r\ncoins = 0\r\n\r\nfor fin in final:\r\n coins += fin*fin\r\n\r\nprint(coins)\r\n\r\n\r\n\r\n\r\n\r\n ", "from collections import Counter\r\n\r\nfirstLineArr = str(input()).split(' ')\r\napplemanTotalCards = int(firstLineArr[0])\r\ntoastmanTotalCards = int(firstLineArr[1])\r\n\r\napplemanArr = list(str(input()))\r\narray = sorted(applemanArr, key=Counter(applemanArr).get, reverse=True)\r\n\r\ncardsSelected = 0\r\ntotalCoins = 0\r\ncounter = 0\r\n\r\nwhile toastmanTotalCards > cardsSelected:\r\n countOfCurrentCard = array.count(array[counter])\r\n\r\n if(countOfCurrentCard >= toastmanTotalCards-cardsSelected):\r\n totalCoins += (toastmanTotalCards-cardsSelected) * (toastmanTotalCards-cardsSelected)\r\n break\r\n elif(countOfCurrentCard < toastmanTotalCards):\r\n totalCoins += countOfCurrentCard * countOfCurrentCard\r\n cardsSelected += countOfCurrentCard\r\n \r\n counter += countOfCurrentCard\r\n\r\nprint(totalCoins)", "from collections import Counter\n\nn, k = map(int, input().split())\narray = [x for x in input()]\n\nhash_map = Counter(array)\nsums, j = 0, 0\nvalues = sorted([v for v in hash_map.values()], reverse = True)\n\nfor x in values:\n sums += min(k, x) ** 2\n k -= min(k, x)\n if k == 0:\n break\nprint(sums)\n", "def card_game():\r\n n, k = map(int, input().split())\r\n deck = input()\r\n deck_dict = dict()\r\n for card in deck:\r\n if card in deck_dict.keys():\r\n deck_dict[card] += 1\r\n else:\r\n deck_dict[card] = 1\r\n\r\n coin = 0\r\n for card in sorted(deck_dict.values(), reverse=True):\r\n if k > 0:\r\n if card >= k:\r\n coin += k**2\r\n k = 0\r\n else:\r\n coin += card**2\r\n k -= card\r\n else:\r\n break\r\n return coin\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(card_game())", "from collections import Counter\r\n# import numpy as np\r\nfrom sys import stdin, stdout\r\ndef get_inputs(): \r\n return map(int, stdin.readline().strip().split())\r\n\r\ndef main():\r\n n,k=list(get_inputs())\r\n s=list(input())\r\n d = dict(Counter(s))\r\n val=list(d.values())\r\n ll=val\r\n ll.sort(reverse=True)\r\n count=0\r\n for kk in ll:\r\n if(k!=0):\r\n if(kk<=k):\r\n count+=kk*kk\r\n k-=kk\r\n else:\r\n if(kk>k):\r\n count+=k*k\r\n k-=k\r\n \r\n \r\n \r\n print(count)\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n # n=int(stdin.readline())\r\n for k in range(1):\r\n main()\r\n \r\n ", "def solve():\r\n n, k = [int(x) for x in input().split(' ')]\r\n s = input()\r\n s_dict = {}\r\n for c in s:\r\n if c in s_dict:\r\n s_dict[c] += 1\r\n else:\r\n s_dict[c] = 1\r\n x = list(s_dict.values())\r\n x.sort()\r\n c = 0\r\n while k:\r\n y = min(k, x.pop())\r\n k -= y\r\n c += y ** 2\r\n return c\r\n\r\nprint(solve())", "n, k = map(int, input().split())\r\na = 26 * [0]\r\ns = input()\r\nfor i in range(n):\r\n a[ord(s[i]) - 65] += 1\r\na.sort(reverse=True)\r\nans = 0\r\nj = 0\r\nwhile k > 0:\r\n if a[j] <= k:\r\n ans += a[j] ** 2\r\n k -= a[j]\r\n else:\r\n ans += k ** 2\r\n k = 0\r\n if k <= 0:\r\n break\r\n j += 1\r\nprint(ans)", "n,z = list(map(int,input().split()))\r\nA = input()\r\nli=[]\r\nk = set(A)\r\nfor x in k:\r\n li.append(A.count(x))\r\nli.sort(reverse=True)\r\ni=0\r\nsum=0\r\nwhile(z>0 and i<len(li)):\r\n o = min(li[i],z)\r\n z-=o\r\n sum+=(o*o)\r\n i+=1\r\nprint(sum)\r\n", "n,k = [int(x) for x in input().split()]\r\ncar = list(input())\r\nd = {}\r\nfor i in range(n):\r\n d[car[i]] = d.get(car[i],0)+1\r\nsortedd = sorted(d.items(),key=lambda x:x[1])\r\ncoins = 0\r\nwhile k>0:\r\n x = sortedd[len(sortedd)-1][1]\r\n if x>k:\r\n coins+=k*k\r\n k = 0\r\n \r\n else:\r\n k = k-x\r\n coins+=(x)*x\r\n # print(coins,x)\r\n sortedd.pop()\r\nprint(coins)\r\n", "import collections\r\n\r\nns,ks = input().split()\r\nn,k = int(ns),int(ks)\r\nst = str(input())\r\nc = collections.Counter(list(st))\r\nfrequencies = c.most_common()\r\nlettersLeft = k\r\nres = 0\r\nfor ch, freq in frequencies:\r\n t = min(lettersLeft, freq)\r\n res += t * t\r\n lettersLeft -= t\r\n\r\nprint(res)\r\n\r\n\r\n", "n, k = list(map(int, input().split()))\nlista = list(input())\nfrom collections import Counter\n\nc = Counter(lista)\nsoma = 0\nwhile k > 0:\n\tm = c.most_common(1)\n\t# print(m)\n\tdel c[m[0][0]]\n\t# print(c)\n\tqtd = min(k, m[0][1])\n\n\tsoma+=qtd**2\n\tk -=qtd\n\t\nprint(soma)\n", "read = lambda: map(int, input().split())\r\nn, k = read()\r\ns = input()\r\nfrom collections import Counter\r\nc = Counter()\r\nfor i in s: c[i] += 1\r\nd = sorted(c, key = lambda x: -c[x])\r\nans = 0\r\nfor i in d:\r\n if k == 0: break\r\n cur = min(k, c[i])\r\n ans += cur ** 2\r\n k -= cur\r\nprint(ans)\r\n", "p=input()\r\nn,m=map(int,p.split())\r\nq=input()\r\nw=[]\r\nfor i in q:\r\n if i not in w:\r\n w.append(i)\r\nl=[]\r\nfor i in range(len(w)):\r\n l.append(q.count(w[i]))\r\nl.sort(reverse=True)\r\nc=0\r\ni=0\r\nwhile m>0:\r\n if m>=l[i]:\r\n c+=l[i]**2\r\n m-=l[i]\r\n i+=1\r\n elif m<l[i]:\r\n c+=m**2\r\n m=0\r\nprint(c)", "n,k=list(map(int,input().split()))\r\ns=input()\r\nd={}\r\nfor i in set(s):\r\n d[i]=s.count(i)\r\nd1=sorted(d.items(), key=lambda kv:(kv[1], kv[0]),reverse=True)\r\n\r\ncnt=0\r\nd2=[]\r\nc1=0\r\nwhile(cnt<k):\r\n if(d1[0][1]==c1):\r\n c1=0\r\n del d1[0]\r\n d2.append(d1[0][0])\r\n cnt+=1\r\n c1+=1\r\n\r\nans=0\r\nfor i in set(d2):\r\n ans+=d2.count(i)**2\r\nprint(ans)\r\n", "from collections import Counter\r\nn,k=map(int,input().split())\r\ns=input()\r\nfreq=dict(Counter(s))\r\nrep=[]\r\nfor i in freq:\r\n rep.append(freq[i])\r\ncoins=0\r\nrep.sort(reverse=True)\r\nfor i in range(len(rep)):\r\n if k<=rep[i]:\r\n coins+=k*k\r\n break\r\n else:\r\n coins+=rep[i]*rep[i]\r\n k-=rep[i]\r\nprint(coins)", "n, k = map(int, input().split())\r\ns = input()\r\ng = set(s)\r\nh = {}\r\nfor i in g:\r\n m = s.count(i)\r\n h[i] = m\r\nt = [h[i] for i in h]\r\nt = sorted(t, reverse = True)\r\nj = 0\r\nans = 0\r\ni = 0\r\nwhile k > 0:\r\n f = min(k, t[i])\r\n k -= f\r\n ans += f ** 2\r\n i += 1\r\nprint(ans)", "n,k=list(map(int,input().split(\" \")))\r\ns=input()\r\nd={}\r\nfor i in s:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]=d[i]+1\r\nd=dict(sorted(d.items(),key=lambda x:x[1],reverse=True))\r\ntotal=0\r\nfor i in d:\r\n if k==0:\r\n break\r\n if d[i]<=k:\r\n total=total+(d[i]*d[i])\r\n k=k-d[i]\r\n else:\r\n total=total+(k*k)\r\n k=k-k\r\nprint(total)", "def emp(a):\r\n return a[1]\r\n\r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\na=[i for i in s]\r\nb=list(set(a))\r\nl=len(b)\r\n# print(a)\r\n# print(b)\r\nd=[]\r\nt=0\r\nfor i in range(l):\r\n m=a.count(b[i])\r\n c=[b[i],m]\r\n d.append(c)\r\nd.sort(key=emp,reverse=True)\r\n# print(d)\r\nfor i in range(l):\r\n if k>d[i][1]:\r\n t=t+d[i][1]*d[i][1]\r\n k=k-d[i][1]\r\n # print(t)\r\n else:\r\n t=t+k*k\r\n break\r\nprint(t)", "from collections import Counter\r\ndef f(arr,k):\r\n\tx=[0]*26\r\n\tfor i in arr:\r\n\t\tx[ord(i)-ord(\"A\")]+=1\r\n\tans=0\r\n\tfor j in sorted(x,reverse=True):\r\n\t\tif j<=k:\r\n\t\t\tk-=j\r\n\t\t\tans+=j**2\r\n\t\telse:\r\n\t\t\tans+=k**2\r\n\t\t\tk=0\r\n\t\t\tbreak\r\n\treturn ans\r\n\r\n\r\na,b=map(int,input().strip().split())\r\nlst=input()\r\nprint(f(lst,b))", "[n, k] = list(map(int, input().split()))\napm = input()\n\nl = [0] * 26\n\nfor i in range(len(apm)):\n l[ord(apm[i]) - ord('A')] += 1\n\nl = sorted(l, reverse=True)\n\ni, cnt = 0, 0\n\nwhile k > 0 and i < 26:\n # print(i, k, l)\n if l[i] >= k:\n cnt += k*k\n k -= k\n else:\n cnt += l[i]**2\n k -= l[i]\n i += 1\n\nprint(cnt)\n\n", "def main():\r\n n, k = map(int, input().split())\r\n s = input()\r\n j = {}\r\n for i in range(len(s)):\r\n if s[i] not in j.keys():\r\n j[s[i]] = 1\r\n else:\r\n j[s[i]] += 1\r\n z = sorted(j.values(), reverse=True)\r\n res = 0\r\n for i in z:\r\n if i > k:\r\n res += k*k\r\n break\r\n else:\r\n res += i*i\r\n k -= i\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n main()", "import io,sys,os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\ndef printArr(arr):\r\n\tsys.stdout.write(\" \".join(map(str,arr)) + \"\\n\")\r\n\r\ndef solve(cards,n,k):\r\n\tfreq = dict()\r\n\tfor i in cards:\r\n\t\tfreq[i] = freq.get(i,0) + 1\r\n\ttemp = list()\r\n\tfor i in freq.values():\r\n\t\ttemp.append(i)\r\n\ttemp.sort(key = lambda key: -key)\r\n\tanswer = 0\r\n\tfor i in temp:\r\n\t\tif k>i:\r\n\t\t\tanswer+=i*i\r\n\t\t\tk-=i\r\n\t\telse:\r\n\t\t\tanswer+=k*k\r\n\t\t\tbreak\r\n\treturn answer\r\n\r\n\r\n\r\nt=1\r\nwhile t>0:\r\n\ts=input().decode().split()\r\n\tn,k=int(s[0]),int(s[1])\r\n\tcards = input().decode()\r\n\tanswer=solve(cards,n,k)\r\n\tsys.stdout.write(str(answer)+'\\n')\r\n\tt-=1\r\n\r\n\r\n\r\n", "import heapq\nfrom operator import itemgetter\nfrom collections import Counter\n\nclass IlCounter(Counter):\n\n @property\n def score(self):\n \"\"\"\n Calculate score (also calculate total cards for conveniency)\n \"\"\"\n score = 0\n self.cards = 0\n for key, val in self.items():\n score += val*val\n self.cards += val\n return score\n\n def _reduce(self, n, cards, score):\n \"\"\"\n Do not calculate score again\n \"\"\"\n key, val = self.least_common()\n if cards - val >= n:\n # eliminate\n del self[key]\n score -= val*val\n cards -= val\n return self._reduce(n, cards, score)\n else:\n # we just have to remove a few\n score -= val*val\n\n self[key] -= cards - n\n\n score += self[key]*self[key]\n\n return score\n\n\n def reduce(self, n):\n \"\"\"\n Reduce total cards to the specified number\n \"\"\"\n score = self.score\n if self.cards < n:\n # abort \n return score\n\n return self._reduce(n, self.cards, score)\n\n def least_common(self):\n choices = heapq.nsmallest(1, self.items(), key=itemgetter(1))\n return choices[0]\n\n\ntotal, taken = input().split()\ntotal = int(total)\ntaken = int(taken)\nletters = list(input())\n\nlct = IlCounter(letters)\nprint(lct.reduce(taken))\n", "__author__ = '$'\r\nimport sys\r\n\r\nMAXN = int(1e5+10)\r\nstring = [0 for i in range (MAXN)]\r\ntry:\r\n while True:\r\n n, k = map(int, input().split(\" \"))\r\n string = input()\r\n cnt = [0] * 26\r\n for i in range(n):\r\n cnt[ord(string[i])-ord('A')] += 1\r\n cnt.sort ()\r\n ans = 0\r\n for i in range(25, -1, -1):\r\n tmp = min(k, cnt[i])\r\n k -= tmp\r\n ans += tmp * tmp\r\n if k <= 0:\r\n break\r\n print(ans)\r\nexcept EOFError:\r\n pass", "n,k= map(int, input().split())\r\ns=input()\r\nd={}\r\nfor i in range(n):\r\n if s[i] in d:\r\n d[s[i]]+=1 \r\n else:\r\n d[s[i]]=1\r\nd=sorted(d.items(), key=lambda x: -x[1])\r\nd = {k: v for k, v in d}\r\n#print(d)\r\n# ans=(collections.Counter(s).most_common(1)[0][1])\r\nans=0\r\nfor a,b in d.items():\r\n if b>=k and k!=0:\r\n ans+=k*k \r\n break \r\n elif b<k and k!=0:\r\n ans+=(b*b)\r\n k-=b \r\nprint(ans)\r\n ", "#n=int(input())\r\nn,k = map(int, input().strip().split(' '))\r\n#lst = list(map(int, input().strip().split(' ')))\r\ns=input()\r\ns=list(s)\r\nfreq = {}\r\nfor item in s:\r\n if (item in freq):\r\n freq[item] += 1\r\n else:\r\n freq[item] = 1\r\n \r\np=[]\r\nfor j in freq:\r\n p.append(freq[j])\r\n\r\np.sort(reverse=True)\r\nc=0\r\nc1=0\r\nfor j in range(len(p)):\r\n c+=p[j]\r\n if c<=k:\r\n c1+=p[j]*p[j]\r\n else:\r\n c-=p[j]\r\n c1+=(k-c)**2\r\n break\r\nprint(c1)\r\n ", "n,k = input().split()\nn = int(n)\nk = int(k)\nc = n+k\narreglo = input()\nmapa = {}\nfor i in range(len(arreglo)):\n if arreglo[i] not in mapa:\n mapa[arreglo[i]] = 1\n else:\n mapa[arreglo[i]] += 1\n#vector\nvector = []\n#map iterator\nfor key, value in mapa.items():\n vector.append(value)\n\nvector.sort(reverse=True)\ncontador = 0\ndinero = 0\nwhile(k>0):\n if(k>= vector[contador]):\n dinero += vector[contador]*vector[contador]\n k -= vector[contador]\n contador += 1\n else:\n dinero += k*k\n k = 0\n\nprint(dinero)", "from collections import Counter\r\na=list(map(int,input().split()))\r\n\r\nst=input()\r\nn=a[0]\r\nk=a[1]\r\n\r\nls=[]\r\n\r\nls=[st.count(i) for i in set(st)]\r\n\r\nls.sort(reverse=True)\r\nsm=0\r\n\r\nwhile k>0:\r\n for i in ls:\r\n sm+=min(k,i)**2\r\n k-=min(k,i)\r\nprint(sm)", "n, k = [int(x) for x in input().split(\" \")]\r\ncards = input()\r\n\r\npos = {}\r\n\r\nfor card in cards:\r\n if card not in pos:\r\n pos[card] = 1\r\n else:\r\n pos[card] += 1\r\n\r\n\r\nsorted_pos = {k: v for k, v in sorted(pos.items(), key=lambda item: item[1], reverse=True)}\r\n\r\nanswer = 0\r\nfor key, val in sorted_pos.items():\r\n if val >= k:\r\n answer += k * k\r\n break\r\n else:\r\n k -= val\r\n answer += val * val\r\n\r\nprint(answer)\r\n", "n,k = map(int,input().split())\r\nx = input()\r\ndi1={}\r\nfor i,x in enumerate(x):\r\n if x not in di1.keys():\r\n di1[x]=0\r\n di1[x]+=1\r\ndi={}\r\nfor i,x in enumerate(di1.keys()):\r\n if di1[x] not in di.keys():\r\n di[di1[x]]=[]\r\n di[di1[x]].append(x)\r\nrez,m = 0,0\r\nwert=0\r\nfor i,x in enumerate(reversed(sorted(di))):\r\n for j,y in enumerate(di[x]):\r\n if m+x<k:\r\n rez+=x*x\r\n m+=x\r\n else:\r\n wert=1\r\n break\r\n if wert==1:\r\n break\r\nrez+=(k-m)*(k-m)\r\nprint(rez)\r\n", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\ns = input()\r\ndict = defaultdict(lambda : 0)\r\nfor i in s:\r\n dict[i] += 1\r\nlist = sorted(dict.values())\r\nc= 0\r\nans = 0\r\nwhile c < k and list:\r\n v = list.pop()\r\n if c + v > k:\r\n ans += (k - c) ** 2\r\n else:\r\n ans += v ** 2\r\n c += v\r\nprint(ans)", "import heapq\r\n\r\nN, K = [int(x) for x in input().split()]\r\n\r\nletters = [0 for i in range(26)]\r\n\r\nstring = input()\r\npq = []\r\n\r\nfor char in string:\r\n letters[ord(char)-65] += 1\r\n\r\n\r\nfor i in range(len(letters)):\r\n\r\n heapq.heappush(pq, (-letters[i], chr(i+65)))\r\n\r\n\r\ncoins = 0\r\n\r\nwhile K > 0 and len(pq) > 0:\r\n\r\n amount, card = heapq.heappop(pq)\r\n amount *= -1\r\n # print(amount, card)\r\n\r\n if amount >= K:\r\n\r\n coins += K**2\r\n K = 0\r\n\r\n else:\r\n\r\n coins += (amount**2)\r\n K -= amount\r\n\r\nprint(coins)\r\n", "import sys\ninput = sys.stdin.readline\n\nn, k = map(int, input().split())\ns = input()\nfrom collections import Counter\n\nc = Counter(s)\ncount = 0\nfor num in sorted(c.values(), reverse=True):\n if num <= k:\n k -= num\n count += num**2\n else:\n count += k**2\n break\n\nprint(count)\n", "from collections import defaultdict\r\nn, k = map(int,input().split())\r\n\r\ns = input()\r\n\r\ndi = defaultdict(int)\r\n\r\nfor c in s:\r\n di[c] += 1\r\n\r\nans = 0\r\nsum = 0\r\nfor _, v in sorted(di.items(), key=lambda item: -1*item[1]):\r\n\r\n if sum+v <= k:\r\n ans += v*v\r\n sum = sum+v\r\n # print(_, v, ans, sum)\r\n else:\r\n diff = k-sum\r\n ans += diff*diff\r\n break\r\n\r\nprint(ans)\r\n ", "n, k = [int(i) for i in input().split()]\r\n\r\ns = input()\r\narr = [c for c in s]\r\narr.sort()\r\n\r\n# print(arr)\r\ncountArr = []\r\nprev = arr[0]\r\ncount = 0\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] == prev:\r\n count += 1\r\n else:\r\n countArr.append(count)\r\n count = 1\r\n prev = arr[i]\r\ncountArr.append(count)\r\ncountArr.sort(reverse = True)\r\n# print(countArr)\r\nres = 0\r\ni = 0\r\nwhile k:\r\n res += (min(k, countArr[i])*min(k, countArr[i]))\r\n k -= min(k, countArr[i])\r\n i += 1\r\n\r\nprint(res)", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn, k = [int(x) for x in input().split()]\r\ns = input().strip()\r\n\r\nmp = collections.Counter(s)\r\nmp = sorted(mp.items(), key=lambda x: -x[1])\r\n\r\nans = 0\r\nfor _, v in mp:\r\n if k == 0: break\r\n take = min(k, v)\r\n k -= take\r\n ans += take ** 2\r\nprint(ans)", "n,k=map(int,input().split())\r\nm=26\r\nd=[0]*m\r\nc=input()\r\nfor e in c:\r\n d[ord(e)-65]+=1\r\nd.sort(reverse=True)\r\nans=0\r\nres=0\r\nfor i in range(m):\r\n if ans>=k:\r\n break\r\n if ans+d[i]<=k:\r\n ans+=d[i]\r\n res+=d[i]*d[i]\r\n else:\r\n res+=(k-ans)*(k-ans)\r\n ans=k\r\nprint(res)\r\n", "import string\r\nn, k = list(map(int,input().split()))\r\ns = str(input())\r\nalphabet = {}\r\nfor ele in s:\r\n if(ele in alphabet):\r\n alphabet[ele] += 1\r\n else:\r\n alphabet[ele] = 1\r\nalphabet = sorted(alphabet.items(), key=lambda item: item[1], reverse = True)\r\n#for ele in alphabet:\r\n # print(ele)\r\nres = 0\r\nfor key in alphabet:\r\n if(key[1] >= k):\r\n res += k*k\r\n #print(key, res)\r\n print(res)\r\n break\r\n else:\r\n res += key[1]*key[1]\r\n k -= key[1]\r\n #print(res, key[1], k)", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\ndict={}\r\nans=[]\r\nfor i in range(n):\r\n if s[i] not in dict:\r\n dict[s[i]]=1\r\n else:\r\n dict[s[i]]+=1\r\nfor key in dict:\r\n ans.append(dict[key])\r\nans.sort()\r\nres=0\r\nwhile True:\r\n val=ans.pop()\r\n if k>val:\r\n k-=val\r\n res+=val**2\r\n else:\r\n res+=k**2\r\n break\r\nprint(res)\r\n", "from collections import Counter\r\nn,k = map(int, input().split())\r\ncard = input()\r\nfreq = dict(Counter(card))\r\nfreq = list(freq.items())\r\nfreq.sort(key=lambda x:x[1], reverse=True)\r\nm = 0\r\npoints = 0\r\ni = 0 \r\nwhile m<k and i<len(freq):\r\n if k-m<= int(freq[i][1]):\r\n points+=(k-m)**2\r\n else:\r\n points+=int(freq[i][1])**2\r\n m+=int(freq[i][1])\r\n i+=1\r\nprint(points) ", "# coding: utf-8\nfrom collections import Counter\nn, k = [int(i) for i in input().split()]\ncard = input()\nc = Counter(card)\nans = 0\nwhile k > 0:\n tmp = c.pop(c.most_common(1)[0][0])\n if k > tmp:\n ans += tmp*tmp\n k -= tmp\n else:\n ans += k*k\n k = 0\nprint(ans)\n", "n, k = map(int, input().split())\ns = input()\nA = [0 for i in range(26)]\nfor i in s:\n A[ord(i) - 65] += 1\nA.sort()\ni = 25\n##taked = 0\nans = 0\n##tk = k \n##for j in range(k):\n## A[i] -= 1\n## taked += 1\n## if A[i] == 0:\n## i -= 1\n## ans += taked * taked\n## tk -= taked\n## taked = 0\n## else:\n## if j == k - 1 and tk == k:\n## ans += taked * taked\n##if tk == 1 and k != 1:\n## ans += 1\nwhile k > 0:\n k -= A[i]\n ans += A[i] * A[i]\n i -= 1\nif k < 0:\n k += A[i + 1]\n ans -= A[i + 1] * A[i + 1]\n ans += k * k\n \nprint(ans)\n", "n, k = list(map(int, input().split()))\r\ns = input()\r\narr = list(s)\r\n#print(arr)\r\narr100 = []\r\ncount = 0\r\narr2 = list(set(arr))\r\n#print(arr2)\r\nif len(arr2) == n:\r\n print(k)\r\nelse:\r\n for _ in arr2:\r\n arr100.append(arr.count(_))\r\n arr100.sort(reverse=True)\r\n #print(arr100)\r\n for kk in arr100:\r\n smh = min(k, kk)\r\n k -= smh\r\n count += smh ** 2\r\n if k == 0:\r\n print(count)\r\n exit()\r\n", "from collections import Counter\r\n\r\n\r\na,b=map(int,input().split())\r\nc=input()\r\ns=Counter(c)\r\nans =0\r\nfor i in sorted(s.values(),reverse=True):\r\n ans += min(b,i)**2\r\n b-=i\r\n if b<=0:\r\n break\r\nprint(ans)\r\n", "n, k = map(int, input().split())\ncards = input()\nd = []\nfor card in set(cards):\n d.append(cards.count(card))\n\nd.sort()\nr = 0\nwhile k > 0:\n last = d.pop()\n if k >= last:\n k -= last\n r += last*last\n else:\n r += k*k\n k = 0\n\nprint(r)", "def Appleman(l,n,s):\r\n numCards = [0]*l\r\n indexCards = []\r\n sums = 0\r\n for each in s:\r\n if each in indexCards:\r\n numCards[indexCards.index(each)] += 1\r\n else:\r\n indexCards.append(each)\r\n numCards[indexCards.index(each)] += 1\r\n while n > 0:\r\n num = min(n,max(numCards))\r\n n -= num\r\n sums += num ** 2\r\n numCards[numCards.index(max(numCards))] = 0\r\n print(sums)\r\n\r\nl,n = map(int,input().split())\r\ns = input()\r\nAppleman(l,n,s)", "# Problem: B. Appleman and Card Game\r\n# Contest: Codeforces - Codeforces Round #263 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/462/B\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 Counter\r\nn,k=[int(_) for _ in input().split()]\r\nS=input()\r\n\r\nD=Counter(S)\r\nD={k: v for k, v in sorted(D.items(), key=lambda item: item[1],reverse=True)}\r\nans=0\r\nfor _ in D:\r\n\tif D[_]<k:\r\n\t\tans+=D[_]**2\r\n\t\tk-=D[_]\r\n\telse:\r\n\t\tans+=k**2\r\n\t\tbreak\r\nprint(ans)", "n,k=map(int,input().split())\r\ns=input()\r\nss=list(set(s))\r\nl=[]\r\nfor i in ss:\r\n l.append(s.count(i))\r\nl.sort(reverse=True)\r\nm=0\r\ni=0\r\nwhile(k>0):\r\n if(l[i]<k):\r\n k=k-l[i]\r\n m=m+(l[i]*l[i])\r\n i=i+1\r\n else:\r\n m=m+k*k\r\n k=0\r\nprint(m)\r\n", "n,k=map(int,input().split())\r\nq,w=[0]*26,0\r\nfor i in input():q[ord(i)-65]+=1\r\nq.sort(reverse=1)\r\nfor i in q:\r\n if i<=k:w+=i*i;k-=i\r\n else:w+=k*k;break\r\nprint(w)", "n, k = map(int, input().split())\nx = input()\n\nfrom collections import Counter\ncount = Counter(x)\npoints = 0\nmost_common = count.most_common()\ni = 0\nwhile k > 0:\n letter, freq = most_common[i]\n points += min(freq, k) * min(freq, k)\n i += 1\n k -= freq\n\nprint(points)\n", "n, k = map(int, input().split(\" \"))\r\ncards = input()\r\n\r\ncard = []\r\nvalue = []\r\n\r\nfor i in cards:\r\n if i in card:\r\n value[card.index(i)] += 1\r\n else:\r\n card.append(i)\r\n value.append(1)\r\n\r\nr = k\r\ncount = 0 \r\n\r\nwhile r > 0:\r\n max_ = max(value) \r\n index = value.index(max_)\r\n \r\n if max_ > r: \r\n count += r**2\r\n else:\r\n count += max_**2\r\n \r\n card.pop(index)\r\n value.pop(index)\r\n \r\n r -= max_\r\n \r\nprint(count)", "n,m = input().split()\r\nn,m = int(n), int(m)\r\nl = list(input())\r\ns = list(set(l))\r\na = [0]*len(s)\r\nfor i in range(len(s)):\r\n for j in range(len(l)):\r\n if(s[i]==l[j]):\r\n a[i] += 1\r\na= sorted(a)\r\nsum=0\r\nfor i in range(1,len(s)+1):\r\n if m==0:\r\n break\r\n elif m >= a[-i]:\r\n sum += a[-i]**2\r\n m -= a[-i]\r\n elif m < a[-i]:\r\n sum += m**2\r\n m = 0\r\nprint(sum)\r\n\r\n", "# https://codeforces.com/problemset/problem/462/B\n\nnk = input().strip().split(' ')\ninp = list(input().strip())\nm = {}\nfor k in inp:\n if k in m:\n m[k] += 1\n else:\n m[k] = 1\ns = sorted(m.values(), reverse=True)\nk = int(nk[1])\ntotal = 0\nwhile k != 0:\n if k <= s[0]:\n total += k*k\n k = 0\n else:\n total += s[0]*s[0]\n k -= s[0]\n s.pop(0)\nprint(total)\n", "a, b = map(int, input().split(' '))\r\nstring = input()\r\nchars = [x for x in string]\r\nchars2 = set(chars)\r\nchars2 = sorted(chars2, key = lambda x:chars.count(x))\r\nchars2.reverse()\r\n\r\ncount = [chars.count(x) for x in chars2]\r\npoints = 0\r\ncards = 0\r\nfor i in range(len(count)):\r\n if cards + count[i] >= b:\r\n break\r\n else:\r\n cards += count[i]\r\n points += count[i]**2\r\npoints += (b-cards)**2\r\nprint(points)\r\n", "d = {chr(u):0 for u in range(65,91)}\nn,k = [int(u) for u in input().split()]\nlisto = []\nfor u in input():\n d[u] += 1\nfor i in range(65,91):\n listo.append(d[chr(i)])\nlisto = sorted(listo, reverse = True)\nres = 0\nindex = 0\nwhile k != 0:\n if listo[index]< k:\n res += (listo[index])**2\n k -= listo[index]\n index += 1\n else:\n res += k*k\n k = 0\nprint(res)\n\t \t \t \t\t \t\t\t \t\t \t \t \t\t\t \t\t \t", "k,n=list(map(int,input().split()))\r\na=input()\r\nc=[];p=0\r\nfor i in set(a):\r\n (c.append(a.count(i)))\r\nfor i in sorted(c)[::-1]:\r\n if n>i:\r\n n=n-i\r\n p=i*i+p\r\n else:\r\n p=n*n+p\r\n break\r\nprint(p)", "import sys,os,io,time,copy,math\r\nfrom functools import lru_cache\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w') \r\n\r\ndef main(): \r\n n,k=map(int,input().split())\r\n string=input()\r\n dic={}\r\n for s in string:\r\n if s not in dic:\r\n dic[s]=1\r\n else:\r\n dic[s]+=1\r\n \r\n res=0\r\n for d,_ in sorted(dic.items(), key=lambda item:item[1],reverse=True):\r\n if k==0:\r\n break\r\n if dic[d]<=k:\r\n res+=(dic[d]*dic[d])\r\n k-=dic[d]\r\n else:\r\n res+=k*k\r\n k=0\r\n print(res)\r\n\r\nmain()\r\n ", "I=lambda: map(int,input().split())\r\nn, k=I()\r\nl=input()\r\n\r\nd=dict()\r\nfor i in l:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n\r\nx=sorted(d.items(), key = lambda kv:(kv[1], kv[0]),reverse=True)\r\ncount=0\r\ntemp=[]\r\nfor i in range(len(x)):\r\n temp.append(x[i][1])\r\n\r\nmlist=[]\r\nfor i in range(len(x)):\r\n count+=temp[i]\r\n if count>=k:\r\n a=count-k\r\n count-=temp[i]\r\n temp[i]-=a\r\n count+=temp[i]\r\n mlist.append(temp[i])\r\n break\r\n \r\n mlist.append(temp[i])\r\n \r\ntotal=0\r\nfor i in mlist:\r\n total+=i*i\r\n\r\nprint(total) \r\n ", "from collections import Counter\r\nn,k=map(int,input().split())\r\ns=input()\r\nd=Counter(s)\r\nl=list(d.values())\r\nl.sort(reverse=True)\r\n# print(*l)\r\nans=0\r\nfor i in l:\r\n\tif i<k:\r\n\t\tans+=i*i\r\n\t\tk-=i\r\n\telse:\r\n\t\tans+=k*k\r\n\t\tbreak\r\nprint(ans)\t", "\r\nn, k = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\nfreq = {}\r\n\r\nfor c in s:\r\n\r\n freq[c] = freq.get(c, 0) + 1\r\n\r\n\r\nfreq_list = []\r\n\r\nfor key, v in freq.items():\r\n freq_list.append((v, key))\r\n\r\nfreq_list.sort(key=lambda x:x[0], reverse=True)\r\n\r\n\r\ncoins = 0\r\n\r\nfor v in freq_list:\r\n\r\n toBeAdded = min(v[0], k)\r\n coins += (toBeAdded*toBeAdded)\r\n k -= toBeAdded\r\n\r\n if k == 0:\r\n break\r\n\r\n\r\nprint(coins)", "# https://codeforces.com/problemset/problem/462/B\r\n\r\n\"\"\"\r\nn cards and each has an uppercase letter.\r\nChoose k cards and pay for it.\r\n\r\nTo calculate the cost:\r\n For card i calculate how many cards have equal to the ith\r\n Sum up\r\n\"\"\"\r\n\r\nfrom collections import Counter\r\n\r\nn, k = map(int, input().split())\r\ncards = [card for card in input().strip()]\r\n\r\noptions = sorted(Counter(cards).values(), reverse=True)\r\n\r\nchoices = []\r\nfor option in options:\r\n if k >= option:\r\n choices.append(option)\r\n k -= option\r\n else:\r\n choices.append(k)\r\n break\r\n\r\nprint(sum([choice ** 2 for choice in choices]))\r\n", "from sys import stdin\r\n\r\nA = list(map(int,stdin.readline().split()))\r\nN = A[0]\r\nK = A[1]\r\nB = stdin.readline()\r\nD=dict()\r\nS=set()\r\nT=list()\r\n\r\nfor t in range(0,len(B)-1):\r\n l=len(S)\r\n S.add(B[t])\r\n if l==len(S):\r\n D[B[t]]+=1\r\n T.remove(D[B[t]]-1)\r\n T.append(D[B[t]])\r\n else:\r\n D[B[t]]=1\r\n T.append(1)\r\n\r\nT.sort(reverse=True)\r\ncount=0\r\nans=0\r\n\r\nwhile K>0:\r\n ans+=(min(K,T[count])**2)\r\n K-=T[count]\r\n count+=1\r\n\r\nprint(ans)\r\n", "f = input().split()\nn = int(f[0])\nk = int(f[1])\nl = input()\nd ={}\nq = []\nc=0\nfor i in l:\n if i not in d:\n d[i] =1\n else:\n d[i] +=1\nfor i in d.values():\n q.append(i)\nq.sort(reverse=True)\nj=0\nwhile(1):\n if k<=0:\n break\n if q[j]<=k:\n k= k-q[j]\n c += q[j]*q[j]\n elif q[j]>k:\n c += k*k\n break\n j+=1\nprint(c)\n\t \t\t\t\t \t\t \t\t \t\t \t \t", "ls=[0]*30\r\nstring=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nn,k = map(int,input().split())\r\nfor i in input(): ls[string.index(i)]+=1\r\nls.sort(reverse=True)\r\nans=0\r\nindex=0\r\nwhile k!=0:\r\n\tif k>ls[index]:\r\n\t\tk-=ls[index]\r\n\t\tans+=pow(ls[index],2)\r\n\telse:\r\n\t\tans+=pow(k,2)\r\n\t\tk=0\r\n\tindex+=1\r\nprint(ans)\r\n\t", "n, k = list(map(int, input().split()))\nar = input().rstrip()\ncalc = [0] * (ord('z') - ord('a') + 1)\nfor i in range(len(ar)):\n\tcalc[ord(ar[i]) - ord('A')] += 1\ncalc.sort()\ncalc = calc[::-1]\nans = 0\nflag = 0\nwhile (k != 0):\n\tif (calc[flag] >= k):\n\t\tans += k * k\n\t\tk -= k;\n\t\tflag += 1\n\telse:\n\t\tans += calc[flag] * calc[flag]\n\t\tk -= calc[flag];\n\t\tflag += 1\nprint(ans)", "import sys\r\nimport math\r\n\r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\nw = sys.stdin.readline()\r\n\r\nt = [0] * 26\r\n\r\nfor i in range(n):\r\n t[ord(w[i]) - ord('A')] += 1\r\n \r\nt.sort(reverse=True)\r\n\r\nres = 0\r\ni = 0\r\nwhile(k > 0):\r\n if(k - t[i] > 0):\r\n k -= t[i]\r\n res += t[i] ** 2\r\n else: \r\n res += k ** 2\r\n k -= t[i]\r\n \r\n i += 1\r\nprint(res)", "from collections import Counter\r\nn, k = map(int, input().split())\r\ns = list(input())\r\ncnt = Counter(s)\r\ncnt = dict(sorted(cnt.items(), key = lambda item : item[1])[::-1])\r\nans = 0\r\nfor ch in cnt:\r\n if cnt[ch] >= k:\r\n ans += k*k\r\n break\r\n else:\r\n ans += cnt[ch]**2\r\n k -= cnt[ch]\r\nprint(ans)", "n, k = map(int, input().split())\r\ns = input()\r\na = [0] * 26\r\nfor i in s:\r\n a[ord(i) - ord(\"A\")] += 1\r\na.sort()\r\na = a[::-1]\r\ni = 0\r\nb = []\r\nk1 = k\r\nwhile i < n and k1 > 0:\r\n b.append(min(k1, a[i]))\r\n k1 -= a[i]\r\n i += 1\r\nans = 0\r\nfor i in b:\r\n ans += i * i\r\nprint(ans)\r\n ", "n,k=map(int,input().split())\r\ns=input()\r\na=[]\r\nc=[]\r\nfor i in range(n):\r\n if(s[i] not in a):\r\n a.append(s[i])\r\n c.append(1)\r\n else:\r\n c[a.index(s[i])]+=1\r\nans=0 \r\nwhile(k>0):\r\n x=min(max(c),k)\r\n k-=x\r\n c[c.index(max(c))]-=x\r\n ans+=x*x\r\nprint(ans) ", "import operator\n\nparams = list(map(int,list(input().split())))\n_, k = params[0], params[1]\ncards = list(input())\n\ndic = {}\nfor card in cards:\n if card not in dic:\n dic[card] = 1\n else:\n dic[card] += 1\n \n \ndic2 = dict(sorted(dic.items(), key=operator.itemgetter(1),reverse=True))\n\nlist2 = []\n\ncount = 0\nfor d in dic2:\n for _ in range(0,dic2[d]):\n list2.append(d)\n count += 1\n if count == k:\n break\n if count == k:\n break\n \n \ndic = {}\nfor card in list2:\n if card not in dic:\n dic[card] = 1\n else:\n dic[card] += 1\n \nans = 0\nfor d in dic:\n ans += dic[d]**2\n\nprint(ans)\n\t\t \t \t \t\t\t\t\t\t \t\t\t\t \t\t\t\t\t\t \t", "n,k = map(int, input().split())\r\ns = input()\r\nd = {}\r\nfor i in s:\r\n d[i] = 0\r\nfor i in s:\r\n d[i] += 1\r\nvals = []\r\nfor i in d.keys():\r\n vals.append(d[i])\r\nvals.sort()\r\nvals.reverse()\r\ncoins = 0\r\ntaken = 0\r\nfor i in vals:\r\n if(taken == k):\r\n break\r\n canTake = min(i, k - taken)\r\n taken += canTake\r\n coins += canTake ** 2\r\nprint(coins)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn, k = map(int, input().split())\r\nd = Counter()\r\ns = input()[:-1]\r\nfor i in s:\r\n d[i] += 1\r\nd = d.most_common()\r\nc = 0\r\nfor i in d:\r\n x = min(k, i[1])\r\n k -= x\r\n c += x*x\r\n if k == 0:\r\n break\r\nprint(c)", "from collections import Counter\r\n#from collections import defaultdict\r\n#import math\r\n#n = int(input())\r\n#n,m = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n#t = list(map(int,input().split()))\r\n\r\nn,k = map(int,input().split())\r\ns = input()\r\nd = Counter(s)\r\nl = list(d.values())\r\nl.sort(reverse = True)\r\nc = 0\r\nfor i in l:\r\n if i <= k:\r\n c += i**2\r\n k = k-i\r\n else:\r\n c += k**2\r\n k = 0\r\n if k <=0:\r\n break\r\n\r\nprint(c)\r\n \r\n\r\n \r\n", "def solve():\r\n\tA, B = map(int, input().split())\r\n\tS = input()\r\n\tdp = [0]*26\r\n\r\n\tfor i in S:\r\n\t\tidx = ord(i) - 65;\r\n\t\tdp[idx] = dp[idx] + 1\r\n\r\n\tdp.sort(reverse = True)\r\n\r\n\tres = 0\r\n\tfor i in dp:\r\n\t\tif(B > i):\r\n\t\t\tB = B - i\r\n\t\t\tres = res + i*i\r\n\t\telse:\r\n\t\t\tres = res + B*B\r\n\t\t\treturn res\r\n\treturn res\r\n\r\nprint(solve())\r\n\r\n\r\n# def solve():\r\n# \tA = list(map(int, input().split()))\r\n\r\n# \treturn 4*(sum(A))\r\n\r\n# print(solve())", "from collections import Counter\r\nVN = lambda: map(int,input().split())\r\nLV= lambda: [int(i) for i in input().split()]\r\nNI = lambda: int(input())\r\nSI = lambda: input()\r\nn,k=VN();s=SI();c=Counter(s);res=0\r\nfor x in sorted(c.values(),reverse=True):\r\n\tif k>=x:k-=x;res+=x**2\r\n\telse:res+=k**2;k=0\r\n\tif k==0:break;\r\nprint(res)", "d = dict()\r\nn, k = map(int,input().split())\r\ns = input()\r\nfor i in s:\r\n try:\r\n d[i] += 1\r\n except KeyError:\r\n d[i] = 1\r\nl = []\r\nfor i in d:\r\n l.append(d[i])\r\nl.sort(reverse=True)\r\ni, ans = 0, 0\r\nwhile(k):\r\n if(l[i] <= k):\r\n ans += l[i] * l[i]\r\n k -= l[i]\r\n else:\r\n ans += k * k\r\n k = 0\r\n i+=1\r\nprint(ans)\r\n", "from collections import Counter\r\nn,k = [int(x) for x in input().split()]\r\nc = Counter(input())\r\nsumm=0\r\nd = k\r\nfor x in c.most_common():\r\n if x[1]<=d:\r\n d-=x[1]\r\n summ+=(x[1])*x[1]\r\n else:\r\n rem =d\r\n d-=d\r\n summ+= (rem)*rem\r\n if d==0:\r\n break\r\nprint(summ)\r\n", "import math\n\nl1 = input().split()\nl2 = list(input())\n\nl1 = [int(i) for i in l1]\n\nw = l1[0]\ny = l1[1]\n\nc=[]\n\nfor b in range (27):\n c.append(0)\n\nfor i in range(w):\n c[ord(l2[i])-ord('A')] += 1;\n\n\nc.sort();\nresp = 0\n\nx = 26;\n\nwhile(x>=0 and y):\n if(y>=c[x]):\n y-=c[x];\n resp+=c[x]*c[x];\n else:\n resp+=y*y;\n break;\n\n x -= 1;\n\nprint(resp);\n\n\t\t\t \t\t\t\t\t \t \t \t \t \t\t \t", "from collections import Counter\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n s = list(input())\n\n dct = Counter(s)\n\n cnt = 0\n p = 0\n\n for c, o in dct.most_common():\n p += min(o, k - cnt) ** 2\n cnt += o\n if cnt > k:\n break\n\n print(p)", "n, k = map(int, input().split())\r\ns = input()\r\ncount = {}\r\nfor c in s:\r\n count[c] = count.get(c, 0) + 1\r\na = sorted(count.values(), reverse=True)\r\ncoins = 0\r\nfor c in a:\r\n if c >= k:\r\n coins += k * k\r\n break\r\n coins += c * c\r\n k -= c\r\nprint(coins)\r\n", "input_string = list(map(int, input().split()))\r\nn = input_string[0]\r\nk = input_string[1]\r\nstring = input()\r\nd = {}\r\nfor char in string:\r\n if (char in d):\r\n d[char] += 1\r\n else:\r\n d[char] = 1\r\nnewDict = {k: v for k, v in sorted(d.items(), key = lambda x:x[1], reverse=True)}\r\nres = 0\r\ntotalLetters = 0\r\nfor key in newDict.keys():\r\n curLetters = newDict[key]\r\n if (totalLetters + curLetters >= k):\r\n difference = k - totalLetters\r\n res += difference ** 2\r\n break\r\n else:\r\n totalLetters += curLetters\r\n res += curLetters ** 2\r\nprint(res)\r\n\r\n", "import collections\r\nimport heapq\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n s = input()\r\n s = collections.Counter(s)\r\n heap = [-s[i] for i in s]\r\n heapq.heapify(heap)\r\n answ = 0\r\n while k > 0 and heap:\r\n c = -heapq.heappop(heap)\r\n if k >= c:\r\n answ += c * c\r\n k -= c\r\n else:\r\n answ += k * k\r\n k -= k\r\n\r\n print(answ)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nfrom collections import Counter\r\ncount=Counter(s)\r\nlst=sorted(list(count.values()),reverse=True)\r\nans=0\r\ni=0\r\nwhile k>0:\r\n tmp=min(lst[i],k)\r\n ans+=tmp*tmp\r\n k-=tmp\r\n i+=1\r\nprint(ans)\r\n\r\n", "a, b = map(int, input().split())\nn = {chr(i): 0 for i in range(ord('A'), ord('Z') + 1)}\nfor c in input():\n n[c] += 1\n\nans = 0\nfor i in sorted(n.values(), reverse=True):\n x = min(i, b)\n ans += x * x\n b -= x\n if not b:\n break\n\nprint(ans)\n", "n, k = map(int, input().split())\r\ndic, res = {}, 0\r\nfor c in input(): \r\n dic[c] = dic.get(c, 0) + 1\r\nfor v in sorted(dic.values())[::-1]:\r\n res += min(k, v) * min(k, v)\r\n k -= min(k, v)\r\nprint(res)\r\n", "n,k=map(int,input().split())\r\ns=input()\r\ns1=set()\r\nfor i in s:\r\n s1.add(i)\r\nl=[]\r\nfor i in s1:\r\n c=0\r\n for j in s:\r\n if i==j:\r\n c+=1\r\n l.append(c)\r\nl.sort(reverse=True)\r\nsm=0\r\nsa=0\r\nfor i in l:\r\n if sm + i > k:\r\n i =( k - sm)\r\n sa += i ** 2\r\n sm = k\r\n else:\r\n sm+=i\r\n sa+=i**2\r\nprint(sa)\r\n\r\n", "n, k = input().split()\nk = int(k)\ncards = input()\n\ncount_cards = [0] * 26\nalphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\n\ndef check_position(card_letter, alphabet):\n for letter_idx, alphabet_letter in enumerate(alphabet):\n if card_letter == alphabet_letter:\n return letter_idx\n\nscore = 0\nfor card in cards:\n\n letter_idx = check_position(card, alphabet)\n count_cards[letter_idx] += 1\n if count_cards[letter_idx] == k:\n score = k**2\n k = 0\n\n\nwhile k > 0:\n max_idx = count_cards.index(max(count_cards))\n if count_cards[max_idx] >= k:\n score += k**2\n break\n else:\n score += (count_cards[max_idx]**2)\n k -= count_cards[max_idx]\n count_cards[max_idx] = 0\n\nprint(score)\n \t \t \t\t \t \t \t\t \t \t \t \t\t", "n,k = map(int,input().split())\r\n\r\ns = input()\r\n\r\ncount = [0]*26\r\n\r\nfor c in s:\r\n count[ord(c)-ord(\"A\")]+=1\r\n\r\ncount.sort(reverse=True)\r\n\r\nres=0\r\n\r\nfor i in range(26):\r\n if count[i]>=k:\r\n res+=k*k\r\n print(res)\r\n exit()\r\n\r\n k-=count[i]\r\n res+= count[i]**2\r\n\r\nprint(res)", "\r\n# n=int(input())\r\nn,k=map(int,input().split())\r\n# taking array as input\r\n# lst = [int(item) for item in input().split()]\r\n\r\nh=str(input())\r\n\r\nh=[str(x) for x in h]\r\n\r\n# mp={}\r\n# for i in h:\r\n# \tmp[i]+=1\r\n\r\n\r\ndef countOccurrence(a):\r\n k = {}\r\n for j in a:\r\n if j in k:\r\n k[j] +=1\r\n else:\r\n k[j] =1\r\n return k\r\n\r\n\r\nlst=sorted(countOccurrence(h).values(),reverse=True)\r\n\r\n\r\n\r\n# my_dict = {i:h.count(i) for i in h}\r\n\r\n\r\n# lst=sorted(my_dict.values(),reverse=True)\r\nsum=0\r\ni=0\r\n\r\n# # print(lst)\r\nwhile k>0:\r\n\tif k<=lst[i]:\r\n\t\tprint(sum+k*k)\r\n\t\texit()\r\n\tif k>lst[i]:\r\n\t\tsum=sum+lst[i]*lst[i]\r\n\t\tk=k-lst[i]\r\n\r\n\t\ti=i+1\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\n\r\nn, k = list(map(int, input().split()))\r\ns = list(input())\r\n\r\ns = Counter(s).most_common()\r\nleft = k\r\ntaken = 0\r\nidx = 0\r\nwhile left > 0:\r\n el = s[idx]\r\n num = min(left, el[1]) \r\n taken += num * num\r\n left -= num\r\n idx += 1\r\n\r\n \r\nprint(taken)", "n,k=map(int,input().split())\r\nl=list(input())\r\n\r\nl2=list(set(l))\r\nl3=[]\r\nfor i in l2:\r\n l3.append(l.count(i))\r\n \r\nl3.sort(reverse=True)\r\nans=0\r\ni=0\r\nwhile(k>0):\r\n if l3[i]<k:\r\n ans+=l3[i]*l3[i]\r\n k=k-l3[i]\r\n i+=1\r\n \r\n else:\r\n ans+=k*k\r\n k=0\r\nprint(ans)", "from collections import Counter\r\nn, k = [int(x) for x in input().split()]\r\ns = input()\r\ncnt = Counter(s)\r\nans = 0\r\nfor a, b in cnt.most_common(len(cnt)):\r\n\tans += min(k, b) ** 2\r\n\tk -= min(k, b)\r\nprint(ans)\r\n", "freq = [0]*26\r\nn,k = map(int,input().split())\r\ns = input()\r\n\r\nfor c in s:\r\n freq[ord(c)-ord('A')]+=1\r\n\r\nfreq.sort(reverse=True)\r\nans=0\r\nfor i in freq:\r\n ans+=(min(i,k)**2)\r\n k-=i\r\n if k<=0: break\r\nprint(ans)", "n,k=list(map(int,input().split()))\ns=input()\narr=[0]*26\nfor i in s:\n arr[ord(i)-ord('A')]+=1\narr.sort(reverse=True)\nind=0\nans=0\n#print(arr)\nwhile(k>0 and ind<26):\n ans+=min(arr[ind],k)*min(arr[ind],k)\n k-=min(arr[ind],k)\n ind+=1\nprint(ans)\n\n\n\n", "from collections import defaultdict\r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\ncnt = defaultdict(int)\r\nfor i in s:\r\n cnt[i]+=1\r\ncnt=sorted(cnt.values(),reverse=True)\r\n# print(cnt)\r\nans=0\r\nfor i in cnt:\r\n if(i<=k):\r\n ans+=(i*i)\r\n k-=i\r\n else:\r\n if(k<=0):\r\n break\r\n else:ans+=(k*k);k=0\r\nprint(ans)", "n, k = list(map(int, input().split()))\r\n\r\ns = input()\r\n\r\nd = dict()\r\nfor c in s:\r\n if c not in d:\r\n d[c] = 1\r\n else:\r\n d[c] += 1\r\n\r\n# print(\"d\", d)\r\n\r\n\r\nls = [(t[0], t[1]) for t in d.items()]\r\nls.sort(key=lambda x: x[1], reverse=True)\r\n\r\n# print(\"ls\", ls)\r\n\r\ncount = 0\r\nr = \"\"\r\nwhile count < k:\r\n l, v = ls.pop(0)\r\n if v >= k:\r\n count = k\r\n r += l*k\r\n break\r\n else:\r\n if v <= (k-count):\r\n count += v\r\n r += l*v\r\n else:\r\n r += l*(k-count)\r\n count += k-count\r\n\r\n# print(\"r:\", r)\r\n\r\nu = set(r)\r\nsum = 0\r\nfor i in u:\r\n sum += r.count(i)**2\r\n\r\nprint(sum)\r\n\r\n", "from collections import Counter\r\nn,k=map(int,input().split())\r\na=input()\r\np=Counter()\r\nw=0\r\nb=[]\r\nfor i in a:\r\n p[i]+=1\r\nfor j in p:\r\n b+=[p[j]]\r\nb=sorted(b)\r\nb=b[::-1]\r\nfor x in b:\r\n if k>=x:\r\n w+=x*x\r\n k-=x\r\n else:\r\n break\r\nprint(w+k*k)\r\n", "temp = input().split()\r\nN, K = int(temp[0]), int(temp[1])\r\ns = input()\r\nd = dict()\r\nfor c in s:\r\n d[c] = d.get(c, 0) + 1\r\n\r\nsum = 0\r\nwhile (K > 0):\r\n m = '-'\r\n for k, v in d.items():\r\n if d.get(m, 0) < v:\r\n m = k\r\n\r\n if K > d[m]:\r\n sum += d[m] * d[m]\r\n K -= d[m]\r\n else:\r\n sum += K * K\r\n K = 0\r\n d[m] = 0\r\nprint (sum)\r\n\r\n", "import collections\n\n\nn, k = map(int, str.split(input()))\ncoins = 0\nfor _, count in collections.Counter(input()).most_common():\n\n count = min(count, k)\n coins += count ** 2\n k -= count\n if k == 0:\n\n break\n\nprint(coins)\n", "\nimport collections\nimport math \n# 011011\n#\ndef sort(key):\n\treturn key[1]\n\ndef gcd(a,b):\n\tif b ==0 :\n\t\treturn a\n\telse:\n\t\treturn gcd(b,a%b)\ndef solve(s,k):\n\ts=sorted(s)\n\tmp={}\n\tst=0\n\tfor i in range(len(s)):\n\t\tif s[i] in mp:\n\t\t\tmp[s[i]]+=1\n\t\telse:\n\t\t\tmp[s[i]]=1\n\tpl=[]\n\tfor i in mp:\n\t\tpl.append((i,mp[i]))\n\tpl=sorted(pl,key=sort)[::-1]\n\tfor i in pl:\n\t\tif k > 0:\n\t\t\ttmp=k\n\t\t\tk-=i[1]\n\t\t\tif k <0:\n\t\t\t\tst+=(tmp**2)\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tst+=(i[1]**2)\n\treturn st\n \n \nans=[]\n# n = int(input())\n# for i in range(n):\nn,k=map(int,input().split())\ns=input()\nprint(solve(s,k))\n\nfor i in ans:\n\tprint(i)\n ", "n, k = map(int, input().split())\r\ns = input()\r\nd = {}\r\nfor i in s:\r\n d[i] = d.get(i, 0) + 1\r\nvalues = []\r\nfor i in d:\r\n values.append(d[i])\r\nvalues = sorted(values)[::-1]\r\ncoins = 0\r\ni = 0\r\nwhile k - values[i] > 0 :\r\n coins += values[i]*values[i]\r\n k -= values[i]\r\n i += 1\r\nif k > 0:\r\n coins += k*k\r\nprint(coins)\r\n ", "n,k = map(int, input().split())\r\ns = input()\r\nch = []\r\nre = {}\r\nlimit = len(s)\r\nc = 1\r\nfor i in range(limit):\r\n #print(s[i])\r\n if s[i] in re :\r\n re[s[i]] += 1\r\n else:\r\n re[s[i]] = 1\r\n ch.append(s[i])\r\nli = len(ch)\r\nscore = []\r\nfor i in range(li):\r\n score.append(re[ch[i]])\r\nscore.sort(reverse = True)\r\n#print(score)\r\nlast = len(score)\r\nout = 0\r\nfor i in range(last):\r\n if k == 0 :\r\n break\r\n if k == score[i]:\r\n out += score[i] * score[i]\r\n break\r\n elif k > score[i] :\r\n out += score[i] * score[i]\r\n k -= score[i]\r\n elif k < score[i]:\r\n out += k * k\r\n break\r\n # print(out)\r\nprint(out)\r\n \r\n", "from collections import Counter\r\nn,k = map(int,input().split())\r\nc = Counter(input())\r\na = c.most_common()\r\nadd = 0\r\nwhile k>a[0][1]:\r\n add += a[0][1]*a[0][1]\r\n \r\n k = k - a[0][1]\r\n del a[0]\r\nprint(add + k*k)", "def main() :\r\n n,k = map(int,input().split())\r\n s = input()\r\n d = {}\r\n for i in s :\r\n d[i] = d.get(i,0)+1\r\n max_ = max(d.values())\r\n if max_>=k :\r\n c = k**2 \r\n print(c)\r\n else :\r\n c = 0 \r\n while k > 0 :\r\n if max_>=k:\r\n c+= k**2\r\n break\r\n else :\r\n c+=max_**2 \r\n k-=max_\r\n for i in d :\r\n if d[i]==max_ :\r\n d[i] = 0\r\n break\r\n max_ = max(d.values()) \r\n print(c)\r\n\r\nmain()", "n, k = map(int, input().split())\r\ns = list(input())\r\ncnt = []\r\nfor i in range(0, 26):\r\n cnt.append([i, 0])\r\nfor i in s:\r\n cnt[ord(i)-65][1]+=1\r\ncnt.sort(key = lambda x: x[1], reverse = True)\r\ncntd = dict()\r\nfor i in cnt:\r\n cntd[i[0]] = i[1]\r\ncards = []\r\nfor i in cnt:\r\n for j in range(0,i[1]):\r\n cards.append(i[0])\r\ncount = 0\r\nchosen = dict()\r\nwhile(count<k):\r\n if(cards[count] in chosen):\r\n chosen[cards[count]]+=1\r\n else:\r\n chosen[cards[count]]=1\r\n count+=1\r\nans = 0\r\nfor i in chosen:\r\n ans+= chosen[i]**2\r\nprint(ans)\r\n\r\n\r\n", "n , m = map(int,input().split())\r\nr = 0\r\nt = input()\r\nd = {}\r\nfor i in set(t) :\r\n d[i] = t.count(i)\r\nfor v in sorted(d.values())[::-1]:\r\n x = min(m,v)\r\n r += x*x\r\n m -= x\r\nprint(r)\r\n\r\n", "n,k=map(int,input().split())\r\ns=input()\r\na=[0]*26\r\nfor c in s:\r\n a[ord(c)-ord('A')]+=1\r\na.sort(reverse=True)\r\nans=0\r\nfor i in range(26):\r\n if(k<=a[i]):\r\n ans+=k**2\r\n break\r\n else:\r\n ans+=a[i]**2\r\n k-=a[i]\r\nprint(ans)\r\n", "from collections import defaultdict\r\n#for _ in range(int(input())):\r\nn,k=map(int,input().split())\r\ns=input()\r\ndp=defaultdict(int)\r\nfor i in s:\r\n dp[i]+=1\r\na=sorted(dp.values(),reverse=True)\r\nc=0\r\nans=0\r\nfor i in a:\r\n if c<k:\r\n \r\n ans+=min(i,(k-c))*min(i,(k-c))\r\n c=c+min(i,(k-c))\r\n if c>=k:\r\n break\r\nprint(ans)\r\n\r\n\r\n\r\n", "from collections import Counter\nn, k = [int(x) for x in input().split()]\ns = input()\ncnt = Counter(s)\nans = 0\nfor a, b in cnt.most_common(len(cnt)):\n\tans += min(k, b) ** 2\n\tk -= min(k, b)\nprint(ans)\n", "n, k = map(int, input().split())\r\ns = input()\r\na = [0]*26\r\nfor x in s:\r\n a[ord(x)-65] += 1\r\na.sort(reverse = True)\r\ni = 0\r\nans = 0\r\nwhile(k>0):\r\n if k>a[i]:\r\n ans += a[i]*a[i]\r\n k -= a[i]\r\n i += 1\r\n else:\r\n ans += k*k\r\n break\r\nprint(ans)\r\n", "from collections import Counter\nn, k = list(map(int, input().rstrip().split()))\ns = input()\nli = [0] * 26\nfor x in s:\n li[ord(x) - 65] += 1\nli.sort(reverse=True)\ntotal = 0\ni = 0\nwhile k > 0:\n minm = min(li[i], k)\n total += minm * minm\n k -= minm\n i += 1\nprint(total)\n\n", "from collections import Counter\r\nn,k=list(map(int,input().split()))\r\nx=input()\r\nl=[]\r\nl[::]=x\r\nd=Counter(l)\r\n#res=[]\r\n#res=[item for items, c in d.most_common() for item in [items]*c]\r\nhmm=[]\r\nld=len(d)\r\nfor i in d:\r\n hmm.append(d[i])\r\nc,cou,h=0,0,0\r\nhmm.sort(reverse=True)\r\n#print(d,hmm)\r\nwhile c<k and h<ld:\r\n v=hmm[h]\r\n #print(cou,c,h)\r\n if c+v==k:\r\n cou+=v*v\r\n break\r\n elif c+v>k:\r\n val=k-c\r\n cou+=val*val\r\n break\r\n else:\r\n cou+=v*v\r\n c+=v\r\n h+=1\r\nprint(cou)\r\n \r\n", "from collections import Counter\r\nimport operator\r\nn,k= map(int,input().split())\r\ns= input()\r\nd= dict(Counter(s))\r\nv=[]\r\nfor key,value in d.items():\r\n v.append(value)\r\nans = 0\r\nv.sort(reverse= True) \r\nfor x in v:\r\n ans += min(k, x)**2\r\n k -= min(k, x)\r\nprint(ans)", "import collections,math,itertools,bisect,heapq,copy\nclass Solution:\n def solve(self):\n n,k = list(map(int, input().rstrip().split()))\n string = input()\n A = [[0,chr(i)] for i in range(65,91)]\n\n for char in string:\n A[ord(char) - 65][0] += 1\n A = sorted(A, key = lambda x:(x[0],x[1]),reverse=True)\n i = 0\n total = 0\n for i in range(len(A)):\n if k <= 0:\n break\n toAdd = min(k,A[i][0])\n k -= A[i][0]\n total += toAdd*toAdd\n\n print(total)\n # n = int(input())\n # if i1 == 0 and i2 == 0:\n # print(0)\n # return\n # for i in range(n-2):\n # temp = (i2 - i1)\n # i1 = i2\n # i2 = temp\n # print(i2% (1000000007))\n \n\nif __name__ == \"__main__\":\n solution = Solution()\n solution.solve()", "from collections import Counter\r\n\r\nn, k = map(int, input().split(' '))\r\nc = list(input())\r\n\r\nd = Counter(c).most_common()\r\n#print(d)\r\na = 0\r\n\r\nwhile k > 0 and len(d) > 0:\r\n a += min(d[0][1], k)**2\r\n k -= d[0][1]\r\n d.pop(0)\r\n\r\nprint(a) \r\n\r\n", "import copy\r\nn,k = map(int, input().split())\r\nseq = list(input())\r\n\r\nrecord = {}\r\n\r\nfor l in seq:\r\n if(l not in record):\r\n record.update({l:1})\r\n else:\r\n tmp = record.get(l)\r\n record.update({l:tmp+1})\r\n\r\nrecord = sorted(record.items(), key=lambda x: x[1], reverse=True)\r\n\r\ntotal = 0\r\n\r\nif(n <= k):\r\n for entry in record:\r\n total = total + (entry[1] ** 2)\r\nelse:\r\n poppedVal = []\r\n finalDict = []\r\n while(True):\r\n if(record[0][1] <= k):\r\n k = k - record[0][1]\r\n finalDict.append(copy.deepcopy(record[0]))\r\n record.remove(record[0])\r\n else:\r\n finalDict.append((record[0][0], k))\r\n break\r\n\r\n for entry in finalDict:\r\n total = total + (entry[1] ** 2)\r\nprint(total)\r\n\r\n\r\n \r\n\r\n ", "n, k = map(int, input().split())\r\ns = input()\r\nc = [0 for i in range(26)]\r\nfor i in range(n):\r\n\ta = ord(s[i]) - ord(\"A\")\r\n\tc[a] += 1\r\nc.sort(reverse=True)\r\nb = []\r\nres = 0\r\nfor i in c:\r\n\tif i <= k:\r\n\t\tk -= i\r\n\t\tres += i**2\r\n\telse:\r\n\t\tres += k**2\r\n\t\tk = 0\r\n\t\tbreak\r\n\tif k == 0:\r\n\t\tbreak\r\nprint (res)\r\n", "n,m=[int(i) for i in input().split()]\r\ns=str(input())\r\nd={}\r\nfor i in range(0,len(s)):\r\n if(s[i] not in d):\r\n d[s[i]]=1\r\n else:\r\n d[s[i]]=d[s[i]]+1\r\nd=sorted(d.values(),reverse=True)\r\ne=0\r\nfor i in range(0,len(d)):\r\n if(d[i]<=m):\r\n e=e+(d[i]*d[i])\r\n m=m-d[i]\r\n else:\r\n e=e+(m*m)\r\n m=0\r\n if(m==0):\r\n break\r\n# print(e)\r\nprint(e)", "#Coded by AKSHAT SHARMA - coder_iota. \r\nn,k = map(int, input().split())\r\ns = input()\r\ndc = dict()\r\nfor ch in s:\r\n if ch not in dc.keys():\r\n dc[ch] = 0\r\n dc[ch] += 1\r\nls = list(dc.values())\r\ndel dc\r\nls.sort(reverse=True)\r\nans = 0\r\nfor i in range(len(ls)):\r\n if k<=0:\r\n break\r\n ans += min(k,ls[i])**2\r\n k-=ls[i]\r\nprint(ans)", "cards_left = int(input().split()[1])\r\ndeck = input()\r\ncoins = [deck.count(card) for card in set(deck)]\r\ncoins.sort(reverse=True)\r\nresult = 0\r\nfor coin in coins:\r\n if cards_left > coin:\r\n result += coin ** 2\r\n cards_left -= coin\r\n else:\r\n result += cards_left ** 2\r\n break\r\nprint(result)", "# cook your dish here\r\nfrom collections import defaultdict\r\nif __name__ == '__main__':\r\n k,n = map(int,input().split())\r\n arr = input()\r\n d = defaultdict(lambda: 0)\r\n ans = 0\r\n for i in arr:\r\n d[i]+=1\r\n \r\n values = sorted(d.values())\r\n \r\n while n>0:\r\n if values[-1]>=n:\r\n ans+=n*n\r\n break\r\n else:\r\n ans+=values[-1]**2\r\n n-=values[-1]\r\n values.pop()\r\n \r\n \r\n print(ans)", "n,k1=map(int,input().split())\r\na=input()\r\nk={}\r\nfor i in a:\r\n if i in k.keys():\r\n k[i]+=1\r\n else:\r\n k[i]=1\r\nl=list(k.values())\r\nl.sort(reverse=True)\r\ns=0\r\nfor i in l:\r\n if k1-i>=0:\r\n s+=i**2\r\n k1-=i\r\n else:\r\n s+=k1**2\r\n break\r\nprint(s)", "n,k=map(int,input().split())\r\ns=input()\r\ndic={}; cnt=i=0\r\nfor item in s:\r\n if dic.get(item,0): continue\r\n dic[item]=s.count(item)\r\nval=sorted(dic.values(),reverse=True)\r\nl=len(val)\r\nwhile i<l and k>0:\r\n mn=min(val[i],k)\r\n cnt+=mn*mn\r\n k-=mn; i+=1\r\nprint(cnt)", "string = input()\r\nnumbers = string.split()\r\nn = int(numbers[1])\r\nstring = input()\r\nletters, values = set(string), []\r\nfor x in letters:\r\n values.append(string.count(x))\r\nvalues = sorted(values)[::-1]\r\na = b = 0\r\nfor x in values:\r\n a += x\r\n if a >= n:\r\n if a > n:\r\n b += (x - a + n) ** 2\r\n else:\r\n b += x ** 2\r\n break\r\n b += x ** 2\r\nprint(b)", "n,k = map(int, input().split())\r\ns = input()\r\nfrom collections import Counter\r\narr = list(sorted(Counter(s).values(), reverse = True))\r\npoints = 0\r\nidx = 0\r\nwhile k > 0:\r\n\ttemp = min(arr[idx], k)\r\n\tk -= temp\r\n\tpoints += temp*temp\r\n\tidx += 1\r\nprint(points)", "from typing import Counter\r\na,b=map(int,input().split())\r\nl=Counter(input())\r\nl=list(l.values())\r\nl.sort(reverse=True)\r\nc=0\r\nfor i in l:\r\n if b>0:\r\n t=min(i,b)\r\n b-=t\r\n c+=(t*t)\r\n else:\r\n break\r\nprint(c)", "a=list(map(int,input().split()))\r\nb=input()\r\n\r\nd={}\r\nfor i in b:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nm=[]\r\n\r\nfor i in d:\r\n m.append([i,d[i]])\r\n \r\nm.sort(key=lambda x:x[-1],reverse=True)\r\n\r\nco=a[1]\r\nsum1=0\r\nfor i in m:\r\n if co<=i[1]:\r\n sum1+=co*co\r\n break\r\n else:\r\n sum1+=i[1]*i[1]\r\n co-=i[1]\r\nprint(sum1)\r\n \r\n\r\n\r\n \r\n \r\n", "n, k = map(int, input().split())\r\nw = dict()\r\nfor i in range(65, 91):\r\n w[chr(i)] = 0\r\nfor i in input():\r\n w[i] += 1\r\nw = sorted(list(w.values()), reverse = True)\r\np = 0\r\nans = 0\r\nwhile k != 0:\r\n t_k = k\r\n k = max(k - w[p], 0)\r\n ans += (t_k - k ) ** 2\r\n p += 1\r\nprint(ans)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nd={}\r\nfor x in s:\r\n d[x]=d.get(x,0)+1\r\nl=sorted(d.values())[::-1]\r\nans=[]\r\ni=0\r\nwhile k>0:\r\n ans+=[min(k,l[i])]\r\n k-=l[i]\r\n i+=1\r\nfor i in range(len(ans)):\r\n ans[i]*=ans[i]\r\nprint(sum(ans))", "import operator\r\ndef solve():\r\n n, k = map(int, input().split())\r\n letters = list(input())\r\n counts = {}\r\n for letter in letters:\r\n if letter not in counts:\r\n counts[letter] = 0\r\n counts[letter] += 1\r\n \r\n\r\n score = 0\r\n while k > 0:\r\n keymax = max(counts.items(), key=operator.itemgetter(1))[0]\r\n #print(counts, keymax, k)\r\n if k >= counts[keymax]:\r\n k -= counts[keymax]\r\n score += counts[keymax] ** 2\r\n counts.pop(keymax)\r\n else:\r\n score += k ** 2\r\n k = 0\r\n return score\r\n\r\nprint(solve())", "n,k=[int(x) for x in input().split(' ')]\nstring=input()\nfreq={}\nfor x in string:\n\tif x in freq:\n\t\tfreq[x]+=1\n\telse:\n\t\tfreq[x]=1\narr=sorted(freq.values(),reverse=True)\nans=0\nfor item in arr:\n\tif not k:\n\t\tbreak\n\tif item<=k:\n\t\tans+=(item*item)\n\t\tk-=item\n\telse:\n\t\tans+=k**2\n\t\tbreak\nprint(ans)", "n, k = map(int, input().split())\nchars = [0]*26\nstring = input()\nfor char in string:\n\tchars[ord(char) - ord('A')] += 1\nchars.sort(reverse = True)\n\nsum = 0\nfor char in chars:\n\tif k > 0:\n\t\ttemp = min(char, k)\n\t\tk -= temp\n\t\tsum += temp*temp\nprint(sum)\n", "d = dict()\r\nn, k = map(int, input().split())\r\ns = input()\r\nfor i in range(len(s)):\r\n if(s[i] not in d):\r\n d[s[i]] = 0\r\n d[s[i]]+=1\r\na = []\r\nfor i in range(len(d)):\r\n a.append(d[list(d)[i]])\r\na = list(sorted(a, reverse=True))\r\n#print(a)\r\ni = 0\r\nsuma = 0\r\ncounts = a[:]\r\nfor i in range(len(a)):\r\n if(counts[i] <= k):\r\n k-=counts[i]\r\n suma += counts[i]*counts[i]\r\n else:\r\n suma += k*k\r\n break\r\nprint(suma)", "\r\nfrom collections import Counter\r\n\r\n\r\n\r\nn,k = list(map(int, input().split()))\r\ns = input()\r\n\r\ng = Counter(s).most_common()\r\n\r\ntot = 0\r\nwhile k > 0:\r\n _, ne = g.pop(0)\r\n\r\n if ne <= k:\r\n tot += ne**2\r\n k -= ne\r\n else:\r\n tot += (k)**2\r\n k = 0\r\n\r\nprint(tot)", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\ncards = input().strip()\r\n\r\n# Count the frequency of each letter\r\nletter_counts = Counter(cards)\r\n\r\n# Sort the letter frequencies in descending order\r\nsorted_counts = sorted(letter_counts.values(), reverse=True)\r\n\r\n# Calculate the maximum number of coins Toastman can get\r\ncoins = 0\r\nfor count in sorted_counts:\r\n if k > count:\r\n coins += count * count\r\n k -= count\r\n else:\r\n coins += k * k\r\n break\r\n\r\nprint(coins)\r\n", "from sys import stdin\nfrom collections import deque,Counter,defaultdict\nimport sys\nimport math\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport time\n\nn, k = map(int,input().split())\narr = input()\nc = sorted(Counter(arr).items(),key=lambda x:x[1],reverse = True)\nans=0\nfor i in c:\n if k!=0:\n m = min(k,i[1])\n ans = ans + m*m\n k-=m\nprint(ans)\n \n\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,m=rinput()\r\ns=list(input())\r\nl=list(set(s))\r\na=[]\r\nfor i in range(len(l)):\r\n a.append(s.count(l[i]))\r\n\r\na.sort(reverse=True)\r\n\r\nans=0\r\nwhile(m!=0):\r\n if(a[0]>=m):\r\n ans+=m*m\r\n m-=m\r\n else:\r\n m-=a[0]\r\n ans+=a[0]**2\r\n a.pop(0)\r\n\r\nprint(ans)", "n, k= map(int, input().split())\r\nl=input()\r\nsl=set(l)\r\nq=[]\r\nans=0\r\nfor i in sl:\r\n q.insert(-1, l.count(i))\r\n\r\nwhile k > max(q):\r\n ans+=max(q)**2\r\n k-=max(q)\r\n q.remove(max(q))\r\nelse:\r\n ans+=k**2\r\n k=0\r\n\r\nprint(ans)", "n,m = map(int,input().split())\r\nh = input()\r\nd={}\r\nk=[]\r\ncount=0\r\nfor i in h:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\np = sorted(d.values())\r\nfor i in range(len(p)-1,-1,-1) :\r\n if m<=p[i]:\r\n\r\n count+=m*m\r\n\r\n break\r\n else:\r\n count+=p[i]*p[i]\r\n m-=p[i]\r\n\r\n\r\n\r\nprint(count)", "n,k=map(int,input().split())\r\nm=input()\r\nd={chr(ord('A')+i):0 for i in range(26)}\r\nfor ch in m:\r\n d[ch]+=1;\r\nnw=[[ch,d[ch]] for ch in d]\r\nfl=True;\r\nwhile fl:\r\n fl=False\r\n for i in range(25):\r\n if(nw[i][1]<nw[i+1][1]):\r\n d=nw[i][:]\r\n nw[i]=nw[i+1][:]\r\n nw[i+1]=d[:]\r\n fl=True\r\ns=0\r\ni=0\r\nwhile k>0:\r\n if k>=nw[i][1]:\r\n s+=nw[i][1]**2\r\n k-=nw[i][1]\r\n else:\r\n s+=k**2\r\n k=0\r\n i+=1\r\nprint(s)\r\n", "from collections import Counter as cc\n\nn,k=map(int,input().split())\ns=input()\nd=list(dict(cc(s)).items())\nd.sort(key=lambda x:x[1],reverse=True)\n#print(d)\ni=k\nans=0\nwhile i!=0:\n if d[0][1]>i:\n ans+=i**2\n i=0\n else:\n ans+=d[0][1]**2\n i-=d[0][1]\n d.pop(0)\nprint(ans)\n \n", "(n, k) = map(int, input().split())\r\ns = input()\r\nd = [0] * 26\r\nfor i in range(n):\r\n d[ord(s[i]) - 65] += 1\r\nd.sort()\r\nans = 0\r\nwhile k > 0:\r\n if k < d[-1]:\r\n ans += k * k\r\n break\r\n else:\r\n k -= d[-1]\r\n ans += d[-1] * d[-1]\r\n d.pop()\r\nprint(ans)\r\n \r\n", "n, k = map(int, input().split())\r\ncards = input()\r\nhist = {}\r\nfor card in cards:\r\n hist[card] = hist.get(card, 0) + 1\r\n\r\ncounts = sorted([hist[c] for c in hist], reverse=True)\r\ncoins = 0\r\n#print(counts)\r\ni = 0\r\nwhile k>0 and i<len(counts):\r\n x = min(k, counts[i])\r\n coins += x**2\r\n k -= x\r\n i += 1\r\nprint(coins)\r\n", "n,k=map(int,input().split())\r\nst=input()\r\ns1=set(st)\r\noccur=[]\r\nfor i in s1:\r\n occur.append(st.count(i))\r\n\r\noccur.sort(reverse=True)\r\n# print(occur)\r\ncount=0\r\ni=0\r\nwhile i<n and k>0:\r\n if k>=occur[i]:\r\n count+=occur[i]*occur[i]\r\n k-=occur[i]\r\n else:\r\n count+=k*k\r\n k=0\r\n i+=1\r\nprint(count)", "n,k=map(int,input().split())\r\ninpt=input()\r\nMain=[0]*26\r\nfor count in inpt:\r\n Main[ord(count)-ord('A')]+=1\r\nMain.sort(reverse=True)\r\nMainPrint=0\r\nfor i in range(26):\r\n if k<=Main[i]:\r\n MainPrint+=k**2\r\n break\r\n else:\r\n MainPrint+=Main[i]**2\r\n k-=Main[i]\r\nprint(MainPrint)\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nalph_arr=[0 for i in range(26)]\r\nfor i in s:alph_arr[ord(i)-65]+=1\r\nalph_arr.sort(reverse=True)\r\nans=0\r\nfor i in alph_arr:\r\n if k>=i:\r\n ans+=i*i\r\n k-=i\r\n else:\r\n ans+=k*k\r\n break\r\nprint(ans)\r\n", "from collections import Counter\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n cards = input()\r\n\r\n cnt = Counter(cards)\r\n ans = 0\r\n for _, v in cnt.most_common():\r\n ans += k * k if v > k else v * v \r\n k -= v\r\n if k <= 0:\r\n break\r\n\r\n print(ans)\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# n = int(input())\r\nn, k = list(map(int, input().split()))\r\n# li = list(map(int, input().split()))\r\nst = input()\r\ndict = {}\r\n\r\ns = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nfor k_ in s:\r\n dict[k_] = 0\r\n\r\nfor i in st:\r\n dict[i] += 1\r\n\r\nsum = 0\r\nl = sorted(list(dict.values()), reverse = True)\r\ncount = 0\r\nfor i in range(len(l)):\r\n if count + l[i] <= k:\r\n count += l[i]\r\n sum += l[i]**2\r\n else:\r\n sum += (k - count)**2\r\n count = k\r\n break\r\n\r\nprint(sum)", "n,k=map(int,input().split())\r\ns=input()\r\nt=list(set(s))\r\nres,i,l=0,0,[]\r\nfor j in t:\r\n l.append(s.count(j))\r\nl.sort(reverse=True)\r\nwhile k>0:\r\n if l[i]<=k:\r\n res+=l[i]**2\r\n k-=l[i]\r\n i+=1\r\n else:\r\n res+=(k)**2\r\n k=0\r\n i+=1\r\nprint(res)", "n,k=map(int,input().split())\r\nmas = list(input())\r\ncards = [0 for i in range(26)]\r\nalph = list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nfor i in mas:\r\n cards[alph.index(i)]+=1\r\ncards.sort(reverse=True)\r\nans = 0\r\nfor i in cards:\r\n if i ==0:\r\n break\r\n else:\r\n canGrab = min(i,k)\r\n k-=canGrab\r\n ans+=canGrab*canGrab\r\nprint(ans) ", "(n,k)=map(int,input().split())\r\ns=input()\r\nl=[0 for i in range(27)]\r\nfor i in s:\r\n l[ord(i)-ord('A')]+=1\r\nl.sort()\r\nl=l[::-1]\r\ns=0\r\nfor i in l:\r\n if(k>0):\r\n if(k>=i):\r\n s+=(i*i)\r\n k-=i\r\n else:\r\n s+=(k*k)\r\n k=0\r\n else:\r\n break\r\nprint(s)\r\n ", "n, k = input().split()\r\nn, k = int(n), int(k)\r\ncards = input()\r\ncard_dict = dict()\r\n\r\nfor i in cards:\r\n try:\r\n card_dict[i] += 1\r\n except KeyError:\r\n card_dict[i] = 1\r\n\r\ncard_list = [[card_dict[i], i] for i in card_dict]\r\n\r\ncoins = 0\r\ncounter = 0\r\nmax_count = max(card_list)\r\ncard_list.remove(max_count)\r\nwhile counter < k:\r\n if counter + max_count[0] < k:\r\n counter += max_count[0]\r\n coins += max_count[0] ** 2\r\n try:\r\n max_count = max(card_list)\r\n card_list.remove(max_count)\r\n except:\r\n break\r\n else:\r\n coins += (k - counter) ** 2\r\n counter += max_count[0]\r\n\r\nprint(coins)\r\n", "def index(letter):\n return ord(letter) - ord(\"A\")\n\ncount = [0] * 26\nn, k = map(int, input().split())\nfor c in input():\n count[index(c)] += 1\n\nresult = 0\nfor i in sorted(count, reverse=True):\n if i >= k:\n result += k * k\n break\n else:\n result += i * i\n k -= i\nprint(result)", "n, k = input().split(\" \")\nn = int(n) #qtd de cards\nk = int(k) #qtd escolhida por Toast\ns = input()\n\ns = list(s)\nt = list(set(s))\ns = sorted(s)\nt = sorted(t)\n\nf = [0]*len(t)\n\ni = 0\nj = 0\nwhile i < len(s):\n if s[i] == t[j]:\n f[j] += 1\n i += 1\n else:\n j += 1\n\nf = sorted(f)\ncont = 0\nsoma = 0\ni = len(f)-1\nwhile cont < k:\n \n soma += f[i]**2\n cont += f[i]\n i -= 1\n\n\ni += 1\nsoma -= f[i]**2\ncont -= f[i]\n\nsoma += (k-cont)**2\nprint(soma)\n \n", "n,k=map(int,input().split())\r\ns=list(input())\r\nd={}\r\nfor i in s:\r\n try:\r\n d[i]+=1\r\n except:\r\n d[i]=1\r\nnew=[]\r\nfor keys in d:\r\n new.append(d[keys])\r\nnew.sort(reverse=True)\r\ni=0\r\ntotal=0\r\nwhile(k>0):\r\n if new[i]<=k:\r\n total+=(new[i]**2)\r\n k-=new[i]\r\n i+=1\r\n else:\r\n total+=k**2\r\n break\r\nprint(total)", "n, k = map(int, input().strip().split())\r\n\r\nstrs = input()\r\nd= {}\r\nfor x in range(n):\r\n \r\n if strs[x] not in d:\r\n d[strs[x]] = 1\r\n else:\r\n d[strs[x]] += 1\r\n\r\n \r\ns = sorted(d.items(), key=lambda x: x[1], reverse=True)\r\ncount = 0\r\nfor i in range(len(s)):\r\n z = min(s[i][1],k)\r\n count += z*z\r\n k -= z\r\n if k == 0:\r\n print(count)\r\n break\r\n ", "n,k = map(int,input().split())\r\nlst = list(input())\r\nuni = set(lst)\r\ncount = []\r\nfor i in uni :\r\n x = lst.count(i)\r\n count.append(x)\r\ncount.sort()\r\ncount.reverse()\r\n##print(count)\r\nans = []\r\nwhile k > 0 :\r\n for i in count :\r\n if i <= k :\r\n ans.append(i)\r\n k -= i\r\n count.remove(i)\r\n break\r\n elif i > k :\r\n ans.append(k)\r\n k = 0\r\n break\r\nans = [i ** 2 for i in ans]\r\n##print(ans)\r\nprint(sum(ans))\r\n", "from collections import Counter\r\nn, k = [int(i) for i in input().split()] \r\ns = input() \r\ncnt = Counter(s)\r\nz = sorted([i for i in cnt.values()], reverse = True) \r\nans = 0\r\nfor i in range(n): \r\n ans += min(k, z[i])**2 \r\n k -= min(k, z[i])\r\n if k == 0 : break\r\nprint(ans)", "from collections import Counter\nn, k = map(int,input().split())\ns = input()\np = Counter()\nfor i in s:\n p[i] += 1\ns = 0\nd = list(p.values())\nd.sort(reverse = True)\nfor i in d:\n if i > k:\n s += k * k\n break\n elif i == k:\n s += k * i\n break\n else:\n s += i * i\n k -= i\nprint(s)\n", "n, k = map(int, input().split())\r\ns = input()\r\nd, r = {}, 0\r\nfor c in s:\r\n d[c] = d.get(c, 0) + 1\r\nfor i in sorted(d.values(), reverse=True):\r\n if i == 0:\r\n break\r\n if i >= k:\r\n r += k*k\r\n k = 0\r\n break\r\n r += i * i\r\n k -= i\r\nprint(r)", "import collections as c\r\nn,k = map(int,input().split(\" \"))\r\nmax_cards,cards = 0,c.Counter(input())\r\nfor card in cards.most_common():\r\n temp = k\r\n k -= cards[card[0]]\r\n if k <= 0:\r\n max_cards += temp * temp\r\n break\r\n else: max_cards += cards[card[0]] * cards[card[0]]\r\nprint(max_cards)", "n,k=map(int,input().split())\r\ns=input()\r\nL=[]\r\nsumm=0\r\nd=0\r\nfor i in set(s):\r\n \r\n L.append(s.count(i))\r\n\r\n\r\n\r\n\r\nD=sorted(L)\r\nL=D[::-1]\r\nfor i in L:\r\n \r\n d=min(i,k)\r\n summ+=d*d\r\n k-=d\r\n if k<=0:\r\n break\r\nprint(summ)\r\n ", "n,k = map(int, input().split())\r\ns = input()\r\nm = {}\r\nfor ch in s:\r\n if not ch in m:\r\n m[ch] = 1\r\n else:\r\n m[ch] += 1\r\ncnts = sorted(m.values())\r\nsum = 0\r\ni = len(cnts)-1\r\nwhile k > 0:\r\n num = min(k,cnts[i])\r\n sum+=num*num\r\n k-=num\r\n i-=1\r\nprint(sum)", "from collections import Counter\nn,k=map(int,input().split())\nd,ans=Counter(input()),0\nfor i in sorted(d.values(),reverse=True):\n v=min(k,i);k-=v;ans+=v*v\n if not k:break\nprint(ans)", "import operator\r\n\r\ntable = {}\r\n\r\nn, k = map(int, input().split(' '))\r\n\r\nchain = input()\r\n\r\nfor ch in chain:\r\n if ch in table:\r\n table[ch] += 1\r\n else:\r\n table[ch] = 1\r\n\r\nsorted_table = ((k, table[k]) for k in sorted(table, key=table.get, reverse=True))\r\n\r\ntotal = 0\r\nfor key, value in sorted_table:\r\n total += min(k, value) * min(k, value)\r\n k -= value\r\n if k <= 0:\r\n break\r\nprint(total)", "a=input().split()\r\n\r\nn=int(a[0])\r\nk=int(a[1])\r\n\r\nb=input()\r\nl=[0 for i in range(26)]\r\n\r\nfor i in range(65,65+26):\r\n p=chr(i)\r\n l[i-65]=b.count(p)\r\n\r\ns=0\r\n#print(l)\r\n\r\nfor i in range(26):\r\n m=max(l)\r\n h=l.index(m)\r\n if m==k:\r\n s=s+m*m\r\n break\r\n elif m<k:\r\n s=s+(m*m)\r\n k=k-m\r\n l[h]=0\r\n else:\r\n s=s+(k*k)\r\n m=0\r\n break\r\n #print(m)\r\n #print(s)\r\n \r\n \r\nprint(s)", "from collections import defaultdict as dd\r\n\r\ncount = dd(lambda: 0)\r\nn, k = map(int, input().split())\r\nres = 0\r\ns = input()\r\nfor ch in s:\r\n count[ch] += 1\r\ns = list(set(s))\r\ns.sort(key = lambda x: count[x], reverse=True)\r\nfor ch in s:\r\n w = min(k, count[ch])\r\n k -= w\r\n res += w*w\r\nprint(res)", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\nst = input()\r\nans = ''\r\ndct = Counter(st)\r\nlst = sorted(dct.items(), key=lambda s: s[1], reverse=True)\r\n# print(lst)\r\nfor i in lst:\r\n if i[1] >= k:\r\n ans += i[0] * k\r\n k = 0\r\n break\r\n else:\r\n k -= i[1]\r\n ans += i[0] * i[1]\r\n# print(ans)\r\ndct = Counter(ans)\r\nlst = [i ** 2 for i in dct.values()]\r\nprint(sum(lst))\r\n", "n, k = map(int, input().split())\r\nd = {}\r\nfor i in list(input()):\r\n if not i in d:\r\n d[i] = 0\r\n d[i] += 1\r\na = sorted(d.values(), reverse = True)\r\ni = 0\r\nans = 0\r\nwhile k > 0:\r\n if k - a[i] > 0:\r\n ans += (a[i] ** 2)\r\n k -= a[i]\r\n i += 1\r\n else:\r\n ans += (k ** 2)\r\n break\r\nprint(ans)\r\n", "from collections import Counter \r\nn,k=list(map(int,input().split()))\r\na=str(input())\r\ndict=Counter(a)\r\ns=0\r\ndict=dict.most_common()\r\nfor i,v in dict:\r\n if(k>v):\r\n s=s+v*v\r\n k=k-v\r\n else:\r\n s=s+(k*k)\r\n break\r\nprint(s)\r\n", "line=input().split()\r\nfor i in range(len(line)):\r\n line[i]=int(line[i])\r\nn=line[0]\r\nk=line[1]\r\nn=int(n)\r\nk=int(k)\r\ns=input()\r\ncounts=dict()\r\nfor i in s:\r\n counts[i]=counts.get(i,0)+1\r\nlst=list()\r\nfor (p,v) in counts.items():\r\n lst.append(v)\r\nlst=sorted(lst, reverse=True)\r\nc=0\r\nj=0\r\nsum=0\r\nwhile(c<k):\r\n if(k-c>=lst[j]):\r\n sum=sum+lst[j]*lst[j]\r\n c=c+lst[j]\r\n else:\r\n sum=sum+(k-c)*(k-c)\r\n c=k\r\n j=j+1\r\nprint(sum)\r\n", "n, k = map(int,input().split(' '))\r\ncards = input()\r\n\r\nletters = {}\r\nfor card in cards:\r\n if card not in letters:\r\n letters[card] = 1\r\n else:\r\n letters[card] += 1\r\n\r\narr = []\r\nfor key, value in letters.items():\r\n arr.append(value)\r\n\r\narr.sort(reverse=True)\r\n\r\ncoins = 0\r\ni = 0\r\nwhile k > 0 and i < len(arr):\r\n if k > arr[i]:\r\n coins += arr[i]**2\r\n else:\r\n coins += k**2\r\n k -= arr[i]\r\n i += 1\r\n\r\nprint(coins)", "from collections import defaultdict\r\n\r\nn, k = map(int, input().split())\r\nstring = input()\r\nhash_map = defaultdict(int) # hash_map--> {character:no. of times}\r\nfor i in string:\r\n hash_map[i]+=1\r\nvalue=hash_map.values()\r\nvalue=sorted(value)[::-1]\r\nsummation=0\r\nfor i in value:\r\n if k<=0:\r\n break\r\n data=min(k,i)\r\n summation+=data**2\r\n k-=data\r\nprint(summation)", "import collections\r\nn, k = map(int, input().split())\r\na = input()\r\ncounter = dict(collections.Counter(a))\r\ncounter = sorted(list(counter.values()), reverse=True)\r\nans, i = 0, 0\r\nwhile i < k and (i + counter[0]) < k:\r\n\ti = i + counter[0]\r\n\tans = ans + (counter[0] * counter[0])\r\n\tcounter.pop(0)\r\nif(i != k and len(counter)>0):\r\n\ti = k - i\r\n\tans = ans + (i * i)\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(input())\r\nb=[]\r\nfor i in set(a):\r\n b.append(a.count(i))\r\nsum=0\r\nno=0\r\nb.sort(reverse = True)\r\nfor i in b:\r\n no+=i\r\n if no>=k:\r\n sum+=(k+i-no)**2\r\n break\r\n sum+=i**2\r\nprint(sum)", "n=input()\r\na=n.split(' ')\r\nn=int(a[0])\r\nk=int(a[1])\r\nar=input()\r\ns={}\r\n#print(ar)\r\nfor i in range(n):\r\n if ar[i] in s.keys():\r\n s[ar[i]]+=1\r\n else:\r\n s[ar[i]]=1\r\n#print(s)\r\nval=[]\r\nfor i in s.values():\r\n val.append(i)\r\n#print(val)\r\nval.sort()\r\nval.reverse()\r\nit=0\r\nsu=0\r\ntot=0\r\n#print(val)\r\nwhile(k!=0):\r\n val[it]=val[it]-1\r\n su+=1\r\n k-=1\r\n if val[it]==0 or k==0:\r\n tot+=su*su\r\n it+=1\r\n su=0\r\n #print(tot)\r\n \r\nprint(tot)\r\n \r\n \r\n \r\n", "import operator \r\nn,k=map(int,input().split())\r\ns=input()\r\nd={}\r\nfor i in s:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nsort=sorted(d.items(),key=operator.itemgetter(1))\r\nans=[]\r\nfor i in sort:\r\n ans.append(i[1])\r\nans.sort(reverse=True)\r\nanss=0\r\nfor i in ans:\r\n if i<k:\r\n anss+=(i*i)\r\n k-=(i)\r\n else:\r\n anss+=(k*k)\r\n break\r\nprint(anss)\r\n \r\n", "n, k = [int(x) for x in input().split()]\r\ns = str(input())\r\ncsort = [0 for i in range(0,26)]\r\nfor c in s:\r\n csort[ord(c)-ord('A')] += 1\r\ncsort.sort(reverse=True)\r\ncoins = 0\r\nfor i in range(0,26):\r\n if(k==0):\r\n break;\r\n elif(k>csort[i]):\r\n coins += csort[i]**2\r\n k -= csort[i]\r\n else:\r\n coins += k**2\r\n k = 0\r\nprint(coins)", "from collections import Counter\r\nn,k = map(int,input().split())\r\ns = input()\r\ndic = Counter(s)\r\ntem=sorted(dic.values(),reverse=True)\r\n# print(tem)\r\ni=0\r\nans=0\r\nwhile(i<len(tem) and k):\r\n # print(k)\r\n if(tem[i]<=k):\r\n ans+=(tem[i]*tem[i])\r\n k-=tem[i]\r\n else:\r\n ans+=(k*k)\r\n k-=k\r\n i+=1\r\nprint(ans)\r\n", "from collections import Counter\n\n\ndef main():\n n, k = map(int, input().strip().split())\n l = list(Counter(list(input().strip())).values())\n l.sort(reverse=True)\n tot = cnt = 0\n for x in l:\n if x + cnt >= k:\n x = k - cnt\n tot += x * x\n break\n tot += x * x\n cnt += x\n print(tot)\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\nstring = input()\n\ncounter = {}\nfor i in string:\n if i in counter:\n counter[i] += 1\n else:\n counter[i] = 1\n\ncounter = [counter[i] for i in counter]\ncounter.sort(reverse=True)\n\nans = 0\ni = 0\n\nwhile k > 0 and i < n:\n take = min(counter[i], k)\n ans += take * take\n k -= take\n i += 1\n\nprint(ans)\n" ]

[ "def main():\r\n #get the input string \r\n path = input()\r\n #initialise coordinates with 0\r\n coordinate = [[0 for i in range(2)] for j in range(len(path)+1)]\r\n #here we will store the number of moves left, right, up and down\r\n left = 0\r\n right = 0\r\n up = 0\r\n down = 0\r\n #get the number of moves\r\n for direction in path:\r\n if direction == 'U':\r\n up += 1\r\n elif direction == 'R':\r\n right += 1\r\n elif direction == 'D':\r\n down += 1\r\n elif direction == 'L':\r\n left += 1\r\n #here we will store the number of moves in a list\r\n allDirections = [left,up,down,right]\r\n #and if there are directions with 0 moves, remove them from the list\r\n while 0 in allDirections: allDirections.remove(0)\r\n #if we have at least 3 different directions with moves more than 0\r\n if len(allDirections) >= 3:\r\n #we find the minimum direction, because if we will have LLRRDDU the min direction will be 1 and we will have to look for consecutive moves with min+1 length\r\n minDirection = min(allDirections)\r\n #start from min + 1 position\r\n i = minDirection + 1\r\n repeatingSequences = []\r\n while i < len(path):\r\n #make a set from elements bounded between currentPosition-minDirection - 1 and currentPosition\r\n currentSet = set(path[i-minDirection - 1:i])\r\n #if the length of this set is 1 this means that we have the same letters in the sequence (ex, LLLLLL)\r\n if len(currentSet) == 1:\r\n #add this letter to the repeatingSequences list\r\n repeatingSequences.append(path[i])\r\n #and jump with min + 1 positions (because we look backword)\r\n i += minDirection + 1\r\n else:\r\n #if in the sequence we don't have only one letter\r\n #just move with one position further\r\n i += 1\r\n #if in the set we have 3 different letter this means that we found a BUG\r\n if len(set(repeatingSequences)) == 3:\r\n print('BUG')\r\n return\r\n #this sequence checks the situations like RUL which are BUGS\r\n for i in range(2,len(path)):\r\n if path[i] != path[i-1] and path[i] != path[i-2] and path[i-1] != path[i-2]:\r\n print('BUG')\r\n return\r\n#and here we use coordinate method to check all remaining cases\r\n#first of all we fil the coordinates list with data \r\n for i in range(0,len(path)):\r\n if i == 0:\r\n if path[i] == 'U':\r\n coordinate[i + 1][0] = 0\r\n coordinate[i + 1][1] = 1\r\n elif path[i] == 'R':\r\n coordinate[i + 1][0] = 1\r\n coordinate[i + 1][1] = 0\r\n elif path[i] == 'D':\r\n coordinate[i + 1][0] = 0\r\n coordinate[i + 1][1] = -1\r\n elif path[i] == 'L':\r\n coordinate[i + 1][0] = -1\r\n coordinate[i + 1][1] = 0\r\n else:\r\n if path[i] == 'U':\r\n coordinate[i + 1][0] = coordinate[i][0]\r\n coordinate[i + 1][1] += 1 + coordinate[i][1]\r\n elif path[i] == 'R':\r\n coordinate[i + 1][1] = coordinate[i][1]\r\n coordinate[i + 1][0] += 1 + coordinate[i][0]\r\n elif path[i] == 'D':\r\n coordinate[i + 1][0] = coordinate[i][0]\r\n coordinate[i + 1][1] += -1 + coordinate[i][1]\r\n elif path[i] == 'L':\r\n coordinate[i + 1][1] = coordinate[i][1]\r\n coordinate[i + 1][0] += -1 + coordinate[i][0]\r\n #make a set from coordinates, if there are repeating elements, this means that the robot was in the same position twice\r\n coordinateSet = list(set(map(tuple,coordinate)))\r\n #if the length remains the same this means that there are not repeating sequences and the robot didn't walk through the same position twice\r\n if len(coordinate) == len(coordinateSet):\r\n print('OK')\r\n else:\r\n print('BUG')\r\n\r\nmain()", "at = (0, 0)\r\n\r\np = [at]\r\n\r\nmoves = input()\r\n\r\nfuncs = {\r\n\t'L': lambda _: (_[0] - 1, _[1]),\r\n\t'R': lambda _: (_[0] + 1, _[1]),\r\n\t'D': lambda _: (_[0], _[1] - 1),\r\n\t'U': lambda _: (_[0], _[1] + 1),\r\n}\r\n\r\nfor move in moves:\r\n\tat = funcs[move](at)\r\n\tp.append(at)\r\n\r\nok = True\r\n\r\nfor i in range(len(moves) + 1):\r\n\tfor j in range(len(moves) + 1):\r\n\t\tif abs(i - j) > 1 and abs(p[i][0] - p[j][0]) + abs(p[i][1] - p[j][1]) < 2:\r\n\t\t\tok = False\r\n\r\nprint('OK' if ok else 'BUG')\r\n", "#8B - Obsession with robots\r\ns = input()\r\nd = {'U':(0,1), 'D':(0,-1), 'L':(-1,0), 'R':(1,0)}\r\np = [(0,0)]\r\nfor x in s:\r\n\ta = p[-1]\r\n\tb = d[x]\r\n\tc = (a[0]+b[0], a[1]+b[1])\r\n\tz = 0\r\n\tfor y in d.values():\r\n\t\tif (c[0]+y[0], c[1]+y[1]) in p:\r\n\t\t\tz += 1\r\n\tif (z != 1) or (c in p):\r\n\t\tprint('BUG')\r\n\t\texit()\r\n\tp.append(c)\r\nprint ('OK')", "a = []\r\n\r\nINF = 300\r\nk = 300\r\n\r\nfor i in range(k):\r\n a.append([INF] * k)\r\n\r\ncurx = k // 2\r\ncury = k // 2\r\n\r\nway = input()\r\n\r\na[curx][cury] = 0\r\na[curx + 1][cury] = 1\r\na[curx - 1][cury] = 1\r\na[curx][cury + 1] = 1\r\na[curx][cury - 1] = 1\r\n\r\nstep = 0\r\n\r\nfor i in way:\r\n if i == 'L':\r\n curx -= 1\r\n if i == 'U':\r\n cury += 1\r\n if i == 'R':\r\n curx += 1\r\n if i == 'D':\r\n cury -= 1\r\n\r\n step += 1\r\n\r\n if a[curx][cury] != step:\r\n print('BUG')\r\n exit(0)\r\n else:\r\n a[curx][cury] = min(step, a[curx][cury])\r\n a[curx + 1][cury] = min(step + 1, a[curx + 1][cury])\r\n a[curx - 1][cury] = min(step + 1, a[curx - 1][cury])\r\n a[curx][cury + 1] = min(step + 1, a[curx][cury + 1])\r\n a[curx][cury - 1] = min(step + 1, a[curx][cury - 1])\r\n\r\n#for i in a:\r\n# for j in i:\r\n# print(j, end=' ')\r\n# print()\r\n\r\nprint('OK')\r\n \r\n", "a={\"L\":(-1,0),\"U\":(0,1),\"R\":(1,0),\"D\":(0,-1)}\r\nps=[(0,0)]\r\nfor c in input():\r\n offs=a[c]\r\n now=ps[-1]\r\n new=(now[0]+offs[0],now[1]+offs[1])\r\n k=0\r\n for t in a.values():\r\n if (new[0]+t[0],new[1]+t[1]) in ps: k+=1\r\n if new in ps or k>1:\r\n print (\"BUG\")\r\n exit()\r\n ps.append(new)\r\nprint (\"OK\")\r\n", "def adjacent(move):\n\treturn [move, (move[0],move[1]-1),(move[0],move[1]+1),(move[0]-1,move[1]),(move[0]+1,move[1])]\n\nmoves = [(0,0)]\ninp = input()\nfor move in inp:\n\tif move == \"R\": moves.append((moves[-1][0]+1,moves[-1][1]))\n\telif move == \"L\": moves.append((moves[-1][0]-1,moves[-1][1]))\n\telif move == \"U\": moves.append((moves[-1][0],moves[-1][1]+1))\n\telif move == \"D\": moves.append((moves[-1][0],moves[-1][1]-1))\n\ngoon = True\nfor move in moves:\n\tposs = adjacent(move)\n\tfor loc in poss:\n\t\tif loc in moves[moves.index(move)+2:]:\n\t\t\tprint(\"BUG\")\n\t\t\tgoon = False\n\t\t\tbreak;\n\tif not goon:\n\t\tbreak;\nif goon:\n\tprint(\"OK\")\n", "def judge(x,y):\r\n global m;\r\n if(m[x][y]==0):return 1;\r\n return 0;\r\n\r\ndef bfs():\r\n global dest;\r\n q=[];\r\n q.append([100,100,0]);\r\n iq=1;\r\n i=0;\r\n vis=set();vis.add((100,100));\r\n while(i<=iq-1):\r\n x=q[i][0];y=q[i][1];dep=q[i][2];\r\n if(x==dest[0] and y==dest[1]):return dep;\r\n else:\r\n if(judge(x+1,y)==1 and ((x+1,y) not in vis)):\r\n q.append([x+1,y,dep+1]);iq+=1;vis.add((x+1,y));\r\n if(judge(x-1,y)==1 and ((x-1,y) not in vis)):\r\n q.append([x-1,y,dep+1]);iq+=1;vis.add((x-1,y));\r\n if(judge(x,y+1)==1 and ((x,y+1) not in vis)):\r\n q.append([x,y+1,dep+1]);iq+=1;vis.add((x,y+1));\r\n if(judge(x,y-1)==1 and ((x,y-1) not in vis)):\r\n q.append([x,y-1,dep+1]);iq+=1;vis.add((x,y-1));\r\n i+=1;\r\n\r\nmove=input();\r\nm=[];\r\ndest=[100,100];\r\nfor i in range(210):\r\n m.append([]);\r\n for j in range(210):m[i].append(1);\r\nm[100][100]=0;\r\nfor i in move:\r\n if(i==\"U\"):dest[1]+=1;\r\n if(i==\"D\"):dest[1]-=1;\r\n if(i==\"L\"):dest[0]-=1;\r\n if(i==\"R\"):dest[0]+=1;\r\n m[dest[0]][dest[1]]=0;\r\nif(bfs()==len(move)):print(\"OK\");\r\nelse:print(\"BUG\");\r\n\r\n \r\n", "Map = [[0 for i in range(220)] for j in range(220)]\r\nx = 110\r\ny = 110\r\nMap[x][y] = 1\r\n\r\npath = input()\r\nflag = True\r\nfor p in path:\r\n if p == 'L':\r\n if Map[x - 1][y] == 1:\r\n flag = False\r\n break\r\n if Map[x - 1][y + 1] == 1 or Map[x - 1][y - 1] == 1 or Map[x - 2][y] == 1:\r\n flag = False\r\n break\r\n x, y = x - 1, y\r\n Map[x][y] = 1\r\n\r\n if p == 'R':\r\n if Map[x + 1][y] == 1:\r\n flag = False\r\n break\r\n if Map[x + 1][y + 1] == 1 or Map[x + 1][y - 1] == 1 or Map[x + 2][y] == 1:\r\n flag = False\r\n break\r\n x, y = x + 1, y\r\n Map[x][y] = 1\r\n\r\n if p == 'U':\r\n if Map[x][y + 1] == 1:\r\n flag = False\r\n break\r\n if Map[x - 1][y + 1] == 1 or Map[x + 1][y + 1] == 1 or Map[x][y + 2] == 1:\r\n flag = False\r\n break\r\n x, y = x, y + 1\r\n Map[x][y] = 1\r\n\r\n if p == 'D':\r\n if Map[x][y - 1] == 1:\r\n flag = False\r\n break\r\n if Map[x - 1][y - 1] == 1 or Map[x + 1][y - 1] == 1 or Map[x][y - 2] == 1:\r\n flag = False\r\n break\r\n x, y = x, y - 1\r\n Map[x][y] = 1\r\n\r\nif flag == True:\r\n print('OK')\r\nelse:\r\n print('BUG')", "S=input()\r\nSET=set()\r\n\r\nx=0\r\ny=0\r\nbx=0\r\nby=0\r\n\r\n\r\nSET.add((x,y))\r\nfor s in S:\r\n bx,by=x,y\r\n\r\n if s==\"R\":\r\n y+=1\r\n elif s==\"L\":\r\n y-=1\r\n elif s==\"U\":\r\n x-=1\r\n else:\r\n x+=1\r\n\r\n if (x,y) in SET:\r\n print(\"BUG\")\r\n exit()\r\n SET.add((x,y))\r\n\r\n for z,w in [(x+1,y),(x-1,y),(x,y+1),(x,y-1)]:\r\n if z==bx and w==by:\r\n continue\r\n if (z,w) in SET:\r\n print(\"BUG\")\r\n exit()\r\n\r\nprint(\"OK\")\r\n \r\n", "s = input()\r\n# associate values on 2 coordinates\r\nd = {'U':(0,1), 'D':(0,-1), 'L':(-1,0), 'R':(1,0)}\r\np = [(0,0)]\r\nfor x in s:\r\n\t# get last point\r\n\ta = p[-1]\r\n\t# get current point\r\n\tb = d[x]\r\n\t# compute next coordinate \r\n\tc = (a[0]+b[0], a[1]+b[1])\r\n\tz = 0\r\n\t# check for arriving in the same spot\r\n\tfor y in d.values():\r\n\t\tif (c[0]+y[0], c[1]+y[1]) in p:\r\n\t\t\tz += 1\r\n\tif (z != 1) or (c in p):\r\n\t\tprint('BUG')\r\n\t\texit()\r\n\tp.append(c)\r\nprint ('OK')", "p = (0, 0)\nv = {p}\n\n\ndef left():\n return (p[0] - 1, p[1])\n\ndef right():\n return (p[0] + 1, p[1])\n\ndef up():\n return (p[0], p[1] + 1)\n\ndef down():\n return (p[0], p[1] - 1)\n\n\nfor x in input():\n if x == 'L':\n p = left()\n s = {p, left(), up(), down()}\n elif x == 'R':\n p = right()\n s = {p, right(), up(), down()}\n elif x == 'U':\n p = up()\n s = {p, left(), right(), up()}\n elif x == 'D':\n p = down()\n s = {p, left(), right(), down()}\n \n if any(x in v for x in s):\n print(\"BUG\")\n break\n \n v.add(p)\nelse:\n print(\"OK\")\n", "from collections import Counter\r\ni, j, p, s = 0, 0, {(0, 0)}, input()\r\nfor ch in s:\r\n i += [0, 0, -1, 1]['LRUD'.index(ch)]\r\n j += [-1, 1, 0, 0]['LRUD'.index(ch)]\r\n p.add((i, j))\r\nc = Counter(((x-1,y) in p)+((x+1,y) in p)+((x,y-1) in p)+((x,y+1) in p) for x,y in p)\r\nprint('OK' if c[1] == 2 and c[2] == len(s) - 1 else 'BUG')", "#8B - Obsession with robots\r\n#List of coordinates:\r\nv = {(0,0)}\r\n#We will use x to describe left<->right moves,\r\n# and y to describe up<->down moves\r\nx = y = 0\r\n#Determiner:\r\nok = 1\r\n#For each described move in the input:\r\nfor i in input().strip():\r\n #We tell the program how to translate each move into coordinates\r\n if i == 'L': x -= 1\r\n if i == 'R': x += 1\r\n if i == 'U': y += 1\r\n if i == 'D': y -= 1\r\n if (x, y) in v: ok = 0\r\n v.add((x, y))\r\n #Now, we analyze whether the input moves match the actual path:\r\n if (x-1, y) in v and i != 'R': ok = 0\r\n if (x+1, y) in v and i != 'L': ok = 0\r\n if (x, y-1) in v and i != 'U': ok = 0\r\n if (x, y+1) in v and i != 'D': ok = 0\r\n if not ok: break\r\nprint(\"OK\" if ok else \"BUG\")", "\r\ns=str(input())\r\nm = [[0 for i in range(204)] for i in range(204)]\r\n\r\nx,y=102,102\r\nv = {\"L\":[-1,0],\"R\":[1,0],\"U\":[0,1],\"D\":[0,-1]}\r\n\r\nm[x][y]=1\r\n\r\nfor i in s:\r\n x+=v[i][0]\r\n y+=v[i][1]\r\n\r\n if m[x][y]==1:\r\n print(\"BUG\")\r\n break\r\n\r\n m[x][y]=1\r\n e = m[x-1][y] + m[x+1][y] + m[x][y-1]+m[x][y+1]\r\n\r\n if e>1:\r\n print(\"BUG\")\r\n break\r\n\r\nelse:\r\n print(\"OK\")", "moves = input()\r\nfield = set()\r\nans = None\r\nx = 0\r\ny = 0\r\n\r\nlast = (x, y)\r\nfor i in moves:\r\n if i == \"R\":\r\n x += 1\r\n elif i == \"L\":\r\n x -= 1\r\n elif i == \"U\":\r\n y += 1\r\n else:\r\n y -= 1\r\n curr = (x, y)\r\n for ii in (curr, (x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)):\r\n if ii in field:\r\n ans = 'BUG'\r\n\r\n field.add(last)\r\n last = curr\r\n\r\nif ans:\r\n print(ans)\r\nelse:\r\n print('OK')\r\n ", "def f():\r\n t, r, s = [(0, 0)], [(0, 0), (-1, 0), (1, 0), (0, -1), (0, 1)], set()\r\n for i in input():\r\n if i == 'L': r = [(x - 1, y) for x, y in r]\r\n elif i == 'R': r = [(x + 1, y) for x, y in r]\r\n elif i == 'D': r = [(x, y - 1) for x, y in r]\r\n else: r = [(x, y + 1) for x, y in r]\r\n if any(i in s for i in r[1: ]): return 0\r\n s.add(t[-1])\r\n t.append(r[0])\r\n return 1\r\nprint('BOUKG'[f() :: 2])", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef add(a, b):\r\n return [(a-1, b), (a+1, b), (a, b-1), (a, b+1)]\r\n\r\n\r\ns = input()[:-1]\r\nd = set()\r\na, b = 0, 0\r\nfor i in s:\r\n x, y = a, b\r\n if i == 'L':\r\n a -= 1\r\n elif i == 'R':\r\n a += 1\r\n elif i == 'U':\r\n b += 1\r\n else:\r\n b -= 1\r\n\r\n if (a, b) in d:\r\n print('BUG')\r\n exit(0)\r\n\r\n for u in add(x, y):\r\n d.add(u)\r\n\r\nprint('OK')", "s = input()\nl = [(0,0)]\nx,y = 0,0\nres = True\nfor i in s:\n cnt = 0\n if i == 'L':\n x -= 1\n if i == 'R':\n x += 1\n if i == 'U':\n y += 1\n if i == 'D':\n y -= 1\n \n if (x, y) in l:\n res = False\n break\n l.append((x, y))\n \n if (x + 1, y) in l:\n cnt += 1\n if (x - 1, y) in l:\n cnt += 1\n if (x, y+1) in l:\n cnt += 1\n if (x, y-1) in l:\n cnt += 1\n \n if cnt >= 2:\n res = False\n break\n\nif res:\n print(\"OK\")\nelse:\n print(\"BUG\")\n\n\t\t\t\t \t \t \t \t\t \t\t \t \t\t\t", "s=input()\r\nx=0\r\ny=0\r\nd=dict()\r\nd[(x,y)]=-1\r\nf=0\r\nfor j in range(len(s)):\r\n if s[j]==\"L\":\r\n x+=-1\r\n elif s[j]==\"R\":\r\n x+=1\r\n elif s[j]==\"U\":\r\n y+=1\r\n else:\r\n y+=-1\r\n if (x,y) in d.keys():\r\n f=1\r\n break\r\n elif (x-1,y) in d.keys() and (j-d[x-1,y])>1:\r\n f=1\r\n break\r\n elif (x+1, y) in d.keys() and (j - d[x+1, y]) > 1:\r\n f = 1\r\n break\r\n elif (x, y+1) in d.keys() and (j - d[x, y+1]) > 1:\r\n f = 1\r\n break\r\n elif (x, y-1) in d.keys() and (j - d[x, y-1]) > 1:\r\n f = 1\r\n break\r\n\r\n d[x,y]=j\r\nif f==1:\r\n print('BUG')\r\nelse:\r\n print(\"OK\")\r\n\r\n\r\n\r\n", "# LUOGU_RID: 103627654\nimport sys\r\npath=input().strip()\r\nx=y=0\r\nvis=[(0,0)]\r\nl=len(path)\r\nfor i in range(l):\r\n\tx_=x\r\n\ty_=y\r\n\tnd=path[i]\r\n\tif nd=='U':\r\n\t\tx-=1\r\n\telif nd=='L':\r\n\t\ty-=1\r\n\telif nd=='R':\r\n\t\ty+=1\r\n\telse:\r\n\t\tx+=1\r\n\tif (x,y) not in vis:\tvis.append((x,y))\r\n\telse:\t\r\n\t\tprint('BUG')\r\n\t\tsys.exit(0)\r\n\tfor dx,dy in [(-1,0),(0,-1),(1,0),(0,1)]:\r\n\t\tif (x+dx,y+dy)!=(x_,y_) and (x+dx,y+dy) in vis:\r\n\t\t\tprint('BUG')\r\n\t\t\tsys.exit(0)\r\nprint('OK')\r\n", "S = input()\nv = [[0]*300 for _ in range(300)]\nN = len(S)\ndx,dy = {\"L\":-1,\"R\":1,\"U\":0,\"D\":0},{\"L\":0,\"R\":0,\"U\":1,\"D\":-1}\ndef dfs(x,y,prex=-1,prey=-1,i=0):\n\tif i!=N+1:\n\t\tif v[y][x]==1:exit(print(\"BUG\"))\n\t\tv[y][x] = 1\n\t\tfor a,b in [[-1,0],[1,0],[0,-1],[0,1]]:\n\t\t\tif (x+a,y+b)!=(prex,prey) and v[y+b][x+a]==1:\n\t\t\t\texit(print(\"BUG\"))\n\t\tif i<N:\n\t\t\tdfs(x+dx[S[i]],y+dy[S[i]],x,y,i+1)\n\ndfs(150,150)\nprint(\"OK\")", "path = input()\r\nvisited = set([(0, 0)])\r\nx, y = 0, 0\r\nlast_move = (0, 0)\r\nfor move in path:\r\n if move == 'U':\r\n y += 1\r\n elif move == 'D':\r\n y -= 1\r\n elif move == 'R':\r\n x += 1\r\n elif move == 'L':\r\n x -= 1\r\n if (x, y) in visited or (\r\n ((x + 1, y) in visited and (x + 1, y) != last_move) or \r\n ((x - 1, y) in visited and (x - 1, y) != last_move) or \r\n ((x, y + 1) in visited and (x, y + 1) != last_move) or \r\n ((x, y - 1) in visited and (x, y - 1) != last_move)):\r\n print('BUG')\r\n break\r\n visited.add((x, y))\r\n last_move = (x, y)\r\nelse:\r\n print('OK')\r\n\r\n ", "# LUOGU_RID: 101911522\ns = input()\r\nd = {'U': (0, 1), 'D': (0, -1), 'L': (-1, 0), 'R': (1, 0)}\r\np = [(0, 0)]\r\nfor c in s:\r\n t = (p[-1][0] + d[c][0], p[-1][1] + d[c][1])\r\n if t in p or sum((t[0] + dx, t[1] + dy) in p for dx, dy in ((0, 1), (0, -1), (1, 0), (-1, 0))) != 1:\r\n exit(print('BUG'))\r\n p += t,\r\nprint('OK')\r\n", "def main():\r\n moves = input()\r\n x = y = 0 #Movimientos en el eje X o Y\r\n ans = 0 #Para la respuesta \r\n \r\n coords = [[0,0]] #Guardamos las coordenadas donde se movió, para verificar después que no vuleva a un lugar donde ya había pasado\r\n \r\n for i in moves:\r\n if i == \"L\": x += 1\r\n elif i == \"R\": x -= 1\r\n elif i == \"U\": y += 1\r\n elif i == \"D\": y -= 1\r\n \r\n l = r = u = d = 0\r\n \r\n if [x-1, y] in coords: l = 1 #Se crean las coordenadas de los lugares adyacentes a las coordenadas actuales\r\n if [x+1, y] in coords: r = 1\r\n if [x, y+1] in coords: u = 1\r\n if [x, y-1] in coords: d = 1\r\n \r\n if l+r+u+d > 1: ans = 1 #Se verifica que no haya un camino más corto. Esto se hace viendo si ya se pasó por al menos dos coordenadas adyacentes a la coordenada actual\r\n \r\n if [x,y] in coords: ans = 1 #Se verifica que no se vuelva a un lugar por el que ya pasó\r\n \r\n coords.append([x, y]) #Se guardan las coordenadas \r\n \r\n print(\"OK\" if ans == 0 else \"BUG\")\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "s=input()\r\ncoords = [(0, 0)]\r\nd = {'L' : [-1, 0], 'R':[1,0], 'U':[0, 1], 'D':[0, -1]}\r\nfor i in s:\r\n coords += [(coords[-1][0]+d[i][0], coords[-1][1]+d[i][1])]\r\nnear = set()\r\nfor i, j in enumerate(coords):\r\n for h in d.keys():\r\n q = (j[0]+d[h][0], j[1] + d[h][1])\r\n if i == 0:\r\n if q != coords[i+1]:\r\n near.add(q)\r\n elif i == len(coords)-1:\r\n if q != coords[i-1]:\r\n near.add(q)\r\n else:\r\n if q != coords[i-1] and q != coords[i+1]:\r\n near.add(q)\r\nif len(set(coords)) != len(coords) or set(coords) & near:\r\n print('BUG')\r\nelse:\r\n print('OK')", "# LUOGU_RID: 133433487\na = input()\r\nnow = [0, 0]\r\npath = [now[:]]\r\nneighbour = [[0, 1], [0, -1], [1, 0], [-1, 0]]\r\nfail = False\r\nfor i in range(len(a)):\r\n if a[i] == 'U':\r\n now[0] += 1\r\n if a[i] == 'D':\r\n now[0] -= 1\r\n if a[i] == 'L':\r\n now[1] -= 1\r\n if a[i] == 'R':\r\n now[1] += 1\r\n\r\n if now in path:\r\n fail = True\r\n break\r\n\r\n path.append(now[:])\r\n counter = 0\r\n for j in neighbour:\r\n if [now[0] + j[0], now[1] + j[1]] in path:\r\n counter += 1\r\n if counter > 1:\r\n fail = True\r\n break\r\n if fail:\r\n break\r\n\r\nif fail:\r\n print('BUG')\r\nelse:\r\n print('OK')", "#!/usr/bin/env python\n\n\ndef main():\n moves = input()\n\n visited = set()\n x = y = 0\n last = x, y\n for m in moves:\n visited.add(last)\n if m == \"L\":\n x -= 1\n elif m == \"R\":\n x += 1\n elif m == \"U\":\n y += 1\n else:\n y -= 1\n curr = x, y\n for pos in curr, (x - 1, y), (x + 1, y), (x, y + 1), (x, y - 1):\n if pos in visited and pos != last:\n print(\"BUG\")\n return\n last = curr\n print(\"OK\")\n\n\nif __name__ == '__main__':\n main()\n", "from collections import deque\n\ndef main():\n pos = (0, 0)\n s = input()\n n = len(s)\n moves = {'L': (0, -1), 'R': (0, 1), 'U': (-1, 0), 'D': (1, 0)}\n safe = set()\n for c in s:\n dx, dy = moves[c]\n pos = (pos[0] + dx, pos[1] + dy)\n safe.add(pos)\n\n goal = pos\n pos = (0, 0)\n q = deque([pos])\n lvl = 0\n dist = -1\n vis = set([pos])\n\n while q:\n if dist != -1:\n break\n\n sz = len(q)\n for _ in range(sz):\n cur = q.popleft()\n if cur == goal:\n dist = lvl\n break\n\n for _, v in moves.items():\n dx, dy = v\n npos = (cur[0] + dx, cur[1] + dy)\n if npos in safe and npos not in vis:\n vis.add(npos)\n q.append(npos)\n\n lvl += 1\n\n print('OK' if dist == n else 'BUG')\n\nmain()\n", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nss=input()\r\narr=[(0,0)];forbi=set();f=1;x=0;y=0\r\nfor s in ss:\r\n if s=='U':\r\n forbi=forbi |{(x-1,y),(x,y-1),(x,y+1)}\r\n x+=1;y+=0\r\n elif s=='D':\r\n forbi=forbi |{(x+1,y),(x,y-1),(x,y+1)}\r\n x+=-1;y+=0\r\n elif s=='L':\r\n forbi=forbi |{(x+1,y),(x-1,y),(x,y+1)}\r\n x+=0;y+=-1\r\n elif s=='R':\r\n forbi=forbi |{(x+1,y),(x-1,y),(x,y-1)}\r\n x+=0;y+=1\r\n if (x,y) in forbi:f=0;break\r\n arr.append((x,y))\r\n# print(forbi) \r\nprint('OK' if len(arr)==len(set(arr)) and f else 'BUG')\r\n \r\n ", "N = lambda x, y : {(x-1,y), (x+1,y), (x,y-1), (x,y+1)}\r\nS = set()\r\nx, y = 0, 0\r\nkey = False\r\nfor j in input():\r\n K = N(x, y)\r\n if j == 'L': y -= 1\r\n if j == 'R': y += 1\r\n if j == 'D': x -= 1\r\n if j == 'U': x += 1\r\n if (x, y) in S:\r\n print(\"BUG\")\r\n key = True\r\n break\r\n S |= K\r\nif key == False:\r\n print(\"OK\")", "s = input().strip()\r\n\r\nstart = (0, 0)\r\nMap = [ (0, 0) ]\r\ngraph = {}\r\nnum = {}\r\nnum[start] = 0\r\nx = 0\r\ny = 0\r\n\r\nfor t in s:\r\n if t == 'U':\r\n y += 1 \r\n elif t == 'D':\r\n y -= 1\r\n elif t=='L':\r\n x -= 1\r\n else:\r\n x += 1\r\n Map.append( (x, y) )\r\n\r\ngoal = Map[-1]\r\n#print(Map)\r\n\r\nfor m in Map:\r\n graph[m] = set()\r\n for n in Map:\r\n if m != n and ( ( abs( m[0] - n[0] ) == 1 and m[1] == n[1] ) \\\r\n or ( abs( m[1] - n[1] ) == 1 and m[0] == n[0] ) ):\r\n graph[m].add(n)\r\n\r\n#print(graph)\r\n\r\nvisited, queue = set(), [start]\r\nwhile queue:\r\n vertex = queue.pop(0)\r\n if vertex == goal:\r\n break\r\n if vertex not in visited:\r\n visited.add(vertex)\r\n for item in graph[vertex] - visited:\r\n num[item] = num[vertex] + 1\r\n queue.append(item)\r\n\r\nif len(s) > num[goal]:\r\n print('BUG')\r\nelse:\r\n print('OK')\r\n", "def add_point(p1, p2):\r\n return p1[0] + p2[0], p1[1] + p2[1]\r\n\r\n\r\nd = {\"R\": (1, 0),\r\n \"L\": (-1, 0),\r\n \"U\": (0, -1),\r\n \"D\": (0, 1)}\r\nx, y = 0, 0\r\na = set()\r\nb = set(d[i] for i in d)\r\np = input().strip()\r\nres = \"OK\"\r\nfor i in p:\r\n x, y = add_point((x, y), d[i])\r\n if (x, y) in a:\r\n res = \"BUG\"\r\n break\r\n a = a.union(b)\r\n b = set(add_point((x, y), d[j]) for j in d)\r\nif (x, y) == (0, 0):\r\n res = \"BUG\"\r\nprint(res)\r\n", "x=input()\nr,s=0,0\nbio=[]\n\nbio.append([r,s])\nbio.append([r-1,s])\nbio.append([r+1,s])\nbio.append([r,s+1])\nbio.append([r,s-1])\n\nda=True\n\nfor i in x:\n if i=='L':\n s-=1\n elif i=='R':\n s+=1\n elif i=='U':\n r-=1\n else:\n r+=1\n\n if [r,s] in bio[0:-5]:\n da=False\n break\n else:\n bio.append([r,s])\n bio.append([r-1,s])\n bio.append([r+1,s])\n bio.append([r,s+1])\n bio.append([r,s-1])\n\n\nif da:\n print('OK')\n\nelse:\n print('BUG')\n \n##print(bio)\n\n \t \t\t \t\t \t\t \t\t\t\t\t\t", "s = input()\r\nd = [[-1, 0], [1, 0], [0, 1], [0, -1]]\r\nres = True\r\ngraph = [[-1] * 250 for _ in range(250)]\r\nx = y = 105\r\ngraph[x][y] = 0\r\nl = len(s)\r\nimport queue\r\nfor i in range(l):\r\n if s[i] == 'L':\r\n y -= 1\r\n elif s[i] == 'R':\r\n y += 1\r\n elif s[i] == 'D':\r\n x += 1\r\n else:\r\n x -= 1\r\n if graph[x][y] != -1:\r\n res = False\r\n break\r\n graph[x][y] = i + 1\r\nq = queue.Queue(maxsize=0)\r\nq.put([105, 105])\r\nwhile not q.empty():\r\n item = q.get()\r\n t = 0\r\n for [d1, d2] in d:\r\n x = item[0] + d1\r\n y = item[1] + d2\r\n if graph[x][y] > graph[item[0]][item[1]]:\r\n t += 1\r\n q.put([x, y])\r\n if t > 1:\r\n res = False\r\n break\r\nif res:\r\n print('OK')\r\nelse:\r\n print(\"BUG\")", "from collections import Counter\n\n\ndef main():\n i, j, point, path = 0, 0, {(0, 0)}, input()\n for ch in path:\n i += [-1, 1, 0, 0][\"LRUD\".index(ch)]\n j += [0, 0, -1, 1][\"LRUD\".index(ch)]\n point.add((i, j))\n c = Counter([((x-1,y) in point)+((x+1,y) in point)+((x,y-1) in point)+((x,y+1) in point) for x,y in point])\n print(\"OK\" if c[1]==2 and c[2] ==len(path)-1 else \"BUG\")\n\n\nif __name__ == '__main__':\n main()\n", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n record = set()\r\n current_pos = [0, 0]\r\n for move in input():\r\n last_pos = tuple(current_pos)\r\n if move == 'L':\r\n current_pos[0] -= 1\r\n elif move == 'R':\r\n current_pos[0] += 1\r\n elif move == 'U':\r\n current_pos[1] += 1\r\n else:\r\n current_pos[1] -= 1\r\n if test(current_pos, record):\r\n record.add(last_pos)\r\n else:\r\n print('BUG')\r\n return\r\n print('OK')\r\n\r\n\r\ndef test(position, record):\r\n return not ((position[0]+1, position[1]) in record or\r\n (position[0]-1, position[1]) in record or\r\n (position[0], position[1]+1) in record or\r\n (position[0], position[1]-1) in record)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "tAdd = lambda p, q: (p[0]+q[0], p[1]+q[1])\r\ndirection = {'U':(0, -1), 'R':(1, 0), 'D':(0, 1), 'L':(-1, 0)}\r\npath = input()\r\npos = (0, 0)\r\nvisited = set()\r\n\r\nbug = False\r\nfor d in path:\r\n nextp = tAdd(pos, direction[d])\r\n if not visited.isdisjoint([tAdd(nextp, direction[d]) for d in direction]):\r\n bug = True\r\n break\r\n visited.add(pos)\r\n pos = nextp\r\n\r\nprint('BUG' if bug else 'OK')\r\n", "moves = input()\r\nroute = [[0,0]]\r\n\r\nfor move in moves:\r\n new_pos = [route[-1][0], route[-1][1]]\r\n if move == 'R':\r\n new_pos[1] += 1\r\n if move == 'L':\r\n new_pos[1] -= 1\r\n if move == 'U':\r\n new_pos[0] += 1\r\n if move == 'D':\r\n new_pos[0] -= 1\r\n route.append(new_pos)\r\n\r\nfor i in range(len(route)-2):\r\n p1 = route[i]\r\n for j in range(i+2, len(route)):\r\n p2 = route[j]\r\n if abs(p1[0] - p2[0]) + abs(p1[1] - p2[1]) <= 1:\r\n print(\"BUG\")\r\n break\r\n else:\r\n continue\r\n break\r\nelse:\r\n print(\"OK\")", " \ndef t(p,r):\n return not ((p[0]+1,p[1]) in r or\n (p[0]-1,p[1]) in r or\n (p[0],p[1]+1) in r or\n (p[0],p[1]-1) in r) \ndef solve():\n path=set()\n cur=[0,0]\n for move in input():\n lp= tuple(cur)\n if move == 'L':\n cur[0] -= 1\n elif move == 'R':\n cur[0] += 1\n elif move == 'U':\n cur[1] += 1\n else:\n cur[1] -= 1\n if t(cur,path):\n path.add(lp)\n else:\n print('BUG')\n return\n print('OK')\nsolve()\n \n\n \t\t \t\t\t \t \t \t\t\t \t\t\t \t\t\t \t", "def check(l):\r\n global i\r\n return (l in squares and squares.index(l)!=i)\r\ninp= input()\r\nx,y=0,0\r\nsquares=[[x,y]]\r\nfor i in range(len(inp)):\r\n if inp[i]=='L': x-=1\r\n elif inp[i]=='R': x+=1\r\n elif inp[i]=='U': y+=1\r\n elif inp[i]=='D': y-=1\r\n if check([x,y]) or check([x+1,y]) or check([x-1,y]) or check([x,y+1]) or check([x,y-1]):\r\n print(\"BUG\")\r\n exit()\r\n squares.append([x,y])\r\nprint(\"OK\")", "arr = [(0, 0)]\r\nx = y = 0\r\nans = True\r\nfor i in input():\r\n if i =='L': x-=1\r\n if i =='R': x+=1\r\n if i =='D': y-=1\r\n if i =='U': y+=1\r\n if (x, y) in arr:\r\n ans = False\r\n break\r\n arr.append((x, y))\r\n if (x-1, y) in arr and i!='R':\r\n ans = False\r\n break\r\n if (x+1, y) in arr and i!='L':\r\n ans = False\r\n break\r\n if (x, y-1) in arr and i!='U':\r\n ans = False\r\n break\r\n if (x, y+1) in arr and i!='D':\r\n ans = False\r\n break\r\n\r\nif ans:\r\n print(\"OK\")\r\nelse:\r\n print(\"BUG\")", "'''\r\nReferência:\r\nhttps://codeforces.com/problemset/problem/8/B\r\n'''\r\n\r\npos = [[0,0]]\r\natual = [0,0]\r\n\r\npassos = input()\r\n\r\nmap = True\r\nfor i in range(len(passos)):\r\n if passos[i] == \"L\":\r\n atual[0] -= 1\r\n elif passos[i] == \"R\":\r\n atual[0] += 1\r\n elif passos[i] == \"U\":\r\n atual[1] += 1\r\n else:\r\n atual[1] -= 1\r\n if atual in pos:\r\n map = False\r\n break\r\n else:\r\n pos.append(atual.copy())\r\n\r\nif map:\r\n #print(\"OK\")\r\n n = len(pos)\r\n #print(pos)\r\n if n > 3:\r\n for i in range(n-3):\r\n for j in range(i+3, n):\r\n #print(i, j)\r\n if (pos[i][0] == pos[j][0] and abs(pos[i][1] - pos[j][1]) == 1) or pos[i][1] == pos[j][1] and abs(pos[i][0] - pos[j][0]) == 1:\r\n print(\"BUG\")\r\n quit()\r\n print(\"OK\") \r\nelse:\r\n print(\"BUG\")", "dir = input()\r\na= [[0,0]]\r\n\r\nfor i in dir:\r\n x = [a[-1][0],a[-1][1]]\r\n if i == \"D\":\r\n x[0] -= 1\r\n if i == \"U\":\r\n x[0] += 1\r\n if i == \"L\":\r\n x[1] -= 1\r\n if i == \"R\":\r\n x[1] += 1\r\n\r\n a.append(x)\r\n\r\n\r\nn = len(a)\r\nshortpath = True\r\nfor q in range(n):\r\n for j in range(q+2, n):\r\n if abs(a[j][0]-a[q][0]) + abs(a[j][1] - a[q][1]) <= 1:\r\n shortpath = False\r\n\r\nif shortpath:\r\n print(\"OK\")\r\nelse:\r\n print(\"BUG\")\r\n\r\n ", "# maa chudaaye duniya\r\nd = [[0,1], [0, -1], [1, 0], [-1, 0], [0, 0]]\r\n\r\npath = input()\r\n\r\nvis = []\r\ncur = [0, 0]\r\nf = True\r\nfor p in path:\r\n\tprev = cur\r\n\tif p == 'L': index = 0\r\n\telif p == 'R' : index = 1\r\n\telif p == 'U' : index = 2\r\n\telse: index = 3\r\n\tcur = [cur[0] + d[index][0], cur[1] + d[index][1]]\r\n\tif cur in vis:\r\n\t\tf = False\r\n\t\tprint('BUG')\r\n\t\tbreak\r\n\tfor dx, dy in d:\r\n\t\tvis.append([prev[0] + dx, prev[1] + dy])\r\nif f:\r\n\tprint('OK')", "from collections import namedtuple\n\nPos = namedtuple('Pos', 'x y')\n\ns = input()\ng = {}\n\n\ndef add(last, pos):\n if last not in g:\n g[last] = set()\n g[last].add(pos)\n\n if pos not in g:\n g[pos] = set()\n g[pos].add(last)\n\n\nstart = Pos(100, 100)\nlast = start\nok = True\n\nfor ch in s:\n pos = Pos(0, 0)\n if ch == 'L':\n pos = Pos(last.x - 1, last.y)\n elif ch == 'R':\n pos = Pos(last.x + 1, last.y)\n elif ch == 'U':\n pos = Pos(last.x, last.y - 1)\n elif ch == 'D':\n pos = Pos(last.x, last.y + 1)\n\n if pos == start:\n ok = False\n break\n\n if pos in g:\n ok = False\n break\n\n p1 = Pos(pos.x - 1, pos.y)\n p2 = Pos(pos.x + 1, pos.y)\n p3 = Pos(pos.x, pos.y + 1)\n p4 = Pos(pos.x, pos.y - 1)\n\n\n def not_good(pc):\n return pc != last and pc in g\n\n\n if not_good(p1) or not_good(p2) or not_good(p3) or not_good(p4):\n ok = False\n break\n\n add(last, pos)\n last = pos\n # print(pos)\n\n# print(g)\nprint('OK' if ok else 'BUG')\n\n# def var(s, c):\n# if c == 0:\n# for k in range(10):\n# s1 = str(s) + str(k)\n# print(s1)\n# else:\n# for k in range(10):\n# s1 = str(s) + str(k)\n# var(s1, c - 1)\n#\n#\n# def var0():\n# for k in range(10):\n# var(k, 3)\n#\n#\n# var0()\n", "record_of_movements = input()\r\nx, y = 0, 0\r\nd_movement = {'L': (0, -1), 'R': (0, 1), 'U': (1, 0), 'D': (-1, 0)}\r\nd = {(x, y): ''}\r\nbug = False\r\nfor move in record_of_movements:\r\n temp = (x, y)\r\n x += d_movement[move][0]\r\n y += d_movement[move][1]\r\n if (x, y) not in d:\r\n for step in d_movement:\r\n if (x + d_movement[step][0], y + d_movement[step][1]) != temp and (\r\n x + d_movement[step][0], y + d_movement[step][1]) in d:\r\n bug = True\r\n break\r\n else:\r\n bug = True\r\n if bug:\r\n break\r\n d[x, y] = ''\r\nif bug:\r\n print('BUG')\r\nelse:\r\n print('OK')\r\n", "istr = input()\na = 0\nb = 0\npoints_set = set()\n\n# building graph\nfor char in istr:\n\tpoints_set.add((a, b))\n\tif(char == 'L'):\n\t\ta -= 1\n\tif(char == 'R'):\n\t\ta += 1\n\tif(char == 'U'):\n\t\tb += 1\n\tif(char == 'D'):\n\t\tb -= 1\npoints_set.add((a, b))\n\n\npoints_dict = dict()\n\nfor point in points_set:\n\tpointers = []\n\tif((point[0]-1, point[1]) in points_set):\n\t\tpointers.append((point[0]-1, point[1]))\n\tif((point[0]+1, point[1]) in points_set):\n\t\tpointers.append((point[0]+1, point[1]))\n\tif((point[0], point[1]-1) in points_set):\n\t\tpointers.append((point[0], point[1]-1))\n\tif((point[0], point[1]+1) in points_set):\n\t\tpointers.append((point[0], point[1]+1))\n\tpoints_dict[point] = pointers\n\n\n\ndef bfs(start, end):\n\tqueue = [[(0, 0), 0]]\n\tvisited = set()\n\twhile(len(queue) > 0):\n\t\t# print(\"q:\" , queue)\n\t\tpopped_element = queue[0]\n\t\tqueue = queue[1:]\n\t\tvisited.add(popped_element[0])\n\t\tif(popped_element[0] == end):\n\t\t\treturn popped_element[1]\n\t\tfor point in points_dict[popped_element[0]]:\n\t\t\tif(point not in visited):\n\t\t\t\tqueue.append([point, popped_element[1]+1])\n\treturn -1\n\n\nstart = (0, 0)\nend = (a, b)\n\nif(bfs(start, end) == len(istr)):\n\tprint(\"OK\")\nelse:\n\tprint(\"BUG\")\n\n\n\n# istr = input()\n\n# class PointNode:\n# \tx = -111\n# \ty = -111\n# \tidn = -111\n# \tptrs = []\n\n# \tdef __init__(self, x, y, idn, ptrs):\n# \t\tself.x = x\n# \t\tself.y = y\n# \t\tself.idn = idn\n# \t\tself.ptrs = ptrs\n\n# \tdef __str__(self):\n# \t\tprint(\"x: %d, y: %d\"%(self.x, self.y), end=\", \")\n# \t\tfor ptr in self.ptrs:\n# \t\t\tprint(\"ptr: \", ptr, end=\" ,\")\n# \t\treturn \"\"\n\n\n# a = 0\n# b = 0\n# point_id = 0\n# points_dict = dict()\n# for char in istr:\n# \tpoints_dict[(a, b)] = PointNode(a, b, point_id, [])\n# \tif(char == 'L'):\n# \t\tpoints_dict[(a, b)].ptrs.append((a-1, b))\n# \t\ta -= 1\n# \telif(char == 'R'):\n# \t\tpoints_dict[(a, b)].ptrs.append((a+1, b))\n# \t\ta += 1\n# \telif(char == 'U'):\n# \t\tpoints_dict[(a, b)].ptrs.append((a, b+1))\n# \t\tb += 1\n# \telif(char == 'D'):\n# \t\tpoints_dict[(a, b)].ptrs.append((a, b-1))\n# \t\tb -= 1\n# \telse:\n# \t\tprint('ERROR')\n# \tpoint_id += 1\n\n# points_dict[(a, b)] = PointNode(a, b, point_id, [])\n# for x in points_dict.values():\n# \tprint(x)\n\n\n\n", "# LUOGU_RID: 133436444\nn_list=input()\npos_list=[[0,0]]\npos=[0,0]\nfail=False\nneighbour = [[1, 0], [-1, 0], [0, 1], [0, -1]]\nfor i in n_list:\n if i=='L':\n pos[0]-=1\n elif i=='R':\n pos[0]+=1\n elif i=='U':\n pos[1]+=1\n elif i=='D':\n pos[1]-=1\n\n if pos in pos_list:\n fail=True\n break\n pos_list.append(pos[:])\n counter=0\n for j in neighbour:\n if [pos[0]+j[0],pos[1]+j[1]]in pos_list:\n counter+=1\n if counter>1:\n fail=True\n break\nif fail:\n print('BUG')\nelse:\n print('OK')" ]

[ "# A. Fafa and his Company\r\n \r\nn = int(input())\r\ni = 1\r\ncont = 0\r\nwhile i <= n/2:\r\n e = n - i\r\n if e % i == 0:\r\n cont += 1\r\n i += 1\r\nprint(cont)", "no_of_employees=int(input())\r\ni=1\r\nways=0\r\nwhile(i<=no_of_employees/2):\r\n if(no_of_employees%i==0):\r\n ways+=1\r\n i+=1 \r\nprint(ways)", "t = int(input())\r\ns = 1\r\n\r\nfor i in range(2, t):\r\n if t % i == 0:\r\n s += 1\r\n\r\nprint(s)\r\n", "n = int(input())\r\nc = 0\r\nfor i in range(1,int(n/2)+1):\r\n if n%i == 0:\r\n c = c + 1\r\nprint(c)", "n = int(input())\r\n\r\ncnt=0\r\n\r\nfor i in range(1,n//2+1):\r\n\tif n%i==0:\r\n\t\tcnt += 1\r\n\r\nprint(cnt)", "import math\r\n\r\nn = int(input())\r\nc = 0\r\n\r\nfor i in range(1, n+1):\r\n if (n-i >= i):\r\n if ((n-i) % i == 0):\r\n c += 1\r\n\r\nprint(c)\r\n", "possible_teams = 0\r\nnumber_of_employees = int(input())\r\nfor i in range(1,number_of_employees):\r\n if number_of_employees % i == 0:\r\n possible_teams += 1\r\nprint(possible_teams)", "x = int(input())\r\n\r\nans = list(range(1, x//2+1))\r\nans = [i for i in ans if (x-i) % i == 0]\r\nprint(len(ans))\r\n", "n = int(input())\r\n\r\ncont = 0\r\n\r\nfor i in range (1, int(n / 2 + 1)):\r\n\r\n res = n - i\r\n\r\n if res % i == 0:\r\n cont += 1\r\n\r\n\r\nprint(cont)", "\r\nn=int(input())\r\ncount=0\r\nfor i in range(1,n):\r\n if (n%i) == 0:\r\n count = count + 1\r\nprint(count)", "n = int(input())\r\nans = 0\r\nfor i in range(1,n):\r\n if((n-i)%i==0): ans+=1\r\nprint(ans) \r\n\r\n# for example 10 is only divisible by 3 numbers 1,2,5 hence it should print 3", "#4\r\n\r\nn=int(input())\r\nc=-1\r\nfor i in range(1,n+1):\r\n if(n%i==0):\r\n c=c+1\r\nprint(c)", "t=int(input())\r\na=0\r\nfor i in range(1,int(t/2)+1):\r\n if t%i==0:\r\n a=a+1\r\nprint(a)\r\n", "n=int(input())\nc=0\nfor i in range(1,n//2+1):\n if ((n-i)//i)*i==n-i:\n c+=1\nprint(c)\n", "employees = int(input())\r\nans = 0\r\nfor i in range(1,employees//2+1):\r\n if (employees-i)%i == 0:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\nx=0\r\nfor i in range(1,n//2+1):\r\n if n%i==0:\r\n x=x+1\r\nprint(x) ", "n=int(input())\r\nt=0\r\nfor l in range(1,(n//2)+1):\r\n r=n-l\r\n if r%l==0:\r\n t+=1\r\nprint(t)\r\n ", "n = int(input())\n\nc = 0\n\nfor i in range(1, n):\n if (n-i) % i == 0:\n c += 1\nprint(c)\n", "l = int(input())\r\nq = 0\r\nfor i in range(2, l//2+1):\r\n if l % i == 0:\r\n q += 1\r\nprint(q+1)", "p=int(input())\r\nt=0\r\nfor i in range(1,p):\r\n if p%i==0:\r\n t+=1\r\nprint(t)", "a=int(input())\r\nr=0\r\nfor i in range(1,a):\r\n if a%int(i)==0:\r\n r+=1\r\nprint(r)", "a = int(input())\r\nb = 0\r\nfor i in range(1, a):\r\n\tif (a - i) % i == 0:\r\n\t\tb += 1\r\nprint(b)\r\n", "n=int(input())\r\nx=0\r\nfor i in range (1,n):\r\n if n%i==0:\r\n x=x+1\r\nprint(x)", "n = int(input())\r\nans = 0\r\ni = 1\r\nwhile i * i < n:\r\n if n % i == 0:\r\n ans += 2\r\n i += 1\r\nif i * i == n:\r\n ans += 1\r\nprint(ans - 1)\r\n", "n=int(input())\r\ndiv=0\r\nfor i in range(2,int(n**0.5)+1):\r\n if n%i==0: div=div+1\r\ndiv=div*2+1\r\nif int(n**0.5)**2==n: div=div-1\r\nprint(div)\r\n", "n=int(input())\r\np=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n p+=1\r\nprint(p)\r\n\r\n", "num = int(input())\r\nnum_count = 0\r\n\r\nfor n in range(1, num):\r\n if num % n == 0:\r\n num_count += 1\r\n\r\nprint(num_count)\r\n", "employee = int(input())\r\ncount = 0\r\nfor i in range(1,employee):\r\n if employee%i==0:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nfactor = 0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n factor+=1\r\nprint(factor)", "n = int(input())\r\nanswer = 0\r\ni = 1\r\nwhile i*2 <= n:\r\n if (n - i) % i == 0:\r\n answer+=1\r\n i+=1\r\nprint(answer) ", "def solve(n):\r\n cnt = 0\r\n for i in range(n // 2, 0, -1):\r\n if n % i == 0:\r\n j = n // i - 1\r\n if j >= 1:\r\n cnt += 1\r\n return cnt\r\n\r\nn = int(input())\r\nprint(solve(n))", "n= int(input())\r\nfafa=0 \r\nfor i in range(1,((n+2)//2)):\r\n if (n-i)%i==0:\r\n fafa=fafa+1\r\n p_or_c=fafa\r\nprint(p_or_c)", "n=int(input())\r\nk=1\r\ncount=0\r\nwhile k<=n:\r\n if n%k==0:\r\n count+=1\r\n k+=1\r\nprint(count-1)", "n = int(input())\r\nans = 0\r\nfor i in range(1,n):\r\n if((n-i)%i==0):\r\n ans=ans+1\r\nprint(ans)", "n = int(input()) \r\nans = 0\r\nfor l in range(1,n):\r\n if (n-l)%l == 0:\r\n ans+=1\r\nprint(ans) ", "n=int(input())\r\nc=0\r\nfor i in range(1,n//2+1):\r\n s=n-i\r\n if s%i==0:\r\n c=c+1\r\nprint(c)", "n =int(input())\r\nf = 0\r\nfor i in range(1, int(n/2)+1):\r\n if n % i ==0:\r\n f =f + 1\r\nprint(f)", "n=int(input())\r\nx=1\r\nt=0\r\nwhile (x<=n//2):\r\n if (n%x==0):\r\n t+=1\r\n x+=1\r\nprint(t)", "a = int(input())\r\ncount = 0\r\n\r\n\r\nfor i in range (1,a):\r\n if(a%i == 0):\r\n count+=1\r\n\r\nprint(count) ", "n = int(input())\r\n\r\nways = 0\r\nfor val in range(1, (n//2) + 1):\r\n\tif n%val == 0:\r\n\t\tways += 1\r\n\r\nprint(ways)", "n=int(input())\r\nprint(sum(n%i<1 for i in range(1,n)))", "n=int(input())\r\na=0\r\nfor x in range(n):\r\n\tif n%(x+1)==0 and n!=(x+1):\r\n\t\ta+=1\r\nprint(a)", "a, t = int(input()), 0\r\nfor k in range(1, a):\r\n if (a - k) % k == 0:\r\n t += 1\r\nprint (t)", "n=int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n a=i\r\n b=n-i\r\n if((a*(b//a))+a) == n:\r\n count += 1\r\n \r\nprint(count-1)", "employees = int(input())\r\nteams = 0\r\n\r\nfor i in range(1, employees):\r\n leaders = i\r\n rest = employees - leaders\r\n\r\n if rest % i == 0:\r\n teams += 1\r\n\r\nprint(teams)", "a = int(input())\r\nj = 1\r\ncount = 0\r\n\r\nwhile j < a:\r\n if (a - j) % j == 0:\r\n count += 1\r\n j += 1\r\n\r\nprint(count)", "n = int(input())\r\nt = int(n/2)+1\r\ncnt = 0\r\nfor i in range(1, t):\r\n if n%i==0:cnt+=1\r\nprint(cnt)", "n,count = int(input()), 0\r\nfor i in range(1,n): count += 0 if n%i else 1\r\nprint(count)", "n=int(input())\nresult=0\nfor i in range(1,n):\n\tif n%i==0:\n\t\tresult+=1\nprint(result)", "n = int(input())\r\nans = 0\r\nfor i in range(1,n):\r\n if((n-i)%i==0): ans+=1\r\nprint(ans)", "n=int(input())\r\nans=1\r\nfor i in range(2,n):\r\n if((n-i)%i==0):\r\n ans=ans+1\r\nprint(ans)\r\n", "p = int(input())\r\nl = 1\r\nw = 0\r\n\r\nwhile l <= p // 2:\r\n if (p - l) % l == 0:\r\n w += 1\r\n l += 1\r\nprint(w)", "kol = 0\r\nn = int(input())\r\nfor i in range(2 , n+1):\r\n if n % i == 0:\r\n kol += 1\r\nprint(kol)\r\n", "while True:\r\n try:\r\n n = eval(input())\r\n cnt = 0\r\n for i in range(1, n):\r\n if (n - i) // i >= 1 and (n - i) % i == 0:\r\n cnt += 1\r\n print(cnt)\r\n except:\r\n break", "input_ = int(input())\r\nb = 0\r\nfor i in range(1, input_):\r\n workers = input_ - i\r\n if workers % i == 0:\r\n b +=1\r\nprint(b)\r\n", "n = int(input())\nl = 0\nfor i in range(1, n):\n\tif (n-i)%i == 0:\n\t\tl += 1\nprint(l)\n\t\n", "num= int(input())\r\ncounter= 0\r\n\r\nfor i in range(1,num):\r\n if num%i== 0:\r\n counter+= 1\r\nprint(counter)", "n,k=int(input()),0\r\nfor l in range(1,n-1):\r\n if l%(n-l)==0:\r\n k+=1\r\nprint(k+1)", "n = int(input())\r\nfaktor = []\r\nfor mod in range(1,n+1) :\r\n if (n) % mod == 0 :\r\n faktor.append(mod)\r\nm = len(faktor) - 1\r\nprint(m)", "employees = int(input())\r\ncounter = 0\r\n\r\nfor i in range(2, employees+1):\r\n if employees % i == 0:\r\n counter = counter + 1\r\n else:\r\n continue\r\n \r\nprint(counter)", "# https://codeforces.com/problemset/problem/935/A\nn = int(input())\nk = 0\nfor i in range(1, n):\n if n % i == 0:\n k += 1\nprint(k)\n", "n=int(input())\r\nk=0\r\ns=1\r\nfor i in range(n//2+1):\r\n if (n-s)% s == 0 and n-s != 0:\r\n k+=1\r\n s+=1\r\nprint(k)\r\n", "from collections import deque\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\n\ndef factors(n): \n return set(reduce(list.__add__, \n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\n\nprint(len(factors(int(input())))-1)\n", "n = int(input())\ni = 0\ncount = 0\nwhile n - 1 > i:\n i += 1\n if n % i == 0:\n count += 1\nprint(count)", "n = int(input()) - 1\r\nk = 1\r\nans = 0\r\nfor i in range(n):\r\n if (n-i) % (k+i) == 0:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nem=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n em=em+1\r\nprint(em) \r\n ", "x = int(input())\ncnt=0\nfor i in range(1,x):\n if x%i==0: cnt+=1\nprint(cnt)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef divisor(i):\r\n s = []\r\n for j in range(1, int(i ** (1 / 2)) + 1):\r\n if i % j == 0:\r\n s.append(i // j)\r\n s.append(j)\r\n return sorted(set(s))\r\n\r\nn = int(input())\r\ns = divisor(n)\r\nans = len(s) - 1\r\nprint(ans)", "n=int(input())\r\n\r\nlead=1\r\nc=0\r\nwhile(lead!=n):\r\n rem=n-lead\r\n if rem%lead==0:\r\n c+=1\r\n lead+=1\r\nprint(c)", "n = int(input())\r\n\r\nruks = []\r\nfor ruk in range(1, n // 2 + 1):\r\n if n % ruk == 0:\r\n ruks.append(ruk)\r\nprint(len(ruks))", "cnt=0\r\na=int(input())\r\nfor i in range(1,a):\r\n if a%i==0:\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\nk=1\r\ntm=0\r\ncalc =n/2 +1\r\nc=round(calc)\r\nfor tl in range(2,c):\r\n tm = n - tl\r\n if(tm%tl==0):\r\n k+=1\r\nprint(k)", "n=int(input())\r\nt=0\r\nfor i in range(1,(n//2 +1)):\r\n if (n-i)%i ==0:\r\n t+=1\r\nprint(t)", "a = int(input())\r\ns = 0\r\nfor i in range(1, a):\r\n if (a - i) % i == 0:\r\n s += 1\r\nprint(s)\r\n", "n = int(input(\"\"))\r\ncount = 0\r\nfor i in range(2 , (n//2)+1):\r\n if((n-i)%i== 0):\r\n count+=1\r\nprint(count+1)", "n = int(input())\r\nc=0 \r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n c+=1 \r\nprint(c)", "x = int(input())\r\nif 2 <= x <= (10**5):\r\n c = 0\r\n for i in range (1, x):\r\n if x % i == 0:\r\n c += 1\r\nprint (c)\r\n", "n = int(input())\r\ncount = 1\r\nfor i in range(2, n//2+1):\r\n if (n-i) % i == 0:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nl = 0\r\nfor i in range(1,n):\r\n s = n-i\r\n if s%i == 0:\r\n l += 1\r\n\r\nprint(l)", "n = int(input())\r\ncount = 0\r\n\r\nleaders_range = range(1, n//2 + 1)\r\n\r\nfor leaders in leaders_range:\r\n employees = n - leaders\r\n if employees % leaders == 0:\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\nc=0\nfor i in range(2,n):\n if (n-i) % i ==0:\n c+=1\nprint(c+1)", "n=int(input())\r\nct=0\r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n ct=ct+1\r\nprint(ct)", "import math\r\nn = int(input())\r\nfact = 0\r\nfor i in range(1,(n//2)+1):\r\n if n%i == 0:\r\n fact += 1\r\nprint(fact)\r\n", "n=int(input())\r\nco=0\r\nfor i in range(1,int(n//2)+1):\r\n if (n/i)%1==0:co+=1\r\nprint(co)\r\n", "a = int(input())\r\nans = 0\r\nfor i in range(1, a//2+1):\r\n if (a-i) % i == 0:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\no = 0\r\nfor g in range(1,n):\r\n m = n - g\r\n if m % g == 0:\r\n o = o + 1\r\nprint(o)", "t= int(input())\r\nc=0\r\nfor i in range(2, t+1):\r\n if t%i==0: c+=1\r\nprint(c)", "l = int(input())\r\nn=p=0\r\nfor num, i in enumerate(range(1,l)):\r\n if (l == 1):\r\n n=1\r\n break\r\n p=l-num\r\n if (num%p==0):\r\n n+=1\r\nprint(n)\r\n \r\n", "n=int(input())\r\n\r\nleaders=1\r\nc=0\r\nwhile(leaders!=n):\r\n a=n - leaders\r\n if a%leaders == 0:\r\n c+=1\r\n leaders+=1\r\nprint(c)", "n = int(input())\r\n\r\n\r\nans = 0 \r\nfor i in range(1,n//2+1):\r\n if (n - i)%i == 0 :\r\n ans += 1 \r\n \r\n\r\nprint(ans)", "n=int(input())\r\nlic=0\r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n lic+=1\r\nprint(lic)", "s = int(input())\r\na = 0\r\nfor i in range(1,s) :\r\n if s%i ==0 :\r\n a +=1\r\nprint(a)", "t=int(input())\r\nk=0\r\nfor i in range(1,t//2+1):\r\n if t%i==0:\r\n k+=1\r\nprint(k)", "c=0\r\na=int(input())\r\nfor i in range (1,a):\r\n if a%i==0:\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncount = 0\r\ntemp = 0\r\nx = 1\r\nwhile(1):\r\n if(x>n-x):\r\n break;\r\n m=n-x;\r\n if(m%x==0):\r\n count += 1;\r\n x+= 1;\r\n\r\nprint(count)", "n=int(input())\r\nt=0\r\nif n>=2:\r\n for i in range(1,int(n/2)+1):\r\n if(n%i)==0:\r\n t=t+1\r\nprint(t)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[95]:\n\n\nn=int(input())\ncounter=0\ni=1\nwhile i<n:\n if n%i==0:\n counter+=1\n i+=1\n \nprint(counter)\n\n\n# \n# \n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "x=int(input())\r\ni=1\r\ncount=0\r\nwhile i<x:\r\n i+=1\r\n if x%i == 0:\r\n count+=1\r\nprint(count)", "case=0\r\nn=int(input())\r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n case+=1\r\nprint(case)", "n = int(input())\nk = 0\nfor i in range(1,n//2+1):\n if n%i==0:\n k += 1\n else:\n continue\nprint(k)\n", "num = int(input())\r\nfactors = 1\r\nif num%2==0:\r\n for i in range(1,num//2):\r\n if num%i == 0:\r\n factors += 1\r\nelse:\r\n for j in range(2,num//2):\r\n if num%j == 0:\r\n factors += 1\r\n \r\nprint(factors)\r\n \r\n ", "k=int(input())\r\nfre=1\r\nfor i in range(2,k):\r\n if((k-i)%i==0):\r\n fre+=1\r\nprint(fre) ", "n = int(input())\r\nresult = 0\r\nfor i in range(1, n + 1):\r\n leader = i\r\n member = n - i\r\n if member < leader:\r\n print(result)\r\n break\r\n if member % leader == 0:\r\n result += 1\r\n", "def leads(a):\r\n b=0\r\n for i in range(1,a):\r\n l=a-i\r\n #print(l%i)\r\n if((l%i)==0):\r\n b=b+1\r\n return(b)\r\na=int(input())\r\nprint(leads(a))", "t = int(input())\r\n\r\ncount = 0\r\nr =0\r\nq=0\r\n\r\nfor i in range(1,t):\r\n r=t%i\r\n q =t//i\r\n if q<2:\r\n break\r\n if r==0:\r\n count +=1\r\nprint(count) ", "n = int(input())\r\ncount=0\r\nfor i in range(1,n):\r\n emp_left= n-i\r\n if emp_left%i==0:\r\n count=count+1\r\n else:\r\n continue\r\nprint(count)", "from functools import reduce\r\nfrom math import sqrt\r\ndef factors(n):\r\n step = 2 if n%2 else 1\r\n return set(reduce(list.__add__,\r\n ([i, n//i] for i in range(1, int(sqrt(n))+1, step) if n % i == 0)))\r\nprint(len(factors(int(input())))-1)\r\n ", "n = int(input())\r\nans = 1\r\nfor i in range(2, n // 2 + 1):\r\n if not (n - i) % i:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nc = 0\r\nif n== 0 or n == 1:\r\n print(0)\r\nelse:\r\n for i in range(1,n):\r\n if n%i == 0:\r\n c+=1\r\nprint(c)", "n=int(input())\r\ncount=0\r\nfor i in range (1,((n//2)+1)):\r\n if (((n-i)%i)==0):\r\n count=count+1\r\nprint(count)\r\n", "n=int(input())\r\nop=n//2 #y+x*y(n)\r\nans=0\r\nfor i in range(1,n//2+1):\r\n if (n-i)%i==0:\r\n ans+=1\r\nprint(ans)", "# https://codeforces.com/problemset/problem/935/A\n\ndef main():\n total_employees = input(\"\")\n if 2 <= int(total_employees) <= pow(10, 5):\n num_ways(total_employees)\n\ndef num_ways(employees):\n ways = 0\n employees = int(employees)\n for i in range(1, round(employees / 2) + 1):\n if employees % i == 0:\n ways += 1\n print(ways)\n\nmain()\n\n# tests\n\n# total # leader # employee per leader # ways\n# 2 1 1 1\n\n\n# 7 1 6 1\n\n\n# 8 1 7\n# 8 2 3\n# 8 4 1 3\n\n\n# 9 1 8\n# 9 3 2 2\n\n\n# 10 1 9\n# 10 2 2\n# 10 5 1 3\n\n\n# 13 1 12 1\n\n\n# 20 1 19\n# 20 2 9\n# 20 4 4\n# 20 5 3\n# 20 10 1 5\n", "n = int(input())\r\nf = 0\r\nfor i in range (1, int(n/2)+1):\r\n if n%i==0:\r\n f =f+1\r\nprint(f)", "n=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n p=n%i\r\n if(p==0):\r\n c=c+1\r\nprint(c-1)", "n=int(input())\r\ncount=0\r\nfor i in range (1,(n//2)+1):\r\n\temp = n-i\r\n\tif emp%i==0:\r\n\t\tcount+=1\r\nprint(count)\r\n", "import math\r\nn = int(input())\r\nnum = 0\r\nfor i in range(1, math.floor(math.sqrt(n))+1):\r\n if n % i == 0 and n/i != i:\r\n num += 2\r\n elif n % i == 0 and n/i == i: \r\n num += 1\r\nprint(num-1)\r\n \t\t\t\t\t\t \t \t \t \t\t\t \t\t \t\t\t", "# for _ in range(int(input())):\r\na = int(input())\r\ncount = 1\r\nfor i in range(2,a//2+1):\r\n if a%i ==0:\r\n count +=1\r\nprint(count)", "n = int(input())\r\nl = 0\r\nfor i in range(1, n + 1):\r\n if (n - i) % i == 0:\r\n l += 1\r\nprint(l - 1)\r\n", "def result(n: int):\r\n y=1\r\n if n<3:\r\n return y\r\n for i in range(2,n):\r\n if (n-i)%i == 0:\r\n y+= 1\r\n return y\r\n \r\n \r\nfor _ in range(1):\r\n n=int(input())\r\n res=result(n)\r\n print(res)", "n = int(input())\r\ncounter = 0\r\nfor x in range(1,n+1):\r\n if x == n:\r\n break\r\n elif n % x == 0:\r\n counter += 1\r\nprint(counter)", "x=int(input())\r\ncnt = 0\r\nfor i in range(1,x):\r\n if i != x:\r\n if x%i == 0:\r\n cnt +=1 \r\nprint(cnt)", "def main():\r\n n = int(input())\r\n ans = 0\r\n i = 1\r\n while (n - i) // i > 0:\r\n if (n - i) % i == 0:\r\n ans += 1\r\n i += 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\na = 0\r\nfor i in range(1, n):\r\n l = n - i \r\n if l % i == 0:\r\n a = a + 1\r\nprint(a)", "o=int(input())\r\nc=1\r\nfor k in range(2,o):\r\n if((o-k)%k==0):\r\n c+=1\r\nprint(c)", "n=int(input())\r\ni=2\r\nc=1\r\nwhile i<n:\r\n if n%i==0:\r\n c+=1\r\n i+=1\r\nprint(c)\r\n", "a = int(input())\r\ns = 0\r\n\r\nfor i in range(1, a + 1):\r\n if a % i == 0:\r\n s += 1\r\n\r\nprint(s - 1)\r\n", "def fafa(employees):\r\n ways=0\r\n for i in range(1,employees//2 + 1):\r\n if (employees-i)%i==0:\r\n ways+=1\r\n print(ways)\r\nemp=int(input())\r\nfafa(emp)\r\n", "n = int(input())\r\nk = 1\r\np = 1\r\nwhile n//2 > p:\r\n p = p + 1\r\n if n % p == 0:\r\n k = k + 1\r\nprint(k)\r\n", "def main():\r\n t = int(input())\r\n a = 0\r\n for i in range(2, t + 1):\r\n if t % i == 0:\r\n a += 1\r\n print(a)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "#Fafa & Company\r\nn = int(input())\r\ndef solve(n: int) -> int:\r\n count = 0\r\n for l in range(2, n + 1):\r\n if n<=100000:\r\n if n % l == 0:\r\n count += 1\r\n return count\r\n\r\nprint(solve(n))", "n=int(input())\r\ncount=0\r\n\r\nfor l in range(1,n):\r\n rem_emp = n-l\r\n if rem_emp % l == 0 and rem_emp>=l:\r\n count+=1\r\nprint(count) \r\n", "employees = int(input())\nprint(sum(employees % i == 0 for i in range(1, employees)))", "n = int(input())\r\nroot = int(n ** 0.5)\r\nans = 1\r\nfor i in range(2, root + 1):\r\n if i * i == n:\r\n ans += 1\r\n elif n % i == 0:\r\n ans += 2\r\nprint(ans)", "import math\r\n\r\nn = int(input())\r\n\r\ncnt = 0\r\nfor i in range(1, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n if n / i == i:\r\n cnt = cnt + 1\r\n else:\r\n cnt = cnt + 2\r\n\r\nprint(cnt - 1)", "t = int(input())\r\nresult = 0\r\nfor i in range(1, (t // 2) + 1):\r\n if (t - i) % i == 0:\r\n result += 1\r\nprint(result)", "t=int(input())\r\nx=1\r\nans=0\r\nwhile x<=t/2:\r\n if (t-x)%x==0:\r\n ans+=1\r\n x+=1\r\nprint(ans)", "n = int(input())\r\na = n - 1\r\nb = 1\r\nans = 0\r\nwhile a >= b:\r\n if not a % b:\r\n ans += 1\r\n a -= 1\r\n b += 1\r\nprint(ans)", "n=int(input())\r\nc=0\r\nfor i in range(2,n):\r\n x=n-i\r\n if x%i==0:\r\n c+=1\r\nprint(c+1)\r\n", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n#Due to the given constraints, a linear search should be sufficient\r\n#Learn how to prime factorize with code sometime in the future\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(2, n+1):\r\n\tif n%i == 0:\r\n\t\tans += 1\r\nprint(ans)\r\n", "i=1\r\nc=0\r\nn=int(input())\r\nnumber=n\r\nwhile(number>1):\r\n if n%i==0:\r\n c=c+1\r\n i=i+1\r\n number=number-1\r\nprint(c)\r\n", "lst=[]\r\nn=int(input())\r\nfor i in range(1,n):\r\n if n%i == 0:\r\n lst.append(i)\r\nprint(len(lst))", "n=int(input())\r\nprint(sum(n % i < 1 for i in range(1,n)))\r\n", "n = int(input())\r\ncnt = 0\r\nfor _ in range(1, int(n / 2) + 1):\r\n if (n - _) % _ == 0:\r\n cnt += 1\r\nprint(cnt)", "x = int(input())\r\ncount = 0\r\nfor i in range(1, x):\r\n if x <= 2:\r\n count += 0.5\r\n elif (x - int(i)) % int(i) == 0:\r\n count += 1\r\nif count == 0.5:\r\n print ('1')\r\nelse:\r\n print (int(count))", "n=int(input())\r\ns=1\r\nr=0\r\nwhile s<=n//2:\r\n if n%s==0:\r\n r+=1\r\n s+=1\r\nprint(r)\r\n", "n = int(input())\r\np = 0\r\n\r\nfor i in range(1, n):\r\n if n % i == 0:\r\n p += 1\r\n else:\r\n continue;\r\nprint(p)", "n = int(input())\r\nrslt =0\r\nfor x in range(1,int((n/2)+1)):\r\n if (n-x)%x == 0:\r\n rslt +=1\r\nprint(rslt)", "n=int(input())\r\ns=0\r\nfor i in range(1, n//2+1):\r\n if n%i==0:\r\n s+=1\r\nif s==0:\r\n print(1)\r\nelse:\r\n print(s)", "no_of_employees = int(input())\r\ncount = 0\r\n\r\nfor i in range(1,no_of_employees):\r\n if no_of_employees%i == 0:\r\n count+=1\r\n\r\n\r\nprint(count)", "n = int(input())\r\ncount =1\r\nfor i in range(2,(int(n/2))+1):\r\n if n% i ==0:\r\n count+=1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\nn = int(input())\r\nx = []\r\nfor i in range(1, n):\r\n if n%i == 0:\r\n x.append(i)\r\nprint(len(x))", "n=int(input())\r\nx = 0\r\nfor i in range(1,n):\r\n x+=(n%i<1)\r\n \r\nprint(x)", "x=int(input())\r\ny=x\r\ncounter = 0\r\nk=2\r\nwhile x >=2 :\r\n if (y-k)%k ==0 :\r\n counter +=1 \r\n else:\r\n counter = counter + 0\r\n x-=1\r\n k+=1\r\nprint(counter)", "a = int(input())\r\nif(a<4):\r\n print(1)\r\nelse:\r\n b = int(a/2)\r\n count = 0\r\n for i in range(1, b+1):\r\n if((a-i)%i==0):\r\n count+=1\r\n print(count)", "n = int(input())\r\ni = 1\r\nc = 0\r\nwhile i < n:\r\n if (n-i) % i == 0:\r\n c += 1\r\n i += 1\r\nprint(c)\r\n", "n = int(input())\r\nx=1\r\nfor i in range(2,(int(n/2)+1)):\r\n if n%i==0:\r\n x+=1\r\nprint(x)\r\n", "def fafa_and_his_company(num):\n count = 0\n for i in range(1, num):\n tl = num - i\n if tl % i == 0:\n count += 1\n\n print(count)\n\nnum = int(input())\nfafa_and_his_company(num)", "n = int(input())\r\nc=0\r\nfor i in range (1,n+1) :\r\n p = n%i\r\n if(p==0) :\r\n c = c+1\r\nprint(c-1)", "n = int(input())\r\ncnt = 0\r\ni = 1\r\nj = n-1\r\nwhile i<=j:\r\n if(j%i==0):\r\n cnt+=1\r\n j-=1\r\n i+=1\r\nprint(cnt)", "n = int(input())\r\np = 0\r\nfor l in range(1, n//2+1):\r\n if (n-l)%l == 0 : p += 1\r\nprint(p)", "n = int(input())\r\nk = 1\r\nfor r in range(2, n // 2 + 1):\r\n if (n - r) % r == 0:\r\n k += 1\r\nprint(k)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef input_list_numbers():\r\n return(list(map(int, input().split())))\r\n\r\nn = int(input())\r\n\r\nways = 0\r\n\r\nfor l in range(1, round(n/2) + 1):\r\n if ( n - l ) % l == 0:\r\n ways += 1\r\n\r\nprint(ways)", "# Fafa and his company 935A\r\n\r\nMAX_EMPLOYEES = 100000\r\nMIN_EMPLOYEES = 2\r\n\r\ndef get_leaders(employees):\r\n leaders = 0\r\n half_employess = (employees // 2) + 1\r\n\r\n for i in range(1, half_employess):\r\n if ((employees - i) % i == 0):\r\n leaders += 1\r\n return leaders\r\n\r\nemployees = int(input())\r\n\r\nif(employees >= MIN_EMPLOYEES and employees <= MAX_EMPLOYEES):\r\n print(get_leaders(employees))", "a=int(input())\r\nz=0\r\nfor i in range(1,(a//2)+1):\r\n if (a-i)%i==0:\r\n z+=1\r\nprint(z)", "def count_integers(n):\r\n count = 0\r\n for l in range(1, n//2+1):\r\n if (n - l) % l == 0:\r\n count += 1\r\n return count\r\nn = int(input())\r\nprint(count_integers(n))\r\n", "n=int(input())\r\ni=1\r\nres=0\r\nwhile(i<n//2+1):\r\n if(n%i==0):\r\n res+=1\r\n i+=1\r\nprint(res) ", "S=int(input())\r\nN=S//2\r\ncount=0\r\n\r\nfor i in range(1,N+1):\r\n if (S%i==0):\r\n count+=1\r\nprint(count)", "n=int(input())\r\np=0\r\nfor i in range (1,n):\r\n if n%i==0:\r\n p=p+1\r\nprint(p)", "n = int(input())\r\nif 2<=n<=10**5:\r\n a=0\r\n b=0\r\n while n-1>a:\r\n a+=1\r\n while n%a==0:\r\n b+=1\r\n break\r\nprint(b) ", "n = int(input())\r\nteam = 0\r\nfor i in range(1,n):\r\n if n % i == 0 and (n-i) % i == 0:\r\n team += 1\r\nprint(team)\r\n", "x=int(input())\r\nsum=0\r\nfor i in range(1,x):\r\n if x%i==0:\r\n sum+=1\r\nprint(sum)", "n = int(input())\r\ncount = 0\r\nfor i in range(1, (n //2)+1):\r\n a = i\r\n b = n - i\r\n if (b % a == 0):\r\n count += 1\r\nprint(count)\r\n \r\n ", "n=int(input())\r\nl=[i for i in range(1,n) if n%i==0]\r\nprint(len(l))", "number=int(input())\r\ncount=0\r\nfor i in range (1,number):\r\n tl=(number-i)\r\n if tl%i == 0:\r\n count+=1\r\nprint(count)", "def solve():\n n = int(input())\n count = 0\n for i in range(1, int(n/2)+1):\n t = n-i\n if t%i==0:\n count+=1\n print(count)\n\n\nif __name__ == '__main__':\n solve()", "n1 = int(input())\r\n\r\n\r\nk = 2\r\nb=False\r\ncount = 0\r\nwhile b==False:\r\n if (n1-k) % k == 0 and n1 != 2:\r\n count +=1\r\n elif (n1-k) % k == 0 and n1 == 2:\r\n count = 1\r\n print(count)\r\n break\r\n k+=1\r\n if k == n1:\r\n print(count +1)\r\n break", "# https://codeforces.com/problemset/problem/935/A\r\n\r\nn = int(input())\r\n\r\ncounter = 0\r\n\r\nfor i in range(1, n):\r\n remainder = n - i\r\n if remainder % i == 0:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "x=int(input())\r\nc=0\r\nfor i in range(1,x):\r\n if (x-i)%i==0:\r\n c=c+1\r\nif x==2:\r\n print(1)\r\nelse:\r\n print(c)\r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\nresult = 1\r\nfor i in range(2, int(n ** 0.5) + 1):\r\n q, r = divmod(n, i)\r\n if not r:\r\n if q == i:\r\n result += 1\r\n else:\r\n result += 2\r\nprint(result)", "numberOfEmployee = int(input())\r\nif numberOfEmployee == 2:\r\n print(\"1\")\r\nelse:\r\n count = 1\r\n for i in range(2,numberOfEmployee):\r\n if numberOfEmployee % i == 0:\r\n count += 1\r\n print(count)\r\n", "n = int(input())\r\n\r\nl = 0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n l += 1\r\n\r\nprint(l)", "n = int(input())\r\nans=0\r\nfor i in range(1,n):\r\n if (n - i) % i == 0:\r\n ans+=1\r\nprint(ans)", "t=int(input())\r\nSol=0\r\nfor i in range(1,(t//2)+1):\r\n if (t-i)%i==0:\r\n Sol+=1\r\nprint(Sol)", "n: int = int(input())\r\nways: int = 0\r\n\r\nfor i in range(1, n):\r\n if (n - i) % i == 0:\r\n ways = ways + 1\r\nprint(ways)", "num=int(input())\r\nc=0\r\nfor i in range(2,num+1):\r\n if (num-i)%i==0:\r\n c+=1\r\nprint(c)", "'''def _not(a):\r\n if a == 0:\r\n return 1\r\n else:\r\n return 0\r\ndef _and(a,b):\r\n if a == 1 and b == 1:\r\n return 1\r\n else:\r\n return 0\r\ndef _or(a,b):\r\n if a == 1 or b == 1:\r\n return 1\r\n else:\r\n return 0\r\ndef question1():\r\n for i in range(8):\r\n e = input().split()\r\n r = int(e[0])\r\n c = int(e[1])\r\n t = int(e[2])\r\n g = _and(c,(_not(t)))\r\n s = _or(g,(_not(r)))\r\n v = _and(r,(_not(t)))\r\n x = _or(s,v)\r\n print(x)\r\ndef question2():\r\n for i in range(8):\r\n e = input().split()\r\n g = int(e[0])\r\n w = int(e[1])\r\n r = int(e[2])\r\n t = _and(g,(_not(w)))\r\n y = _and((_not(g)),r)\r\n u = _and(w,r)\r\n o = _or(t,y)\r\n x = _or(u,o)\r\n print(x)\r\nquestion2()\r\n''\r\ndef power(a):\r\n while True:\r\n if a == 2:\r\n return True\r\n break\r\n elif a % 2 == 1:\r\n return False\r\n break\r\n else:\r\n a //= 2\r\nx = input().split()\r\nfor i in range(int(x[1]) , int(x[0])-1,-1):\r\n b = power(i)\r\n if b == True:\r\n print(i)\r\n break\r\n elif i == int(x[0]):\r\n if power(i nt(x[0])) == True:\r\n print(int(x[0]))\r\n else:\r\n print(-1)\r\n\r\n''\r\na = list(map(int,input()))\r\nb = sum(a)\r\nc = ''\r\nfor i in range(len(a)):\r\n c += str(a[i])\r\nc = int(c)\r\nif c % b == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n \r\n''\r\n# BINARY SEARCH\r\n\r\na = [1,2,3,4,5,6,8,9,10]\r\nleft = 0\r\nright = len(a) -1\r\nb = 1\r\ndef binb(a,left,right,b):\r\n mid = (left + right) // 2\r\n if a[mid] == b:\r\n print(mid)\r\n elif left > right:\r\n print(-1)\r\n elif a[mid] < b:\r\n left = mid + 1\r\n binb(a,left,right,b)\r\n elif a[mid] > b:\r\n right = mid - 1\r\n binb(a,left,right,b)\r\n \r\nbinb(a,left,right,b)\r\n\r\n''\r\n\r\n\r\nred , blue = input().split()\r\ncount = 0\r\ncount1 = 0\r\nred = int(red)\r\nblue = int(blue)\r\nif red == blue:\r\n print(red , 0)\r\nelif red > blue:\r\n count += int(blue)\r\n red -= blue\r\n if red >= 2:\r\n while True:\r\n if red <= 1:\r\n break\r\n else:\r\n count1 += 1\r\n red -= 2\r\n print(count , count1)\r\n\r\nelif blue > red:\r\n count += int(red)\r\n blue -= red\r\n if blue >= 2:\r\n while True:\r\n if blue <= 1:\r\n break\r\n else:\r\n count1 += 1\r\n blue -= 2\r\n print(count , count1)\r\n\r\n\r\n\r\na = int(input())\r\nb = input().split()\r\npolice = 0\r\ncount = 0\r\nc = ['1','2','3','4','5','6','7','8','9','10']\r\nfor i in range(a):\r\n if b[i] in c:\r\n police += int(b[i])\r\n elif b[i] == '-1':\r\n if police > 0:\r\n police -= 1\r\n else:\r\n count += 1\r\nprint(count)\r\n\r\n\r\n''\r\n#https://codeforces.com/problemset/problem/1409/A\r\n\r\n\r\n\r\n''\r\n#\r\n\r\n\r\n''\r\n#https://codeforces.com/problemset/problem/732/A\r\nprice , last = input().split()\r\nfor i in range(1,11):\r\n if str(int(price) * i)[-1] == str(last) or str(int(price) * i)[-1] == '0':\r\n print(i)\r\n break\r\n\r\n\r\n\r\n''\r\n #https://codeforces.com/problemset/problem/1352/A\r\n\r\na = int(input())\r\nfor i in range(a):\r\n b = input()\r\n c = ''\r\n count = 0\r\n for j in range(len(b)):\r\n if b[j] != '0':\r\n c += str((b[j]).zfill(len(b[j:])))[::-1] + ' '\r\n count += 1\r\n print(count)\r\n print(c)\r\n\r\n\r\n\r\nf = int(input())\r\nfor j in range(f):\r\n x = int(input())\r\n a = list(map(int,input().split()))\r\n a1 = a.count(1)\r\n a2 = a.count(2)*2\r\n print(a1 , a2)\r\n if (a1 + a2) % 2 == 0:\r\n print(\"YES\")\r\n else:\r\n list(mao print(\"NO\")\r\n\r\n\r\n''\r\nx = int(input())\r\nfor i in range(x):\r\n \r\n a = int(input())\r\n b = input()\r\n if b.count('1') > 1:\r\n print(\"NO\")\r\n elif b.count('0') > 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n\r\n''\r\na , b = list(map(int,input().split()))\r\ncount1 = 0\r\nfor i in range(a,b+1):\r\n if len(set(str(i))) == len(str(i)):\r\n x = i\r\n count1 += 1\r\n break\r\nif count1 == 1:\r\n print(x)\r\nelse:\r\n print(-1)\r\n\r\n\r\n''\r\nx = input()\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(len(a)):\r\n b.append((a[i] , i +1))\r\nb.sort()\r\nprint(set(b))\r\n\r\na = int(input())\r\nb = {'green' : 1 , 'yellow' : 2 , 'orange' : 3 , 'red' : 4 ,\r\n 'purple' : 5 , 'voilet' : 6 , 'blue' : 7 , 'blue-green' : 8}\r\nfor i in range(a):\r\n c,d = input().split()\r\n if b[c] - b[d] > b[d] - b[c]:\r\n print(b[c] - b[d])\r\n else:\r\n print(b[d] - b[c])\r\n\r\n\r\n'''\r\n\"\"\"\r\n\r\n\r\nIIIIIIIIIIII??IIII??????????????????????????????????????7$$$$$$$$$$$$$$$$ZZZZZZZZZZZZZZZZZ$$$$$$$$$$$7$???????????????????????????????????????????????????????????????????????????????????????????IIIIII\r\nIIIIIIIIIIIIIIIIII??????I?????????????????????????????7$$Z$$$$$$$$Z$$$ZZZZZZZZZZZZZZZZZZZZ$$$$$$$$$$$$$$$7+???????????????????????????????????????????????????????????????????????????????????IIIIIIIIII\r\nIIIIIIIIIIIIIIIIIIII?????????????????????????????????$$ZZ$$$$$$$ZZ$$$ZZZZZZZZZZZZZZZZZZ$$$$$$$$$ZZ$$$$$$$$$I??????????????????????????????????????????????????????????????????????????????IIIIIIIIIIIIII\r\nIIIIIIIIIIIIIIIIIIII??????????????????????????????I7$ZZZ$$$$$ZZZZZ$ZZ$ZZZ$$ZZZZZZZZZZZ$$$$$$ZZZZZZ$$$Z$$$$$$$I????????????????????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIII\r\n????IIIIIIIIIIIIIIII??????????????????????????????ZZZOZZZZZZZZZ$ZZZ$$ZZ$$ZZZZZZZZZZZ$$$$$$ZZZZZZZ$$Z$ZZ$$$$$$$$???????????????????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIII\r\n=~=?IIIIIIIIIIIIII?????????III??????????????I???7ZZOOZZZZZZZZZZZZZ$ZZZ$$ZZZZZZZZZZ$77$$77$$$$Z$$77$77$ZZ$Z$$$$$$I???????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIII\r\n+??I?IIIIIIIIIII??+===~=????II????????????????I$ZZOOOZZZZZZOZZZZZZZZ$$$$$$$$$$$Z$$$$$$$$$$$$Z$$$77$$77777ZZ$ZZZ$$I??????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIII\r\nIIIIIIIIIIIIIIII???+=~~~~+???????????????????I$ZOOOOZZZZZOOZZZZZ$$$$$$$$$$$$$$Z$$$$$$$$$$$7ZZ$$$$7$$$77$$Z$$$ZZZ$ZI???????????????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\r\nIIIIIIIIIIIIIIIIIIII?????+????????II????????IZZOOOOOZZZOOO$Z$$$$$$$$$$$$$$$$Z$$$$$$$$$$$$$$Z$$$$$~$$?I7$$$$$Z$ZZZZ$$I?????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\r\nIIIIIIIIIIIIIIIIIII?II??????I???IIII????II??7ZOOOOOOZZZ$$$$$$$$$$$$$$$$$$$$Z$$$$$$$$$$$$ZZZZZZZZ=~Z$~~ZZZ$Z$$Z$$$ZZ$$I????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII????IIIIZOOOOOZ$$$$$$$$$$$$$$$$$$$$$$$ZZZ$$$ZZOZOOZZZZZZ$ZZ:~~Z$~=ZZZZOZ$O$$$$ZZ$I??????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZOOOZ$Z$$$$$Z$$$$$$$$$$$$$$$$$ZZOZZZZOOOOOOOOOZ?7ZZ::=~Z+:~+ZZZ7OOOZ$$$O$ZZ??????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??I\r\nI?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII$OO$$$Z$$$$$Z$$$$$$$$$$$$ZZOOOOOOZZZOOOOOOOOOO$=?Z$::~~=Z,::~OZZ=OOOOO$$$Z$$Z?===++?????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??????\r\n??????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII$$$$$$Z$$$$$$$$$$$$$ZZOOOOOOOOOOZZOOOOOOOOOOZ~~=Z7:::~~77:::~$ZZ+OOOOOOO$O$$$I??+???I?????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??+:\r\n~::=?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII$$$$$ZZ$$ZZ$ZZZ$$$ZZZZOOOOOOOOOOOZOOOOOOOOOO7===Z=::::=:$::::~=ZZ=?OOOOOOOO$$$$II???I????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??=:\r\n::::=?I?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?$Z$ZZZZZ$$$ZZ$ZZZOOOZOOOOOOOOOOOZOOOOO+OOZZ~=~=Z::::::~:I:::::=OZ==OO$OOOOOZ$$$II??IIII??IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??~:\r\n::::~+IIII?IIIIIIIIIIIIIIIIIIIIIIIIIIIII$ZZZZZZZZZZZZZOOOOOOOOOOOOOOOOOOOOOOO~IOOZ~=::=:::::::::?::::::=$Z:=ZO=OOOOOOZ$$$IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???=~::\r\n::::~=???????IIIIIIIIIIIIIIIIIIIIIIIIIII$ZZZZZ$ZZZZZZZOOOOO8OOOO88OOOOOOOO8+=7ZZ==~::::::::::::::::::::~?Z:=IO=OOOOOOOZ$$?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??=~~::,::\r\n~~~~~=+?+++++???IIIIIIIIIIIIIIIIIIIIIIII$ZZZZZZOO88OOOOOOO8OO888888OOOOOO?==8O+~=:::::::::::::::::::::::~$:=+Z=$OOOOOOZZ$7IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?IIIIIII??+~::::,:::\r\n~~~:~~=???+++??IIIIIIIIIIIIIIIIIIIIIIII$ZZZO8888888OOOOOO888O888888888OI===O=~=O+::::::::::::::::::::::::::~=O==OOOOOOZZZZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???IIIIIII?=:,::,,::::\r\n~~~~~~~=+?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIZZO88888888OOOOOOO888888888888OZZZOZZ7=:=~ZZ:::::::::::::::::::::::::~O==OOOOOOOOOZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???I?IIII?+~:,,::::~~\r\n~~~~~~~~=+++??IIIIIIIIIIIIIIIIIIIIIIIIIZ8888888888OOOOOO88888888888OZ+?7OOOO8OZZZZ7OZ,:~:::::::::::::::::::::7==OOOOOOOOOZIIIIIIIIIIIIIIIIIIIIIIIIIIII????IIIIIIIIIIIIIIIIIIIIIIIII?==+++????=:,::::::~~\r\n~~~~~~~~~~~==??IIIIIIIIIIIIIIIIIIIIIIIIO8888888888OOOOOO8888888888OZ+=ZOOO+=8OO8OOOZ$$$:::::::::::::::::::::::~=$8OOOOOOOO7IIIIIIIIIIIIIIIIIIIIII?????=~:~=+?IIIIIIIIIIIIIIIIIII??=~:::::~~~~:,,::::::::\r\n~~~~~~~~==+?IIII??IIIIIIIIIIIIIIIIIIII78888888888OOOOOOO888888888OZZO88+===OZ$ZZZO8O$OZ$+:::::::::::::::::::::~=IOO888OOOO$IIIIIIIIIIIIIIIIIIIII?+~~::,,,::~+IIII???IIIIIIIIIIIII+:,,:::::::::::::::::~~\r\n+===+???????IIIIII??????IIIIIIIIIIIIII$8888888888OO8OOO8888888888OZZ:8+=~,,O77$O7$O=$O+7ZZ$::::::::::::::::::::++O8888OOOOZIIIIIIIIIIIIIIIIIII??+~,,::::::~~+??+=====+IIIIIIII?+=:,:::::::::::::::::~~~~\r\nIII?IIIIIIIIIIIIIIII????IIIIIIIIIIIIIIO8888888888OOOOOO8888888887+OO=:Z~,,,Z,$Z8I7O~~~I==ZZOOOZ$:~::::=?$OO?~::=+O8888OOOOZIIIIIIIIIIIIIIIIII?=~::::::::~~~~~~~~=====?IIII?+++=~::::::::::::~~::::~~::::\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OOOOOO8888888888==OZ$::::,::,,7I~:7,:::::OOOOOZZZZ7OZZZZZOZZZZ$Z+O8888OOOOZIIIIIIIIIIIIIIIIII?=~:::::::~~~~~~~~=+???IIIIII?~::::::::::~~~~~~~~~:~~~:::~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OOOOOO888888888O=:~OZ::::,:,O?=++O,:::::=ZZOOOZZZZIZ?8888O87:IOZ$88888O8OOOIIIIIIIIIIIIIIIIII??+===~~=++++??++??IIIIIIIIII?+~~~==~~~:~~~~~~~~~~~~~~:::~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OO8OOO888888888I=::OZ7:~:~~,,,??,,::::::OZ+::::~=O$ZI=O$ZZOIOO:~Z88888O8OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??????+==~~~~=======~~::::~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OO8OO8888888O88~::::OZ+::::::~~~~~:::::OZZ:::::::~O=::7OO7O~O~:~88O88888OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII????I???III??====+??+==~~::::::~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII78888888888OO8OO8888888788=:::::OZZ+::~::::::::~?OOZ::::::::IZ~,?:$7+?,~::888O88888OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?=::~~=~==++==~~==+++==~~:::::::~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZO888888888O88OO8888888?8O~:::::::ZOOZZZ7~:::::~8O$?::::::::=Z+,?+?:+::~:Z88O888888OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?=,:,::::,:::::::~::~~:::::::::::~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIO8888888888888OO888888I+8O::::::::::~::IOOOOZOOOOO::~::::::~=OZ=:I$:,:::=8888888888OOZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII+~:,:::,:::,,::::::::::::::::::::::~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII7O8888888888888OO888888+=8Z::::::::::::::::::::::::::::::::::=IZ7:,~+::::88O8888888OOO$IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???????+~:,,,,,,,,,,,,::,,::,,,,::::::::::::\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIOO88888888D8888OO888888==OZ::::::::::::::::::::::::::::::::::II~OOZ+:~:::OO88888888OOO7IIIIIIIIIIIIIIIIIIIIIIII?+?IIII?=~~::::~~::::,,::,,,,,,,,::::,,:,::::::::::::\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIOOO88888888888888O888888==OZ:::::::::::::::::::::::::::::::::+7::::=8OOOOO8888888888OOOIIIIIIIIIIIIIIIIIIIII??+=::~+?++~::::::::,::::,,,,::::::,::,,:::::::::::~~~~~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?++7OO88D888888D88D88O888888==~8::::::::::::::::::::::::::::::::~~::~::::::+O88888888888OOOIIIIIIIIIIIIIIIIII??+=~::,:::::::,,:,,::,,:,,,:::::::::,,,::::::~~~~~~~~~~~~~~\r\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??I8O88888888888888888888887==~Z::::::::::::::::::::::::::::::::::::::::::O$O8888888888OOO7IIIIIIIIIIIIIIIII?+:::::::::::::::::::::::::::~~~::::::::::::~~~~~~~~~~~~~~~~=\r\n??IIIIIIIIIIIIIIIIIIIIIIIIIIIIII?8OO888888888888DD88888888?==~~:::::::::::::::::::::::::::::::::::::::::~IO88888888888O8OIIIIIIIIIIIIIIII???~::,:::::::::::::,:::::::~~~~~~~~~::::::::~~~~~~~~~~~~~~~::~\r\n????IIIIIIIIIIIIIIIIIIIIIIIIII?IZ8O8888888888888DDD8888888=7==::::::::::::::::::::::::::::::::::::::::::OO88888888888O8OOIIIIIIIIIIIII???+++~::,,,,,:::::::::,,,,,:::~~~~~~~~~:::::~~~~~~~~~~~~~~~~~~:::\r\n???I?????????IIIII????IIIIII??I7OO888888DDDDDDDDDDD8888888I?==:~:::::::::::::::::::::::::::::::::::::~7OO8D888888888888OIIIIIIIIII????+=~::::,,,,,:,,,,,:::::::::::::~~~~~~~~~:::~~~~~~~~~~~~~~~~~~~~:::\r\n~+????????????????????????II???OOO$88D88DDDDDDDDDDD8888888==I=~:::::::::::::::::::::::::::::::::::::=ZO8$=O888888888OOO$III???????+=~~~:::::::::::::::,,::::~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~=~~==~\r\n:~=+??????????????????????????8OOO$88DDDDDDDDDDDDDDD888888===I=~:::::::::::::::::::::~:::::::::::::~~:::=+8D88888888OOOI?I$7????+==~~:::::::::::::::::::::::~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~=++??????+\r\n::::=?++?????????????????????$OO8$888DDDDDDDDDDDDDDD888888======:::::::::::::::::=??II?I$?,~~::::::::::~+8888888888OIO7I~::::~7?++=~~~~:::::~~::::::::~~~~~~~~~~~~~~~~~~~~~~===~~~~~~~~~~~==+???IIIIIIII\r\n:::::~:~~:::=+??????????????IOO8OI888DDDDDDDDDDDDDDD888888?======:::::::::::::::::~++++??IIZ::::::::::~=88888888D8OIOO:::::::::::::$?+======++++==~~~~~~~~~~~~~~~~~~~~~:~~~=+??++=======~=+??IIIIIIIIIII\r\n~~~::::::::~+++?+???????????8OO8Z?O88DDDDDDDDDDDDDDD888888I=======:::::::::::::::::~::::,~=:::::::::::?8888888888OI$:~::::~::::::::::7+???++???????++++===~~~~~~~~=+++==++????I???????+++=+????IIIIIIIII\r\n~~~~~~~~~~=+++++++??++?+????OOOO?7OODDDDDDDDDDDDDDDD888888Z=======?~:::::::::::::::::::::::::::::::::88888888888O?~:::::::I~:::::::::::::$??????????????++===+==++????????????????II?????????????I??II??\r\n++++++++++++++++++++???++++78888?O88DDDDDDDDDDDDDDDDDD8888O=========I::~::::::::::::::::~I~~?=:~::~IO8888888888O$::::::::+::::::?::::::::::$?????????????????????I???????I???????IIIIIIIIIIII???????????\r\n??????????+++++++++++++++++ZO88$+O88DDDDDDDDDDDDDDDDDD88888===========~?:~:::::::::~:7IO~~::::::,::::::~~+IZO8$:~~::::::~::::::=+:::::::::::::ZI????????????????????????????????????????????????????????\r\n+++++++++++++?+++++++++++++OO88I+O88DDDDDDDDDDDDDDDDDDDD8D8+=============?:::~::::II~::~:::$~~::::~~:::::::::::~:::::::==::::::=,:::::::::::::~~????????????????????????????????????????????????????????\r\n++++++++++++++++++++++++?+?$8O87+O88DDDDDDDDDDDDDDDDDDDD8D8=================?::~~:::::::::::I:::::=::::::::::7:=+~:::~=7:::::::I:::::=+::::::::::???????????????????????????????????????????????????????\r\n+++++++++++++++++++++++++++I888$?O88DDDDDDDDDDDDDDDDDDDD88D$================+$:~:::::7::::~:~7::~::I~~::::::~7=====7==?::::::::::::::=~::::::::::~?????????????????????????????????????????????+++++?+++\r\n++++++++++++++++++++++++++++OO8O+ZO88DDDDDDDDDDDDDDDDD88DD8===============7::7~~::::::?:::::::::::~~=888888O??I======+::::::::I::::::=:::::::::::::???????????????????????????????????????++++++++++++++\r\n++++++++++++++++++++++++++++78O8++888DDDDDDDDDDDDDDDDD88D88?===========+$:::::::::::~::I~:::::::?::~==88888O+++7=====7==+7?::~:::::::7::::::::=::::~????????????????++???????????????????+++++++++++++++\r\n+++++++++++++++++++++++++++++OO8O+888DDDDDDDDDDDDDDDDD8DD8OZOZOO?+====7:::::::::::::::~:$::::::::7::==~8888O++?+7====+=======7:::::::+:~:::::I=::::::++?++????+???+++++?????????+++??????+++++++++======\r\n++++++++++++++++++++=====+++++8O8II888DDDDDDDDDDDDDD8888+++7OZZZOZZOO::~:::::::~=~:::::::+::::::::$~==+888OO++++++7===+======~::::::~:::::::~===~:::,:I++++++++++++++++++++++++++++++++++++=============\r\n++==========++================+OO8?8ODDDDDDDDDDDDD8888O++++++++=IOO:~~::::::~======::::::::+::::======OOOOOO=++++=====I=====+?+==+==7::::::~+=~::::::::$+++++++======+++++++++++++==================+++=\r\n================================OOD=O8DDDDDDDDDDDD88DD+++++++++++?:~:::::::~======?==:::::::~~====I=+I====++~7+==?====7======?======$=~::~I?+=::::::::::=====~~::::~~===++++++++============++++++++++++\r\n==========================~~~~~~~O88+8DDDDDDDDDDD888D88=+++++++7::::::::::::~~=?+==II===~===7====++++====++==++++=+==+===??$$$I=====+======7$=::::::::::::=~::::::::~~~~==============++====+++++++++++=\r\n=====================~=~~~~~~~~~~~O88O88DDDD888O,:O88888I++++?~:~:::::::::::~====I?=I~===++?===?~=+~==+++++==I+===+7=+==I=====+?======+=====+=:::::::::::::+,::::::~~~~~================================\r\n=================~~~~~~~~~~~~~~~~~=?8D888ZI??+78+:8888888$++7~::::::::::::::~==+=$==+=====?===?=~7+=+++++?I~==========+I+=======+II?$~=I$$??~=::::::::::::::$+~~~~~=====================================\r\n==============~=~+7$7I?+???????????????????????8O,O8888888Z::::::::::::::::~====I========+==7++===+++?IO+================I==================I+=:::::::::::::7$I===========~~============================\r\n==========~~~=I++?????????????????????????????I8O,I88888O$:~::::::::::::::~=====?=======I?+====+++++$OO====================I=================+=~::::::::::~:=::?==============~======~~~~~~=~~~~=======~\r\n====~~~~~~~~I++?I+?????????????????????????????OO::8OOOO=::~::::::::::::::~===+$=+=+==========+++$??$$======~~~~========~~~~=~================+7+~:::::::~:+I::Z7=~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\r\n~~~~~~~~~~?+???????????????????????????????????7OI:OO::~:::::::::::::::::~====?=============++?8+8????I+?++II$$7?~~~~~~~~~~~~~~=I+=========+IZ===++7~:~7~$7$:,,+?7~~~~~~~~~~~~~~~~~~~::::~~~~~~~~~~~~~~~\r\n~~~~~~~~~+????????+7????????????????????????????8II,::,~::~==~::::::::~=====I===============?OOOO=O??????????????+???7~=~~~~~~~~~~=~?I77?=?===~+======+$I7?,,,:I??+~~~~~~:::~~~~~~~::::::~~~~~~~~~~~~~~~\r\n~~~~~~~~++??????????$+????????????????????????I???+,::,:~==+==?~:~~=====++I+===============+:88OOO:8???????????????????7~~~~~~~~~~~~~~~~~=$I7I=====~7777I,,,::?+??+~~::::::::::::::::::::~~~~~~::::~~~~~\r\n~~~~~~==+????????????Z???????????????????????Z????++,,::,+=+====7=====$?===============+I:~::+88OOO~OI????????????????7??$~~~~~~~~~~~~~~~~$$7777==II7777,:,,~=?????$~:::::::::::::,:::::::~~::::::::~~~~\r\n~~~~~~~++?????????????$????????????????????I???????+?,,:::?============+===========+ZZ$$$:,?:I+OOO8O?8O???????????????+$??I~~~~~~~~:::::::++++======+I~:,,,,=7?+???+7:::,,,:::::,::::::::::::::::::~~~~~\r\n~~~~~~I????????????????$??????????????????$?????????+?,::::=+7=======?I+=+7?7I?:$Z$$OZOOZ$:$:~,7OO888=8O????????????????$+++~~~::::::::::~++++====$==::::::=$????????+::,,::::,,,:::::::::::::::::~~~~~~\r\n~~~~~?+?????????????????7????????????????I???????????++,,::::++$=+======$:$::,:::7Z$$$OOO$$,:,,,8888OO:88???????????????????++::::::::::::=+++OI=+++::::::+7$????????+::::,,,,::::::::::::::::~~~~~~~~~~\r\n~~~~~??????????????????????????????????$??????????????+7:,::=++++$====$7::,=:,,:,:$$$$ZOOZ$$~:,:~8888O8:O8???????????????7????+,::::::::::I+++++++++,::::+I$$I???????+?:,:,,:::::::::::::::~~~~~~~~~~~~~\r\n\"\"\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\na = int(input())\r\nb = []\r\nc = 0\r\ncount = 0\r\nfor i in range(1 , a + 1):\r\n \r\n if c > a:\r\n print(count-1)\r\n break\r\n elif a < 4:\r\n print(1)\r\n break\r\n else:\r\n b.append(i)\r\n c += sum(b)\r\n count += 1\r\n \r\n\"\"\"\r\na = int(input())\r\ncount = 0\r\nfor i in range(1 , a):\r\n if a % i == 0:\r\n count += 1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,ans = int(input()),0\r\nfor i in range(1, n//2+1):\r\n ans += not (n - i) % i\r\nprint(ans)", "n = int(input ())\r\nt=1\r\nfor i in range (2,n):\r\n r = n%i\r\n if r == 0:\r\n t=t+1\r\nprint (t)", "n = int(input())\r\nresult = 0\r\nfor i in range(1, n):\r\n result += 1 if (n - i) % i == 0 else 0\r\nprint(result)", "N = int(input())\r\nres=0\r\nfor i in range(1,N):\r\n if (N-i)%i==0:\r\n res+=1\r\nprint(res)", "n=int(input())\r\ncount = sum(n%i==0 for i in range(2,n+1))\r\nprint(count)", "n = int(input())\r\ns = 0\r\nfor i in range(2,n):\r\n if (((n - i) % i)==0):\r\n s+=1;\r\n \r\nprint(s+1)", "n = int(input())\nans = 1\nfor i in range(2, n):\n if (n - i) % i == 0:\n ans += 1\nprint(ans)\n", "n = int(input())\r\na = 0\r\n\r\nfor i in range(1, (n // 2) + 1):\r\n if (n - i) % i == 0:\r\n a = a + 1\r\n\r\nprint(a)", "num = int(input())\r\nways = 1\r\nfor i in range(2, num // 2 + 1):\r\n if num % i == 0:\r\n ways += 1\r\nprint(ways)\r\n", "t=int(input())\r\nans=1\r\nfor x in range(2,t//2+1):\r\n if (t-x)%x==0:\r\n ans+=1\r\nprint(ans)\r\n ", "n=int(input())\r\nways=1\r\nfor i in range(2,n):\r\n if(n%i==0 and n>2):\r\n ways+=1\r\nprint(ways)", "from math import isqrt\r\nn, cnt = int(input()), 0\r\nfor i in range(1, isqrt(n) + 1):\r\n if (not n%i):\r\n cnt += 2\r\n if (n / i == i): cnt -= 1\r\nprint(cnt - 1)", "n= int(input())\r\nc=0\r\nfor i in range(1,int(n/2)+1):\r\n if n%i==0:\r\n c+=1\r\nprint(c)", "n = int(input())\nans = 0\nfor i in range(1, n//2+1):\n if (n-i) % i == 0:\n ans += 1\nprint(ans)\n", "t=int(input())\r\nk=0\r\nfor i in range(1 , (t//2)+1):\r\n if (t-i) % i ==0:\r\n k+=1\r\nprint(k)\r\n", "x=int(input())\r\ncount=0\r\nfor i in range(1,x):\r\n if x%i==0:\r\n count+=1\r\nprint(count)", "a=int(input())\r\ni=1\r\nl=0\r\nwhile i<a:\r\n if (a-i)%i==0:\r\n l+=1\r\n else:\r\n pass\r\n i+=1\r\nprint(l)\r\n ", "n=int(input())\r\nl=[]\r\nfor i in range(1,n):\r\n l.append((n-i)%i)\r\nprint(l.count(0))", "n = int(input())\r\nk = -1\r\nfor i in range(n):\r\n if n%(i+1) == 0:\r\n k +=1\r\nprint(k)", "n=int(input())\r\ncount=0\r\nfor i in range(2,n+1):\r\n if n%i==0 :\r\n count=count+1\r\n else:\r\n count=count\r\nprint(count)", "import math\r\nn = int(input())\r\nc = 0\r\neach = math.floor(n/2)\r\nif n==2:\r\n c = 1\r\nelse:\r\n for i in range(2,n+1):\r\n if n%i==0:\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\nif 2<=n<=10**5 :\r\n x=0\r\n y=0\r\n while n>x :\r\n x=x+1\r\n while n%x==0 :\r\n y=y+1\r\n break \r\nprint(y-1)", "# import sys\r\n# sys.stdout = open('Codeforces/output.txt', 'w')\r\n# sys.stdin = open('Codeforces/input.txt', 'r')\r\n\r\nn = int(input())\r\ncc = 0\r\ni = n//2\r\n\r\nfor i in range(1, i+1):\r\n n-=1\r\n if n%i==0:\r\n cc+=1\r\n i+=1\r\nprint(cc)", "n=int(input())\nif n in range(2,(10**5)+1):\n count=0\n for i in range(1,n):\n if n%i==0:\n count+=1\n print(count)\n \t \t\t \t\t\t \t \t\t \t \t \t \t \t", "n = int(input())\r\nresult = 0\r\nfor l in range(1, n):\r\n if (n - l) % l == 0:\r\n result += 1\r\nprint(result)", "temp=int(input())\r\ncount=0\r\nfor i in range(1,temp//2+1):\r\n if temp%i==0:\r\n count=count+1\r\nprint(count)", "n=int(input())\r\ncounter=0\r\nfor i in range(1,n,1):\r\n if n%i==0:\r\n counter+=1\r\nprint(counter)", "n=int(input())\r\nans=1\r\nfor x in range(2,n):\r\n if (n-x)%x==0:\r\n ans+=1\r\nprint(ans)\r\n", "# len(str(n)) == len(set(str(n))) - проверка, явяляются ли все цифры в числе различными\n\n\nn = int(input())\ncounter = 0\nfor i in range(1, n):\n if n % i == 0:\n counter += 1\n else:\n pass\nprint(counter)\n\n", "import math\r\n\r\ndef countTeamLeaders(n):\r\n count = 0\r\n sqrt_n = int(math.sqrt(n))\r\n\r\n for i in range(2, sqrt_n + 1):\r\n if n % i == 0:\r\n count += 2\r\n if i * i == n:\r\n count -= 1\r\n\r\n return count+1\r\n\r\nn = int(input())\r\n\r\nprint(countTeamLeaders(n))\r\n", "n=int(input())\r\nl=0\r\nfor i in range(1,int((n/2)+1)):\r\n if (n-i)%i==0:\r\n l=l+1\r\n\r\nprint(l) ", "print((n:=int(input())) - n + sum((1 for i in range(1, n // 2 + 1) if (n - i) % i == 0)))\n", "n=int(input())\r\nA=[]\r\nfor i in range(1,n):\r\n if n % i==0:\r\n A.append(n//i)\r\n A.sort()\r\n else:\r\n continue\r\nx=len(A)\r\nprint(x)", "num=int(input())\r\nsum=0\r\nfor i in range(1,num):\r\n if num%i==0:\r\n sum+=1\r\nprint(sum)\r\n", "num = int(input())\r\ncounter=0\r\n\r\nfor i in range(1,num):\r\n if num>1:\r\n if num%i==0:\r\n counter+=1\r\n else:\r\n print(0)\r\n break\r\n\r\nprint(counter)\r\n", "n=int(input())\r\nflag=0\r\nfor i in range(1,n):\r\n if((n-i)%i==0):\r\n flag+=1\r\nprint(flag)\r\n", "# URL: https://codeforces.com/problemset/problem/935/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())\nans = 0\nfor i in range(1, n // 2 + 1):\n ans += n % i == 0\nout(f\"{ans}\")\n", "def process(n):\r\n answer = 0\r\n for i in range(1, n):\r\n if n % i==0:\r\n answer+=1\r\n return answer\r\n\r\nn = int(input())\r\nprint(process(n))", "def solve(n):\r\n dvsr = [k for k in range(1, 1 + n//2) if n % k == 0]\r\n return len(dvsr)\r\n\r\nn = int(input())\r\nprint(solve(n))", "l=[]\r\nn=int(input())\r\nfor i in range(1,n):\r\n if n%i==0:\r\n x=(n//i)\r\n y=x-1\r\n l.append(y)\r\nz=len(l)\r\nprint(z)\r\n ", "t = 0\r\nn = int(input())\r\nfor i in range (2, n+1):\r\n if n%i == 0:\r\n t += 1\r\nprint(t)", "n = int(input())\r\ni = 0\r\nfor y in range(1, n+1):\r\n if (n-y) % y == 0:\r\n i += 1\r\nprint(i-1)", "n=int(input())\r\ncounts=0\r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n counts+=1\r\nprint(counts)", "countOfPersons = int(input())\r\ncountOfV = 0\r\nfor i in range(1, countOfPersons):\r\n if (countOfPersons-i) % i == 0:\r\n countOfV += 1\r\nprint(countOfV)", "n = int(input())\r\ns = 0\r\nfor i in range(1,n):\r\n if ((n-i)%i)==0:\r\n s = s+1\r\nprint(s)", "n=int(input())\r\ns=0\r\nfor i in range(1,int(n/2)+1):\r\n if n%i==0:\r\n s+=1\r\nprint(s)", "inp = int(input())\r\nc = 0\r\nfor i in range(1, inp):\r\n if inp % i == 0:\r\n c += 1\r\nprint(c)\r\n", "a=int(input())\r\ns=0\r\nfor i in range(1,a):\r\n if (a-i)//i*i+i==a: s+=1\r\nprint(s)", "def solve(n):\n ret = 0\n for i in range(1,n//2+1):\n if (n-i)%i == 0:\n # print (n-i,i)\n ret += 1\n return ret\n\nprint (solve(int(input())))\n \n\n\n \n \n", "n=int(input())\r\nt=0\r\nfor i in range(1,n):\r\n if(n%i==0):\r\n t=t+1\r\nprint (t)", "n=int(input())\r\nprint(sum([n%i==0 for i in range(1,n)]))", "n=int(input())\r\nw=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n w=w+1\r\nprint(w)", "n=int(input())\r\nx=0\r\nfor i in range(1,n):\r\n while n%i==0:\r\n x=x+1\r\n break \r\nprint(x)", "n= int( input ())\r\nk=int(n)\r\nc=0\r\ni=1\r\nwhile(n>1):\r\n if(k%i==0):\r\n c=c+1\r\n \r\n i=i+1\r\n n=n-1\r\nprint(c)\r\n", "n = int(input())\r\n\r\nans = 0\r\nfor l in range(1, n):\r\n if (n - l) % l == 0:\r\n ans += 1\r\n \r\nprint(ans)", "n = int(input())\r\ncounter = 1\r\nfor i in range (2,n):\r\n if n % i == 0:\r\n counter = counter + 1\r\nprint(counter)", "s = int(input())\r\ng = 0\r\nfor i in range(1,s + 1):\r\n if (s - i) % i == 0:\r\n g += 1\r\nprint(g-1)", "employees = int(input())\r\nanswer = 0\r\nfor i in range(1,employees):\r\n if employees % i == 0 :\r\n answer = answer+1\r\nprint(answer)", "n=int(input())\nsum=1\nfor i in range(2,n):\n #print(i)\n if n%i==0:\n sum=sum+1\nprint(sum)\n#Salim", "n=int(input());l=0\r\nfor i in range(1,n):\r\n p=n-i\r\n if p%i==0:\r\n l+=1\r\nprint(l)\r\n", "n=int(input())\r\nanswer=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n answer+=1\r\nprint(answer)", "n = int(input())\r\nc = 0\r\nfor i in range(1,n//2+1):\r\n a = n-i\r\n if a%i==0:\r\n c+=1 \r\nprint(c)", "a = int(input())\r\nans= 0\r\nfor i in range(1,a):\r\n x = a-i\r\n if (a-x)//x == (a-x)/x:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nc=0\r\nfor i in range(2,n+1):\r\n if n%i==0:\r\n c+=1\r\nprint(c)", "from math import *\r\n\r\n\r\ndef isPrime(num):\r\n for i in range(2, ceil(sqrt(num)) + 1):\r\n if num % i == 0: return False\r\n return True\r\n\r\n\r\nnum = int(input())\r\nif isPrime(num):\r\n print(1)\r\n\r\nelse:\r\n re = 0\r\n for i in range(num // 2, 0, -1):\r\n if num % i == 0:\r\n re += 1\r\n print(re)\r\n", "n = int(input())\r\nres = 0\r\nfor i in range(1,n):\r\n l = i\r\n e = n-l\r\n if(e>0) and (e%l==0):\r\n res+=1\r\nprint(res)", "n = int(input())\r\ncount = 0\r\nfor i in range(1,n):\r\n t = n-i\r\n if t%i==0:\r\n count+=1\r\nprint(count)\r\n \r\n \r\n", "if __name__ == '__main__':\n n = int(input())\n\n count = 0\n\n for i in range(n//2):\n if (n - i - 1) % (i+1) == 0:\n count += 1\n\n print(count)\n\n", "def fafa_and_his_company():\r\n a=int(input())\r\n c=0\r\n for i in range(1,a):\r\n if a%i==0:\r\n c+=1\r\n print(c)\r\nfafa_and_his_company()", "n=int(input())\r\nc=0\r\nfor i in range(1,n//2+1):\r\n if (n-i)%i==0:c+=1\r\nprint(c)", "n=int(input())\r\nl=0\r\ni=0\r\nwhile(l<n):\r\n for x in range((n-1),0,-1):\r\n l=l+1\r\n if x%l==0:\r\n i=i+1\r\nprint(i)", "a=int(input())\ncount=0\nfor i in range(1,(a//2)+1):\n if (a-i)%i==0:\n count+=1\nprint(count)", "n = int(input())\r\nno_ways = 0\r\nfor i in range(1,n):\r\n r=n%i\r\n if r==0:\r\n no_ways+=1\r\nprint(no_ways)", "n = int(input())\r\ncount = 0\r\nfor noOfLeaders in range(1, int(n/2)+1):\r\n people_left_for_forming_grps = n-noOfLeaders\r\n if((people_left_for_forming_grps % noOfLeaders) == 0):\r\n count += 1\r\nprint(count)", "employees = int(input())\r\ncount = 0\r\n\r\nfor i in range(1, employees + 1):\r\n if (employees - i) % i == 0:\r\n count += 1\r\n\r\nprint(count - 1)", "n=int(input())\ncount=0\nfor i in range(n-1,0,-1):\n if (n-i)%i==0:\n count+=1\nprint(count)\n", "x = int(input())\r\ncount = 0\r\n\r\nfor i in range(1, x): \r\n if x - i == 0:\r\n pass\r\n elif (x - i) % i == 0:\r\n count += 1\r\n else: \r\n continue\r\nprint(count)", "def prime(n):\n F = 1\n for i in range(2, int(n ** 0.5)+1):\n if n % i == 0:\n return False\n return True\n\nn = int(input())\n\nS = 1\nif prime(n):\n print(S)\nelse:\n for i in range(2, n // 2 + 1):\n if (n - i) % i == 0:\n S += 1\n print(S)\n", "import math\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if n % i == 0:\r\n count+= 1\r\n\r\nprint(count -1)", "result= 0\r\nnumber= int(input())\r\nfor _ in range(1, (number // 2) + 1):\r\n if (number - _) % _ == 0:\r\n result = result + 1\r\nprint(result)", "n=int(input())\r\nans=0\r\nfor i in range(1,(n//2)+1):\r\n if(n-i)%i==0:\r\n ans=ans+1\r\nprint(ans)", "inp = int(input())\r\noutput = 0\r\nfor x in range(1, int(inp/2) + 1):\r\n s = str((inp-x)/x)\r\n if s[-1] == '0' and s[-2] == '.':\r\n output += 1\r\nprint(output)", "n = int(input())\r\nl = [n%i<1for i in range(1,n)]\r\nprint(sum(l))", "n=int(input())\r\nans = 0\r\nfor i in range (1,n//2+1) :\r\n if n%i == 0 :\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nf=[]\r\nfor l in range(1,n+1):\r\n if n%l==0:\r\n f.append(l)\r\nprint(len(f)-1)\r\n\r\n ", "n=int(input())\nc=0\nfor i in range(1,int(n/2)+1):\n\tif((n-i)%i==0):\n\t\tc+=1\n\telse:None\nprint(c)", "a=int(input())\r\nc=0\r\nx=1\r\ns=0\r\nfor i in range(a):\r\n if x==1:\r\n s=s+1\r\n elif x>1:\r\n if a-x==0:\r\n s=s\r\n elif (a-x)%x==0:\r\n s=s+1\r\n x=x+1\r\nprint(s)", "i, n = 0, int(input())\r\nfor h in range(1, n):\r\n if n % h == 0:\r\n i += 1\r\nprint(i)", "#Ahmed Abdelrazik\r\nn = int(input())\r\ni = 1\r\nC = 0\r\nwhile i<n:\r\n if (n-i) % i == 0: C+=1\r\n i+=1\r\n\r\nprint(C)", "from math import sqrt\r\n\r\n\r\nn=int(input())\r\ncnt=1\r\ni=2\r\nwhile i*i<n:\r\n if n%i==0:\r\n cnt+=2\r\n i+=1\r\nif float(sqrt(n))==int(sqrt(n)):\r\n cnt+=1\r\nprint(cnt)\r\n", "def main():\r\n n = int(input())\r\n\r\n total = 0\r\n\r\n for i in range(1, n):\r\n if n % i == 0:\r\n total += 1 \r\n\r\n print(total)\r\n\r\n\r\nmain()\r\n", "import math\r\n\r\ndef printDivisors(n) :\r\n i = 1\r\n arr = []\r\n while i <= math.sqrt(n):\r\n if (n % i == 0) :\r\n if (n / i == i) :\r\n arr.append(i)\r\n else :\r\n arr.append(i)\r\n arr.append(int(n/i))\r\n i = i + 1\r\n return(arr)\r\n \r\narr = printDivisors(int(input()))\r\nprint(len(arr)-1)", "n=int(input())\r\nl=(n//2)+1\r\nx=int(0)\r\nfor i in range(1,l):\r\n if(n-i)%i==0:\r\n x=x+1\r\nprint(x)", "def func(n):\r\n\tlist_w = []\r\n\tfor i in range(1, int(n/2)+1, 1):\r\n\t\tleader = i\r\n\t\temployee = (n - i)/i\r\n\t\tif int(employee) == employee:\r\n\t\t\tlist_w.append((leader, int(employee)))\r\n\treturn len(list_w)\r\n\t\r\ninp = int(input())\r\nprint(func(inp))", "n = int (input()) # number of employees\r\nw = 0 # initial ways\r\nfor i in range(1, (n // 2) + 1):\r\n if (n - i) % i == 0:\r\n w = w + 1\r\nprint(w)", "import math\nn = int(input())\ntop = math.ceil(n/2) + 1\ntotal = 0\nfor i in range(1, top) :\n if((n - i) % i == 0) :\n total = total + 1\nprint(total)\n\t \t\t \t\t\t\t \t\t \t\t\t\t \t\t \t", "n = int(input())\r\nc=0\r\nfor i in range (n-1):\r\n if (n%(i+1)==0):\r\n c+=1\r\nprint(c)\r\n \r\n", "def Fofa_and_his_Company(n):\r\n counter = 0\r\n for i in range(1,n):\r\n if n%i == 0:\r\n counter+=1\r\n return counter\r\nn = int(input())\r\nprint(Fofa_and_his_Company(n))", "A=0\r\nn =int(input())\r\nfor i in range(1,n):\r\n if n>=2:\r\n if n%(i)==0:\r\n A=A+1\r\n \r\n \r\nif n>=2:\r\n print (A)\r\nelse:\r\n print (\"\")", "n=int(input())\r\nc=1\r\ni=2\r\nwhile n>i*i:\r\n if n%i==0:\r\n c+=2\r\n i+=1\r\nif n**0.5==int(n**0.5):\r\n c+=1\r\nprint(c)\r\n ", "n = int(input())\r\ncount = 0\r\nif(n>=2):\r\n for i in range(1,n):\r\n if(n%i==0):\r\n count += 1\r\nprint(count)", "n=int(input())\r\nways=0\r\nleader=1\r\nfor i in range(1,n):\r\n if(n%leader==0):\r\n ways+=1\r\n leader+=1\r\nprint(ways)\r\n \r\n \r\n", "def cf(n):\r\n\tans=0\r\n\tfor i in range(1,n//2+1):\r\n\t\tif n%i==0:\r\n\t\t\tans+=1\r\n\treturn ans\r\nprint(cf(int(input())))", "def teams(n) :\r\n t = 0 #initialize division iteration\r\n k = 1 #initialize inner iteration\r\n\r\n for i in range (n) : \r\n if n % k == 0 :\r\n t = t + 1\r\n k = k + 1\r\n \r\n return t - 1 # subtract 1 to account for first count\r\n\r\nn = int(input()) # number of employees\r\n\r\nprint(teams(n))", "n = int(input())\nk = 0\nfor i in range(1, n//2+1):\n if n%i == 0:\n k+=1\nprint(k)\n \n \t \t \t \t \t \t \t\t \t\t\t\t\t", "n=int(input())\r\nans = 0\r\n\r\nfor i in range(1,(n//2)+1):\r\n if(n-i)%i==0:\r\n ans = ans+1\r\n \r\nprint(ans)", "n= int(input())\r\nres=0\r\nfor i in range(1,n//2+1):\r\n if (n-i)%i==0:\r\n res+=1\r\nprint(res)", "n = int(input())\r\nl = 1\r\nways_to_count = 0\r\nwhile l<=n//2:\r\n if (n-l)%l==0:\r\n ways_to_count+=1\r\n l+=1\r\n\r\nprint(ways_to_count)", "emp = int(input())\r\nway = 0\r\nfor i in range(1,emp):\r\n if i > (emp-i):\r\n break\r\n if not (emp-i) % i :\r\n way += 1\r\nprint(way)\r\n\r\n", "# 935A -- Fafa and his Company\r\n\r\n# There must be an equal number of teammembers per team, and\r\n# the sum of team members and team leaders must equal N.\r\n\r\n# \r\n\r\n\r\n\r\n# workers/leaders must have a mod of 0.\r\n# workers + leaders must equal N\r\n\r\n# I am going to try and solve with an iteration answer as a hard-math\r\n# solution isn't coming to me at first glance.\r\n\r\nnumberOfPeople = int(input())\r\ncounter = 0\r\n\r\nfor n in range(1, numberOfPeople):\r\n leaders = n\r\n workers = numberOfPeople - n\r\n \r\n if (workers % leaders) == 0:\r\n counter += 1\r\n\r\noutput = counter\r\nprint(counter)\r\n\r\n# Ok so this answer does work, but I am worried that because we\r\n# have 10*5 potential people that the answer is going to be too slow\r\n# when calculating larger numbers.", "# https://codeforces.com/problemset/problem/935/A\r\n\r\nemployees = int(input())\r\ndifference = 0\r\ncount = 0\r\nfor i in range(1, employees):\r\n\tdifference = employees - i\r\n\tmodulo = employees % i\r\n\tif modulo == 0:\r\n\t\tcount = count + 1\r\n\tif i == difference:\r\n\t\tbreak\r\nprint(count)", "n=int(input())\r\nt=0\r\nfor i in range(1,n):\r\n if(n%i)==0:\r\n t+=1\r\nprint(t)", "a = int(input())\r\nb = 0\r\nfor i in range(1,a+1):\r\n if a%i == 0:\r\n b += 1\r\nprint(b-1)", "a=int(input())\r\ncount=1\r\nfor i in range(2,int(a**.5)+1):\r\n if a%i==0:\r\n count+=2\r\n if i==(a//i):count-=1\r\nprint(count)", "n, i, s = int(input()), 1, 0\r\nwhile(n > i):\r\n if not ((n - i) % i):\r\n s += 1\r\n i += 1\r\nprint(s)\r\n", "l = []\r\nn = int(input())\r\nfor i in range(1,n):\r\n if n % i == 0 :\r\n x = (n // i)\r\n y = x - 1\r\n l.append(y)\r\nz= len(l)\r\nprint(z)\r\n", "a=int(input())\r\ng=1\r\nfor x in range(2,a//2+1):\r\n if a%x==0:\r\n g+=1\r\nprint(g)", "a=int(input())\r\ncount=1\r\nfor j in range(2,(a//2)+1):\r\n if (a-j)%j==0:\r\n count+=1\r\nprint(count)", "a=int(input())\r\nc=0\r\nfor x in range(1,a):\r\n if (a-x)%x==0:\r\n c+=1\r\nprint(c)", "#import math\r\nip=int(input())\r\ns=0\r\nfor i in range(1,ip+1):\r\n if (ip-i)/i==int((ip-1)/i):\r\n s+=1\r\n \r\nprint(s-1) \r\n", "n=int(input())\r\nk=0\r\nm=int(n/2)\r\nfor i in range(1,m+1):\r\n if n%i==0:\r\n k+=1\r\nprint(k)", "n=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n p=n-i\r\n if(i<=p):\r\n if(p%i==0):\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "n=int(input())\r\nnum=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n num+=1\r\n else:\r\n continue\r\nprint(num)", "n = int(input())\r\nc = 0\r\nfor i in range(1,n+1):\r\n if n - i > 0 and (n - i) % i == 0:\r\n c = c + 1\r\n else:\r\n continue\r\nprint(c)", "N=int(input())\r\nSUM=0\r\nfor i in range(N):\r\n if N%(i+1)==0:\r\n SUM+=1\r\nprint(SUM-1)", "n=int(input())\r\nlmax=(n//2)+1\r\ncount= int(0)\r\nfor l in range(1,lmax):\r\n if ((n-l)%l)==0:\r\n count=count+1\r\nprint(count)", "n = int(input())\r\nw = 0\r\n\r\nfor i in range(1,n+1):\r\n if n-i != 0:\r\n if (n-i)%i == 0:\r\n w = w+1\r\nprint(w)\r\n", "# https://codeforces.com/problemset/problem/935/A\r\ninteger = int( input() )\r\nanswer = 0\r\n\r\nfor i in range(integer):\r\n if i != 0:\r\n if integer % i == 0:\r\n answer += 1\r\n\r\nprint( answer )", "x=int(input())\r\nc=0\r\nfor i in range(2,x//2 + 1):\r\n if (x-i)%i==0:\r\n c+=1\r\nprint(c+1)", "n=int(input())\r\nw=0\r\nfor l in range(1,n):\r\n if((l-n)%l==0):\r\n w+=1\r\nprint(w)\r\n", "n=int(input())\r\nways=0\r\nfor i in range(1,(n//2)+1):\r\n if not((n-i)%i):\r\n ways+=1\r\n \r\nprint(ways)\r\n ", "N = int(input())\r\nans = 0\r\nfor i in range(1, N):\r\n if N%i == 0:\r\n ans += 1\r\nprint(ans)", "from math import *\r\nn = int(input())\r\nans = 0\r\nfor i in range(1,int(sqrt(n))+1):\r\n if n%i==0:\r\n ans+=1\r\n\r\nans=ans*2-1\r\nt = int(sqrt(n))\r\nif (t**2==n):\r\n ans-=1\r\nprint(ans)", "n = int(input())\r\nnums = 0\r\nfor i in range(1, n):\r\n if n % i == 0 and i != n:\r\n nums+=1\r\nprint(nums)\r\n", "def main():\r\n n = int(input())\r\n ans = 0\r\n for i in range(1,int(n/2)+1):\r\n if n%i==0:\r\n ans+=1\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = int(input())\nr = 0\nfor i in range(1, x):\n if x%i == 0:\n r += 1\nprint(r)", "n = int(input())\r\ncount = 0\r\ni = 1\r\nwhile n-i != 0 and i <= n//2:\r\n if(n-i)%i==0:\r\n count+=1\r\n i+=1\r\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(1,n):\r\n a=n-i\r\n if(a%i==0):\r\n count+=1\r\nprint(count) ", "n = int(input())\r\nc = 0 \r\nfor i in range(1, n):\r\n c += (n % i == 0)\r\n \r\nprint(c)", "n = int(input())\r\nl = int(n/2)\r\ncounter = 0\r\nfor i in range(1,l+1,1):\r\n x = i\r\n y = n-i\r\n if y % x == 0:\r\n counter += 1\r\nprint(counter)", "import math\r\nn = int(input())\r\nl =0\r\nfor i in range (1,n):\r\n if n%i==0:\r\n l+=1\r\nprint (l)", "n=int(input())\r\ncount=0\r\ni=1\r\nwhile i<n:\r\n if n%i==0: count+=1\r\n i+=1\r\nprint(count)", "# Fafa and his Company\r\nn = int(input())\r\nif n == 2:\r\n print(1)\r\nelse:\r\n count = 1\r\n for i in range(2,n):\r\n x = n - i\r\n if x % i == 0:\r\n count += 1\r\n print(count)", "import math\r\nn = int(input())\r\nif(n<=3):\r\n print(1)\r\nelse:\r\n i=1\r\n s = []\r\n while(i<=math.sqrt(n)):\r\n if(n%i==0):\r\n if(n/i==i):\r\n s.append(i)\r\n else:\r\n s.append(i)\r\n s.append(n/i)\r\n i+=1\r\n print(len(s)-1)\r\n\r\n \r\n \r\n ", "t=int(input())\r\nx=1\r\nc=0\r\nwhile(x!=t):\r\n r=t-x\r\n if r%x==0:\r\n c+=1\r\n x+=1\r\nprint(c)", "teams = 0\r\nn = int(input())\r\nif n != 1:\r\n for x in range(1, n//2 + 1):\r\n if (n-x)%x == 0: teams += 1\r\n print(teams)\r\nelse: print(1)", "a=int(input())\r\nd=-1\r\nfor j in range(1,a+1):\r\n if a%j==0:\r\n d+=1\r\nprint(d)\r\n", "n=int(input())\r\nleaders=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n leaders+=1\r\nprint(leaders)", "n=int(input())\r\nl=1\r\ncount=0\r\nwhile l<=n //2:\r\n if (n-l)%l==0:\r\n count+=1\r\n l+=1\r\nprint(count)", "import math\r\nn=int(input())\r\ncount=1\r\nfor i in range(2,int(math.sqrt(n))+1):\r\n if(n%i==0):\r\n if(i*i==n):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)\r\n ", "n = int(input());\r\nnoOfWays = 0;\r\nfor i in range (1, n+1):\r\n remaining = n-i;\r\n if remaining != 0:\r\n if i%remaining == 0:\r\n noOfWays = noOfWays +1;\r\nprint(noOfWays);", "n = int(input())\n\ncount = 0\n\nfor i in range(2,n+1):\n\n if n % i==0:\n count +=1\nprint(count)\n\t \t \t \t\t \t\t\t \t \t\t\t\t \t", "n=int(input())\r\nemployee_count=0\r\nfor x in range(1,n):\r\n\tif n%x==0:\r\n\t\temployee_count+=1\r\nprint(employee_count)", "n: int=int(input())\r\ns: int=0\r\nfor i in range(1,n):\r\n if(n-i)%i==0:\r\n s+=1\r\nprint(s)", "n = int (input ())\r\nways = 0\r\nfor i in range (1, n):\r\n if (n - i) % i == 0:\r\n ways += 1\r\nprint (ways)", "a = int(input())\r\ncount = 0\r\nfor i in range(1,a):\r\n if i % (a-i) == 0:\r\n count += 1\r\nprint(count)", "n= int(input())\r\ns=0\r\nfor i in range(2,n):\r\n if(((n-i)%i)==0):\r\n s+=1\r\nprint(s+1)", "n = int(input())\r\na = 1\r\nb = 0\r\nfor i in range(n):\r\n a = a + 1\r\n if n % a == 0:\r\n b = b + 1\r\nprint(b)", "n = int(input())\r\nb = n//2\r\ncount = 0\r\n\r\nfor i in range(1, b+1):\r\n if n % i == 0:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\ns = 1\r\nfor x in range(2, n):\r\n if n % x == 0:\r\n s+=1\r\nprint(s)", "'''adj list'''\r\n# intn =int(input()) ; d= {}\r\n# for i in range(intn):\r\n# m,n =[int(x) for x in input().split()]\r\n# if m in d.keys():\r\n# d[m].append(n)\r\n# else:\r\n# d[m]=[n]\r\n# m,n =0,0\r\n# print(d)\r\n'''adj mtrx'''\r\n\r\n# l =[]\r\n# for i in range(10):\r\n# l.append([int(x) for x in input().split()])\r\n# print(l)\r\n\r\n\r\nn =int(input()); c=0\r\n# print(type(n),n/2)\r\nfor ans in range(2,int(n/2)+1):\r\n if (n-ans)% ans ==0:\r\n c +=1\r\n # print(ans)\r\nprint(c+1)\r\n \r\n\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\nans = 0\r\nfor i in range (1,n):\r\n a= n%i\r\n if a ==0:\r\n ans+=1\r\nprint (ans)\r\n", "n=int(input())\r\nco=0\r\nfor i in range(1,n):\r\n if n%i==0:co+=1\r\nprint(co)\r\n", "n=int(input())\r\nm=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n m=m+1\r\nprint(m)", "t = int(input())\r\ncount = 0\r\nfor i in range(1, t//2+1):\r\n a = t-i\r\n if(a%i == 0):\r\n count = count+1\r\nprint(count)", "n=int(input())\r\nc=0\r\nfor i in range(1,1+n):\r\n p=n%i\r\n if(p==0):\r\n c=c+1\r\nprint(c-1)\r\n\r\n", "n = int(input())\nways = 0\nfor x in range(int(n/2)):\n if(n/(x+1) % 1 == 0 and n/(x+1) > 1):\n ways += 1\n\nprint(ways)\n", "n = int(input()) \r\n\r\nleaders = []\r\n\r\nfor i in range(2, n):\r\n if n%i==0:\r\n leaders.append(i)\r\n\r\nif len(leaders) == 0:\r\n print(1)\r\nelse:\r\n print(len(leaders)+1)\r\n", "\r\nx = int(input())\r\ncnt=0\r\nfor i in range(1,x//2+1):\r\n if x%i==0:\r\n cnt+=1\r\nprint(cnt)", "a=int(input())\r\nb=0\r\nfor i in range(1,a):\r\n if a%i==0:\r\n b+=1\r\nprint(b)", "n = int(input())\r\nans =0\r\nfor i in range(1,n):\r\n if n%(1+i)==0:\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\ne = []\r\nx = 1\r\nc = 0\r\n\r\nfor y in range(n - 1):\r\n e.append(x)\r\n x += 1\r\n\r\ni, j = 0, len(e) - 1\r\n\r\nwhile i < len(e) and j >= 0:\r\n if (e[i] * e[j]) + e[i] == n:\r\n c += 1\r\n i += 1\r\n j -= 1\r\n elif (e[i] * e[j]) + e[i] > n:\r\n j -= 1\r\n elif (e[i] * e[j]) + e[i] < n:\r\n i += 1\r\nprint(c)\r\n", "n=int(input())\na=0\nfor i in range(1,n):\n if (n-i)%i==0:\n a+=1\nprint(a)", "n=int(input())\r\ncnt=1\r\nfor i in range(2,n):\r\n if n%i==0 : cnt+=1\r\nprint(cnt)", "x=int(input())\r\ncount=0\r\nfor i in range(1,x):\r\n if x%i==0:\r\n count=count+1\r\nprint(count)", "l = int(input())\r\nn = 0\r\nif l>=2 and l<=(10**5):\r\n for i in range(1,l):\r\n if l%i==0:\r\n n = n+1\r\nprint(n)", "n = int(input())\r\nw=0\r\nfor i in range(1, n):\r\n if (n%i)==0:\r\n w+=1\r\nprint(w)", "n = int(input())\r\ncn = 0\r\nfor i in range(1, n):\r\n if n % i == 0:\r\n cn += 1\r\nprint(cn)", "# 코드포스 935A Fafa and his Company\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn = int(put())\r\ncnt = 0\r\n\r\nfor i in range(1, n//2 + 1):\r\n if not (n - i) % i:\r\n cnt += 1\r\n\r\nprint(cnt)", "n = int(input())\r\nresult = sum(1 for i in range(1, n//2 + 1) if n % i == 0)\r\nprint(result)", "n = int(input());ans = 0\r\nif n % 2 == 0:\r\n x = n//2\r\n for i in range(1, n+1):\r\n if n % i == 0:\r\n if i == x:print(ans+1);break\r\n else:ans += 1\r\nelse:\r\n for i in range(1, n+1):\r\n if n % i == 0:ans += 1\r\n print(ans-1)\r\n", "z=int(input())\r\nprint(sum(z%i<1for i in range(1,z)))", "A = int(input())\r\ncount = 0\r\nfor i in range(1,A):\r\n if A%i == 0:\r\n count += 1\r\nprint(count)\r\n\r\n", "n = int(input())\r\nt= 0\r\nif n != 2:\r\n for i in range(1,n//2+2):\r\n if n%i == 0:\r\n t +=1\r\n print(t)\r\nelse:\r\n print(1)\r\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n n = int(input())\r\n\r\n ans = 0\r\n for i in range(1, n):\r\n if (n - i) % i == 0:\r\n ans += 1\r\n return ans\r\n\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\nl = 0\r\nfor i in range(1,n):\r\n if n % i == 0:\r\n l += 1\r\nprint(l)\r\n \r\n \r\n ", "def divide_team(n):\r\n ways = 1\r\n for i in range(2, n):\r\n if n % i == 0:\r\n ways += 1\r\n return ways\r\n\r\nprint(divide_team(n=int(input())))", "n = int(input())\nl=0\nfor i in range(1,n):\n if (n-i)%i==0:\n l+=1\nprint(l)\n \n", "n=int(input())\r\nc=0\r\nfor i in range(n-1):\r\n c+=n%(i+1)==0\r\nprint(c)", "a=int(input())\r\ncount=0\r\nfor i in range(a):\r\n if(i%(a-i)==0):count+=1\r\nprint(count-1)", "n = int(input())\r\nrez = 1\r\nfor x in range(2, n):\r\n if (n-x) % x == 0:\r\n rez += 1\r\n if (n-x)//x == 0:\r\n break\r\n\r\nprint(rez)\r\n", "n = int(input())\r\ni = 2\r\ncounter = 0\r\nwhile True: \r\n if i > n // i:\r\n break\r\n if n % i == 0:\r\n counter += 1\r\n i += 1\r\ni -= 1\r\nif i * i == n:\r\n print(2 * counter)\r\nelse:\r\n print(2 * counter + 1)\r\n", "v1=int(input());print(sum(v1%i<1 for i in range(1,v1) ))", "def fafaCompany(N):\r\n counter = 0\r\n for i in range(1,N):\r\n if(N % i == 0):\r\n counter += 1\r\n \r\n return counter\r\n\r\nN = int(input())\r\nprint(fafaCompany(N))", "def sol(n):\r\n l=[ _ for _ in range(1,n) if (n-_)%_==0]\r\n return len(l)\r\n#\r\nt =int(input())\r\nprint(sol(t))\r\n", "n=int(input())\r\nt=1\r\nfor i in range(2,n//2+1):\r\n if n%i==0:\r\n t+=1\r\nprint(t)", "number_of_employees = int(input())\r\n\r\npossible_divisions = 1\r\n\r\nfor i in range(2, number_of_employees // 2 + 1):\r\n if (number_of_employees - i) % i == 0:\r\n possible_divisions += 1\r\n\r\nprint(possible_divisions)\r\n", "N=int(input())\r\nMax=N//2\r\nCont=0\r\nfor K in range(2,Max+1):\r\n if(N%K==0):\r\n Cont=Cont+1\r\nprint(Cont+1)\r\n", "n = int(input())\r\ns = 0\r\nfor i in range(2, n + 1):\r\n if n % i == 0:\r\n s += 1\r\nprint(s)\r\n", "n=int(input())\r\ni=0\r\nfor k in range(1,n):\r\n if n%k==0:\r\n i+=1\r\nprint(i)\r\n", "n = int(input())\r\nrest = 0\r\nways = 0\r\n\r\nfor i in range(1, n + 1):\r\n leader = i\r\n rest = n - leader\r\n \r\n # if leader become bigger than rest of employees then break >> as they will never got divided by rest\r\n \r\n if leader > rest:\r\n break\r\n else:\r\n # if rest is divisble by leader then this a way\r\n if rest % leader == 0:\r\n ways += 1\r\nprint(ways)", "\r\nn = int(input())\r\n\r\nanswer = 0\r\n\r\nfor i in range(1, n, 1):\r\n if (n-i)%i == 0:\r\n answer += 1\r\n\r\nprint(answer)\r\n", "n = int(input())\r\ncnt = 0\r\nfor i in range(1,n):\r\n if(n%i ==0):\r\n cnt+= 1 \r\nprint(cnt)", "n=int(input())\r\nd=n//2\r\nc=0\r\nfor i in range(1,d+1):\r\n if (n-i)%i==0:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nprint(sum(n % i == 0 for i in range(1, n)))\r\n", "def cnt_divs(n):\n k = 0\n for i in range(1, n ):\n if n % i == 0:\n k += 1\n return k\n\n\nn = int(input())\nprint(cnt_divs(n))\n", "n = int(input())\r\ncount = 0\r\n\r\nfor x in range(1, (n//2)+1):\r\n if (n-x) % x == 0:\r\n count += 1\r\nprint(count)", "N = int(input())\r\ncnt=0\r\nfor i in range(1, N//2+1):\r\n if (N-i)%i == 0:\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\nc=1\r\nfor i in range(2,int(n/2)+1):\r\n if (n-i) % i ==0:\r\n c+=1\r\nprint(c)\r\n", "rishi=int(input())\r\nqz=0\r\nif(rishi==2):\r\n qz=1\r\nelse:\r\n for i in range(2,rishi+1):\r\n if(rishi%i==0):\r\n qz+=1\r\nprint(qz)", "n = int(input())\r\ns=0\r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n s=s+1\r\nprint(s)", "n = int(input())\r\nways= 0\r\n\r\nfor i in range(1, n):\r\n if (n - i) % i == 0:\r\n ways += 1\r\nprint(ways)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-26 14:28:15\nLastEditTime: 2021-11-26 14:32:15\nDescription: Fafa and his Company\nFilePath: CF935A.py\n'''\n\n\ndef func():\n n = int(input())\n count = 0\n for i in range(1, n):\n if n % i == 0:\n count += 1\n print(count)\n\n\nif __name__ == '__main__':\n func()\n ", "def combinations(n):\r\n ways = 0\r\n for l in range (1,n):\r\n if n % l==0:\r\n ways += 1\r\n return ways \r\n\r\nl = int(input())\r\nanswer = combinations(l)\r\nprint(answer)\r\n", "a = int(input())\r\ncount = 0\r\nfor i in range(1,a):\r\n if a % i == 0:\r\n count += 1\r\nprint(count)", "n=int(input())\r\nc=0\r\nfor i in range(1,int(n/2)+1):\r\n\tif((n-i)%i==0):\r\n\t\tc+=1\r\n\telse:None\r\nprint(c)", "def factors(x):\r\n count = 0\r\n for i in range(1, x):\r\n if x%i==0:\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nprint(factors(n))", "l = int(input())\r\na = 1\r\n\r\nfor i in range(2, l):\r\n if l % i == 0:\r\n a += 1\r\n\r\nprint(a)\r\n", "x = int(input())\r\ncnt = 1\r\nfor i in range(2, x//2+1):\r\n if (x-i)%i == 0:\r\n cnt += 1\r\nprint(cnt)", "n=int(input())\r\ncount=0\r\nif n>3:\r\n for i in range(1,n):\r\n x=n-i\r\n if x%i==0:\r\n count+=1\r\nelse:\r\n count=1\r\nprint(count)", "from math import ceil\r\n\r\nn = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, n // 2 + 1):\r\n count += 1 if n % i == 0 else 0\r\n\r\nprint(count)", "def solution():\n n = int(input())\n ways = 0\n\n for i in range(1, n):\n if (n-i) % i == 0:\n ways += 1\n\n print(ways)\n\n\nsolution()\n", "m=int(input())\r\nk=0\r\nfor i in range(1,m):\r\n\t\r\n\tif(m%i)==0:\r\n\t\tk+=1\r\nprint(k)", "n = int(input())\r\ncount = 0\r\nfor i in range(n//2):\r\n if (n-(i+1))%(i+1) == 0:\r\n count+=1\r\nprint(count)", "inp1 = int(input())\r\ncount = 0\r\nfor i in range(1,inp1):\r\n if (inp1%i) == 0 and (inp1-i)%i == 0:\r\n count += 1\r\nprint(count)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 11 17:38:52 2022\r\n\r\n@author: dehon\r\n\"\"\"\r\n\r\nn, i, s = int(input()), 1, 0\r\nwhile(n > i):\r\n if not ((n - i) % i):\r\n s += 1\r\n i += 1\r\nprint(s)", "a = int(input())\r\ni = 0\r\nfor b in range(1, a):\r\n c = a - b\r\n if c % b == 0:\r\n i =i + 1\r\nprint(i)", "n = int(input())\r\nres = 0\r\nfor i in range(1, n):\r\n s = n\r\n s-=i\r\n if s % i ==0:\r\n res+=1\r\nprint(res)\r\n", "n = int(input())\r\nways = 0\r\nfor i in range(1, n//2+1):\r\n if (n-i)%i == 0:\r\n ways += 1\r\nprint(ways)\r\n", "c=0;x=int(input())\r\nfor i in range(1,x):\r\n\tif x%i==0: c+=1\r\nprint(c)", "num = int(input())\nfinal = 0\n\nfor hih in range(1, num):\n if (num - hih) % hih == 0:\n final += 1\n\nprint(final)\n", "n=int(input())\ncount=0\nfor i in range(1,(n//2)+1):\n if ((n-i)%i)==0:\n count+=1\nprint(count) \n\n\n \n \t\t \t\t \t \t\t \t \t\t \t\t \t\t \t \t", "x = int(input())\r\nc = 0\r\nfor i in range(1, x):\r\n if (x - i) % i == 0:\r\n c += 1\r\nprint(c)", "n=int(input())\r\nax=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n ax.append(i)\r\nprint(len(ax)-1)", "q=int(input())\r\nw=0\r\nfor i in range(1,q):\r\n if q%i==0:\r\n w+=1\r\nprint(w)", "n=int(input())\r\nct=0\r\nsum=0\r\ni=0\r\nfor i in range(n):\r\n sum=n-(i+1)\r\n if(sum%(i+1)==0 and sum>0):\r\n ct=ct+1\r\nprint(ct)", "n=int(input())\ncount=0\nfor l in range(1,n):\n if (n-l)%l==0:\n count+=1\nprint(count)", "n = int(input())\r\ncnt = 1\r\nif n == 2:\r\n print(1)\r\nelse:\r\n for i in range(2, n):\r\n if (n-i) % i == 0:\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nc= -1\r\nfor i in range (1,n+1):\r\n if n%i ==0:\r\n c+=1\r\n else:\r\n continue \r\nprint(c)\r\n ", "s = int(input())\r\nanswer = 0\r\nfor i in range(1,s):\r\n if s % i == 0:\r\n answer += 1\r\nprint(answer)", "n = int(input())\r\nans = 1\r\nc = 2\r\nwhile c*c<=n:\r\n if n%c==0:\r\n if c*c!=n:\r\n ans+=2\r\n else:\r\n ans+=1\r\n c+=1\r\nprint(ans)\r\n", "n = int(input())\r\ns = 0\r\nfor i in range(1, n):\r\n if (n-i) % i == 0:\r\n s += 1\r\nprint(s)", "n=int(input())\r\nk=0\r\nfor l in range(1,n-1):\r\n if l%(n-l)==0:\r\n k+=1\r\nprint(k+1)", "n=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n if (n-i)%i==0:\r\n c+=1\r\n else:\r\n continue\r\nprint(c-1)\r\n ", "n=int(input())\r\nc=0\r\nfor i in range(1,(n+1)):\r\n if (n-i)%i==0:\r\n c+=1\r\nprint((c-1))", "n = int(input())\r\n\r\nans = 0\r\n\r\nfor i in range(2, n + 1):\r\n users = n - i\r\n if users % i == 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 7 12:48:18 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\nw=0\r\nfor i in range(1,n):\r\n if ((n-i)%i)==0:\r\n w=w+1\r\n \r\nprint(w)", "a = int(input())\r\nk = 0\r\nfor i in range(1, a//2 + 1):\r\n if (a - i)%i == 0:\r\n k += 1\r\nprint(k)", "n=int(input())\r\nnum=0\r\nfor i in range(1,n//2+1):\r\n temp=n-i\r\n if temp%i==0:\r\n num+=1\r\n temp=0\r\nprint(num)", "n = int(input())\r\n\r\ncnt = 0\r\n\r\nfor i in range(2, n + 1):\r\n if n % i == 0:\r\n cnt += 1\r\n\r\n\r\nprint(cnt)", "n = int(input())\r\nj = 0\r\n\r\nfor i in range(1, n//2+1):\r\n if (n-i) % i == 0:\r\n j += 1\r\n\r\nprint(j)", "n = int(input())\ncount = 0\nfor i in range(2,n+1):\n if n % i==0:\n count +=1\nprint(count)\n \t \t \t \t \t \t \t\t\t", "n = int(input())\r\nc = 0\r\nfor i in range(1, n):\r\n l = i\r\n e = n-l \r\n if e%l==0:\r\n c = c + 1\r\nprint(c)", "n=int(input())\r\nl1=[]\r\nfor i in range(2, n + 1):\r\n if n % i == 0:\r\n l1.append(i)\r\nprint(len(l1)) ", "n=int(input())\r\ni=1\r\nf=0\r\nwhile i<n:\r\n x=n-i\r\n \r\n if x%i==0:\r\n f+=1\r\n i+=1\r\nprint(f)\r\n", "count_staff = int(input())\r\ncount = 1\r\nfor N in range(2,count_staff//2+1):\r\n\tif (count_staff - N) % N == 0:\r\n\t\tcount += 1\r\nprint(count)", "n = int(input())\r\ns = 1\r\nfor i in range(2, n//2+1):\r\n if (n - i)%i == 0:\r\n s += 1\r\nprint(s)\r\n", "from sys import stdin\r\nfrom math import sqrt, ceil\r\ninp = stdin.readline\r\n\r\nn = int(inp())\r\ncount = 1\r\n\r\nfor i in range(2, ceil(sqrt(n))):\r\n if n % i == 0:\r\n count += 2\r\n\r\nif sqrt(n) == ceil(sqrt(n)):\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input(\"\"))\nout = 1\ni = 2 # this way we add 1 leader - rest followers\nwhile i <= (n/2):\n\n if (n-i) % i == 0:\n out += 1\n\n i += 1\n\nprint(out)\n", "n = int(input())\r\nc = 0\r\nfor i in range(n//2):\r\n if((n-(i+1))%(i+1)==0):\r\n c += 1\r\nprint(c)", "n = int(input())\r\nk = 0\r\nfor i in range(1, n // 2 + 1):\r\n if n % i == 0:\r\n k += 1\r\nprint(k)", "employees = int(input())\r\nways = 1\r\nif employees%2 == 0:\r\n\ti = 2\r\n\twhile i <= employees//2:\r\n\t\tcheck = (employees - i)%i\r\n\t\tif check == 0:\r\n\t\t\tways += 1\r\n\t\ti += 1\r\nelse:\r\n\ti = 3\r\n\twhile i <= employees//2:\r\n\t\tcheck = (employees - i)%i\r\n\t\tif check == 0:\r\n\t\t\tways += 1\r\n\t\ti += 2\r\nprint(ways)", "n=int(input())\r\ncount=0\r\nfor ele in range(1,n):\r\n if n%ele==0:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nans= 0\r\n\r\nfor i in range(1,n//2+1):\r\n if (n-i)%i == 0:\r\n ans+=1\r\n\r\nprint(ans)", "import sys\r\n\r\nl = 0\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nfor i in range(1,n):\r\n if n % i == 0:\r\n l += 1\r\n\r\nprint(l)\r\n", "n = int(input())\r\n\r\nw = 0\r\n\r\nfor l in range(1, int(n/2) +1):\r\n if (n-l) % l == 0:\r\n w += 1\r\n\r\nprint(w)", "n=int(input())\r\ncnt=0\r\n\r\nfor i in range(1,n):\r\n if(n%i==0):\r\n cnt+=1\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n", "\r\nn=int(input())\r\nc=0\r\nfor i in range(1,n,1):\r\n if n%i==0:\r\n c+=1\r\n\r\n\r\nprint(c)", "# LUOGU_RID: 98793389\nn = eval(input())\nans = 0\nfor i in range(1, n):\n if (n-i)%i==0:\n ans+=1\nprint(ans)", "n = int(input())\r\nways = 0\r\n\r\nfor i in range(1,n+1):\r\n t=n-i\r\n if t%i==0:\r\n ways+=1\r\n else:\r\n continue\r\nprint(ways-1)\r\n", "y=int(input())\r\ns=0\r\nfor i in range(1,y):\r\n\t\r\n\tif(y%i)==0:\r\n\t\ts+=1\r\nprint(s)", "n = int(input())\r\na = 0\r\nfor j in range(1, n):\r\n if not (n-j)%j:\r\n a+=1\r\nprint(a)", "n = int(input())\r\nk = 0\r\ncount = 0\r\nwhile n!=0:\r\n k+=1\r\n n-=1\r\n if n%k==0 and n!=0:\r\n count+=1\r\nprint(count)", "x = int(input())\r\ndef balls(num, divisor):\r\n tot = 0\r\n if num%divisor==0:\r\n for i in range(1, num):\r\n if (num-i)%i == 0:\r\n tot+=1\r\n return tot\r\n\r\nprint(balls(x, 1))", "a = int(input())\r\nk = 0\r\nfor i in range(1,a):\r\n if (a-i)%i == 0 and a-i != 0:\r\n k +=1\r\nprint(k)\r\n", "def divisor(n):\r\n x=(n//2)+1\r\n y=0\r\n for i in range(1,x):\r\n if(n%i==0):\r\n y=y+1\r\n print(y)\r\nn=int(input())\r\nif(n>=2 and n<=10**5):\r\n divisor(n)\r\nelse:\r\n print(\"Values not in range\")", "n=int(input())\r\nc=0\r\nfor i in range(1,int(n/2)+1):\r\n x=n-i\r\n if x%i==0:\r\n c+=1\r\nprint(c)", "a = int(input())\r\nk = 0\r\nfor i in range(1, a + 1):\r\n if (a - i) % i == 0:\r\n k += 1\r\nprint(k - 1)\r\n", "result=0\r\ncase=int(input())\r\nfor i in range(2,case+1):\r\n\tif (case%i==0):\r\n\t\tresult+=1\r\nprint(result)", "a = int(input())\r\nc = 0\r\nfor i in range(1, a):\r\n q = a - i\r\n if q % i == 0:\r\n c += 1\r\n\r\nprint(c)", "def Check_Employee(x):\r\n count = 0\r\n for i in range(1,x):\r\n if x % i == 0:\r\n count += 1\r\n return count \r\nx = int(input())\r\nprint(Check_Employee(x))\r\n", "n = int(input())\r\na = 0 \r\nfor i in range(1, int(n/2)+1):\r\n if n % i == 0 :\r\n a = a + 1\r\nprint(a)", "n=int(input())\r\ncount=1\r\nif n==2:\r\n print(\"1\")\r\nelse:\r\n for i in range(2,int(n/2)+1):\r\n if n%i==0:\r\n count+=1\r\n print(count)", "\r\n# A. Fafa and his Company\r\nn = int(input())\r\nres = 0\r\nfor x in range(1, int(n / 2 + 1)):\r\n if (n - x) % x == 0:\r\n res += 1\r\nprint(res)\r\n", "n = int(input())\r\n\r\nans = 0\r\n\r\nfor i in range(1,n):\r\n col = n-i\r\n if col%i==0: ans+=1\r\nprint(ans)", "def employee(n):\r\n tl = 0\r\n if 2 <= n <= 100000:\r\n for i in range(1,n):\r\n if (n - i) % i == 0:\r\n tl += 1\r\n return(tl)\r\n else:\r\n exit()\r\nn = int(input())\r\nresult = employee(n)\r\nprint(result)", "n, r = int(input()), 0\r\nfor i in range(1, n):\r\n if n % i == 0:\r\n r += 1\r\n\r\nprint(r)", "n=int(input())\r\nleaders=0\r\nfor i in range (1,n):\r\n if (n%i==0):\r\n leaders+=1\r\nprint(leaders)\r\n", "n = int(input())\r\ncounter = 0\r\nfor x in range(1, n):\r\n if (n - x)%x == 0:\r\n counter += 1\r\nprint(counter)\r\n", "n = int(input())\r\n\r\ncount = 0\r\ni = 1\r\nwhile i <= n // 2:\r\n if (n - i) % i == 0:\r\n count += 1\r\n i += 1\r\nprint(count)", "# warm heart, wagging tail, and a smile just for you!\r\n# ███████████\r\n# ███╬╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬████╬╬╬╬╬╬███\r\n# ███████████ ██╬╬╬╬╬████╬╬████╬╬╬╬╬██\r\n# █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██\r\n# ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██\r\n# ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██\r\n# ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██\r\n# ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████\r\n# █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████\r\n# ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██\r\n# ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███\r\n# ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██\r\n# ██████████████ ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████\r\n# ███████ █████ ███████████████████\r\n\r\nn = int(input())\r\nc, d = 0, 1\r\nwhile d**2 < n:\r\n if not n%d:\r\n c += 2\r\n d += 1\r\nif d**2==n:\r\n c+=1\r\nprint(c-1)", "u=int(input())\r\nh=0\r\nfor y in range(1,u):\r\n if u%y==0:\r\n h+=1\r\nprint(h)", "N=int(input())\nC=0\nfor d in range(2,N//2+1) :\n C += (N%d==0)\nprint(C+1)\n", "n=int(input())\r\ns=1\r\nfor x in range(2,n//2+1):\r\n s+=n%x==0\r\nprint(s)", "# -*- coding: utf-8 -*-\n\"\"\"935a\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ZyY6TED5_oW4yvVqbe5sgV6m5NsIa6Ff\n\"\"\"\n\nn = int(input())\nk = int(n/2)\nc = 0\n\nfor i in range(1,k+1):\n if (n - i)%i == 0:\n c += 1\n\nprint(c)", "n = int(input())\r\nN = set(range(1,n))\r\nnum = 0\r\nfor leader in N:\r\n if (n-leader) % leader == 0:\r\n num += 1\r\nprint(num)", "t=int(input())\r\nb=0\r\nfor i in range(1,t):\r\n if t%i==0:\r\n b+=1\r\nprint(b)", "n = int(input())\r\ns = 0\r\nfor i in range(1,n//2+1):\r\n if (n-i)%i==0:\r\n s += 1\r\nprint(s)", "count = 0\r\nnum = int(input())\r\nfor i in range(2,num+1):\r\n if num%i==0:\r\n count+=1\r\nprint(count)", "'''\r\nProblem Name : \r\n Fafa and his Company\r\nproblem link :\r\n https://codeforces.com/problemset/problem/935/A\r\n'''\r\n# Input Operation\r\nnumber=int(input())\r\n# Output Operation\r\nout=0\r\nfor i in range(1,number):\r\n if((number-i)%i)==0:\r\n out+=1\r\nprint(out)", "user = int(input())\r\ncount = 0\r\nfor i in range(1,user):\r\n if user % i == 0:\r\n count+=1 \r\nprint(count)", "n = int(input())\n\n\nif n == 2:\n\tprint(1)\nelse:\n\tcounter = 0\n\tfor i in range(1, n-1):\n\t\tif n%i == 0:\n\t\t\tcounter += 1\n\n\tprint(counter)\n", "n = int(input())\r\ncounter = 0 \r\nfor i in range(1,n) :\r\n if n % i == 0:\r\n counter+=1\r\nprint(counter)\r\n ", "a = int(input())\r\nk = 0\r\nfor i in range(1,a):\r\n if a%i == 0:\r\n k += 1\r\nprint(k)", "n = int(input())\r\nsum=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n sum=sum+1\r\nprint(sum)", "n=int(input())\r\nw=0\r\nfor num in range(1,n):\r\n if(n%num==0):\r\n w+=1\r\nprint(w)", "m =int(input())\r\nc=1\r\nfor j in range(2,m):\r\n if m%j==0:\r\n c=c+1\r\nprint(c)", "n = int(input())\r\nres = 1\r\nfor c in range(2, n//2 + 1):\r\n res += 1 if (n - c) % c == 0 else 0\r\nprint(res)", "n = int(input())\r\ncount = 1\r\nfor i in range(2,n) :\r\n if n%i==0 :\r\n count=count+1\r\nprint(count)", "def Leaders(n):\r\n ways = 0\r\n for l in range(1, n):\r\n if n % l == 0:\r\n ways += 1\r\n return ways\r\n\r\nN = int(input())\r\nprint(Leaders(N))", "# Число сотрудников n должно без остатка делиться на число руководителей l\n# Сколько таких чисел\n\nn = int(input())\nc = 1 \n\ndef list_divisors(n):\n result = []\n for i in range(1, n + 1):\n if n % i == 0:\n result.append(i)\n return result\n\ndivisors = list_divisors(n)\nc += len(divisors[1:-1])\nprint(c)\n", "n = int(input())\na=1\nb=0\nwhile a<n:\n if n%a==0:\n b=b+1\n a=a+1\nprint(b)", "n=int(input())\r\nans = 0\r\nl = 1\r\nwhile n - l > 0:\r\n if (n-l) % l == 0:\r\n ans += 1\r\n l += 1\r\nprint(ans)", "def main():\n n = int(input())\n print(case(n))\n\ndef case(n):\n i = 0\n for t in range(n//2, 0, -1):\n if (n-t) % t == 0:\n i += 1\n\n return i\n \n\nmain()", "\r\n\r\n\r\ndef fafa():\r\n\r\n n = int(input())\r\n\r\n\r\n count = 0\r\n for i in range(1,n//2 + 1):\r\n employees_remaining = n - i\r\n if employees_remaining % i == 0:\r\n count += 1\r\n\r\n print(count)\r\n\r\nfafa()\r\n", "# l = No of employee\r\n\r\n\r\nl = int(input())\r\ndist_counter = 0\r\n\r\nfor i in range(1,l):\r\n if((l - i) % i == 0): #print((l-i),i,(l-i)%i ==0 )\r\n dist_counter+=1\r\n\r\nprint(dist_counter)\r\n ", "bruh = int(input())\r\ncount = 0\r\nfor i in range(1,bruh):\r\n if (bruh - i)%i==0:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nc = 0\r\nfor i in range (1, n):\r\n if (n%i==0):\r\n c = c+1\r\nprint(c) ", "n=int(input())\r\nf=0\r\nfor i in range(1,n):\r\n a=n-i\r\n if(a%i==0):\r\n f=f+1\r\nprint(f) ", "n = int(input())\r\nx = 0\r\nfor i in range(1,n):\r\n if n%i == 0:\r\n x += 1\r\nprint(x)", "employees = int(input())\r\ndivisibles = [*range(1,10)]\r\ncount=1\r\ncounter=0\r\nwhile count<employees:\r\n if employees % count==0:\r\n counter+=1\r\n count+=1\r\nprint(counter)", "x = int(input())\r\nc = 1\r\ncount = 0\r\nwhile c <= x - c:\r\n\tif (x - c) % c == 0:\r\n\t\tcount += 1\r\n\tc += 1\r\nprint(count)", "def solve():\r\n x, ans = int(input()), 0\r\n for i in range(1, x):\r\n if x % i == 0:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "# 935A - Fafa and his company\r\n\r\nn = eval(input())\r\ncount = 0\r\nfor i in range(1, int(n/2)+1):\r\n if (n-i) % i == 0:\r\n count += 1\r\nprint(count)", "\r\n\r\n\r\ndef div_ways(emp):\r\n res = 0\r\n h = int(emp/2)\r\n\r\n for i in range(1,h+1):\r\n if emp % i == 0:\r\n res += 1\r\n\r\n return res\r\n\r\n\r\nemp = int(input())\r\nprint(div_ways(emp))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n EMPLOYEE_COUNT:int = int(input())\r\n\r\n possibleCount:int = 0\r\n for tryTeamLeaderCount in range(1, EMPLOYEE_COUNT) :\r\n if EMPLOYEE_COUNT%tryTeamLeaderCount==0 : possibleCount += 1\r\n\r\n print(possibleCount)\r\n\r\nmain()", "n = int(input())\r\n\r\na = 0\r\nfor l in range(1, n):\r\n if (n-l)%l==0:\r\n a+=1\r\nprint(a)", "x = int(input())\r\nans = 0\r\nfor i in range(1, x//2 + 1):\r\n if x % i == 0:\r\n ans = ans + 1\r\nprint(ans)", "n=int(input())\r\ncount=0\r\nfor i in range(1,n):\r\n l=n-i\r\n if l%i==0:\r\n count+=1\r\nprint(count)", "import math\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n i, ans = 1, 0\r\n while i < n:\r\n calculate = (n / i) - 1\r\n\r\n if int(calculate) == math.ceil(calculate):\r\n ans += 1\r\n\r\n i += 1\r\n\r\n print(ans)\r\n", "l=int(input())\r\not=0\r\nfor x in range(1,l):\r\n if (l-x)%x==0:\r\n ot+=1\r\nprint(ot)", "n=int(input())\r\ni=1\r\ncount=0\r\nwhile(i<=n/2):\r\n if((n-i)%i==0):\r\n count+=1\r\n i+=1\r\nprint(count)", "employee = int(input())\r\njabe = employee // 2\r\njaber_list = []\r\nteam=0\r\nfor i in range(2, jabe + 1):\r\n jaber_list.append(i)\r\n\r\nfor i in jaber_list:\r\n if employee%i==0:\r\n team+=1\r\nprint(team+1)", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n num = int(input().rstrip())\r\n d = num // 2\r\n qmars = 0\r\n for i in range(1,d+1):\r\n if num % i == 0:\r\n qmars += 1\r\n output(str(qmars))\r\n output('\\n')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\ncount=1\r\nfor i in range(2,n):\r\n if((n-i)%i==0):\r\n count+=1\r\nprint(count) ", "n = int(input())\r\nc= 0\r\nfor i in range(1, n+1):\r\n a = n - i\r\n b = a // i\r\n if b*i == a and n % i == 0:\r\n c += 1\r\nd=c-1\r\nprint(d)", "n = int(input())\r\n\r\ncnt = 0\r\n\r\nfor i in range(1,n):\r\n dum = (n-i) / i\r\n \r\n if dum == int(dum):\r\n cnt += 1\r\n \r\nprint(cnt)", "n = int(input())\n\nresult = 1\nfor i in range(2, int(n / 2) + 1):\n if n % i == 0:\n result += 1\n\nprint(result)\n \t\t \t \t\t \t \t \t \t \t", "n = int(input())\r\nx = 0\r\nfor i in range (1,n):\r\n while n%i==0:\r\n x+=1\r\n break\r\n \r\nprint(x)", "import math\r\nt=int(input(\"\"))\r\ndem=0\r\nfor i in range (1,int(math.sqrt(t))+1):\r\n if t%i==0:\r\n dem+=1\r\n if t/i!=i:\r\n dem+=1\r\nprint(dem-1)", "N=int(input())\r\nl=1\r\ncount=0\r\nwhile l<N:\r\n a=N-l\r\n if(a%l==0):\r\n count=count+1\r\n l=l+1\r\nprint(count) \r\n ", "n=int(input())\r\nl=0\r\nif n>=2:\r\n for i in range(1,int(n/2)+1):\r\n if n%i==0:\r\n l=l+1\r\n print(l)", "#FAFA\r\ncount =0\r\nn = int(input())\r\nif(n>=2):\r\n for i in range(1,n):\r\n if(n%i ==0):\r\n count +=1\r\nprint(count)", "n = int(input())\r\nk = int(n**0.5)\r\nt = 1\r\nfor i in range(2, k+1):\r\n if n%i == 0:\r\n if n//i == i:\r\n t += 1\r\n else:\r\n t += 2\r\nprint(t)", "n=int(input())\r\nf=0\r\nfor l in range(1,(n//2)+1):\r\n if (n-l)/l==(n-l)//l:\r\n f+=1\r\nprint(int(f))\r\n\r\n ", "x=0\r\nn=int(input())\r\nfor i in range(1,n//2+1):\r\n\tif n%i==0:\r\n\t\tx+=1\r\nprint(x)", "n = int(input())\r\nsumm = 1\r\nfor i in range(2,n//2+1):\r\n if (n-i)%i==0:\r\n summ = summ+1\r\nprint(summ)", "import sys\r\n#import openai\r\n#import math\r\n#import datetime\r\n#import numpy as np\r\n\r\ndef main():\r\n #n,k = map(int, input().split())\r\n #a = [int(x) for x in sys.stdin.readline().split()]\r\n #ar2 = [[1 for col in range(n)] for row in range(n)]\r\n #t = int(input())\r\n #for i,j in zip(a, b)\r\n n = int(input())\r\n x = 1\r\n c = 0\r\n while x<n:\r\n y = n - x\r\n if y % x == 0:\r\n c += 1\r\n x += 1\r\n print(c)\r\nmain()\r\n", "n=int(input())\r\nx=0\r\nfor i in range (2,int(n/2)+1):\r\n if n%i==0:\r\n x+=1\r\nprint(x+1)", "n=int(input())\r\nd=-1\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n d+=1\r\nprint(d)", "n = int(input())\r\nanswer = 0\r\nfor i in range(1, n):\r\n answer += (n % i == 0)\r\nprint(answer)", "a=int(input())\r\nb=1\r\nfor i in range(2,(a//2)+1):\r\n if (a-i)%i==0:\r\n b=b+1\r\nprint(b)", "n=int(input())\r\nx=0\r\nfor i in range (1,n//2+1):\r\n if n%i==0:\r\n x+=1\r\nprint (x)", "number = int(input())\r\nw = 0\r\nfor i in range(1, number):\r\n if number % i == 0:\r\n w +=1\r\nprint(w)\r\n", "def solve(n: int):\r\n x = 1\r\n if n < 3:\r\n return x\r\n for i in range(2,n):\r\n if (n - i) % i == 0:\r\n x += 1\r\n return x\r\n\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n ans = solve(n)\r\n print(ans)\r\n", "n=int(input())\r\nc=1\r\nfor i in range(2,n//2+1):\r\n if n%i==0:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nli = []\r\nfor i in range(1,n):\r\n\t# li.append(i)\r\n\tif n%i==0:\r\n\t\tli.append(i)\r\nprint(len(li))\r\n\r\n", "n=int(input())\r\nres = len([i for i in range(1,int(n/2)+1) if n%i == 0 and n/i>1])\r\n\r\nprint(res)", "x = int(input())\r\ntotal = 0\r\nfor i in range(1,x):\r\n\tif x % i == 0:\r\n\t\ttotal += 1\r\nprint(total)", "num = int(input())\r\n\r\nres = 0\r\n\r\nfor i in range(1, num // 2 + 1):\r\n if (num - i) % i == 0:\r\n res += 1\r\n\r\nprint(res)", "n=int(input())\r\ncnt=0\r\nfor i in range (1,n):\r\n if (n-i)%i==0:\r\n cnt+=1\r\nprint(cnt)\r\n", "n = int(input())\nprint(sum(n % l == 0 for l in range(1, n)))\n", "'''\r\n ************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM :A. Fafa and his Company\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\nn=int(input())\r\nm=0\r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n m+=1\r\nprint(m)", "import sys\r\n\r\nINF = 2 * 10**18 + 99\r\n\r\nn = int(input().strip())\r\n\r\ncount = 0\r\nfor i in range(1, n):\r\n if n % i == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "n=int(input())\r\nd=-1\r\nfor j in range(1,n+1):\r\n if n%j==0:\r\n d+=1\r\nprint(d)", "a=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,\r\n53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,\r\n127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,\r\n199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,\r\n283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,\r\n383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,\r\n467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,\r\n577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,\r\n661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,\r\n769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,\r\n877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,\r\n983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,\r\n1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,\r\n1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,\r\n1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,\r\n1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,\r\n1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,\r\n1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,\r\n1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,\r\n1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,\r\n1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,\r\n2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,\r\n2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,\r\n2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,\r\n2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,\r\n2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,\r\n2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,\r\n2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,\r\n2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,\r\n3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,\r\n3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,\r\n3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,\r\n3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,\r\n3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,\r\n3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,\r\n3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,\r\n3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,\r\n4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,\r\n4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,\r\n4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,\r\n4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,\r\n4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,\r\n4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,\r\n4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,\r\n4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,\r\n5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,\r\n5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,\r\n5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,\r\n5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,\r\n5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,\r\n5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,\r\n5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,\r\n5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,\r\n6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,\r\n6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,\r\n6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,\r\n6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,\r\n6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,\r\n6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,\r\n6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,\r\n7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,\r\n7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,\r\n7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,\r\n7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,\r\n7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,\r\n7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,\r\n7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,7933,7937,7949,7951,\r\n7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,\r\n8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,8231,8233,8237,8243,\r\n8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,\r\n8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,8521,8527,8537,8539,\r\n8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,\r\n8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,8753,8761,8779,8783,\r\n8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,\r\n8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,9029,9041,9043,9049,\r\n9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,\r\n9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,9311,9319,9323,9337,\r\n9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,\r\n9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,9547,9551,9587,9601,\r\n9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,\r\n9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,9829,9833,9839,9851,\r\n9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,9949,9967,9973,10007,\r\n10009,10037,10039,10061,10067,10069,10079,10091,10093,10099,10103,10111,10133,10139,10141,\r\n10151,10159,10163,10169,10177,10181,10193,10211,10223,10243,10247,10253,10259,10267,10271,\r\n10273,10289,10301,10303,10313,10321,10331,10333,10337,10343,10357,10369,10391,10399,10427,\r\n10429,10433,10453,10457,10459,10463,10477,10487,10499,10501,10513,10529,10531,10559,10567,\r\n10589,10597,10601,10607,10613,10627,10631,10639,10651,10657,10663,10667,10687,10691,10709,\r\n10711,10723,10729,10733,10739,10753,10771,10781,10789,10799,10831,10837,10847,10853,10859,\r\n10861,10867,10883,10889,10891,10903,10909,10937,10939,10949,10957,10973,10979,10987,10993,\r\n11003,11027,11047,11057,11059,11069,11071,11083,11087,11093,11113,11117,11119,11131,11149,\r\n11159,11161,11171,11173,11177,11197,11213,11239,11243,11251,11257,11261,11273,11279,11287,\r\n11299,11311,11317,11321,11329,11351,11353,11369,11383,11393,11399,11411,11423,11437,11443,\r\n11447,11467,11471,11483,11489,11491,11497,11503,11519,11527,11549,11551,11579,11587,11593,\r\n11597,11617,11621,11633,11657,11677,11681,11689,11699,11701,11717,11719,11731,11743,11777,\r\n11779,11783,11789,11801,11807,11813,11821,11827,11831,11833,11839,11863,11867,11887,11897,\r\n11903,11909,11923,11927,11933,11939,11941,11953,11959,11969,11971,11981,11987,12007,12011,\r\n12037,12041,12043,12049,12071,12073,12097,12101,12107,12109,12113,12119,12143,12149,12157,\r\n12161,12163,12197,12203,12211,12227,12239,12241,12251,12253,12263,12269,12277,12281,12289,\r\n12301,12323,12329,12343,12347,12373,12377,12379,12391,12401,12409,12413,12421,12433,12437,\r\n12451,12457,12473,12479,12487,12491,12497,12503,12511,12517,12527,12539,12541,12547,12553,\r\n12569,12577,12583,12589,12601,12611,12613,12619,12637,12641,12647,12653,12659,12671,12689,\r\n12697,12703,12713,12721,12739,12743,12757,12763,12781,12791,12799,12809,12821,12823,12829,\r\n12841,12853,12889,12893,12899,12907,12911,12917,12919,12923,12941,12953,12959,12967,12973,\r\n12979,12983,13001,13003,13007,13009,13033,13037,13043,13049,13063,13093,13099,13103,13109,\r\n13121,13127,13147,13151,13159,13163,13171,13177,13183,13187,13217,13219,13229,13241,13249,\r\n13259,13267,13291,13297,13309,13313,13327,13331,13337,13339,13367,13381,13397,13399,13411,\r\n13417,13421,13441,13451,13457,13463,13469,13477,13487,13499,13513,13523,13537,13553,13567,\r\n13577,13591,13597,13613,13619,13627,13633,13649,13669,13679,13681,13687,13691,13693,13697,\r\n13709,13711,13721,13723,13729,13751,13757,13759,13763,13781,13789,13799,13807,13829,13831,\r\n13841,13859,13873,13877,13879,13883,13901,13903,13907,13913,13921,13931,13933,13963,13967,\r\n13997,13999,14009,14011,14029,14033,14051,14057,14071,14081,14083,14087,14107,14143,14149,\r\n14153,14159,14173,14177,14197,14207,14221,14243,14249,14251,14281,14293,14303,14321,14323,\r\n14327,14341,14347,14369,14387,14389,14401,14407,14411,14419,14423,14431,14437,14447,14449,\r\n14461,14479,14489,14503,14519,14533,14537,14543,14549,14551,14557,14561,14563,14591,14593,\r\n14621,14627,14629,14633,14639,14653,14657,14669,14683,14699,14713,14717,14723,14731,14737,\r\n14741,14747,14753,14759,14767,14771,14779,14783,14797,14813,14821,14827,14831,14843,14851,\r\n14867,14869,14879,14887,14891,14897,14923,14929,14939,14947,14951,14957,14969,14983,15013,\r\n15017,15031,15053,15061,15073,15077,15083,15091,15101,15107,15121,15131,15137,15139,15149,\r\n15161,15173,15187,15193,15199,15217,15227,15233,15241,15259,15263,15269,15271,15277,15287,\r\n15289,15299,15307,15313,15319,15329,15331,15349,15359,15361,15373,15377,15383,15391,15401,\r\n15413,15427,15439,15443,15451,15461,15467,15473,15493,15497,15511,15527,15541,15551,15559,\r\n15569,15581,15583,15601,15607,15619,15629,15641,15643,15647,15649,15661,15667,15671,15679,\r\n15683,15727,15731,15733,15737,15739,15749,15761,15767,15773,15787,15791,15797,15803,15809,\r\n15817,15823,15859,15877,15881,15887,15889,15901,15907,15913,15919,15923,15937,15959,15971,\r\n15973,15991,16001,16007,16033,16057,16061,16063,16067,16069,16073,16087,16091,16097,16103,\r\n16111,16127,16139,16141,16183,16187,16189,16193,16217,16223,16229,16231,16249,16253,16267,\r\n16273,16301,16319,16333,16339,16349,16361,16363,16369,16381,16411,16417,16421,16427,16433,\r\n16447,16451,16453,16477,16481,16487,16493,16519,16529,16547,16553,16561,16567,16573,16603,\r\n16607,16619,16631,16633,16649,16651,16657,16661,16673,16691,16693,16699,16703,16729,16741,\r\n16747,16759,16763,16787,16811,16823,16829,16831,16843,16871,16879,16883,16889,16901,16903,\r\n16921,16927,16931,16937,16943,16963,16979,16981,16987,16993,17011,17021,17027,17029,17033,\r\n17041,17047,17053,17077,17093,17099,17107,17117,17123,17137,17159,17167,17183,17189,17191,\r\n17203,17207,17209,17231,17239,17257,17291,17293,17299,17317,17321,17327,17333,17341,17351,\r\n17359,17377,17383,17387,17389,17393,17401,17417,17419,17431,17443,17449,17467,17471,17477,\r\n17483,17489,17491,17497,17509,17519,17539,17551,17569,17573,17579,17581,17597,17599,17609,\r\n17623,17627,17657,17659,17669,17681,17683,17707,17713,17729,17737,17747,17749,17761,17783,\r\n17789,17791,17807,17827,17837,17839,17851,17863,17881,17891,17903,17909,17911,17921,17923,\r\n17929,17939,17957,17959,17971,17977,17981,17987,17989,18013,18041,18043,18047,18049,18059,\r\n18061,18077,18089,18097,18119,18121,18127,18131,18133,18143,18149,18169,18181,18191,18199,\r\n18211,18217,18223,18229,18233,18251,18253,18257,18269,18287,18289,18301,18307,18311,18313,\r\n18329,18341,18353,18367,18371,18379,18397,18401,18413,18427,18433,18439,18443,18451,18457,\r\n18461,18481,18493,18503,18517,18521,18523,18539,18541,18553,18583,18587,18593,18617,18637,\r\n18661,18671,18679,18691,18701,18713,18719,18731,18743,18749,18757,18773,18787,18793,18797,\r\n18803,18839,18859,18869,18899,18911,18913,18917,18919,18947,18959,18973,18979,19001,19009,\r\n19013,19031,19037,19051,19069,19073,19079,19081,19087,19121,19139,19141,19157,19163,19181,\r\n19183,19207,19211,19213,19219,19231,19237,19249,19259,19267,19273,19289,19301,19309,19319,\r\n19333,19373,19379,19381,19387,19391,19403,19417,19421,19423,19427,19429,19433,19441,19447,\r\n19457,19463,19469,19471,19477,19483,19489,19501,19507,19531,19541,19543,19553,19559,19571,\r\n19577,19583,19597,19603,19609,19661,19681,19687,19697,19699,19709,19717,19727,19739,19751,\r\n19753,19759,19763,19777,19793,19801,19813,19819,19841,19843,19853,19861,19867,19889,19891,\r\n19913,19919,19927,19937,19949,19961,19963,19973,19979,19991,19993,19997,20011,20021,20023,\r\n20029,20047,20051,20063,20071,20089,20101,20107,20113,20117,20123,20129,20143,20147,20149,\r\n20161,20173,20177,20183,20201,20219,20231,20233,20249,20261,20269,20287,20297,20323,20327,\r\n20333,20341,20347,20353,20357,20359,20369,20389,20393,20399,20407,20411,20431,20441,20443,\r\n20477,20479,20483,20507,20509,20521,20533,20543,20549,20551,20563,20593,20599,20611,20627,\r\n20639,20641,20663,20681,20693,20707,20717,20719,20731,20743,20747,20749,20753,20759,20771,\r\n20773,20789,20807,20809,20849,20857,20873,20879,20887,20897,20899,20903,20921,20929,20939,\r\n20947,20959,20963,20981,20983,21001,21011,21013,21017,21019,21023,21031,21059,21061,21067,\r\n21089,21101,21107,21121,21139,21143,21149,21157,21163,21169,21179,21187,21191,21193,21211,\r\n21221,21227,21247,21269,21277,21283,21313,21317,21319,21323,21341,21347,21377,21379,21383,\r\n21391,21397,21401,21407,21419,21433,21467,21481,21487,21491,21493,21499,21503,21517,21521,\r\n21523,21529,21557,21559,21563,21569,21577,21587,21589,21599,21601,21611,21613,21617,21647,\r\n21649,21661,21673,21683,21701,21713,21727,21737,21739,21751,21757,21767,21773,21787,21799,\r\n21803,21817,21821,21839,21841,21851,21859,21863,21871,21881,21893,21911,21929,21937,21943,\r\n21961,21977,21991,21997,22003,22013,22027,22031,22037,22039,22051,22063,22067,22073,22079,\r\n22091,22093,22109,22111,22123,22129,22133,22147,22153,22157,22159,22171,22189,22193,22229,\r\n22247,22259,22271,22273,22277,22279,22283,22291,22303,22307,22343,22349,22367,22369,22381,\r\n22391,22397,22409,22433,22441,22447,22453,22469,22481,22483,22501,22511,22531,22541,22543,\r\n22549,22567,22571,22573,22613,22619,22621,22637,22639,22643,22651,22669,22679,22691,22697,\r\n22699,22709,22717,22721,22727,22739,22741,22751,22769,22777,22783,22787,22807,22811,22817,\r\n22853,22859,22861,22871,22877,22901,22907,22921,22937,22943,22961,22963,22973,22993,23003,\r\n23011,23017,23021,23027,23029,23039,23041,23053,23057,23059,23063,23071,23081,23087,23099,\r\n23117,23131,23143,23159,23167,23173,23189,23197,23201,23203,23209,23227,23251,23269,23279,\r\n23291,23293,23297,23311,23321,23327,23333,23339,23357,23369,23371,23399,23417,23431,23447,\r\n23459,23473,23497,23509,23531,23537,23539,23549,23557,23561,23563,23567,23581,23593,23599,\r\n23603,23609,23623,23627,23629,23633,23663,23669,23671,23677,23687,23689,23719,23741,23743,\r\n23747,23753,23761,23767,23773,23789,23801,23813,23819,23827,23831,23833,23857,23869,23873,\r\n23879,23887,23893,23899,23909,23911,23917,23929,23957,23971,23977,23981,23993,24001,24007,\r\n24019,24023,24029,24043,24049,24061,24071,24077,24083,24091,24097,24103,24107,24109,24113,\r\n24121,24133,24137,24151,24169,24179,24181,24197,24203,24223,24229,24239,24247,24251,24281,\r\n24317,24329,24337,24359,24371,24373,24379,24391,24407,24413,24419,24421,24439,24443,24469,\r\n24473,24481,24499,24509,24517,24527,24533,24547,24551,24571,24593,24611,24623,24631,24659,\r\n24671,24677,24683,24691,24697,24709,24733,24749,24763,24767,24781,24793,24799,24809,24821,\r\n24841,24847,24851,24859,24877,24889,24907,24917,24919,24923,24943,24953,24967,24971,24977,\r\n24979,24989,25013,25031,25033,25037,25057,25073,25087,25097,25111,25117,25121,25127,25147,\r\n25153,25163,25169,25171,25183,25189,25219,25229,25237,25243,25247,25253,25261,25301,25303,\r\n25307,25309,25321,25339,25343,25349,25357,25367,25373,25391,25409,25411,25423,25439,25447,\r\n25453,25457,25463,25469,25471,25523,25537,25541,25561,25577,25579,25583,25589,25601,25603,\r\n25609,25621,25633,25639,25643,25657,25667,25673,25679,25693,25703,25717,25733,25741,25747,\r\n25759,25763,25771,25793,25799,25801,25819,25841,25847,25849,25867,25873,25889,25903,25913,\r\n25919,25931,25933,25939,25943,25951,25969,25981,25997,25999,26003,26017,26021,26029,26041,\r\n26053,26083,26099,26107,26111,26113,26119,26141,26153,26161,26171,26177,26183,26189,26203,\r\n26209,26227,26237,26249,26251,26261,26263,26267,26293,26297,26309,26317,26321,26339,26347,\r\n26357,26371,26387,26393,26399,26407,26417,26423,26431,26437,26449,26459,26479,26489,26497,\r\n26501,26513,26539,26557,26561,26573,26591,26597,26627,26633,26641,26647,26669,26681,26683,\r\n26687,26693,26699,26701,26711,26713,26717,26723,26729,26731,26737,26759,26777,26783,26801,\r\n26813,26821,26833,26839,26849,26861,26863,26879,26881,26891,26893,26903,26921,26927,26947,\r\n26951,26953,26959,26981,26987,26993,27011,27017,27031,27043,27059,27061,27067,27073,27077,\r\n27091,27103,27107,27109,27127,27143,27179,27191,27197,27211,27239,27241,27253,27259,27271,\r\n27277,27281,27283,27299,27329,27337,27361,27367,27397,27407,27409,27427,27431,27437,27449,\r\n27457,27479,27481,27487,27509,27527,27529,27539,27541,27551,27581,27583,27611,27617,27631,\r\n27647,27653,27673,27689,27691,27697,27701,27733,27737,27739,27743,27749,27751,27763,27767,\r\n27773,27779,27791,27793,27799,27803,27809,27817,27823,27827,27847,27851,27883,27893,27901,\r\n27917,27919,27941,27943,27947,27953,27961,27967,27983,27997,28001,28019,28027,28031,28051,\r\n28057,28069,28081,28087,28097,28099,28109,28111,28123,28151,28163,28181,28183,28201,28211,\r\n28219,28229,28277,28279,28283,28289,28297,28307,28309,28319,28349,28351,28387,28393,28403,\r\n28409,28411,28429,28433,28439,28447,28463,28477,28493,28499,28513,28517,28537,28541,28547,\r\n28549,28559,28571,28573,28579,28591,28597,28603,28607,28619,28621,28627,28631,28643,28649,\r\n28657,28661,28663,28669,28687,28697,28703,28711,28723,28729,28751,28753,28759,28771,28789,\r\n28793,28807,28813,28817,28837,28843,28859,28867,28871,28879,28901,28909,28921,28927,28933,\r\n28949,28961,28979,29009,29017,29021,29023,29027,29033,29059,29063,29077,29101,29123,29129,\r\n29131,29137,29147,29153,29167,29173,29179,29191,29201,29207,29209,29221,29231,29243,29251,\r\n29269,29287,29297,29303,29311,29327,29333,29339,29347,29363,29383,29387,29389,29399,29401,\r\n29411,29423,29429,29437,29443,29453,29473,29483,29501,29527,29531,29537,29567,29569,29573,\r\n29581,29587,29599,29611,29629,29633,29641,29663,29669,29671,29683,29717,29723,29741,29753,\r\n29759,29761,29789,29803,29819,29833,29837,29851,29863,29867,29873,29879,29881,29917,29921,\r\n29927,29947,29959,29983,29989,30011,30013,30029,30047,30059,30071,30089,30091,30097,30103,\r\n30109,30113,30119,30133,30137,30139,30161,30169,30181,30187,30197,30203,30211,30223,30241,\r\n30253,30259,30269,30271,30293,30307,30313,30319,30323,30341,30347,30367,30389,30391,30403,\r\n30427,30431,30449,30467,30469,30491,30493,30497,30509,30517,30529,30539,30553,30557,30559,\r\n30577,30593,30631,30637,30643,30649,30661,30671,30677,30689,30697,30703,30707,30713,30727,\r\n30757,30763,30773,30781,30803,30809,30817,30829,30839,30841,30851,30853,30859,30869,30871,\r\n30881,30893,30911,30931,30937,30941,30949,30971,30977,30983,31013,31019,31033,31039,31051,\r\n31063,31069,31079,31081,31091,31121,31123,31139,31147,31151,31153,31159,31177,31181,31183,\r\n31189,31193,31219,31223,31231,31237,31247,31249,31253,31259,31267,31271,31277,31307,31319,\r\n31321,31327,31333,31337,31357,31379,31387,31391,31393,31397,31469,31477,31481,31489,31511,\r\n31513,31517,31531,31541,31543,31547,31567,31573,31583,31601,31607,31627,31643,31649,31657,\r\n31663,31667,31687,31699,31721,31723,31727,31729,31741,31751,31769,31771,31793,31799,31817,\r\n31847,31849,31859,31873,31883,31891,31907,31957,31963,31973,31981,31991,32003,32009,32027,\r\n32029,32051,32057,32059,32063,32069,32077,32083,32089,32099,32117,32119,32141,32143,32159,\r\n32173,32183,32189,32191,32203,32213,32233,32237,32251,32257,32261,32297,32299,32303,32309,\r\n32321,32323,32327,32341,32353,32359,32363,32369,32371,32377,32381,32401,32411,32413,32423,\r\n32429,32441,32443,32467,32479,32491,32497,32503,32507,32531,32533,32537,32561,32563,32569,\r\n32573,32579,32587,32603,32609,32611,32621,32633,32647,32653,32687,32693,32707,32713,32717,\r\n32719,32749,32771,32779,32783,32789,32797,32801,32803,32831,32833,32839,32843,32869,32887,\r\n32909,32911,32917,32933,32939,32941,32957,32969,32971,32983,32987,32993,32999,33013,33023,\r\n33029,33037,33049,33053,33071,33073,33083,33091,33107,33113,33119,33149,33151,33161,33179,\r\n33181,33191,33199,33203,33211,33223,33247,33287,33289,33301,33311,33317,33329,33331,33343,\r\n33347,33349,33353,33359,33377,33391,33403,33409,33413,33427,33457,33461,33469,33479,33487,\r\n33493,33503,33521,33529,33533,33547,33563,33569,33577,33581,33587,33589,33599,33601,33613,\r\n33617,33619,33623,33629,33637,33641,33647,33679,33703,33713,33721,33739,33749,33751,33757,\r\n33767,33769,33773,33791,33797,33809,33811,33827,33829,33851,33857,33863,33871,33889,33893,\r\n33911,33923,33931,33937,33941,33961,33967,33997,34019,34031,34033,34039,34057,34061,34123,\r\n34127,34129,34141,34147,34157,34159,34171,34183,34211,34213,34217,34231,34253,34259,34261,\r\n34267,34273,34283,34297,34301,34303,34313,34319,34327,34337,34351,34361,34367,34369,34381,\r\n34403,34421,34429,34439,34457,34469,34471,34483,34487,34499,34501,34511,34513,34519,34537,\r\n34543,34549,34583,34589,34591,34603,34607,34613,34631,34649,34651,34667,34673,34679,34687,\r\n34693,34703,34721,34729,34739,34747,34757,34759,34763,34781,34807,34819,34841,34843,34847,\r\n34849,34871,34877,34883,34897,34913,34919,34939,34949,34961,34963,34981,35023,35027,35051,\r\n35053,35059,35069,35081,35083,35089,35099,35107,35111,35117,35129,35141,35149,35153,35159,\r\n35171,35201,35221,35227,35251,35257,35267,35279,35281,35291,35311,35317,35323,35327,35339,\r\n35353,35363,35381,35393,35401,35407,35419,35423,35437,35447,35449,35461,35491,35507,35509,\r\n35521,35527,35531,35533,35537,35543,35569,35573,35591,35593,35597,35603,35617,35671,35677,\r\n35729,35731,35747,35753,35759,35771,35797,35801,35803,35809,35831,35837,35839,35851,35863,\r\n35869,35879,35897,35899,35911,35923,35933,35951,35963,35969,35977,35983,35993,35999,36007,\r\n36011,36013,36017,36037,36061,36067,36073,36083,36097,36107,36109,36131,36137,36151,36161,\r\n36187,36191,36209,36217,36229,36241,36251,36263,36269,36277,36293,36299,36307,36313,36319,\r\n36341,36343,36353,36373,36383,36389,36433,36451,36457,36467,36469,36473,36479,36493,36497,\r\n36523,36527,36529,36541,36551,36559,36563,36571,36583,36587,36599,36607,36629,36637,36643,\r\n36653,36671,36677,36683,36691,36697,36709,36713,36721,36739,36749,36761,36767,36779,36781,\r\n36787,36791,36793,36809,36821,36833,36847,36857,36871,36877,36887,36899,36901,36913,36919,\r\n36923,36929,36931,36943,36947,36973,36979,36997,37003,37013,37019,37021,37039,37049,37057,\r\n37061,37087,37097,37117,37123,37139,37159,37171,37181,37189,37199,37201,37217,37223,37243,\r\n37253,37273,37277,37307,37309,37313,37321,37337,37339,37357,37361,37363,37369,37379,37397,\r\n37409,37423,37441,37447,37463,37483,37489,37493,37501,37507,37511,37517,37529,37537,37547,\r\n37549,37561,37567,37571,37573,37579,37589,37591,37607,37619,37633,37643,37649,37657,37663,\r\n37691,37693,37699,37717,37747,37781,37783,37799,37811,37813,37831,37847,37853,37861,37871,\r\n37879,37889,37897,37907,37951,37957,37963,37967,37987,37991,37993,37997,38011,38039,38047,\r\n38053,38069,38083,38113,38119,38149,38153,38167,38177,38183,38189,38197,38201,38219,38231,\r\n38237,38239,38261,38273,38281,38287,38299,38303,38317,38321,38327,38329,38333,38351,38371,\r\n38377,38393,38431,38447,38449,38453,38459,38461,38501,38543,38557,38561,38567,38569,38593,\r\n38603,38609,38611,38629,38639,38651,38653,38669,38671,38677,38693,38699,38707,38711,38713,\r\n38723,38729,38737,38747,38749,38767,38783,38791,38803,38821,38833,38839,38851,38861,38867,\r\n38873,38891,38903,38917,38921,38923,38933,38953,38959,38971,38977,38993,39019,39023,39041,\r\n39043,39047,39079,39089,39097,39103,39107,39113,39119,39133,39139,39157,39161,39163,39181,\r\n39191,39199,39209,39217,39227,39229,39233,39239,39241,39251,39293,39301,39313,39317,39323,\r\n39341,39343,39359,39367,39371,39373,39383,39397,39409,39419,39439,39443,39451,39461,39499,\r\n39503,39509,39511,39521,39541,39551,39563,39569,39581,39607,39619,39623,39631,39659,39667,\r\n39671,39679,39703,39709,39719,39727,39733,39749,39761,39769,39779,39791,39799,39821,39827,\r\n39829,39839,39841,39847,39857,39863,39869,39877,39883,39887,39901,39929,39937,39953,39971,\r\n39979,39983,39989,40009,40013,40031,40037,40039,40063,40087,40093,40099,40111,40123,40127,\r\n40129,40151,40153,40163,40169,40177,40189,40193,40213,40231,40237,40241,40253,40277,40283,\r\n40289,40343,40351,40357,40361,40387,40423,40427,40429,40433,40459,40471,40483,40487,40493,\r\n40499,40507,40519,40529,40531,40543,40559,40577,40583,40591,40597,40609,40627,40637,40639,\r\n40693,40697,40699,40709,40739,40751,40759,40763,40771,40787,40801,40813,40819,40823,40829,\r\n40841,40847,40849,40853,40867,40879,40883,40897,40903,40927,40933,40939,40949,40961,40973,\r\n40993,41011,41017,41023,41039,41047,41051,41057,41077,41081,41113,41117,41131,41141,41143,\r\n41149,41161,41177,41179,41183,41189,41201,41203,41213,41221,41227,41231,41233,41243,41257,\r\n41263,41269,41281,41299,41333,41341,41351,41357,41381,41387,41389,41399,41411,41413,41443,\r\n41453,41467,41479,41491,41507,41513,41519,41521,41539,41543,41549,41579,41593,41597,41603,\r\n41609,41611,41617,41621,41627,41641,41647,41651,41659,41669,41681,41687,41719,41729,41737,\r\n41759,41761,41771,41777,41801,41809,41813,41843,41849,41851,41863,41879,41887,41893,41897,\r\n41903,41911,41927,41941,41947,41953,41957,41959,41969,41981,41983,41999,42013,42017,42019,\r\n42023,42043,42061,42071,42073,42083,42089,42101,42131,42139,42157,42169,42179,42181,42187,\r\n42193,42197,42209,42221,42223,42227,42239,42257,42281,42283,42293,42299,42307,42323,42331,\r\n42337,42349,42359,42373,42379,42391,42397,42403,42407,42409,42433,42437,42443,42451,42457,\r\n42461,42463,42467,42473,42487,42491,42499,42509,42533,42557,42569,42571,42577,42589,42611,\r\n42641,42643,42649,42667,42677,42683,42689,42697,42701,42703,42709,42719,42727,42737,42743,\r\n42751,42767,42773,42787,42793,42797,42821,42829,42839,42841,42853,42859,42863,42899,42901,\r\n42923,42929,42937,42943,42953,42961,42967,42979,42989,43003,43013,43019,43037,43049,43051,\r\n43063,43067,43093,43103,43117,43133,43151,43159,43177,43189,43201,43207,43223,43237,43261,\r\n43271,43283,43291,43313,43319,43321,43331,43391,43397,43399,43403,43411,43427,43441,43451,\r\n43457,43481,43487,43499,43517,43541,43543,43573,43577,43579,43591,43597,43607,43609,43613,\r\n43627,43633,43649,43651,43661,43669,43691,43711,43717,43721,43753,43759,43777,43781,43783,\r\n43787,43789,43793,43801,43853,43867,43889,43891,43913,43933,43943,43951,43961,43963,43969,\r\n43973,43987,43991,43997,44017,44021,44027,44029,44041,44053,44059,44071,44087,44089,44101,\r\n44111,44119,44123,44129,44131,44159,44171,44179,44189,44201,44203,44207,44221,44249,44257,\r\n44263,44267,44269,44273,44279,44281,44293,44351,44357,44371,44381,44383,44389,44417,44449,\r\n44453,44483,44491,44497,44501,44507,44519,44531,44533,44537,44543,44549,44563,44579,44587,\r\n44617,44621,44623,44633,44641,44647,44651,44657,44683,44687,44699,44701,44711,44729,44741,\r\n44753,44771,44773,44777,44789,44797,44809,44819,44839,44843,44851,44867,44879,44887,44893,\r\n44909,44917,44927,44939,44953,44959,44963,44971,44983,44987,45007,45013,45053,45061,45077,\r\n45083,45119,45121,45127,45131,45137,45139,45161,45179,45181,45191,45197,45233,45247,45259,\r\n45263,45281,45289,45293,45307,45317,45319,45329,45337,45341,45343,45361,45377,45389,45403,\r\n45413,45427,45433,45439,45481,45491,45497,45503,45523,45533,45541,45553,45557,45569,45587,\r\n45589,45599,45613,45631,45641,45659,45667,45673,45677,45691,45697,45707,45737,45751,45757,\r\n45763,45767,45779,45817,45821,45823,45827,45833,45841,45853,45863,45869,45887,45893,45943,\r\n45949,45953,45959,45971,45979,45989,46021,46027,46049,46051,46061,46073,46091,46093,46099,\r\n46103,46133,46141,46147,46153,46171,46181,46183,46187,46199,46219,46229,46237,46261,46271,\r\n46273,46279,46301,46307,46309,46327,46337,46349,46351,46381,46399,46411,46439,46441,46447,\r\n46451,46457,46471,46477,46489,46499,46507,46511,46523,46549,46559,46567,46573,46589,46591,\r\n46601,46619,46633,46639,46643,46649,46663,46679,46681,46687,46691,46703,46723,46727,46747,\r\n46751,46757,46769,46771,46807,46811,46817,46819,46829,46831,46853,46861,46867,46877,46889,\r\n46901,46919,46933,46957,46993,46997,47017,47041,47051,47057,47059,47087,47093,47111,47119,\r\n47123,47129,47137,47143,47147,47149,47161,47189,47207,47221,47237,47251,47269,47279,47287,\r\n47293,47297,47303,47309,47317,47339,47351,47353,47363,47381,47387,47389,47407,47417,47419,\r\n47431,47441,47459,47491,47497,47501,47507,47513,47521,47527,47533,47543,47563,47569,47581,\r\n47591,47599,47609,47623,47629,47639,47653,47657,47659,47681,47699,47701,47711,47713,47717,\r\n47737,47741,47743,47777,47779,47791,47797,47807,47809,47819,47837,47843,47857,47869,47881,\r\n47903,47911,47917,47933,47939,47947,47951,47963,47969,47977,47981,48017,48023,48029,48049,\r\n48073,48079,48091,48109,48119,48121,48131,48157,48163,48179,48187,48193,48197,48221,48239,\r\n48247,48259,48271,48281,48299,48311,48313,48337,48341,48353,48371,48383,48397,48407,48409,\r\n48413,48437,48449,48463,48473,48479,48481,48487,48491,48497,48523,48527,48533,48539,48541,\r\n48563,48571,48589,48593,48611,48619,48623,48647,48649,48661,48673,48677,48679,48731,48733,\r\n48751,48757,48761,48767,48779,48781,48787,48799,48809,48817,48821,48823,48847,48857,48859,\r\n48869,48871,48883,48889,48907,48947,48953,48973,48989,48991,49003,49009,49019,49031,49033,\r\n49037,49043,49057,49069,49081,49103,49109,49117,49121,49123,49139,49157,49169,49171,49177,\r\n49193,49199,49201,49207,49211,49223,49253,49261,49277,49279,49297,49307,49331,49333,49339,\r\n49363,49367,49369,49391,49393,49409,49411,49417,49429,49433,49451,49459,49463,49477,49481,\r\n49499,49523,49529,49531,49537,49547,49549,49559,49597,49603,49613,49627,49633,49639,49663,\r\n49667,49669,49681,49697,49711,49727,49739,49741,49747,49757,49783,49787,49789,49801,49807,\r\n49811,49823,49831,49843,49853,49871,49877,49891,49919,49921,49927,49937,49939,49943,49957,\r\n49991,49993,49999,50021,50023,50033,50047,50051,50053,50069,50077,50087,50093,50101,50111,\r\n50119,50123,50129,50131,50147,50153,50159,50177,50207,50221,50227,50231,50261,50263,50273,\r\n50287,50291,50311,50321,50329,50333,50341,50359,50363,50377,50383,50387,50411,50417,50423,\r\n50441,50459,50461,50497,50503,50513,50527,50539,50543,50549,50551,50581,50587,50591,50593,\r\n50599,50627,50647,50651,50671,50683,50707,50723,50741,50753,50767,50773,50777,50789,50821,\r\n50833,50839,50849,50857,50867,50873,50891,50893,50909,50923,50929,50951,50957,50969,50971,\r\n50989,50993,51001,51031,51043,51047,51059,51061,51071,51109,51131,51133,51137,51151,51157,\r\n51169,51193,51197,51199,51203,51217,51229,51239,51241,51257,51263,51283,51287,51307,51329,\r\n51341,51343,51347,51349,51361,51383,51407,51413,51419,51421,51427,51431,51437,51439,51449,\r\n51461,51473,51479,51481,51487,51503,51511,51517,51521,51539,51551,51563,51577,51581,51593,\r\n51599,51607,51613,51631,51637,51647,51659,51673,51679,51683,51691,51713,51719,51721,51749,\r\n51767,51769,51787,51797,51803,51817,51827,51829,51839,51853,51859,51869,51871,51893,51899,\r\n51907,51913,51929,51941,51949,51971,51973,51977,51991,52009,52021,52027,52051,52057,52067,\r\n52069,52081,52103,52121,52127,52147,52153,52163,52177,52181,52183,52189,52201,52223,52237,\r\n52249,52253,52259,52267,52289,52291,52301,52313,52321,52361,52363,52369,52379,52387,52391,\r\n52433,52453,52457,52489,52501,52511,52517,52529,52541,52543,52553,52561,52567,52571,52579,\r\n52583,52609,52627,52631,52639,52667,52673,52691,52697,52709,52711,52721,52727,52733,52747,\r\n52757,52769,52783,52807,52813,52817,52837,52859,52861,52879,52883,52889,52901,52903,52919,\r\n52937,52951,52957,52963,52967,52973,52981,52999,53003,53017,53047,53051,53069,53077,53087,\r\n53089,53093,53101,53113,53117,53129,53147,53149,53161,53171,53173,53189,53197,53201,53231,\r\n53233,53239,53267,53269,53279,53281,53299,53309,53323,53327,53353,53359,53377,53381,53401,\r\n53407,53411,53419,53437,53441,53453,53479,53503,53507,53527,53549,53551,53569,53591,53593,\r\n53597,53609,53611,53617,53623,53629,53633,53639,53653,53657,53681,53693,53699,53717,53719,\r\n53731,53759,53773,53777,53783,53791,53813,53819,53831,53849,53857,53861,53881,53887,53891,\r\n53897,53899,53917,53923,53927,53939,53951,53959,53987,53993,54001,54011,54013,54037,54049,\r\n54059,54083,54091,54101,54121,54133,54139,54151,54163,54167,54181,54193,54217,54251,54269,\r\n54277,54287,54293,54311,54319,54323,54331,54347,54361,54367,54371,54377,54401,54403,54409,\r\n54413,54419,54421,54437,54443,54449,54469,54493,54497,54499,54503,54517,54521,54539,54541,\r\n54547,54559,54563,54577,54581,54583,54601,54617,54623,54629,54631,54647,54667,54673,54679,\r\n54709,54713,54721,54727,54751,54767,54773,54779,54787,54799,54829,54833,54851,54869,54877,\r\n54881,54907,54917,54919,54941,54949,54959,54973,54979,54983,55001,55009,55021,55049,55051,\r\n55057,55061,55073,55079,55103,55109,55117,55127,55147,55163,55171,55201,55207,55213,55217,\r\n55219,55229,55243,55249,55259,55291,55313,55331,55333,55337,55339,55343,55351,55373,55381,\r\n55399,55411,55439,55441,55457,55469,55487,55501,55511,55529,55541,55547,55579,55589,55603,\r\n55609,55619,55621,55631,55633,55639,55661,55663,55667,55673,55681,55691,55697,55711,55717,\r\n55721,55733,55763,55787,55793,55799,55807,55813,55817,55819,55823,55829,55837,55843,55849,\r\n55871,55889,55897,55901,55903,55921,55927,55931,55933,55949,55967,55987,55997,56003,56009,\r\n56039,56041,56053,56081,56087,56093,56099,56101,56113,56123,56131,56149,56167,56171,56179,\r\n56197,56207,56209,56237,56239,56249,56263,56267,56269,56299,56311,56333,56359,56369,56377,\r\n56383,56393,56401,56417,56431,56437,56443,56453,56467,56473,56477,56479,56489,56501,56503,\r\n56509,56519,56527,56531,56533,56543,56569,56591,56597,56599,56611,56629,56633,56659,56663,\r\n56671,56681,56687,56701,56711,56713,56731,56737,56747,56767,56773,56779,56783,56807,56809,\r\n56813,56821,56827,56843,56857,56873,56891,56893,56897,56909,56911,56921,56923,56929,56941,\r\n56951,56957,56963,56983,56989,56993,56999,57037,57041,57047,57059,57073,57077,57089,57097,\r\n57107,57119,57131,57139,57143,57149,57163,57173,57179,57191,57193,57203,57221,57223,57241,\r\n57251,57259,57269,57271,57283,57287,57301,57329,57331,57347,57349,57367,57373,57383,57389,\r\n57397,57413,57427,57457,57467,57487,57493,57503,57527,57529,57557,57559,57571,57587,57593,\r\n57601,57637,57641,57649,57653,57667,57679,57689,57697,57709,57713,57719,57727,57731,57737,\r\n57751,57773,57781,57787,57791,57793,57803,57809,57829,57839,57847,57853,57859,57881,57899,\r\n57901,57917,57923,57943,57947,57973,57977,57991,58013,58027,58031,58043,58049,58057,58061,\r\n58067,58073,58099,58109,58111,58129,58147,58151,58153,58169,58171,58189,58193,58199,58207,\r\n58211,58217,58229,58231,58237,58243,58271,58309,58313,58321,58337,58363,58367,58369,58379,\r\n58391,58393,58403,58411,58417,58427,58439,58441,58451,58453,58477,58481,58511,58537,58543,\r\n58549,58567,58573,58579,58601,58603,58613,58631,58657,58661,58679,58687,58693,58699,58711,\r\n58727,58733,58741,58757,58763,58771,58787,58789,58831,58889,58897,58901,58907,58909,58913,\r\n58921,58937,58943,58963,58967,58979,58991,58997,59009,59011,59021,59023,59029,59051,59053,\r\n59063,59069,59077,59083,59093,59107,59113,59119,59123,59141,59149,59159,59167,59183,59197,\r\n59207,59209,59219,59221,59233,59239,59243,59263,59273,59281,59333,59341,59351,59357,59359,\r\n59369,59377,59387,59393,59399,59407,59417,59419,59441,59443,59447,59453,59467,59471,59473,\r\n59497,59509,59513,59539,59557,59561,59567,59581,59611,59617,59621,59627,59629,59651,59659,\r\n59663,59669,59671,59693,59699,59707,59723,59729,59743,59747,59753,59771,59779,59791,59797,\r\n59809,59833,59863,59879,59887,59921,59929,59951,59957,59971,59981,59999,60013,60017,60029,\r\n60037,60041,60077,60083,60089,60091,60101,60103,60107,60127,60133,60139,60149,60161,60167,\r\n60169,60209,60217,60223,60251,60257,60259,60271,60289,60293,60317,60331,60337,60343,60353,\r\n60373,60383,60397,60413,60427,60443,60449,60457,60493,60497,60509,60521,60527,60539,60589,\r\n60601,60607,60611,60617,60623,60631,60637,60647,60649,60659,60661,60679,60689,60703,60719,\r\n60727,60733,60737,60757,60761,60763,60773,60779,60793,60811,60821,60859,60869,60887,60889,\r\n60899,60901,60913,60917,60919,60923,60937,60943,60953,60961,61001,61007,61027,61031,61043,\r\n61051,61057,61091,61099,61121,61129,61141,61151,61153,61169,61211,61223,61231,61253,61261,\r\n61283,61291,61297,61331,61333,61339,61343,61357,61363,61379,61381,61403,61409,61417,61441,\r\n61463,61469,61471,61483,61487,61493,61507,61511,61519,61543,61547,61553,61559,61561,61583,\r\n61603,61609,61613,61627,61631,61637,61643,61651,61657,61667,61673,61681,61687,61703,61717,\r\n61723,61729,61751,61757,61781,61813,61819,61837,61843,61861,61871,61879,61909,61927,61933,\r\n61949,61961,61967,61979,61981,61987,61991,62003,62011,62017,62039,62047,62053,62057,62071,\r\n62081,62099,62119,62129,62131,62137,62141,62143,62171,62189,62191,62201,62207,62213,62219,\r\n62233,62273,62297,62299,62303,62311,62323,62327,62347,62351,62383,62401,62417,62423,62459,\r\n62467,62473,62477,62483,62497,62501,62507,62533,62539,62549,62563,62581,62591,62597,62603,\r\n62617,62627,62633,62639,62653,62659,62683,62687,62701,62723,62731,62743,62753,62761,62773,\r\n62791,62801,62819,62827,62851,62861,62869,62873,62897,62903,62921,62927,62929,62939,62969,\r\n62971,62981,62983,62987,62989,63029,63031,63059,63067,63073,63079,63097,63103,63113,63127,\r\n63131,63149,63179,63197,63199,63211,63241,63247,63277,63281,63299,63311,63313,63317,63331,\r\n63337,63347,63353,63361,63367,63377,63389,63391,63397,63409,63419,63421,63439,63443,63463,\r\n63467,63473,63487,63493,63499,63521,63527,63533,63541,63559,63577,63587,63589,63599,63601,\r\n63607,63611,63617,63629,63647,63649,63659,63667,63671,63689,63691,63697,63703,63709,63719,\r\n63727,63737,63743,63761,63773,63781,63793,63799,63803,63809,63823,63839,63841,63853,63857,\r\n63863,63901,63907,63913,63929,63949,63977,63997,64007,64013,64019,64033,64037,64063,64067,\r\n64081,64091,64109,64123,64151,64153,64157,64171,64187,64189,64217,64223,64231,64237,64271,\r\n64279,64283,64301,64303,64319,64327,64333,64373,64381,64399,64403,64433,64439,64451,64453,\r\n64483,64489,64499,64513,64553,64567,64577,64579,64591,64601,64609,64613,64621,64627,64633,\r\n64661,64663,64667,64679,64693,64709,64717,64747,64763,64781,64783,64793,64811,64817,64849,\r\n64853,64871,64877,64879,64891,64901,64919,64921,64927,64937,64951,64969,64997,65003,65011,\r\n65027,65029,65033,65053,65063,65071,65089,65099,65101,65111,65119,65123,65129,65141,65147,\r\n65167,65171,65173,65179,65183,65203,65213,65239,65257,65267,65269,65287,65293,65309,65323,\r\n65327,65353,65357,65371,65381,65393,65407,65413,65419,65423,65437,65447,65449,65479,65497,\r\n65519,65521,65537,65539,65543,65551,65557,65563,65579,65581,65587,65599,65609,65617,65629,\r\n65633,65647,65651,65657,65677,65687,65699,65701,65707,65713,65717,65719,65729,65731,65761,\r\n65777,65789,65809,65827,65831,65837,65839,65843,65851,65867,65881,65899,65921,65927,65929,\r\n65951,65957,65963,65981,65983,65993,66029,66037,66041,66047,66067,66071,66083,66089,66103,\r\n66107,66109,66137,66161,66169,66173,66179,66191,66221,66239,66271,66293,66301,66337,66343,\r\n66347,66359,66361,66373,66377,66383,66403,66413,66431,66449,66457,66463,66467,66491,66499,\r\n66509,66523,66529,66533,66541,66553,66569,66571,66587,66593,66601,66617,66629,66643,66653,\r\n66683,66697,66701,66713,66721,66733,66739,66749,66751,66763,66791,66797,66809,66821,66841,\r\n66851,66853,66863,66877,66883,66889,66919,66923,66931,66943,66947,66949,66959,66973,66977,\r\n67003,67021,67033,67043,67049,67057,67061,67073,67079,67103,67121,67129,67139,67141,67153,\r\n67157,67169,67181,67187,67189,67211,67213,67217,67219,67231,67247,67261,67271,67273,67289,\r\n67307,67339,67343,67349,67369,67391,67399,67409,67411,67421,67427,67429,67433,67447,67453,\r\n67477,67481,67489,67493,67499,67511,67523,67531,67537,67547,67559,67567,67577,67579,67589,\r\n67601,67607,67619,67631,67651,67679,67699,67709,67723,67733,67741,67751,67757,67759,67763,\r\n67777,67783,67789,67801,67807,67819,67829,67843,67853,67867,67883,67891,67901,67927,67931,\r\n67933,67939,67943,67957,67961,67967,67979,67987,67993,68023,68041,68053,68059,68071,68087,\r\n68099,68111,68113,68141,68147,68161,68171,68207,68209,68213,68219,68227,68239,68261,68279,\r\n68281,68311,68329,68351,68371,68389,68399,68437,68443,68447,68449,68473,68477,68483,68489,\r\n68491,68501,68507,68521,68531,68539,68543,68567,68581,68597,68611,68633,68639,68659,68669,\r\n68683,68687,68699,68711,68713,68729,68737,68743,68749,68767,68771,68777,68791,68813,68819,\r\n68821,68863,68879,68881,68891,68897,68899,68903,68909,68917,68927,68947,68963,68993,69001,\r\n69011,69019,69029,69031,69061,69067,69073,69109,69119,69127,69143,69149,69151,69163,69191,\r\n69193,69197,69203,69221,69233,69239,69247,69257,69259,69263,69313,69317,69337,69341,69371,\r\n69379,69383,69389,69401,69403,69427,69431,69439,69457,69463,69467,69473,69481,69491,69493,\r\n69497,69499,69539,69557,69593,69623,69653,69661,69677,69691,69697,69709,69737,69739,69761,\r\n69763,69767,69779,69809,69821,69827,69829,69833,69847,69857,69859,69877,69899,69911,69929,\r\n69931,69941,69959,69991,69997,70001,70003,70009,70019,70039,70051,70061,70067,70079,70099,\r\n70111,70117,70121,70123,70139,70141,70157,70163,70177,70181,70183,70199,70201,70207,70223,\r\n70229,70237,70241,70249,70271,70289,70297,70309,70313,70321,70327,70351,70373,70379,70381,\r\n70393,70423,70429,70439,70451,70457,70459,70481,70487,70489,70501,70507,70529,70537,70549,\r\n70571,70573,70583,70589,70607,70619,70621,70627,70639,70657,70663,70667,70687,70709,70717,\r\n70729,70753,70769,70783,70793,70823,70841,70843,70849,70853,70867,70877,70879,70891,70901,\r\n70913,70919,70921,70937,70949,70951,70957,70969,70979,70981,70991,70997,70999,71011,71023,\r\n71039,71059,71069,71081,71089,71119,71129,71143,71147,71153,71161,71167,71171,71191,71209,\r\n71233,71237,71249,71257,71261,71263,71287,71293,71317,71327,71329,71333,71339,71341,71347,\r\n71353,71359,71363,71387,71389,71399,71411,71413,71419,71429,71437,71443,71453,71471,71473,\r\n71479,71483,71503,71527,71537,71549,71551,71563,71569,71593,71597,71633,71647,71663,71671,\r\n71693,71699,71707,71711,71713,71719,71741,71761,71777,71789,71807,71809,71821,71837,71843,\r\n71849,71861,71867,71879,71881,71887,71899,71909,71917,71933,71941,71947,71963,71971,71983,\r\n71987,71993,71999,72019,72031,72043,72047,72053,72073,72077,72089,72091,72101,72103,72109,\r\n72139,72161,72167,72169,72173,72211,72221,72223,72227,72229,72251,72253,72269,72271,72277,\r\n72287,72307,72313,72337,72341,72353,72367,72379,72383,72421,72431,72461,72467,72469,72481,\r\n72493,72497,72503,72533,72547,72551,72559,72577,72613,72617,72623,72643,72647,72649,72661,\r\n72671,72673,72679,72689,72701,72707,72719,72727,72733,72739,72763,72767,72797,72817,72823,\r\n72859,72869,72871,72883,72889,72893,72901,72907,72911,72923,72931,72937,72949,72953,72959,\r\n72973,72977,72997,73009,73013,73019,73037,73039,73043,73061,73063,73079,73091,73121,73127,\r\n73133,73141,73181,73189,73237,73243,73259,73277,73291,73303,73309,73327,73331,73351,73361,\r\n73363,73369,73379,73387,73417,73421,73433,73453,73459,73471,73477,73483,73517,73523,73529,\r\n73547,73553,73561,73571,73583,73589,73597,73607,73609,73613,73637,73643,73651,73673,73679,\r\n73681,73693,73699,73709,73721,73727,73751,73757,73771,73783,73819,73823,73847,73849,73859,\r\n73867,73877,73883,73897,73907,73939,73943,73951,73961,73973,73999,74017,74021,74027,74047,\r\n74051,74071,74077,74093,74099,74101,74131,74143,74149,74159,74161,74167,74177,74189,74197,\r\n74201,74203,74209,74219,74231,74257,74279,74287,74293,74297,74311,74317,74323,74353,74357,\r\n74363,74377,74381,74383,74411,74413,74419,74441,74449,74453,74471,74489,74507,74509,74521,\r\n74527,74531,74551,74561,74567,74573,74587,74597,74609,74611,74623,74653,74687,74699,74707,\r\n74713,74717,74719,74729,74731,74747,74759,74761,74771,74779,74797,74821,74827,74831,74843,\r\n74857,74861,74869,74873,74887,74891,74897,74903,74923,74929,74933,74941,74959,75011,75013,\r\n75017,75029,75037,75041,75079,75083,75109,75133,75149,75161,75167,75169,75181,75193,75209,\r\n75211,75217,75223,75227,75239,75253,75269,75277,75289,75307,75323,75329,75337,75347,75353,\r\n75367,75377,75389,75391,75401,75403,75407,75431,75437,75479,75503,75511,75521,75527,75533,\r\n75539,75541,75553,75557,75571,75577,75583,75611,75617,75619,75629,75641,75653,75659,75679,\r\n75683,75689,75703,75707,75709,75721,75731,75743,75767,75773,75781,75787,75793,75797,75821,\r\n75833,75853,75869,75883,75913,75931,75937,75941,75967,75979,75983,75989,75991,75997,76001,\r\n76003,76031,76039,76079,76081,76091,76099,76103,76123,76129,76147,76157,76159,76163,76207,\r\n76213,76231,76243,76249,76253,76259,76261,76283,76289,76303,76333,76343,76367,76369,76379,\r\n76387,76403,76421,76423,76441,76463,76471,76481,76487,76493,76507,76511,76519,76537,76541,\r\n76543,76561,76579,76597,76603,76607,76631,76649,76651,76667,76673,76679,76697,76717,76733,\r\n76753,76757,76771,76777,76781,76801,76819,76829,76831,76837,76847,76871,76873,76883,76907,\r\n76913,76919,76943,76949,76961,76963,76991,77003,77017,77023,77029,77041,77047,77069,77081,\r\n77093,77101,77137,77141,77153,77167,77171,77191,77201,77213,77237,77239,77243,77249,77261,\r\n77263,77267,77269,77279,77291,77317,77323,77339,77347,77351,77359,77369,77377,77383,77417,\r\n77419,77431,77447,77471,77477,77479,77489,77491,77509,77513,77521,77527,77543,77549,77551,\r\n77557,77563,77569,77573,77587,77591,77611,77617,77621,77641,77647,77659,77681,77687,77689,\r\n77699,77711,77713,77719,77723,77731,77743,77747,77761,77773,77783,77797,77801,77813,77839,\r\n77849,77863,77867,77893,77899,77929,77933,77951,77969,77977,77983,77999,78007,78017,78031,\r\n78041,78049,78059,78079,78101,78121,78137,78139,78157,78163,78167,78173,78179,78191,78193,\r\n78203,78229,78233,78241,78259,78277,78283,78301,78307,78311,78317,78341,78347,78367,78401,\r\n78427,78437,78439,78467,78479,78487,78497,78509,78511,78517,78539,78541,78553,78569,78571,\r\n78577,78583,78593,78607,78623,78643,78649,78653,78691,78697,78707,78713,78721,78737,78779,\r\n78781,78787,78791,78797,78803,78809,78823,78839,78853,78857,78877,78887,78889,78893,78901,\r\n78919,78929,78941,78977,78979,78989,79031,79039,79043,79063,79087,79103,79111,79133,79139,\r\n79147,79151,79153,79159,79181,79187,79193,79201,79229,79231,79241,79259,79273,79279,79283,\r\n79301,79309,79319,79333,79337,79349,79357,79367,79379,79393,79397,79399,79411,79423,79427,\r\n79433,79451,79481,79493,79531,79537,79549,79559,79561,79579,79589,79601,79609,79613,79621,\r\n79627,79631,79633,79657,79669,79687,79691,79693,79697,79699,79757,79769,79777,79801,79811,\r\n79813,79817,79823,79829,79841,79843,79847,79861,79867,79873,79889,79901,79903,79907,79939,\r\n79943,79967,79973,79979,79987,79997,79999,80021,80039,80051,80071,80077,80107,80111,80141,\r\n80147,80149,80153,80167,80173,80177,80191,80207,80209,80221,80231,80233,80239,80251,80263,\r\n80273,80279,80287,80309,80317,80329,80341,80347,80363,80369,80387,80407,80429,80447,80449,\r\n80471,80473,80489,80491,80513,80527,80537,80557,80567,80599,80603,80611,80621,80627,80629,\r\n80651,80657,80669,80671,80677,80681,80683,80687,80701,80713,80737,80747,80749,80761,80777,\r\n80779,80783,80789,80803,80809,80819,80831,80833,80849,80863,80897,80909,80911,80917,80923,\r\n80929,80933,80953,80963,80989,81001,81013,81017,81019,81023,81031,81041,81043,81047,81049,\r\n81071,81077,81083,81097,81101,81119,81131,81157,81163,81173,81181,81197,81199,81203,81223,\r\n81233,81239,81281,81283,81293,81299,81307,81331,81343,81349,81353,81359,81371,81373,81401,\r\n81409,81421,81439,81457,81463,81509,81517,81527,81533,81547,81551,81553,81559,81563,81569,\r\n81611,81619,81629,81637,81647,81649,81667,81671,81677,81689,81701,81703,81707,81727,81737,\r\n81749,81761,81769,81773,81799,81817,81839,81847,81853,81869,81883,81899,81901,81919,81929,\r\n81931,81937,81943,81953,81967,81971,81973,82003,82007,82009,82013,82021,82031,82037,82039,\r\n82051,82067,82073,82129,82139,82141,82153,82163,82171,82183,82189,82193,82207,82217,82219,\r\n82223,82231,82237,82241,82261,82267,82279,82301,82307,82339,82349,82351,82361,82373,82387,\r\n82393,82421,82457,82463,82469,82471,82483,82487,82493,82499,82507,82529,82531,82549,82559,\r\n82561,82567,82571,82591,82601,82609,82613,82619,82633,82651,82657,82699,82721,82723,82727,\r\n82729,82757,82759,82763,82781,82787,82793,82799,82811,82813,82837,82847,82883,82889,82891,\r\n82903,82913,82939,82963,82981,82997,83003,83009,83023,83047,83059,83063,83071,83077,83089,\r\n83093,83101,83117,83137,83177,83203,83207,83219,83221,83227,83231,83233,83243,83257,83267,\r\n83269,83273,83299,83311,83339,83341,83357,83383,83389,83399,83401,83407,83417,83423,83431,\r\n83437,83443,83449,83459,83471,83477,83497,83537,83557,83561,83563,83579,83591,83597,83609,\r\n83617,83621,83639,83641,83653,83663,83689,83701,83717,83719,83737,83761,83773,83777,83791,\r\n83813,83833,83843,83857,83869,83873,83891,83903,83911,83921,83933,83939,83969,83983,83987,\r\n84011,84017,84047,84053,84059,84061,84067,84089,84121,84127,84131,84137,84143,84163,84179,\r\n84181,84191,84199,84211,84221,84223,84229,84239,84247,84263,84299,84307,84313,84317,84319,\r\n84347,84349,84377,84389,84391,84401,84407,84421,84431,84437,84443,84449,84457,84463,84467,\r\n84481,84499,84503,84509,84521,84523,84533,84551,84559,84589,84629,84631,84649,84653,84659,\r\n84673,84691,84697,84701,84713,84719,84731,84737,84751,84761,84787,84793,84809,84811,84827,\r\n84857,84859,84869,84871,84913,84919,84947,84961,84967,84977,84979,84991,85009,85021,85027,\r\n85037,85049,85061,85081,85087,85091,85093,85103,85109,85121,85133,85147,85159,85193,85199,\r\n85201,85213,85223,85229,85237,85243,85247,85259,85297,85303,85313,85331,85333,85361,85363,\r\n85369,85381,85411,85427,85429,85439,85447,85451,85453,85469,85487,85513,85517,85523,85531,\r\n85549,85571,85577,85597,85601,85607,85619,85621,85627,85639,85643,85661,85667,85669,85691,\r\n85703,85711,85717,85733,85751,85781,85793,85817,85819,85829,85831,85837,85843,85847,85853,\r\n85889,85903,85909,85931,85933,85991,85999,86011,86017,86027,86029,86069,86077,86083,86111,\r\n86113,86117,86131,86137,86143,86161,86171,86179,86183,86197,86201,86209,86239,86243,86249,\r\n86257,86263,86269,86287,86291,86293,86297,86311,86323,86341,86351,86353,86357,86369,86371,\r\n86381,86389,86399,86413,86423,86441,86453,86461,86467,86477,86491,86501,86509,86531,86533,\r\n86539,86561,86573,86579,86587,86599,86627,86629,86677,86689,86693,86711,86719,86729,86743,\r\n86753,86767,86771,86783,86813,86837,86843,86851,86857,86861,86869,86923,86927,86929,86939,\r\n86951,86959,86969,86981,86993,87011,87013,87037,87041,87049,87071,87083,87103,87107,87119,\r\n87121,87133,87149,87151,87179,87181,87187,87211,87221,87223,87251,87253,87257,87277,87281,\r\n87293,87299,87313,87317,87323,87337,87359,87383,87403,87407,87421,87427,87433,87443,87473,\r\n87481,87491,87509,87511,87517,87523,87539,87541,87547,87553,87557,87559,87583,87587,87589,\r\n87613,87623,87629,87631,87641,87643,87649,87671,87679,87683,87691,87697,87701,87719,87721,\r\n87739,87743,87751,87767,87793,87797,87803,87811,87833,87853,87869,87877,87881,87887,87911,\r\n87917,87931,87943,87959,87961,87973,87977,87991,88001,88003,88007,88019,88037,88069,88079,\r\n88093,88117,88129,88169,88177,88211,88223,88237,88241,88259,88261,88289,88301,88321,88327,\r\n88337,88339,88379,88397,88411,88423,88427,88463,88469,88471,88493,88499,88513,88523,88547,\r\n88589,88591,88607,88609,88643,88651,88657,88661,88663,88667,88681,88721,88729,88741,88747,\r\n88771,88789,88793,88799,88801,88807,88811,88813,88817,88819,88843,88853,88861,88867,88873,\r\n88883,88897,88903,88919,88937,88951,88969,88993,88997,89003,89009,89017,89021,89041,89051,\r\n89057,89069,89071,89083,89087,89101,89107,89113,89119,89123,89137,89153,89189,89203,89209,\r\n89213,89227,89231,89237,89261,89269,89273,89293,89303,89317,89329,89363,89371,89381,89387,\r\n89393,89399,89413,89417,89431,89443,89449,89459,89477,89491,89501,89513,89519,89521,89527,\r\n89533,89561,89563,89567,89591,89597,89599,89603,89611,89627,89633,89653,89657,89659,89669,\r\n89671,89681,89689,89753,89759,89767,89779,89783,89797,89809,89819,89821,89833,89839,89849,\r\n89867,89891,89897,89899,89909,89917,89923,89939,89959,89963,89977,89983,89989,90001,90007,\r\n90011,90017,90019,90023,90031,90053,90059,90067,90071,90073,90089,90107,90121,90127,90149,\r\n90163,90173,90187,90191,90197,90199,90203,90217,90227,90239,90247,90263,90271,90281,90289,\r\n90313,90353,90359,90371,90373,90379,90397,90401,90403,90407,90437,90439,90469,90473,90481,\r\n90499,90511,90523,90527,90529,90533,90547,90583,90599,90617,90619,90631,90641,90647,90659,\r\n90677,90679,90697,90703,90709,90731,90749,90787,90793,90803,90821,90823,90833,90841,90847,\r\n90863,90887,90901,90907,90911,90917,90931,90947,90971,90977,90989,90997,91009,91019,91033,\r\n91079,91081,91097,91099,91121,91127,91129,91139,91141,91151,91153,91159,91163,91183,91193,\r\n91199,91229,91237,91243,91249,91253,91283,91291,91297,91303,91309,91331,91367,91369,91373,\r\n91381,91387,91393,91397,91411,91423,91433,91453,91457,91459,91463,91493,91499,91513,91529,\r\n91541,91571,91573,91577,91583,91591,91621,91631,91639,91673,91691,91703,91711,91733,91753,\r\n91757,91771,91781,91801,91807,91811,91813,91823,91837,91841,91867,91873,91909,91921,91939,\r\n91943,91951,91957,91961,91967,91969,91997,92003,92009,92033,92041,92051,92077,92083,92107,\r\n92111,92119,92143,92153,92173,92177,92179,92189,92203,92219,92221,92227,92233,92237,92243,\r\n92251,92269,92297,92311,92317,92333,92347,92353,92357,92363,92369,92377,92381,92383,92387,\r\n92399,92401,92413,92419,92431,92459,92461,92467,92479,92489,92503,92507,92551,92557,92567,\r\n92569,92581,92593,92623,92627,92639,92641,92647,92657,92669,92671,92681,92683,92693,92699,\r\n92707,92717,92723,92737,92753,92761,92767,92779,92789,92791,92801,92809,92821,92831,92849,\r\n92857,92861,92863,92867,92893,92899,92921,92927,92941,92951,92957,92959,92987,92993,93001,\r\n93047,93053,93059,93077,93083,93089,93097,93103,93113,93131,93133,93139,93151,93169,93179,\r\n93187,93199,93229,93239,93241,93251,93253,93257,93263,93281,93283,93287,93307,93319,93323,\r\n93329,93337,93371,93377,93383,93407,93419,93427,93463,93479,93481,93487,93491,93493,93497,\r\n93503,93523,93529,93553,93557,93559,93563,93581,93601,93607,93629,93637,93683,93701,93703,\r\n93719,93739,93761,93763,93787,93809,93811,93827,93851,93871,93887,93889,93893,93901,93911,\r\n93913,93923,93937,93941,93949,93967,93971,93979,93983,93997,94007,94009,94033,94049,94057,\r\n94063,94079,94099,94109,94111,94117,94121,94151,94153,94169,94201,94207,94219,94229,94253,\r\n94261,94273,94291,94307,94309,94321,94327,94331,94343,94349,94351,94379,94397,94399,94421,\r\n94427,94433,94439,94441,94447,94463,94477,94483,94513,94529,94531,94541,94543,94547,94559,\r\n94561,94573,94583,94597,94603,94613,94621,94649,94651,94687,94693,94709,94723,94727,94747,\r\n94771,94777,94781,94789,94793,94811,94819,94823,94837,94841,94847,94849,94873,94889,94903,\r\n94907,94933,94949,94951,94961,94993,94999,95003,95009,95021,95027,95063,95071,95083,95087,\r\n95089,95093,95101,95107,95111,95131,95143,95153,95177,95189,95191,95203,95213,95219,95231,\r\n95233,95239,95257,95261,95267,95273,95279,95287,95311,95317,95327,95339,95369,95383,95393,\r\n95401,95413,95419,95429,95441,95443,95461,95467,95471,95479,95483,95507,95527,95531,95539,\r\n95549,95561,95569,95581,95597,95603,95617,95621,95629,95633,95651,95701,95707,95713,95717,\r\n95723,95731,95737,95747,95773,95783,95789,95791,95801,95803,95813,95819,95857,95869,95873,\r\n95881,95891,95911,95917,95923,95929,95947,95957,95959,95971,95987,95989,96001,96013,96017,\r\n96043,96053,96059,96079,96097,96137,96149,96157,96167,96179,96181,96199,96211,96221,96223,\r\n96233,96259,96263,96269,96281,96289,96293,96323,96329,96331,96337,96353,96377,96401,96419,\r\n96431,96443,96451,96457,96461,96469,96479,96487,96493,96497,96517,96527,96553,96557,96581,\r\n96587,96589,96601,96643,96661,96667,96671,96697,96703,96731,96737,96739,96749,96757,96763,\r\n96769,96779,96787,96797,96799,96821,96823,96827,96847,96851,96857,96893,96907,96911,96931,\r\n96953,96959,96973,96979,96989,96997,97001,97003,97007,97021,97039,97073,97081,97103,97117,\r\n97127,97151,97157,97159,97169,97171,97177,97187,97213,97231,97241,97259,97283,97301,97303,\r\n97327,97367,97369,97373,97379,97381,97387,97397,97423,97429,97441,97453,97459,97463,97499,\r\n97501,97511,97523,97547,97549,97553,97561,97571,97577,97579,97583,97607,97609,97613,97649,\r\n97651,97673,97687,97711,97729,97771,97777,97787,97789,97813,97829,97841,97843,97847,97849,\r\n97859,97861,97871,97879,97883,97919,97927,97931,97943,97961,97967,97973,97987,98009,98011,\r\n98017,98041,98047,98057,98081,98101,98123,98129,98143,98179,98207,98213,98221,98227,98251,\r\n98257,98269,98297,98299,98317,98321,98323,98327,98347,98369,98377,98387,98389,98407,98411,\r\n98419,98429,98443,98453,98459,98467,98473,98479,98491,98507,98519,98533,98543,98561,98563,\r\n98573,98597,98621,98627,98639,98641,98663,98669,98689,98711,98713,98717,98729,98731,98737,\r\n98773,98779,98801,98807,98809,98837,98849,98867,98869,98873,98887,98893,98897,98899,98909,\r\n98911,98927,98929,98939,98947,98953,98963,98981,98993,98999,99013,99017,99023,99041,99053,\r\n99079,99083,99089,99103,99109,99119,99131,99133,99137,99139,99149,99173,99181,99191,99223,\r\n99233,99241,99251,99257,99259,99277,99289,99317,99347,99349,99367,99371,99377,99391,99397,\r\n99401,99409,99431,99439,99469,99487,99497,99523,99527,99529,99551,99559,99563,99571,99577,\r\n99581,99607,99611,99623,99643,99661,99667,99679,99689,99707,99709,99713,99719,99721,99733,\r\n99761,99767,99787,99793,99809,99817,99823,99829,99833,99839,99859,99871,99877,99881,99901,\r\n99907,99923,99929,99961,99971,99989,99991]\r\nn=int(input())\r\nt=1\r\nfor i in a:\r\n e=0\r\n while not n%i:\r\n n//=i\r\n e+=1\r\n t*=(e+1)\r\n if n==1:break\r\nprint(t-1)", "# fafa and his company\r\n# lab 4\r\n\r\nn=int(input())\r\nx=0\r\nfor i in range (1,n):\r\n if (n%i)==0:\r\n x+=1\r\nprint(x)", "kol_chel = int(input())\r\nsposob = 0\r\nfor i in range(1,kol_chel//2+1):\r\n if (kol_chel - i) % i == 0:\r\n sposob += 1\r\nprint(sposob)", "n = int(input())\r\nc = 0\r\np=(n // 2) + 1\r\nfor i in range(1, p):\r\n if (n - i) % i == 0:\r\n c = c + 1\r\n\r\nprint(c)", "n = int(input())\r\nsum = 0\r\nfor i in range(1,n):\r\n if (n-i)%i==0:\r\n sum = sum + 1\r\nprint(sum)", "a=int(input())\r\ns1=0\r\nfor i in range(1,a):\r\n s1+=a%i<1\r\nprint(s1)\r\n", "s = int(input())\r\nc = 0\r\nfor i in range(1,s):\r\n if s%i==0:\r\n c = c+1\r\nprint(c)", "n = int(input())\r\nc_work = 0\r\nif n % 2 == 1:\r\n m = n / 2 - 0.5\r\n m = int(m)\r\nelse:\r\n m = n / 2\r\n m = int(m)\r\nfor i in range(1, m + 1):\r\n x = i \r\n n = n - 1\r\n if n % x == 0:\r\n c_work += 1\r\nprint(str(c_work))", "n = int(input())\r\n\r\nattempts = 1 \r\nfor i in range(2,n // 2 + 1):\r\n temp = n - i \r\n if temp % i == 0:\r\n attempts += 1\r\nprint(attempts)", "n = int(input())\r\nc = 0\r\nfor i in range(1, n+1):\r\n if (n-i)%i==0:\r\n c+=1\r\nprint(c-1)", "from functools import reduce\r\ndef factors(n):\r\n return set(reduce(list.__add__,\r\n ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0)))\r\nn = int(input())\r\nfact = factors(n)\r\nlength = len(fact)\r\nprint(length - 1)", "c=0\r\nn=int(input())\r\nfor i in range(1,n):\r\n if n%i==0:\r\n c=c+1\r\n else:\r\n continue\r\nprint(c)", "s = int(input())\n\nt = 0\nfor i in range(1,s):\n s -= 1\n if i%s==0:\n t += 1\n\nprint(t)\n", "a=int(input())\r\nans=0\r\nfor i in range(1,a):\r\n b=a-i\r\n if b%i==0:\r\n ans+=1\r\nprint(ans)", "# -*- coding: utf-8 -*-\n\"\"\"Fafa.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1NWMBD7xO_XqMfOvDZAR3qjWw_QqxSM6l\n\"\"\"\n\nn = int(input())\nt = 0\nfor i in range(1,int(n/2)+1):\n if (n%i)==0:\n t +=1\nprint(t)", "n = int(input())\n\n# n-l = k l\ncount = 0\nfor i in range(1, n):\n if (n-i)%i == 0:\n count += 1\n\nprint(count)\n \t \t\t \t \t \t \t\t", "n=int(input())\r\nprint(len([x for x in range(1,n) if not n%x ]))", "n=int(input())\r\nc=0\r\nif n<=2:\r\n print(1)\r\nelse:\r\n for i in range(1,(n//2)+1):\r\n if n%i==0:\r\n c+=1\r\n print(c)", "# FAFA and his Company\r\nn = int(input())\r\nw = 0\r\nfor i in range(1, n+1):\r\n if n-i != 0:\r\n if (n-i) % i == 0:\r\n w = w+1\r\n\r\nprint(w)", "x=int(input())\r\na=0\r\nfor i in range(1,x):\r\n if x%i==0:\r\n a+=1\r\nprint(a)", "n = int(input())\r\nprint(sum(n%i==0 for i in range(1,n)))", "# -*- coding: utf-8 -*-\n\"\"\"Fafa\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ztEG7ycfaGp9yeXW2cgORQxKPlz8XMSt\n\"\"\"\n\nn = int(input())\nc = 0\nfor i in range (1,n):\n if i + (n - i) == n and (n - i)% i == 0 :\n c = c + 1\nprint(c)", "ans = 0\r\nnum = int(input())\r\nfor x in range(1,num): ans+=1 if num%x==0 else 0\r\nprint(ans)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n = int(input())\r\n count = 0\r\n for i in range(1, n):\r\n count += n % i == 0\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\ncnt = 0\r\n\r\nfor l in range(1, n // 2 + 1):\r\n if n % l == 0:\r\n cnt += 1\r\n\r\nprint(cnt)", "n=int(input())\r\nflag=0\r\nfor i in range(1,n+1):\r\n if (n-i)%i==0 and n-i!=0:\r\n flag+=1\r\nprint(flag)", "n = int(input())\r\nout = 1\r\nfor i in range(2, n):\r\n j = n - i\r\n if j // i < 1:\r\n break\r\n if j % i == 0:\r\n out += 1\r\nprint(out)", "n = int(input())\nres = sum(n % i == 0 for i in range(1, 1 + n // 2))\nprint(res)\n", "a=int(input())\r\ncounter=0\r\nfor i in range(1,a//2+1):\r\n if a%i==0:\r\n counter+=1\r\n if i==a//2:\r\n break\r\nprint(counter)", "n = int(input())\r\nlist_of_factors = []\r\nfor i in range(1, n):\r\n if n % i == 0:\r\n list_of_factors.append(i)\r\n\r\nprint(len(list_of_factors))", "n=int(input())\r\nif n>=2:\r\n c=0\r\n for i in range(1,n//2+1):\r\n if (n-i)%i==0:\r\n c=c+1\r\n print(c)", "n=int(input())\r\nc=0\r\nfor i in range(1,int(n**(1/2))+1):\r\n if n%i==0:\r\n c=c+1\r\nif (n**(1/2))==int(n**(1/2)):\r\n print(2*c-2)\r\nelse:\r\n print(2*c-1)", "n=int(input())\r\nans=0\r\nfor i in range(1, (n // 2) + 1):\r\n if(n-i) % i ==0:\r\n ans +=1\r\nprint(ans)", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nn = int(input())\r\nc=0\r\n\r\nfor i in range(1, n//2+1):\r\n if (n-i) % i == 0: c+=1\r\n\r\nprint(c)", "def solve(n: int) -> int:\r\n count = 0\r\n for i in range(1, n): \r\n if n - i == 0:\r\n pass\r\n elif (n - i) % i == 0:\r\n count += 1\r\n else: \r\n continue\r\n return count\r\n \r\nn = int(input())\r\nprint(solve(n))\r\n ", "v=int(input());c=0\r\nfor i in range(2,(v//2)+1):\r\n if (i*((v-i)//i))+i ==v:c+=1\r\nif v>2:c+=1\r\nif v==2:c+=1\r\nprint(c)", "n=int(input())\r\nl=0\r\nfor i in range(1,n):\r\n if n%i==0:\r\n l=l+1\r\nprint(l)", "import math\n\nn = int(input())\nc = 0\n\nfor i in range(1, n+1):\n if (n-i >= i):\n if ((n-i) % i == 0):\n c += 1\n\nprint(c)\n\n \t\t \t\t\t\t \t \t \t\t\t \t\t \t\t\t \t \t\t", "n=int(input())\r\nw=0\r\nfor x in range(1,n):\r\n\tif (n-x)%x==0:\r\n\t\tw+=1\r\nprint(w)\r\n", "a = int(input())\r\ncount=0\r\nfor i in range(1,a):\r\n if a%i==0:\r\n count+=1\r\nprint(count)", "a = int(input())\r\nt = 0\r\nfor i in range(1,a):\r\n p = (a-i)//i\r\n if p*i==(a-i):\r\n t+=1\r\nprint(t)", "n = int(input())\r\nx = 0\r\nfor l in range(1, n//2+1):\r\n if (n-l) % l == 0:\r\n x += 1\r\n \r\n \r\nprint(x)", "# LUOGU_RID: 94433990\nn = int(input())\n\ni, count = 2, 1\nwhile i <= n/2:\n if (n-i) % i == 0:\n count += 1\n i += 1\nprint(count)", "n=int(input())\n\ni=1\nc=0\nwhile(i!=n):\n rem=n-i\n if rem%i==0:\n c+=1\n i+=1\nprint(c)\n \t \t\t\t\t\t\t \t\t\t \t \t\t\t\t\t\t \t\t \t", "n=int(input())\r\ncount=0\r\nfor i in range(1,n//2 +1):\r\n if (n%i==0):\r\n count+=1\r\nprint(count)", "n = int(input())\r\nres = 0\r\nfor i in range(1,n):\r\n if n%i == 0:\r\n res+=1\r\n\r\nprint(res)", "# https://codeforces.com/problemset/problem/935/A\r\n\r\nt = int(input())\r\ncnt = 0\r\nfor i in range(1, t // 2 + 1):\r\n if (t - i) % i == 0:\r\n cnt += 1\r\nprint(cnt)\r\n", "count = 0\r\nworkers = int(input())\r\n\r\nfor i in range(1, workers):\r\n\tif (workers-i)%i == 0:\r\n\t\tcount+=1\r\n\r\nprint(count)", "n = int(input())\nc = 1\nfor i in range(2,n):\n if n%i==0:\n c+=1\nprint(c)", "n = int(input())\r\n# arr = list(map(int, input().split()))\r\n# a, b = map(int, input().split())\r\nans = 0\r\n\r\nfor i in range(1, (n // 2) + 1):\r\n if (n - i) % i == 0:\r\n ans += 1\r\n\r\nprint(ans)", "n=int(input())\r\nif n==0:\r\n print(0)\r\nelif n==1 or n==2:\r\n print(1)\r\nelse:\r\n c=0\r\n i=1\r\n t=n\r\n while t>0:\r\n if (n-i)%i==0:\r\n c+=1\r\n t=t-1\r\n i+=1\r\n print(c-1)\r\n ", "n = int(input(\"\"))\r\ncombinations = 0\r\n\r\nfor i in range(1, n):\r\n if n%i == 0:\r\n combinations += 1\r\n\r\nprint(combinations)", "n=int(input())\r\nc=1\r\nif n==2:\r\n print(1)\r\nelse:\r\n for i in range(2,n):\r\n if (n-i)%i==0:\r\n c+=1\r\n print(c)\r\n \r\n", "n = int(input())\r\nleaders = 0\r\nnum_ways = 0\r\nfor l in range(1, n):\r\n remaining_staff = n - l\r\n if remaining_staff%l == 0:\r\n num_ways += 1\r\nprint(num_ways)", "n = int(input())\r\nc = 0\r\nfor i in range(2, n+1):\r\n if (n - i) % i == 0:\r\n c+= 1\r\nprint(c)", "a = int(input())\r\ncount = 0\r\nif a>=2 and a<=(10**5):\r\n for i in range(1,a):\r\n if a%i==0:\r\n count+=1\r\n\r\n print(count)", "\r\nc=0\r\nx=int(input())\r\nfor i in range(2,x+1):\r\n if x%i==0: \r\n c+=1\r\nprint(c)\r\n\r\n", "n=int(input())\r\nt=0\r\nfor i in range (1,n):\r\n if (n-i)%i==0:\r\n t+=1\r\n \r\nprint(t)\r\n", "n = int(input())\r\na =[]\r\nfor i in range(1,int(n)):\r\n if((n-i)%i==0):\r\n a.append(i)\r\nprint(len(a))\r\n", "n = int(input())\r\nhalf = n//2\r\nans = 0\r\nfor i in range(1, half+1):\r\n if (n-i)%i==0:\r\n ans+=1\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled20.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1H2gUR4biI8eg3EXL1SeupFnjBzyIIjlD\n\"\"\"\n\nn = int(input())\ns = 0\nfor i in range(2,n):\n if (((n - i) % i)==0):\n s+=1;\n \nprint(s+1)", "n = int(input())\r\n\r\ntot = sum(1 for l in range(1, n) if (n - l) % l == 0)\r\n\r\nprint(tot)", "def q(n):\r\n a=0\r\n i=1\r\n while i<n:\r\n if n%i==0:\r\n a+=1\r\n i+=1\r\n return a \r\n\r\nn=int(input()) \r\nprint(q(n)) ", "inpt = int(input())\r\nld = 0\r\nfor i in range (1, inpt):\r\n if inpt % i == 0:\r\n ld += 1\r\nprint (ld)", "n=int(input())\r\nl=0\r\nfor i in range (1,n):\r\n if (n%i==0):\r\n l+=1\r\nprint(l)", "def isprime(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\nc=1\r\nif isprime(n):\r\n print(1)\r\nelse:\r\n for i in range(2,n//2+1):\r\n if(n-i)%i==0:\r\n c+=1\r\n print(c)\r\n", "n=int(input())\r\nres=0\r\nfor i in range(1,(n//2)+1):\r\n if(n-i)%i==0:\r\n res+=1\r\nprint(res) \r\n ", "import sys\r\nimport math\r\n\r\nint_inp = lambda: int(input())\r\nstr_inp = lambda: input().strip()\r\nlist_flt = lambda: list(map(float, input().strip().split()))\r\nlist_int = lambda: list(map(int, input().strip().split()))\r\nlist_str = lambda: list(input().strip())\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n\r\nn = int_inp()\r\n\r\nfct = 0\r\n\r\nfor i in range(math.ceil(n/2)):\r\n if n % (i + 1) == 0:\r\n fct += 1\r\n\r\nprint(fct)", "N = int(input())\r\ntotal = 1\r\nfor i in range(2, N):\r\n rem = N - i\r\n calc = rem // i * i\r\n if calc == rem:\r\n total+=1\r\nprint(total)\r\n", "n = int(input())\r\nans = 0\r\nfor i in range(1, n):\r\n ans += (n % i < 1)\r\nprint(ans)\r\n", "import math\r\na=int(input())\r\ns=0\r\n\r\ne=int(math.sqrt(a))\r\nfor i in range(2,e+1):\r\n if a%i==0:\r\n s=s+1\r\ns=2*s\r\nif e*e==a:\r\n s=s-1\r\nprint(s+1)", "a=int(input())\r\nprint (sum(a%i==0 for i in range(1,a)))", "x = int(input())\r\nc = 0\r\nfor i in range(2, x+1):\r\n if (x-i) % i == 0:\r\n c = c+1\r\nprint(c)\r\n", "n = int(input())\r\nprint(sum(n%i<1for i in range(1,n)))", "ujju=int(input())\r\njyo=0\r\nfor sol in range(1,(ujju//2)+1):\r\n if(ujju-sol)%sol==0:\r\n jyo+=1;\r\nprint(jyo)", "n = int(input())\r\ncount = 0\r\n\r\nfor row in range(1, n):\r\n if n % row == 0:\r\n count += 1\r\nprint(count)\r\n\r\n", "emp = int(input())\r\ncount = 0\r\n\r\nfor i in range(1,emp):\r\n if emp%i == 0:\r\n count +=1 \r\n\r\nprint(count)", "n = int(input());print(sum(n%i==0 for i in range (1,n)))", "n=int(input())\r\nl=0\r\nfor i in range(1,int(n/2)+1):\r\n if n% i ==0:\r\n l=l+1\r\nprint(l)", "a=int(input())\r\nc=0\r\nfor i in range(1,a):\r\n if a-1 ==0:\r\n pass\r\n elif(a-i)%i==0:\r\n c=c+1\r\n else:\r\n continue\r\nprint(c)", "a=int(input())\r\np=0\r\nfor i in range(1,a):\r\n if a%i==0:\r\n p+=1\r\nprint(p)", "n=int(input())\r\nv=1\r\nb=0\r\nfor i in range (n-1): \r\n x=(n-v)/v\r\n if x==int(x):\r\n v+=1\r\n b+=1\r\n continue\r\n else:\r\n v+=1\r\n \r\nprint(b)\r\n", "def void(a):\r\n s = 0\r\n for i in range(1,a):\r\n if a % i == 0:\r\n s += 1\r\n print(s)\r\na = int(input())\r\nvoid(a)", "x = int(input())\r\nlst = []\r\ncount = 0\r\nfor i in range(1,x):\r\n if x%i==0 :\r\n count=count+1\r\n lst.append(count)\r\nprint(len(lst))", "x=int(input())\r\nm=0\r\nfor i in range(1,x+1):\r\n j=x-i\r\n z=x-j\r\n if z!=0 and (j)!=0:\r\n if (j)%z==0:\r\n m=m+1\r\nprint(m) ", "x=int(input())\r\ny=x\r\ncounter = 1\r\nk=2\r\nwhile x >2 :\r\n if (y-k)%k ==0 :\r\n counter +=1 \r\n else:\r\n counter = counter + 0\r\n x-=1\r\n k+=1\r\nprint(counter)", "def divCount(n):\r\n\r\n\thh = [1] * (n + 1)\r\n\t\r\n\tp = 2\r\n\twhile((p * p) < n):\r\n\t\tif (hh[p] == 1):\r\n\t\t\tfor i in range((p * 2), n, p):\r\n\t\t\t\thh[i] = 0\r\n\t\tp += 1\r\n\ttotal = 1\r\n\tfor p in range(2, n + 1):\r\n\t\tif (hh[p] == 1):\r\n\t\t\tcount = 0\r\n\t\t\tif (n % p == 0):\r\n\t\t\t\twhile (n % p == 0):\r\n\t\t\t\t\tn = int(n / p)\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\ttotal *= (count + 1)\r\n\t\t\t\t\r\n\treturn total\r\nn = int(input())\r\nprint(divCount(n)-1)", "counter = 0\r\nN = int(input())\r\nfor i in range(1, N):\r\n if (N - i) % i == 0:\r\n counter += 1\r\nprint(counter)", "n = int(input())\nans = 0\nfor i in range(1,n):\n if (n - i) % i == 0:\n ans +=1\nprint(ans)\n \n\n", "n=int(input())\r\nl=1\r\nk=0\r\nwhile(l<n):\r\n if (n-l)%l==0:\r\n k+=1\r\n l+=1\r\nprint(k)", "n=int(input())\r\nl=1\r\nt=0\r\nwhile(l<=n//2):\r\n if(n%l==0):\r\n t+=1\r\n l+=1\r\nprint(t)", "o=int(input())\r\ncont=0\r\nfor i in range(1,o):\r\n if (o-i)/i== (o-i)//i:\r\n cont+=1\r\nprint(cont)", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nl = 1\r\nway_count = 0\r\n\r\nwhile l <= n // 2:\r\n if (n-l) % l == 0:\r\n way_count+=1\r\n l+=1\r\n\r\nprint(way_count)\r\n", "n=int(input())\r\n\r\nleaders=1\r\nc=0\r\nwhile(leaders!=n):\r\n rem=n-leaders\r\n if rem%leaders==0:\r\n c+=1\r\n leaders+=1\r\nprint(c)\r\n", "n = int(input())\r\nans = 0\r\n\r\nfor i in range(1 , (n//2)+1):\r\n if (n - i)%i == 0:\r\n ans = ans + 1\r\n \r\nprint (ans)", "n = int(input())\r\ncount = 0\r\nfor i in range(1, (n // 2) + 1):\r\n s = n - i\r\n r = s / i\r\n if r.is_integer():\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nways = 0\r\nfor i in range(1, n):\r\n a = n\r\n a -= i\r\n if a%i == 0:\r\n ways += 1\r\nprint(ways)", "\r\nn=int(input())\r\ni,cnt=2,0\r\nwhile(i*i<=n):\r\n if(n%i==0):\r\n if(i*i!=n):\r\n cnt+=2\r\n else:\r\n cnt+=1\r\n i+=1\r\nprint(cnt+1)" ]

[ "# In this template you are not required to write code in main\r\n\r\nimport sys\r\ninf = float(\"inf\")\r\n\r\n#from collections import deque, Counter, OrderedDict,defaultdict\r\n#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\n#from math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#from bisect import bisect_left,bisect_right\r\n\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod,MOD=1000000007,998244353\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nn=int(input())\r\nstring=input()\r\nmydict=dict()\r\nfor i in string:\r\n mydict[i]=mydict.get(i,0)+1\r\n\r\n# print(mydict)\r\nif len(mydict)==3:\r\n print(\"BGR\")\r\nelif len(mydict)==1:\r\n print(string[0])\r\nelif len(mydict)==2:\r\n mylist=[]\r\n for i in string:\r\n mylist.append(i)\r\n mylist.sort()\r\n first=mylist[0]\r\n second=mylist[-1]\r\n little='BGR'\r\n if mydict[first]==1 and mydict[second]==1:\r\n # print(first,second)\r\n for i in little:\r\n if i!=first and i!=second:\r\n print(i)\r\n exit()\r\n\r\n elif(mydict[first]==1 and mydict[second]>1):\r\n ans=''\r\n for i in little:\r\n if i!=second:\r\n ans+=i\r\n print(ans)\r\n\r\n elif (mydict[first]>1 and mydict[second]==1):\r\n ans=''\r\n for i in little:\r\n if i!=first:\r\n ans+=i\r\n print(ans)\r\n\r\n elif (mydict[first]>1 and mydict[second]>1):\r\n print(little)\r\n\r\n", "n = int(input())\r\ns = str(input())\r\nnum_R = 0\r\nnum_B = 0\r\nnum_G = 0\r\nelements = set()\r\n\r\nfor char in s:\r\n\tif char == 'R':\r\n\t\tnum_R += 1\r\n\t\telements.add('R')\r\n\tif char == 'B':\r\n\t\tnum_B += 1\r\n\t\telements.add('B')\r\n\tif char == 'G':\r\n\t\tnum_G += 1\r\n\t\telements.add('G')\r\n\tif elements == {'B', 'G', 'R'}:\r\n\t\tprint(\"BGR\")\r\n\t\texit()\r\n\tif (num_R >= 2 and num_B >= 2) or (num_R >= 2 and num_G >= 2) or (num_G >= 2 and num_B >= 2):\r\n\t\tprint(\"BGR\")\r\n\t\texit()\r\n\r\n\r\ndiff = {'B', 'G', 'R'} - elements\r\n\r\nif len(elements) == 1:\r\n\tprint(list(elements)[0])\r\n\r\nelif num_R + num_B + num_G == 2:\r\n\tprint(list(diff)[0])\r\n\r\nelse:\r\n\tif num_R >= 2:\r\n\t\tprint('BG')\r\n\tif num_G >= 2:\r\n\t\tprint('BR')\r\n\tif num_B >= 2:\r\n\t\tprint('GR')", "n=int(input())\r\na=input()\r\ng=a.count(\"G\")\r\nb=a.count(\"B\")\r\nr=a.count(\"R\")\r\namm=b+r+g\r\nam=0\r\n\r\nif b!=0:\r\n am+=1\r\nif g!=0:\r\n am+=1\r\nif r!=0:\r\n am+=1\r\nif am==1:\r\n if b!=0:\r\n print(\"B\")\r\n if g!=0:\r\n print(\"G\")\r\n if r!=0:\r\n print(\"R\")\r\nelif am==3:\r\n print(\"BGR\")\r\nelif am==amm:\r\n if g==0:\r\n print(\"G\")\r\n elif b==0:\r\n print(\"B\")\r\n else:\r\n print(\"R\")\r\nelse:\r\n if g==1:\r\n if b==0:\r\n print(\"BG\")\r\n else:\r\n print(\"GR\")\r\n elif b==1:\r\n if g==0:\r\n print(\"BG\")\r\n else:\r\n print(\"BR\")\r\n elif r==1:\r\n if g==0:\r\n print(\"GR\")\r\n else:\r\n print(\"BR\")\r\n else:\r\n print(\"BGR\")\r\n", "n = int(input())\r\ns = input().strip()\r\nif 'R' in s and 'G' in s and 'B' in s:\r\n\tans = \"RGB\"\r\nelif 'R' in s and 'G' in s:\r\n\ta = 'R'\r\n\tb = 'G'\r\n\tc = 'B'\r\n\tif s.count(a) > 1 and s.count(b) > 1:\r\n\t\tans = \"RGB\"\r\n\telse:\r\n\t\tif n == 2:\r\n\t\t\tans = c\r\n\t\telse:\r\n\t\t\tif s.count(a) > s.count(b):\r\n\t\t\t\tans = b+c\r\n\t\t\telse:\r\n\t\t\t\tans = a+c\r\nelif 'R' in s and 'B' in s:\r\n\ta = 'R'\r\n\tc = 'G'\r\n\tb = 'B'\r\n\tif s.count(a) > 1 and s.count(b) > 1:\r\n\t\tans = \"RGB\"\r\n\telse:\r\n\t\tif n == 2:\r\n\t\t\tans = c\r\n\t\telse:\r\n\t\t\tif s.count(a) > s.count(b):\r\n\t\t\t\tans = b+c\r\n\t\t\telse:\r\n\t\t\t\tans = a+c\r\nelif 'G' in s and 'B' in s:\r\n\tc = 'R'\r\n\ta = 'G'\r\n\tb = 'B'\r\n\tif s.count(a) > 1 and s.count(b) > 1:\r\n\t\tans = \"RGB\"\r\n\telse:\r\n\t\tif n == 2:\r\n\t\t\tans = c\r\n\t\telse:\r\n\t\t\tif s.count(a) > s.count(b):\r\n\t\t\t\tans = b+c\r\n\t\t\telse:\r\n\t\t\t\tans = a+c\r\nelse:\r\n\tans = s[0]\r\nret = []\r\nfor char in ans:\r\n\tret.append(char)\r\nret.sort()\r\nprint (''.join(ret))", "input()\r\ns = input()\r\na, b, c = sorted((s.count(x), x) for x in 'RGB')\r\nif a[0] or b[0] > 1:\r\n print('BGR')\r\nelif b[0] and c[0] > 1:\r\n print(''.join(sorted(a[1] + b[1])))\r\nelif b[0]:\r\n print(a[1])\r\nelse:\r\n print(c[1])\r\n", "from collections import Counter\r\n \r\ninput()\r\nF = Counter(input())\r\n \r\nif len(F) < 2:\r\n print(*F)\r\nelif len(F) > 2:\r\n print('BGR')\r\nelse:\r\n f1, f2 = F.values()\r\n if f1 == f2 == 1:\r\n print((set('BGR') - set(F.keys())).pop())\r\n elif f1 > 1 and f2 > 1:\r\n print('BGR')\r\n else:\r\n print(*(c for c in 'BGR' if c not in F or F[c] == 1), sep='')", "n = int(input())\r\ns = input()\r\nst = {'R', 'G', 'B'}\r\nif s.count(s[0]) == n:\r\n print(s[0])\r\nelif st == set(s):\r\n print(''.join(sorted(list(st))))\r\nelif len(set(s)) == 2:\r\n if s.count(list(set(s))[0]) > 1 and s.count(list(set(s))[1]) > 1:\r\n print(''.join(sorted(list(st))))\r\n elif s.count(list(set(s))[0]) > 1:\r\n print(''.join(sorted(list(st - set(s))[0] + list(set(s))[1])))\r\n elif s.count(list(set(s))[1]) > 1:\r\n print(''.join(sorted(list(st - set(s))[0] + list(set(s))[0])))\r\n else:\r\n print(list(st - set(s))[0])", "def main():\n n = int(input())\n s = input()\n r = s.count('R')\n g = s.count('G')\n b = s.count('B')\n if r > 0 and g > 0 and b > 0:\n print('BGR')\n return\n r = min(r, 2)\n g = min(g, 2)\n b = min(b, 2)\n a = r, 'R'\n c = b, 'B'\n b = g, 'G'\n if a[0] < b[0]:\n a, b = b, a\n if b[0] < c[0]:\n b, c = c, b\n if a[0] < b[0]:\n a, b = b, a\n if a[0] == 2 and b[0] == 2:\n print('BGR')\n return\n if a[0] == 2 and b[0] == 1:\n print(''.join(sorted((c[1], b[1]))))\n if a[0] > 0 and b[0] == 0:\n print(a[1])\n if a[0] == 1 and b[0] == 1:\n print(c[1])\n\n\nmain()\n", "#!/usr/bin/env python3\r\nn = int(input())\r\ns = input()\r\nt = 'BGR'\r\na = [s.count(c) for c in t]\r\nans = ''\r\nfor i in range(3):\r\n x, y, z = a[i], a[(i+1)%3], a[(i+2)%3]\r\n if (x >= 1 and y == z == 0) or (y >= 1 and z >= 1) or (x >= 1 and (y >= 2 or z >= 2)):\r\n ans += t[i]\r\nprint(ans)\r\n", "n = input()\r\ns = input()\r\n\r\narr = ['B', 'G', 'R']\r\ncnt = s.count('B'), s.count('G'), s.count('R')\r\nzeros = 0\r\ncan = [False, False, False]\r\n\r\nfor i in cnt:\r\n if i == 0:\r\n zeros += 1\r\n\r\nif zeros == 0:\r\n can = [True, True, True]\r\nelif zeros == 2:\r\n for i in range(3):\r\n if cnt[i] != 0:\r\n can[i] = True\r\nelse:\r\n sum = 0\r\n for i in range(3):\r\n sum += cnt[i]\r\n for i in range(3):\r\n can[i] = cnt[i] != sum - 1\r\n\r\nfor i in range(3):\r\n if can[i]:\r\n print(arr[i], end='')\r\n", "from collections import Counter\r\nn=int(input())\r\nif(n==1):\r\n print(input())\r\nif(n>1):\r\n c= Counter({\"R\": 0, \"G\": 0, \"B\": 0})\r\n c.update(input())\r\n r, g, b = sorted(\"RGB\", key=c.get)\r\n print(''.join(sorted(\"RGB\" if c[r] else (r if n == 2 else r + g) if c[g] == 1 else \"RGB\" if c[g] else b)))", "n = int(input())\r\ns = input()\r\na,b,c = sorted((s.count(x),x) for x in 'RGB')\r\n# print(a,b,c)\r\nif a[0] or b[0]>1:\r\n print ('BGR')\r\nelif b[0] and c[0]>1:\r\n print (''.join(sorted(a[1]+b[1])))\r\nelif b[0]:\r\n print (a[1])\r\nelif c[0]:\r\n print (c[1])", "from collections import Counter\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(input())\r\n exit()\r\ncnt = Counter({\"R\": 0, \"G\": 0, \"B\": 0})\r\ncnt.update(input())\r\nr, g, b = sorted(\"RGB\", key=cnt.get)\r\nprint(''.join(sorted(\"RGB\" if cnt[r] else (r if n == 2 else r + g) if cnt[g] == 1 else \"RGB\" if cnt[g] else b)))\r\n", "\nfrom collections import Counter\n\nALL_CARDS = set('RGB')\n\ndef solve():\n length = int(input().strip())\n cards = input().strip()\n\n counter = Counter(cards)\n card_counts = dict(counter.most_common())\n available_cards = set(card_counts.keys())\n missing_cards = ALL_CARDS - available_cards\n more_than_1s = set([card for card in available_cards if card_counts[card] > 1])\n \n candidate = None\n if len(available_cards) == 3:\n candidate = ALL_CARDS\n elif len(available_cards) == 1:\n candidate = available_cards\n else: # 2\n if len(more_than_1s) == 2:\n candidate = ALL_CARDS\n elif len(more_than_1s) == 1:\n candidate = ALL_CARDS - more_than_1s\n else:\n candidate = missing_cards\n\n print(''.join(sorted(candidate)))\n\nif __name__ == '__main__':\n solve()\n\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\n\r\n\r\nn=ii()\r\n\r\ns=input()\r\n\r\ncnt=Counter(s)\r\n\r\nif len(cnt)==1:\r\n print(s[0])\r\nelif len(cnt)==3:\r\n print(\"BGR\")\r\nelif all(cnt[k]>1 for k in cnt.keys()):\r\n print(\"BGR\")\r\nelif all(cnt[k]==1 for k in cnt.keys()):\r\n for c in \"BGR\":\r\n if cnt[c]==0:\r\n print(c)\r\n break\r\nelse:\r\n if cnt[\"B\"]>1:\r\n print(\"GR\")\r\n elif cnt[\"G\"]>1:\r\n print(\"BR\")\r\n else:\r\n print(\"BG\")\r\n \r\n\r\n ", "from collections import defaultdict\r\nn = int(input())\r\ncards = input()\r\ncard_frequencies = defaultdict(int)\r\nfor i in cards:\r\n card_frequencies[i] += 1\r\ndp = [[[-1 for z in range(n+1)] for y in range(n+1)] for x in range(n+1)]\r\ndef backtracking(r,g,b):\r\n if r + g + b == 1:\r\n if r: return 4\r\n if g: return 2\r\n return 1\r\n if dp[r][g][b] != -1: return dp[r][g][b]\r\n ans = 0\r\n if r >= 2:\r\n ans |= backtracking(r-1,g,b)\r\n if g >= 2:\r\n ans |= backtracking(r,g-1,b)\r\n if b >= 2:\r\n ans |= backtracking(r,g,b-1)\r\n if r > 0 and g > 0:\r\n ans |= backtracking(r-1,g-1,b+1)\r\n if g > 0 and b > 0:\r\n ans |= backtracking(r+1,g-1,b-1)\r\n if r > 0 and b > 0:\r\n ans |= backtracking(r-1,g+1,b-1)\r\n dp[r][g][b] = ans\r\n return ans\r\nans = backtracking(card_frequencies['R'],card_frequencies['G'],card_frequencies['B'])\r\ncolors = []\r\nif (ans >> 2) & 1: colors.append('R')\r\nif (ans >> 1) & 1: colors.append('G')\r\nif ans & 1: colors.append('B')\r\nprint(''.join(sorted(colors)))\r\n", "import sys \r\n\r\n\r\ndef scan(TYPE_1, TYPE_2=0):\r\n\tif(TYPE_1==int):\r\n\t\treturn map(int, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==float):\r\n\t\treturn map(float, sys.stdin.readline().strip().split())\r\n\telif(TYPE_1==list and TYPE_2==float):\r\n\t\treturn list(map(float, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==list and TYPE_2==int):\r\n\t\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n\telif(TYPE_1==str):\r\n\t\treturn sys.stdin.readline().strip()\r\n\telse: print(\"ERROR!!!!\") \r\n\r\n\r\n\r\ndef main():\r\n\t\r\n\tn=int(scan(str))\r\n\ts=scan(str)\r\n\tmp={'B':0, 'G':0, 'R':0}\r\n\r\n\tfor i in range(n): mp[s[i]]+=1\r\n\r\n\tif(mp['B']==n or (mp['G']>0 and mp['R']>0) or (mp['B']>0 and (mp['G']>1 or mp['R']>1))):\r\n\t\tprint('B', end='')\r\n\tif(mp['G']==n or (mp['B']>0 and mp['R']>0) or (mp['G']>0 and (mp['B']>1 or mp['R']>1))):\r\n\t\tprint('G', end='')\r\n\tif(mp['R']==n or (mp['G']>0 and mp['B']>0) or (mp['R']>0 and (mp['G']>1 or mp['B']>1))):\r\n\t\tprint('R', end='')\r\n\r\n\r\nmain()", "int(input())\r\nb=input()\r\nR=b.count('R')\r\nB=b.count('B')\r\nG=b.count('G')\r\nif R==len(b):print('R')\r\nelif B==len(b):print('B')\r\nelif G==len(b):print('G')\r\nelif R and B and G:print('BGR')\r\nelif len(b)==2:\r\n print(*[i for i in 'RBG' if i not in b])\r\nelif min(B,G)==1 or min(B,R)==1 or min(R,G)==1:\r\n ans=''\r\n if G==1:ans+='G'\r\n elif B == 1: ans+='B'\r\n else:ans+='R'\r\n ans+=''.join([i for i in 'RBG' if b.count(i)==0])\r\n print(*sorted(ans),sep='')\r\nelse:print('BGR')", "n = int(input())\r\ns = input()\r\ng, b, r = s.count('G'), s.count('B'), s.count('R')\r\nif (r >= 1 and b >= 1 and g >= 1) or (r > 1 and b > 1) or (r > 1 and g > 1) or (b > 1 and g > 1):\r\n print('BGR')\r\nelif r == 1 and b == 1:\r\n print('G')\r\nelif b == 1 and g == 1:\r\n print('R')\r\nelif r == 1 and g == 1:\r\n print('B')\r\nelif r > 1 and b == 1:\r\n print('BG')\r\nelif b > 1 and g == 1:\r\n print('GR')\r\nelif g > 1 and r == 1:\r\n print('BR')\r\nelif r == 1 and b > 1:\r\n print('GR')\r\nelif b == 1 and g > 1:\r\n print('BR')\r\nelif g == 1 and r > 1:\r\n print('BG')\r\nelif r >= 1:\r\n print('R')\r\nelif b >= 1:\r\n print('B')\r\nelse:\r\n print('G')", "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\nd=[0, 0, 0]\r\ndt={0:'B',1:'G',2:'R'}\r\nn=ii()\r\ns=si()\r\nfor i in s:\r\n if i=='B':d[0]+=1\r\n elif i=='G':d[1]+=1\r\n else:d[2]+=1\r\nc0=d.count(0)\r\nc1=d.count(1)\r\nif c0==2:\r\n print(dt[d.index(max(d))])\r\nelif c0==1 and c1==1:\r\n for i in range(3):\r\n if d[i]==1 or d[i]==0:\r\n print(dt[i],end='')\r\nelif c1==2 and c0==1:\r\n print(dt[d.index(0)])\r\nelse:\r\n print('BGR')", "n = int(input())\r\ns = input()\r\nr = s.count('R')\r\ng = s.count('G')\r\nb = s.count('B')\r\nif r>=1 and g>=1 and b>=1:\r\n print('BGR')\r\nelif r+g==0:\r\n print('B')\r\nelif b+g==0:\r\n print('R')\r\nelif b+r==0:\r\n print('G')\r\nelif r==0:\r\n if b+g==2:\r\n print('R')\r\n elif b==1 and g>1:\r\n print('BR')\r\n elif g==1 and b>1:\r\n print('GR')\r\n else:\r\n print('BGR')\r\nelif b==0:\r\n if r+g==2:\r\n print('B')\r\n elif r==1 and g>1:\r\n print('BR')\r\n elif g==1 and r>1:\r\n print('BG')\r\n else:\r\n print('BGR')\r\nelif g==0:\r\n if b+r==2:\r\n print('G')\r\n elif b==1 and r>1:\r\n print('BG')\r\n elif r==1 and b>1:\r\n print('GR')\r\n else:\r\n print('BGR')", "def ans(RGB):\r\n if RGB['B'] > 0 and RGB['G'] > 0 and RGB['R'] > 0:\r\n return 'BGR'\r\n elif RGB['B'] > 1 and RGB['G'] > 1:\r\n RGB['B'] -= 1\r\n RGB['G'] -= 1\r\n RGB['R'] += 1\r\n return ans(RGB)\r\n elif RGB['G'] > 1 and RGB['R'] > 1:\r\n RGB['B'] += 1\r\n RGB['G'] -= 1\r\n RGB['R'] -= 1\r\n return ans(RGB)\r\n elif RGB['B'] > 1 and RGB['R'] > 1:\r\n RGB['B'] -= 1\r\n RGB['G'] += 1\r\n RGB['R'] -= 1\r\n return ans(RGB)\r\n elif RGB['B'] == 1 and RGB['G'] == 1:\r\n RGB['B'] -= 1\r\n RGB['G'] -= 1\r\n RGB['R'] += 1\r\n return ans(RGB)\r\n elif RGB['G'] == 1 and RGB['R'] == 1:\r\n RGB['B'] += 1\r\n RGB['G'] -= 1\r\n RGB['R'] -= 1\r\n return ans(RGB)\r\n elif RGB['B'] == 1 and RGB['R'] == 1:\r\n RGB['B'] -= 1\r\n RGB['G'] += 1\r\n RGB['R'] -= 1\r\n return ans(RGB)\r\n elif RGB['B'] > 0 and RGB['G'] > 0:\r\n if RGB['B'] == 1:\r\n return 'BR'\r\n else:\r\n return 'GR'\r\n elif RGB['G'] > 0 and RGB['R'] > 0:\r\n if RGB['G'] == 1:\r\n return 'BG'\r\n else:\r\n return 'BR'\r\n elif RGB['B'] > 0 and RGB['R'] > 0:\r\n if RGB['B'] == 1:\r\n return 'BG'\r\n else:\r\n return 'GR' \r\n elif RGB['B'] > 0:\r\n return 'B'\r\n elif RGB['G'] > 0:\r\n return 'G'\r\n elif RGB['R'] > 0:\r\n return 'R' \r\n\r\nn = int(input())\r\nRGB = dict()\r\nRGB['R'] = 0\r\nRGB['G'] = 0\r\nRGB['B'] = 0\r\n\r\nfor e in input():\r\n RGB[e] += 1\r\n\r\nprint(ans(RGB))", "# You lost the game.\nn = int(input())\nch = str(input())\nr = \"\"\nR = ch.count(\"R\")\nB = ch.count(\"B\")\nG = ch.count(\"G\")\nif R and B and G:\n print(\"BGR\")\nelif (R >= 2 and B >= 2) or (G >= 2 and R >= 2) or (G >= 2 and B >= 2):\n print(\"BGR\")\nelif R >= 2 and (B == 1 or G == 1): \n print(\"BG\")\nelif B >= 2 and (R == 1 or G == 1):\n print(\"GR\")\nelif G >= 2 and (B == 1 or R == 1):\n print(\"BR\")\nelif B and G:\n print(\"R\")\nelif R and G:\n print(\"B\")\nelif B and R:\n print(\"G\")\nelif B:\n print(\"B\")\nelif G:\n print(\"G\")\nelse:\n print(\"R\")\n\n\n\n\n", "n=int(input())\r\ns=list(input())\r\nr=s.count(\"R\")\r\ng=s.count(\"G\")\r\nb=s.count(\"B\")\r\nif (r == 0 and g == 0):\r\n print(\"B\")\r\nelif r==1 and g==1 and b==0:\r\n\tprint('B')\r\nelif (r == 0 and b == 0):\r\n\tprint('G')\r\nelif r==1 and g==0 and b==1:\r\n print(\"G\")\r\nelif (b == 0 and g == 0):\r\n print(\"R\")\r\nelif r==0 and b==1 and g==1:\r\n\tprint('R')\r\nelif (r,g,b) == (1,g,0) or (r,g,b) == (0,g,1):\r\n\tprint('BR')\r\nelif (r,g,b) == (r,1,0) or (r,g,b) == (r,0,1):\r\n\tprint('BG')\r\nelif (r,g,b) == (1,0,b) or (r,g,b) == (0,1,b):\r\n\tprint('GR')\r\nelse:\r\n\tprint('BGR')", "'''\nCatherine has a deck of n cards, each of which is either red, green, or blue.\n As long as there are at least two cards left, she can do one of two actions:\n\n take any two (not necessarily adjacent) cards with different colors and \n exchange them for a new card of the third color;\n take any two (not necessarily adjacent) cards with the same color and \n exchange them for a new card with that color. \n\nShe repeats this process until there is only one card left. What are the \npossible colors for the final card?\n\nInput\n\nThe first line of the input contains a single integer n (1 ≤ n ≤ 200) — \nthe total number of cards.\n\nThe next line contains a string s of length n — the colors of the cards. \ns contains only the characters 'B', 'G', and 'R', representing blue, green, \nand red, respectively.\nOutput\n\nPrint a single string of up to three characters — the possible colors of \nthe final card (using the same symbols as the input) in alphabetical order.\n'''\n\nimport io\nimport sys\nimport time\nimport random\n#~ start = time.clock()\n#~ test ='''5\n#~ BBBBB'''\n#~ test = '''2\n#~ RB'''\n#~ test = '''3\n#~ GRG'''\n#~ test = '''3\n#~ RGB'''\n#~ test = '''5\n#~ RGBBB'''\n#~ test = '''2\n#~ RG'''\n#~ test = '''3\n#~ RRG'''\n#~ test = '''3\n#~ BBG'''\n\n#~ sys.stdin = io.StringIO(test)\n\nn = int(input())\ncols = 'RGB'\ncounts = {'R':0,'G':0,'B':0}\nfor c in input():\n counts[c] += 1\n\n# single color\n# 2 colors -> c1, c2\n# 3 colors\n\ndef gettwocolors(counts):\n if counts['R']==0:\n return \"GB\"\n if counts['G']==0:\n return \"RB\"\n if counts['B']==0:\n return \"RG\"\n \ndef printcols(cols):\n print(sortedcols(cols))\n\ndef sortedcols(cols):\n return \"\".join(sorted(list(cols)))\n \ncomplement = { \n sortedcols(\"RG\"):\"B\",\n sortedcols(\"RB\"):\"G\",\n sortedcols(\"GB\"):\"R\" \n} \n\nif counts['R']>0 and counts['G']>0 and counts['B']>0:\n printcols(\"RGB\")\nelse:\n c1,c2 = gettwocolors(counts)\n if counts[c1]==0:\n printcols(c2)\n elif counts[c2]==0:\n printcols(c1)\n else:\n # really two colors\n if counts[c1]>=2 and counts[c2]>=2:\n printcols(\"RGB\")\n elif counts[c1]>=2:\n printcols( c2+complement[sortedcols(c1+c2)] )\n elif counts[c2]>=2:\n printcols( c1+complement[sortedcols(c1+c2)] )\n else:\n printcols( complement[sortedcols(c1+c2)] )\n \n#~ dur = time.clock()-start\n#~ print(\"Time:\",dur)\n", "#imafool\r\nn = int(input())\r\ndata = list(input())\r\nw = \"BGR\"\r\ncnt = [data.count(i) for i in w]\r\nres = \"\"\r\nfor i in range(3):\r\n\tx,y,z = cnt[i],cnt[(i+1)%3],cnt[(i+2)%3]\r\n\tif (x>=1 and y == z== 0) or (y>=1 and z>=1) or (x>=1 and(y>=2 or z>=2)):\r\n\t\tres += w[i]\r\nprint(res)", "#!/bin/python3\n\ninput()\ns = input()\nrc = s.count('R')\ngc = s.count('G')\nbc = s.count('B')\n\nrc = 2 if rc > 1 else rc\ngc = 2 if gc > 1 else gc\nbc = 2 if bc > 1 else bc\n\nans = ''\n\nif gc == bc == 0 or gc*bc > 0 or (gc*bc == 0 and gc+bc>1 and rc > 0):\n ans = ans+'R' \nif rc == bc == 0 or rc*bc > 0 or (rc*bc == 0 and rc+bc>1 and gc > 0):\n ans = ans+'G' \nif gc == rc == 0 or gc*rc > 0 or (gc*rc == 0 and gc+rc>1 and bc > 0):\n ans = ans+'B' \n\nprint(''.join(sorted(set(ans))))\n", "n = int(input())\ns = input()\nblue = 0; red = 0; green = 0\nfor i in range(n):\n\tif s[i] == 'B':\n\t\tblue += 1\n\telif s[i] == 'R':\n\t\tred += 1\n\telse:\n\t\tgreen += 1\nif red >= 1 and blue >= 1 and green >= 1:\n\tprint('BGR')\nelif (red > 1 and blue > 1) or (red > 1 and green > 1) or (green > 1 and blue > 1):\n\tprint('BGR')\nelif (red == 0 and blue == 0):\n\tprint('G')\nelif (red == 0 and green == 0):\n\tprint('B')\nelif (blue == 0 and green == 0):\n\tprint('R')\nelif (red == 1 and blue > 1):\n\tprint('GR')\nelif (red == 1 and green > 1):\n\tprint('BR')\nelif (blue == 1 and red > 1):\n\tprint('BG')\nelif (blue == 1 and green > 1):\n\tprint('BR')\nelif (green == 1 and red > 1):\n\tprint('BG')\nelif (green == 1 and blue > 1):\n\tprint('GR')\nelif (red == 1 and blue == 1):\n\tprint('G')\nelif (red == 1 and green == 1):\n\tprint('B')\nelif (blue == 1 and red == 1):\n\tprint('G')\nelif (blue == 1 and green == 1):\n\tprint('R')\nelif (green == 1 and red == 1):\n\tprint('B')\nelif (green == 1 and blue == 1):\n\tprint('R')\n", "n=int(input())\ns=input()\nr=s.count(\"R\")\ng=s.count(\"G\")\nb=s.count(\"B\")\nif r>=1 and g>=1 and b>=1:\n\tprint(\"BGR\")\nelse:\n\tif r==0:\n\t\tif g==0:\n\t\t\tprint(\"B\")\n\t\t\texit()\n\t\tif b==0:\n\t\t\tprint(\"G\")\n\t\t\texit()\n\t\tif b>1 and g>1:\n\t\t\tprint(\"BGR\")\n\t\t\texit()\n\t\telif b==1 and g>1:\n\t\t\tprint(\"BR\")\n\t\t\texit()\n\t\telif b>1 and g==1:\n\t\t\tprint(\"GR\")\n\t\t\texit()\n\t\telse:\n\t\t\tprint(\"R\")\n\t\t\texit()\n\t\t\n\tif g==0:\n\t\tif r==0:\n\t\t\tprint(\"B\")\n\t\t\texit()\n\t\tif b==0:\n\t\t\tprint(\"R\")\n\t\t\texit()\n\t\tif b>1 and r>1:\n\t\t\tprint(\"BGR\")\n\t\t\texit()\n\t\telif b==1 and r>1:\n\t\t\tprint(\"BG\")\n\t\t\texit()\n\t\telif b>1 and r==1:\n\t\t\tprint(\"GR\")\n\t\t\texit()\n\t\telse:\n\t\t\tprint(\"G\")\n\t\t\texit()\n\n\tif b==0:\n\t\tif r==0:\n\t\t\tprint(\"G\")\n\t\t\texit()\n\t\tif g==0:\n\t\t\tprint(\"R\")\n\t\t\texit()\n\t\tif r>1 and g>1:\n\t\t\tprint(\"BGR\")\n\t\t\texit()\n\t\telif r==1 and g>1:\n\t\t\tprint(\"BR\")\n\t\t\texit()\n\t\telif r>1 and g==1:\n\t\t\tprint(\"BG\")\n\t\t\texit()\n\t\telse:\n\t\t\tprint(\"B\")\n\t\t\texit()\n\n\n\"\"\"\ns=[i for in s]\ns.sort()\n\ndef gb(s):\n\tif \"R\" in s and \"G\" in s:\n\t\treturn \"B\"\n\telif \"R\" in s and \"B\" in s:\n\t\treturn \"G\"\n\telif \"B\" in s and \"G\" in s: \n\t\treturn \"R\"\nmemo={}\ndef poss(s,n,now):\n\tsj=\"\".join(s)\n\tif sj in memo():\n\t\t\n\t\n\tif n==1:\n\t\tnow.append(s)\n\t\treturn now\n\tfor i in range(n-1):\n\t\tfor j in range(i+1,n):\n\t\t\tts=sorted(s[:i]+s[i+1:j]+s[j+1:]+[gb(s[i]+s[j])])\n\t\t\tnow=poss(ts,n-1,now)\n\t\t\tif \"R\" in now and \"B\" in now and \"G\" in now:\n\t\t\t\treturn now\n\n\n\t\t\t\n\t\n\t\n\n\n\nprint(poss(s,n,[]))\n\"\"\"\n", "import collections as cc\r\nI=lambda:list(map(int,input().split()))\r\nn,=I()\r\nF=cc.Counter(input())\r\nif len(F) < 2:\r\n print(*F)\r\nelif len(F) > 2:\r\n print('BGR')\r\nelse:\r\n f1, f2 = F.values()\r\n if f1 == f2 == 1:\r\n print((set('BGR') - set(F.keys())).pop())\r\n elif f1 > 1 and f2 > 1:\r\n print('BGR')\r\n else:\r\n print(*(c for c in 'BGR' if c not in F or F[c] == 1), sep='')", "from functools import cache\r\n\r\nans = \"\"\r\n\r\n@cache\r\ndef backtrack(r, g, b):\r\n global ans\r\n if r+g+b == 2:\r\n if 2 in [r,g,b]:\r\n ans += \"RGB\"[[r,g,b].index(2)]\r\n return 1\r\n else:\r\n ans += \"RGB\"[[r,g,b].index(0)]\r\n return 1\r\n if r > 1: backtrack(r-1, g, b)\r\n if g > 1: backtrack(r, g-1, b)\r\n if b > 1: backtrack(r, g, b-1)\r\n if r>0 and g>0: backtrack(r-1, g-1, b+1)\r\n if g>0 and b>0: backtrack(r+1, g-1, b-1)\r\n if r>0 and b>0: backtrack(r-1, g+1, b-1)\r\n \r\n\r\nn = int(input())\r\nrgb = input()\r\nif len(rgb) == 1:\r\n print(rgb)\r\n exit(0)\r\nbacktrack(rgb.count(\"R\"), rgb.count(\"G\"), rgb.count(\"B\"))\r\nprint(\"\".join(sorted(map(str, set(ans)))))", "n=int(input());\r\ns=input();\r\nif s.count('R')and s.count('G')and s.count('B'):\r\n print('BGR');\r\nelif s.count('R')and not s.count('G')and not s.count('B'):\r\n print('R');\r\nelif not s.count('R')and not s.count('G')and s.count('B'):\r\n print('B');\r\nelif not s.count('R')and s.count('G')and not s.count('B'):\r\n print('G');\r\n\r\nelif s.count('R')and s.count('G')and not s.count('B'):\r\n if s.count('R')==1and s.count('G')==1:\r\n print('B');\r\n elif s.count('R')==1and s.count('G')>1:\r\n print('BR');\r\n elif s.count('R')>1and s.count('G')==1:\r\n print('BG');\r\n else:\r\n print('BGR');\r\nelif s.count('R')and not s.count('G')and s.count('B'):\r\n if s.count('R')==1and s.count('B')==1:\r\n print('G');\r\n elif s.count('R')==1and s.count('B')>1:\r\n print('GR');\r\n elif s.count('R')>1and s.count('B')==1:\r\n print('BG');\r\n else:\r\n print('BGR');\r\nelif not s.count('R')and s.count('G')and s.count('B'):\r\n if s.count('B')==1and s.count('G')==1:\r\n print('R');\r\n elif s.count('B')==1and s.count('G')>1:\r\n print('BR');\r\n elif s.count('B')>1and s.count('G')==1:\r\n print('GR');\r\n else:\r\n print('BGR');\r\n", "from collections import Counter\r\n\r\nn = int(input().strip())\r\ns = input().strip()\r\n\r\ncounter = Counter(s)\r\n\r\ns_colors = set(counter.keys())\r\n\r\nans = ''\r\nif len(s_colors) == 3 or (counter['B'] >= 2 and counter['G'] >= 2) or (counter['G'] >= 2 and counter['R'] >= 2)or (counter['B'] >= 2 and counter['R'] >= 2):\r\n ans = 'BGR'\r\nelif len(s_colors) == 1:\r\n ans = s_colors.pop()\r\nelif (counter['B'] == 1 and counter['G'] == 1) or (counter['G'] == 1 and counter['R'] == 1) or (counter['B'] == 1 and counter['R'] == 1):\r\n ans = set('BGR').difference(s_colors).pop()\r\nelse:\r\n for c in s_colors:\r\n other_color = s_colors.difference({c}).pop()\r\n if counter[c] >= 2 and counter[other_color] == 1:\r\n ans = ''.join(sorted(set('BGR').difference({c})))\r\n break\r\n\r\nprint(ans)\r\n", "n = int(input())\ncards = input()\ncount = [0,0,0]\norder = \"BGR\"\nfor i in cards:\n count[order.index(i)] += 1\nif n == 1:\n print(cards)\nelif n == 2:\n if count.count(1) == 2:\n print(order[count.index(0)])\n else:\n print(order[count.index(2)])\nelif 1 in count and 0 in count:\n print(\"\".join([order[i] for i in range(3) if count[i] <= 1]))\nelif sum(1 for i in count if i > 1) >= 2:\n print(order)\nelif count.count(0) == 0:\n print(order)\nelse:\n print(\"\".join([order[i] for i in range(3) if count[i] > 0]))\n\t \t\t \t\t \t \t\t\t\t\t\t\t\t \t\t \t \t", "input()\r\ns = str(input())\r\nr = s.count('R')\r\nb = s.count('B')\r\ng = s.count('G')\r\n\r\nif (r >= 1 and b >= 1 and g >= 1) or (r >= 2 and b >= 2 and g == 0) or (r == 0 and b >= 2 and g >= 2) or (r >= 2 and b == 0 and g >= 2):\r\n print('BGR')\r\nif (r >= 1 and b == 0 and g == 0) or (r == 0 and b == 1 and g == 1):\r\n print('R')\r\nif (r == 0 and b >= 1 and g == 0) or (r == 1 and b == 0 and g == 1):\r\n print('B')\r\nif (r == 0 and b == 0 and g >= 1) or (r == 1 and b == 1 and g == 0):\r\n print('G')\r\nif (r >= 2 and b == 1 and g == 0) or (r >= 2 and b == 0 and g == 1):\r\n print('BG')\r\nif (r == 0 and b >= 2 and g == 1) or (r == 1 and b >= 2 and g == 0):\r\n print('GR')\r\nif (r == 0 and b == 1 and g >= 2) or (r == 1 and b == 0 and g >= 2):\r\n print('BR')\r\n", "from sys import exit\r\nn = int(input())\r\ns = input()\r\nif \"R\" in s and \"G\" in s and \"B\" in s:\r\n print('BGR')\r\n exit()\r\nif 'R' not in s and 'G' not in s:\r\n print('B')\r\n exit()\r\nif 'R' not in s and 'B' not in s:\r\n print('G')\r\n exit()\r\nif 'B' not in s and 'G' not in s:\r\n print('R')\r\n exit()\r\n\r\nif \"R\" in s and \"G\" in s:\r\n answer = 'B'\r\n if s.count('R') > 1:\r\n answer += 'G'\r\n if s.count('G') > 1:\r\n answer += 'R'\r\n print(answer)\r\n exit()\r\nif \"R\" in s and \"B\" in s:\r\n answer = 'G'\r\n if s.count('R') > 1:\r\n answer = 'B' + answer\r\n if s.count('B') > 1:\r\n answer += 'R'\r\n print(answer)\r\n exit()\r\nif \"B\" in s and \"G\" in s:\r\n answer = 'R'\r\n if s.count('B') > 1:\r\n answer = 'G' + answer\r\n if s.count('G') > 1:\r\n answer = 'B' + answer\r\n print(answer)\r\n exit()", "#626B\r\nn=int(input())\r\na=input()\r\nrt=a.count(\"R\")\r\ngt=a.count(\"G\")\r\nbt=a.count(\"B\")\r\n\r\nif gt>0 and bt>0 and rt>0 :\r\n\tprint (\"BGR\")\r\nelif (gt>=2 and bt>=2) or (gt>=2 and rt>=2) or (rt>=2 and bt>=2):\r\n\tprint (\"BGR\")\r\nelif gt>=2 and (bt==1 or rt==1):\r\n\tprint(\"BR\")\r\nelif rt>=2 and (bt==1 or gt==1):\r\n\tprint(\"BG\")\r\nelif bt>=2 and (gt==1 or rt==1):\r\n\tprint(\"GR\")\r\nelif gt*rt>0:\r\n\tprint(\"B\")\r\nelif bt*rt>0:\r\n\tprint(\"G\")\r\nelif gt*bt>0:\r\n\tprint(\"R\")\r\nelif bt>0:\r\n\tprint(\"B\")\r\nelif gt>0:\r\n\tprint(\"G\")\r\nelif rt>0:\r\n\tprint(\"R\")", "from sys import stdin\nn = int(stdin.readline())\ns = stdin.readline()\n\narr = [0,0,0] #'BGR'\nfor i in s:\n\tif i=='B': arr[0] += 1\n\telif i=='G': arr[1] += 1\n\telif i=='R': arr[2] += 1\n\npossible = [False,False,False] #'BGR'\n\n\n\ndef f(l):\n\n\t#for 3-letter systems\n\tif l[0]!=0 and l[1]!=0 and l[2]!=0: possible[0],possible[1],possible[2] = True,True,True\n\n\telse:\n\n\t\t#for 1-letter systems\n\t\tif l[1]==0 and l[2]==0: possible[0] = True\n\t\telif l[2]==0 and l[0]==0: possible[1] = True\n\t\telif l[0]==0 and l[1]==0: possible[2] = True\n\n\t\t#for 2-letter systems\n\t\telse:\n\n\t\t\tif l[0]!=0 and l[1]!=0:\n\t\t\t\tpossible[2] = True\n\t\t\t\tf ([l[0]-1, l[1]-1, l[2]+1])\n\n\t\t\telif l[1]!=0 and l[2]!=0:\n\t\t\t\tpossible[0] = True\n\t\t\t\tf ( [l[0]+1, l[1]-1, l[2]-1] )\n\n\t\t\telif l[2]!=0 and l[0]!=0:\n\t\t\t\tpossible[1] = True\n\t\t\t\tf ( [l[0]-1, l[1]+1, l[2]-1] )\n\n\n\nf(arr)\n\nans=\"\"\nif possible[0]==True: ans += 'B'\nif possible[1]==True: ans += 'G'\nif possible[2]==True: ans += 'R'\nprint(ans)", "input()\r\nrgb = input().strip()\r\nr = rgb.count('R')\r\ng = rgb.count('G')\r\nb = rgb.count('B')\r\n\r\nif r == len(rgb) or g == len(rgb) or b == len(rgb):\r\n if r == len(rgb):\r\n print('R')\r\n if g == len(rgb):\r\n print('G')\r\n if b == len(rgb):\r\n print('B')\r\nelif r != 0 and g != 0 and b != 0:\r\n print('BGR')\r\nelse:\r\n if r == 0:\r\n if g == 1 and b == 1:\r\n print('R')\r\n elif g > 1 and b > 1:\r\n print('BGR')\r\n elif g > 1 and b == 1:\r\n print('BR')\r\n elif g == 1 and b > 1:\r\n print('GR')\r\n\r\n elif g == 0:\r\n if b == 1 and r == 1:\r\n print('G')\r\n elif b > 1 and r > 1:\r\n print('BGR')\r\n elif b > 1 and r == 1:\r\n print('GR')\r\n elif b == 1 and r > 1:\r\n print('BG')\r\n \r\n elif b == 0:\r\n if g == 1 and r == 1:\r\n print('B')\r\n elif g > 1 and r > 1:\r\n print('BGR')\r\n elif g > 1 and r == 1:\r\n print('BR')\r\n elif g == 1 and r > 1:\r\n print('BG')\r\n", "def main():\r\n n = int(input())\r\n s = input()\r\n \r\n b, g, r = [s.count(i) for i in \"BGR\"]\r\n \r\n if min(b, g, r) > 0:\r\n print(\"BGR\")\r\n return\r\n if max(b, g, r) == n:\r\n if b == n: print(\"B\")\r\n if g == n: print(\"G\")\r\n if r == n: print(\"R\")\r\n return\r\n if max(b, g, r) == 1:\r\n if b == 0: print(\"B\")\r\n if g == 0: print(\"G\")\r\n if r == 0: print(\"R\")\r\n return\r\n if max(b, g, r) == n - 1:\r\n if b == n - 1: print(\"GR\")\r\n if g == n - 1: print(\"BR\")\r\n if r == n - 1: print(\"BG\")\r\n return \r\n \r\n print(\"BGR\")\r\n \r\n \r\nmain()", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n \nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef ceil(a,b): return (a+b-1)//b\nS1 = 'abcdefghijklmnopqrstuvwxyz'\nS2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \nn = iinp()\nr = g = b = 0\ns = inp()\ncnt = l1d(3)\nt = 'BGR'\nfor c in s:\n cnt[t.index(c)] += 1\ncnt = [(cnt[i], t[i]) for i in range(3)]\ncnt.sort()\nif not cnt[1][0]:\n print(cnt[2][1])\nelif cnt[0][0] >= 1 or cnt[1][0] >= 2:\n print('BGR')\nelif cnt[0][0]==cnt[1][0]==1:\n print(cnt[2][1])\nelif cnt[1][0]==cnt[2][0]==1:\n print(cnt[0][1])\nelse:\n print(''.join(sorted([cnt[0][1], cnt[1][1]])))", "n= int(input())\r\nl=[x for x in input()]\r\ns=set(l)\r\nsl = len(s)\r\nalpa = ['B', 'G', 'R']\r\n\r\nif sl==1:\r\n print(l[0])\r\n\r\nelif sl==3:\r\n print(\"BGR\")\r\n\r\n\r\nelse:\r\n l2=[]\r\n for x in s:\r\n l2.append(x)\r\n\r\n c1=l.count(l2[0])\r\n c2=l.count(l2[1])\r\n\r\n if c1>1 and c2>1:\r\n print(\"BGR\")\r\n\r\n elif c1>1:\r\n x=l2[0]\r\n for i in alpa:\r\n if i!=x:\r\n print(i, end=\"\")\r\n print()\r\n\r\n elif c2>1:\r\n x = l2[1]\r\n for i in alpa:\r\n if i != x:\r\n print(i, end=\"\")\r\n print()\r\n\r\n else:\r\n x = l2[1]\r\n y=l2[0]\r\n for i in alpa:\r\n if i != x and i!=y:\r\n print(i, end=\"\")\r\n print()", "def calc():\r\n n = int(input())\r\n deck = input()\r\n if len(set(deck)) == 1:\r\n print(deck[0])\r\n exit()\r\n if len(set(deck)) == 3:\r\n print(\"BGR\")\r\n exit()\r\n r_count = deck.count(\"R\")\r\n g_count = deck.count(\"G\")\r\n b_count = deck.count(\"B\")\r\n if (r_count > 1 and b_count > 1) or (b_count > 1 and g_count > 1) or (g_count > 1 and r_count > 1):\r\n print(\"BGR\")\r\n exit()\r\n if r_count == 1 and b_count == 1:\r\n print(\"G\")\r\n exit()\r\n if g_count == 1 and r_count == 1:\r\n print(\"B\")\r\n exit()\r\n if b_count == 1 and g_count == 1:\r\n print(\"R\")\r\n exit()\r\n if r_count > 1 and b_count == 1:\r\n print(\"BG\")\r\n exit()\r\n if r_count > 1 and g_count == 1:\r\n print(\"BG\")\r\n exit()\r\n if g_count > 1 and r_count == 1:\r\n print(\"BR\")\r\n exit()\r\n if g_count > 1 and b_count == 1:\r\n print(\"BR\")\r\n exit()\r\n if b_count > 1 and g_count == 1:\r\n print(\"GR\")\r\n exit()\r\n if b_count > 1 and r_count == 1:\r\n print(\"GR\")\r\n exit()\r\n\r\n\r\ncalc()\r\n", "#!/usr/bin/env python3\nn = int(input())\ns = input()\nt = 'BGR'\na = [s.count(c) for c in t]\nans = ''\nfor i in range(3):\n x, y, z = a[i], a[(i+1)%3], a[(i+2)%3]\n if (x >= 1 and y == z == 0) or (y >= 1 and z >= 1) or (x >= 1 and (y >= 2 or z >= 2)):\n ans += t[i]\nprint(ans)\n", "a = int(input())\ns = input()\n\narr = [0, 0, 0]\n\nfor i in range(len(s)):\n\tif s[i] == \"B\":\n\t\tarr[0] += 1\n\telif s[i] == \"G\":\n\t\tarr[1] += 1\n\telse:\n\t\tarr[2] += 1\n\nb = arr[0]\ng = arr[1]\nr = arr[2]\n\na = [False, False, False]\n\nif b > 0 and g > 0 and r > 0:\n\ta = [True, True, True]\nelif b == 0 and g == 0:\n\ta = [False, False, True]\nelif b == 0 and r == 0:\n\ta = [False, True, False]\nelif g == 0 and r == 0:\n\ta = [True, False, False]\nelif b == 0:\n\tif g > 1 and r > 1:\n\t\ta = [True, True, True]\n\telif g == 1 and r > 1:\n\t\ta = [True, True, False]\n\telif r == 1 and g > 1:\n\t\ta = [True, False, True]\n\telse:\n\t\ta = [True, False, False]\nelif g == 0:\n\tif b > 1 and r > 1:\n\t\ta = [True, True, True]\n\telif b == 1 and r > 1:\n\t\ta = [True, True, False]\n\telif r == 1 and b > 1:\n\t\ta = [False, True, True]\n\telse:\n\t\ta = [False, True, False]\nelif r == 0:\n\tif g > 1 and b > 1:\n\t\ta = [True, True, True]\n\telif g == 1 and b > 1:\n\t\ta = [False, True, True]\n\telif b == 1 and g > 1:\n\t\ta = [True, False, True]\n\telse:\n\t\ta = [False, False, True]\n\nt = \"\"\nif a[0] == True:\n\tt += \"B\"\nif a[1] == True:\n\tt += \"G\"\nif a[2] == True:\n\tt += \"R\"\n\nprint(t)\n", "n = int(input())\nc = (lambda s: {(s.count(color), color) for color in 'BGR' if s.count(color)})(input())\nif len(c) == 3 or (len(c) == 2 and min(c)[0] > 1):\n print('BGR')\nelif len(c) == 1:\n print(min(c)[1])\nelif max(c)[0] > 1:\n print(*sorted(set('BGR') - {max(c)[1]}), sep = '')\nelse:\n print(*(set('BGR') - {x[1] for x in c}))\n", "from collections import namedtuple\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n = int(input())\r\n cards = input()\r\n\r\n r = 0\r\n g = 0\r\n b = 0\r\n for card in cards:\r\n if card == \"R\":\r\n r += 1\r\n elif card == \"G\":\r\n g += 1\r\n elif card == \"B\":\r\n b += 1\r\n\r\n #print(r,g,b)\r\n\r\n colornum = 0\r\n if r:\r\n colornum += 1\r\n if g:\r\n colornum += 1\r\n if b:\r\n colornum += 1\r\n\r\n res = \"\"\r\n if colornum == 3:\r\n res = \"BGR\"\r\n elif colornum == 2:\r\n if r == 1:\r\n if b == 1:\r\n res = \"G\"\r\n elif b > 1:\r\n res = \"GR\"\r\n elif g == 1:\r\n res = \"B\"\r\n elif g > 1:\r\n res = \"BR\"\r\n elif g == 1:\r\n if r == 1:\r\n res = \"B\"\r\n elif b == 1:\r\n res = \"R\"\r\n elif r > 1:\r\n res = \"BG\"\r\n elif b > 1:\r\n res = \"GR\"\r\n elif b == 1:\r\n if r == 1:\r\n res = \"G\"\r\n elif g == 1:\r\n res = \"R\"\r\n elif r > 1:\r\n res = \"BG\"\r\n elif g > 1:\r\n res = \"BR\"\r\n else:\r\n res = \"BGR\"\r\n else:\r\n if r:\r\n res = \"R\"\r\n elif g:\r\n res = \"G\"\r\n elif b:\r\n res = \"B\"\r\n\r\n print(res)", "from collections import Counter\nn = int(input())\ns = input()\nc = Counter(s)\nb, g, r = c[\"B\"], c[\"G\"], c[\"R\"]\nli = [c[\"B\"], c[\"G\"], c[\"R\"]]\nzero = li.count(0)\nif b > 0 and g > 0 and r > 0:\n print(\"BGR\")\nelif zero == 2:\n for x in c:\n if c[x] != 0:\n print(x)\n break\nelse:\n if b == 0:\n if g > 1 and r > 1:\n print(\"BGR\")\n elif g == 1 and r>1:\n print(\"BG\")\n elif r==1 and g>1:\n print(\"BR\")\n else:\n print(\"B\")\n elif g == 0:\n if b > 1 and r > 1:\n print(\"BGR\")\n elif b == 1 and r>1:\n print(\"BG\")\n elif r==1 and b>1:\n print(\"GR\")\n else:\n print(\"G\")\n elif r == 0:\n if g > 1 and b > 1:\n print(\"BGR\")\n elif g == 1 and b>1:\n print(\"GR\")\n elif b==1 and g>1:\n print(\"BR\")\n else:\n print(\"R\")", "n = int(input())\r\ns = input()\r\ng = s.count('G')\r\nb = s.count('B')\r\nr = s.count('R')\r\n\r\nif g != 0 and r != 0 and b != 0: print('BGR')\r\nelif g==0 and r == 0: print('B')\r\nelif g==0 and b == 0: print('R')\r\nelif b==0 and r == 0: print('G')\r\nelif g==0:\r\n \r\n if r >= 2: print('B',end = '')\r\n print('G',end = '')\r\n if b >= 2: print('R', end = '')\r\nelif r==0:\r\n \r\n if g >= 2: print('B',end = '')\r\n if b >= 2: print('G', end = '')\r\n print('R',end = '')\r\nelif b==0:\r\n print('B',end = '')\r\n if r >= 2: print('G',end = '')\r\n if g >= 2: print('R', end = '')", "#!/usr/bin/env python3\nimport collections, itertools, functools, math, sys\n\[email protected]_cache(None)\ndef dp(r, g, b):\n if r + g + b == 1:\n if r:\n return 0x1\n if g:\n return 0x2\n if b:\n return 0x4\n res = 0\n if r >= 2:\n res |= dp(r-1, g, b)\n if g >= 2:\n res |= dp(r, g-1, b)\n if b >= 2:\n res |= dp(r, g, b-1)\n if r > 0 and g > 0:\n res |= dp(r-1, g-1, b+1)\n if r > 0 and b > 0:\n res |= dp(r-1, g+1, b-1)\n if g > 0 and b > 0:\n res |= dp(r+1, g-1, b-1)\n return res\n\ndef solve():\n n = int(input())\n cnt = collections.Counter(input())\n r = dp(cnt['R'], cnt['G'], cnt['B'])\n return [None, 'R', 'G', 'GR', 'B', 'BR', 'BG', 'BGR'][r]\n\n\nif __name__ == '__main__':\n sys.setrecursionlimit(10000)\n print(solve())\n\n", "n = int(input())\ns = str(input())\nt = \"BGR\"\na = [s.count(c) for c in t]\nrez = \"\"\nfor i in range(3):\n x, y, z = a[i], a[(i + 1) % 3], a[(i + 2) % 3]\n if (\n (x >= 1 and y == z == 0)\n or (y >= 1 and z >= 1)\n or (x >= 1 and (y >= 2 or z >= 2))\n ):\n rez += t[i]\nprint(rez)\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\ns = input().strip()\n\na,b,c=sorted((s.count(x),x) for x in 'RGB')\nif a[0] or b[0]>1:\n print('BGR')\nelif b[0] and c[0]>1:\n print(''.join(sorted(a[1]+b[1])))\nelif b[0]:\n print(a[1])\nelse:\n print(c[1])\n", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nb, g, r = 0, 0, 0\r\nfor i in range(0, len(s)):\r\n if s[i] == 'B':\r\n b += 1\r\n elif s[i] == 'G':\r\n g += 1\r\n elif s[i] == 'R':\r\n r += 1\r\n else:\r\n assert False\r\n\r\nif b != 0 and g == 0 and r == 0 or \\\r\n b == 0 and g == 1 and r == 1:\r\n print('B')\r\nelif b == 0 and g != 0 and r == 0 or \\\r\n b == 1 and g == 0 and r == 1:\r\n print('G')\r\nelif b == 0 and g == 0 and r != 0 or \\\r\n b == 1 and g == 1 and r == 0:\r\n print('R')\r\nelif b > 1 and g == 1 and r == 0 or\\\r\n b > 1 and g == 0 and r == 1:\r\n print('GR')\r\nelif b == 0 and g > 1 and r == 1 or\\\r\n b == 1 and g > 1 and r == 0:\r\n print('BR')\r\nelif b == 0 and g == 1 and r > 1 or\\\r\n b == 1 and g == 0 and r > 1:\r\n print('BG')\r\nelse:\r\n print('BGR')\r\n", "def solution(s):\r\n cR, cG, cB = 0, 0, 0\r\n for ch in s:\r\n if ch == 'R':\r\n cR += 1\r\n elif ch == 'G':\r\n cG += 1\r\n else:\r\n cB += 1\r\n if cR > 0 and cG > 0 and cB > 0 or sorted([cR, cG, cB])[1] > 1:\r\n return 'BGR'\r\n if cR == 0 and cG == 0:\r\n return 'B'\r\n if cG == 0 and cB == 0:\r\n return 'R'\r\n if cR == 0 and cB == 0:\r\n return 'G'\r\n if s == 'GR' or s == 'RG':\r\n return 'B'\r\n if s == 'RB' or s == 'BR':\r\n return 'G'\r\n if s == 'BG' or s == 'GB':\r\n return 'R'\r\n if cR > 1:\r\n return 'BG'\r\n if cG > 1:\r\n return 'BR'\r\n return 'GR'\r\n\r\nN = int(input())\r\ns = input()\r\nprint(solution(s))", "def visit(r,g,b):\r\n if r<0 or g<0 or b<0:\r\n return\r\n if vis[r][g][b]:\r\n return\r\n vis[r][g][b]=True\r\n if r>1:\r\n visit(r-1,g,b)\r\n if g>1:\r\n visit(r,g-1,b)\r\n if b>1:\r\n visit(r,g,b-1)\r\n visit(r-1,g-1,b+1)\r\n visit(r+1,g-1,b-1)\r\n visit(r-1,g+1,b-1)\r\n \r\nn=int(input())\r\ns=input()\r\nvis=[[[False for i in range(201)] for j in range(201)] for k in range(200)]\r\nh={\"R\":0,\"G\":0,\"B\":0}\r\nfor i in s:\r\n h[i]+=1\r\nvisit(h[\"R\"],h[\"G\"],h[\"B\"])\r\nif vis[0][0][1]:\r\n print(\"B\",end=\"\")\r\nif vis[0][1][0]:\r\n print(\"G\",end=\"\")\r\nif vis[1][0][0]:\r\n print(\"R\",end=\"\")", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n \nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef ceil(a,b): return (a+b-1)//b\nS1 = 'abcdefghijklmnopqrstuvwxyz'\nS2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \nn = iinp()\nr = g = b = 0\ns = inp()\nfor c in s:\n r += c=='R'\n g += c=='G'\n b += c=='B'\nif r+g==0:\n print('B')\nelif r+b==0:\n print('G')\nelif b+g==0:\n print('R')\nelif min(r, g, b)>=1 or max(min(r, g), min(g, b), min(r, b)) >= 2:\n print('BGR')\nelif r==b==1: print('G')\nelif r==g==1: print('B')\nelif b==g==1: print('R')\nelif r>1:\n print('BG')\nelif b>1:\n print('GR')\nelse:\n print('BR')", "from sys import stdin, stdout\r\nn=int(stdin.readline())\r\ns=stdin.readline()[:-1]\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in s:\r\n\tif i=='R':\r\n\t\tc1+=1\r\n\telif i=='B':\r\n\t\tc2+=1\r\n\telse:\r\n\t\tc3+=1\r\nif (c1>0 and c2>0 and c3>0) or (c1>1 and c2>1) or (c1>1 and c3>1) or (c2>1 and c3>1):\r\n\tprint('BGR')\r\nelif c1>0:\r\n\tif c2>1:\r\n\t\tprint('GR')\r\n\telif c3>1:\r\n\t\tprint('BR')\r\n\telif (c2==1 or c3==1) and c1>1:\r\n\t\tprint('BG')\r\n\telif c2==1 and c1==1:\r\n\t\tprint('G')\r\n\telif c1==1 and c3==1:\r\n\t\tprint('B')\r\n\telse:\r\n\t\tprint('R')\r\nelif c2>0:\r\n\tif c3>1:\r\n\t\tprint('BR')\r\n\telif c2>1 and c3==1:\r\n\t\tprint('GR')\r\n\telif c2==1 and c3==1:\r\n\t\tprint('R')\r\n\telse:\r\n\t\tprint('B')\r\nelse:\r\n\tprint('G')\r\n\r\n\r\n\r\n", "input()\r\ns = input()\r\nr,g,b=[s.count(x)for x in\"RGB\"]\r\nA,B,C = sorted([(r,\"R\"),(g,\"G\"),(b,\"B\")],reverse=True)\r\nif C[0]or B[0]>1: print(\"BGR\")\r\nelif B[0] and A[0]>=2:print(\"\".join(sorted(x[1]for x in(B,C))))\r\nelif B[0]:print(C[1])\r\nelif A[0]:print(A[1])\r\n", "le = int(input())\r\ns = input()\r\nl = [0,0,0]#B,G,R\r\nfor i in range(le):\r\n c = s[i]\r\n if c == 'B':\r\n l[0] += 1\r\n elif c == 'G':\r\n l[1] += 1\r\n else:\r\n l[2] += 1\r\nif min(l) > 0:\r\n print('BGR')\r\nelif l[0] == 0 and l[1] == 0:\r\n print('R')\r\nelif l[2] == 0 and l[1] == 0:\r\n print('B')\r\nelif l[0] == 0 and l[2] == 0:\r\n print('G')\r\nelif l[0] == 0:\r\n if l[1] == 1 and l[2] == 1:\r\n print('B')\r\n elif l[1] == 1:\r\n print('BG')\r\n elif l[2] == 1:\r\n print('BR')\r\n else:\r\n print('BGR')\r\nelif l[1] == 0:\r\n if l[0] == 1 and l[2] == 1:\r\n print('G')\r\n elif l[0] == 1:\r\n print('BG')\r\n elif l[2] == 1:\r\n print('GR')\r\n else:\r\n print('BGR')\r\nelse:\r\n if l[1] == 1 and l[0] == 1:\r\n print('R')\r\n elif l[0] == 1:\r\n print('BR')\r\n elif l[1] == 1:\r\n print('GR')\r\n else:\r\n print('BGR')\r\n \r\n \r\n", "n=int (input ())\r\ns=str (input ())\r\nt='BGR'\r\na=[ s.count (c) for c in t]\r\nrez=''\r\nfor i in range (3):\r\n x,y,z=a [i],a [(i+1)%3],a [(i+2)%3]\r\n if(x>=1 and y==z==0)or ( y>=1 and z>=1) or (x>=1 and (y>=2 or z>=2)):\r\n rez+=t [i]\r\nprint (rez)", "n = int(input())\r\ns = input()\r\nb = 'B' in s\r\ng = 'G' in s\r\nr = 'R' in s\r\nif b + g + r == 3:\r\n print('BGR')\r\nelif b + g + r == 1:\r\n print(s[0])\r\nelif b + g + r == 2:\r\n e = ['B', 'G', 'R']\r\n if s.count('B') == len(s) - 1:\r\n e.remove('B')\r\n if s.count('G') == len(s) - 1:\r\n e.remove('G')\r\n if s.count('R') == len(s) - 1:\r\n e.remove('R')\r\n for i in range(len(e)):\r\n print(e[i], end = '')\r\n", "n=int(input())\r\ns=input()\r\nd={}\r\nB,G,R=s.count('B'),s.count('G'),s.count('R')\r\nif B==0 and G==0: print('R')\r\nelif B==0 and R==0: print('G')\r\nelif G==0 and R==0: print('B')\r\nelif B==0 and G==1 and R==1: print('B')\r\nelif B==1 and G==0 and R==1: print('G')\r\nelif B==1 and G==1 and R==0: print('R')\r\nelif B==0 and G==1: print('BG')\r\nelif B==0 and R==1: print('BR')\r\nelif G==0 and B==1: print('BG')\r\nelif G==0 and R==1: print('GR')\r\nelif R==0 and B==1: print('BR')\r\nelif R==0 and G==1: print('GR')\r\nelse: print('BGR')" ]

[ "s = []\r\nfor i in range(int(input())):\r\n s.append(input())\r\ns = \"<3\" + '<3'.join(s) + \"<3\"\r\ncur = 0\r\nt = input()\r\nfor i in t:\r\n if i == s[cur]: cur += 1\r\n if cur == len(s): break\r\n\r\nprint('yes' if cur == len(s) else 'no')", "n=int(input())\r\ntext=\"\"\r\n\r\nfor _ in range(n):\r\n temp=input()\r\n text=text+\"<3\"\r\n text=text+temp\r\ntext=text+\"<3\"\r\n\r\ntocmp=input()\r\n\r\nj=0\r\nfor ch in tocmp:\r\n if ch==text[j]:\r\n j+=1\r\n if j==len(text):\r\n break\r\n\r\nif j==len(text):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "import sys\nimport re\nn = int(sys.stdin.readline()[:-1])\nwords = \"\"\nfor i in range(n):\n\twords += \"<3\" + sys.stdin.readline()[:-1]\nwords += \"<3\"\nline = sys.stdin.readline()[:-1].lower()\ns = 0\nfor i in range(len(line)):\n\tif(line[i] == words[s]):\n\t\ts+=1\n\t\tif(s >= len(words)):\n\t\t\tbreak\n\t\nif(s == len(words)):\n\tprint(\"yes\")\nelse:\n\tprint(\"no\")\n\n\t\t \t\t \t\t\t\t\t\t\t \t \t\t\t \t\t \t \t", "t = '<3' + '<3'.join(input() for i in range(int(input()))) + '<3'\r\np=input()\r\ns=\"yes\"\r\nj=0\r\nfor c in t:\r\n j = p.find(c, j)+1\r\n if j == 0:\r\n s = 'no'\r\n break\r\nprint(s)", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n li.append(input())\r\ns=input()\r\ni=0\r\nl=len(s)\r\nflag=True\r\ndef find(itm):\r\n global s,i,l,flag\r\n k=0\r\n l2=len(itm)\r\n while(i<l):\r\n if(itm[k]==s[i]):\r\n k+=1\r\n i+=1\r\n if(k==l2 or i==l):\r\n break\r\n else:\r\n i+=1\r\n if(i==l):\r\n flag=False\r\n break\r\n if(k<l2):\r\n flag=False\r\nfind(\"<3\")\r\nfor x in li:\r\n find(x)\r\n find(\"<3\")\r\nif(flag):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input().strip())\r\n#print (l)\r\ns=input().strip()\r\nlength=len(s)\r\nindex1=0\r\na=0\r\nb=0\r\nc=0\r\nj=0\r\nfor i in range(length):\r\n if (a==0):\r\n if (s[i]=='<'):\r\n b=1\r\n if (b==1 and s[i]=='3'):\r\n c=1\r\n if (b==1 and c==1):\r\n b=0\r\n c=0\r\n a=1\r\n else:\r\n if (index1==n):\r\n break\r\n len1=len(l[index1])\r\n if (s[i]==l[index1][j]):\r\n j+=1\r\n if (j==len1):\r\n index1+=1\r\n a=0\r\n j=0\r\nif (index1!=n):\r\n print ('no')\r\n #print (index1)\r\nelse:\r\n if (a==1):\r\n print ('yes')\r\n else:\r\n print ('no')\r\n", "def readln(): return tuple(map(int, input().split()))\n\nn, = readln()\nsms = '<3'.join([''] + [input() for _ in range(n)] + [''])\ns = 0\nfor c in list(input()):\n if sms[s] == c:\n s += 1\n if s == len(sms):\n break\nprint('yes' if s == len(sms) else 'no')\n", "import sys\nn = int(sys.stdin.readline().rstrip(\"\\n\"))\nmessage = \"<3\"\nfor i in range(n):\n x = sys.stdin.readline().rstrip(\"\\n\")\n message += x + \"<3\"\nsent = sys.stdin.readline().rstrip(\"\\n\")\nind = 0\ncorrect = False\nfor i in sent:\n if i == message[ind]:\n ind += 1\n if ind >= len(message):\n correct = True\n break\nif correct:\n print(\"yes\")\nelse:\n print(\"no\")\n\t \t \t\t \t\t\t \t \t \t\t \t \t \t\t \t", "def encoded_correcttly(right, message):\r\n for word in right: \r\n # Find the heart\r\n if '<' in message:\r\n current_index = message.find('<') + 1\r\n message = message[current_index:]\r\n else:\r\n return False\r\n\r\n # Find the 3\r\n if '3' in message:\r\n current_index = message.find('3') + 1\r\n message = message[current_index:]\r\n else:\r\n return False\r\n\r\n\r\n # Find the word\r\n for char in word:\r\n if char in message:\r\n current_index = message.find(char) + 1\r\n message = message[current_index:]\r\n else:\r\n return False\r\n\r\n # Find the last heart and 3\r\n \r\n # Find the heart\r\n if '<' in message:\r\n current_index = message.find('<') + 1\r\n message = message[current_index:]\r\n else:\r\n return False\r\n\r\n\r\n # Find the 3\r\n if '3' in message:\r\n current_index = message.find('3') + 1\r\n message = message[current_index:]\r\n else:\r\n return False\r\n\r\n\r\n\r\n \r\n return True\r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\nmessage = input()\r\n \r\nif (encoded_correcttly(l, message)):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "base = []\r\nfor _ in range((int)(input())) :\r\n base.append('<'); base.append('3');\r\n temp = (list)(input())\r\n for x in temp : base.append(x)\r\nstr = input()\r\nbase.append('<'); base.append('3');\r\nptr = 0\r\nfor i in str :\r\n if ptr < len(base) and i == base[ptr] : ptr += 1\r\nprint(\"yes\" if ptr == len(base) else \"no\")", "n = int(input())\r\nts = [input() for i in range(n)]\r\nt = '<3' + '<3'.join(ts) + '<3'\r\ns = input()\r\ni = 0\r\nj = 0\r\nwhile i < len(t) and j < len(s):\r\n if t[i] == s[j]:\r\n i += 1\r\n j += 1\r\nprint(i == len(t) and 'yes' or 'no')", "N = int(input())\r\nmsg = \"<3\".join([''] + [input() for _ in range(N)] + [''])\r\nS = input()\r\n\r\nidx = 0\r\nfor i in range(len(S)):\r\n if idx < len(msg) and msg[idx] == S[i]:\r\n idx += 1\r\n \r\nprint(\"yes\" if idx == len(msg) else \"no\")\r\n# print(msg, S)", "#!/usr/bin/env python3\nn = int(input())\nts = [input() for i in range(n)]\nt = '<3' + '<3'.join(ts) + '<3'\ns = input()\ni = 0\nj = 0\nwhile i < len(t) and j < len(s):\n if t[i] == s[j]:\n i += 1\n j += 1\nprint(i == len(t) and 'yes' or 'no')\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\ns=input()\r\nstage=0\r\ncur=0\r\ncurpos=0\r\nf=0\r\nfor j in range(len(s)):\r\n i=s[j]\r\n curword = l[cur]\r\n if stage==0 and i == \"<\": stage = 1\r\n elif stage== 1 and i == \"3\": stage = 2\r\n if stage == 2:\r\n if i == curword[curpos]: curpos += 1\r\n if curpos == len(curword):\r\n cur += 1\r\n curpos = 0\r\n stage = 0\r\n if cur == len(l):\r\n for k in range(j+1, len(s)):\r\n if s[k]==\"<\" and f==0: f=1\r\n if s[k] == \"3\" and f==1: f=2\r\n break\r\n\r\nif cur == len(l) and f==2:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "n=int(input())\r\n\r\nencode1=''.join(['<3'+input() for i in range(n)])+'<3'\r\n\r\nencode2=input()\r\n\r\ni=0\r\nj=0\r\nwhile i<len(encode1) and j<len(encode2):\r\n if(encode1[i] == encode2[j]):\r\n i+=1\r\n j+=1\r\n else:\r\n t=encode2[j]\r\n if not (('z'>=t and t>='a') or ('9'>=t and t>='0') or t=='>' or t=='<'):\r\n i=999999\r\n j=999999\r\n j+=1\r\n\r\nif i==len(encode1):\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "n = int(input())\r\na = \"<3\".join([\"\"] + [input() for _ in range(n)] + [\"\"])\r\ns = input()\r\ni = -1\r\nfor c in a:\r\n i = s.find(c, i + 1)\r\n if i == -1:\r\n print(\"no\")\r\n exit()\r\nprint(\"yes\")", "n = int(input())\r\n\r\ncin = []\r\nfor a in range(n):\r\n q = input()\r\n cin.append(q)\r\n \r\ncout = '<3'\r\ncout += '<3'.join(cin) \r\ncout += '<3'\r\n\r\ngiven = input()\r\ni = 0\r\na = 0\r\nb = 0\r\nwhile a<len(given) and b<len(cout):\r\n if given[a]==cout[b]:\r\n b += 1\r\n i += 1\r\n a += 1\r\n \r\nif i==len(cout): \r\n print('yes')\r\nelse:\r\n print('no') \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n s = input()\r\n arr.append('<')\r\n arr.append('3')\r\n for j in range(len(s)):\r\n arr.append(s[j])\r\narr.append('<')\r\narr.append('3')\r\ns = input()\r\ncur = 0\r\ni = 0\r\nwhile cur < len(s) and i < len(arr):\r\n if s[cur] == arr[i]:\r\n i+=1\r\n cur+=1\r\nif i == len(arr):\r\n print('yes')\r\nelse:\r\n print('no')", "n = int(input())\r\nref = '<3'\r\nwords = []\r\n\r\nfor i in range(n):\r\n\twords.append(input())\r\n\r\nref = ref + '<3'.join(words) + ref\r\n\r\nmessage = input()\r\ni, j = 0, 0\r\nwhile i < len(ref) and j < len(message):\r\n\tif ref[i] == message[j]:\r\n\t\ti += 1\r\n\tj += 1\r\n\r\nif i == len(ref):\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")", "a='<3'\r\nfor _ in range(int(input())):a+=input()+'<3'\r\nb=input()\r\ni,j,c,d=0,0,len(a),len(b)\r\nwhile i<c and j<d:\r\n if a[i]==b[j]:\r\n i+=1\r\n j+=1\r\n else:j+=1\r\nprint(['no','yes'][i==c])", "n = int(input())\r\ns = '<3' + '<3'.join([input() for i in range(n)]) + '<3'\r\nidx = 0\r\nfor i in input():\r\n if len(s) > idx and s[idx] == i:\r\n idx += 1\r\nif len(s) > idx:\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")\r\n", "n = int(input())\r\nt = '<3'\r\nfor i in range(n):\r\n t += input() + '<3'\r\n\r\np = input()\r\ns = \"yes\"\r\nj = 0\r\n\r\nfor c in t:\r\n j = p.find(c, j)+1\r\n if j == 0:\r\n s = 'no'\r\n break\r\n\r\nprint(s)\r\n", "n=int(input())\r\ns1=['<3']\r\nfor i in range(n):\r\n s=input()\r\n s1.append(s)\r\n s1.append('<3')\r\ns=input()\r\nj=0\r\nk=0\r\nfor i in s:\r\n if i==s1[j][k]:\r\n if len(s1[j])==k+1:\r\n j+=1\r\n if j==len(s1):\r\n print('yes')\r\n exit(0)\r\n k=0\r\n else:\r\n k+=1\r\nif len(s1)==j and len(s1[j])==k:\r\n print('yes')\r\nelse:\r\n print('no')", "words=[]\r\nfor _ in range(int(input())):\r\n words.append(input())\r\nst,i,j='<3'+'<3'.join(words)+'<3',0,0\r\ns=input()\r\nwhile i<len(st) and j<len(s):\r\n if st[i]==s[j]:i+=1\r\n j+=1\r\nif i==len(st):print('yes')\r\nelse:print('no')", "def isSubSeq(s, t):\r\n\r\n # retorna True se S é subsequencia de T\r\n\r\n id = 0\r\n\r\n for j in t:\r\n\r\n if s[id] == j:\r\n id += 1\r\n \r\n if id >= len(s):\r\n break\r\n \r\n return id >= len(s)\r\n\r\nN = int(input())\r\n\r\ns = '<3'\r\n\r\nfor _ in range(N):\r\n k = input()\r\n s += k + '<3'\r\n\r\nt = input()\r\n\r\nif isSubSeq(s, t):\r\n print('yes')\r\nelse:\r\n print('no')", "n=int(input())\r\nans=''\r\nflag=0\r\nfor i in range(n):\r\n s=input()\r\n ans+='<3'+s\r\nans+='<3'\r\ns=input()\r\nj=0\r\nfor i in range(len(ans)):\r\n while j<len(s) and s[j]!=ans[i]:\r\n j+=1\r\n if j==len(s):\r\n flag=1\r\n break\r\n j+=1\r\nif flag==0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "'''\r\nCreated on Oct 31, 2013\r\n\r\n@author: Ismael\r\n'''\r\nimport sys\r\n\r\ndef nextCharRequired():\r\n for word in lWords:\r\n yield '<'\r\n yield '3'\r\n for c in word:\r\n yield c\r\n yield '<'\r\n yield '3'\r\n\r\ndef check():\r\n pos = 0\r\n for c in nextCharRequired():\r\n posFound = sentence.find(c,pos)\r\n if(posFound==-1):\r\n return False\r\n pos = posFound+1\r\n return True\r\n\r\ndef main():\r\n global sentence\r\n global lWords\r\n f = sys.stdin\r\n #f = open(\"test1.txt\")\r\n n = int(f.readline())\r\n lWords = []\r\n for _ in range(n):\r\n lWords += [f.readline()[:-1]]\r\n sentence = f.readline()\r\n #print(sentence)\r\n #print(lWords)\r\n if(check()):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n \r\nmain()\r\n", "n = int(input())\nwords = []\nfor i in range(n):\n words.append(input())\ntext = \"<3\" + \"<3\".join(words) + \"<3\"\ncase = input()\n\nholder = 0\nflag = True\nfor char in text:\n holder = case.find(char, holder)+1\n if holder == 0:\n flag = False\n break\n\nif flag:\n print(\"yes\")\nelse:\n print(\"no\")\n\t\t\t \t \t\t\t \t\t\t \t\t\t\t\t \t\t\t\t\t", "words = []\r\nfor _ in range(int(input())):\r\n words.append(input())\r\nencoded = input()\r\nmsg = '<3' + '<3'.join(words)+'<3'\r\ni = 0\r\nfor c in encoded:\r\n if msg[i] == c:\r\n i += 1\r\n if i == len(msg):\r\n break\r\n\r\nprint('yes' if i == len(msg) else 'no')\r\n", "'''input\r\n7\r\ni\r\nam\r\nnot\r\nmain\r\nin\r\nthe\r\nfamily\r\n<3i<>3am<3the<3<main<3in<3the<3><3family<3\r\n'''\r\nn = int(input())\r\nw = [input() for _ in range(n)]\r\nt = input()\r\ns = \"<3\" + \"<3\".join(w) + \"<3\"\r\ni, j = 0, 0\r\nwhile i < len(t) and j < len(s):\r\n\tif t[i] == s[j]:\r\n\t\ti += 1\r\n\t\tj += 1\r\n\telse:\r\n\t\ti += 1\r\nprint(\"yes\" if j == len(s) else \"no\")\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport re\r\ndef fast_input():\r\n return sys.stdin.readline().rstrip('\\n')\r\ndef fast_print(thing, end='\\n'):\r\n sys.stdout.write(str(thing) + end)\r\n\r\n\r\ndef main():\r\n n = int(fast_input()) # number of words in dima msg\r\n msgs = []\r\n for _ in range(n):\r\n msgs.append(fast_input())\r\n case = fast_input()\r\n len_case = len(case)\r\n fail_flag = False\r\n msg = enc = 0\r\n while True:\r\n # find heart\r\n pos = case.find('<', enc, len_case)\r\n if pos == -1:\r\n fast_print('no')\r\n exit()\r\n pos = case.find('3', pos + 1, len_case)\r\n if pos == -1:\r\n fast_print('no')\r\n exit()\r\n\r\n # find word\r\n for l in msgs[msg]:\r\n pos = case.find(l, pos + 1, len_case)\r\n if pos == -1:\r\n fast_print('no')\r\n exit()\r\n\r\n # if we've made it this far, we found the word.\r\n enc = pos + 1\r\n msg += 1\r\n if msg == n:\r\n # check for final heart\r\n pos = case.find('<', enc, len_case)\r\n if pos == -1:\r\n fast_print('no')\r\n exit()\r\n pos = case.find('3', pos + 1, len_case)\r\n if pos == -1:\r\n fast_print('no')\r\n exit()\r\n # ignore rest of message?\r\n fast_print(\"yes\")\r\n exit()\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# intent is to get a message with heasts to the fron tand the back.\r\nn=int(input())\r\nwords=[]\r\nfor _ in range(n):\r\n\twords.append(input())\r\nactual = input()\r\nexpected = '<3' + '<3'.join(words) + '<3'\r\nle=len(expected)\r\nie=0\r\nfor c in actual:\r\n\tif ie<le and c == expected[ie]:\r\n\t\tie+=1\r\nprint('yes' if ie==le else 'no')\r\n\r\n", "import sys\r\nfrom collections import deque\r\ninput = lambda: sys.stdin.buffer.readline().strip().decode()\r\nn=int(input())\r\nwords=[]\r\nnnums=\"012456789\"\r\nfor _ in range(n):\r\n words.append(input())\r\nsubseq=deque([\"<\",\"3\"]+[a for a in \"<3\".join(words)]+[\"<\",\"3\"])\r\nmessage=[a for a in input()]\r\nfound=False\r\nm=len(subseq)\r\nfor i in message:\r\n if subseq[0]==i:\r\n subseq.popleft()\r\n m-=1\r\n if m==0:\r\n found=True\r\n break\r\nprint(\"yes\") if found else print(\"no\")", "from typing import List\ndef werify_message(n:int, words: List[str], message: str) -> str:\n true_message = ''.join(['<3', '<3'.join(words), '<3'])\n\n # index in true_message\n i = 0\n for litera in message:\n if len(true_message) != i:\n if litera == true_message[i]:\n i += 1\n else:\n # Дошли до конца исходного сообщения и не нашли вставок\n return 'yes'\n\n if i == len(true_message):\n return 'yes'\n else:\n return 'no'\n\nn = int(input())\nwords = list()\nfor i in range(n):\n word = input()\n words.append(word)\n\nmessage = input()\nprint(werify_message(n, words, message))\n" ]

[ "n = int(input())\r\nresult = 0\r\nfor i in range(1, n + 1):\r\n result += i * (n - i) + 1\r\nprint(result)\r\n", "n=int(input())\r\nprint(int((n*(n-1)*(n+1))/6+n))", "# t = int(input())\r\n# while t>0:\r\nn = int(input())\r\nres = n\r\nc = 1\r\nfor i in range((n-1),0,-1):\r\n res+=(i*c)\r\n c+=1\r\n\r\nprint(res)\r\n # t-=1", "n = int(input())\r\nprint(n * n * (n - 1) // 2 - n * (n - 1) * (2 * n - 1) // 6 + n)\r\n", "import sys\r\nimport math\r\n\r\nfor line in sys.stdin:\r\n numbers = [int(x) for x in line.strip().split()]\r\n\r\nn= numbers[0]\r\nprint(int(((n**3)+(5*n))/6))", "t = int(input())\r\ns=0\r\nfor i in range(2,t):\r\n s=s+i*(t-i)\r\nprint(s+2*t-1)\r\n", "n = int(input())\r\n \r\ntotal = 1\r\nadd = 2\r\nbase = 2\r\nfor _ in range(1, n):\r\n total += add\r\n add = add + base\r\n base += 1\r\n \r\nprint(total)", "x=int(input())\r\nw=0\r\nfor q in range(1,x):\r\n w+=(q+1)*q/2\r\nprint(int(w)+x)\r\n", "def main():\r\n number = int(input())\r\n total = 0\r\n \r\n for i in range(1, number):\r\n total += (number - i) * i \r\n \r\n total += number\r\n \r\n print(total)\r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nans = (n*(n+1)//2)\r\nfor i in range(n-1 , 1 , -1):\r\n ans += (i-1)*(n-i)\r\nprint(ans)\r\n", "n = int(input())\r\nprint(int(n*(n**2+5)/6))", "n = int(input())\r\nans = n\r\nfor i in range(1, n):\r\n ans += i * (n - i)\r\nprint(ans)\r\n", "x=int(input())\r\nres=0\r\ni=0\r\nwhile x > 0:\r\n i+=1\r\n x-=1\r\n res+=(x*i)+1\r\nprint(res)", "n=int(input());print(n*(n*n+5)//6)", "n=int(input())\r\nprint((n*n*(n-1))//2-(n*(n+1)*(2*n+1))//6+n+n*n)", "n = int(input())\r\n\r\nnlist = [j for j in range(1,n+1)]\r\nsumn = sum(nlist)\r\n\r\nE = [I for I in range(n)]\r\nE1 = [J for J in range(n-1,-1,-1)]\r\nfin = []\r\nfor i in range(len(E)):\r\n k = E[i]*E1[i]\r\n fin.append(k)\r\n\r\nextra = sum(fin)\r\n\r\nprint(sumn+extra)\r\n", "l = int(input())\r\ns = 0\r\nfor i in range(1,l+1):\r\n cal = ((1+(i-1)) * (l-i))+1\r\n s += cal\r\nprint(s)", "n = int(input())\r\na = [0 for _ in range(n)]\r\nfor i in range(n-1):\r\n a[i] = (i+1)*(n-i-1)\r\nprint(sum(a)+n)", "n = int(input())\r\n\r\nans = 0\r\nfor i in range(1, n+1):\r\n # Manao can fail i-1 times before getting the right button\r\n ans += (i * (n - i)) + 1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\ns=n\r\nfor i in range(n):\r\n s+=i*(n-i)\r\nprint(s)", "n = int(input())\r\nres = 0\r\nt=0\r\nj=1\r\nfor i in range(n,0,-1):\r\n res+= (i*j)-t\r\n t+=1\r\n j+=1\r\nprint(res)\r\n\r\n", "n = int(input())\nprint(n*(n-1)*(n-2)//6 + n*(n+1)//2)", "n = int(input())\r\nprint((n**3+5*n)//6)\r\n", "n=int(input())\r\nprint((n*(n**2+5))//6)", "i = int(input())\r\nttl = 0\r\nx = i-1\r\nfor j in range(1, i):\r\n ttl += x*j\r\n x-=1\r\nprint(ttl+i)", "n=int(input())\r\npress=n\r\nfor i in range(1,n):\r\n possib=n-i\r\n press+=(possib-1)*i+possib\r\nprint(press)", "n= int(input())\r\n\r\nif n<= 2:\r\n print(1 if n== 1 else 3)\r\nelse:\r\n total= 2*n+ (n-2)\r\n count= 2\r\n for i in range(n-2, 1, -1):\r\n total+= count*i\r\n count+= 1\r\n print(total)", "n = int(input())\r\nc = n + 1\r\nfor i in range(n - 1, 1, -1):\r\n c += (n - i) * i\r\nprint(c + (n - 2))", "n = int(input())\r\ns = 0\r\nfor i in range(1, n + 1):\r\n s += i * (n - i)\r\ns += n\r\nprint(s)\r\n", "\r\n\r\nbuttons = int(input())\r\nright_buttons = 0\r\nres = buttons\r\n\r\nfor i in range(1, buttons):\r\n res += (buttons - i) * i\r\n\r\nprint(res)\r\n", "n = int(input())\r\n\r\nout = n\r\nn_down = n - 1\r\n\r\nwhile n_down:\r\n out += (n - n_down + 1) * (n_down - 1) + 1\r\n n_down -= 1\r\n\r\nprint(out)\r\n", "n=int(input())\r\nans=1\r\nfor i in range(1,n):\r\n ans+=(n-i)*i\r\nprint(ans+n-1)\r\n#print((n*n+5)*n//6)\r\n", "resp = 0\r\n\r\n\r\nquantBotoes = int(input())\r\n\r\nif quantBotoes == 1:\r\n print(1)\r\n\r\nelse:\r\n\r\n resto = quantBotoes\r\n\r\n quantApertei = 0\r\n\r\n while(resto != 0):\r\n\r\n resp += resto * (quantApertei + 1)\r\n \r\n quantApertei += 1\r\n \r\n\r\n resp += 1\r\n\r\n\r\n \r\n if (resto == quantBotoes):\r\n resto-=1\r\n\r\n resto -= 1\r\n\r\n print(resp)", "n=int(input())\r\nif(n==1):\r\n ans=1\r\nelse:\r\n ans=(n-1)*n*(n+1)//6+n\r\n\r\nprint(ans)", "n = int(input());\r\nans = n * (n * n + 5) // 6;\r\nprint(ans)", "n=int(input())\r\nans=n*(n+1)*(n-1)//6+n\r\nprint(ans)", "n=int(input())\r\nb=0\r\nfor a in range(1,n+1):\r\n b=b+(n+1-a)*(a)\r\nb=b-n*(n-1)/2\r\nprint(int(b))", "n=int(input())\r\nprint(int(n*(n*n+5)/6))", "def main():\r\n n = int(input())\r\n s = n\r\n i = 2\r\n while n-i >= 0:\r\n s += (n-i) * i + 1\r\n i += 1\r\n print(s)\r\nmain()\r\n", "v1=int(input())\r\nprint(v1 * (v1 * v1 + 5) // 6)", "n=int(input())\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n y+=n+(n-1)*x\r\n x+=1\r\n n-=1\r\nprint(y)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# from math import gcd as gcd\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound)\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n ans = 0\r\n for i in range(n):\r\n ans += ((i) * (n - i))\r\n print(ans + n)", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n s += (n - i - 1) * (i + 1) + 1\r\nprint(s)", "n=int(input())\r\nv=n\r\nc=0\r\nfor i in range(1,n):\r\n c+=(n-1)*i\r\n n=n-1\r\n\r\nprint(c+v)\r\n\r\n\r\n", "n = int(input())\r\n\r\nround = 1\r\nans = 0\r\n\r\nwhile n > 0:\r\n\r\n # No. of wrong buttons: (n-1)\r\n # Repeat how many times: round\r\n # Correct buttons per round: 1\r\n\r\n ans += ((n - 1) * round) + 1\r\n\r\n n -= 1\r\n round += 1\r\n\r\nprint(ans)", "n = int(input())\r\nres = 0\r\nfor pos in range(n, 0, -1):\r\n if pos != 1:\r\n res += pos + (pos -1 )*(n-pos)\r\n else:\r\n res += 1\r\n\r\nprint(res)\r\n", "n=int(input())\r\ns = 0\r\ns += n\r\nfor i in range(1, n):\r\n s += (n - i) * i;\r\nprint(s)\r\n", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\nn=int(input())\r\nt=0\r\nk=1\r\nfor i in range(n,0,-1):\r\n t+=k*i-k+1\r\n k+=1\r\nprint(t)\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", "class main:\r\n \r\n n = int(input())\r\n puls = 0\r\n \r\n for i in range (1 , n):\r\n puls += (n - i) * i\r\n \r\n print (puls + n)", "n = int(input())\r\nkol = 0\r\nfor i in range(1, n):\r\n kol += i*(n-i)\r\nprint(n+kol)", "n = int(input())\r\nans = n\r\nfor i in range(n-1,0,-1):\r\n ans += 1 + (i-1) * (n-i+1)\r\nprint(ans)\r\n", "n = int(input())\r\nval = 0\r\ncount = 1\r\nwhile(n > 1):\r\n val += count * n - count + 1 \r\n count += 1\r\n n -= 1 \r\nval += 1\r\nprint(val)", "n = int(input())\r\n\r\ndp = [[0, 0] for i in range(n + 1)]\r\ndp[1] = [1, 1]\r\nfor i in range(2, n + 1):\r\n dp[i][0] = dp[i-1][0] + i-1\r\n dp[i][1] = dp[i-1][0] + dp[i-1][1] + i-1\r\n\r\nprint(dp[n][1])", "n = int(input())\r\nlist = []\r\nfor i in range(1,n):\r\n a = i*(n-i)\r\n list.append(a)\r\n\r\nprint(sum(list)+n)", "n=int(input())\r\ns=n\r\nn-=1\r\ni=1\r\nwhile n:\r\n s+=n*i\r\n i+=1\r\n n-=1\r\nprint(s)", "import math\r\nn = int(input())\r\nc = n*(n+1)//2\r\nfor i in range(n):\r\n c += i*(n-i-1)\r\nprint(c)\r\n", "n = int(input())\r\nres = (n-1)*1+n\r\nc = n-1\r\nt = 1\r\nwhile c>1:\r\n res += c*t\r\n c-=1\r\n t+=1\r\nprint(res)", "number = int(input())\r\nn = 1\r\nequation = number - n\r\nequa = n * equation\r\nvariables = []\r\nfor x in range(number):\r\n equation = number - n\r\n equa = n * equation\r\n equa = equa + 1\r\n variables.append(equa)\r\n n = n + 1\r\n \r\n\r\nadd = sum(variables)\r\nprint(add)\r\n \r\n\r\n#maybe make code where you make functions to find each number how many pushes u need for example 7 make 7 functions named 1-7 and make a funtion in each of em to find shit or use a for loop idk", "n = int(input())\r\ns=n\r\nfor i in range(1,n):\r\n s+=i*(n-i)\r\nprint(s)", "n= int(input())\r\nres=0\r\nfor k in range(1,n+1):\r\n res+=k*(n-k)\r\nprint(res+n)", "n=int(input())\r\nx=0\r\nfor i in range(0,n):\r\n x=x+(n-i)*i\r\n\r\nprint(x+n)", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n cnt = 0\r\n j = 0\r\n for i in range(n, 0, -1):\r\n c = 0\r\n c = i + (i-1)*j\r\n cnt += c\r\n j += 1\r\n print(cnt)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n ans+=1+(n-i)*i\r\nprint(ans)", "a=int(input())\r\ncount=0\r\nj=1\r\narr=[]\r\nfor i in range(a-1):\r\n count=count+j\r\n j=j+1\r\n arr.append(count)\r\nprint(sum(arr)+a)", "n=int(input())\r\n\r\nprint(n*(n*n+5)//6)\r\n\r\n", "n=int(input())\r\nprint((n**3+5*n)//6)", "n=int(input())\r\nd,t=n-1,1\r\nwhile d!=0:\r\n n+=d*t\r\n d-=1\r\n t+=1\r\nprint(n)", "n = int(input())\r\ntotal = 0\r\nfor i in range(n):\r\n if i == n-1:\r\n total+=1\r\n else:\r\n total += (n-i)+(i*(n-i-1))\r\nprint(total)", "n = int(input())\r\ns = 0\r\nt = 0\r\n\r\nwhile s < n:\r\n f = n - s - 1\r\n t += s*f + f\r\n s += 1\r\n\r\nprint(t + n)\r\n", "n=int(input())\r\nmistakes=0\r\nfor i in range(1,n+1):\r\n mistakes+=(n-i)*i\r\nprint(n+mistakes)", "n = int(input())\r\nif n==2:\r\n\tprint(3)\r\nelif n==1:print(1)\r\nelse:\r\n\tns = n*n\r\n\twho = n*n + 1*1 + 2*n*1\r\n\tprint((n*n+5)*n//6)", "n = int(input())\nans = n\nfor i in range(1,n):\n step = 2 * (n - i) - 1\n floor = step // 2\n ceil = step - floor\n ans += (floor * i) + ceil\n\nprint(ans)", "n = int(input())\r\nprint(n + n *(n-1)*(n+1)//6)", "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\nif k < n, we need to find smallest multiple of k >= n\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n mn = n*(n+1)//2\r\n extra = 0\r\n for i in range(1, n-1):\r\n extra += i * (n-1-i)\r\n print(mn + extra)\r\n\r\n\r\nsolve()", "n = int(input())\r\nsumm = n # sum of x^0\r\nsumm += n * ((n * (n + 1)) // 2) # sum of x^1\r\nsumm -= (n * (n + 1) * (2 * n + 1)) // 6 # sum of x^2\r\nprint(summ)", "a = int(input())\nworst_optimal_solution = 0\n\nfor i in range (a , 0 , -1):\n penalty = a - i + 1\n worst_case = (i - 1) * penalty + 1\n worst_optimal_solution += worst_case\n\nprint(worst_optimal_solution)", "n=int(input())\r\nk=0\r\nj=0\r\nfor i in range(n,0,-1):\r\n k+=i+j*(i-1)\r\n j+=1\r\n\r\nprint(k)", "from math import*\r\nfrom random import*\r\nn=int(input())\r\nm2=0\r\nu=1\r\nfor i in range(n-1,-1,-1):\r\n m2+=(i)*u+1\r\n u+=1\r\nprint(m2)", "a = int(input())\r\nprint(int((a*(a-1)*(a+1))/6 + a))", "from itertools import permutations\r\nn = int(input())\r\nans = 0\r\nfor i in range(1, n):\r\n x = (n - i) * (i - 1)\r\n x += n - i + 1\r\n ans += x\r\nans += 1\r\nprint(ans)", "buttons = int(input())\r\npress = 0\r\ni = 1\r\nwhile buttons > 0:\r\n press += buttons * i - i + 1\r\n buttons -= 1\r\n i += 1\r\nprint(press)", "inp = int(input())\r\ns = inp\r\nfor i in range(inp):\r\n s += i*(inp-i)\r\nprint (s)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\nans=0\r\nfor i in range(1,n+1):\r\n\tn-=1\r\n\tans+=((n*i)+1)\r\nprint(ans)", "n=int(input())\r\nst=n\r\notv=n\r\nn-=1\r\nwhile n>0:\r\n otv+=(n-1)*(st-n+1)+1\r\n n-=1\r\nprint(otv)", "#https://codeforces.com/problemset/problem/268/B\r\ndef get_remainder(number):\r\n return sum(range(number-1)) if number > 1 else 0\r\n\r\nn = int(input())\r\nanswer = 0\r\nfor x in range(1,n+1):\r\n answer += x + get_remainder(x)\r\nprint(answer)", "n = int(input())\nres = 0\nfor i in range(n):\n res += 1 + (n - 1 - i) * (i + 1)\nprint(res)\n", "n = int(input())\r\nk = 1\r\nans = 0\r\nfor i in range(n):\r\n k += i\r\n ans += k\r\nprint(ans)\r\n", "n=int(input())\r\nsum=n\r\nfor i in range(n):\r\n h=i*(n-i)\r\n sum+=h\r\n #print(h)\r\n\r\n#first add singles then add doubles, then add triples the add n\r\n\r\n\r\nprint(sum)", "n = int(input())\r\ni = 1\r\nmx = n-1\r\nsm = 0\r\nwhile i <= n:\r\n sm += i * mx\r\n mx -= 1\r\n i +=1\r\nprint(sm+n)", "a = int(input())\r\nq = a*(a**2+5)//6\r\nprint(q)\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 = II()\r\n\r\ns1 = (n*(n+1))//2\r\ns2 = (s1*(2*n+1))//3\r\n\r\nprint(n*(1+s1) - s2)\r\n ", "n = int(input())\r\n\r\nprint((n-1)*n*(n+1)//6 + n)", "def main():\r\n n = int(input())\r\n \r\n \r\n found = 1\r\n touches = n \r\n while n:\r\n touches += (found*(n-1))\r\n found += 1\r\n n-=1\r\n \r\n print(touches)\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\ns=0\r\nfor i in range(1,a+1):\r\n s=s+1\r\n s=s+(i*(a-i))\r\nprint(s)", "sequence = input()\r\nsequence = int(sequence)\r\nresult = sequence\r\n\r\nfor i in range(sequence):\r\n if i == 0:\r\n continue\r\n result+=i*(sequence-i)\r\n\r\nprint(result)", "n = int(input())\r\nresult = n\r\nfor i in range(1, n):\r\n result += i * (n - i)\r\nprint(result)", "n = int(input())\r\nprint(int((n*(n-1)*(n+1))/6 + n))", "# https://codeforces.com/problemset/problem/268/B\r\n\r\nc = int(input())\r\nr = 0\r\nfor i in range(1, c):\r\n r += i * (c - i)\r\nr += c\r\nprint(r)", "from math import *\r\nn = int(input())\r\nans = 0\r\nfor i in range(1,n):\r\n ans+=(n-i)*i\r\nprint(ans+n)", "n = int(input())\r\nsum = 0\r\nif 1 <= n <= 2000:\r\n for i in range(n):\r\n b = (n-i)*i\r\n sum += b\r\nelse:\r\n print('Неверное значение')\r\nprint(sum+n)\r\n\r\n", "cr = int(input())\n\nresult = (cr - 1) * cr * (cr + 1) // 6 + cr\n\nprint(result)\n\n \t \t\t \t\t \t\t \t \t \t \t\t\t", "a = int(input())\r\nprint(a*(a*a+5)//6)\r\n", "n = int(input())\r\nprint(n*(n*n+5)//6)", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(3)\r\nelse:\r\n c = n\r\n for i in range(n-1, 1, -1):\r\n c += ((i-1) * (n-i+1)) + 1\r\n print(c+1)\r\n\r\n", "n = int(input())\r\nres = 0\r\nfor i in range(1,n+1):\r\n res += i * (n-i)\r\nprint(res+n)\r\n ", "t=int(input())\r\nans=t*(t+1)//2\r\nans+=(t-2)*(t-1)*t//6\r\nprint(ans)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n,0,-1):\r\n count+=(n-i+1)*(i-1)\r\nprint(count+n)", "n=int(input())\r\nans=0\r\nfor i in range(1,n):\r\n ans+=(n-i)*i\r\nprint(ans+n)", "n = int(input())\r\nk = 0\r\nk += n\r\nb = 0\r\nans = 0\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n ans += k\r\n k -= 1\r\n b += 1\r\n continue\r\n elif i != n and i != 1:\r\n ans += k + b*(k-1)\r\n k -= 1\r\n b += 1\r\n continue\r\n elif n == i:\r\n ans += 1\r\n k -= 1\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nans = 0\r\ni = 0\r\nwhile n > 0:\r\n ans += n + (n - 1) * i\r\n n -= 1\r\n i += 1\r\nprint(ans)", "n = int(input())\r\nsum = 0\r\nfor i in range(1, n):\r\n sum += (n-i) * i\r\nprint(sum + n)", "n=int(input())\nans=n*(n+1)//2\nfor i in range(2,n):\n ans+=(n-i)*(i-1)\nprint(ans)\n", "n = int(input())\r\nans = 0\r\ncounter = n-1\r\nfor i in range (1, n):\r\n ans += (i * counter)\r\n counter -= 1\r\nans += n\r\nprint(ans)", "n = int(input())\r\n\r\npresses = 0\r\ncorrect = 0\r\nfor btns in range(n, 0, -1):\r\n presses += correct*(btns-1) + btns\r\n correct += 1\r\n\r\nprint(presses)", "t = int(input())\r\nresult = (t - 1) * t * (t + 1) // 6 + t\r\nprint(result)\r\n", "n=int(input())\r\nans=0\r\nfor i in range(1,n):\r\n\tans+=(i)*(n-i)\r\nprint(ans+n)", "from sys import stdin\n\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return list(map(converter, line().split(delimeter)))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMULTIPLE_CASES = 0\n\ndef main():\n N = rd(int)\n print(sum((N-i-1)*(i+1)+1 for i in range(N)))\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "n=int(input())\r\nk=0\r\np=n-1\r\nfor i in range(1,n):\r\n k+=p*i+1\r\n p-=1\r\nprint(k+1)", "n = int(input())\r\nans = 0\r\nfor i in range(1, n):\r\n ans += (n - i) * i\r\nprint(ans + n)\r\n", "# list(map(int,input().split()))\r\nn=int(input())\r\nans=0\r\nfor i in range(1,n):\r\n ans+=i*(n-i)\r\nprint(ans+n)\r\n", "n = int(input())\r\ns = 0\r\nfor i in range(1 , n):\r\n s += ((n-i)*i)\r\n\r\ns += n \r\nprint(s)", "N = int(input())\r\nans = N\r\nfor i in range(N):\r\n\tans += (N - i) * i\r\nprint(ans)", "def main():\n number = int(input())\n total = 0\n while number != 0:\n if number == 1:\n total += 1\n elif number == 2:\n total += 2\n else:\n total += number + (number - 1) * (number - 2) // 2\n number -= 1\n print(total)\nmain()\n", "n=int(input())\r\nans=0\r\nfor j in range(n//2):\r\n ans+=(n-j)*(j+1)*2\r\nif n%2==1:\r\n ans+=(n//2+1)**2\r\nans-=(n*(n-1)//2)\r\nprint(ans) ", "round = int (input())\r\ncounter1 = 1\r\ncounter0 = 0\r\nbuttonscounter = 0\r\n\r\nwhile round > 0:\r\n fails = round\r\n buttons = (fails * counter1) - counter0\r\n round = round-1\r\n counter1 = counter1 + 1\r\n counter0 = counter0 + 1\r\n buttonscounter = buttons + buttonscounter\r\n\r\nprint (buttonscounter)\r\n", "#The sum of the first n numbers is equal to \r\n#The sum of the first n square numbers is equal to \r\n#The sum of the first n cubic numbers is equal to \r\n#1 +\t2 +\t3 +\t... +\t(n-1) +\tn\t= S\r\n#n +\t(n-1) +\t(n-2) +\t... +\t2 +\t1\t= S\r\n \r\nn = int(input())\r\nprint((n*(n*n+5))//6)\r\n", "def main():\r\n n = int(input())\r\n count = 0\r\n for i in range(n):\r\n for j in range(n - i - 1):\r\n count += i + 1\r\n count += n\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "lock = int(input())\r\ncombs = 0\r\ncounter = lock-1\r\nfor i in range(1, lock, 1):\r\n combs += (i*counter)\r\n counter -= 1\r\n \r\ncombs += lock\r\nprint(combs)\r\n\r\n", "n=int(input())\r\np=0\r\nfor i in range(1,n+1):\r\n\tp+=1+i*(n-i)\r\nprint(p)", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tn = int(input())\r\n\t\tpressed_buttons = n + (n**3 - n) // 6\r\n\t\tprint(pressed_buttons)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n" ]

[ "arr = [int(x) for x in input().split()]\na = arr[0]\nb = arr[1]\nresp = 0\nif a == b:\n resp = 'infinity'\nif resp != 'infinity':\n x = a - b\n i = 1\n c = 0\n while i**2 < x:\n c += 1\n if x % i == 0:\n if i > b:\n resp += 1\n if x/i > b:\n resp += 1\n i += 1\n if i**2 == x and i > b:\n resp += 1\nprint (resp)\n\n\t \t\t\t\t\t \t\t \t\t \t \t\t\t \t \t", "from math import sqrt\r\n\r\na, b = map(int, input().split())\r\n\r\nif a == b:\r\n print('infinity')\r\nelif a < b:\r\n print(0)\r\nelse:\r\n cont = 0\r\n diferenca = a - b\r\n for x in range(1, int(sqrt(diferenca)) + 1):\r\n if diferenca % x == 0:\r\n if x > b:\r\n cont += 1\r\n\r\n fator = diferenca // x\r\n if x != fator and fator > b:\r\n cont += 1\r\n\r\n print(cont)", "import math\r\na,b=map(int,input().split())\r\nif(a==b):\r\n print('infinity')\r\n exit()\r\nif(b>a):\r\n print(0)\r\n exit()\r\n\r\ndef fact(x):\r\n ans=[]\r\n for i in range(1,int(math.sqrt(x))+1):\r\n if(i==x//i):\r\n ans.append(i)\r\n else:\r\n ans.append(i)\r\n ans.append(x//i)\r\n return ans;\r\nans=fact(a-b)\r\ncount=0\r\nfor i in range(len(ans)):\r\n if(ans[i]>b):\r\n if(a%ans[i]==b):\r\n count+=1\r\n\r\n\r\nprint(count)\r\n \r\n", "a, b = [int(n) for n in input().split()]\nc = a - b\nx = 1\nz = 0\n\nif a == b:\n print(\"infinity\")\nelse:\n while x ** 2 <= c:\n if c % x == 0:\n if x > b:\n z += 1\n if x ** 2 != c and c / x > b:\n z += 1\n x += 1\n print(z)\n", "a, b = map(int, input().split(\" \"))\na1 = a - b\nif a == b:\n print(\"infinity\")\nelse:\n cont = 0\n i = 1\n while i ** 2 <= a1:\n if a1 % i == 0 and i > b: cont += 1\n if a1 % i == 0 and b < a1 // i != i: cont += 1\n i += 1\n print(cont)\n", "a,b=[int(e) for e in input().split()]\r\nif a==b:\r\n print(\"infinity\")\r\nelif b>a:\r\n print(0)\r\nelse:\r\n c=a-b\r\n s=set()\r\n i=1\r\n while i*i<=c:\r\n if c%i==0:\r\n if a%i==b:\r\n s.add(i)\r\n I=c//i\r\n if a%I==b:\r\n s.add(I)\r\n i+=1\r\n print(len(s))", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\na, b = list(map(int,input().split()))\n \nif a < b:\n print(0)\n\nelif a == b:\n print(\"infinity\")\nelse:\n a -= b\n r = 0\n i = 1\n\n while i ** 2 <= a:\n if a % i != 0: \n i += 1\n continue\n\n if i > b: \n r += 1\n if i == a // i: \n i += 1\n continue\n if a // i > b:\n r += 1\n i += 1\n \n print(r)\n ", "a, b = input().split()\na = int(a)\nb = int(b)\n\nif a == b:\n print (\"infinity\")\nelif b > a:\n print (0)\nelse:\n quant = 0\n d = a-b\n i = 1\n while(i*i <= d):\n if d % i == 0:\n if d/i == i and i > b:\n quant += 1\n else:\n if i > b:\n quant += 1\n if (d/i) > b:\n quant += 1\n i += 1\n print (quant)\n \t \t \t\t\t\t\t \t \t\t\t\t \t \t \t", "if __name__ == \"__main__\":\n a, b = input().split(\" \")\n a = int(a)\n b = int(b)\n if a - b == 0:\n print(\"infinity\")\n elif a - b < 0:\n print(\"0\")\n else:\n n = a - b\n c = 0\n i = 1\n while i*i <= n:\n if n % i == 0:\n if n / i == i and i > b:\n c += 1\n else:\n if i > b:\n c += 1\n if n /i > b:\n c += 1\n i += 1\n print(c) \n\t \t \t \t\t \t \t\t \t\t \t \t \t", "a,b=map(int,input().split())\r\nif a<b:\r\n print(0)\r\nelif a==b:\r\n print(\"infinity\")\r\nelse:\r\n l=[]\r\n k=a-b\r\n use=set()\r\n for x in range(1,int(k**0.5)+1):\r\n if k%x==0 and x not in use:\r\n use.add(x)\r\n l.append(x)\r\n if k//x not in use:\r\n use.add(k//x)\r\n l.append(k//x)\r\n l.sort()\r\n cnt=0\r\n for x in l:\r\n if x>b:\r\n cnt+=1\r\n print(cnt)", "def raiz(n):\n raiz = n**0.5\n while raiz*raiz < n:\n raiz+=1\n return raiz\n\na, b = map(int, input().split())\nif (a==b):\n print(\"infinity\")\nelif (b > a):\n print(0)\nelse:\n resp = 0\n n = 1\n m = a - b\n while n <= raiz(m) and m/n > b:\n if m % n == 0:\n resp+=1\n if n > b and m/n != n:\n resp+=1\n n+=1\n print(resp)\n\n \t \t \t\t\t \t \t\t \t\t \t \t \t\t", "a,b = map(int,input().split(\" \"))\n\nif a == b:\n print(\"infinity\")\nelse:\n q = abs(a-b)\n contador = 0\n for x in range(1, int(q ** 0.5) + 1):\n if a % x == b:\n contador += 1\n if q % x == 0:\n if q // x != x:\n if a % (q // x) == b:\n contador += 1\n print(contador)\n\n\t\t \t\t \t\t\t\t\t\t\t \t\t \t\t \t", "import math\n\na, b = map(int, input().split())\n\nif a == b:\n print('infinity')\nelse:\n num = abs(a - b)\n i = 1\n count = 0\n while i < int(math.sqrt(num)) + 1:\n if num % i == 0:\n if i > b:\n count += 1\n if num / i > b and i * i != num:\n count += 1\n i += 1\n print(count)\n\t \t \t\t\t\t\t \t\t \t \t \t \t\t\t \t\t\t", "from math import *\r\n\r\na, b = map( int, input().split() )\r\n\r\nif( a < b ):\r\n\tprint( 0 )\r\n\r\nelif( a == b ):\r\n\tprint( \"infinity\" )\r\n\r\nelse:\r\n\ta -= b\r\n\tcnt = 0\r\n\tlast = int( sqrt( a ) )\r\n\tfor i in range( 1, ( last + 1 ) ):\r\n\t\tif( a % i == 0 ):\r\n\t\t\tif( i > b ):\r\n\t\t\t\tcnt += 1\r\n\t\t\tif( ( a//i > b ) and ( a//i > i ) ):\r\n\t\t\t\tcnt += 1\r\n\tprint( cnt )", "a,b=map(int,input().split())\r\nn=a-b\r\nif n<0:print(0)\r\nelif n==0:print('infinity')\r\nelse:\r\n s=0\r\n d=1\r\n while d*d<n:\r\n if n%d==0:\r\n if d>b:s+=1\r\n if n//d>b:s+=1\r\n d+=1\r\n q=n**0.5\r\n if q==int(q):\r\n if q>b:s+=1\r\n print(s)\r\n", "a, r = map(int, input().split())\r\nans, c, kx = 0, 1, a - r\r\nwhile c * c <= kx:\r\n if not kx % c:\r\n ans += (c > r) + (c * c < kx and kx > c * r)\r\n c += 1\r\nprint((ans, 'infinity')[a == r])", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(3001)\r\n\r\ninput = sys.stdin.readline\r\n\r\na,b = map(int,input().split())\r\nif a<b:\r\n print(0)\r\nelif a==b:\r\n print(\"infinity\")\r\nelse:\r\n t = a-b\r\n i = 1\r\n ans = 0\r\n while i*i<=t:\r\n if t%i==0:\r\n if i>b:\r\n ans+=1\r\n if (t/i)>b and t/i !=i:\r\n ans+=1\r\n i+=1\r\n print(ans)\r\n\r\n", "a, b = map(int, input().split())\r\nk, val = 1, 0\r\nwhile k * k <= a - b:\r\n if (a - b) % k == 0:\r\n val += sum(1 for x in {k, (a - b) // k} if x > b)\r\n k += 1\r\nprint('infinity' if a == b else val)\r\n", "a,b=map(int,input().split())\r\nif b==a:print('infinity')\r\nelif b>a:print(0)\r\nelse:\r\n c=0\r\n for i in range(1,2**69):\r\n if i*i>(a-b):break\r\n if (a-b)%i==0:\r\n if i>b:c+=1\r\n if i*i<(a-b) and (a-b)/i>b:c+=1\r\n print(c)\r\n", "a,b=map(int,input().split())\r\nr=0\r\nc=1\r\nv=a-b\r\nwhile c*c<=v:\r\n if v%c== 0:\r\n r+=(c>b)+(c*c<v and v>b*c)\r\n c+=1\r\nprint('infinity' if a==b else r)", "a,b=map(int,input().split())\r\nif a==b:\r\n print('infinity'); exit()\r\nelif a<b:\r\n print(0); exit()\r\nelse:\r\n x = a-b\r\n ans = 0\r\n for i in range(1,int(x**0.5)+1):\r\n if x % i == 0 and i > b:\r\n ans += 1\r\n if i*i < x:\r\n tmp = x // i\r\n if x % tmp == 0 and tmp > b:\r\n ans += 1\r\nprint(ans)", "a, b = map(int, input().split())\r\nif a == b:\r\n print(\"infinity\")\r\nelse:\r\n if a < b:\r\n print(\"0\")\r\n else:\r\n d = a - b\r\n res = 0\r\n s = 1\r\n while s * s < d:\r\n if d % s == 0:\r\n if s > b:\r\n res += 1\r\n if (d // s) > b:\r\n res += 1\r\n s += 1\r\n if s > b and s * s == d:\r\n res += 1\r\n print(res)# 1691517903.9543145", "datos =list(map(int, input().split()))\r\na = datos[0]\r\nb = datos[1]\r\nvalor = a - b\r\ndiv = 0\r\nif a == b: \r\n print(\"infinity\")\r\nelse:\r\n x = 1\r\n while x*x <= a:\r\n if valor % x == 0:\r\n if x > b:\r\n div += 1\r\n if (valor/x > b and x*x != valor):\r\n div+=1\r\n x += 1\r\n print(div)", "from math import sqrt\r\n\r\ndef count_divisors(b, n):\r\n count = 0\r\n for x in range(1, int(sqrt(n)) + 1):\r\n if n % x == 0:\r\n if x > b:\r\n count += 1\r\n if x != (n // x) and (n // x) > b:\r\n count += 1\r\n return count\r\n\r\na, b = map(int, input().split())\r\n\r\nif a < b:\r\n print(0)\r\nelif a == b:\r\n print('infinity')\r\nelse:\r\n # (a - b) % x = 0\r\n n = a - b\r\n print(count_divisors(b, n))", "x, y = map(int, input().split())\n\nif x == y:\n print(\"infinity\")\n\nelif x > y:\n sl = set()\n for j in range(1, int((x-y)**0.5)+1):\n if(x-y) % j == 0:\n if (x-y) // j > y:\n sl.add((x-y)//j)\n if j > y:\n sl.add(j)\n print(len(sl))\n\nif x < y:\n print(0)\n\t \t\t\t \t \t \t\t \t \t \t", "import math\r\nimport sys\r\nimport collections\r\nimport random\r\ninput = sys.stdin.readline\r\nM = 10**9 + 7\r\ndef qe():\r\n return int(input())\r\ndef tr():\r\n return [int(_) for _ in input().split()]\r\ndef rt():\r\n return input()\r\n\r\na, b = map(int, input().split())\r\nd = {}\r\nq = a - b\r\nif a == b:\r\n print(\"infinity\")\r\nelif a < b:\r\n print(0)\r\nelse:\r\n for i in range(1, int(q ** 0.5) + 2):\r\n if q % i == 0:\r\n d[i] = 0\r\n d[q // i] = 1\r\n ans = 0\r\n for key in d:\r\n if key > b:\r\n ans += 1\r\n print(ans)", "a, b = map(int, input().split())\n\nif a == b:\n print('infinity')\n\nelse:\n count = 1\n out = 0\n while count * count <= a - b:\n if (a - b) % count == 0:\n out += sum(1 for x in {count, (a - b) // count} if x > b)\n count += 1\n print(out)\n \t\t\t \t \t \t\t \t\t\t\t\t \t \t\t \t \t", "#ax =- b(mod n)\n#a % x = b\nfrom math import sqrt\nfrom functools import reduce\n\ndef factorNumber(x, b):\n factors = []\n for i in range(1, int(sqrt(x))+1):\n if x % i == 0:\n factors.append(i)\n if x // i != i:\n factors.append(x//i)\n count = 0\n for i in factors:\n if i > b:\n count += 1\n print(count)\n\n##def factorNumber2(x):\n## result = 0\n## i = 1\n## while i*i <= x:\n## if x % i == 0:\n## result += 1\n## if x//i != i:\n## result += 1\n## i += 1\n## return result\n\n(a,b) = list(map(int,input().split()))\nanswers = 0\nif a == b:\n print(\"infinity\")\nelif a < b:\n print(0)\nelse:\n factorNumber(a-b,b)\n #factors = factorNumber2(a-b,b)\n\n\t\t\t\t \t\t \t \t \t\t\t\t\t \t \t \t\t\t\t\t\t", "\n\nif __name__ == '__main__':\n a, b = [int(x) for x in input().split()]\n\n if b == a:\n print('infinity')\n elif b > a:\n print(0)\n else:\n c = 0\n diff = a - b\n x = 1\n while x*x <= diff:\n if diff % x == 0:\n if x > b:\n c += 1\n y = diff // x\n if x != y and y > b:\n c += 1\n x += 1\n print(c)", "a, b = [int(x) for x in input().split()]\n\nif a < b:\n print(0)\nelif a == b:\n print(\"infinity\")\nelse:\n x = a-b\n i = 1\n ans = 0\n while(i*i <= x):\n if not x%i:\n if x//i == i and i > b:\n ans += 1\n else:\n if i > b:\n ans += 1\n if x//i > b:\n ans += 1\n i += 1\n print(ans)\n\n \t \t \t \t\t \t \t\t\t\t\t \t\t\t\t\t \t", "mod = 1000000007 \n\nqueries = list(map(int, input().split()))\n\ndivd = queries[0]\nrest = queries[1]\nres = 0 \nbase = divd - rest \n\nif(base < 0):\n print(0)\n\nelse:\n for i in range(1, int((base) **0.5) +1):\n trial = (base % i)% mod\n x = trial == 0\n if x and base // i > (rest):\n res +=1 \n if x and i > (rest) and i != base//i:\n res+=1\n if divd == rest:\n print('infinity')\n else: \n print(res)\n \t\t \t\t \t \t\t \t \t", "a,b=map(int,input().split())\r\ncount=0\r\nif a==b:print(\"infinity\")\r\nelif a<b:print(0)\r\nelse:\r\n for i in range(1,int((a-b)**0.5)+1):\r\n if (a-b)%i==0:\r\n if i>b:count+=1\r\n if (a-b)//i!=i and (a-b)//i>b:count+=1\r\n print(count)", "def printDivisors(n) : \n ans = []\n for i in range(1, int(n ** 0.5 + 1)):\n if n % i == 0:\n if n // i == i:\n ans.append(i)\n else:\n ans.append(i)\n ans.append(n//i)\n return sorted(ans)\n\na, b = map(int, input().split())\nprint('infinity') if a == b else print(0) if a < b else print(sum(i > b for i in printDivisors(a - b)))\n", "import sys\r\n\r\na, b = map(int, input().split())\r\ndis = a - b\r\nif dis == 0:\r\n print(\"infinity\")\r\nelse:\r\n res = 0\r\n x = 1\r\n while x ** 2 <= dis:\r\n if dis % x == 0 and x > b:\r\n res += 1\r\n if dis % x == 0 and dis // x > b and x ** 2 != dis:\r\n res += 1\r\n x += 1\r\n print(res)\r\n", "entrada = input().split()\n\na = int(entrada[0])\nb = int(entrada[1])\n\nif (a == b):\n print(\"infinity\")\nelse:\n a -= b\n result = 0\n\n i = 1\n while(i * i <= a):\n if (a % i == 0):\n if (i > b):\n result += 1\n if (a // i != i and (a // i) > b):\n result += 1\n i += 1\n \n print(result)\n\t\t\t\t \t \t\t \t \t \t\t\t\t\t \t", "import math\r\na,b=map(int,input().split())\r\nif a==b:\r\n print('infinity')\r\nelse:\r\n if a<b:\r\n print(0)\r\n else:\r\n x=a-b\r\n c=0\r\n for i in range(1,int(math.sqrt(a))+1):\r\n if x%i==0:\r\n if x//i==i:\r\n if i>b:\r\n c+=1\r\n else:\r\n if i>b:\r\n c+=1\r\n if x//i >b:\r\n c+=1\r\n print(c)", "def solve(x,y):\r\n if x==y:\r\n return \"infinity\"\r\n elif x<y:\r\n return 0\r\n else:\r\n ans=0\r\n i=1\r\n tmp=x-y\r\n while(i*i<=tmp):\r\n #print(i)\r\n if tmp%i==0:\r\n #print(i)\r\n if x%i==y:\r\n ans+=1\r\n b=tmp//i\r\n if i!=b and x%b==y:\r\n ans+=1\r\n i+=1\r\n return ans\r\n\r\n\r\nx,y=map(int,input().split())\r\nprint(solve(x,y))\r\n\r\n\r\n\r\n", "MOD = 1000000007\na, b = str(input()).split()\na = int(a)\nb = int(b)\ncont = 0\n\nif (a == b):\n print(\"infinity\")\nelif(a<b):\n print(cont)\nelse:\n a -= b\n c = 1\n while c*c <= a:\n if a%c == 0:\n if c > b:\n cont += 1\n if a/c > b and c*c != a:\n cont += 1\n c += 1\n print(cont)\n\t \t \t\t \t\t\t\t \t\t \t \t \t\t \t \t", "a, b = map(int, input().split())\n\nx = a - b\n\nif x == 0:\n print('infinity')\nelif x < 0:\n print(0)\nelse:\n i = 1\n cont = 0\n while i * i <= x:\n if x % i == 0:\n if a % i == b:\n cont += 1\n if ((x / i) != i) and ((a % (x / i)) == b):\n cont += 1\n i += 1\n\n print(cont)\n", "import sys\r\ndef fastio():\r\n from io import StringIO\r\n from atexit import register\r\n global input\r\n sys.stdin = StringIO(sys.stdin.read())\r\n input = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n sys.stdout = StringIO()\r\n register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n \r\n# def debug(*var, sep = ' ', end = '\\n'):\r\n# print(*var, file=sys.stderr, end = end, sep = sep)\r\n \r\n# INF = 10**20\t\r\n# MOD = 10**9 + 7\r\n# I = lambda:list(map(int,input().split()))\r\n\r\na,b = list(map(int , input().split()))\r\nif(a<b): print(0)\r\nelse:\r\n if a==b:\r\n print('infinity')\r\n elif a>b:\r\n cnt =0\r\n for i in range(1,int((a-b)**0.5)+1):\r\n if(a-b)%i==0:\r\n if(i>b): cnt+=1\r\n if(a-b)/i > b and i*i != (a-b) : cnt+=1\r\n \r\n print(cnt)", "a,b=map(int, input().split(\" \"))\r\n\r\nif a==b:\r\n print(\"infinity\")\r\nelse:\r\n i=1\r\n count=0\r\n a=a-b\r\n while i*i<= a:\r\n a\r\n \r\n if a%i==0:\r\n if(i>b):\r\n count+=1\r\n if (a/i>b and a/i!=i):\r\n count+=1\r\n i+=1\r\n print(count)", "tmp = input().split()\r\na = int(tmp[0])\r\nb = int(tmp[1])\r\na -= b\r\nif a == 0:\r\n print(\"infinity\")\r\nelse:\r\n ans = 0\r\n i = 1\r\n while i * i < a:\r\n if a % i == 0:\r\n if i > b:\r\n ans += 1\r\n if a/i > b:\r\n ans += 1\r\n i += 1\r\n if i * i == a and i > b:\r\n ans += 1\r\n print(ans)\r\n", "numero_a, numero_b = map(int, input().split())\n\nif numero_a > numero_b:\n numero_a -= numero_b\n aux = 1\n num_de_solucoes = 0\n\n while((aux*aux) <= numero_a):\n if (numero_a % aux) == 0:\n if(aux > numero_b):\n num_de_solucoes += 1\n if(((numero_a/aux) > numero_b) and ((aux*aux) != numero_a)):\n num_de_solucoes += 1\n aux += 1\n\n print(num_de_solucoes)\nelif(numero_a == numero_b):\n print(\"infinity\")\nelse:\n print(0)\n\t \t \t \t\t\t \t \t\t\t\t\t", "tmp = input().split()\na = int(tmp[0])\nb = int(tmp[1])\na -= b\nif a == 0:\n print(\"infinity\")\nelse:\n ans = 0\n i = 1\n while i * i < a:\n if a % i == 0:\n if i > b:\n ans += 1\n if a / i > b:\n ans += 1\n i += 1\n if i * i == a and i > b:\n ans += 1\n print(ans)\n \t\t\t\t \t\t\t\t \t \t \t \t \t\t\t \t", "import math\ndef printNumDivisors(a,b):\n n = a-b\n c = 0\n i = 1\n while i <= math.sqrt(n):\n \n if (n % i == 0) : \n if (n / i == i) :\n if(i > b):\n c += 1\n else :\n if(i > b):\n c += 1\n if(int(n/i) > b):\n c += 1\n i = i + 1\n \n return c\n\na,b = list(map(int, input().split()))\n\nif(a < b):\n print(0)\nelif(a == b):\n print('infinity')\nelse:\n # find all the divisors of (a-b) that are bigger than b\n print(printNumDivisors(a,b))\n\n\n \t\t \t \t \t\t\t\t\t \t \t", "a, b = map(int, input().split())\nif a == b:\n print('infinity')\n exit(0)\n\nx = abs(a - b)\nans = 0\n\nfor i in range(1, int(x**0.5)+1):\n if x % i == 0:\n if a % i == b:\n ans += 1\n if i * i != x:\n if a % (x//i) == b:\n ans += 1\nprint(ans)\n \t\t\t\t\t\t\t \t \t \t\t \t\t\t\t\t \t", "a,b = map(int,input().split())\n\nif a == b:\n print(\"infinity\")\n\nelif a < b:\n print(0)\n\nelse:\n res = set()\n c = a - b\n for i in range(1,int(c** 0.5) + 1):\n\n if c % i == 0 :\n if i > b:\n res.add(i)\n if c // i > b:\n res.add(c//i)\n\n print(len(res))\n \n \t\t\t\t \t\t\t \t\t\t\t \t \t\t\t \t\t\t \t", "inp = list(map(int,input().strip().split()))[:2]\n\na = inp[0]\nb = inp[1]\n\nif (a < b):\n print(\"0\")\nelif (a == b):\n print(\"infinity\")\nelse:\n i = 1\n quant = 0\n n = a-b\n while i * i <= n:\n if n%i == 0:\n if (n/i == i):\n if (a%i == b):\n quant += 1\n else:\n if (a % i == b):\n quant += 1\n if (a % (n/i) == b):\n quant += 1\n \n i+=1\n\n print(quant)\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\nif a<b:\r\n print(0)\r\nelif a==b:\r\n print('infinity')\r\nelse:\r\n i=1\r\n n=0\r\n while i*i<=(a-b):\r\n if (a-b)%i==0:\r\n if i>b:\r\n n+=1\r\n if (a-b)/i>b and i*i!=(a-b):\r\n n+=1\r\n i+=1\r\n print(n)", "a,b=map(int,input().split());\r\ndis=a-b;\r\nif dis==0:\r\n\tprint(\"infinity\");\r\nelse :\r\n\tres=0;\r\n\tx=1;\r\n\twhile x**2<=dis:\r\n\t\tif dis%x==0 and x>b:\r\n\t\t\tres+=1;\r\n\t\tif dis%x==0 and dis//x>b and x**2!=dis:\r\n\t\t\tres+=1;\r\n\t\tx+=1;\r\n\tprint(res);", "import itertools\nimport math\n\ndef main():\n\ta, b = list(map(int, input().split()))\n\n\tif a == b:\n\t\tprint(\"infinity\")\n\t\treturn\n\tif a < b:\n\t\tprint(0)\n\t\treturn\n\ta -= b\n\n\tn = 0\n\n\tfor i in range(1, math.ceil(math.sqrt(a))):\n\t\tif (a % i == 0):\n\t\t\tn += (i > b) + (a // i > b)\n\n\tif math.sqrt(a) % 1 == 0 and math.sqrt(a) > b:\n\t\tn += 1\n\n\tprint(n)\n\nif __name__ == \"__main__\":\n\tmain()\n", "from sys import stdin\r\n\r\na, b = map(int, stdin.readline().split())\r\nif a == b:\r\n print(\"infinity\")\r\nelif a < b:\r\n print(0)\r\nelse:\r\n ans = 0\r\n i = 1\r\n bb = b\r\n b = a-b\r\n while i*i <= b:\r\n if b%i == 0:\r\n if i*i == b and i > bb:\r\n ans += 1\r\n else:\r\n if i > bb:\r\n ans += 1\r\n if b//i > bb:\r\n ans += 1\r\n i += 1\r\n print(ans)", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf(sp = \" \"):\r\n return [int(i) for i in get().split(sp)]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join([str(i) for i in a]) + end)\r\n \r\n#from collections import defaultdict as dd, deque\r\n#from random import randint, shuffle, sample\r\n#from functools import cmp_to_key, reduce\r\n#from math import factorial as fac, acos, asin, atan2, gcd, log, e\r\n#from bisect import bisect_right as br, bisect_left as bl, insort\r\n\r\n\r\ndef main():\r\n a, b = getf()\r\n res = 0\r\n d = a - b\r\n if(d < 0):\r\n put(0)\r\n return 0\r\n if(d == 0):\r\n put(\"infinity\")\r\n return 0\r\n i = 1\r\n while(i * i <= d):\r\n if(d % i == 0):\r\n x1 = i\r\n if(a % x1 == b):\r\n res += 1\r\n x2 = d // i\r\n if(a % x2 == b and x1 != x2):\r\n res += 1\r\n i += 1\r\n put(res)\r\nmain()\r\n", "a=input().split(\" \")\r\nx1=int(a[0]);\r\ny1=int(a[1]);\r\na1=x1-y1;\r\nif x1==y1:\r\n print (\"infinity\");\r\nelse:\r\n i=1;\r\n counter=0;\r\n while i**2<=a1:\r\n counter+=(a1 % i == 0 and i > y1)+(a1 % i == 0 and a1 // i > y1 and i != a1 // i);\r\n i+=1;\r\n print(counter);\r\n", "import math\n\ndef calculateDivisors (A, B):\n\tN = A - B\n\tnoOfDivisors = 0\n\n\ta = math.sqrt(N)\n\tfor i in range(1, int(a + 1)):\n\t\tif ((N % i == 0)):\n\t\t\tif (i > B):\n\t\t\t\tnoOfDivisors +=1\n\n\t\t\tif ((N / i) != i and (N / i) > B):\n\t\t\t\tnoOfDivisors += 1;\n\n\treturn noOfDivisors\n\ndef possibiladesValidas (A, B):\n\tif (A == B):\n\t\treturn -1\n\n\tif (A < B):\n\t\treturn 0\n\n\tnoOfDivisors = 0\n\tnoOfDivisors = calculateDivisors(A,B);\n\treturn noOfDivisors\n\n\ndef possibilidades(A, B):\n\tnoOfSolutions = possibiladesValidas(A, B)\n\n\tif (noOfSolutions == -1):\n\t\tprint (\"infinity\")\n\n\telse:\n\t\tprint (noOfSolutions)\n\n\ntemp = input().split()\nA = int(temp[0])\nB = int(temp[1])\n\npossibilidades(A, B)\n\n\t\t \t \t\t \t \t\t\t \t \t\t\t", "def count(n, x):\r\n\tif n == 1 and x < 1: return 1\r\n\r\n\tres = 0\r\n\tfor i in range(1, n):\r\n\t\tif i*i > n:\tbreak\r\n\r\n\t\tif n % i == 0:\r\n\t\t\tif i > x:\r\n\t\t\t\tres += 1\r\n\t\t\tif n//i > x and n//i != i:\r\n\t\t\t\tres += 1\r\n\t\t\t\r\n\treturn res\r\n\r\na, b = (int(x) for x in input().split())\r\nif a == b: print(\"infinity\")\r\nelse: print(count(a-b, b))\r\n", "a,b=map(int,input().split())\nr=0\nc=1\nv=a-b\nwhile c*c<=v:\n if v%c== 0:\n r+=(c>b)+(c*c<v and v>b*c)\n c+=1\nprint('infinity' if a==b else r)", "from math import sqrt\n\na, b = map(int, input().split())\n\nif a == b:\n print(\"infinity\")\nelse:\n res = 0\n a = abs(a-b)\n for i in range(1, int(sqrt(a)) + 1):\n if a % i == 0:\n if i > b:\n res += 1\n if (a/i) > b and i**2 != a:\n res += 1\n print(res)\n \t\t\t\t \t\t\t \t \t\t \t\t\t\t\t \t", "a, b = map(int, input().split(' '))\r\nif a == b :\r\n print(\"infinity\\n\")\r\nelse :\r\n s, k = 0, 1\r\n while k*k <= a-b :\r\n s += ((a-b)%k == 0 and k > b)+((a-b)%k == 0 and (a-b)//k > b and (a-b)//k != k)\r\n k += 1;\r\n print(s,\"\\n\");\r\n", "def qtd_x(a, b):\n x = 0\n aux = a - b\n i = 1\n while(i*i <= aux):\n if(aux % i == 0):\n if(aux/i == i and i > b):\n x += 1\n else:\n if(i > b):\n x += 1\n if(aux/i > b):\n x += 1\n i += 1\n return x\n\na, b = map(int, input().split())\nif(a == b):\n print(\"infinity\")\nelif(b > a):\n print(0)\nelse:\n print(qtd_x(a, b))\n \t\t\t \t\t \t\t \t\t\t \t\t\t \t \t \t", "a,b=map(int,input().split())\r\nif b>a:\r\n print(0)\r\nelif b==a:\r\n print(\"infinity\")\r\nelse:\r\n c=a-b\r\n l=[]\r\n for i in range(1,int(c**0.5)+1):\r\n if c%i==0:\r\n l.append(i)\r\n if i!=c//i:\r\n l.append(c//i)\r\n ans=0\r\n for i in l:\r\n if a%i==b:\r\n ans+=1\r\n print(ans)\r\n \r\n", "a,b = map(int,input().split())\r\n\r\nif a == b:\r\n print(\"infinity\")\r\nelif a < b:\r\n print(0)\r\nelse:\r\n res = set()\r\n n = a - b\r\n for i in range(1,int(n** 0.5) + 1):\r\n\r\n if n % i == 0 :\r\n if i > b:\r\n res.add(i)\r\n if n // i > b:\r\n res.add(n//i)\r\n print(len(res))\r\n ", "from math import sqrt\r\na, b = map(int, input().split())\r\naux = a-b\r\nres = 0\r\nif(a == b):\r\n print(\"infinity\") \r\nelif(a < b):\r\n print('0')\r\nelse:\r\n limite = int(sqrt(aux))+1\r\n for i in range(1,limite):\r\n if(aux % i == 0):\r\n if((i*i) != aux):\r\n if((aux/i)>b):\r\n res += 1\r\n if(i>b):\r\n res += 1\r\n else:\r\n if(i>b):\r\n res += 1\r\n print(res)", "a, b = map(int, input().split())\n\nif a < b:\n print(0)\nelif a == b:\n print(\"infinity\")\nelse:\n solucoes = set()\n for i in range(1, int((a - b) ** 0.5) + 1):\n if (a - b) % i == 0:\n if i > b:\n solucoes.add(i)\n if (a - b) // i > b:\n solucoes.add((a - b) // i)\n print(len(solucoes))\n \n\t\t \t\t\t \t\t\t \t \t \t\t\t\t", "def input_split(f): return map(f, input().split())\n\n\ndef main():\n a, b = input_split(int)\n if a == b: print('infinity')\n elif a < b: print(0)\n else:\n s, a = 0, a - b\n y = int(a ** 0.5)\n for x in range(1, y + 1):\n if a % x == 0:\n if x > b: s += 1\n if a > b * x: s += 1\n if y > b and y * y == a: s -= 1\n print(str(s))\n\nif __name__ == \"__main__\":\n main()\n", "a, b = map(int, input().split())\nif a == b:\n print(\"infinity\")\n exit(0)\na, ans = a - b, 0\nfor i in range(1,a+1):\n if (i * i) > a: break\n if (a % i) != 0: continue\n if (i > b): ans += 1\n if i != (a // i) and (a // i) > b: ans += 1\n\nprint(ans)\n\n \t\t \t \t\t\t\t\t\t\t \t\t\t \t\t \t \t\t\t", "import math\r\nimport sys\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef get_ints(): return 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 = 10**9+7\r\n\r\ndef main():\r\n (a,b) = get_ints()\r\n if a == b:\r\n print(\"infinity\")\r\n elif b > a:\r\n print(0)\r\n else:\r\n n = (a-b)\r\n cnt = 0\r\n for i in range(1,int(math.sqrt(n))+1):\r\n if n%i == 0:\r\n if i > b:\r\n cnt += 1\r\n if n//i != i and (n//i) > b:\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline \r\n\r\na, b = map(int, input().split()) \r\nif(a < b):\r\n print(0) \r\nelif(a == b):\r\n print('infinity') \r\nelse:\r\n d = a - b \r\n c = 0 \r\n for i in range(1, int(d ** 0.5) + 1):\r\n if(d % i == 0):\r\n x, y = i, d // i\r\n if(x == y):\r\n if(x > b):\r\n c += 1\r\n else:\r\n if(x > b):\r\n c += 1 \r\n if(y > b):\r\n c += 1\r\n print(c)", "x = input(\"\").split(\" \")\r\na = int(x[0])\r\nb = int(x[1])\r\nlist = []\r\nanswer = 0\r\nif a == b:\r\n print(\"infinity\")\r\nelse:\r\n value = 1\r\n while value**2 <= a-b:\r\n if (a-b)%value == 0:\r\n list.append(value)\r\n if (value != (a-b)/value):\r\n list.append((a-b)/value)\r\n value = value + 1\r\n for value in list:\r\n if value > b:\r\n answer = answer + 1\r\n \r\n print(answer)", "a,b = map(int, input().split(' '))\nx = 0\ncontador = 0\nif(a == b):\n print(\"infinity\")\nelse:\n x = abs(a - b)\n i = 1\n while(pow(i,2)<x):\n if(x%i == 0):\n if(i>b):\n contador += 1\n if(x/i > b):\n contador += 1\n i += 1\n\n if(pow(i,2) == x and i > b):\n contador += 1\n print(contador)\n \t\t\t\t \t\t\t\t\t\t\t \t\t \t\t \t \t", "from math import floor, sqrt\n\n\ndef main():\n a, b = map(int, input().split())\n if a == b:\n print('infinity')\n elif a < b:\n print(0)\n else:\n res, ab = 0, a - b\n for x in range(1, floor(sqrt(ab)) + 1):\n if not ab % x:\n if x > b:\n res += 1\n if b * x < ab != x * x:\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\na,b = [int(n) for n in input().split()]\nx = 1\nc = 0\nif a == b:\n print('infinity')\n sys.exit(0)\nwhile x ** 2 <= a - b:\n if (a-b) % x == 0:\n if x > b:\n c += 1\n if x ** 2 != a - b and (a-b) / x > b:\n c += 1\n x += 1\nprint(c)\n \t\t\t \t \t\t \t\t \t \t\t\t \t\t\t\t \t", "a, b = map(int, input().split())\nk, val = 1, 0\nwhile k * k <= a - b:\n if (a - b) % k == 0:\n val += sum(1 for x in {k, (a - b) // k} if x > b)\n k += 1\nprint('infinity' if a == b else val)\n", "import math\nprimeiro,segundo = map(int, input().split())\ndiferenca = primeiro-segundo\nsaida = 0\nif(primeiro == segundo):\n print(\"infinity\") \nelif(primeiro < segundo):\n print('0')\nelse:\n limite = int(math.sqrt(diferenca))+1\n for numero in range(1,limite):\n if(diferenca % numero == 0):\n if((numero*numero) != diferenca):\n if((diferenca/numero)>segundo):\n saida += 1\n if(numero>segundo):\n saida += 1\n else:\n if(numero>segundo):\n saida += 1\n print(saida)\n \t\t\t \t \t\t \t \t \t \t \t\t\t", "a, b = map(int, input().split())\n\nif a == b: print(\"infinity\")\n\nelif a < b: print(0)\n\nelse:\n a -= b\n c = 1\n ans = 0\n\n while (c*c) <= a:\n if (a % c) == 0:\n if c > b: ans += 1\n if (a/c) > b and (c*c) != a: ans += 1\n c += 1\n \n print(ans)\n \t\t\t \t \t \t \t \t\t\t \t\t\t\t", "var = input()\na,b = var.split()\na = int(a)\nb = int(b)\nif( a == b ):\n print(\"infinity\")\nelif( a < b ):\n print(0)\nelse:\n a -= b\n i = 1\n result = 0\n while(i*i <= a):\n if(a%i==0):\n if(i > b):\n result += 1\n if(a/i > b and i*i != a):\n result += 1\n i += 1\n print(result)\n\n\t\t \t \t \t\t\t \t\t\t \t \t\t\t", "x,y=map(int,input().split())\r\n\r\nn=x-y\r\nj=n\r\nc=0\r\nif j<0:\r\n print(c)\r\nelif j==0:\r\n print(\"infinity\")\r\nelse:\r\n result_set = set()\r\n sqrtn = int(n**0.5)\r\n for i in range(1,sqrtn+1):\r\n q, r = n/i, n%i\r\n if r == 0:\r\n if(q>y):\r\n result_set.add(q)\r\n if(i>y):\r\n result_set.add(i)\r\n \r\n print ( len(result_set))\r\n \r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n#\n(a, b) = (int(i) for i in input().split())\n\nstart = time.time()\nans = 0\n\nif ( a == b):\n ans = \"infinity\"\nelif (a > b):\n i = 1\n max = (a-b) ** 0.5\n while(i <= max ):\n if (divmod(a-b, i)[1] == 0):\n if i > b:\n ans += 1\n buf = (a-b)//i\n if buf > b and buf != i:\n ans += 1\n i += 1\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "a,b = list(map(int , input().split()))\r\nif(a<b): print(0)\r\nelse:\r\n if a==b:\r\n print('infinity')\r\n elif a>b:\r\n cnt =0\r\n for i in range(1,int((a-b)**0.5)+1):\r\n if(a-b)%i==0:\r\n if(i>b): cnt+=1\r\n if(a-b)/i > b and i*i != (a-b) : cnt+=1\r\n \r\n print(cnt)", "a,b=map(int,input().split())\r\nif a<b:\r\n print(0)\r\nelif a==b:\r\n print(\"infinity\")\r\nelse:\r\n x=a-b\r\n ans=0\r\n for i in range(1,int(x**(0.5))+1):\r\n if x%i==0:\r\n j=x//i\r\n #print(i,j)\r\n if a%i==b:\r\n ans+=1\r\n if a%j==b and i!=j:\r\n ans+=1\r\n print(ans)\r\n ", "from math import sqrt\r\n\r\n\r\ndef factors(n):\r\n \r\n root = sqrt(n)\r\n start = int(root) \r\n if n % 2 == 0:\r\n step = -1 \r\n else:\r\n step = -2 \r\n start = start // 2 * 2 + 1 \r\n if root.is_integer():\r\n yield int(root) \r\n start += step\r\n\r\n for x in range(start, 0, step):\r\n if n % x == 0:\r\n yield x\r\n yield n // x\r\na,b=map(int,input().split())\r\nif(b>a):print(\"0\")\r\nelif(b==a): print(\"infinity\")\r\nelse:\r\n arr=list(factors(a-b))\r\n count=0\r\n for i in arr:\r\n if(i>b):count+=1\r\n print(count)\r\n ", "a, b = map(int, input().split())\n\nif a == b:\n print ('infinity')\nelif b > a:\n print (0)\nelse:\n a -= b\n i = 1\n cont = 0\n\n while (i*i) <= a:\n if (a % i) == 0:\n if i > b:\n cont += 1\n if (a/i) > b and (i*i) != a:\n cont += 1\n i += 1\n print (cont)\n\t \t \t \t\t\t \t \t\t\t\t \t\t \t\t", "import math\n\na, b = map(int, input().split())\ndiff = a - b\n\nif diff == 0:\n print(\"infinity\")\nelif diff < 0:\n print(0)\nelse:\n sqrt_diff = int(math.sqrt(diff))\n div_count = 0\n \n for i in range(1, sqrt_diff + 1):\n if diff % i == 0:\n if i > b:\n div_count += 1\n if i != diff // i and diff // i > b:\n div_count += 1\n \n print(div_count)\n\n \t \t \t\t\t\t \t\t \t \t\t\t", "a,b=map(int,(input().split()))\r\nif(a==b):\r\n print(\"infinity\")\r\nelif(a<b):\r\n print('0')\r\nelse:\r\n ans=0\r\n for j in range(1,a-b+1):\r\n if(j*j>a-b):\r\n break;\r\n if((a-b)/j==j and (a-b)%j==0 and j>b):\r\n ans+=1\r\n elif((a-b)%j==0):\r\n if((a-b)/j>b):\r\n ans+=1\r\n if(j>b):\r\n ans+=1\r\n print(ans)\r\n", "a, b = tuple(map(int, input().split()))\r\nif a == b:\r\n print('infinity')\r\nelif a < b:\r\n print(0)\r\nelse:\r\n a -= b\r\n ans, i = 0, 1\r\n while i ** 2 <= a:\r\n if a % i != 0: i += 1; continue\r\n if i > b: ans += 1\r\n if i == a // i: i += 1; continue\r\n if a // i > b: ans += 1\r\n i += 1\r\n \r\n print(ans)", "\na, b = input().split(' ')\na = int(a)\nb = int(b)\n\nif(a == b):\n print(\"infinity\")\n exit()\n\nans = 0\naux = abs(a-b)\ni = 1\nwhile(i**2 < aux):\n if(aux % i == 0):\n if(i > b):\n ans = ans + 1\n if( int(aux/i) > b):\n ans = ans + 1\n i = i + 1\nif(aux == i*i and i > b):\n ans = ans + 1\nprint(ans)\n\n\t\t\t\t \t\t\t\t\t\t \t\t\t \t \t\t\t \t", "import math\n \na, b = map(int,input().split())\ndiff = a - b\nif diff < 0:\n print(0)\nelif diff == 0:\n print(\"infinity\")\nelse:\n cnt = 0\n for i in range(1, 1 + int(math.sqrt(diff))):\n if diff % i == 0 and i > b:\n cnt += 1\n if diff % i == 0 and diff // i > b and i * i != diff:\n cnt += 1\n print(cnt)\n \t \t \t \t\t\t\t \t \t\t \t\t \t \t\t \t \t\t", "from math import sqrt as S \r\na,b=map(int,input().split())\r\nif a==b:\r\n print('infinity')\r\n exit() \r\nif a<b:\r\n print(0)\r\n exit() \r\ncurr=a-b\r\ndiv=[]\r\nfor i in range(1,int(S(curr))+1):\r\n if curr%i==0:\r\n div.append(i)\r\n if i!=curr//i:\r\n div.append(curr//i)\r\ncnt=0 \r\nfor i in div:\r\n if a%i==b:\r\n cnt+=1 \r\nprint(cnt)\r\n ", "a, b = map(int, input().split())\nif a == b:\n print('infinity')\nelse:\n k, val = 1, 0\n while k * k <= a - b:\n if (a - b) % k == 0:\n val += sum(1 for x in {k, (a - b) // k} if x in range(b + 1, a - b + 1))\n k += 1\n print(val)\n" ]

[ "f = lambda: map(int, input().split())\r\nn, m = f()\r\nh = list(f())[::-1]\r\ndef g(t, m):\r\n t -= n\r\n d = 0\r\n for u in h:\r\n t+=1\r\n if u>d:\r\n if t<1: \r\n return 1\r\n u-=d\r\n d=-u % t\r\n m-=(u + d) // t\r\n if m<0: return 1\r\n else:\r\n d-=u\r\n return 0\r\na,b=0,int(11e13)\r\nwhile b - a > 1:\r\n c=(b+a)//2\r\n if g(c,m):\r\n a=c\r\n else:\r\n b=c\r\nprint(b+1)", "\r\n\r\n# The second line contains n integers a1, a2, ... an (0 ≤ ai ≤ 109)\r\n# where ai represents the number of boxes on i-th pile.\r\n\r\n\r\n# The first line contains two integers n and m (1 ≤ n, m ≤ 105), the number of piles of boxes and the number of GukiZ's students.\r\nNUM_OF_PILES, NUM_OF_STUDENTS = map(int, input().split())\r\n\r\n# a = [0] * n\r\n# s = 0\r\n\r\nboxes = list(map(int, input().split()))\r\ns = sum(boxes)\r\n\r\n# It's guaranteed that at least one pile of is non-empty. So walk to it and remove a box\r\nlower = 2\r\n\r\n# That's a case of only one student working\r\nupper = s + NUM_OF_PILES\r\n\r\nwhile (lower < upper):\r\n # z = lower + upper >> 1\r\n guess = (lower + upper) // 2\r\n b = boxes.copy()\r\n pile = NUM_OF_PILES - 1\r\n for i in range(NUM_OF_STUDENTS):\r\n # walk to a nonempty pile\r\n while (pile >= 0 and b[pile] == 0):\r\n pile -= 1\r\n time = guess - pile - 1\r\n if (time <= 0):\r\n break\r\n # remove all boxes from some piles\r\n while (pile >= 0 and b[pile] <= time):\r\n time -= b[pile]\r\n pile -= 1 # or do it before?\r\n\r\n # remove some boxes in the end\r\n if (pile >= 0):\r\n b[pile] -= time\r\n if (pile < 0):\r\n upper = guess\r\n else:\r\n lower = guess + 1\r\n\r\nprint(upper)\r\n", "# The first line contains two integers n and m (1 ≤ n, m ≤ 105), the number of piles of boxes and the number of GukiZ's students.\r\n# NUM_OF_PILES, NUM_OF_STUDENTS = map(int, input().split())\r\n\r\nNUM_OF_PILES, NUM_OF_STUDENTS = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef test(guess):\r\n students_free, time, pile, b = NUM_OF_STUDENTS, 0, NUM_OF_PILES, 0\r\n while True:\r\n while b == 0:\r\n if pile == 0:\r\n return True\r\n pile -= 1\r\n b = a[pile]\r\n if time == 0:\r\n if students_free == 0:\r\n return False\r\n time = guess - pile - 1\r\n students_free -= 1\r\n d = min(b, time)\r\n b -= d\r\n time -= d\r\n\r\n\r\nl, h = 0, NUM_OF_PILES + sum(a) + 9\r\nwhile h - l > 1:\r\n md = (l + h) // 2\r\n if test(md):\r\n h = md\r\n else:\r\n l = md\r\nprint(h)\r\n", "def solve(a,t):\r\n n=0\r\n while len(a) != 0 and a[-1] == 0:\r\n a.pop()\r\n if len(a) == 0:\r\n return 0\r\n while True:\r\n n += 1\r\n b = t-len(a)\r\n if b <= 0:\r\n return float('inf')\r\n while b != 0:\r\n x = min(a[-1],b)\r\n a[-1] -= x\r\n b -= x\r\n while len(a) != 0 and a[-1] == 0:\r\n a.pop()\r\n if len(a) == 0:\r\n return n\r\nn,m = map(int,input().split())\r\nl, r = 0, int(1e18)\r\na = list(map(int,input().split()))\r\nwhile l < r:\r\n t = (r-l)//2+l\r\n if solve(list(a),t) > m:\r\n l = t+1\r\n else:\r\n r = t\r\nprint(r)" ]

[ "import sys\r\nfrom collections import defaultdict,deque\r\ninp=sys.stdin.readline\r\nn,m,s,t=map(int,inp().split())\r\ns-=1\r\nt-=1\r\ngraph=defaultdict(list)\r\nedges=set()\r\nfor _ in range(m):\r\n u,v=map(int,inp().split())\r\n u-=1\r\n v-=1\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n u,v=min(u,v),max(u,v)\r\n edges.add((u,v))\r\nans=0\r\ndef bfs(start):\r\n dist=[sys.maxsize]*n\r\n dist[start]=0\r\n q=deque()\r\n q.append((start,0))\r\n while q:\r\n node,wt=q.popleft()\r\n for nei in graph[node]:\r\n if wt+1<dist[nei]:\r\n dist[nei]=wt+1\r\n q.append((nei,wt+1))\r\n return dist\r\ndist_s,dist_t=bfs(s),bfs(t)\r\nmmin=dist_s[t]\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if (i,j) not in edges and dist_s[i]+dist_t[j]+1>=mmin and dist_s[j]+dist_t[i]+1>=mmin and (i,j)!=(s,t):\r\n \r\n ans+=1\r\nprint(ans)", "# use BFS to find the shortest from s to every other node in the graph\n# then for each possible pair of junctions that we can connect, add a junction and try to update\n# the shortest costs to all neighbors in a BFS fashion, and if we lower t's cost then add the pair\n\n# or we could do floyd-warshall to find the shortest distance between every junction\n# then if we want to add a junction between a and b, we check if d(s, a) + 1 + d(b, t) < d(s, t)\n\n# or we could do two BFSes, one from s to every node and one from t\n# then we could still do the following formula d(s, a) + 1 + d(b, t) < d(s, t)\n\nimport sys\nfrom collections import deque\n\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\nn, m, s, t = get_ints()\ngraph = [set() for _ in range(n + 1)]\n\nfor i in range(m):\n u, v = get_ints()\n graph[u].add(v)\n graph[v].add(u)\n\ndef BFS(start):\n visited = set()\n dist = [0 for _ in range(n + 1)]\n q = deque()\n q.append(start)\n visited.add(start)\n while len(q) != 0:\n u = q.popleft()\n for v in graph[u]:\n if (v not in visited):\n visited.add(v)\n dist[v] = dist[u] + 1\n q.append(v)\n return dist\n\nd_s = BFS(s)\nd_t = BFS(t)\n\nw = d_s[t]\ncount = 0\nfor u in range(1, n + 1):\n for v in range(u, n + 1):\n if u != v and v not in graph[u]:\n # they are not connected, lets test edge\n w_new = min(d_s[u] + d_t[v], d_s[v] + d_t[u]) + 1\n if w_new >= w:\n count += 1\n\nprint(count)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\n\r\ndef solve(n, m, s, t, arr):\r\n graph = [set() for _ in range(n)]\r\n for u, v in arr:\r\n graph[u - 1].add(v - 1)\r\n graph[v - 1].add(u - 1)\r\n st, ds = s-1, t-1\r\n\r\n # BFS\r\n # O(E + V**2) time and O(E+V) space\r\n distance = {}\r\n\r\n def BFS(idx, stt, dst):\r\n dq = deque([(stt, 0)])\r\n visited = {stt}\r\n while dq:\r\n node, dis = dq.popleft()\r\n if node not in distance:\r\n distance[node] = [n, n]\r\n distance[node][idx] = min(dis, distance[node][idx])\r\n for nei in graph[node]:\r\n if nei not in visited:\r\n dq.append((nei, dis+1))\r\n visited.add(nei)\r\n\r\n BFS(0, st, ds)\r\n BFS(1, ds, st)\r\n ans = 0\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if j in graph[i]:\r\n continue\r\n if 1 + min(distance[i][0] + distance[j][1], distance[i][1] + distance[j][0]) >= distance[ds][0]:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nn, m, s, t = map(int, input().split())\r\narr = []\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n arr.append([u, v])\r\nsolve(n, m, s, t, arr)\r\n", "from collections import deque\r\n\r\n[n, m, s, t] = [int(val) for val in input().split()]\r\ngraph = [[] for i in range(n + 1)]\r\n\r\nfor _ in range(m):\r\n [u, v] = [int(val) for val in input().split()]\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\ncostStart = [0] * (n + 1)\r\ncostEnd = costStart.copy()\r\n\r\ndef bfs(x, cost):\r\n queue = deque([x])\r\n while queue:\r\n current = queue.pop()\r\n for neighbor in graph[current]:\r\n if not cost[neighbor]:\r\n cost[neighbor] = cost[current] + 1\r\n queue.appendleft(neighbor)\r\n cost[x] = 0\r\n\r\nbfs(s, costStart)\r\nbfs(t, costEnd)\r\n\r\nnodes = 0\r\nminimum = 0\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n minimum = min(costStart[i] + costEnd[j] + 1, costStart[j] + costEnd[i] + 1)\r\n if minimum >= costStart[t]:\r\n nodes += 1\r\n\r\nprint(nodes - m)", "from sys import stdin\r\ninput=stdin.readline\r\n\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\n\r\nn,m,s,t=map(int,input().split())\r\ng=defaultdict(list)\r\n\r\nfor _ in range(m):\r\n\tu,v=map(int,input().split())\r\n\tg[u].append(v);g[v].append(u)\r\n\t\r\ndef ehbrute(g,s):\r\n\tq=deque([(s,0)])\r\n\tdis=[float('inf')]*(len(g)+1)\r\n\tvis=set()\r\n\twhile q:\r\n\t\tcn,cd=q.popleft()\r\n\t\tvis.add(cn)\r\n\t\tdis[cn]=min(dis[cn],cd)\r\n\t\tfor nn in g[cn]:\r\n\t\t\tif nn not in vis:\r\n\t\t\t\tq.append((nn,cd+1))\r\n\treturn dis\r\n\r\ndt=ehbrute(g,t)\r\nds=ehbrute(g,s)\r\nref=ds[t]\r\n\r\nres=0\r\nfor nu in range(1,n+1):\r\n\tfor nv in range(nu+1,n+1):\r\n\t\tif min(dt[nv]+ds[nu]+1,dt[nu]+ds[nv]+1)>=ref and nu not in g[nv]:\r\n\t\t\tres+=1\r\nprint(res)\t\t\t", "from collections import defaultdict\r\ndef bfs(start,g,n):\r\n d=[-1]*n\r\n d[start]=0\r\n q=[start]\r\n while q:\r\n t=q.pop(0)\r\n for i in g[t]:\r\n if d[i]==-1:\r\n d[i]=d[t]+1\r\n q.append(i)\r\n return d\r\nn,m,s,t=map(int,input().strip().split())\r\ng=defaultdict(list)\r\ns-=1\r\nt-=1\r\nfor i in range(m):\r\n x,y=map(lambda s:int(s)-1,input().strip().split())\r\n g[x].append(y)\r\n g[y].append(x)\r\nS=bfs(s,g,n)\r\nT=bfs(t,g,n)\r\ndist=T[s]\r\nans=0\r\n# print(\"dist \",dist)\r\nfor u in range(n):\r\n for v in range(u):\r\n if S[u]+T[v]+1<dist or T[u]+S[v]+1<dist:\r\n # print(u+1,v+1,S[u] + T[v] , T[u] + S[v] )\r\n pass\r\n else:\r\n # print(f\"u {u+1} V {v+1} {v in g[u]}\")\r\n if v not in g[u]:\r\n ans+=1\r\nprint(ans)\r\n", "read = lambda:map(int,input().split())\r\nn,m,s,t = read()\r\ndis1 = [0] * (n + 1)\r\ndis2 = dis1 + []\r\ng = [[]for _ in range(n + 1)]\r\nfor _ in range(m):\r\n u,v = read()\r\n g[u].append(v)\r\n g[v].append(u)\r\ndef bfs(x,lst):\r\n q = [x]\r\n while q:\r\n cur = q.pop()\r\n for y in g[cur]:\r\n if lst[y] == 0:\r\n lst[y] = lst[cur] + 1\r\n q.insert(0,y)\r\n lst[x] = 0\r\nbfs(s,dis1);bfs(t,dis2);\r\nmin_dis = dis1[t]\r\nres = 0\r\nfor i in range(1,n + 1):\r\n for j in range(i + 1,n + 1):\r\n d1 = dis1[i] + dis2[j]\r\n d2 = dis1[j] + dis2[i]\r\n if min(d1,d2) >= min_dis - 1:\r\n res += 1\r\nprint(res - m)", "n, m, s, t = list(map(int, input().split(\" \")))\r\ns -= 1\r\nt -= 1\r\nG = [[] for i in range(n)]\r\nM = [[False for i in range(n)] for j in range(n)]\r\nfor i in range(m):\r\n a, b = input().split(\" \")\r\n\r\n a = int(a)-1\r\n b = int(b)-1\r\n\r\n G[a].append(b)\r\n G[b].append(a)\r\n M[a][b] = M[b][a] = True\r\n\r\nfrom collections import deque as dq\r\nfrom math import inf\r\n\r\ndef bfs(G, visited, s):\r\n q = dq([s])\r\n visited[s] = 0\r\n\r\n while len(q) != 0:\r\n top = q.popleft()\r\n \r\n for i in G[top]:\r\n if visited[i] == inf:\r\n visited[i] = visited[top]+1\r\n q.append(i)\r\n\r\ndist_s = [inf for i in range(n)]\r\nbfs(G, dist_s, s)\r\nmx_depth = dist_s[t]\r\ndist_t = [inf for i in range(n)]\r\nbfs(G, dist_t, t)\r\nans = 0\r\nfor u in range(n):\r\n for v in range(u+1, n):\r\n if dist_s[u]+dist_t[v]+1 >= mx_depth and dist_s[v]+dist_t[u]+1 >= mx_depth and not M[u][v]:\r\n ans += 1\r\n M[u][v] = M[v][u] = True\r\n\r\nprint(ans)\r\n\r\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(x):\r\n q = deque()\r\n q.append(x)\r\n dist = [-1] * (n + 1)\r\n dist[x] = 0\r\n while q:\r\n i = q.popleft()\r\n di = dist[i]\r\n for j in G[i]:\r\n if dist[j] == -1:\r\n dist[j] = di + 1\r\n q.append(j)\r\n return dist\r\n\r\nn, m, s, t = map(int, input().split())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\ndist1 = bfs(s)\r\ndist2 = bfs(t)\r\nd = dist1[t]\r\nans = n * (n - 1) // 2 - m\r\nfor i in range(1, n + 1):\r\n di1, di2 = dist1[i], dist2[i]\r\n for j in range(i + 1, n + 1):\r\n dj1, dj2 = dist1[j], dist2[j]\r\n if min(di1 + dj2, di2 + dj1) + 1 < d:\r\n ans -= 1\r\nprint(ans)", "n, m, s, t = map(int, input().split())\r\nadj = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n\tx, y = map(int, input().split())\r\n\tadj[x] += [y]\r\n\tadj[y] += [x]\r\nds = [0 for i in range(n+1)]\r\ndt = [0 for i in range(n+1)]\r\n\r\nq = [s]\r\nwhile (len(q) != 0):\r\n\tcur = q.pop(0)\r\n\tfor i in adj[cur]:\r\n\t\tif ds[i] == 0:\r\n\t\t\tds[i] = ds[cur] + 1\r\n\t\t\tq += [i]\r\nds[s] = 0\r\n\r\nq = [t]\r\n\r\nwhile (len(q) != 0):\r\n\tcur = q.pop(0)\r\n\tfor i in adj[cur]:\r\n\t\tif dt[i] == 0:\r\n\t\t\tdt[i] = dt[cur] + 1\r\n\t\t\tq += [i]\r\ndt[t] = 0\r\nans = 0\r\nfor i in range(1, n+1):\r\n\tfor j in range(i+1, n+1):\r\n\t\tif i in adj[j]:\r\n\t\t\tcontinue\r\n\t\ta = min(ds[i] + dt[j] + 1, dt[i] + ds[j] + 1)\r\n\t\tif (a >= ds[t]):\r\n\t\t\tans += 1\r\nprint(ans)", "import sys\r\nimport math\r\nfrom collections import deque\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nmod = 10 ** 9 + 7\r\n\r\n\r\ndef compute_modulo(p, q):\r\n modulo = 10 ** 9 + 7\r\n inverse_q = pow(q, modulo - 2, modulo) # Compute the modular inverse of q\r\n result = (p * inverse_q) % modulo\r\n return result\r\n\r\n\r\ndef bfs(start):\r\n dist=[sys.maxsize]*n\r\n dist[start]=0\r\n q=deque()\r\n q.append((start,0))\r\n while q:\r\n node,wt=q.popleft()\r\n for nei in graph[node]:\r\n if wt+1<dist[nei]:\r\n dist[nei]=wt+1\r\n q.append((nei,wt+1))\r\n return dist\r\n\r\n\r\n\r\n\r\nfor _ in range(1):\r\n n, m, s, t = map(int, input().split())\r\n graph=[[] for _ in range(n)]\r\n for _ in range(m):\r\n u,v=map(int,input().split())\r\n u,v=u-1,v-1\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n dis1, dis2, res = bfs(s-1), bfs( t-1), 0\r\n for u in range(n):\r\n for v in range(u+1,n):\r\n if dis1[u]+1+dis2[v]>=dis1[t-1] and v not in graph[u] and dis1[v]+1+dis2[u]>=dis1[t-1]:res+=1\r\n print(res)\r\n\r\n\r\n\r\n", "rd = lambda: map(int, input().split())\r\nn, m, s, t = rd()\r\na = [0] * (n + 1)\r\nb = a + []\r\nG = [[] for i in range(n + 1)]\r\nfor i in range(m):\r\n u, v = rd()\r\n G[u].append(v)\r\n G[v].append(u)\r\ndef bfs(x, a):\r\n q = [x]\r\n while q:\r\n c = q.pop()\r\n for y in G[c]:\r\n if not a[y]:\r\n a[y] = a[c] + 1\r\n q.insert(0, y)\r\n a[x] = 0\r\nbfs(s, a)\r\nbfs(t, b)\r\nprint(sum(min(a[i] + b[j], a[j] + b[i]) > a[t] - 2 for i in range(1, n + 1) for j in range(i + 1, n + 1)) - m)", "from heapq import *\r\nn,m,s,t=map(int,input().split())\r\ninf=10**18\r\np={}\r\nl={}\r\nw={}\r\nfor i in range(1,n+1):\r\n p[i]=i\r\n l[i]=inf\r\n w[i]=set()\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n w[x].add(y)\r\n w[y].add(x)\r\nq=[(0,s)]\r\nl[s]=0\r\nheapify(q)\r\nwhile q:\r\n a=heappop(q)[1]\r\n for i in w[a]:\r\n if i!=p[a] and l[i]>l[a]+1:\r\n p[i]=a\r\n l[i]=l[a]+1\r\n heappush(q,(l[i],i))\r\np={}\r\nlt={}\r\nfor i in range(1,n+1):\r\n p[i]=i\r\n lt[i]=inf\r\nq=[(0,t)]\r\nlt[t]=0\r\nheapify(q)\r\nwhile q:\r\n a=heappop(q)[1]\r\n for i in w[a]:\r\n if i!=p[a] and lt[i]>lt[a]+1:\r\n p[i]=a\r\n lt[i]=lt[a]+1\r\n heappush(q,(lt[i],i))\r\nans=n*(n-1)//2-m\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if l[i]+lt[j]+1<l[t] or l[j]+lt[i]+1<l[t]:\r\n ans-=1\r\nprint(ans)", "from collections import defaultdict, deque\n\nvertices, edges, start, end = map(int, input().split())\ngraph = defaultdict(list)\nfor i in range(edges):\n\ts, e = map(int, input().split())\n\tgraph[s].append(e)\n\tgraph[e].append(s)\n\ndef bfs(graph, start):\n\tqueue = deque([start])\n\tvisited = {node: False for node in graph}\n\tdistance = {node: float('inf') for node in graph}\n\tvisited[start] = True\n\tdistance[start] = 0\n\twhile queue:\n\t\tnode = queue.popleft()\n\t\tfor neighbor in graph[node]:\n\t\t\tif not visited[neighbor]:\n\t\t\t\tqueue.append(neighbor)\n\t\t\t\tvisited[neighbor] = True\n\t\t\t\tdistance[neighbor] = distance[node] + 1\n\treturn distance\n\nvalid_pairs = 0\nstart_distances = bfs(graph, start)\nend_distances = bfs(graph, end)\npath_len = start_distances[end]\nroads = set()\nfor node in graph:\n\tfor neighbor in graph[node]:\n\t\troads.add((min(node, neighbor), max(node, neighbor)))\n\nfor u in range(1, vertices + 1):\n\tfor v in range(u + 1, vertices + 1):\n\t\tif (u, v) not in roads and (v, u) not in roads:\n\t\t\tif start_distances[u] + end_distances[v] + 1 >= path_len and start_distances[v] + end_distances[u] + 1 >= path_len:\n\t\t\t\tvalid_pairs += 1\nprint(valid_pairs)\n", "from collections import deque\n\n\ndef bfshortest(value):\n visitado = [0 for i in range(n)]\n#para ser cero based\n\n visitado[value] = 1\n d = [0 for i in range(n)]\n \n d[value] = 0\n q = deque()\n q.appendleft(value)\n #metemos la s\n\n while(q):\n #accedes al valor ultimo del queue\n v = q.pop()\n\n for friends in adj[v]:\n #por cada amigo\n if not visitado[friends]:\n #si no lo visitaste\n visitado[friends] = 1\n #visitalo\n \n q.appendleft(friends)\n #checalo en el queue\n \n d[friends] = d[v] + 1\n #agregale la distancia\n \n return d\n\n\nn,m,s,t = [int(x) for x in input().split()]\nadj = [[] for i in range(n)]\ndirecto = [ [False for i in range(n) ] for j in range(n)]\n\nfor i in range(m):\n a,b = [int(x) for x in input().split()]\n #di si se contectan directo\n adj[a-1].append(b-1)\n adj[b-1].append(a-1)\n directo[a-1][b-1] = True\n directo[b-1][a-1] = True\n\n\n\n\nds = bfshortest(s-1)\ndt = bfshortest(t-1)\nsuma = 0\n\nfor u in range(n):\n for v in range(u+1, n):\n if not directo[u - 1][v - 1]:\n if ds[u - 1] + dt[v - 1] + 1 >= ds[t - 1] and ds[v - 1] + dt[u - 1] +1 >= ds[t-1]:\n suma+=1\n#bfs para saber si estan conectados\n\n\nprint(suma)\n\n\t\t \t\t \t \t\t \t \t\t\t \t \t\t \t\t", "import sys\r\nimport math\r\nfrom bisect import bisect_right as br\r\nfrom collections import deque\r\n#from decimal import Decimal \r\n \r\n#from statistics import mode\r\n \r\nfrom itertools import combinations as cb\r\n \r\ndef int_arr(): return list(map(int, sys.stdin.readline().strip().split()))\r\n \r\ndef str_arr(): return list(map(str, sys.stdin.readline().strip().split()))\r\n \r\ndef input(): return sys.stdin.readline().strip()\r\n \r\n \r\n\r\n\r\n# sys.stdin = open('Fight Against Traffic/input.txt', 'r')\r\n# sys.stdout = open('Fight Against Traffic/output.txt', 'w')\r\n\r\n\r\nn,r,s,e=int_arr()\r\nalready=set()\r\n\r\n\r\n\r\ndist_s=[float('inf') for i in range(n+1)]\r\ndist_e=[float('inf') for i in range(n+1)]\r\n\r\npair=[[] for i in range(n+1)]\r\n\r\nfor i in range(r):\r\n a,b=int_arr()\r\n pair[a].append(b)\r\n pair[b].append(a)\r\n already.add((a,b))\r\n already.add((b,a))\r\n\r\n\r\ndef bfs(start,dist):\r\n q=deque()\r\n q.append(start)\r\n dist[start]=0\r\n visited.add(start)\r\n\r\n while len(q)>0:\r\n val=q.popleft()\r\n d=dist[val]\r\n for i in pair[val]:\r\n if i not in visited:\r\n visited.add(i)\r\n dist[i]= d+1\r\n q.append(i)\r\n \r\nvisited=set()\r\n \r\nbfs(s,dist_s)\r\nvisited=set()\r\nbfs(e,dist_e)\r\n\r\n\r\nmn=float(('inf'))\r\nfor i in range(1,n+1):\r\n mn=min(mn,dist_s[i]+dist_e[i])\r\n\r\n\r\nans=0\r\n\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if (i,j) not in already and (i!=s or j!=e ):\r\n\r\n already.add((i,j))\r\n already.add((j,i))\r\n \r\n if min(dist_s[i]+dist_e[j], dist_s[j]+dist_e[i])+1>=mn:\r\n ans+=1\r\n \r\nprint(ans)\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from queue import Queue\r\nfrom typing import Iterable, Tuple, List\r\nnodes, roads, home, work = map(int, input().split())\r\nhome, work = home-1, work-1\r\nadj = [[] for _ in range(nodes)]\r\nfor _ in range(roads):\r\n a,b = map(int, input().split())\r\n a,b = a-1,b-1\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\n\r\ndef bfs(node: int) -> Iterable[Tuple[int, int]]: # (node, distance)\r\n visited = [False] * nodes\r\n visited[node] = True\r\n q = Queue()\r\n q.put((node, 0))\r\n while not q.empty():\r\n node, dist = q.get()\r\n yield (node, dist)\r\n for next_node in adj[node]:\r\n if visited[next_node]:\r\n continue\r\n visited[next_node] = True\r\n q.put((next_node, dist + 1))\r\n\r\ndef distance(node: int) -> List[int]:\r\n out = [0] * nodes\r\n for n, dist in bfs(node):\r\n out[n] = dist\r\n return out\r\n\r\ndistance_from_home = distance(home)\r\ndistance_from_work = distance(work)\r\n\r\ndef cartezian_product(n: int) -> Iterable[Tuple[int, int]]:\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n yield (i,j)\r\n \r\ninitial_distance = distance_from_home[work]\r\nans = sum(min(distance_from_home[i] + 1 + distance_from_work[j], \\\r\n distance_from_work[i] + 1 + distance_from_home[j]) \\\r\n >= initial_distance \\\r\n for i,j in cartezian_product(nodes) if j not in adj[i])\r\nprint(ans)\r\n\r\n\r\n", "from collections import defaultdict, deque\r\n\r\nn, m, s, t = list(map(int, input().split()))\r\ngraph = defaultdict(set)\r\nfor _ in range(m):\r\n u, v = list(map(int, input().split()))\r\n graph[u - 1].add(v - 1)\r\n graph[v - 1].add(u - 1)\r\n\r\nS = [float('inf')]*n\r\nS[s - 1] = 0\r\nT = [float('inf')]*n\r\nT[t - 1] = 0\r\n\r\nqueue = deque([s - 1])\r\nwhile queue:\r\n node = queue.popleft()\r\n for nei in graph[node]:\r\n if S[node] + 1 < S[nei]:\r\n S[nei] = S[node] + 1\r\n queue.append(nei)\r\n\r\nqueue = deque([t - 1])\r\nwhile queue:\r\n node = queue.popleft()\r\n for nei in graph[node]:\r\n if T[node] + 1 < T[nei]:\r\n T[nei] = T[node] + 1\r\n queue.append(nei)\r\n\r\nminimum = T[s-1]\r\ntotal_count = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and i not in graph[j]:\r\n if S[i] + T[j] + 1 >= minimum and S[j] + T[i] + 1>= minimum:\r\n total_count += 1\r\nprint(total_count//2)", "import itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def bfs(s, m, flag=False):\r\n if flag:\r\n m[s][s] = 0\r\n else:\r\n m[s] = 0\r\n q = [s]\r\n it = 0\r\n\r\n while it < len(q):\r\n f = q[it]\r\n it += 1\r\n for u in g[f]:\r\n if flag:\r\n if m[s][u] == -1:\r\n m[s][u] = m[s][f] + 1\r\n q.append(u)\r\n else:\r\n if m[u] == -1:\r\n m[u] = m[f] + 1\r\n q.append(u)\r\n\r\n n, m, s, t = map(int, input().split())\r\n\r\n g = [set() for i in range(n)]\r\n d = [-1 for i in range(n)]\r\n\r\n for i in range(m):\r\n v, u = map(int, input().split())\r\n v, u = v - 1, u - 1\r\n g[v].add(u)\r\n g[u].add(v)\r\n\r\n bfs(s - 1, d)\r\n\r\n dd = [[-1 for i in range(n)] for j in range(n)]\r\n for i in range(n):\r\n bfs(i, dd, flag=True)\r\n\r\n res = 0\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n if i not in g[j]:\r\n v1 = d[i] + dd[j][t - 1] + 1\r\n v2 = d[j] + dd[i][t - 1] + 1\r\n if d[t - 1] <= min(v1, v2):\r\n res += 1\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n" ]